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.06467
|
Optimizing Information Freshness in Wireless Networks under General
Interference Constraints
|
Age of information (AoI) is a recently proposed metric for measuring
information freshness. AoI measures the time that elapsed since the last
received update was generated. We consider the problem of minimizing average
and peak AoI in a wireless networks, consisting of a set of source-destination
links, under general interference constraints. When fresh information is always
available for transmission, we show that a stationary scheduling policy is peak
age optimal. We also prove that this policy achieves average age that is within
a factor of two of the optimal average age. In the case where fresh information
is not always available, and packet/information generation rate has to be
controlled along with scheduling links for transmission, we prove an important
separation principle: the optimal scheduling policy can be designed assuming
fresh information, and independently, the packet generation rate control can be
done by ignoring interference. Peak and average AoI for discrete time G/Ber/1
queue is analyzed for the first time, which may be of independent interest.
|
cs.IT cs.NI math.IT
|
age of information aoi is a recently proposed metric for measuring information freshness aoi measures the time that elapsed since the last received update was generated we consider the problem of minimizing average and peak aoi in a wireless networks consisting of a set of sourcedestination links under general interference constraints when fresh information is always available for transmission we show that a stationary scheduling policy is peak age optimal we also prove that this policy achieves average age that is within a factor of two of the optimal average age in the case where fresh information is not always available and packetinformation generation rate has to be controlled along with scheduling links for transmission we prove an important separation principle the optimal scheduling policy can be designed assuming fresh information and independently the packet generation rate control can be done by ignoring interference peak and average aoi for discrete time gber1 queue is analyzed for the first time which may be of independent interest
|
[['age', 'of', 'information', 'aoi', 'is', 'a', 'recently', 'proposed', 'metric', 'for', 'measuring', 'information', 'freshness', 'aoi', 'measures', 'the', 'time', 'that', 'elapsed', 'since', 'the', 'last', 'received', 'update', 'was', 'generated', 'we', 'consider', 'the', 'problem', 'of', 'minimizing', 'average', 'and', 'peak', 'aoi', 'in', 'a', 'wireless', 'networks', 'consisting', 'of', 'a', 'set', 'of', 'sourcedestination', 'links', 'under', 'general', 'interference', 'constraints', 'when', 'fresh', 'information', 'is', 'always', 'available', 'for', 'transmission', 'we', 'show', 'that', 'a', 'stationary', 'scheduling', 'policy', 'is', 'peak', 'age', 'optimal', 'we', 'also', 'prove', 'that', 'this', 'policy', 'achieves', 'average', 'age', 'that', 'is', 'within', 'a', 'factor', 'of', 'two', 'of', 'the', 'optimal', 'average', 'age', 'in', 'the', 'case', 'where', 'fresh', 'information', 'is', 'not', 'always', 'available', 'and', 'packetinformation', 'generation', 'rate', 'has', 'to', 'be', 'controlled', 'along', 'with', 'scheduling', 'links', 'for', 'transmission', 'we', 'prove', 'an', 'important', 'separation', 'principle', 'the', 'optimal', 'scheduling', 'policy', 'can', 'be', 'designed', 'assuming', 'fresh', 'information', 'and', 'independently', 'the', 'packet', 'generation', 'rate', 'control', 'can', 'be', 'done', 'by', 'ignoring', 'interference', 'peak', 'and', 'average', 'aoi', 'for', 'discrete', 'time', 'gber1', 'queue', 'is', 'analyzed', 'for', 'the', 'first', 'time', 'which', 'may', 'be', 'of', 'independent', 'interest']]
|
[-0.19871361006445543, 0.09411649990005867, -0.10517477236139627, 0.05536696478864464, -0.07274547033868958, -0.17594833225811735, 0.13096768796969593, 0.4365180702708616, -0.29873873299113446, -0.28566374606881406, 0.13629367012399152, -0.24875039792693923, -0.0951267497505467, 0.1751765291623634, -0.13007366569409937, 0.05404025972735114, 0.06881775478175356, 0.12121440549066827, -0.027847961076975236, -0.2958982830390083, 0.27952041966337826, 0.107063882310012, 0.34241491131073126, 0.07680556253334393, 0.13796399121224148, 0.034499449101190995, -0.02947471078779503, 0.018051495061375978, -0.11517281596712409, 0.055734431450369486, 0.2890890129481905, 0.21201450817255366, 0.3075615403476668, -0.38002261917101093, -0.24352142158424356, 0.13124084599213276, 0.1567274999284854, 0.06986938422314388, -0.05559334362874185, -0.23866332659320735, 0.10887975434049896, -0.17567987458928963, -0.01984552724252632, 0.06330427219462724, 0.0272043455803504, 0.03575747872508514, -0.34547207619640635, 0.0828317513400503, -0.01768761311309195, 0.01744263032965499, -0.08331546274676599, -0.08036673296617196, -0.001145009712767473, 0.20029465407308084, 0.04847664790554936, 0.0336285982048139, 0.11914125745587531, -0.0790890555448853, -0.12420216037326155, 0.33978086897383436, -0.058809563496144364, -0.17663253980911583, 0.06398443892266761, -0.08122170505976659, -0.10913286357546693, 0.11832564132162399, 0.20931300555750088, 0.09675636535876093, -0.22285777426575112, -0.01862748226499402, -0.05073531523369756, 0.19722440266878877, 0.10159279401642642, 0.08565264588194768, 0.15292483757884223, 0.1915016026204692, 0.1639116883532864, 0.1320468262123641, -0.08737651238209379, -0.13067129506312447, -0.23814227708838195, -0.15443813334007753, -0.20205067216127287, 0.0563195323518176, -0.09817331393093637, -0.04507638883428431, 0.36799299139300923, 0.12476548373462072, 0.13928093094852942, 0.11922508210837955, 0.3356021564522404, 0.1666009837349604, 0.04372906144365577, 0.17355331323149562, 0.19580186485238602, 0.05095203206131658, 0.10363345671240869, -0.2023259740968469, 0.18288902067322216, 0.00486950243200444]
|
1,803.06468
|
Rings additively generated by idempotents and nilpotents
|
A ring R is a strongly 2-nil-clean if every element in R is the sum of two
idempotents and a nilpotent that commute. A ring R is feebly clean if every
element in R is the sum of two orthogonal idempotents and a unit. In this
paper, strongly 2-nil-clean rings are studied with an emphasis on their
relations with feebly clean rings. This work shows new interesting connections
between strongly 2-nil-clean rings and weakly exchange rings
|
math.RA
|
a ring r is a strongly 2nilclean if every element in r is the sum of two idempotents and a nilpotent that commute a ring r is feebly clean if every element in r is the sum of two orthogonal idempotents and a unit in this paper strongly 2nilclean rings are studied with an emphasis on their relations with feebly clean rings this work shows new interesting connections between strongly 2nilclean rings and weakly exchange rings
|
[['a', 'ring', 'r', 'is', 'a', 'strongly', '2nilclean', 'if', 'every', 'element', 'in', 'r', 'is', 'the', 'sum', 'of', 'two', 'idempotents', 'and', 'a', 'nilpotent', 'that', 'commute', 'a', 'ring', 'r', 'is', 'feebly', 'clean', 'if', 'every', 'element', 'in', 'r', 'is', 'the', 'sum', 'of', 'two', 'orthogonal', 'idempotents', 'and', 'a', 'unit', 'in', 'this', 'paper', 'strongly', '2nilclean', 'rings', 'are', 'studied', 'with', 'an', 'emphasis', 'on', 'their', 'relations', 'with', 'feebly', 'clean', 'rings', 'this', 'work', 'shows', 'new', 'interesting', 'connections', 'between', 'strongly', '2nilclean', 'rings', 'and', 'weakly', 'exchange', 'rings']]
|
[-0.2704797740167889, 0.1249222266321196, -0.08177538044554622, -0.01712001316972371, -0.04648704780801812, -0.20971673772988939, -0.09111691921747192, 0.4000250382446929, -0.3372637184618629, -0.0843356559788318, 0.105770184231101, -0.32583942710372965, -0.10861296684628255, 0.16941800189057463, -0.05831841896533182, -0.13916913313350002, 0.0811472364370466, 0.1031839391277907, -0.06658821104792878, -0.2821664431524512, 0.333927769017847, 0.008559532818923654, 0.1855901649074727, 0.03855002271369525, 0.03789832221197063, 0.052010205286358926, -0.05601924807553204, 0.05550364843618713, -0.1349309608498228, 0.1381410550032007, 0.2642309346089238, 0.038784891507882426, 0.2181665354322544, -0.34824048255579426, -0.04481484381923158, 0.18109073769301176, 0.14686955613892919, -0.059003972693493494, -0.07284551421119097, -0.1744918852897459, 0.13183145930126652, -0.25637748403670757, -0.0871115830033025, 0.016349636753530877, 0.18556847398806559, 0.06706923078194163, -0.3083062532517177, -0.004936675534975764, 0.13157311540195032, 0.1097330178967432, 0.04041944283648933, -0.049642045420975923, -0.029405223291465325, 0.010253246083218408, -0.06365971106692757, -0.011608682217468557, 0.11014371735233765, -0.04062256166147754, -0.06669005393785865, 0.40673206168177883, -0.08956748363561928, -0.22224749146813624, 0.22159657056296342, -0.22707018138546692, -0.12138669260802042, 0.08585719100052588, 0.022967101166662025, 0.18903790708435209, -0.11475982705719377, 0.2449011913091741, -0.2061969282007531, 0.1259160653357149, 0.02748217565424152, 0.05552105638995081, 0.2797340261504838, 0.10801922236446683, 0.11112606757102951, 0.11194681490183268, 0.04350755808838202, 0.039032169225576674, -0.3264837161098656, -0.1942100677835314, -0.17383000417918848, 0.053952655583424006, -0.04824945182898725, -0.1629838192173721, 0.39804008166844906, 0.04722866813014997, 0.20721358548555718, 0.02328573458975083, 0.24448266350909284, 0.021549363203934933, 0.08591801450453013, 0.10109946411715723, 0.13184531313048578, 0.2438496218406056, -0.04963856775583209, -0.175760340460233, -0.04708775408615015, 0.14239988006087706]
|
1,803.06469
|
Distributed Scheduling Algorithms for Optimizing Information Freshness
in Wireless Networks
|
Age of Information (AoI), measures the time elapsed since the last received
information packet was generated at the source. We consider the problem of AoI
minimization for single-hop flows in a wireless network, under pairwise
interference constraints and time varying channel. We consider simple, yet
broad, class of distributed scheduling policies, in which a transmission is
attempted over each link with a certain attempt probability. We obtain an
interesting relation between the optimal attempt probability and the optimal
AoI of the link, and its neighboring links. We then show that the optimal
attempt probabilities can be computed by solving a convex optimization problem,
which can be done distributively.
|
cs.IT cs.NI math.IT
|
age of information aoi measures the time elapsed since the last received information packet was generated at the source we consider the problem of aoi minimization for singlehop flows in a wireless network under pairwise interference constraints and time varying channel we consider simple yet broad class of distributed scheduling policies in which a transmission is attempted over each link with a certain attempt probability we obtain an interesting relation between the optimal attempt probability and the optimal aoi of the link and its neighboring links we then show that the optimal attempt probabilities can be computed by solving a convex optimization problem which can be done distributively
|
[['age', 'of', 'information', 'aoi', 'measures', 'the', 'time', 'elapsed', 'since', 'the', 'last', 'received', 'information', 'packet', 'was', 'generated', 'at', 'the', 'source', 'we', 'consider', 'the', 'problem', 'of', 'aoi', 'minimization', 'for', 'singlehop', 'flows', 'in', 'a', 'wireless', 'network', 'under', 'pairwise', 'interference', 'constraints', 'and', 'time', 'varying', 'channel', 'we', 'consider', 'simple', 'yet', 'broad', 'class', 'of', 'distributed', 'scheduling', 'policies', 'in', 'which', 'a', 'transmission', 'is', 'attempted', 'over', 'each', 'link', 'with', 'a', 'certain', 'attempt', 'probability', 'we', 'obtain', 'an', 'interesting', 'relation', 'between', 'the', 'optimal', 'attempt', 'probability', 'and', 'the', 'optimal', 'aoi', 'of', 'the', 'link', 'and', 'its', 'neighboring', 'links', 'we', 'then', 'show', 'that', 'the', 'optimal', 'attempt', 'probabilities', 'can', 'be', 'computed', 'by', 'solving', 'a', 'convex', 'optimization', 'problem', 'which', 'can', 'be', 'done', 'distributively']]
|
[-0.2144680038586052, 0.041125217833285675, -0.08667290064557973, 0.07573116505712581, -0.0700029252588542, -0.20456211490090936, 0.1397742777976587, 0.44784371536742484, -0.3442645170467181, -0.2934090907909666, 0.11537192461374043, -0.22688968976338705, -0.1622388568163539, 0.11784064001403749, -0.11782446180263327, 0.11146660011501, 0.05391253468459817, 0.11181818480017008, -0.06538118005307668, -0.2817023213892416, 0.29653621641854344, 0.06537921978074505, 0.3023575627076853, 0.07451131993945671, 0.13766307393692573, 0.03927083780419909, -0.039236422136632934, 0.0349262806455415, -0.160776614138538, 0.08530159228852156, 0.3192208612389449, 0.21937181122807992, 0.30877942104254746, -0.4243904159542311, -0.2452834399882704, 0.16427243002517908, 0.1470978236929686, 0.07306652405532077, -0.011798810060739654, -0.25126951644024637, 0.07131933000400076, -0.2091858939146968, -0.01103553323816784, 0.07902495947631973, -0.014531427106164672, 0.04601773357932904, -0.308462772389046, 0.04347991489016244, -0.029085641882071894, -0.0009416728927236465, -0.07450010865189445, -0.046678742262345085, 0.03859342201354189, 0.20363321155309677, 0.05682530373343508, 0.012936229638634595, 0.08051657769397867, -0.08478669545406269, -0.14187847461154754, 0.34337049035389944, -0.021245355885993276, -0.20807216756252778, 0.10505079420734008, -0.05504589635206179, -0.09920939577838268, 0.1261662843430208, 0.22240839140593177, 0.13029913198961704, -0.21694480862330506, 0.02640999513257864, -0.07408953905622992, 0.14970688913578029, 0.07777319988235831, 0.0528528191951207, 0.17196794468435217, 0.13976463819077858, 0.15974656335526594, 0.15646101445330446, -0.09205280568157495, -0.12737255118338875, -0.23505100637622592, -0.12438541686990195, -0.19636626413557678, 0.04710595528552033, -0.08743286340163818, -0.05607323725362895, 0.387257754371536, 0.11174603451595262, 0.19302707855779402, 0.1329388575374011, 0.32591776868018013, 0.1581591078321691, 0.0008649593003577104, 0.1511707946623641, 0.17341162097916282, 0.0871497992883195, 0.09998365759707263, -0.21280915670407316, 0.14892655182457357, 0.02587099274603167]
|
1,803.0647
|
Twisted Alexander Polynomials of $(-2,3,2n+1)$-Pretzel Knots
|
We calculate the twisted Alexander polynomials of $(-2,3,2n+1)$-pretzel knots
associated to their holonomy representations. As a corollary, we obtain new
supporting evidences of Dunfield, Friedl and Jackson's conjecture, that is, the
twisted Alexander polynomials of hyperbolic knots associated to their holonomy
representations determine the genus and fiberedness of the knots.
|
math.GT
|
we calculate the twisted alexander polynomials of 232n1pretzel knots associated to their holonomy representations as a corollary we obtain new supporting evidences of dunfield friedl and jacksons conjecture that is the twisted alexander polynomials of hyperbolic knots associated to their holonomy representations determine the genus and fiberedness of the knots
|
[['we', 'calculate', 'the', 'twisted', 'alexander', 'polynomials', 'of', '232n1pretzel', 'knots', 'associated', 'to', 'their', 'holonomy', 'representations', 'as', 'a', 'corollary', 'we', 'obtain', 'new', 'supporting', 'evidences', 'of', 'dunfield', 'friedl', 'and', 'jacksons', 'conjecture', 'that', 'is', 'the', 'twisted', 'alexander', 'polynomials', 'of', 'hyperbolic', 'knots', 'associated', 'to', 'their', 'holonomy', 'representations', 'determine', 'the', 'genus', 'and', 'fiberedness', 'of', 'the', 'knots']]
|
[-0.30828120056539776, 0.07349907375872135, -0.15036469962447882, 0.13223877880023793, -0.16088438004255295, -0.1360293239261955, -0.015796105689369143, 0.3459461257047951, -0.28224524229764936, -0.2393758003413677, 0.07104732790961861, -0.21026791721116753, -0.21074029898270966, 0.21450741618871688, -0.16372234327718616, -0.0015557772293686867, 0.03909468334168196, 0.03565858248621225, -0.1130709177092649, -0.2941200213879347, 0.38291360162198546, -0.006966695822775364, 0.1323752761632204, 0.13559614975005388, 0.09051329765468835, -0.08400944149121642, -0.08648920493200421, -0.10644256456755102, -0.19722661747204256, 0.15312933221459388, 0.22474943421781063, 0.03208813460543752, 0.06768780518788844, -0.3332306940818671, -0.08210137855727226, 0.1700485122948885, 0.16854839043691755, -0.046960542858578265, 0.029040663670748472, -0.30430273529142143, 0.0804732352681458, -0.21148112297058105, -0.28366224022582176, -0.1188150223926641, 0.022815439203986897, 0.05504859797656536, -0.12688387563452125, 0.035290079889819026, 0.0538146697729826, 0.10562350787222385, -0.015070794411003589, -0.10490462891757488, -0.08692697469494305, 0.14598885930143296, 0.03347954333294183, 0.08135620664805174, 0.02050419421866536, -0.20387527757324278, -0.2239004185795784, 0.3382947751507163, -0.01218607779359445, -0.19082922104746103, 0.13477104842662813, -0.13411684905644505, -0.25862109012901785, 0.17314799629151822, 0.06684103670530021, 0.13140842646360398, 0.06691926142200827, 0.07285503931110725, -0.21622873717918992, 0.01010761983692646, 0.19153704784810544, -0.040317752468399706, 0.13054053192492573, -0.08899654249660671, -0.02546079320833087, 0.23143798317760228, 0.020958602714817972, 0.002757059186697006, -0.3087683598790318, -0.3379431190341711, -0.10941563346423208, 0.15879790303297342, -0.12573984862247017, -0.21508543156087398, 0.44442651614546774, 0.03453055128455162, 0.14061240423470736, 0.22016600664705038, 0.18818681973963977, 0.04009079948416911, 0.0733617990836501, 0.10070693778805434, 0.08852760460693389, 0.32422883410006764, -0.03707184553146362, -0.11179183066356928, -0.04629455752670765, 0.3055156839359552]
|
1,803.06471
|
Optimizing Age of Information in Wireless Networks with Perfect Channel
State Information
|
Age of information (AoI), defined as the time elapsed since the last received
update was generated, is a newly proposed metric to measure the timeliness of
information updates in a network. We consider AoI minimization problem for a
network with general interference constraints, and time varying channels. We
propose two policies, namely, virtual-queue based policy and age-based policy
when the channel state is available to the network scheduler at each time step.
We prove that the virtual-queue based policy is nearly optimal, up to a
constant additive factor, and the age-based policy is at-most factor 4 away
from optimality. Comparing with our previous work, which derived age optimal
policies when channel state information is not available to the scheduler, we
demonstrate a 4 fold improvement in age due to the availability of channel
state information.
|
cs.IT cs.NI math.IT
|
age of information aoi defined as the time elapsed since the last received update was generated is a newly proposed metric to measure the timeliness of information updates in a network we consider aoi minimization problem for a network with general interference constraints and time varying channels we propose two policies namely virtualqueue based policy and agebased policy when the channel state is available to the network scheduler at each time step we prove that the virtualqueue based policy is nearly optimal up to a constant additive factor and the agebased policy is atmost factor 4 away from optimality comparing with our previous work which derived age optimal policies when channel state information is not available to the scheduler we demonstrate a 4 fold improvement in age due to the availability of channel state information
|
[['age', 'of', 'information', 'aoi', 'defined', 'as', 'the', 'time', 'elapsed', 'since', 'the', 'last', 'received', 'update', 'was', 'generated', 'is', 'a', 'newly', 'proposed', 'metric', 'to', 'measure', 'the', 'timeliness', 'of', 'information', 'updates', 'in', 'a', 'network', 'we', 'consider', 'aoi', 'minimization', 'problem', 'for', 'a', 'network', 'with', 'general', 'interference', 'constraints', 'and', 'time', 'varying', 'channels', 'we', 'propose', 'two', 'policies', 'namely', 'virtualqueue', 'based', 'policy', 'and', 'agebased', 'policy', 'when', 'the', 'channel', 'state', 'is', 'available', 'to', 'the', 'network', 'scheduler', 'at', 'each', 'time', 'step', 'we', 'prove', 'that', 'the', 'virtualqueue', 'based', 'policy', 'is', 'nearly', 'optimal', 'up', 'to', 'a', 'constant', 'additive', 'factor', 'and', 'the', 'agebased', 'policy', 'is', 'atmost', 'factor', '4', 'away', 'from', 'optimality', 'comparing', 'with', 'our', 'previous', 'work', 'which', 'derived', 'age', 'optimal', 'policies', 'when', 'channel', 'state', 'information', 'is', 'not', 'available', 'to', 'the', 'scheduler', 'we', 'demonstrate', 'a', '4', 'fold', 'improvement', 'in', 'age', 'due', 'to', 'the', 'availability', 'of', 'channel', 'state', 'information']]
|
[-0.16181674056031087, 0.035493039389796276, -0.08776969755827277, 0.031026273228538532, -0.08243729459397771, -0.19576758121105808, 0.1522516393188939, 0.4407583480355916, -0.3044653512916907, -0.30742974388930533, 0.1574302581846024, -0.2345197928448518, -0.0979458429247003, 0.1304500630573818, -0.11295564293309494, 0.08096596707624418, 0.07946231674609913, 0.10892478288668725, -0.04670972957413782, -0.2990006011238115, 0.32144141880174476, 0.09677082363309132, 0.31470344115083143, 0.039699998442773464, 0.15703989730251056, -0.00551388933909712, -0.022373750329845482, -0.012938915375033739, -0.13193828135721292, 0.06197804135218676, 0.2777536963733534, 0.20261070964409522, 0.313692278056233, -0.3695689514141392, -0.20896707253737581, 0.09152064891532063, 0.11208891264956307, 0.10354108522318442, -0.0022374319205819455, -0.28448724823279514, 0.096789728032632, -0.1943840228917974, -0.009816999236742655, 0.03079190568532795, -0.004894015344756621, -0.020288429191956916, -0.34880662165513193, 0.05810022717859182, -0.010234382695139006, -0.001397469011997735, -0.0815019089780334, -0.1407148721550281, 0.004709264739088852, 0.18883511570014958, 0.06294319825160696, 0.08394540197267715, 0.147797782736382, -0.1037033472072195, -0.14791027571385104, 0.3083984251720486, -0.06482494745265555, -0.16801103118988167, 0.09265651253733301, -0.07692680545151234, -0.08951317928558974, 0.11339820163255489, 0.20612653278642232, 0.09705388288324078, -0.19047166992569584, 0.010177636512606923, -0.035864790542810054, 0.21029225484019629, 0.045550412684679034, 0.05938106577852051, 0.06150865521695879, 0.20134921689621277, 0.1444094238112922, 0.13828792067727558, -0.07448332015493954, -0.14419189321774023, -0.21994454900699634, -0.12503299388206668, -0.1839876156748721, 0.02998850818872193, -0.0915417022551453, -0.07411886793717579, 0.3656860540586489, 0.14011626689936277, 0.1668845830278264, 0.14885771377443302, 0.33698716616878904, 0.10504822428510696, 0.052875577488534706, 0.20558844587800126, 0.1952733750420588, 0.06263992994057911, 0.11780106657771049, -0.19744674406462798, 0.15492153287416807, 0.014706799998465511]
|
1,803.06472
|
Transversely holomorphic branched Cartan geometry
|
Earlier we introduced and studied the concept of holomorphic {\it branched
Cartan geometry}. We define here a foliated version of this notion; this is
done in terms of Atiyah bundle. We show that any complex compact manifold of
algebraic dimension $d$ admits, away from a closed analytic subset of positive
codimension, a nonsingular holomorphic foliation of complex codimension $d$
endowed with a transversely flat branched complex projective geometry
(equivalently, a ${\mathbb C}P^d$-geometry). We also prove that transversely
branched holomorphic Cartan geometries on compact complex projective rationally
connected varieties and on compact simply connected Calabi-Yau manifolds are
always flat (consequently, they are defined by holomorphic maps into
homogeneous spaces).
|
math.DG math.CV
|
earlier we introduced and studied the concept of holomorphic it branched cartan geometry we define here a foliated version of this notion this is done in terms of atiyah bundle we show that any complex compact manifold of algebraic dimension d admits away from a closed analytic subset of positive codimension a nonsingular holomorphic foliation of complex codimension d endowed with a transversely flat branched complex projective geometry equivalently a mathbb cpdgeometry we also prove that transversely branched holomorphic cartan geometries on compact complex projective rationally connected varieties and on compact simply connected calabiyau manifolds are always flat consequently they are defined by holomorphic maps into homogeneous spaces
|
[['earlier', 'we', 'introduced', 'and', 'studied', 'the', 'concept', 'of', 'holomorphic', 'it', 'branched', 'cartan', 'geometry', 'we', 'define', 'here', 'a', 'foliated', 'version', 'of', 'this', 'notion', 'this', 'is', 'done', 'in', 'terms', 'of', 'atiyah', 'bundle', 'we', 'show', 'that', 'any', 'complex', 'compact', 'manifold', 'of', 'algebraic', 'dimension', 'd', 'admits', 'away', 'from', 'a', 'closed', 'analytic', 'subset', 'of', 'positive', 'codimension', 'a', 'nonsingular', 'holomorphic', 'foliation', 'of', 'complex', 'codimension', 'd', 'endowed', 'with', 'a', 'transversely', 'flat', 'branched', 'complex', 'projective', 'geometry', 'equivalently', 'a', 'mathbb', 'cpdgeometry', 'we', 'also', 'prove', 'that', 'transversely', 'branched', 'holomorphic', 'cartan', 'geometries', 'on', 'compact', 'complex', 'projective', 'rationally', 'connected', 'varieties', 'and', 'on', 'compact', 'simply', 'connected', 'calabiyau', 'manifolds', 'are', 'always', 'flat', 'consequently', 'they', 'are', 'defined', 'by', 'holomorphic', 'maps', 'into', 'homogeneous', 'spaces']]
|
[-0.2541222578419425, 0.08160579430862008, -0.054590072844038225, 0.08606556198389974, -0.16069114898879813, -0.21355219818564636, -0.0883579113168172, 0.3941394581903364, -0.283829858613627, -0.07989224916646065, 0.07325172177450644, -0.21073598923405337, -0.21561079038411518, 0.18332140588105839, -0.18314286099015692, -0.03158454130464625, 0.048845325320280186, 0.07548034628505045, -0.13786255335108874, -0.2944478865987055, 0.5485788278420952, -0.10303815871163785, 0.1965258334432598, 0.08114063203504536, 0.17743708765246824, 0.0009614420645635261, -0.027310098273348862, 0.07116253408124652, -0.17924869126299176, 0.15210453086645803, 0.33910524402962666, 0.047010055186105106, 0.11012995911100618, -0.40318433890798105, -0.20074668940087068, 0.26519286862322106, 0.1359998320673253, -0.0710834555206037, 0.03540780803593415, -0.3053300124288441, 0.06582145541732277, -0.08678353797626968, -0.2730147773008271, -0.10850744593614346, 0.06632175670488451, -0.0193415545993354, -0.11950712807250218, -0.04885199628405874, 0.13518036911742778, 0.12965499334228792, -0.04009159779715761, -0.01933658563544991, -0.1593253015057471, -0.013806122985111427, -0.08397128550710034, 0.148554719539542, 0.1549320792187458, 0.019516108944907646, -0.1100602910383909, 0.28658887298742886, -0.0649478510109203, -0.36893383561520376, 0.10591443272951608, -0.18933415001641227, -0.1966050101800987, 0.19594964714912333, 0.13605341833154452, 0.2222746504627377, -0.0073450796793554434, 0.22962106807727506, -0.13269038877023437, 0.035288043420274404, 0.14508370648651758, -0.0777284179805456, 0.15173951549037734, 0.1275004488938253, 0.1075836301467895, 0.09830348200173439, 0.046468471864534316, -0.07794397245280915, -0.3791308784596274, -0.22077886165755095, -0.07976532772522872, 0.3286568602094444, -0.13889842167922087, -0.21247014203131967, 0.384550040222217, -0.11908881812765498, 0.23726004948752505, 0.11846285644117917, 0.24751481893864052, -0.03088225224751666, 0.041201183507131915, 0.10722410304593706, 0.10735351878227056, 0.25399516449988796, -0.05705130346245611, -0.029971059004854514, -0.09603835973958268, 0.2009832249414698]
|
1,803.06473
|
Variational Inference as an alternative to MCMC for parameter estimation
and model selection
|
Most applications of Bayesian Inference for parameter estimation and model
selection in astrophysics involve the use of Monte Carlo techniques such as
Markov Chain Monte Carlo (MCMC) and nested sampling. However, these techniques
are time consuming and their convergence to the posterior could be difficult to
determine. In this work, we advocate Variational inference as an alternative to
solve the above problems, and demonstrate its usefulness for parameter
estimation and model selection in Astrophysics. Variational inference converts
the inference problem into an optimization problem by approximating the
posterior from a known family of distributions and using Kullback-Leibler
divergence to characterize the difference. It takes advantage of fast
optimization techniques, which make it ideal to deal with large datasets and
makes it trivial to parallelize on a multicore platform. We also derive a new
approximate evidence estimation based on variational posterior, and importance
sampling technique called posterior weighted importance sampling for the
calculation of evidence (PWISE), which is useful to perform Bayesian model
selection. As a proof of principle, we apply variational inference to five
different problems in astrophysics, where Monte Carlo techniques were
previously used. These include assessment of significance of annual modulation
in the COSINE-100 dark matter experiment, measuring exoplanet orbital
parameters from radial velocity data, tests of periodicities in measurements of
Newton's constant $G$, assessing the significance of a turnover in the spectral
lag data of GRB 160625B and estimating the mass of a galaxy cluster using weak
gravitational lensing. We find that variational inference is much faster than
MCMC and nested sampling techniques for most of these problems while providing
competitive results. All our analysis codes have been made publicly available.
|
astro-ph.IM hep-ex physics.data-an
|
most applications of bayesian inference for parameter estimation and model selection in astrophysics involve the use of monte carlo techniques such as markov chain monte carlo mcmc and nested sampling however these techniques are time consuming and their convergence to the posterior could be difficult to determine in this work we advocate variational inference as an alternative to solve the above problems and demonstrate its usefulness for parameter estimation and model selection in astrophysics variational inference converts the inference problem into an optimization problem by approximating the posterior from a known family of distributions and using kullbackleibler divergence to characterize the difference it takes advantage of fast optimization techniques which make it ideal to deal with large datasets and makes it trivial to parallelize on a multicore platform we also derive a new approximate evidence estimation based on variational posterior and importance sampling technique called posterior weighted importance sampling for the calculation of evidence pwise which is useful to perform bayesian model selection as a proof of principle we apply variational inference to five different problems in astrophysics where monte carlo techniques were previously used these include assessment of significance of annual modulation in the cosine100 dark matter experiment measuring exoplanet orbital parameters from radial velocity data tests of periodicities in measurements of newtons constant g assessing the significance of a turnover in the spectral lag data of grb 160625b and estimating the mass of a galaxy cluster using weak gravitational lensing we find that variational inference is much faster than mcmc and nested sampling techniques for most of these problems while providing competitive results all our analysis codes have been made publicly available
|
[['most', 'applications', 'of', 'bayesian', 'inference', 'for', 'parameter', 'estimation', 'and', 'model', 'selection', 'in', 'astrophysics', 'involve', 'the', 'use', 'of', 'monte', 'carlo', 'techniques', 'such', 'as', 'markov', 'chain', 'monte', 'carlo', 'mcmc', 'and', 'nested', 'sampling', 'however', 'these', 'techniques', 'are', 'time', 'consuming', 'and', 'their', 'convergence', 'to', 'the', 'posterior', 'could', 'be', 'difficult', 'to', 'determine', 'in', 'this', 'work', 'we', 'advocate', 'variational', 'inference', 'as', 'an', 'alternative', 'to', 'solve', 'the', 'above', 'problems', 'and', 'demonstrate', 'its', 'usefulness', 'for', 'parameter', 'estimation', 'and', 'model', 'selection', 'in', 'astrophysics', 'variational', 'inference', 'converts', 'the', 'inference', 'problem', 'into', 'an', 'optimization', 'problem', 'by', 'approximating', 'the', 'posterior', 'from', 'a', 'known', 'family', 'of', 'distributions', 'and', 'using', 'kullbackleibler', 'divergence', 'to', 'characterize', 'the', 'difference', 'it', 'takes', 'advantage', 'of', 'fast', 'optimization', 'techniques', 'which', 'make', 'it', 'ideal', 'to', 'deal', 'with', 'large', 'datasets', 'and', 'makes', 'it', 'trivial', 'to', 'parallelize', 'on', 'a', 'multicore', 'platform', 'we', 'also', 'derive', 'a', 'new', 'approximate', 'evidence', 'estimation', 'based', 'on', 'variational', 'posterior', 'and', 'importance', 'sampling', 'technique', 'called', 'posterior', 'weighted', 'importance', 'sampling', 'for', 'the', 'calculation', 'of', 'evidence', 'pwise', 'which', 'is', 'useful', 'to', 'perform', 'bayesian', 'model', 'selection', 'as', 'a', 'proof', 'of', 'principle', 'we', 'apply', 'variational', 'inference', 'to', 'five', 'different', 'problems', 'in', 'astrophysics', 'where', 'monte', 'carlo', 'techniques', 'were', 'previously', 'used', 'these', 'include', 'assessment', 'of', 'significance', 'of', 'annual', 'modulation', 'in', 'the', 'cosine100', 'dark', 'matter', 'experiment', 'measuring', 'exoplanet', 'orbital', 'parameters', 'from', 'radial', 'velocity', 'data', 'tests', 'of', 'periodicities', 'in', 'measurements', 'of', 'newtons', 'constant', 'g', 'assessing', 'the', 'significance', 'of', 'a', 'turnover', 'in', 'the', 'spectral', 'lag', 'data', 'of', 'grb', '160625b', 'and', 'estimating', 'the', 'mass', 'of', 'a', 'galaxy', 'cluster', 'using', 'weak', 'gravitational', 'lensing', 'we', 'find', 'that', 'variational', 'inference', 'is', 'much', 'faster', 'than', 'mcmc', 'and', 'nested', 'sampling', 'techniques', 'for', 'most', 'of', 'these', 'problems', 'while', 'providing', 'competitive', 'results', 'all', 'our', 'analysis', 'codes', 'have', 'been', 'made', 'publicly', 'available']]
|
[-0.02523639219243339, 0.03650747549955924, -0.11192067885334729, 0.15219343349682132, -0.1403596369428526, -0.13338789527881004, 0.06288393496918653, 0.4208026477869177, -0.2744729933635956, -0.37059476977937444, 0.12740145184162785, -0.2260564287251114, -0.08938360538234723, 0.2483621603918463, -0.03148975813225758, 0.11204833725118504, 0.13078334067919165, -0.045902358482322304, -0.09335113495448434, -0.2323944306379737, 0.2358752953992208, 0.10153497143344947, 0.2772643974569205, -0.02189058124602878, 0.13060129628833997, 0.029988176728370206, -0.0736304583913227, -0.012153757719029655, -0.18039218032994966, 0.13782504020896724, 0.278783368936061, 0.20735840498612199, 0.33425555796014494, -0.36229200313130444, -0.2329660149891571, 0.1341782556620197, 0.17350319430962097, 0.11979965958536402, -0.041755064689526986, -0.2728343179565428, 0.02784968875416797, -0.1834773818637976, -0.06528938328165002, -0.13869490255362904, -0.04493398439896467, 0.0187814589157008, -0.2933768906320135, 0.10393786731663487, -0.005243018056537219, 0.06362871086095279, -0.013858112207641177, -0.1584806064136954, 0.03127420354752218, 0.07502314214331982, 0.07600732152384361, 0.021943045539556297, 0.10330897677628385, -0.10383724448724817, -0.1492795176431366, 0.35286460084488425, -0.03494278026874571, -0.1936088251094965, 0.17040534918332956, -0.06914778706368618, -0.2204162340983066, 0.11907572646185265, 0.19638009180635513, 0.14856100249557924, -0.1734337898418171, 0.06576501813353869, 0.01956304159499841, 0.15059226341102094, 0.0005960055838437963, -0.027630593692881716, 0.17903332564520955, 0.19174219330435024, 0.08835986772835282, 0.12587633215943386, -0.1679444337355812, -0.13538169248998438, -0.24142747312944532, -0.14726843692075747, -0.22544731802243959, -0.005306715000721015, -0.132536568978589, -0.20166299766059215, 0.33968725873604283, 0.24007301996647878, 0.14699508845354106, 0.08622703418065708, 0.3199460063088726, 0.08684414598132201, 0.04722586428109495, 0.08241169830961596, 0.2266558612591925, 0.1516855246120477, 0.02978201914065255, -0.18648800696715398, 0.10120342100114176, 0.03798317337227856]
|
1,803.06474
|
Finite-size scaling with respect to interaction and disorder strength at
the many-body localization transition
|
We present a finite-size scaling for both interaction and disorder strengths
in the critical regime of the many-body localization (MBL) transition for a
spin-1/2 XXZ spin chain with a random field by studying level statistics. We
show how the dynamical transition from the thermal to MBL phase depends on
interaction together with disorder by evaluating the ratio of adjacent level
spacings, and thus, extend previous studies in which interaction coupling is
fixed. We introduce an extra critical exponent in order to describe the
nontrivial interaction dependence of the MBL transition. It is characterized by
the ratio of the disorder strength to the power of the interaction coupling
with respect to the extra critical exponent and not by the simple ratio between
them.
|
cond-mat.dis-nn cond-mat.stat-mech quant-ph
|
we present a finitesize scaling for both interaction and disorder strengths in the critical regime of the manybody localization mbl transition for a spin12 xxz spin chain with a random field by studying level statistics we show how the dynamical transition from the thermal to mbl phase depends on interaction together with disorder by evaluating the ratio of adjacent level spacings and thus extend previous studies in which interaction coupling is fixed we introduce an extra critical exponent in order to describe the nontrivial interaction dependence of the mbl transition it is characterized by the ratio of the disorder strength to the power of the interaction coupling with respect to the extra critical exponent and not by the simple ratio between them
|
[['we', 'present', 'a', 'finitesize', 'scaling', 'for', 'both', 'interaction', 'and', 'disorder', 'strengths', 'in', 'the', 'critical', 'regime', 'of', 'the', 'manybody', 'localization', 'mbl', 'transition', 'for', 'a', 'spin12', 'xxz', 'spin', 'chain', 'with', 'a', 'random', 'field', 'by', 'studying', 'level', 'statistics', 'we', 'show', 'how', 'the', 'dynamical', 'transition', 'from', 'the', 'thermal', 'to', 'mbl', 'phase', 'depends', 'on', 'interaction', 'together', 'with', 'disorder', 'by', 'evaluating', 'the', 'ratio', 'of', 'adjacent', 'level', 'spacings', 'and', 'thus', 'extend', 'previous', 'studies', 'in', 'which', 'interaction', 'coupling', 'is', 'fixed', 'we', 'introduce', 'an', 'extra', 'critical', 'exponent', 'in', 'order', 'to', 'describe', 'the', 'nontrivial', 'interaction', 'dependence', 'of', 'the', 'mbl', 'transition', 'it', 'is', 'characterized', 'by', 'the', 'ratio', 'of', 'the', 'disorder', 'strength', 'to', 'the', 'power', 'of', 'the', 'interaction', 'coupling', 'with', 'respect', 'to', 'the', 'extra', 'critical', 'exponent', 'and', 'not', 'by', 'the', 'simple', 'ratio', 'between', 'them']]
|
[-0.19525597717414503, 0.24167936281255756, -0.043135354486217754, 0.04090452669989928, 0.007805231360329285, -0.17832905364883148, 0.07204924062367712, 0.33628350958899883, -0.22507342529773225, -0.27327309143166517, 0.0406284054224074, -0.31077381024961587, -0.15073963575691107, 0.10913728162279872, 0.06776413561959492, 0.04006436527668514, -0.0259392181064048, 0.038585165500274445, -0.07669636262886104, -0.173683471143719, 0.36941589461639524, 0.062442120531054794, 0.2981040997537555, 0.12956313436973046, 0.014490046492609822, 0.04139160816786719, 0.0819826540632601, 0.023037885694543174, -0.16639699094516577, 0.05081125320227374, 0.19103434211793965, -0.0342727550419933, 0.21936229537775526, -0.35523650781098814, -0.20542309987816776, 0.0830437030631774, 0.1670447592547194, 0.11167586718582868, -0.012130415535600642, -0.3233703683496865, 0.02542001502893743, -0.1781065282163775, -0.12560215859662466, -0.08321237127815724, 0.033859487223156466, 0.024384534444476736, -0.29490325527006117, 0.1156816392007177, 0.05744862061286857, 0.10135629182284484, -0.0229551025902944, -0.028631678675530386, 0.004135613104511724, 0.16796984071996002, 0.07466611862335293, 0.03490884065271172, 0.12262765315101772, -0.16296733608927394, -0.0879803974349357, 0.34751517696642, -0.07371115909706129, -0.17407239570480879, 0.22850393628716836, -0.1787013488317855, -0.118162493835982, 0.1413872489003373, 0.1343516751314651, 0.022705855004519958, -0.11949579193272063, 0.10223761181295545, 0.05911432617328695, 0.20345084973588037, -0.03304805344192036, 0.02668596701849191, 0.20964478038739962, 0.16086135169140017, 0.06180002797608737, 0.19124570408774938, -0.07145794457016459, -0.15028681476470693, -0.2551428123194053, -0.09208051543720983, -0.24073943875436138, 0.06555540551115152, -0.1494372705925403, -0.17641543914166996, 0.4196772363769715, 0.23457079974731954, 0.2318452632581418, 0.06018867366660967, 0.22547901542780951, 0.17479895027812387, 0.037143313913743516, 0.024653111622653535, 0.27783238431858664, 0.13893003555655967, 0.055988136640765136, -0.3099646618127915, 0.05721634273707378, 0.0877419903007962]
|
1,803.06475
|
Magneto-optical trapping of optically pumped metastable europium
|
We demonstrate laser cooling and magneto-optical trapping of europium. The
atoms are optically pumped to a metastable state and then loaded from an
atomic-beam source via conventional Zeeman slowing and magneto-optical trapping
techniques using a $J=13/2\leftrightarrow J=15/2$ quasi-cyclic transition. The
trapped populations contained up to $1\times 10^7$ atoms, and a two-body loss
rate is estimated as $1\times10^{-10}\,\mathrm{cm^3/s}$ from the
non-exponential loss of atoms at high densities. We also observed leakage out
of the quasi-cyclic transition to the two metastable states with $J=9/2$ and
$11/2$, which is adequate to pump the laser-cooled atoms back to the $J=7/2$
ground state.
|
cond-mat.quant-gas physics.atom-ph
|
we demonstrate laser cooling and magnetooptical trapping of europium the atoms are optically pumped to a metastable state and then loaded from an atomicbeam source via conventional zeeman slowing and magnetooptical trapping techniques using a j132leftrightarrow j152 quasicyclic transition the trapped populations contained up to 1times 107 atoms and a twobody loss rate is estimated as 1times1010mathrmcm3s from the nonexponential loss of atoms at high densities we also observed leakage out of the quasicyclic transition to the two metastable states with j92 and 112 which is adequate to pump the lasercooled atoms back to the j72 ground state
|
[['we', 'demonstrate', 'laser', 'cooling', 'and', 'magnetooptical', 'trapping', 'of', 'europium', 'the', 'atoms', 'are', 'optically', 'pumped', 'to', 'a', 'metastable', 'state', 'and', 'then', 'loaded', 'from', 'an', 'atomicbeam', 'source', 'via', 'conventional', 'zeeman', 'slowing', 'and', 'magnetooptical', 'trapping', 'techniques', 'using', 'a', 'j132leftrightarrow', 'j152', 'quasicyclic', 'transition', 'the', 'trapped', 'populations', 'contained', 'up', 'to', '1times', '107', 'atoms', 'and', 'a', 'twobody', 'loss', 'rate', 'is', 'estimated', 'as', '1times1010mathrmcm3s', 'from', 'the', 'nonexponential', 'loss', 'of', 'atoms', 'at', 'high', 'densities', 'we', 'also', 'observed', 'leakage', 'out', 'of', 'the', 'quasicyclic', 'transition', 'to', 'the', 'two', 'metastable', 'states', 'with', 'j92', 'and', '112', 'which', 'is', 'adequate', 'to', 'pump', 'the', 'lasercooled', 'atoms', 'back', 'to', 'the', 'j72', 'ground', 'state']]
|
[-0.06175462360988604, 0.252018939620181, 0.004381782237032894, 0.01165460503398208, 0.07754873632802628, -0.167652504251843, 0.15136221938882954, 0.432433890857889, -0.24975150858517736, -0.2656374496218632, 0.015950184761701774, -0.3296265801182017, 0.03209220987628214, 0.14212608222927278, 0.031203280027208773, 0.041358346643392, 0.004600627386632065, -0.04828742596631249, -0.07350972784721914, -0.20580837124725804, 0.24098996100171158, 0.06782120582647622, 0.2869497042653772, 0.04620937344346506, 0.1191356887575239, -0.09735525149638609, 0.1654342011800812, -0.09422182489652187, -0.11050619990419364, 0.11538059408667323, 0.22299780147295678, 0.029072027980873827, 0.21930242646097517, -0.4603808706548686, -0.17818519243155606, 0.07945514254485413, 0.16428923253261019, 0.22001743440220403, -0.07984867868556951, -0.33308413430737954, -0.02861535632109735, -0.15757382794496758, -0.0920312059582405, -0.08181455984595232, 0.02896773370836551, 0.02185061311077637, -0.3053985240791614, 0.05410334038818595, 0.04587104124463318, 0.08902301103807986, -0.10368971440038877, -0.08470552097423933, -0.029229920032472972, 0.018319521060523886, -0.03760970629082294, 0.05109245321364142, 0.22267279814210875, -0.06850649208354298, -0.05357645278369697, 0.37608090401045047, -0.13309383588299775, -0.030428389882824074, 0.1847288590433891, -0.16945495933759958, 0.0007187254717185473, 0.23197463531202325, 0.14636065418987224, 0.12162782589439303, -0.10432611123542301, -0.011340023099061606, 0.013774328520715548, 0.2188174371549394, 0.12886145983065944, 0.08918445344170323, 0.22660339439365393, 0.14447851254226407, 0.016848115760997946, 0.2041982358302145, -0.1695942326914519, -0.07921439033816569, -0.20644919072450799, -0.12211217701163453, -0.1957765176969891, 0.098693824596315, -0.0007661807653676078, -0.10193525469609692, 0.34812898831053946, 0.0928443205775693, 0.17853605066920863, -0.06283986534617725, 0.29802546346521314, 0.10985760337280226, 0.05281926673190659, 0.039826999160140986, 0.26210582318041514, 0.19696611542955603, 0.02728520515180814, -0.32881994439594564, -0.013461953014484607, -0.0013960263459011912]
|
1,803.06476
|
PT-Symmetry and Supersymmetry: Interconnection of Broken and Unbroken
Phases
|
The broken and unbroken phases of PT and supersymmetry in optical systems are
explored for a complex refractive index profile in the form of a Scarf
potential, under the framework of supersymmetric quantum mechanics. The
transition from unbroken to the broken phases of PT-symmetry, with the merger
of eigenfunctions near the exceptional point is found to arise from two
distinct realizations of the potential, originating from the underlying
supersymmetry. Interestingly, in PT-symmetric phase, spontaneous breaking of
supersymmetry occurs in a parametric domain, possessing non-trivial shape
invariances, under reparametrization to yield the corresponding energy spectra.
One also observes a parametric bifurcation behaviour in this domain. Unlike the
real Scarf potential, in PT-symmetric phase, a connection between complex
isospectral superpotentials and modified KdV equation occurs, only with certain
restrictive parametric conditions. In the broken PT-symmetry phase,
supersymmetry is found to be intact in the entire parameter domain yielding the
complex energy spectra, with zero-width resonance occurring at integral values
of a potential parameter.
|
quant-ph math-ph math.MP
|
the broken and unbroken phases of pt and supersymmetry in optical systems are explored for a complex refractive index profile in the form of a scarf potential under the framework of supersymmetric quantum mechanics the transition from unbroken to the broken phases of ptsymmetry with the merger of eigenfunctions near the exceptional point is found to arise from two distinct realizations of the potential originating from the underlying supersymmetry interestingly in ptsymmetric phase spontaneous breaking of supersymmetry occurs in a parametric domain possessing nontrivial shape invariances under reparametrization to yield the corresponding energy spectra one also observes a parametric bifurcation behaviour in this domain unlike the real scarf potential in ptsymmetric phase a connection between complex isospectral superpotentials and modified kdv equation occurs only with certain restrictive parametric conditions in the broken ptsymmetry phase supersymmetry is found to be intact in the entire parameter domain yielding the complex energy spectra with zerowidth resonance occurring at integral values of a potential parameter
|
[['the', 'broken', 'and', 'unbroken', 'phases', 'of', 'pt', 'and', 'supersymmetry', 'in', 'optical', 'systems', 'are', 'explored', 'for', 'a', 'complex', 'refractive', 'index', 'profile', 'in', 'the', 'form', 'of', 'a', 'scarf', 'potential', 'under', 'the', 'framework', 'of', 'supersymmetric', 'quantum', 'mechanics', 'the', 'transition', 'from', 'unbroken', 'to', 'the', 'broken', 'phases', 'of', 'ptsymmetry', 'with', 'the', 'merger', 'of', 'eigenfunctions', 'near', 'the', 'exceptional', 'point', 'is', 'found', 'to', 'arise', 'from', 'two', 'distinct', 'realizations', 'of', 'the', 'potential', 'originating', 'from', 'the', 'underlying', 'supersymmetry', 'interestingly', 'in', 'ptsymmetric', 'phase', 'spontaneous', 'breaking', 'of', 'supersymmetry', 'occurs', 'in', 'a', 'parametric', 'domain', 'possessing', 'nontrivial', 'shape', 'invariances', 'under', 'reparametrization', 'to', 'yield', 'the', 'corresponding', 'energy', 'spectra', 'one', 'also', 'observes', 'a', 'parametric', 'bifurcation', 'behaviour', 'in', 'this', 'domain', 'unlike', 'the', 'real', 'scarf', 'potential', 'in', 'ptsymmetric', 'phase', 'a', 'connection', 'between', 'complex', 'isospectral', 'superpotentials', 'and', 'modified', 'kdv', 'equation', 'occurs', 'only', 'with', 'certain', 'restrictive', 'parametric', 'conditions', 'in', 'the', 'broken', 'ptsymmetry', 'phase', 'supersymmetry', 'is', 'found', 'to', 'be', 'intact', 'in', 'the', 'entire', 'parameter', 'domain', 'yielding', 'the', 'complex', 'energy', 'spectra', 'with', 'zerowidth', 'resonance', 'occurring', 'at', 'integral', 'values', 'of', 'a', 'potential', 'parameter']]
|
[-0.1608849352468615, 0.15651808773031492, -0.07003495649156964, 0.06348530075625626, -0.08652140829070061, -0.19154434125893605, 0.00016368015218086495, 0.38574916172934615, -0.24092055780824667, -0.25639915737028446, 0.091393364502279, -0.24466063894956194, -0.1743548836990011, 0.09865813830763287, -0.024934770776572066, 0.07194820562349011, -0.020401006322990387, 0.03593760100048706, -0.11536250584715434, -0.13273995324263568, 0.3236715188973022, -0.0478360743141843, 0.2511612726028384, 0.003636073272657922, 0.059943788300950936, -0.02260635627190704, 0.09060758455679607, -0.07973660995044185, -0.11401507510768932, 0.04872498374941371, 0.2410307484592155, 0.01915320700760468, 0.1343913961285783, -0.399782227271277, -0.2304288011622002, 0.18654937465293392, 0.1453454372131769, 0.1048448960215825, -0.0651469412953911, -0.32779312154613666, 0.020567645376652295, -0.11088354518833737, -0.23072301363861708, -0.04621048952287977, -0.006908634206083435, -0.05484842313511401, -0.2607915169105327, 0.13416812186666638, 0.03628606435998997, 0.08386124366668765, -0.05919413915430398, -0.026076524282707285, -0.13503131174094837, 0.02117388081731078, 0.0836717795395518, -0.04578093999580289, 0.112075993710238, -0.17756292720973169, -0.09306357188080872, 0.4358747745708632, -0.0027106198636456668, -0.17888767833196736, 0.16189268332622622, -0.15719100281972906, -0.14594014807494346, 0.22634080097495768, 0.11838073718147527, 0.0724562747325887, -0.09794372671301135, 0.18264557858126423, 0.038442237898476006, 0.15242413185795, 0.120347926777828, 0.04059418781244005, 0.21338538695936618, 0.11846225044360349, 0.047834369072492486, 0.1530877130746647, -0.006383955640637357, -0.19663114105322346, -0.37199774492670845, -0.08616300528255864, -0.1869754445773798, 0.05776683895368569, -0.10616705861054318, -0.16127723543065953, 0.45990242627854255, 0.06792652312093501, 0.22671551126928896, -0.01565318149283112, 0.19745651130009187, 0.16349621699047015, 0.09187980822825469, -0.009848707089466708, 0.2774180657236102, 0.11205369365901935, 0.13789121481237113, -0.23591119200945687, -0.0803798261960471, 0.053247014731631515]
|
1,803.06477
|
On the homotopy types of $\mathrm{Sp}(n)$ gauge groups
|
Let $\mathcal{G}_{k,n}$ be the gauge group of the principal
$\mathrm{Sp}(n)$-bundle over $S^4$ corresponding to
$k\in\mathbb{Z}\cong\pi_3(\mathrm{Sp}(n))$. We refine the result of Sutherland
on the homotopy types of $\mathcal{G}_{k,n}$ and relate it with the order of a
certain Samelson product in $\mathrm{Sp}(n)$. Then we classify the $p$-local
homotopy types of $\mathcal{G}_{k,n}$ for $(p-1)^2+1\ge 2n$.
|
math.AT
|
let mathcalg_kn be the gauge group of the principal mathrmspnbundle over s4 corresponding to kinmathbbzcongpi_3mathrmspn we refine the result of sutherland on the homotopy types of mathcalg_kn and relate it with the order of a certain samelson product in mathrmspn then we classify the plocal homotopy types of mathcalg_kn for p121ge 2n
|
[['let', 'mathcalg_kn', 'be', 'the', 'gauge', 'group', 'of', 'the', 'principal', 'mathrmspnbundle', 'over', 's4', 'corresponding', 'to', 'kinmathbbzcongpi_3mathrmspn', 'we', 'refine', 'the', 'result', 'of', 'sutherland', 'on', 'the', 'homotopy', 'types', 'of', 'mathcalg_kn', 'and', 'relate', 'it', 'with', 'the', 'order', 'of', 'a', 'certain', 'samelson', 'product', 'in', 'mathrmspn', 'then', 'we', 'classify', 'the', 'plocal', 'homotopy', 'types', 'of', 'mathcalg_kn', 'for', 'p121ge', '2n']]
|
[-0.13223678677589917, 0.07269137343914457, -0.08619485875325543, 0.031186471769244085, -0.060380209189820656, -0.0820258897729218, -0.006577331268665742, 0.31136277884396973, -0.2853298207022706, -0.23633495509168323, 0.12054976711420304, -0.22559650782115606, -0.12841804352189815, 0.17417719677014618, -0.1083971128171804, -0.07433268168408956, -0.024659170826174776, 0.1473323060389684, -0.07856970354534533, -0.28262669887697817, 0.4034090758282311, -0.08449486511930519, 0.18213438650082953, 0.022066826110097523, 0.07736968072321342, 0.05034883904784006, -0.04075158636408801, -0.0014119724676545178, -0.14226780776694722, 0.146272454496321, 0.26181703779314247, 0.07350571652190113, 0.1530164328536817, -0.3510983015733714, -0.10933908455463469, 0.20265125476622156, 0.13145055310629614, -0.002327190350969227, 0.12208875026126222, -0.3219930401299985, 0.1578987968978068, -0.21496687266899614, -0.1292213026234614, -0.08157524325865873, 0.025379510026197045, 0.05686230776945547, -0.21138835200393685, -0.07054496064249959, 0.052496315341214746, 0.0749360226398828, -0.11988971757759549, -0.0690407481766781, -0.06518194503245914, 0.14696098969565058, 0.04685457978321581, 0.01104188493776078, 0.04020010849118841, -0.029438439347990314, -0.14846123679902176, 0.3869757884923293, -0.058401798043038924, -0.182140353050235, 0.15858916495451514, -0.1581244823922004, -0.21096361726902577, 0.12544420547783375, 0.09263750011747589, 0.14004174606608494, 0.002009027257409631, 0.15099693505848966, -0.09716965729484753, 0.10268463116443279, 0.09192574052710314, -0.04512231933827303, 0.1294170172542942, 0.09892086689455473, 0.06959912517317096, 0.14352489751050895, -0.030115610192890982, -0.012862789226049672, -0.3341056375327159, -0.22251930504048967, -0.09169273144964661, 0.13698599185338434, -0.12864401693217103, -0.1644165801568603, 0.4524806436835503, 0.09512324471558843, 0.16615875998549923, 0.14763614569543576, 0.17422622982032446, 0.03158992093664651, 0.0846149603627166, -0.0006085185866270747, 0.14131497283827285, 0.23962360601492075, -0.05249028450248725, -0.1768351362885109, -0.0855381744723691, 0.23059233025248563]
|
1,803.06478
|
Exploring physics beyond the Standard Electroweak Model in the light of
supersymmetry
|
In this thesis we try to discuss certain phenomenological aspects of an
R-parity violating non-minimal supersymmetric model, called $\mu\nu$SSM. We
show that $\mu\nu$SSM can provide a solution to the $\mu$-problem of
supersymmetry and can simultaneously accommodate the existing three flavour
global data from neutrino experiments even at the tree level with the simple
choice of flavour diagonal neutrino Yukawa couplings. We show that it is also
possible to achieve different mass hierarchies for light neutrinos at the tree
level itself. In $\mu\nu$SSM, the effect of R-parity violation together with a
seesaw mechanism with TeV scale right-handed neutrinos are instrumental for
light neutrino mass generation. We also analyze the stability of tree level
neutrino masses and mixing with the inclusion of one-loop radiative
corrections. In addition, we investigate the sensitivity of the one-loop
corrections to different light neutrino mass orderings. Decays of the lightest
supersymmetric particle were also computed and ratio of certain decay branching
ratios was observed to correlate with certain neutrino mixing angle. We extend
our analysis for different natures of the lightest supersymmetric particle as
well as with various light neutrino mass hierarchies. We present estimation for
the length of associated displaced vertices for various natures of the lightest
supersymmetric particle which can act as a discriminating feature at a collider
experiment. We also present an unconventional signal of Higgs boson in
supersymmetry which can lead to a discovery, even at the initial stage of the
large hadron collider running. Besides, we show that a signal of this kind can
also act as a probe to the seesaw scale. Certain other phenomenological issues
have also been addressed.
|
hep-ph hep-ex
|
in this thesis we try to discuss certain phenomenological aspects of an rparity violating nonminimal supersymmetric model called munussm we show that munussm can provide a solution to the muproblem of supersymmetry and can simultaneously accommodate the existing three flavour global data from neutrino experiments even at the tree level with the simple choice of flavour diagonal neutrino yukawa couplings we show that it is also possible to achieve different mass hierarchies for light neutrinos at the tree level itself in munussm the effect of rparity violation together with a seesaw mechanism with tev scale righthanded neutrinos are instrumental for light neutrino mass generation we also analyze the stability of tree level neutrino masses and mixing with the inclusion of oneloop radiative corrections in addition we investigate the sensitivity of the oneloop corrections to different light neutrino mass orderings decays of the lightest supersymmetric particle were also computed and ratio of certain decay branching ratios was observed to correlate with certain neutrino mixing angle we extend our analysis for different natures of the lightest supersymmetric particle as well as with various light neutrino mass hierarchies we present estimation for the length of associated displaced vertices for various natures of the lightest supersymmetric particle which can act as a discriminating feature at a collider experiment we also present an unconventional signal of higgs boson in supersymmetry which can lead to a discovery even at the initial stage of the large hadron collider running besides we show that a signal of this kind can also act as a probe to the seesaw scale certain other phenomenological issues have also been addressed
|
[['in', 'this', 'thesis', 'we', 'try', 'to', 'discuss', 'certain', 'phenomenological', 'aspects', 'of', 'an', 'rparity', 'violating', 'nonminimal', 'supersymmetric', 'model', 'called', 'munussm', 'we', 'show', 'that', 'munussm', 'can', 'provide', 'a', 'solution', 'to', 'the', 'muproblem', 'of', 'supersymmetry', 'and', 'can', 'simultaneously', 'accommodate', 'the', 'existing', 'three', 'flavour', 'global', 'data', 'from', 'neutrino', 'experiments', 'even', 'at', 'the', 'tree', 'level', 'with', 'the', 'simple', 'choice', 'of', 'flavour', 'diagonal', 'neutrino', 'yukawa', 'couplings', 'we', 'show', 'that', 'it', 'is', 'also', 'possible', 'to', 'achieve', 'different', 'mass', 'hierarchies', 'for', 'light', 'neutrinos', 'at', 'the', 'tree', 'level', 'itself', 'in', 'munussm', 'the', 'effect', 'of', 'rparity', 'violation', 'together', 'with', 'a', 'seesaw', 'mechanism', 'with', 'tev', 'scale', 'righthanded', 'neutrinos', 'are', 'instrumental', 'for', 'light', 'neutrino', 'mass', 'generation', 'we', 'also', 'analyze', 'the', 'stability', 'of', 'tree', 'level', 'neutrino', 'masses', 'and', 'mixing', 'with', 'the', 'inclusion', 'of', 'oneloop', 'radiative', 'corrections', 'in', 'addition', 'we', 'investigate', 'the', 'sensitivity', 'of', 'the', 'oneloop', 'corrections', 'to', 'different', 'light', 'neutrino', 'mass', 'orderings', 'decays', 'of', 'the', 'lightest', 'supersymmetric', 'particle', 'were', 'also', 'computed', 'and', 'ratio', 'of', 'certain', 'decay', 'branching', 'ratios', 'was', 'observed', 'to', 'correlate', 'with', 'certain', 'neutrino', 'mixing', 'angle', 'we', 'extend', 'our', 'analysis', 'for', 'different', 'natures', 'of', 'the', 'lightest', 'supersymmetric', 'particle', 'as', 'well', 'as', 'with', 'various', 'light', 'neutrino', 'mass', 'hierarchies', 'we', 'present', 'estimation', 'for', 'the', 'length', 'of', 'associated', 'displaced', 'vertices', 'for', 'various', 'natures', 'of', 'the', 'lightest', 'supersymmetric', 'particle', 'which', 'can', 'act', 'as', 'a', 'discriminating', 'feature', 'at', 'a', 'collider', 'experiment', 'we', 'also', 'present', 'an', 'unconventional', 'signal', 'of', 'higgs', 'boson', 'in', 'supersymmetry', 'which', 'can', 'lead', 'to', 'a', 'discovery', 'even', 'at', 'the', 'initial', 'stage', 'of', 'the', 'large', 'hadron', 'collider', 'running', 'besides', 'we', 'show', 'that', 'a', 'signal', 'of', 'this', 'kind', 'can', 'also', 'act', 'as', 'a', 'probe', 'to', 'the', 'seesaw', 'scale', 'certain', 'other', 'phenomenological', 'issues', 'have', 'also', 'been', 'addressed']]
|
[-0.07892853236557279, 0.2612702558519272, -0.01813576346588733, 0.20757823936610056, -0.10225414589989142, -0.18054932946526206, 0.029780925861371554, 0.3307586921141812, -0.2291430591841031, -0.32982730693755097, 0.06268723313194668, -0.27495270479664374, -0.060566708957949536, 0.13038555589170442, 0.032519395338530654, 0.06797746246936817, 0.06893844436507908, -2.0055655025631246e-05, -0.07965671152679672, -0.2369740598291491, 0.31683679888211885, 0.07697304468394212, 0.19322520969643303, 0.1070734190955398, 0.0931514211489774, -0.05587990704030629, -0.024109738897947684, -0.0670698593443322, -0.0859522671195266, 0.05245271022388275, 0.1877900594170292, 0.12635767443597207, 0.09498991406623095, -0.3680585591143281, -0.16123205216057931, 0.2006428701548619, 0.17522813270013904, 0.12615143572548093, -0.09404595057673919, -0.28890286543195354, 0.0799890073050042, -0.21488535926213356, -0.13789308090178387, -0.07049211219591903, -0.06480950706891134, -0.09315905605051597, -0.32039333179897755, 0.0595911578870323, -0.058397282288430545, -0.021998373829659256, 0.01713824352478006, -0.1760832744383956, -0.05380605238136666, 0.042485417980790745, 0.18520609542015995, -0.051390139666439176, 0.14027333846311413, -0.16486899044709177, -0.1723710797436286, 0.4181026502799755, -0.10091375666289663, -0.1844455012506338, 0.16297897860774818, -0.15470934909816872, -0.1971488136289205, 0.09622809316332843, 0.21481340406220198, 0.06101820412261557, -0.17408321709562521, 0.1469808526323731, -0.08214123423110008, 0.1600654327862837, 0.07952908262156892, 0.0731272331549748, 0.2789598753897397, 0.24045921271826143, 0.07607152959640003, 0.047826732387013224, -0.10621095274974934, -0.04196945299263732, -0.422256650069043, -0.11594999252150327, -0.06469364998538435, 0.04091485246468931, -0.08877182211325509, -0.11135161654213548, 0.4466637846941066, 0.16720234053936478, 0.226962148986556, 0.06592201227391464, 0.2596889793159627, 0.08621117388907487, 0.09275224374466122, -0.005125215373691829, 0.31613198491021105, 0.09927591975548107, 0.11074070045620646, -0.28347596763737054, -0.017844984493111036, 0.09381528453447867]
|
1,803.06479
|
On the definition of a solution to a rough differential equation
|
We give an elementary proof that Davie's definition of a solution to a rough
differential equation and the notion of solution given by Bailleul in (Flows
driven by rough paths) coincide. This provides an alternative point on view on
the deep algebraic insights of Cass and Weidner in their work (Tree algebras
over topological vector spaces in rough path theory).
|
math.CA
|
we give an elementary proof that davies definition of a solution to a rough differential equation and the notion of solution given by bailleul in flows driven by rough paths coincide this provides an alternative point on view on the deep algebraic insights of cass and weidner in their work tree algebras over topological vector spaces in rough path theory
|
[['we', 'give', 'an', 'elementary', 'proof', 'that', 'davies', 'definition', 'of', 'a', 'solution', 'to', 'a', 'rough', 'differential', 'equation', 'and', 'the', 'notion', 'of', 'solution', 'given', 'by', 'bailleul', 'in', 'flows', 'driven', 'by', 'rough', 'paths', 'coincide', 'this', 'provides', 'an', 'alternative', 'point', 'on', 'view', 'on', 'the', 'deep', 'algebraic', 'insights', 'of', 'cass', 'and', 'weidner', 'in', 'their', 'work', 'tree', 'algebras', 'over', 'topological', 'vector', 'spaces', 'in', 'rough', 'path', 'theory']]
|
[-0.14053469947223568, 0.09447183015300513, -0.17559700181423607, 0.08349215528746215, -0.13695285115706718, -0.08019704417467623, 0.07641147475460765, 0.3362078755399433, -0.332889533262321, -0.25774353044896814, 0.06206623364784518, -0.28360381721069056, -0.1891052653486209, 0.21836935615135453, -0.1585768951829207, 0.023874428817781353, 0.05815923892719261, 0.026997637682420722, -0.07171312086599863, -0.24137857829623113, 0.3845776221656953, 0.003590326542646419, 0.24689397447884587, 0.03290139807988021, 0.16473228501755807, 0.06739571951803262, -0.09559295402239945, 0.03590368836234182, -0.23696412440151138, 0.1723416753870956, 0.25009345440036157, 0.10178627810930296, 0.24908661199891466, -0.42891326180454026, -0.18194961930640927, 0.03984871315690926, 0.12077368547255962, 0.07270302770312055, -0.06059242829569947, -0.2853391466472866, 0.07963837790539709, -0.1345127026345265, -0.1604711363344627, -0.06414389316292511, 0.032566621852249414, -0.012736004935103958, -0.2004860650306031, -0.024077155816731817, 0.13136704919575634, 0.10836634922267521, -0.11459444049682657, -0.05250666456068156, -0.004439736183701178, 0.015204478339371035, -0.037574475023390376, 0.08323386214452527, 0.04675119539912222, -0.11733464912069425, -0.17142245324991517, 0.2793537727478197, -0.07360324059944537, -0.26392387587703386, 0.16723244233151613, -0.0377479125193115, -0.11515992467875703, 0.13769414023322574, 0.12874329867141354, 0.14077947451338424, -0.17450995902704486, 0.14514516843916944, -0.09091972558111963, 0.04105930577547258, 0.07092798971649954, 0.007248222662167529, 0.16429217654969483, 0.1651939141043162, 0.14230116403866874, 0.10791991710252428, 0.05368743266247339, -0.1590118151724386, -0.3373618177059343, -0.17633752227303082, -0.12319934015335926, 0.10649042650741541, -0.13354235230816797, -0.24959838781821525, 0.3499357632156146, 0.1467701960039341, 0.2104429127806324, 0.08688531890195811, 0.2503795536961091, 0.14861039454275268, -0.004796103412538009, 0.04349552656886941, 0.1703355244076732, 0.19687577002381873, 0.11293629589845758, -0.08884048133583392, 0.030505245636312007, 0.20183154203439668]
|
1,803.0648
|
Queuing Theory Guided Intelligent Traffic Scheduling through Video
Analysis using Dirichlet Process Mixture Model
|
Accurate prediction of traffic signal duration for roadway junction is a
challenging problem due to the dynamic nature of traffic flows. Though
supervised learning can be used, parameters may vary across roadway junctions.
In this paper, we present a computer vision guided expert system that can learn
the departure rate of a given traffic junction modeled using traditional
queuing theory. First, we temporally group the optical flow of the moving
vehicles using Dirichlet Process Mixture Model (DPMM). These groups are
referred to as tracklets or temporal clusters. Tracklet features are then used
to learn the dynamic behavior of a traffic junction, especially during on/off
cycles of a signal. The proposed queuing theory based approach can predict the
signal open duration for the next cycle with higher accuracy when compared with
other popular features used for tracking. The hypothesis has been verified on
two publicly available video datasets. The results reveal that the DPMM based
features are better than existing tracking frameworks to estimate $\mu$. Thus,
signal duration prediction is more accurate when tested on these datasets.The
method can be used for designing intelligent operator-independent traffic
control systems for roadway junctions at cities and highways.
|
cs.CV eess.IV
|
accurate prediction of traffic signal duration for roadway junction is a challenging problem due to the dynamic nature of traffic flows though supervised learning can be used parameters may vary across roadway junctions in this paper we present a computer vision guided expert system that can learn the departure rate of a given traffic junction modeled using traditional queuing theory first we temporally group the optical flow of the moving vehicles using dirichlet process mixture model dpmm these groups are referred to as tracklets or temporal clusters tracklet features are then used to learn the dynamic behavior of a traffic junction especially during onoff cycles of a signal the proposed queuing theory based approach can predict the signal open duration for the next cycle with higher accuracy when compared with other popular features used for tracking the hypothesis has been verified on two publicly available video datasets the results reveal that the dpmm based features are better than existing tracking frameworks to estimate mu thus signal duration prediction is more accurate when tested on these datasetsthe method can be used for designing intelligent operatorindependent traffic control systems for roadway junctions at cities and highways
|
[['accurate', 'prediction', 'of', 'traffic', 'signal', 'duration', 'for', 'roadway', 'junction', 'is', 'a', 'challenging', 'problem', 'due', 'to', 'the', 'dynamic', 'nature', 'of', 'traffic', 'flows', 'though', 'supervised', 'learning', 'can', 'be', 'used', 'parameters', 'may', 'vary', 'across', 'roadway', 'junctions', 'in', 'this', 'paper', 'we', 'present', 'a', 'computer', 'vision', 'guided', 'expert', 'system', 'that', 'can', 'learn', 'the', 'departure', 'rate', 'of', 'a', 'given', 'traffic', 'junction', 'modeled', 'using', 'traditional', 'queuing', 'theory', 'first', 'we', 'temporally', 'group', 'the', 'optical', 'flow', 'of', 'the', 'moving', 'vehicles', 'using', 'dirichlet', 'process', 'mixture', 'model', 'dpmm', 'these', 'groups', 'are', 'referred', 'to', 'as', 'tracklets', 'or', 'temporal', 'clusters', 'tracklet', 'features', 'are', 'then', 'used', 'to', 'learn', 'the', 'dynamic', 'behavior', 'of', 'a', 'traffic', 'junction', 'especially', 'during', 'onoff', 'cycles', 'of', 'a', 'signal', 'the', 'proposed', 'queuing', 'theory', 'based', 'approach', 'can', 'predict', 'the', 'signal', 'open', 'duration', 'for', 'the', 'next', 'cycle', 'with', 'higher', 'accuracy', 'when', 'compared', 'with', 'other', 'popular', 'features', 'used', 'for', 'tracking', 'the', 'hypothesis', 'has', 'been', 'verified', 'on', 'two', 'publicly', 'available', 'video', 'datasets', 'the', 'results', 'reveal', 'that', 'the', 'dpmm', 'based', 'features', 'are', 'better', 'than', 'existing', 'tracking', 'frameworks', 'to', 'estimate', 'mu', 'thus', 'signal', 'duration', 'prediction', 'is', 'more', 'accurate', 'when', 'tested', 'on', 'these', 'datasetsthe', 'method', 'can', 'be', 'used', 'for', 'designing', 'intelligent', 'operatorindependent', 'traffic', 'control', 'systems', 'for', 'roadway', 'junctions', 'at', 'cities', 'and', 'highways']]
|
[-0.12109071977344381, 0.04955442671052879, -0.09757626325881574, 0.06994868299296779, -0.08843341464671539, -0.21597931737536177, 0.04550321242383385, 0.43303212042277056, -0.25267879297219525, -0.33920270546514075, 0.10765362214624474, -0.26172038710258977, -0.14237604150578895, 0.23711886659778733, -0.11630617540504318, 0.11135987878515152, 0.11433336607782014, 0.06570722691443127, -0.0005814228425151668, -0.22873651825477737, 0.24343080454612695, 0.029698840582568664, 0.3538151296913081, 0.016309453284823878, 0.08342030667457341, -0.020420522642477106, -0.018492742859962163, 0.021751194462315954, -0.06504517351921398, 0.1301842922460613, 0.3388945152692031, 0.13131138822306335, 0.2531410618442654, -0.4781550556460085, -0.2952593056555391, 0.10451367574326771, 0.1559984553950926, 0.07549681289985226, 0.007095672444468922, -0.3422743922031562, 0.11121204973217876, -0.1654132726143871, -0.0402273227217241, -0.060255269182865355, -0.011507550790459694, 0.048535208371807435, -0.29371365074863814, 0.06026445266616065, -0.02469415792559933, 0.07100261758023407, -0.032319552951472964, -0.07841901765793106, -0.0030233041106839664, 0.1964241707103914, 0.04089920953492765, 0.012122883609360239, 0.183063737412643, -0.13502679001612705, -0.1586618101670562, 0.3806313504173886, -0.06350830769504985, -0.17576100501658706, 0.19130110584228532, -0.018798627987659227, -0.12976145271386486, 0.12277218739473028, 0.2520536609517876, 0.106730529521883, -0.18934149625253363, -0.05259446178418633, -0.010728424931585323, 0.1954590868184217, 0.054613116729645604, -0.024321415323356632, 0.2129717803109088, 0.2803981619581464, 0.0690309341516695, 0.09155867723196327, -0.1460386240190322, -0.08929016020495813, -0.19891710125314907, -0.06982326289395739, -0.16035132538551503, -0.021935613215949463, -0.0919246547854679, -0.1131877572729536, 0.3902634783104683, 0.22128312200766231, 0.15283081041828459, 0.10014296244526122, 0.34060719933283207, 0.09666878262396494, 0.05210914325349828, 0.10134350931912195, 0.16120655555763128, 0.030797742923217204, 0.14665232290280983, -0.19114814480902473, 0.1289719374241637, 0.031372774047971085]
|
1,803.06481
|
The density of visible points in the Ammann-Beenker point set
|
The relative density of visible points of the integer lattice $\mathbb{Z}^d$
is known to be $1/\zeta(d)$ for $d\geq 2$, where $\zeta$ is Riemann's zeta
function. In this paper we prove that the relative density of visible points in
the Ammann-Beenker point set is given by $2(\sqrt{2}-1)/\zeta_K(2)$, where
$\zeta_K$ is Dedekind's zeta function over $K=\mathbb{Q}(\sqrt{2})$.
|
math.NT
|
the relative density of visible points of the integer lattice mathbbzd is known to be 1zetad for dgeq 2 where zeta is riemanns zeta function in this paper we prove that the relative density of visible points in the ammannbeenker point set is given by 2sqrt21zeta_k2 where zeta_k is dedekinds zeta function over kmathbbqsqrt2
|
[['the', 'relative', 'density', 'of', 'visible', 'points', 'of', 'the', 'integer', 'lattice', 'mathbbzd', 'is', 'known', 'to', 'be', '1zetad', 'for', 'dgeq', '2', 'where', 'zeta', 'is', 'riemanns', 'zeta', 'function', 'in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'relative', 'density', 'of', 'visible', 'points', 'in', 'the', 'ammannbeenker', 'point', 'set', 'is', 'given', 'by', '2sqrt21zeta_k2', 'where', 'zeta_k', 'is', 'dedekinds', 'zeta', 'function', 'over', 'kmathbbqsqrt2']]
|
[-0.1911572271446679, 0.11807033326476812, -0.10993637853101187, 0.030337565758849914, -0.014978061320588869, -0.10932075100786545, 0.04783626352025963, 0.32349278602529974, -0.29780923688382493, -0.1998418516424649, 0.06874534799306489, -0.2752080083477731, -0.18729933296494625, 0.14328973187024102, -0.07559460560407709, 0.0432709349574996, -0.03679716083056787, 0.10747586773233671, -0.06286283671472441, -0.3113888022581152, 0.39188243843176784, -0.0656086474602275, 0.12820337046229957, 0.10194819155788305, 0.05755067853184015, 0.048588518071554454, 0.007238911784381843, -0.020152490330385228, -0.1512214945974205, 0.07549051670174972, 0.2615573925568777, 0.06518540530027274, 0.2582000721355571, -0.3049195546145533, -0.18254909258993232, 0.17183199647457942, 0.14360610388365447, -0.048055076332507184, 0.060071795133362506, -0.20319577313813508, 0.17123387007764085, -0.08801924535895095, -0.17125761127282008, 0.009097865600065858, 0.10332211296019309, 0.08880245276525908, -0.3591466727210026, 0.09066773032513904, 0.0021456769572265042, 0.11664640843210851, -0.05571594207967613, -0.1862380354683481, -0.03315274553903032, 0.07492318431682446, 0.05149969672236372, 0.17113318710642703, 0.07137487435202096, -0.1337278984149224, -0.07292863496524446, 0.35932862159668233, -0.035655668187959524, -0.2016747034355706, 0.09711475856602192, -0.23573713202723393, -0.12766275014363082, 0.119609774035566, 0.09020286771998394, 0.1835314753264481, -0.052218872286817604, 0.2052250479110608, -0.12207055568932464, 0.1592361587036958, 0.14176285790973434, -0.029226962860454533, 0.20561401533218576, 0.07894731250902016, 0.09785494435688152, 0.15753707517732812, -0.09644482242783495, -0.05464374308711758, -0.3590298636871226, -0.2044943652900995, -0.28438286260500845, 0.11066153760561172, -0.1325968764631041, -0.1951079975229268, 0.3694518062048683, 0.12928819814331682, 0.21920733912574017, 0.106075222384842, 0.22063690694231614, 0.200756144561798, 0.027297302057930066, 0.053904068108428925, 0.08794205091601494, 0.08672119563276533, -0.004034208026532011, -0.1250763775360789, 0.012475121830243106, 0.16864347203141627]
|
1,803.06482
|
Asynchronous Distributed Method of Multipliers for Constrained Nonconvex
Optimization
|
This paper addresses a class of constrained optimization problems over
networks in which local cost functions and constraints can be nonconvex. We
propose an asynchronous distributed optimization algorithm, relying on the
centralized Method of Multipliers, in which each node wakes up in an
uncoordinated fashion and performs either a descent step on a local Augmented
Lagrangian or an ascent step on the local multiplier vector. These two phases
are regulated by a distributed logic-AND, which allows nodes to understand when
the descent on the (whole) Augmented Lagrangian is sufficiently small. We show
that this distributed algorithm is equivalent to a block coordinate descent
algorithm for the minimization of the Augmented Lagrangian followed by an
update of the whole multiplier vector. Thus, the proposed algorithm inherits
the convergence properties of the Method of Multipliers.
|
math.OC
|
this paper addresses a class of constrained optimization problems over networks in which local cost functions and constraints can be nonconvex we propose an asynchronous distributed optimization algorithm relying on the centralized method of multipliers in which each node wakes up in an uncoordinated fashion and performs either a descent step on a local augmented lagrangian or an ascent step on the local multiplier vector these two phases are regulated by a distributed logicand which allows nodes to understand when the descent on the whole augmented lagrangian is sufficiently small we show that this distributed algorithm is equivalent to a block coordinate descent algorithm for the minimization of the augmented lagrangian followed by an update of the whole multiplier vector thus the proposed algorithm inherits the convergence properties of the method of multipliers
|
[['this', 'paper', 'addresses', 'a', 'class', 'of', 'constrained', 'optimization', 'problems', 'over', 'networks', 'in', 'which', 'local', 'cost', 'functions', 'and', 'constraints', 'can', 'be', 'nonconvex', 'we', 'propose', 'an', 'asynchronous', 'distributed', 'optimization', 'algorithm', 'relying', 'on', 'the', 'centralized', 'method', 'of', 'multipliers', 'in', 'which', 'each', 'node', 'wakes', 'up', 'in', 'an', 'uncoordinated', 'fashion', 'and', 'performs', 'either', 'a', 'descent', 'step', 'on', 'a', 'local', 'augmented', 'lagrangian', 'or', 'an', 'ascent', 'step', 'on', 'the', 'local', 'multiplier', 'vector', 'these', 'two', 'phases', 'are', 'regulated', 'by', 'a', 'distributed', 'logicand', 'which', 'allows', 'nodes', 'to', 'understand', 'when', 'the', 'descent', 'on', 'the', 'whole', 'augmented', 'lagrangian', 'is', 'sufficiently', 'small', 'we', 'show', 'that', 'this', 'distributed', 'algorithm', 'is', 'equivalent', 'to', 'a', 'block', 'coordinate', 'descent', 'algorithm', 'for', 'the', 'minimization', 'of', 'the', 'augmented', 'lagrangian', 'followed', 'by', 'an', 'update', 'of', 'the', 'whole', 'multiplier', 'vector', 'thus', 'the', 'proposed', 'algorithm', 'inherits', 'the', 'convergence', 'properties', 'of', 'the', 'method', 'of', 'multipliers']]
|
[-0.15938653307966888, 0.01982443149873606, -0.09237280195917595, 0.01671498049770228, -0.06783090562340945, -0.15112412415063856, 0.036661958700278774, 0.4102022923021154, -0.3714402282723423, -0.26565398207766877, 0.09962407975002531, -0.18116257863419544, -0.18012619246270112, 0.14955852445828813, -0.10223531901525955, 0.058326760130567534, 0.05310381089591167, 0.03161756297093675, -0.1127070842851412, -0.3068274080640439, 0.2640417172982724, 0.0683288758013849, 0.2529738724556272, -0.03398128134325485, 0.1775463918774304, 0.02649614998407549, -0.013893228389365091, 0.042923723915450726, -0.02348257513977208, 0.15858866142772252, 0.2185058935517163, 0.18050180282443762, 0.3590438182211735, -0.4548270206450428, -0.14376951874036228, 0.12667848126765227, 0.20197001968644504, 0.08101551791487234, -0.051715370456363555, -0.2661561242191855, 0.13134331589169573, -0.13880907236704265, -0.07227122537072071, -0.078659382220146, -0.09103313233407045, 0.07718269881143262, -0.33342850913829875, 0.01591055689619459, 0.05555486774326048, 0.03300056696664824, -0.0765272003680531, -0.07933435233479197, 0.03606059281755182, 0.03568443675833281, 0.027491050192938103, 0.06079971758564087, 0.16468963312394352, -0.07130573170301928, -0.1260185678882849, 0.3642156414729966, -0.030321071622452248, -0.2639442882694614, 0.14602610114679643, 0.043251754865857285, -0.14768759508186838, 0.1298994037858916, 0.2178667591793011, 0.21058668376468687, -0.1670504851134672, 0.11091782105998418, -0.06826242195639873, 0.12519165197613114, -0.0045393887752046185, -0.03822278336861707, 0.11738940498043755, 0.1583589208188862, 0.2570975527139098, 0.12720302299545216, -0.07249818887618004, -0.14724711564574108, -0.2974489585383598, -0.14521975039194027, -0.2006046969344783, -0.03444428640333089, -0.10530588034320813, -0.16923277878738713, 0.44563804209853214, 0.12481900451927107, 0.22496323527725923, 0.09746809445840138, 0.35153125336563046, 0.11764247621018016, 0.09469121511828041, 0.15156615394252268, 0.18687785816886884, 0.10089124337360827, 0.09812996575562989, -0.21843466019455457, 0.058205736204840694, 0.18056739918238512]
|
1,803.06483
|
Products of $H$-separable spaces in the Laver model
|
We prove that in the Laver model for the consistency of the Borel's
conjecture, the product of any two $H$-separable spaces is $M$-separable.
|
math.GN math.LO
|
we prove that in the laver model for the consistency of the borels conjecture the product of any two hseparable spaces is mseparable
|
[['we', 'prove', 'that', 'in', 'the', 'laver', 'model', 'for', 'the', 'consistency', 'of', 'the', 'borels', 'conjecture', 'the', 'product', 'of', 'any', 'two', 'hseparable', 'spaces', 'is', 'mseparable']]
|
[-0.1851026357405565, 0.07867973039604047, -0.11507064377127046, 0.13561893595827065, 0.003126071427356113, -0.08887994340197607, -0.025386922019110483, 0.306136390702291, -0.2722614761441946, -0.1949997814372182, 0.12541272837816822, -0.24212662993125955, -0.10838404077697884, 0.18579556233122607, -0.12269531402059576, 0.0037921470251273026, 0.06552037156440994, 0.0879378229887648, -0.0698741237019104, -0.3200920560312542, 0.4460979738611389, -0.09045955005355856, 0.2602560220032253, 0.11089265854521231, 0.10664290528405797, 0.04600994974713434, 0.006842340099286626, -0.005561616483398459, -0.14384072071995682, 0.15139893247661265, 0.18934586457908154, 0.18724332854617387, 0.27109696597538213, -0.3287390610203147, -0.1284543406747451, 0.194176563273438, 0.052524827971038496, 0.0364433061754839, 0.022590589910660954, -0.24521737994456833, 0.1194998389956626, -0.20701947376470675, -0.15245982403443617, -0.038054436474340037, 0.0023016286167231474, 0.013044735670767048, -0.3157637227347798, 0.02191272246736017, 0.19902282038872893, 0.042208459355275736, -0.1269666735955649, -0.06959768951955167, -0.06345104531977665, 0.11735785828733986, 0.04035172766519033, 0.005875899498774247, -0.016518734374337575, -0.0988674746318297, -0.18670874859460376, 0.3328675741160458, -0.0723825768482956, -0.21603294969959694, 0.12217087116600438, -0.17804800308394161, -0.24814358544112605, 0.0017953261479058049, 0.014423206109892239, 0.10869928398592905, -0.01636258817531846, 0.18799012509936636, -0.20634574002840303, 0.06615736526013775, 0.12501936363564295, -0.0020175768189470878, 0.09386991023678672, 0.11065883104774085, 0.09946934866126288, 0.1835504105653275, -0.011200905692848291, -0.03159336081907069, -0.3521409732374278, -0.2605561688542366, -0.1504014909944751, 0.04080410001122139, -0.17437643733468244, -0.2046698093075644, 0.34824562377550383, 0.16853734135458415, 0.1536226167597554, 0.1890292789533057, 0.2280960465696725, 0.050064510496502575, 0.038581245065539733, 0.052863479951735244, 0.21803510591218417, 0.18288344813680107, -0.01838127252730456, -0.12585279675708574, 0.06336861895397305, 0.19752117682417686]
|
1,803.06484
|
Linearized Einstein's Equation around pure BTZ from Entanglement
Thermodynamics
|
It is known that the linearized Einstein's equation around the pure $AdS$ can
be obtained from the constraint $ \Delta S = \Delta\left< H \right> $, known as
the first law of entanglement, on the boundary $CFT$. The corresponding dual
state in the boundary $CFT$ is the vacuum state around which the linear
perturbation is taken. In this paper we revisit this question, in the context
of $ {AdS}_3/{CFT}_2 $, with the state of the boundary ${CFT}_2$ as a thermal
state. The corresponding dual geometry is a planar BTZ black hole. By
considering the linearized perturbation around this black brane we show that
Einstein's equation follows from the first law of entanglement. The modular
Hamiltonian in a thermal state of the ${CFT}_2$ that we have used has been
recently found in arXiv:1608.01283 [cond-mat.stat-mech].
|
hep-th
|
it is known that the linearized einsteins equation around the pure ads can be obtained from the constraint delta s deltaleft h right known as the first law of entanglement on the boundary cft the corresponding dual state in the boundary cft is the vacuum state around which the linear perturbation is taken in this paper we revisit this question in the context of ads_3cft_2 with the state of the boundary cft_2 as a thermal state the corresponding dual geometry is a planar btz black hole by considering the linearized perturbation around this black brane we show that einsteins equation follows from the first law of entanglement the modular hamiltonian in a thermal state of the cft_2 that we have used has been recently found in arxiv160801283 condmatstatmech
|
[['it', 'is', 'known', 'that', 'the', 'linearized', 'einsteins', 'equation', 'around', 'the', 'pure', 'ads', 'can', 'be', 'obtained', 'from', 'the', 'constraint', 'delta', 's', 'deltaleft', 'h', 'right', 'known', 'as', 'the', 'first', 'law', 'of', 'entanglement', 'on', 'the', 'boundary', 'cft', 'the', 'corresponding', 'dual', 'state', 'in', 'the', 'boundary', 'cft', 'is', 'the', 'vacuum', 'state', 'around', 'which', 'the', 'linear', 'perturbation', 'is', 'taken', 'in', 'this', 'paper', 'we', 'revisit', 'this', 'question', 'in', 'the', 'context', 'of', 'ads_3cft_2', 'with', 'the', 'state', 'of', 'the', 'boundary', 'cft_2', 'as', 'a', 'thermal', 'state', 'the', 'corresponding', 'dual', 'geometry', 'is', 'a', 'planar', 'btz', 'black', 'hole', 'by', 'considering', 'the', 'linearized', 'perturbation', 'around', 'this', 'black', 'brane', 'we', 'show', 'that', 'einsteins', 'equation', 'follows', 'from', 'the', 'first', 'law', 'of', 'entanglement', 'the', 'modular', 'hamiltonian', 'in', 'a', 'thermal', 'state', 'of', 'the', 'cft_2', 'that', 'we', 'have', 'used', 'has', 'been', 'recently', 'found', 'in', 'arxiv160801283', 'condmatstatmech']]
|
[-0.12007657959910593, 0.11039604258716224, -0.1294369226116247, 0.04664459511890685, -0.052351286055476176, -0.12262665034880436, -0.0226699879207817, 0.25191049860775705, -0.2412320536993972, -0.23658651412706674, 0.1246294313931735, -0.31687991134089044, -0.11082280631081795, 0.12419329250898711, -0.060271288752262515, 0.08741389768652794, 0.006793930336437005, 0.12551664998094866, -0.0808962161366747, -0.20181916695909471, 0.3797589269554697, 0.046228026813556124, 0.2536671012255004, 0.02402165503512452, 0.08347741249714076, -0.020125895293106832, 0.060193219434792604, 0.05505385174320673, -0.1472875316962247, 0.07249718833362728, 0.2201078395857879, 0.08972672341340111, 0.20023397264606135, -0.4251463045109445, -0.2214987201792166, 0.059834380276633174, 0.13135482408986318, 0.16167140620353623, -0.02971997317458378, -0.2943238531070666, 0.05785749592326992, -0.1818364902773476, -0.16779660860692538, -0.014699485614954487, 0.022904448306525316, -0.11338098358186915, -0.2044673252293444, 0.12140554040267067, 0.06698854882398429, -0.04364806646114494, -0.11956535255001109, -0.058374420497713124, -0.09989102997296438, 0.09186997800317453, 0.07579990845598926, 0.06820077720780189, 0.09561283757367472, -0.1367024508851221, -0.09730767717540968, 0.3481939207967811, -0.09208526958960776, -0.19617338867227394, 0.11331946012659336, -0.18989265616616513, -0.10714679760455088, 0.06443273188091639, 0.07433564722625993, 0.20430027836749026, -0.1584856242792109, 0.20115164398971036, -0.08310831722704415, 0.14756274749488224, 0.10142812509031042, 0.014964797834711751, 0.2546966312101155, 0.08953407882001456, 0.05113839240576045, 0.2279938806323188, -0.03606580737538225, -0.12953393588091913, -0.3733594375919169, -0.16697152294071876, -0.214816935937925, 0.1300785824250637, -0.1195504959364693, -0.15408614873299448, 0.36429121448680407, 0.11961916458653653, 0.16459782022660172, 0.017386724689322723, 0.19790818633907659, 0.16729691490992962, 0.032856286279710496, 0.11225694129023496, 0.3185941113166394, 0.14039550232701004, 0.1536615471150286, -0.2846830610706522, -0.030224588589640115, 0.14613258347325908]
|
1,803.06485
|
Impact of Dzyaloshinsky-Moriya Interactions and Tilts of the g Tensors
on the Magnetization Process of a Spherical Kagome Cluster in {W72V30}
|
In order to clarify why the experimental magnetization curve of the spherical
kagome cluster in {W72V30} at 0.5 K shows no sign of staircase behavior up to
50 T, we study the effects of Dzyaloshinsky-Moriya (DM) interactions and tilts
of the g tensors, both of which lead to the breaking of the total-S z
conservation, by using the exact diagonalization method. It is found that the D
vector component parallel to the radiation direction of the polyhedron cancels
out the staircase in a low magnetic field region efficiently. The tilts of the
g tensors are inherent to systems defined on the poly- hedrons and lead to
induced magnetic fields varying site by site. This induced magnetic field
affects the magnetization only at high magnetic fields. We also discuss two
existing experimental results on the basis of our calculated results.
|
cond-mat.str-el
|
in order to clarify why the experimental magnetization curve of the spherical kagome cluster in w72v30 at 05 k shows no sign of staircase behavior up to 50 t we study the effects of dzyaloshinskymoriya dm interactions and tilts of the g tensors both of which lead to the breaking of the totals z conservation by using the exact diagonalization method it is found that the d vector component parallel to the radiation direction of the polyhedron cancels out the staircase in a low magnetic field region efficiently the tilts of the g tensors are inherent to systems defined on the poly hedrons and lead to induced magnetic fields varying site by site this induced magnetic field affects the magnetization only at high magnetic fields we also discuss two existing experimental results on the basis of our calculated results
|
[['in', 'order', 'to', 'clarify', 'why', 'the', 'experimental', 'magnetization', 'curve', 'of', 'the', 'spherical', 'kagome', 'cluster', 'in', 'w72v30', 'at', '05', 'k', 'shows', 'no', 'sign', 'of', 'staircase', 'behavior', 'up', 'to', '50', 't', 'we', 'study', 'the', 'effects', 'of', 'dzyaloshinskymoriya', 'dm', 'interactions', 'and', 'tilts', 'of', 'the', 'g', 'tensors', 'both', 'of', 'which', 'lead', 'to', 'the', 'breaking', 'of', 'the', 'totals', 'z', 'conservation', 'by', 'using', 'the', 'exact', 'diagonalization', 'method', 'it', 'is', 'found', 'that', 'the', 'd', 'vector', 'component', 'parallel', 'to', 'the', 'radiation', 'direction', 'of', 'the', 'polyhedron', 'cancels', 'out', 'the', 'staircase', 'in', 'a', 'low', 'magnetic', 'field', 'region', 'efficiently', 'the', 'tilts', 'of', 'the', 'g', 'tensors', 'are', 'inherent', 'to', 'systems', 'defined', 'on', 'the', 'poly', 'hedrons', 'and', 'lead', 'to', 'induced', 'magnetic', 'fields', 'varying', 'site', 'by', 'site', 'this', 'induced', 'magnetic', 'field', 'affects', 'the', 'magnetization', 'only', 'at', 'high', 'magnetic', 'fields', 'we', 'also', 'discuss', 'two', 'existing', 'experimental', 'results', 'on', 'the', 'basis', 'of', 'our', 'calculated', 'results']]
|
[-0.19804886239748315, 0.1697219662927761, -0.024803750634464775, 0.037574866157830795, -0.07012157033117179, -0.07174253775637678, 0.0420787520103639, 0.3868772104757724, -0.28060668499188884, -0.3239537574645641, 0.035679180809068865, -0.2680857956355853, -0.10188027558406051, 0.16024815670856135, 0.047253102393487546, -0.04953199924847527, -0.0033230203934174647, 0.03752453632069845, -0.07798851600164722, -0.24929277444754144, 0.2809122540408464, 0.049933390693551453, 0.2754207336806136, 0.07944005903982215, 0.08456656876817453, -0.0017347557657806994, 0.029654857213441417, 0.05085438433632576, -0.12785470223737078, 0.06333759539675222, 0.1815674667089186, 0.0068224639424102765, 0.16624104348848834, -0.4243309913310323, -0.15377298925112157, 0.07885411816897045, 0.12502863885593607, 0.10708308380294805, -0.04441711640910065, -0.2624382001227237, 0.10107721371254583, -0.1214738914461659, -0.1508270551470651, -0.08269518664736542, 0.003289024040719374, 0.011647522653848361, -0.2644578475277308, 0.09358287181746275, 0.08958500996734545, 0.09455156672022326, -0.06858442159262386, -0.15878612063691128, -0.06033410930758168, 0.07846650831977563, 0.09624128332261077, 0.09738446476118867, 0.14348673345789098, -0.12237319946892077, -0.09447626713093826, 0.3630097539251228, -0.055650613324301275, -0.1512133119989642, 0.13857033296166618, -0.2073303320555673, -0.100587232380087, 0.16356096029107411, 0.14034884513050935, 0.10998107050713017, -0.08403673666871066, 0.09489239357925261, -0.013213892299815904, 0.14359587862946951, 0.04681705442598934, -0.013996053930110693, 0.2180242327665039, 0.0781856737394395, 0.04430396484693499, 0.16409016504763163, -0.12305405457912803, -0.06279130130604231, -0.2753744296287354, -0.12265724474614446, -0.18437877145935883, 0.030247290162269107, -0.11019835822269984, -0.15457039109344106, 0.397290733636176, 0.1666599623163787, 0.19676597734658624, -0.022194707378403372, 0.2550572058112233, 0.08009182201554368, 0.104229444570893, 0.05194491551009764, 0.24643611657037903, 0.19405810814015836, 0.09269178406127708, -0.29364969111014183, 0.042607889708345954, 0.03194385963130287]
|
1,803.06486
|
Rotating accretion flows in $D$ dimensions: sonic points, critical
points and photon spheres
|
We give the formulation and the general analysis of the rotational accretion
problem on $D$-dimensional spherical spacetime and investigate sonic points and
critical points. First, we construct the simple two-dimensional rotating
accretion flow model in general $D$-dimensional static spherically symmetric
spacetime and formulate the problem. The flow forms a two-dimensional disk
lying on the equatorial plane and the disk is assumed to be geometrically thin
and has uniform distribution in the polar angle directions. Analyzing the
critical point of the problem, we give the conditions for the critical point
and its classification explicitly and show the coincidence with the sonic point
for generic equation of state (EOS). Next, adopting the EOS of ideal photon gas
to the analysis, we reveal that there always exists a correspondence between
the sonic points and the photon spheres of the spacetime. Our main result is
that the sonic point of the rotating accretion flow of ideal photon gas must be
on (one of) the unstable photon sphere(s) of the spacetime in arbitrary
spacetime dimensions. This paper extends this correspondence for spherical
flows shown in the authors' previous work to rotating accretion disks.
|
gr-qc
|
we give the formulation and the general analysis of the rotational accretion problem on ddimensional spherical spacetime and investigate sonic points and critical points first we construct the simple twodimensional rotating accretion flow model in general ddimensional static spherically symmetric spacetime and formulate the problem the flow forms a twodimensional disk lying on the equatorial plane and the disk is assumed to be geometrically thin and has uniform distribution in the polar angle directions analyzing the critical point of the problem we give the conditions for the critical point and its classification explicitly and show the coincidence with the sonic point for generic equation of state eos next adopting the eos of ideal photon gas to the analysis we reveal that there always exists a correspondence between the sonic points and the photon spheres of the spacetime our main result is that the sonic point of the rotating accretion flow of ideal photon gas must be on one of the unstable photon spheres of the spacetime in arbitrary spacetime dimensions this paper extends this correspondence for spherical flows shown in the authors previous work to rotating accretion disks
|
[['we', 'give', 'the', 'formulation', 'and', 'the', 'general', 'analysis', 'of', 'the', 'rotational', 'accretion', 'problem', 'on', 'ddimensional', 'spherical', 'spacetime', 'and', 'investigate', 'sonic', 'points', 'and', 'critical', 'points', 'first', 'we', 'construct', 'the', 'simple', 'twodimensional', 'rotating', 'accretion', 'flow', 'model', 'in', 'general', 'ddimensional', 'static', 'spherically', 'symmetric', 'spacetime', 'and', 'formulate', 'the', 'problem', 'the', 'flow', 'forms', 'a', 'twodimensional', 'disk', 'lying', 'on', 'the', 'equatorial', 'plane', 'and', 'the', 'disk', 'is', 'assumed', 'to', 'be', 'geometrically', 'thin', 'and', 'has', 'uniform', 'distribution', 'in', 'the', 'polar', 'angle', 'directions', 'analyzing', 'the', 'critical', 'point', 'of', 'the', 'problem', 'we', 'give', 'the', 'conditions', 'for', 'the', 'critical', 'point', 'and', 'its', 'classification', 'explicitly', 'and', 'show', 'the', 'coincidence', 'with', 'the', 'sonic', 'point', 'for', 'generic', 'equation', 'of', 'state', 'eos', 'next', 'adopting', 'the', 'eos', 'of', 'ideal', 'photon', 'gas', 'to', 'the', 'analysis', 'we', 'reveal', 'that', 'there', 'always', 'exists', 'a', 'correspondence', 'between', 'the', 'sonic', 'points', 'and', 'the', 'photon', 'spheres', 'of', 'the', 'spacetime', 'our', 'main', 'result', 'is', 'that', 'the', 'sonic', 'point', 'of', 'the', 'rotating', 'accretion', 'flow', 'of', 'ideal', 'photon', 'gas', 'must', 'be', 'on', 'one', 'of', 'the', 'unstable', 'photon', 'spheres', 'of', 'the', 'spacetime', 'in', 'arbitrary', 'spacetime', 'dimensions', 'this', 'paper', 'extends', 'this', 'correspondence', 'for', 'spherical', 'flows', 'shown', 'in', 'the', 'authors', 'previous', 'work', 'to', 'rotating', 'accretion', 'disks']]
|
[-0.1503741902180333, 0.1003949691571216, -0.09859027099012932, 0.03995805409083024, -0.04218504155188442, -0.1061099079373154, 0.01773577449320657, 0.3322766085472354, -0.22481300730624812, -0.22765117469169396, 0.09923050713606496, -0.2636176044458246, -0.08806316071051232, 0.16946213751748956, -0.038892296336695276, 0.061961882306508065, 0.0005290609724978183, 0.00892103510101306, -0.099908695125239, -0.20254263962801525, 0.4175415513442552, 0.027058190611646847, 0.2672427497132919, 0.020913890453967007, 0.11668888540651173, -0.01748571292673079, -0.001085282771531096, 0.029609244448093184, -0.21997714796058024, 0.07484614061924846, 0.21216707291487763, 0.06027955689437767, 0.17014363601040888, -0.40207443473503945, -0.23829207545582284, 0.09852255584592833, 0.14099280382357934, 0.11052628361342594, -0.05595463664506864, -0.2283679868857515, 0.06574833896407421, -0.15549132146159225, -0.20669900417387327, -0.009732754534467104, 0.030959124129483515, -0.008362164943815862, -0.23053858990866463, 0.09088291306088263, 0.12326271160124266, 0.04013842594948538, -0.10274852607510687, -0.014338156172480594, -0.04515882795044974, 0.0802343917993254, 0.07693522647605278, 0.06342099164364899, 0.14421887476829456, -0.11177597039111672, -0.06175932755348263, 0.4201948349165948, -0.012296687281551831, -0.2264120679105969, 0.19101167872964225, -0.20004233023761078, -0.08184846682830695, 0.12681826018168532, 0.17981735686771572, 0.16301322559221706, -0.06779017864151839, 0.09179426288570307, -0.11783960858419379, 0.13199853580296436, 0.11510792246306355, -0.038927271012885574, 0.3038258171848398, 0.1184616042325828, 0.06526462379855381, 0.17990607321832053, -0.12190573950709299, -0.1328511303538417, -0.31675836834263926, -0.16962283025892017, -0.17314824455063493, 0.07085745482324088, -0.16721765971375677, -0.17961833686515208, 0.3411753984326695, 0.09969006057338234, 0.1861285426099091, -0.0008732777993653609, 0.30413208077253, 0.13096043556009695, -0.034931758470694595, 0.16610168367178438, 0.27980330197061315, 0.13328087104464623, 0.10539554110971253, -0.1998150802113393, -0.033467825133095874, 0.10800851658395333]
|
1,803.06487
|
Magnetic Fields of Extrasolar Planets: Planetary Interiors and
Habitability
|
Jupiter's radio emission has been linked to its planetary-scale magnetic
field, and spacecraft investigations have revealed that most planets, and some
moons, have or had a global magnetic field. Generated by internal dynamos,
magnetic fields are one of the few remote sensing means of constraining the
properties of planetary interiors. For the Earth, its magnetic field has been
speculated to be partially responsible for its habitability, and knowledge of
an extrasolar planet's magnetic field may be necessary to assess its
habitability. The radio emission from Jupiter and other solar system planets is
produced by an electron cyclotron maser, and detections of extrasolar planetary
electron cyclotron masers will enable measurements of extrasolar planetary
magnetic fields.
This white paper draws heavily on the W. M. Keck Institute for Space Studies
report Planetary Magnetic Fields: Planetary Interiors and Habitability (Lazio,
Shkolnik, Hallinan, et al.), it incorporates topics discussed at the American
Astronomical Society Topical Conference "Radio Exploration of Planetary
Habitability," it complements the Astrobiology Science Strategy white paper
"Life Beyond the Solar System: Space Weather and Its Impact on Habitable
Worlds" (Airapetian et al.), and it addresses aspects of planetary magnetic
fields discussed in the NASA Astrobiology Strategy.
|
astro-ph.EP astro-ph.SR
|
jupiters radio emission has been linked to its planetaryscale magnetic field and spacecraft investigations have revealed that most planets and some moons have or had a global magnetic field generated by internal dynamos magnetic fields are one of the few remote sensing means of constraining the properties of planetary interiors for the earth its magnetic field has been speculated to be partially responsible for its habitability and knowledge of an extrasolar planets magnetic field may be necessary to assess its habitability the radio emission from jupiter and other solar system planets is produced by an electron cyclotron maser and detections of extrasolar planetary electron cyclotron masers will enable measurements of extrasolar planetary magnetic fields this white paper draws heavily on the w m keck institute for space studies report planetary magnetic fields planetary interiors and habitability lazio shkolnik hallinan et al it incorporates topics discussed at the american astronomical society topical conference radio exploration of planetary habitability it complements the astrobiology science strategy white paper life beyond the solar system space weather and its impact on habitable worlds airapetian et al and it addresses aspects of planetary magnetic fields discussed in the nasa astrobiology strategy
|
[['jupiters', 'radio', 'emission', 'has', 'been', 'linked', 'to', 'its', 'planetaryscale', 'magnetic', 'field', 'and', 'spacecraft', 'investigations', 'have', 'revealed', 'that', 'most', 'planets', 'and', 'some', 'moons', 'have', 'or', 'had', 'a', 'global', 'magnetic', 'field', 'generated', 'by', 'internal', 'dynamos', 'magnetic', 'fields', 'are', 'one', 'of', 'the', 'few', 'remote', 'sensing', 'means', 'of', 'constraining', 'the', 'properties', 'of', 'planetary', 'interiors', 'for', 'the', 'earth', 'its', 'magnetic', 'field', 'has', 'been', 'speculated', 'to', 'be', 'partially', 'responsible', 'for', 'its', 'habitability', 'and', 'knowledge', 'of', 'an', 'extrasolar', 'planets', 'magnetic', 'field', 'may', 'be', 'necessary', 'to', 'assess', 'its', 'habitability', 'the', 'radio', 'emission', 'from', 'jupiter', 'and', 'other', 'solar', 'system', 'planets', 'is', 'produced', 'by', 'an', 'electron', 'cyclotron', 'maser', 'and', 'detections', 'of', 'extrasolar', 'planetary', 'electron', 'cyclotron', 'masers', 'will', 'enable', 'measurements', 'of', 'extrasolar', 'planetary', 'magnetic', 'fields', 'this', 'white', 'paper', 'draws', 'heavily', 'on', 'the', 'w', 'm', 'keck', 'institute', 'for', 'space', 'studies', 'report', 'planetary', 'magnetic', 'fields', 'planetary', 'interiors', 'and', 'habitability', 'lazio', 'shkolnik', 'hallinan', 'et', 'al', 'it', 'incorporates', 'topics', 'discussed', 'at', 'the', 'american', 'astronomical', 'society', 'topical', 'conference', 'radio', 'exploration', 'of', 'planetary', 'habitability', 'it', 'complements', 'the', 'astrobiology', 'science', 'strategy', 'white', 'paper', 'life', 'beyond', 'the', 'solar', 'system', 'space', 'weather', 'and', 'its', 'impact', 'on', 'habitable', 'worlds', 'airapetian', 'et', 'al', 'and', 'it', 'addresses', 'aspects', 'of', 'planetary', 'magnetic', 'fields', 'discussed', 'in', 'the', 'nasa', 'astrobiology', 'strategy']]
|
[-0.13079297972238052, 0.20804808267595493, -0.022680738817483014, 0.04568679787585309, -0.19642719527986383, -0.026249974862300823, 0.027958648606237275, 0.3312314704176367, -0.1579551248518036, -0.3839999671272663, 0.08032215691782013, -0.2389211987478205, -0.14884129865818846, 0.26818857589311934, -0.09590862875254197, 0.03263503633990855, 0.11292554394684616, -0.0661793365631822, 0.05343835057396384, -0.30283748818841316, 0.27811235885034497, 0.1512138003705388, 0.08993205319187686, 0.02208501297903339, 0.04416618899591846, -0.0829295645102405, -0.06561156249619596, -0.0711345500243379, -0.17149420852376748, 0.053643474812726306, 0.28262058824271813, 0.20018428489035045, 0.25065074856224145, -0.43315782726240476, -0.2883986799152558, 0.03137552877707127, 0.11243784921050766, -0.012532172473678316, -0.06447372970007205, -0.33083723699239714, 0.028957335456935546, -0.18503099941248025, -0.1797418599041092, 0.0027317557944747297, 0.10085256837086433, 0.020397929508489957, -0.2394262488516424, -0.015025171550193445, 0.06291930039969412, 0.22194549905551222, -0.1934404632003032, -0.16524772915670677, -0.0445483409452199, 0.11459795779239754, 0.05164281899981693, 0.032608961605664746, 0.22894955660974114, -0.08620909969997954, -0.08860694002504871, 0.42584463110051257, -0.029434101885290807, -0.01069194067226134, 0.26104274973360136, -0.26202650089299434, -0.15454044159733415, 0.1083815242163837, 0.1861222880009388, 0.11807398793499897, -0.17812747979498048, 0.09824662624346817, -0.025617051826201262, 0.11650175723087988, 0.09931221188388649, 0.07324388518765414, 0.4408899071539506, 0.14103464390889506, 0.07962503142346064, 0.010905672491158943, -0.22290453314811348, -0.023382773365309084, -0.10672134056101056, -0.166844923688591, -0.18339922847081497, 0.027174820181904022, -0.005746471514645481, -0.13860271633675061, 0.372008600704121, 0.1909193062383942, 0.040813787919927604, -0.13596141123613392, 0.30277986212638375, 0.04270948810379836, 0.050459846240164315, 0.11760071464548844, 0.35330401157186403, 0.20624759462553469, 0.19155799824300515, -0.23629180038555336, 0.11106694520676118, 0.00435688269838517]
|
1,803.06488
|
An extended type system with lambda-typed lambda-expressions (extended
version)
|
We present the type system $\mathtt{d}$, an extended type system with
lambda-typed lambda-expressions. It is related to type systems originating from
the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an
existential abstraction operator as well as propositional operators.
$\beta$-reduction is extended to also normalize negated expressions using a
subset of the laws of classical negation, hence $\mathtt{d}$ is normalizing
both proofs and formulas which are handled uniformly as functional expressions.
$\mathtt{d}$ is using a reflexive typing axiom for a constant $\tau$ to which
no function can be typed. Some properties are shown including confluence,
subject reduction, uniqueness of types, strong normalization, and consistency.
We illustrate how, when using $\mathtt{d}$, due to its limited logical strength
additional axioms must be added both for negation and for the mathematical
structures whose deductions are to be formalized. Several appendices deal with
extensions and variations of the proposed system.
|
cs.LO
|
we present the type system mathttd an extended type system with lambdatyped lambdaexpressions it is related to type systems originating from the automath project mathttd extends existing lambdatyped systems by an existential abstraction operator as well as propositional operators betareduction is extended to also normalize negated expressions using a subset of the laws of classical negation hence mathttd is normalizing both proofs and formulas which are handled uniformly as functional expressions mathttd is using a reflexive typing axiom for a constant tau to which no function can be typed some properties are shown including confluence subject reduction uniqueness of types strong normalization and consistency we illustrate how when using mathttd due to its limited logical strength additional axioms must be added both for negation and for the mathematical structures whose deductions are to be formalized several appendices deal with extensions and variations of the proposed system
|
[['we', 'present', 'the', 'type', 'system', 'mathttd', 'an', 'extended', 'type', 'system', 'with', 'lambdatyped', 'lambdaexpressions', 'it', 'is', 'related', 'to', 'type', 'systems', 'originating', 'from', 'the', 'automath', 'project', 'mathttd', 'extends', 'existing', 'lambdatyped', 'systems', 'by', 'an', 'existential', 'abstraction', 'operator', 'as', 'well', 'as', 'propositional', 'operators', 'betareduction', 'is', 'extended', 'to', 'also', 'normalize', 'negated', 'expressions', 'using', 'a', 'subset', 'of', 'the', 'laws', 'of', 'classical', 'negation', 'hence', 'mathttd', 'is', 'normalizing', 'both', 'proofs', 'and', 'formulas', 'which', 'are', 'handled', 'uniformly', 'as', 'functional', 'expressions', 'mathttd', 'is', 'using', 'a', 'reflexive', 'typing', 'axiom', 'for', 'a', 'constant', 'tau', 'to', 'which', 'no', 'function', 'can', 'be', 'typed', 'some', 'properties', 'are', 'shown', 'including', 'confluence', 'subject', 'reduction', 'uniqueness', 'of', 'types', 'strong', 'normalization', 'and', 'consistency', 'we', 'illustrate', 'how', 'when', 'using', 'mathttd', 'due', 'to', 'its', 'limited', 'logical', 'strength', 'additional', 'axioms', 'must', 'be', 'added', 'both', 'for', 'negation', 'and', 'for', 'the', 'mathematical', 'structures', 'whose', 'deductions', 'are', 'to', 'be', 'formalized', 'several', 'appendices', 'deal', 'with', 'extensions', 'and', 'variations', 'of', 'the', 'proposed', 'system']]
|
[-0.08018816634095656, 0.0335740242490293, -0.054690219755348275, 0.1205151114670228, -0.14150456806536355, -0.18987197857605267, 0.04292385273434426, 0.32899325775390825, -0.32117831672554553, -0.28100044805913754, 0.14630038363696396, -0.25642556547544487, -0.1119362482109764, 0.19458938562247444, -0.13501332606751493, 0.036365457727136855, 0.02540400962677006, 0.03681991259688639, -0.05761893917204436, -0.2150295872635157, 0.3263307091690702, -0.005850837165681161, 0.20345938947747066, 0.04189878874833134, 0.0643942795234592, 0.005200618177920274, -0.02463816141403497, 0.07944516971075831, -0.058200421880241736, 0.11001279556402963, 0.2653782127842894, 0.19827156992029552, 0.25847253222528793, -0.4168124276513157, -0.15343461379453488, 0.06866550630864317, 0.12473069609235335, 0.07010360990733878, 0.030151733808053582, -0.32340727837386296, 0.09466797205833208, -0.20476168641909856, -0.1032916748169044, -0.13768611045248091, 0.03535617785990774, 0.07644096252266062, -0.2531125989921187, 0.013333876793071858, 0.14296863755380276, 0.10329338610778269, -0.07882406640150393, -0.09954634632306071, -0.013915958522487278, 0.08316847791337913, 0.02003508800487608, 0.01716663225949423, 0.10799699390230522, -0.08238816258102043, -0.1458054693824012, 0.3552451486099664, -0.03885909827439631, -0.2584445405183743, 0.19488941564556364, -0.05119467507696979, -0.16042483049087636, 0.08213227279548062, 0.07369393916610845, 0.09087145573791269, -0.1840575336697328, 0.12879637352506668, -0.03042902142983185, 0.21033970167069402, 0.1082675691139055, 0.07494789333906414, 0.14902125734657254, 0.11298346495290115, 0.009136539053057053, 0.16628117573348652, 0.03727452934413434, -0.08635802088904973, -0.3615956811668122, -0.12929383499790237, -0.08343626301072232, 0.0175443145554921, -0.05346626913683706, -0.17338219683434758, 0.3151784338613602, 0.12496205394862743, 0.13247234806775637, 0.1226334575777363, 0.2684633260120778, 0.17008307907963172, 0.12312550993065337, 0.0332500535599275, 0.14892097798671275, 0.168399939348615, 0.0829625992927292, -0.14972388869859532, 0.1206174101935674, 0.1060426195553976]
|
1,803.06489
|
Experimental evidences of trions and Fermi edge singularity in single
barrier GaAs/AlAs/GaAs heterostructure using photocapacitance spectroscopy
|
In this paper, we show how photocapacitance spectra can probe two dimensional
excitonic complexes and Fermi edge singularity as a function of applied bias
around 100 K. In lower density regimes (<1x1011cm^-2), the appearance of two
distinct peaks in the spectra are identified as a signature of coexistence of
both excitons and positively charged trions. We estimate the binding energy of
these trions as ~2.0 meV. In the higher density regimes (>1x10^11 cm^-2), we
observe a sharp spectral transition from trions to asymmetric shaped Fermi edge
singularity in the photocapacitance spectra around a particular reverse bias.
However, these signatures are absent from the photoluminescence spectra
measured under identical circumstances. Such dissimilarities clearly point out
that different many body physics govern these two spectral measurements. We
also argue why such quantum confined dipoles of spatially indirect trions can
have thermodynamically finite probability to survive even around 100 K.
Finally, our observations demonstrate that photocapacitance technique, which
was seldom used to detect trions in the past, can also be useful to detect the
traces of these spatially indirect excitonic complexes as well as Fermi edge
singularity even at 100 K. This is mainly due to enhanced sensitivity of such
dielectric measurements to dipolar changes within such heterojunction.
|
cond-mat.mes-hall cond-mat.quant-gas
|
in this paper we show how photocapacitance spectra can probe two dimensional excitonic complexes and fermi edge singularity as a function of applied bias around 100 k in lower density regimes 1x1011cm2 the appearance of two distinct peaks in the spectra are identified as a signature of coexistence of both excitons and positively charged trions we estimate the binding energy of these trions as 20 mev in the higher density regimes 1x1011 cm2 we observe a sharp spectral transition from trions to asymmetric shaped fermi edge singularity in the photocapacitance spectra around a particular reverse bias however these signatures are absent from the photoluminescence spectra measured under identical circumstances such dissimilarities clearly point out that different many body physics govern these two spectral measurements we also argue why such quantum confined dipoles of spatially indirect trions can have thermodynamically finite probability to survive even around 100 k finally our observations demonstrate that photocapacitance technique which was seldom used to detect trions in the past can also be useful to detect the traces of these spatially indirect excitonic complexes as well as fermi edge singularity even at 100 k this is mainly due to enhanced sensitivity of such dielectric measurements to dipolar changes within such heterojunction
|
[['in', 'this', 'paper', 'we', 'show', 'how', 'photocapacitance', 'spectra', 'can', 'probe', 'two', 'dimensional', 'excitonic', 'complexes', 'and', 'fermi', 'edge', 'singularity', 'as', 'a', 'function', 'of', 'applied', 'bias', 'around', '100', 'k', 'in', 'lower', 'density', 'regimes', '1x1011cm2', 'the', 'appearance', 'of', 'two', 'distinct', 'peaks', 'in', 'the', 'spectra', 'are', 'identified', 'as', 'a', 'signature', 'of', 'coexistence', 'of', 'both', 'excitons', 'and', 'positively', 'charged', 'trions', 'we', 'estimate', 'the', 'binding', 'energy', 'of', 'these', 'trions', 'as', '20', 'mev', 'in', 'the', 'higher', 'density', 'regimes', '1x1011', 'cm2', 'we', 'observe', 'a', 'sharp', 'spectral', 'transition', 'from', 'trions', 'to', 'asymmetric', 'shaped', 'fermi', 'edge', 'singularity', 'in', 'the', 'photocapacitance', 'spectra', 'around', 'a', 'particular', 'reverse', 'bias', 'however', 'these', 'signatures', 'are', 'absent', 'from', 'the', 'photoluminescence', 'spectra', 'measured', 'under', 'identical', 'circumstances', 'such', 'dissimilarities', 'clearly', 'point', 'out', 'that', 'different', 'many', 'body', 'physics', 'govern', 'these', 'two', 'spectral', 'measurements', 'we', 'also', 'argue', 'why', 'such', 'quantum', 'confined', 'dipoles', 'of', 'spatially', 'indirect', 'trions', 'can', 'have', 'thermodynamically', 'finite', 'probability', 'to', 'survive', 'even', 'around', '100', 'k', 'finally', 'our', 'observations', 'demonstrate', 'that', 'photocapacitance', 'technique', 'which', 'was', 'seldom', 'used', 'to', 'detect', 'trions', 'in', 'the', 'past', 'can', 'also', 'be', 'useful', 'to', 'detect', 'the', 'traces', 'of', 'these', 'spatially', 'indirect', 'excitonic', 'complexes', 'as', 'well', 'as', 'fermi', 'edge', 'singularity', 'even', 'at', '100', 'k', 'this', 'is', 'mainly', 'due', 'to', 'enhanced', 'sensitivity', 'of', 'such', 'dielectric', 'measurements', 'to', 'dipolar', 'changes', 'within', 'such', 'heterojunction']]
|
[-0.11054152413528166, 0.18583165188251502, -0.07168599925911595, 0.11568716688791528, 0.013417183595461835, -0.1656871483268618, 0.04177197837898526, 0.43997934374812186, -0.2659648720622428, -0.31921118879051624, 0.016886128061314058, -0.3217049863043369, -0.11669060406383519, 0.1502833928497435, 0.018543036815803954, -0.01777068999431589, 0.00658872843646974, -0.019432857390675767, -0.04884428125988765, -0.18370983281912392, 0.3020166554579548, 0.04643008264932124, 0.2654283102693073, 0.13853246043407696, 0.005659394241257699, -0.04758042750501202, 0.061725260705833195, 0.05262614263554889, -0.14573039300918098, 0.048785575515199416, 0.32113678452065764, -0.02126656843093395, 0.19911724177654833, -0.40633318341318886, -0.20475385033447915, 0.10348289215129197, 0.20271983734153978, 0.11617053056982637, -0.06169871894606188, -0.2815369159467153, 0.07806222511149541, -0.13516112399177954, -0.11996165688569639, -0.07139011136228766, -0.01090997980231894, 0.016562543254158478, -0.18241661298659392, 0.13093056957558136, 0.022018390349865725, 0.028481883195448008, -0.09830950640881543, -0.10807337755949109, -0.058441136034625564, 0.08394532939921334, 0.021574272921391052, -0.019714359405756398, 0.19707843339225897, -0.10677935956429042, -0.11593374408331845, 0.3314601230896169, -0.12081651798792996, -0.0751386329180141, 0.22918581152700035, -0.21639721747031251, -0.1026134194267512, 0.20402149102358402, 0.12650040684178854, 0.13536712647456786, -0.11405532311547693, 0.02451667363707469, -0.018524013069348737, 0.16207188708030312, 0.10824442891844585, 0.11330083898193312, 0.2724948373974721, 0.09800545972892923, 0.06011182920837218, 0.11643953582696508, -0.16281006920868166, -0.05227673404128747, -0.25086832024652383, -0.1415012558099275, -0.18773034663286572, 0.09239071314953559, -0.040469911111394336, -0.1540274306784804, 0.40085030622938966, 0.12804618948590074, 0.25539704565616217, -0.03718033908151876, 0.24181916802327202, 0.09482533236915319, 0.06581657347451969, 0.034550177920655366, 0.2679138288527325, 0.12189168219714809, 0.07278759005324294, -0.21656506610166865, 0.026046538265540684, -0.04685235062760173]
|
1,803.0649
|
Robust event-stream pattern tracking based on correlative filter
|
Object tracking based on retina-inspired and event-based dynamic vision
sensor (DVS) is challenging for the noise events, rapid change of event-stream
shape, chaos of complex background textures, and occlusion. To address these
challenges, this paper presents a robust event-stream pattern tracking method
based on correlative filter mechanism. In the proposed method, rate coding is
used to encode the event-stream object in each segment. Feature representations
from hierarchical convolutional layers of a deep convolutional neural network
(CNN) are used to represent the appearance of the rate encoded event-stream
object. The results prove that our method not only achieves good tracking
performance in many complicated scenes with noise events, complex background
textures, occlusion, and intersected trajectories, but also is robust to
variable scale, variable pose, and non-rigid deformations. In addition, this
correlative filter based event-stream tracking has the advantage of high speed.
The proposed approach will promote the potential applications of these
event-based vision sensors in self-driving, robots and many other high-speed
scenes.
|
cs.CV
|
object tracking based on retinainspired and eventbased dynamic vision sensor dvs is challenging for the noise events rapid change of eventstream shape chaos of complex background textures and occlusion to address these challenges this paper presents a robust eventstream pattern tracking method based on correlative filter mechanism in the proposed method rate coding is used to encode the eventstream object in each segment feature representations from hierarchical convolutional layers of a deep convolutional neural network cnn are used to represent the appearance of the rate encoded eventstream object the results prove that our method not only achieves good tracking performance in many complicated scenes with noise events complex background textures occlusion and intersected trajectories but also is robust to variable scale variable pose and nonrigid deformations in addition this correlative filter based eventstream tracking has the advantage of high speed the proposed approach will promote the potential applications of these eventbased vision sensors in selfdriving robots and many other highspeed scenes
|
[['object', 'tracking', 'based', 'on', 'retinainspired', 'and', 'eventbased', 'dynamic', 'vision', 'sensor', 'dvs', 'is', 'challenging', 'for', 'the', 'noise', 'events', 'rapid', 'change', 'of', 'eventstream', 'shape', 'chaos', 'of', 'complex', 'background', 'textures', 'and', 'occlusion', 'to', 'address', 'these', 'challenges', 'this', 'paper', 'presents', 'a', 'robust', 'eventstream', 'pattern', 'tracking', 'method', 'based', 'on', 'correlative', 'filter', 'mechanism', 'in', 'the', 'proposed', 'method', 'rate', 'coding', 'is', 'used', 'to', 'encode', 'the', 'eventstream', 'object', 'in', 'each', 'segment', 'feature', 'representations', 'from', 'hierarchical', 'convolutional', 'layers', 'of', 'a', 'deep', 'convolutional', 'neural', 'network', 'cnn', 'are', 'used', 'to', 'represent', 'the', 'appearance', 'of', 'the', 'rate', 'encoded', 'eventstream', 'object', 'the', 'results', 'prove', 'that', 'our', 'method', 'not', 'only', 'achieves', 'good', 'tracking', 'performance', 'in', 'many', 'complicated', 'scenes', 'with', 'noise', 'events', 'complex', 'background', 'textures', 'occlusion', 'and', 'intersected', 'trajectories', 'but', 'also', 'is', 'robust', 'to', 'variable', 'scale', 'variable', 'pose', 'and', 'nonrigid', 'deformations', 'in', 'addition', 'this', 'correlative', 'filter', 'based', 'eventstream', 'tracking', 'has', 'the', 'advantage', 'of', 'high', 'speed', 'the', 'proposed', 'approach', 'will', 'promote', 'the', 'potential', 'applications', 'of', 'these', 'eventbased', 'vision', 'sensors', 'in', 'selfdriving', 'robots', 'and', 'many', 'other', 'highspeed', 'scenes']]
|
[-0.10895704734575702, 0.0016049106227001176, -0.08426410843005953, 0.03710802424757276, -0.1009627145511331, -0.19453374379809246, -0.04663496948269312, 0.4706801219843328, -0.2807014599908143, -0.3327142702997662, 0.08851566500889022, -0.23674730836355593, -0.25660867262631654, 0.18258724679762964, -0.2448259649623651, 0.1400921607957571, 0.15452152487123386, 0.035673410465824416, -0.024598641096963546, -0.21939519680163358, 0.24929820894030855, 0.04011892971011548, 0.3542099520927877, -0.016619340586476027, 0.19982598706556018, -0.008008055973914453, -0.06864085913402959, -0.019660799502889858, -0.0027184924229459286, 0.17187904984748456, 0.3113790495088324, 0.14739208694163608, 0.22890781949827216, -0.43550411775067915, -0.25325095773878276, 0.08219903731369413, 0.1462625705084065, 0.09715698559302836, -0.07205065508460393, -0.39492896874435246, 0.10247295342269354, -0.14953139459248632, -0.03129839994653594, -0.12994441362388898, 0.01616258761205245, -0.005852263406268321, -0.2804504367202753, 0.06279448658297042, 0.06183956255554222, 0.04360258227097802, -0.05675744946784107, -0.05140938590920996, 0.05520588444487658, 0.17552935068961234, 0.020198697930027265, 0.051040320980246176, 0.20655525489710272, -0.21903484597642092, -0.13384850718139205, 0.3463007099868264, -0.006248063285602257, -0.24493137427125475, 0.22089122724573826, -0.07019740634423215, -0.15186499871779233, 0.1780185587456799, 0.25058830553898587, 0.13923037507920527, -0.1654842761287, -0.018916878626987453, 0.0009621087570849341, 0.1963183322652185, 0.070525855703454, 0.03738523793872446, 0.20515690262109273, 0.2707186574931256, 0.07384809390568989, 0.09126361730341159, -0.21943740893620997, -0.07075191924668615, -0.19364761674660258, -0.06768717374070547, -0.16738138786604395, -0.07487945772727471, -0.1158447699500357, -0.1634508381364867, 0.4143711619952228, 0.2655391804524697, 0.2290224511642009, 0.037965170353709256, 0.3668077250462375, 0.00912313021326554, 0.10987541182548739, 0.04684122600883711, 0.18286312907584942, 0.024645880001480693, 0.16670884644008765, -0.17089332268660656, 0.09276887823216384, 0.07089543694455643]
|
1,803.06491
|
Solutions of the $U_q(\widehat{\mathfrak{sl}}_N)$ reflection equations
|
We find the complete set of invertible solutions of the untwisted and twisted
reflection equations for the Bazhanov-Jimbo R-matrix of type ${\mathrm
A}^{(1)}_{N-1}$. We also show that all invertible solutions can be obtained by
an appropriate affinization procedure from solutions of the constant untwisted
and twisted reflection equations.
|
math-ph hep-th math.MP nlin.SI
|
we find the complete set of invertible solutions of the untwisted and twisted reflection equations for the bazhanovjimbo rmatrix of type mathrm a1_n1 we also show that all invertible solutions can be obtained by an appropriate affinization procedure from solutions of the constant untwisted and twisted reflection equations
|
[['we', 'find', 'the', 'complete', 'set', 'of', 'invertible', 'solutions', 'of', 'the', 'untwisted', 'and', 'twisted', 'reflection', 'equations', 'for', 'the', 'bazhanovjimbo', 'rmatrix', 'of', 'type', 'mathrm', 'a1_n1', 'we', 'also', 'show', 'that', 'all', 'invertible', 'solutions', 'can', 'be', 'obtained', 'by', 'an', 'appropriate', 'affinization', 'procedure', 'from', 'solutions', 'of', 'the', 'constant', 'untwisted', 'and', 'twisted', 'reflection', 'equations']]
|
[-0.16364233733645264, 0.07651604853968007, -0.020678466760573236, 0.04502822270002613, -0.0916001377330023, -0.15762548144668975, -0.015759605835092828, 0.3542108701423128, -0.31787569725767095, -0.19718937397478742, 0.15827341488701233, -0.2233978047015819, -0.1472049892899838, 0.21311368904215225, -0.059779496096877105, 0.046776077234523095, 0.07492779413277799, 0.07671447447005739, -0.15195762625142456, -0.2312911949021385, 0.41974219877986196, -0.05227793743239438, 0.23459745246045133, -0.0011919392669137488, 0.11974282982818624, 0.0062410650338898315, -0.015713362776218577, 0.002093325240260109, -0.15243813885512708, 0.08813902147688922, 0.23546109708184573, 0.06173126336107863, 0.07765936213446424, -0.4332106210132863, -0.12189955058250021, 0.06823443523310918, 0.1794968138008002, 0.07956378856931437, -0.0247238547481755, -0.279065544300891, 0.08895757673506408, -0.2147405457861246, -0.2117256320656297, -0.07944185698920107, 0.013904374647647776, 0.03757564628377874, -0.30558252150807136, 0.07153199658112383, 0.04996151592027634, 0.02810123971009508, -0.18514064575565306, -0.07827810180234782, -0.10583464374785569, 0.08978974951946354, -0.01768614039657281, -0.05021716580983806, 0.04141282581506257, -0.13299889868481996, -0.11300582319815108, 0.3529920258579102, -0.06298122244906869, -0.2508183742695032, 0.07157147703494163, -0.12798764260406506, -0.1330228769121335, 0.15589601767467373, 0.026407601955802516, 0.16788141296908973, -0.09377496281361326, 0.19029469851235997, -0.13965471070061655, 0.10107615090748097, 0.09207774254869908, -0.05835088789760274, 0.12929886894577997, -0.022109627565170858, 0.06175861012765226, 0.12258870857817299, 0.047666735709347624, -0.040423683247509154, -0.40791363395909047, -0.19678672906407652, -0.03194047893308341, 0.18311846359296047, -0.11724125315432754, -0.19050050281146738, 0.3673679191381373, 0.10948160854465466, 0.15791234885282973, 0.06258078898362657, 0.17406908391003914, 0.20587012641152933, 0.06993946539574956, 0.08519037295766968, 0.16773710926955052, 0.1880151589668574, 0.018049575883815897, -0.21890861861546465, -0.09104602869124488, 0.2210557277690857]
|
1,803.06492
|
Evolving Deep Convolutional Neural Networks by Variable-length Particle
Swarm Optimization for Image Classification
|
Convolutional neural networks (CNNs) are one of the most effective deep
learning methods to solve image classification problems, but the best
architecture of a CNN to solve a specific problem can be extremely complicated
and hard to design. This paper focuses on utilising Particle Swarm Optimisation
(PSO) to automatically search for the optimal architecture of CNNs without any
manual work involved. In order to achieve the goal, three improvements are made
based on traditional PSO. First, a novel encoding strategy inspired by computer
networks which empowers particle vectors to easily encode CNN layers is
proposed; Second, in order to allow the proposed method to learn
variable-length CNN architectures, a Disabled layer is designed to hide some
dimensions of the particle vector to achieve variable-length particles; Third,
since the learning process on large data is slow, partial datasets are randomly
picked for the evaluation to dramatically speed it up. The proposed algorithm
is examined and compared with 12 existing algorithms including the state-of-art
methods on three widely used image classification benchmark datasets. The
experimental results show that the proposed algorithm is a strong competitor to
the state-of-art algorithms in terms of classification error. This is the first
work using PSO for automatically evolving the architectures of CNNs.
|
cs.NE cs.CV
|
convolutional neural networks cnns are one of the most effective deep learning methods to solve image classification problems but the best architecture of a cnn to solve a specific problem can be extremely complicated and hard to design this paper focuses on utilising particle swarm optimisation pso to automatically search for the optimal architecture of cnns without any manual work involved in order to achieve the goal three improvements are made based on traditional pso first a novel encoding strategy inspired by computer networks which empowers particle vectors to easily encode cnn layers is proposed second in order to allow the proposed method to learn variablelength cnn architectures a disabled layer is designed to hide some dimensions of the particle vector to achieve variablelength particles third since the learning process on large data is slow partial datasets are randomly picked for the evaluation to dramatically speed it up the proposed algorithm is examined and compared with 12 existing algorithms including the stateofart methods on three widely used image classification benchmark datasets the experimental results show that the proposed algorithm is a strong competitor to the stateofart algorithms in terms of classification error this is the first work using pso for automatically evolving the architectures of cnns
|
[['convolutional', 'neural', 'networks', 'cnns', 'are', 'one', 'of', 'the', 'most', 'effective', 'deep', 'learning', 'methods', 'to', 'solve', 'image', 'classification', 'problems', 'but', 'the', 'best', 'architecture', 'of', 'a', 'cnn', 'to', 'solve', 'a', 'specific', 'problem', 'can', 'be', 'extremely', 'complicated', 'and', 'hard', 'to', 'design', 'this', 'paper', 'focuses', 'on', 'utilising', 'particle', 'swarm', 'optimisation', 'pso', 'to', 'automatically', 'search', 'for', 'the', 'optimal', 'architecture', 'of', 'cnns', 'without', 'any', 'manual', 'work', 'involved', 'in', 'order', 'to', 'achieve', 'the', 'goal', 'three', 'improvements', 'are', 'made', 'based', 'on', 'traditional', 'pso', 'first', 'a', 'novel', 'encoding', 'strategy', 'inspired', 'by', 'computer', 'networks', 'which', 'empowers', 'particle', 'vectors', 'to', 'easily', 'encode', 'cnn', 'layers', 'is', 'proposed', 'second', 'in', 'order', 'to', 'allow', 'the', 'proposed', 'method', 'to', 'learn', 'variablelength', 'cnn', 'architectures', 'a', 'disabled', 'layer', 'is', 'designed', 'to', 'hide', 'some', 'dimensions', 'of', 'the', 'particle', 'vector', 'to', 'achieve', 'variablelength', 'particles', 'third', 'since', 'the', 'learning', 'process', 'on', 'large', 'data', 'is', 'slow', 'partial', 'datasets', 'are', 'randomly', 'picked', 'for', 'the', 'evaluation', 'to', 'dramatically', 'speed', 'it', 'up', 'the', 'proposed', 'algorithm', 'is', 'examined', 'and', 'compared', 'with', '12', 'existing', 'algorithms', 'including', 'the', 'stateofart', 'methods', 'on', 'three', 'widely', 'used', 'image', 'classification', 'benchmark', 'datasets', 'the', 'experimental', 'results', 'show', 'that', 'the', 'proposed', 'algorithm', 'is', 'a', 'strong', 'competitor', 'to', 'the', 'stateofart', 'algorithms', 'in', 'terms', 'of', 'classification', 'error', 'this', 'is', 'the', 'first', 'work', 'using', 'pso', 'for', 'automatically', 'evolving', 'the', 'architectures', 'of', 'cnns']]
|
[-0.0390496247626606, -0.028298351915951057, -0.05996140021518849, 0.05960387342135786, -0.12225608414635786, -0.21656806646304846, -0.0017095598142404219, 0.44884144197878184, -0.2805227358284117, -0.36656564645903206, 0.09247896483550029, -0.2314926846290812, -0.20393669320433175, 0.2126850739185861, -0.11413798356446826, 0.14641148814065744, 0.12800807510819107, 0.04348160320490563, -0.06594816769373793, -0.35431331166041363, 0.28582831205702974, 0.0673101363460323, 0.3482879281622692, -0.01245918619085908, 0.14087415371910733, -0.06071328681337566, -0.025826632812081213, -0.018909274812932444, -0.050598843833743835, 0.1906976349989757, 0.286780184056854, 0.1680294778921361, 0.3142502487239256, -0.40816265313424965, -0.20773635425794762, 0.10496728734714567, 0.17395143238183347, 0.12542980894385905, -0.023958512021282925, -0.3169830763233301, 0.1306603407697499, -0.13216104815506097, -0.00223390563409233, -0.13337122903033657, -0.04775190748160171, -0.001079031252709118, -0.30324132732811915, -0.007100680639127549, 0.054543860412645834, -0.007339559108904988, -0.03501951825823092, -0.13287992427098447, 0.07165472082074877, 0.13945802685904127, 0.028266209048118433, 0.0858235300226969, 0.14716586051056685, -0.16270742871690072, -0.19122159902404234, 0.3612962161389731, -0.029225218882874666, -0.23668702555824866, 0.20867196478749833, 0.014740378880710567, -0.15644437780386758, 0.14364103545678905, 0.26252257409369917, 0.13481852346669557, -0.18163580850933145, 0.00042279877584626516, -0.017940366306134218, 0.20095714973850917, 0.03931693394229865, -0.032133796100857336, 0.13563709494938114, 0.28379808619473745, 0.04512237896492877, 0.1344627074233835, -0.1338086768609553, -0.09953496035739996, -0.16939987344396057, -0.10514775971097655, -0.21504157833253187, -0.06641000904509056, -0.08988868369148972, -0.13140617944482427, 0.42029978664257356, 0.25113233607337254, 0.18462362697402251, 0.09686101960454552, 0.36420839207215255, 0.02949877632601024, 0.16590669122581073, 0.10845900906331259, 0.2213858433664851, 0.045289503103031696, 0.142827119917871, -0.17203811114980022, 0.05724249551190262, 0.0964017833822669]
|
1,803.06493
|
Actin filaments growing against an elastic membrane: Effect of membrane
tension
|
We study the force generation by a set of parallel actin filaments growing
against an elastic membrane. The elastic membrane tries to stay flat and any
deformation from this flat state, either caused by thermal fluctuations or due
to protrusive polymerization force exerted by the filaments, costs energy. We
study two lattice models to describe the membrane dynamics. In one case, the
energy cost is assumed to be proportional to the absolute magnitude of the
height gradient (gradient model) and in the other case it is proportional to
the square of the height gradient (Gaussian model). For the gradient model we
find that the membrane velocity is a non-monotonic function of the elastic
constant $\mu$, and reaches a peak at $\mu=\mu^\ast$. For $\mu < \mu^\ast$ the
system fails to reach a steady state and the membrane energy keeps increasing
with time. For the Gaussian model, the system always reaches a steady state and
the membrane velocity decreases monotonically with the elastic constant $\nu$
for all nonzero values of $\nu$. Multiple filaments give rise to protrusions at
different regions of the membrane and the elasticity of the membrane induces an
effective attraction between the two protrusions in the Gaussian model which
causes the protrusions to merge and a single wide protrusion is present in the
system. In both the models, the relative time-scale between the membrane and
filament dynamics plays an important role in deciding whether the shape of
elasticity-velocity curve is concave or convex. Our numerical simulations agree
reasonably well with our analytical calculations.
|
physics.bio-ph cond-mat.soft cond-mat.stat-mech
|
we study the force generation by a set of parallel actin filaments growing against an elastic membrane the elastic membrane tries to stay flat and any deformation from this flat state either caused by thermal fluctuations or due to protrusive polymerization force exerted by the filaments costs energy we study two lattice models to describe the membrane dynamics in one case the energy cost is assumed to be proportional to the absolute magnitude of the height gradient gradient model and in the other case it is proportional to the square of the height gradient gaussian model for the gradient model we find that the membrane velocity is a nonmonotonic function of the elastic constant mu and reaches a peak at mumuast for mu muast the system fails to reach a steady state and the membrane energy keeps increasing with time for the gaussian model the system always reaches a steady state and the membrane velocity decreases monotonically with the elastic constant nu for all nonzero values of nu multiple filaments give rise to protrusions at different regions of the membrane and the elasticity of the membrane induces an effective attraction between the two protrusions in the gaussian model which causes the protrusions to merge and a single wide protrusion is present in the system in both the models the relative timescale between the membrane and filament dynamics plays an important role in deciding whether the shape of elasticityvelocity curve is concave or convex our numerical simulations agree reasonably well with our analytical calculations
|
[['we', 'study', 'the', 'force', 'generation', 'by', 'a', 'set', 'of', 'parallel', 'actin', 'filaments', 'growing', 'against', 'an', 'elastic', 'membrane', 'the', 'elastic', 'membrane', 'tries', 'to', 'stay', 'flat', 'and', 'any', 'deformation', 'from', 'this', 'flat', 'state', 'either', 'caused', 'by', 'thermal', 'fluctuations', 'or', 'due', 'to', 'protrusive', 'polymerization', 'force', 'exerted', 'by', 'the', 'filaments', 'costs', 'energy', 'we', 'study', 'two', 'lattice', 'models', 'to', 'describe', 'the', 'membrane', 'dynamics', 'in', 'one', 'case', 'the', 'energy', 'cost', 'is', 'assumed', 'to', 'be', 'proportional', 'to', 'the', 'absolute', 'magnitude', 'of', 'the', 'height', 'gradient', 'gradient', 'model', 'and', 'in', 'the', 'other', 'case', 'it', 'is', 'proportional', 'to', 'the', 'square', 'of', 'the', 'height', 'gradient', 'gaussian', 'model', 'for', 'the', 'gradient', 'model', 'we', 'find', 'that', 'the', 'membrane', 'velocity', 'is', 'a', 'nonmonotonic', 'function', 'of', 'the', 'elastic', 'constant', 'mu', 'and', 'reaches', 'a', 'peak', 'at', 'mumuast', 'for', 'mu', 'muast', 'the', 'system', 'fails', 'to', 'reach', 'a', 'steady', 'state', 'and', 'the', 'membrane', 'energy', 'keeps', 'increasing', 'with', 'time', 'for', 'the', 'gaussian', 'model', 'the', 'system', 'always', 'reaches', 'a', 'steady', 'state', 'and', 'the', 'membrane', 'velocity', 'decreases', 'monotonically', 'with', 'the', 'elastic', 'constant', 'nu', 'for', 'all', 'nonzero', 'values', 'of', 'nu', 'multiple', 'filaments', 'give', 'rise', 'to', 'protrusions', 'at', 'different', 'regions', 'of', 'the', 'membrane', 'and', 'the', 'elasticity', 'of', 'the', 'membrane', 'induces', 'an', 'effective', 'attraction', 'between', 'the', 'two', 'protrusions', 'in', 'the', 'gaussian', 'model', 'which', 'causes', 'the', 'protrusions', 'to', 'merge', 'and', 'a', 'single', 'wide', 'protrusion', 'is', 'present', 'in', 'the', 'system', 'in', 'both', 'the', 'models', 'the', 'relative', 'timescale', 'between', 'the', 'membrane', 'and', 'filament', 'dynamics', 'plays', 'an', 'important', 'role', 'in', 'deciding', 'whether', 'the', 'shape', 'of', 'elasticityvelocity', 'curve', 'is', 'concave', 'or', 'convex', 'our', 'numerical', 'simulations', 'agree', 'reasonably', 'well', 'with', 'our', 'analytical', 'calculations']]
|
[-0.13206544298070122, 0.15434718023621768, -0.06093073818105388, 0.001436385607153949, -0.015778270466587103, -0.13014297929603563, 0.01215852380997364, 0.37516068701390676, -0.31386766495160845, -0.26104917008693207, 0.04842039027095464, -0.2812495655101906, -0.12684101828066002, 0.14453827109896536, -0.017100078213321736, 0.023517744774817474, 0.013903360990102429, 0.03817868314449679, -0.003969945749815227, -0.17611353568903418, 0.28006608014141554, 0.08779921996188295, 0.30171581483687243, 0.07630769187766331, 0.11093004454535792, -0.018376871976867853, 0.03796240702583139, 0.038620788373973265, -0.17315762015760516, 0.07313647300034642, 0.15363508726849218, 0.011333382034032379, 0.2700614135868224, -0.4578832336645796, -0.206413348756853, 0.12676717752249414, 0.1284775646362617, 0.12212780435371075, 0.011181478935898657, -0.2022686246207422, 0.048336884440980346, -0.1360108695508712, -0.16453670236129922, -0.010764347683393445, 0.05284208308096485, 0.04034093443018596, -0.24594671796057446, 0.1418697679394706, 0.04068921423537227, 0.011001114621479019, -0.13602924461205643, -0.09311929611773026, -0.056305944754471225, 0.11836887919668672, 0.08850104006728995, 0.08483497792645264, 0.2329617324041711, -0.15494676377806085, -0.05023693063656291, 0.36296093518812345, -0.09259820133781588, -0.22000997359920071, 0.1909334230277524, -0.1206287313976225, -0.03137872514845544, 0.17200365329562015, 0.1545016695633976, 0.06744196179633184, -0.09513231346094275, 0.04824736078206702, 0.0048642447654276616, 0.17931057509699042, 0.06430858211959174, -0.05375955283986887, 0.2327008513414646, 0.17421261838403534, 0.09258564540270374, 0.16544042718555013, -0.11717653936665669, -0.12914603899429697, -0.3117711017582198, -0.1342978362945758, -0.13997165529767935, 0.025893838714392655, -0.10933230879978162, -0.20039419455646698, 0.36021589859856284, 0.07558924570935685, 0.2402866395819743, 0.08142753504680476, 0.28962954345476477, 0.10358444768041455, 0.07224075229044455, 0.08097041245787386, 0.26328310651511727, 0.13770678491759267, 0.10206012798898086, -0.27515461521392015, 0.071132987229788, 0.02673003477493368]
|
1,803.06494
|
Attack Trees in Isabelle
|
In this paper, we present a proof theory for attack trees. Attack trees are a
well established and useful model for the construction of attacks on systems
since they allow a stepwise exploration of high level attacks in application
scenarios. Using the expressiveness of Higher Order Logic in Isabelle, we
succeed in developing a generic theory of attack trees with a state-based
semantics based on Kripke structures and CTL. The resulting framework allows
mechanically supported logic analysis of the meta-theory of the proof calculus
of attack trees and at the same time the developed proof theory enables
application to case studies. A central correctness and completeness result
proved in Isabelle establishes a connection between the notion of attack tree
validity and CTL. The application is illustrated on the example of a healthcare
IoT system and GDPR compliance verification.
|
cs.CR cs.LO
|
in this paper we present a proof theory for attack trees attack trees are a well established and useful model for the construction of attacks on systems since they allow a stepwise exploration of high level attacks in application scenarios using the expressiveness of higher order logic in isabelle we succeed in developing a generic theory of attack trees with a statebased semantics based on kripke structures and ctl the resulting framework allows mechanically supported logic analysis of the metatheory of the proof calculus of attack trees and at the same time the developed proof theory enables application to case studies a central correctness and completeness result proved in isabelle establishes a connection between the notion of attack tree validity and ctl the application is illustrated on the example of a healthcare iot system and gdpr compliance verification
|
[['in', 'this', 'paper', 'we', 'present', 'a', 'proof', 'theory', 'for', 'attack', 'trees', 'attack', 'trees', 'are', 'a', 'well', 'established', 'and', 'useful', 'model', 'for', 'the', 'construction', 'of', 'attacks', 'on', 'systems', 'since', 'they', 'allow', 'a', 'stepwise', 'exploration', 'of', 'high', 'level', 'attacks', 'in', 'application', 'scenarios', 'using', 'the', 'expressiveness', 'of', 'higher', 'order', 'logic', 'in', 'isabelle', 'we', 'succeed', 'in', 'developing', 'a', 'generic', 'theory', 'of', 'attack', 'trees', 'with', 'a', 'statebased', 'semantics', 'based', 'on', 'kripke', 'structures', 'and', 'ctl', 'the', 'resulting', 'framework', 'allows', 'mechanically', 'supported', 'logic', 'analysis', 'of', 'the', 'metatheory', 'of', 'the', 'proof', 'calculus', 'of', 'attack', 'trees', 'and', 'at', 'the', 'same', 'time', 'the', 'developed', 'proof', 'theory', 'enables', 'application', 'to', 'case', 'studies', 'a', 'central', 'correctness', 'and', 'completeness', 'result', 'proved', 'in', 'isabelle', 'establishes', 'a', 'connection', 'between', 'the', 'notion', 'of', 'attack', 'tree', 'validity', 'and', 'ctl', 'the', 'application', 'is', 'illustrated', 'on', 'the', 'example', 'of', 'a', 'healthcare', 'iot', 'system', 'and', 'gdpr', 'compliance', 'verification']]
|
[-0.14728336749164778, -0.007000268767655328, -0.11115629925473552, 0.11160001228900923, -0.09725592804033363, -0.17357181328470292, 0.13446033123772647, 0.31236371225879894, -0.22216174779189884, -0.29743839950179274, 0.13129981485046988, -0.21436733543458208, -0.17454018796443183, 0.2077598799192144, -0.12899792130253668, 0.0950739361224291, 0.03798707242231762, 0.02759684415270939, -0.001861507262852367, -0.2369309127587231, 0.3053536883190922, 0.03887746371733754, 0.3036958476515028, 0.08030285820891352, 0.0955023698211796, 0.09258372088442084, -0.016176279728719288, 0.027104257460872548, -0.11025941699567804, 0.1539905411798669, 0.34018711831278936, 0.22084465846621795, 0.3004236337998747, -0.42068593299853196, -0.13622609624091664, 0.048117922900744, 0.08495486359469646, 0.146514562242057, -0.03485780260508772, -0.3298570284522071, 0.10273282648658083, -0.24900566442680638, -0.1325228363815425, -0.09435252823016566, 0.0028905634147425494, -0.0025039038897586474, -0.2089482695336683, -0.04024238676588605, 0.15329020533017287, 0.1307767254664846, -0.04005405421248988, -0.03156480770912427, -0.02543393419245663, 0.07248132358106069, -0.001590115809475706, -0.03891344910105387, 0.14456281711792815, -0.06332963732563877, -0.20773492110353234, 0.32256539502734505, -0.019481063038414424, -0.16569486583171386, 0.20835586964402456, -0.033464294014687555, -0.20882544353050922, 0.03848275343678298, 0.16137299873272254, 0.14944773174120465, -0.1150875874892876, 0.11789082704142304, 0.006165435119275598, 0.19249203508598325, 0.11137799761069102, 0.013422815183150595, 0.1645301855523544, 0.2745250101872733, 0.0658166129142046, 0.16749048844465744, 0.01722326680201281, -0.10996869842832287, -0.29510130484898883, -0.1812043961838134, -0.09421945963243859, -0.030838491070333977, -0.08085223913561397, -0.17758956377772425, 0.3847645104633293, 0.185364531938567, 0.11554222684893486, 0.18765445988105636, 0.34197150890216016, 0.07233823855083597, 0.04758213057884596, 0.037080958212280406, 0.16312038264637205, 0.17263090723882552, 0.12461070938413774, -0.11240701728156241, 0.16215611832297366, 0.10972934603299675]
|
1,803.06495
|
Superior mechanical flexibility and strained-engineered direct-indirect
band gap transition of green phosphorene
|
Most recently, a brand new phosphorus allotrope called green phosphorus has
been predicted, which has a direct band gap up to 2.4 eV, and its single-layer
form termed green phosphorene shows high stability. Here the mechanical
properties and the uniaxial strain effect on the electronic band structure of
green phosphorene along two perpendicular in-plane directions are investigated.
Remarkably, we find that this material can sustain a tensile strain in the
armchair direction up to a threshold of 35\% which is larger than that of black
phosphorene, suggesting that green phosphorene is more puckered. Our
calculations also show the Young's modulus and Poisson's ratio in the zigzag
direction are four times larger than those in the armchair direction, which
confirm the anisotropy of the material. Furthermore, the uniaxial strain can
trigger the direct-indirect band gap transition for green phosphorene and the
critical strains for the band gap transition are revealed.
|
cond-mat.mtrl-sci
|
most recently a brand new phosphorus allotrope called green phosphorus has been predicted which has a direct band gap up to 24 ev and its singlelayer form termed green phosphorene shows high stability here the mechanical properties and the uniaxial strain effect on the electronic band structure of green phosphorene along two perpendicular inplane directions are investigated remarkably we find that this material can sustain a tensile strain in the armchair direction up to a threshold of 35 which is larger than that of black phosphorene suggesting that green phosphorene is more puckered our calculations also show the youngs modulus and poissons ratio in the zigzag direction are four times larger than those in the armchair direction which confirm the anisotropy of the material furthermore the uniaxial strain can trigger the directindirect band gap transition for green phosphorene and the critical strains for the band gap transition are revealed
|
[['most', 'recently', 'a', 'brand', 'new', 'phosphorus', 'allotrope', 'called', 'green', 'phosphorus', 'has', 'been', 'predicted', 'which', 'has', 'a', 'direct', 'band', 'gap', 'up', 'to', '24', 'ev', 'and', 'its', 'singlelayer', 'form', 'termed', 'green', 'phosphorene', 'shows', 'high', 'stability', 'here', 'the', 'mechanical', 'properties', 'and', 'the', 'uniaxial', 'strain', 'effect', 'on', 'the', 'electronic', 'band', 'structure', 'of', 'green', 'phosphorene', 'along', 'two', 'perpendicular', 'inplane', 'directions', 'are', 'investigated', 'remarkably', 'we', 'find', 'that', 'this', 'material', 'can', 'sustain', 'a', 'tensile', 'strain', 'in', 'the', 'armchair', 'direction', 'up', 'to', 'a', 'threshold', 'of', '35', 'which', 'is', 'larger', 'than', 'that', 'of', 'black', 'phosphorene', 'suggesting', 'that', 'green', 'phosphorene', 'is', 'more', 'puckered', 'our', 'calculations', 'also', 'show', 'the', 'youngs', 'modulus', 'and', 'poissons', 'ratio', 'in', 'the', 'zigzag', 'direction', 'are', 'four', 'times', 'larger', 'than', 'those', 'in', 'the', 'armchair', 'direction', 'which', 'confirm', 'the', 'anisotropy', 'of', 'the', 'material', 'furthermore', 'the', 'uniaxial', 'strain', 'can', 'trigger', 'the', 'directindirect', 'band', 'gap', 'transition', 'for', 'green', 'phosphorene', 'and', 'the', 'critical', 'strains', 'for', 'the', 'band', 'gap', 'transition', 'are', 'revealed']]
|
[-0.1829621819646454, 0.11454777034615235, -0.03858314172033495, -0.020348104831900124, -0.05069788022790317, -0.14269290134723253, 0.09022056216049014, 0.5037196109058873, -0.26652121988059513, -0.27059953234427225, 0.027699432552217088, -0.29175681209866733, -0.19651671639024812, 0.18125768131638983, 0.08008074524988977, 0.000559435054525458, 0.02759599205162751, -0.08493293345212036, -0.1103389307859685, -0.17027164377340884, 0.22499789356335298, 0.06051053239295147, 0.37610476755774613, 0.10867415635452775, -0.03374772639195091, -0.03939236824606989, 0.139520179361555, 0.06613078323074136, -0.17803866775223365, 0.09583829219246771, 0.19452182071645988, -0.1447038175678818, 0.24388778754885015, -0.40278169906841926, -0.1906523717779841, -0.023545083388273647, 0.1294449066568241, 0.1569250732505594, -0.06678602388786893, -0.22789157308238064, 0.15417863077002783, -0.1497231511424152, -0.11394222968120453, -0.03284464321793026, 0.04992023586520563, -0.024715129270424577, -0.19265627128661192, 0.12020504250384136, -0.008671196122128742, 0.01364735374652004, -0.13775777656838123, -0.19805180650804466, -0.16547041969380072, 0.010536645095320357, 0.09609594047944618, 0.06787029600345948, 0.23373876036076038, -0.1149333446996049, -0.08741389915672125, 0.42236556970333095, -0.014025929670088656, -0.054024298887874855, 0.1399696064556655, -0.1807165732294721, -0.09599029085280111, 0.17406847446394347, 0.08928013035415003, 0.07957006767610926, -0.13870599328410568, 0.026644203569677553, 0.009995452790902365, 0.1474170865703549, 0.13431180922014502, 0.06308611872724738, 0.2454252620008868, 0.16873267271646591, 0.10665517401625246, 0.1502220909186989, -0.12776250899347458, 0.02551818496528888, -0.1384241550835787, -0.24942000900592887, -0.2237447711128129, 0.10427327520423413, -0.13173639054442193, -0.2081164593820854, 0.4448553231347902, 0.10586703546820271, 0.1401655830399152, 0.01096007936937272, 0.16934539562391254, 0.09789131489041693, 0.12085320222060253, 0.055803009552643605, 0.37692902827222874, 0.164008117505918, 0.1050418071205034, -0.21529458987920377, 0.061385532037898795, -0.03430704917639944]
|
1,803.06496
|
A simple iterative algorithm for maxcut
|
We propose a simple iterative (SI) algorithm for the maxcut problem through
fully using an equivalent continuous formulation. It does not need rounding at
all and has advantages that all subproblems have explicit analytic solutions,
the cut values are monotonically updated and the iteration points converge to a
local optima in finite steps via an appropriate subgradient selection.
Numerical experiments on G-set demonstrate the performance. In particular, the
ratios between the best cut values achieved by SI and those by some advanced
combinatorial algorithms in [Ann. Oper. Res. 248 (2017) 365] are at least
$0.986$ and can be further improved to at least $0.997$ by a preliminary
attempt to break out of local optima.
|
math.OC cs.NA math.CO math.NA
|
we propose a simple iterative si algorithm for the maxcut problem through fully using an equivalent continuous formulation it does not need rounding at all and has advantages that all subproblems have explicit analytic solutions the cut values are monotonically updated and the iteration points converge to a local optima in finite steps via an appropriate subgradient selection numerical experiments on gset demonstrate the performance in particular the ratios between the best cut values achieved by si and those by some advanced combinatorial algorithms in ann oper res 248 2017 365 are at least 0986 and can be further improved to at least 0997 by a preliminary attempt to break out of local optima
|
[['we', 'propose', 'a', 'simple', 'iterative', 'si', 'algorithm', 'for', 'the', 'maxcut', 'problem', 'through', 'fully', 'using', 'an', 'equivalent', 'continuous', 'formulation', 'it', 'does', 'not', 'need', 'rounding', 'at', 'all', 'and', 'has', 'advantages', 'that', 'all', 'subproblems', 'have', 'explicit', 'analytic', 'solutions', 'the', 'cut', 'values', 'are', 'monotonically', 'updated', 'and', 'the', 'iteration', 'points', 'converge', 'to', 'a', 'local', 'optima', 'in', 'finite', 'steps', 'via', 'an', 'appropriate', 'subgradient', 'selection', 'numerical', 'experiments', 'on', 'gset', 'demonstrate', 'the', 'performance', 'in', 'particular', 'the', 'ratios', 'between', 'the', 'best', 'cut', 'values', 'achieved', 'by', 'si', 'and', 'those', 'by', 'some', 'advanced', 'combinatorial', 'algorithms', 'in', 'ann', 'oper', 'res', '248', '2017', '365', 'are', 'at', 'least', '0986', 'and', 'can', 'be', 'further', 'improved', 'to', 'at', 'least', '0997', 'by', 'a', 'preliminary', 'attempt', 'to', 'break', 'out', 'of', 'local', 'optima']]
|
[-0.05793272254155263, 0.003848054403645444, -0.09741661497779812, 0.034467678337374276, -0.07295299799737047, -0.1737271650947565, 0.11673676841810607, 0.4280358645738217, -0.2521199362899847, -0.3244744588972249, 0.13300342488882802, -0.2701929868321474, -0.1268722756057079, 0.17050678935718902, -0.06698892341126084, 0.08310135828740609, 0.07512494095543955, -0.04249863985010929, -0.10794737623699914, -0.31960862631125275, 0.21361976204309285, 0.06367915898986291, 0.260818327188884, 0.02786599600426199, 0.11328161828293416, -0.019700689416934262, -0.0015785916618545328, 0.056170113164147266, -0.11540299906272067, 0.06550699072836882, 0.28896836570276174, 0.13047630985200062, 0.3262543087955891, -0.42761156109994963, -0.1415992104856853, 0.12707158226597434, 0.16902503817905917, 0.08219968750174239, -0.0009417296070687211, -0.2365330978656155, 0.13903388911613115, -0.0843699503357608, -0.07143322609185257, -0.10481821199911728, -0.0041012357667153864, 0.026789758584192514, -0.3001935039687771, 0.037368117845944016, 0.0436164609926524, 0.058051787664002756, -0.02572240367972929, -0.1836641681249858, -0.00885460234508572, 0.04996047981834987, -0.012510700298375204, 0.05939578896862242, 0.1025079696627105, -0.05857257020104219, -0.1495125080181057, 0.3089554820111708, -0.04580802061970819, -0.1926362495481347, 0.17473695328022076, -0.03451331802480446, -0.14223894928255232, 0.1905684464921554, 0.14000212348483937, 0.13978916462388283, -0.13556439807871357, 0.10723600386061885, -0.032526842103004786, 0.12811783322321021, 0.08061897934193869, -0.0509320359325788, 0.13962362023895575, 0.09700533057146363, 0.14247324257035202, 0.0783687578381464, -0.04873978452074848, -0.07672893627661101, -0.29581363468937444, -0.11126529461328398, -0.15819457215624616, 0.02446881588765424, -0.13045663788471484, -0.09370120774480727, 0.36819698210609586, 0.14412145475293264, 0.23039442950271463, 0.08944916427789028, 0.2828714561632328, 0.13825739208576188, 0.04907842263938826, 0.15370205080283708, 0.25026793449452317, 0.056503371076184535, 0.07208496325632982, -0.20601063595855967, 0.04829702055359488, 0.1329182647903891]
|
1,803.06497
|
Variational Bayesian Line Spectral Estimation with Multiple Measurement
Vectors
|
In this paper, the line spectral estimation (LSE) problem with multiple
measurement vectors (MMVs) is studied utilizing the Bayesian methods. Motivated
by the recently proposed variational line spectral estimation (VALSE) method,
we develop the multisnapshot VALSE (MVALSE) for multi snapshot scenarios, which
is especially important in array signal processing. The MVALSE shares the
advantages of the VALSE method, such as automatically estimating the model
order, noise variance, weight variance, and providing the uncertain degrees of
the frequency estimates. It is shown that the MVALSE can be viewed as applying
the VALSE with single measurement vector (SMV) to each snapshot, and combining
the intermediate data appropriately. Furthermore, the Seq-MVALSE is developed
to perform sequential estimation. Finally, numerical results are conducted to
demonstrate the effectiveness of the MVALSE method, compared to the
state-of-the-art methods in the MMVs setting.
|
cs.IT math.IT
|
in this paper the line spectral estimation lse problem with multiple measurement vectors mmvs is studied utilizing the bayesian methods motivated by the recently proposed variational line spectral estimation valse method we develop the multisnapshot valse mvalse for multi snapshot scenarios which is especially important in array signal processing the mvalse shares the advantages of the valse method such as automatically estimating the model order noise variance weight variance and providing the uncertain degrees of the frequency estimates it is shown that the mvalse can be viewed as applying the valse with single measurement vector smv to each snapshot and combining the intermediate data appropriately furthermore the seqmvalse is developed to perform sequential estimation finally numerical results are conducted to demonstrate the effectiveness of the mvalse method compared to the stateoftheart methods in the mmvs setting
|
[['in', 'this', 'paper', 'the', 'line', 'spectral', 'estimation', 'lse', 'problem', 'with', 'multiple', 'measurement', 'vectors', 'mmvs', 'is', 'studied', 'utilizing', 'the', 'bayesian', 'methods', 'motivated', 'by', 'the', 'recently', 'proposed', 'variational', 'line', 'spectral', 'estimation', 'valse', 'method', 'we', 'develop', 'the', 'multisnapshot', 'valse', 'mvalse', 'for', 'multi', 'snapshot', 'scenarios', 'which', 'is', 'especially', 'important', 'in', 'array', 'signal', 'processing', 'the', 'mvalse', 'shares', 'the', 'advantages', 'of', 'the', 'valse', 'method', 'such', 'as', 'automatically', 'estimating', 'the', 'model', 'order', 'noise', 'variance', 'weight', 'variance', 'and', 'providing', 'the', 'uncertain', 'degrees', 'of', 'the', 'frequency', 'estimates', 'it', 'is', 'shown', 'that', 'the', 'mvalse', 'can', 'be', 'viewed', 'as', 'applying', 'the', 'valse', 'with', 'single', 'measurement', 'vector', 'smv', 'to', 'each', 'snapshot', 'and', 'combining', 'the', 'intermediate', 'data', 'appropriately', 'furthermore', 'the', 'seqmvalse', 'is', 'developed', 'to', 'perform', 'sequential', 'estimation', 'finally', 'numerical', 'results', 'are', 'conducted', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'mvalse', 'method', 'compared', 'to', 'the', 'stateoftheart', 'methods', 'in', 'the', 'mmvs', 'setting']]
|
[-0.06322250176410846, -0.010241372569429653, -0.06974859341151185, 0.035048948557771464, -0.06179618543807279, -0.14092714133612053, 0.022081216196184632, 0.40769731283739763, -0.26996570303346273, -0.3090553412972777, 0.1571665048814827, -0.233027618088656, -0.1429551009502676, 0.19985948022006564, -0.0753675213618273, 0.10704275158889316, 0.10606436694247855, 0.026363033152840755, -0.06693761196090943, -0.24857150578733395, 0.2636905998043302, 0.1085949242942863, 0.33117430751315424, -0.03577853376045823, 0.13626273462842045, 0.04217789316705118, -0.08050190645994412, 0.035895311408158805, -0.06809525169735059, 0.1530471681781044, 0.2795635010909151, 0.1614988157801606, 0.3005201081572859, -0.32662041794198254, -0.24230001626398276, 0.10434734631433255, 0.1676471240076892, 0.10402097959606046, -0.023658717444373503, -0.31361480840930234, 0.08932302910834551, -0.1499912033478419, -0.06078695935667148, -0.0955713894425167, -0.08728526699253254, 0.019170518936934295, -0.32792204538429226, 0.07485230624399804, 0.01441885140310559, 0.01317771285323909, -0.0549432759863083, -0.16099529897242232, 0.030394888082001772, 0.11061808145777495, 0.04779962713709446, 0.01882749016362208, 0.10190201823910078, -0.08125631920130992, -0.14628575525970922, 0.33883513411231064, -0.07740332145476714, -0.2158194856580209, 0.14239318194212736, -0.07449517217119811, -0.13283563579812094, 0.10459560971983053, 0.1619439940520183, 0.12350110849020658, -0.13521691380258374, 0.04626694803764285, -0.03371259105840215, 0.15960683387324767, 0.012443849430591972, 0.01836857800199478, 0.1300107783060176, 0.19240811838320007, 0.049791100434958935, 0.1478087945504942, -0.18973620182110204, -0.07778438614267442, -0.22785086703219418, -0.11559171127672825, -0.22250834312979823, -0.0464168063847831, -0.11421038570826769, -0.11532951296475302, 0.3917683472373971, 0.21332376150724788, 0.1959886953096699, 0.05343066188075614, 0.3805859079239545, 0.14748516952170543, 0.04523709854628477, 0.06023182679243662, 0.20815461707749852, 0.13024912536040775, 0.08939357066733969, -0.21271210364066065, 0.06901770779384403, 0.06248263008547602]
|
1,803.06498
|
Insight on confinement using scalar field interactions
|
The scalar field plays an fundamental role in the investigation of
confinement property characterising many particle physics models. This is
achieved by coupling this particle directly with gauge fields at the lagrangian
level. We have adopted the same approach {[}10{]} to determine a potential as a
perturbative series in terms of interquark distance. In order to introduce the
gravitational effects and inspired from bag models, we implement a scalar field
which interacts both with the vacuum and the electron field. In this context
and with presence of the vacuum condensates, it is possible to derive a more
accurate expression of the electron energy.
|
hep-ph
|
the scalar field plays an fundamental role in the investigation of confinement property characterising many particle physics models this is achieved by coupling this particle directly with gauge fields at the lagrangian level we have adopted the same approach 10 to determine a potential as a perturbative series in terms of interquark distance in order to introduce the gravitational effects and inspired from bag models we implement a scalar field which interacts both with the vacuum and the electron field in this context and with presence of the vacuum condensates it is possible to derive a more accurate expression of the electron energy
|
[['the', 'scalar', 'field', 'plays', 'an', 'fundamental', 'role', 'in', 'the', 'investigation', 'of', 'confinement', 'property', 'characterising', 'many', 'particle', 'physics', 'models', 'this', 'is', 'achieved', 'by', 'coupling', 'this', 'particle', 'directly', 'with', 'gauge', 'fields', 'at', 'the', 'lagrangian', 'level', 'we', 'have', 'adopted', 'the', 'same', 'approach', '10', 'to', 'determine', 'a', 'potential', 'as', 'a', 'perturbative', 'series', 'in', 'terms', 'of', 'interquark', 'distance', 'in', 'order', 'to', 'introduce', 'the', 'gravitational', 'effects', 'and', 'inspired', 'from', 'bag', 'models', 'we', 'implement', 'a', 'scalar', 'field', 'which', 'interacts', 'both', 'with', 'the', 'vacuum', 'and', 'the', 'electron', 'field', 'in', 'this', 'context', 'and', 'with', 'presence', 'of', 'the', 'vacuum', 'condensates', 'it', 'is', 'possible', 'to', 'derive', 'a', 'more', 'accurate', 'expression', 'of', 'the', 'electron', 'energy']]
|
[-0.11406991149420913, 0.15541582168161855, -0.08870674347396469, 0.07917630926421075, -0.04579726070418809, -0.10719742935639127, -0.020951281193173625, 0.31843354600002466, -0.21929125843831854, -0.3409253773143859, 0.03662879963052794, -0.22473949915503413, -0.11960442664409146, 0.14910126194918474, 0.014217942962151708, 0.021671385422927663, -0.0007996206461153563, 0.07763353621731829, -0.03801262171688101, -0.2003846886156362, 0.3517655596109921, 0.08280371338382218, 0.2552058198896137, 0.10553808631239803, 0.1255098585111713, 0.02672480417017653, 0.0014828227695475504, 0.014111780773992966, -0.11337767089310202, 0.12316707510826658, 0.17885821332876148, 0.04574573752967623, 0.2644460606275723, -0.41210774006774126, -0.23908413833377937, 0.10299255440319047, 0.1303161384031466, 0.16378316404727442, -0.07940428241371353, -0.2615883502819874, 0.034451330080628395, -0.17228288686770982, -0.1697644970404635, -0.0795241050575905, -0.006817073340853224, -0.04450293845221292, -0.29801255398547477, 0.06820040790237558, 0.002207617448344465, 0.03704587127832533, -0.0544023475546426, -0.07543066871415788, 0.03248433737554452, 0.10697057778106152, 0.10244205746419945, 0.10331392975538761, 0.15629893460410457, -0.20487285925536552, -0.08792028969348165, 0.42997271977184176, -0.1334686865634511, -0.2246145397103708, 0.18462718020925678, -0.14628664725143642, -0.08977394339004621, 0.09424349681691276, 0.15980982780456543, 0.10952502384203151, -0.162716784455714, 0.13920266647626492, 0.01169231085522661, 0.13438327749286896, 0.06772750537860596, 0.06784996651655552, 0.2608077268758156, 0.15128447870425518, 0.005399016420994388, 0.12902705184663238, -0.07375932415015996, -0.11341738667467935, -0.3264116096916129, -0.1521995432540103, -0.14253045661031333, 0.02377275593162885, -0.0769993789281834, -0.16808652413728675, 0.42371774223425146, 0.17602548009526092, 0.16758085708179085, 0.0004741447961898249, 0.28077736486074995, 0.14046660719837234, 0.08276853535903021, 0.04144115753706942, 0.2909565713952829, 0.1654359707088906, 0.1083446501582427, -0.2406503446829659, -0.034343491561566165, 0.07203425640252745]
|
1,803.06499
|
K\"ahler submanifolds of the symmetrized polydisc
|
This paper proves the non-existence of common K\"ahler submanifolds of the
complex Euclidean space and the symmetrized polydisc endowed with their
canonical metrics.
|
math.CV math.DG
|
this paper proves the nonexistence of common kahler submanifolds of the complex euclidean space and the symmetrized polydisc endowed with their canonical metrics
|
[['this', 'paper', 'proves', 'the', 'nonexistence', 'of', 'common', 'kahler', 'submanifolds', 'of', 'the', 'complex', 'euclidean', 'space', 'and', 'the', 'symmetrized', 'polydisc', 'endowed', 'with', 'their', 'canonical', 'metrics']]
|
[-0.2257916196046964, 0.006652207883155864, -0.006421392095153747, 0.1394483049997412, -0.10678462878517482, -0.08182315342128277, -0.07099463948068897, 0.3481594537911208, -0.2355962432111087, -0.1412698179078491, 0.06859969440847635, -0.27143959939965734, -0.23161814726241256, 0.12612780843577956, -0.2265519303796084, 0.0515187443031565, 0.10214441500442184, 0.09232015830829092, -0.23681598144542912, -0.33339735493063927, 0.5680579241851101, 0.010069606420786484, 0.20420699963427108, 0.0807050559669733, 0.13601773220073918, -0.0032302249101516995, -0.01106880143608736, -0.015700872166274603, -0.18256038492140564, 0.22645411887408598, 0.2534270432332288, 0.1200508973358766, 0.18561273051992708, -0.3559136356672515, -0.17569651693591606, 0.3216480121988317, 0.12117543525022009, -0.1277883904783622, 0.0655194757020344, -0.33076075812720734, 0.007381640100704871, -0.03881782795424047, -0.2607804033095422, -0.12784387823194265, -0.04353858206583106, 0.008854689157527426, -0.1416001408968283, 0.017460830205970484, 0.15181926754303277, 0.08723093945856976, -0.13033643952044455, -0.10747865506488344, -0.06120250908576924, 0.056879568440110786, 0.0402937492598658, 0.17509450895063902, 0.0861238540838594, 0.03979772770949437, -0.10498993653480125, 0.41548627072378347, -0.044743146828335266, -0.3546026371743368, 0.10175130824032037, -0.1539151011966169, -0.10531586380270512, 0.043402902296055916, 0.11296723588653233, 0.19105052186743074, -0.0846993178534119, 0.2390212365198354, -0.0722424352703535, -0.024123297842300457, 0.14102259359281996, 0.05942964958755866, 0.11212183381228344, 0.10266524338689835, 0.11173087348161852, 0.16239428769230194, 0.03241957837472791, -0.14751555422401946, -0.36602802009767166, -0.2842554447605558, -0.14866252948084605, 0.17862474011338275, -0.22909982702834025, -0.2868652790784836, 0.4119999335633348, -0.0635196597457094, 0.189968125509989, 0.15552407239928193, 0.24434730579631161, -0.06267063271092332, 0.019919846115795815, 0.07895883934005447, 0.18542663295469855, 0.20150285959243774, 0.04991054210973823, -0.11016511427157599, -0.0765728066553888, 0.1185335026163122]
|
1,803.065
|
Argumentation theory for mathematical argument
|
To adequately model mathematical arguments the analyst must be able to
represent the mathematical objects under discussion and the relationships
between them, as well as inferences drawn about these objects and relationships
as the discourse unfolds. We introduce a framework with these properties, which
has been used to analyse mathematical dialogues and expository texts. The
framework can recover salient elements of discourse at, and within, the
sentence level, as well as the way mathematical content connects to form larger
argumentative structures. We show how the framework might be used to support
computational reasoning, and argue that it provides a more natural way to
examine the process of proving theorems than do Lamport's structured proofs.
|
cs.CL cs.AI
|
to adequately model mathematical arguments the analyst must be able to represent the mathematical objects under discussion and the relationships between them as well as inferences drawn about these objects and relationships as the discourse unfolds we introduce a framework with these properties which has been used to analyse mathematical dialogues and expository texts the framework can recover salient elements of discourse at and within the sentence level as well as the way mathematical content connects to form larger argumentative structures we show how the framework might be used to support computational reasoning and argue that it provides a more natural way to examine the process of proving theorems than do lamports structured proofs
|
[['to', 'adequately', 'model', 'mathematical', 'arguments', 'the', 'analyst', 'must', 'be', 'able', 'to', 'represent', 'the', 'mathematical', 'objects', 'under', 'discussion', 'and', 'the', 'relationships', 'between', 'them', 'as', 'well', 'as', 'inferences', 'drawn', 'about', 'these', 'objects', 'and', 'relationships', 'as', 'the', 'discourse', 'unfolds', 'we', 'introduce', 'a', 'framework', 'with', 'these', 'properties', 'which', 'has', 'been', 'used', 'to', 'analyse', 'mathematical', 'dialogues', 'and', 'expository', 'texts', 'the', 'framework', 'can', 'recover', 'salient', 'elements', 'of', 'discourse', 'at', 'and', 'within', 'the', 'sentence', 'level', 'as', 'well', 'as', 'the', 'way', 'mathematical', 'content', 'connects', 'to', 'form', 'larger', 'argumentative', 'structures', 'we', 'show', 'how', 'the', 'framework', 'might', 'be', 'used', 'to', 'support', 'computational', 'reasoning', 'and', 'argue', 'that', 'it', 'provides', 'a', 'more', 'natural', 'way', 'to', 'examine', 'the', 'process', 'of', 'proving', 'theorems', 'than', 'do', 'lamports', 'structured', 'proofs']]
|
[-0.0008491212445956638, 0.02469218081974408, -0.13929923610065312, 0.17567652206020157, -0.18127607760068618, -0.11625839384240017, 0.06838081880031448, 0.40367514803482774, -0.28580330540589466, -0.3649143329096484, 0.06577255858696605, -0.25182187214101615, -0.18964778752834127, 0.16128864385118186, -0.1088421462663335, 0.010874914724314422, 0.018975643686165933, 0.0384435958898904, -0.025338574643491915, -0.21683648999641536, 0.3013679974920754, 0.04237505287062703, 0.2566186836103729, 0.037768253085934636, 0.09600281044268948, -0.027792797399390685, -0.04928504497940211, 0.021140654759252805, -0.12018285310458802, 0.1887294308266096, 0.3595419716755778, 0.2262228481255047, 0.28686747775135335, -0.4690922824502514, -0.2045464853637672, 0.046071597794683554, 0.15164679027287076, 0.1211983018417908, 0.034713186231097655, -0.31492852937560856, 0.09641948967289768, -0.15657282225060554, -0.09842939757978902, -0.16451094163124236, 0.00020415483209434203, -0.018182512070460802, -0.18864037770483838, 0.021305782570332093, 0.13439186371397227, 0.07438336964696646, -0.014569597097681509, -0.09885819707670364, -0.012128268219448887, 0.18778019392732204, 0.06931440089088906, 0.0001748159556882456, 0.12848086301604972, -0.10332552454712098, -0.11573112522774752, 0.43441670311190056, -0.012838385466781338, -0.20887418675007657, 0.2264423289646705, -0.07385865426132161, -0.15462845363327415, 0.013036217533354238, 0.18248597566005692, 0.06988520988900411, -0.18600407421686932, 0.007950842807890456, -0.06811430276547183, 0.19937399736393177, 0.07091252110784121, 0.044687902542615406, 0.24484087154269218, 0.17162903715251832, -0.019745407697515923, 0.11529083727050181, -0.008899265440975381, -0.10028823471644469, -0.3005554002726026, -0.14163926334871926, -0.09319373931359957, 0.013063954867487937, -0.04968028822278077, -0.14953284189431815, 0.3488327553720426, 0.21449933930202142, 0.2058407730226846, 0.10044949649722855, 0.2566673929492633, 0.0687033184745304, 0.0868957352865612, 0.06244204740097191, 0.15601316534325874, 0.11695746761305552, 0.11839583733021036, -0.06875505975831561, 0.14288036035079704, 0.06436674470866197]
|
1,803.06501
|
Implications of dilaton couplings on the axion potential
|
In particle physics and cosmology, the dilaton is an hypothetical scalar
field which can explain many physical phenomena. In this framework, we
investigate an extended lagrangian of QCD which involves dilatonic degrees of
freedom. Our approach is based on the relationship between the massive dilaton
and the nonperturbative effects of QCD. We derive a general axion potential
involving the dilaton properties and vacuum condensates.
|
hep-th
|
in particle physics and cosmology the dilaton is an hypothetical scalar field which can explain many physical phenomena in this framework we investigate an extended lagrangian of qcd which involves dilatonic degrees of freedom our approach is based on the relationship between the massive dilaton and the nonperturbative effects of qcd we derive a general axion potential involving the dilaton properties and vacuum condensates
|
[['in', 'particle', 'physics', 'and', 'cosmology', 'the', 'dilaton', 'is', 'an', 'hypothetical', 'scalar', 'field', 'which', 'can', 'explain', 'many', 'physical', 'phenomena', 'in', 'this', 'framework', 'we', 'investigate', 'an', 'extended', 'lagrangian', 'of', 'qcd', 'which', 'involves', 'dilatonic', 'degrees', 'of', 'freedom', 'our', 'approach', 'is', 'based', 'on', 'the', 'relationship', 'between', 'the', 'massive', 'dilaton', 'and', 'the', 'nonperturbative', 'effects', 'of', 'qcd', 'we', 'derive', 'a', 'general', 'axion', 'potential', 'involving', 'the', 'dilaton', 'properties', 'and', 'vacuum', 'condensates']]
|
[-0.15106006422138307, 0.19291673330053527, -0.14081998373148963, 0.12065007635283109, -0.11959082492103335, -0.12251525395549834, -0.027471709148812806, 0.26648725289851427, -0.18631897493833094, -0.2966993658337742, 0.01143345652599237, -0.22925386056886055, -0.17003079707501456, 0.11443836048238154, -0.005132259044330567, 0.028278727470024023, -0.0680812461359892, 0.04156477749347687, -0.054737162427045405, -0.2290163869583921, 0.3743652287084842, 0.02273678471101448, 0.18800536115304567, 0.13922669367457274, 0.128314199129818, 0.00024498760649294127, 0.0011804575842688791, -0.022879394629853778, -0.1381968428468099, 0.0942321132752113, 0.13339067326887744, 0.09170132065628422, 0.19178499371628277, -0.39489443982893135, -0.26910708950890694, 0.10357749274407979, 0.14418008422944695, 0.17512344631177257, -0.08135214901449217, -0.28759286433341913, 0.006777369402698241, -0.16498822649009526, -0.17216709624335635, -0.12038656266668113, -0.03521721599645389, -0.07347518421011046, -0.3051809194730595, 0.07595671492163092, -0.04643779579055263, 0.0073684442904777825, -0.048484797684068326, -0.0934112755840033, 0.028305623101914534, 0.028340324679447804, 0.14429809785360703, 0.03972280009475071, 0.15856788455857895, -0.24089407574138022, -0.14399308025349455, 0.44899300928227603, -0.09495331743528368, -0.21646586764836684, 0.16973962013071286, -0.1250437709313701, -0.13805657557531958, 0.063778268857277, 0.19805199081383762, 0.16140950864064507, -0.19292548398516374, 0.2065391666810683, -0.020313096516474616, 0.17416094554937445, 0.025679754646262154, 0.10656617022777937, 0.3611945812299382, 0.1535760346596362, -0.039807716472751054, 0.14619778670021333, -0.006337938961223699, -0.17840574317233404, -0.4118486420629779, -0.13821908684440132, -0.10343693304457702, 0.05874812469119206, -0.17351041308506865, -0.1667776199974469, 0.3902005020499928, 0.14800585825832968, 0.1380618186085485, -0.021268838518153643, 0.26391983522626106, 0.09075966878481267, 0.053277654475095915, 0.03928550471755443, 0.34378178459155606, 0.18758403201354668, 0.12312350156571483, -0.30330662101368944, -0.12916267492983025, 0.0965992039127741]
|
1,803.06502
|
Analysing Developers Affectiveness through Markov chain Models
|
In this paper, we present an analysis of more than 500K comments from
open-source repositories of software systems. Our aim is to empirically
determine how developers interact with each other under certain psychological
conditions generated by politeness, sentiment and emotion expressed in
developers' comments. Developers involved in open-source projects do not
usually know each other; they mainly communicate through mailing lists, chat
rooms, and tools such as issue tracking systems. The way in which they
communicate affects the development process and the productivity of the people
involved in the project. We evaluated politeness, sentiment, and emotions of
comments posted by developers and studied the communication flow to understand
how they interacted in the presence of impolite and negative comments (and vice
versa). Our analysis shows that when in presence of impolite or negative
comments, the probability of the next comment being impolite or negative is 14%
and 25%, respectively; anger, however, has a probability of 40% of being
followed by a further anger comment. The result could help managers take
control the development phases of a system since social aspects can seriously
affect a developer's productivity. In a distributed environment this may have a
particular resonance.
|
cs.SE
|
in this paper we present an analysis of more than 500k comments from opensource repositories of software systems our aim is to empirically determine how developers interact with each other under certain psychological conditions generated by politeness sentiment and emotion expressed in developers comments developers involved in opensource projects do not usually know each other they mainly communicate through mailing lists chat rooms and tools such as issue tracking systems the way in which they communicate affects the development process and the productivity of the people involved in the project we evaluated politeness sentiment and emotions of comments posted by developers and studied the communication flow to understand how they interacted in the presence of impolite and negative comments and vice versa our analysis shows that when in presence of impolite or negative comments the probability of the next comment being impolite or negative is 14 and 25 respectively anger however has a probability of 40 of being followed by a further anger comment the result could help managers take control the development phases of a system since social aspects can seriously affect a developers productivity in a distributed environment this may have a particular resonance
|
[['in', 'this', 'paper', 'we', 'present', 'an', 'analysis', 'of', 'more', 'than', '500k', 'comments', 'from', 'opensource', 'repositories', 'of', 'software', 'systems', 'our', 'aim', 'is', 'to', 'empirically', 'determine', 'how', 'developers', 'interact', 'with', 'each', 'other', 'under', 'certain', 'psychological', 'conditions', 'generated', 'by', 'politeness', 'sentiment', 'and', 'emotion', 'expressed', 'in', 'developers', 'comments', 'developers', 'involved', 'in', 'opensource', 'projects', 'do', 'not', 'usually', 'know', 'each', 'other', 'they', 'mainly', 'communicate', 'through', 'mailing', 'lists', 'chat', 'rooms', 'and', 'tools', 'such', 'as', 'issue', 'tracking', 'systems', 'the', 'way', 'in', 'which', 'they', 'communicate', 'affects', 'the', 'development', 'process', 'and', 'the', 'productivity', 'of', 'the', 'people', 'involved', 'in', 'the', 'project', 'we', 'evaluated', 'politeness', 'sentiment', 'and', 'emotions', 'of', 'comments', 'posted', 'by', 'developers', 'and', 'studied', 'the', 'communication', 'flow', 'to', 'understand', 'how', 'they', 'interacted', 'in', 'the', 'presence', 'of', 'impolite', 'and', 'negative', 'comments', 'and', 'vice', 'versa', 'our', 'analysis', 'shows', 'that', 'when', 'in', 'presence', 'of', 'impolite', 'or', 'negative', 'comments', 'the', 'probability', 'of', 'the', 'next', 'comment', 'being', 'impolite', 'or', 'negative', 'is', '14', 'and', '25', 'respectively', 'anger', 'however', 'has', 'a', 'probability', 'of', '40', 'of', 'being', 'followed', 'by', 'a', 'further', 'anger', 'comment', 'the', 'result', 'could', 'help', 'managers', 'take', 'control', 'the', 'development', 'phases', 'of', 'a', 'system', 'since', 'social', 'aspects', 'can', 'seriously', 'affect', 'a', 'developers', 'productivity', 'in', 'a', 'distributed', 'environment', 'this', 'may', 'have', 'a', 'particular', 'resonance']]
|
[-0.120104638881606, 0.10425830558032968, -0.05383922502978192, 0.0807830828241874, -0.13225912226587344, -0.18943714841485157, 0.07928418234995642, 0.4124828844654317, -0.21247141964600555, -0.33545486234622646, 0.12219263224539403, -0.33338345971067757, -0.17662126378765644, 0.16638200513707302, -0.11300143838280394, -0.031917041333924444, 0.08827721250863575, 0.0890347019410502, -0.005790102749953655, -0.2980555953667024, 0.3063334868917935, 0.0818004986527851, 0.26398042557708806, 0.10906898541398564, 0.006965628841758839, -0.017844908418162365, -0.10967579289465401, -0.015711384336879877, -0.06884501312568467, 0.1313353070789682, 0.319222255013598, 0.2226569339376399, 0.37032820344474926, -0.43121919389434005, -0.15851359060319253, 0.04363956476789804, 0.16349947234682208, 0.05239285173890067, -0.039809791995251045, -0.34854613585701705, 0.0746219699194997, -0.21089422816828807, -0.08645413488111629, -0.0596577844449452, 0.008625133362793535, 0.024727166856624832, -0.1883450673598492, -0.003518030206596821, 0.05621199582332783, 0.1128456901856318, -0.02544456739596338, -0.10849211541448758, -0.023230017188993493, 0.2292880109561505, 0.11558980790512727, -0.004176289869510397, 0.19546693147454716, -0.17393638468371247, -0.15130538335759003, 0.3757393459281029, -0.02819001897853236, -0.1917890521925779, 0.20753454311325556, -0.08560330517792288, -0.1395207467911841, 0.0464339559916787, 0.22634348171710855, 0.08190941894830832, -0.18513559554479314, 0.0007975794379694425, 0.0036092515089264027, 0.21805060576951626, 0.0890870660446033, -0.012103000520348397, 0.22126385236006915, 0.13272104155728404, -0.0007050188213149655, 0.1090738132473661, 0.02107386850770943, -0.0527521808137547, -0.21808061654185307, -0.17083981042081603, -0.09770355975802997, 0.03693872515941621, -0.03609268094130259, -0.1270831976464845, 0.3788411445174442, 0.20840157957139369, 0.1270208906130485, 0.011520235906758974, 0.2771768078079675, 0.029924281531284392, 0.0798148084574436, 0.10255778307624978, 0.1856176393291894, 0.002976670394395003, 0.20106225838404795, -0.16808559859708447, 0.13235145842665996, -0.04292765191081455]
|
1,803.06503
|
Weakly Supervised Salient Object Detection Using Image Labels
|
Deep learning based salient object detection has recently achieved great
success with its performance greatly outperforms any other unsupervised
methods. However, annotating per-pixel saliency masks is a tedious and
inefficient procedure. In this paper, we note that superior salient object
detection can be obtained by iteratively mining and correcting the labeling
ambiguity on saliency maps from traditional unsupervised methods. We propose to
use the combination of a coarse salient object activation map from the
classification network and saliency maps generated from unsupervised methods as
pixel-level annotation, and develop a simple yet very effective algorithm to
train fully convolutional networks for salient object detection supervised by
these noisy annotations. Our algorithm is based on alternately exploiting a
graphical model and training a fully convolutional network for model updating.
The graphical model corrects the internal labeling ambiguity through spatial
consistency and structure preserving while the fully convolutional network
helps to correct the cross-image semantic ambiguity and simultaneously update
the coarse activation map for next iteration. Experimental results demonstrate
that our proposed method greatly outperforms all state-of-the-art unsupervised
saliency detection methods and can be comparable to the current best
strongly-supervised methods training with thousands of pixel-level saliency map
annotations on all public benchmarks.
|
cs.CV
|
deep learning based salient object detection has recently achieved great success with its performance greatly outperforms any other unsupervised methods however annotating perpixel saliency masks is a tedious and inefficient procedure in this paper we note that superior salient object detection can be obtained by iteratively mining and correcting the labeling ambiguity on saliency maps from traditional unsupervised methods we propose to use the combination of a coarse salient object activation map from the classification network and saliency maps generated from unsupervised methods as pixellevel annotation and develop a simple yet very effective algorithm to train fully convolutional networks for salient object detection supervised by these noisy annotations our algorithm is based on alternately exploiting a graphical model and training a fully convolutional network for model updating the graphical model corrects the internal labeling ambiguity through spatial consistency and structure preserving while the fully convolutional network helps to correct the crossimage semantic ambiguity and simultaneously update the coarse activation map for next iteration experimental results demonstrate that our proposed method greatly outperforms all stateoftheart unsupervised saliency detection methods and can be comparable to the current best stronglysupervised methods training with thousands of pixellevel saliency map annotations on all public benchmarks
|
[['deep', 'learning', 'based', 'salient', 'object', 'detection', 'has', 'recently', 'achieved', 'great', 'success', 'with', 'its', 'performance', 'greatly', 'outperforms', 'any', 'other', 'unsupervised', 'methods', 'however', 'annotating', 'perpixel', 'saliency', 'masks', 'is', 'a', 'tedious', 'and', 'inefficient', 'procedure', 'in', 'this', 'paper', 'we', 'note', 'that', 'superior', 'salient', 'object', 'detection', 'can', 'be', 'obtained', 'by', 'iteratively', 'mining', 'and', 'correcting', 'the', 'labeling', 'ambiguity', 'on', 'saliency', 'maps', 'from', 'traditional', 'unsupervised', 'methods', 'we', 'propose', 'to', 'use', 'the', 'combination', 'of', 'a', 'coarse', 'salient', 'object', 'activation', 'map', 'from', 'the', 'classification', 'network', 'and', 'saliency', 'maps', 'generated', 'from', 'unsupervised', 'methods', 'as', 'pixellevel', 'annotation', 'and', 'develop', 'a', 'simple', 'yet', 'very', 'effective', 'algorithm', 'to', 'train', 'fully', 'convolutional', 'networks', 'for', 'salient', 'object', 'detection', 'supervised', 'by', 'these', 'noisy', 'annotations', 'our', 'algorithm', 'is', 'based', 'on', 'alternately', 'exploiting', 'a', 'graphical', 'model', 'and', 'training', 'a', 'fully', 'convolutional', 'network', 'for', 'model', 'updating', 'the', 'graphical', 'model', 'corrects', 'the', 'internal', 'labeling', 'ambiguity', 'through', 'spatial', 'consistency', 'and', 'structure', 'preserving', 'while', 'the', 'fully', 'convolutional', 'network', 'helps', 'to', 'correct', 'the', 'crossimage', 'semantic', 'ambiguity', 'and', 'simultaneously', 'update', 'the', 'coarse', 'activation', 'map', 'for', 'next', 'iteration', 'experimental', 'results', 'demonstrate', 'that', 'our', 'proposed', 'method', 'greatly', 'outperforms', 'all', 'stateoftheart', 'unsupervised', 'saliency', 'detection', 'methods', 'and', 'can', 'be', 'comparable', 'to', 'the', 'current', 'best', 'stronglysupervised', 'methods', 'training', 'with', 'thousands', 'of', 'pixellevel', 'saliency', 'map', 'annotations', 'on', 'all', 'public', 'benchmarks']]
|
[0.02292642587533919, -0.06471017393516376, -0.05854492745711468, 0.050037257269141266, -0.14356484418734908, -0.22004471938940695, 0.04219239125552122, 0.5205208783270792, -0.27075792554300276, -0.34646161573851714, 0.06514051553211175, -0.2435563990729861, -0.2128491143521387, 0.1472248062142171, -0.17895865849684925, 0.12540407227235847, 0.21798172704875468, 0.03915798811474815, -0.08574879682157188, -0.2751065698033199, 0.2958734525350155, 0.07171216350849136, 0.3528736330440734, 0.009782193135470152, 0.20692015257198362, -0.043003941747010686, -0.1010981874295976, 0.009932059205020778, -0.024929733337266953, 0.2183593365410343, 0.3320893400302157, 0.21565028906275985, 0.3045541067153681, -0.3721251473389566, -0.266627194005996, 0.08928019439568743, 0.17218228751793505, 0.15307208272977732, -0.01744144142314326, -0.4308605340495706, 0.09249845791375265, -0.1721297796117142, 0.12223728514509276, -0.20816515943501146, -0.06425200394820423, -0.05148231079190737, -0.2899782914240495, 0.05466868997478741, 0.0734083852270851, 0.0596250480460003, -0.05166364435805008, -0.10422040428151376, 0.0017147398507222533, 0.19099088990711607, -0.023788065439439378, 0.10824184343917295, 0.15328511647123377, -0.238304665555479, -0.14977722369134427, 0.3097702614031732, -0.07903167397715151, -0.2247779933991842, 0.20468650101684033, 0.023916317670373246, -0.1893473758851178, 0.1575892724422738, 0.16756142885205919, 0.1510247029783204, -0.16210217383952114, -0.00010358002968132496, -0.03735699980752542, 0.18472232653410173, 0.05505785462446511, -0.04399415345862508, 0.19991636853897943, 0.2860294645698741, 0.046057593564037234, 0.13134515616489806, -0.19486510482965969, -0.012811515394132585, -0.2068526094185654, -0.04177880472620018, -0.20838329125544988, -0.08972875825129449, -0.13966751508589367, -0.13595755843212828, 0.4219007864198647, 0.2931367764249444, 0.22340555815491825, 0.15239686948247255, 0.41695897562429307, -0.013011372449691408, 0.14238676747016143, 0.10757579498924315, 0.17240862036473117, -0.012175264868419617, 0.09319684110232629, -0.16004723424790426, 0.12420061989687384, 0.1482907895563403]
|
1,803.06504
|
Superconductivity without inversion and time-reversal symmetries
|
The traditional symmetries that protect superconductivity are time-reversal
and inversion. Here, we examine the minimal symmetries protecting
superconductivity in two dimensions and find that time-reversal symmetry and
inversion symmetry are not required, and having a combination of either
symmetry with a mirror operation on the basal plane is sufficient. We classify
superconducting states stabilized by these two symmetries, when time-reversal
and inversion symmetries are not present, and provide realistic minimal models
as examples. Interestingly, several experimentally realized systems, such as
transition metal dichalcogenides and the two-dimensional Rashba system belong
to this category, when subject to an applied magnetic field.
|
cond-mat.supr-con
|
the traditional symmetries that protect superconductivity are timereversal and inversion here we examine the minimal symmetries protecting superconductivity in two dimensions and find that timereversal symmetry and inversion symmetry are not required and having a combination of either symmetry with a mirror operation on the basal plane is sufficient we classify superconducting states stabilized by these two symmetries when timereversal and inversion symmetries are not present and provide realistic minimal models as examples interestingly several experimentally realized systems such as transition metal dichalcogenides and the twodimensional rashba system belong to this category when subject to an applied magnetic field
|
[['the', 'traditional', 'symmetries', 'that', 'protect', 'superconductivity', 'are', 'timereversal', 'and', 'inversion', 'here', 'we', 'examine', 'the', 'minimal', 'symmetries', 'protecting', 'superconductivity', 'in', 'two', 'dimensions', 'and', 'find', 'that', 'timereversal', 'symmetry', 'and', 'inversion', 'symmetry', 'are', 'not', 'required', 'and', 'having', 'a', 'combination', 'of', 'either', 'symmetry', 'with', 'a', 'mirror', 'operation', 'on', 'the', 'basal', 'plane', 'is', 'sufficient', 'we', 'classify', 'superconducting', 'states', 'stabilized', 'by', 'these', 'two', 'symmetries', 'when', 'timereversal', 'and', 'inversion', 'symmetries', 'are', 'not', 'present', 'and', 'provide', 'realistic', 'minimal', 'models', 'as', 'examples', 'interestingly', 'several', 'experimentally', 'realized', 'systems', 'such', 'as', 'transition', 'metal', 'dichalcogenides', 'and', 'the', 'twodimensional', 'rashba', 'system', 'belong', 'to', 'this', 'category', 'when', 'subject', 'to', 'an', 'applied', 'magnetic', 'field']]
|
[-0.18782847902015548, 0.19477711739903433, 0.02987203677420062, 0.06692581832634681, -0.08179430229909192, -0.2306843502917374, 0.038092070456707115, 0.41083535684667755, -0.2585699980269478, -0.28291151095934286, 0.12480592668159968, -0.27363411171568763, -0.16251628522319023, 0.11738768338479778, -0.01908720344671923, 0.027520777453019313, -0.08704848849976604, -0.05810869753688828, -0.1546960845048718, -0.23130175469424388, 0.3346050858798653, -0.07181806498291818, 0.3660837018514297, 0.011980099293092886, 0.02826214046217501, -0.036595001889656135, 0.13862075234264737, -0.016654327210753855, -0.09874734853472528, 0.025857480776124642, 0.2377543294339072, -0.02621321558406708, 0.11483627729790492, -0.49896584844423664, -0.21359609297918852, 0.08567501409943545, 0.1216420551263398, 0.19064854075097376, -0.14325433372722168, -0.32824460004992556, 0.07904012075559509, -0.14540803954569678, -0.14058289584713152, -0.1788030867417804, -0.037928353659949746, -0.06461772284555165, -0.2414574758102647, 0.025225532692715977, 0.09055548981584684, 0.16656525836636624, -0.05305184083379278, -0.043559065054528265, -0.15235453438145494, 0.06301953238870177, 0.06596190437928519, -0.01705353902746933, 0.08384396239640098, -0.10634179108286973, -0.14053620383933638, 0.43611899328728515, 0.034762629244307224, -0.2142710600311708, 0.2135109431063286, -0.09861966778025633, -0.13814353369496235, 0.10032615453155354, 0.12356696150387929, 0.06888369291155326, -0.11565562567792391, 0.09502100746436609, -0.04837322973580373, 0.14222592597996647, 0.0176433423355297, 0.07341380335268273, 0.2340316857314772, 0.10227516163234608, 0.09058462755020821, 0.12069977843908197, -0.08699630479083745, -0.06576316211974681, -0.32217721018300516, -0.1644503913697495, -0.20732267337940596, 0.06259067888363415, 0.006391347959053213, -0.136513642138905, 0.40196960652717434, 0.14149128618377327, 0.17562850032970687, -0.027465137326149174, 0.22256861446952128, 0.09532156842701946, 0.13076383128498842, 0.046858350200710275, 0.23560213371923175, 0.14548807867539276, 0.015787721818519965, -0.260661102196371, 0.017630971747102462, 0.02951484044185943]
|
1,803.06505
|
A simulated annealing procedure based on the ABC Shadow algorithm for
statistical inference of point processes
|
Recently a new algorithm for sampling posteriors of unnormalised probability
densities, called ABC Shadow, was proposed in [8]. This talk introduces a
global optimisation procedure based on the ABC Shadow simulation dynamics.
First the general method is explained, and then results on simulated and real
data are presented. The method is rather general, in the sense that it applies
for probability densities that are continuously differentiable with respect to
their parameters
|
stat.CO math.ST stat.TH
|
recently a new algorithm for sampling posteriors of unnormalised probability densities called abc shadow was proposed in 8 this talk introduces a global optimisation procedure based on the abc shadow simulation dynamics first the general method is explained and then results on simulated and real data are presented the method is rather general in the sense that it applies for probability densities that are continuously differentiable with respect to their parameters
|
[['recently', 'a', 'new', 'algorithm', 'for', 'sampling', 'posteriors', 'of', 'unnormalised', 'probability', 'densities', 'called', 'abc', 'shadow', 'was', 'proposed', 'in', '8', 'this', 'talk', 'introduces', 'a', 'global', 'optimisation', 'procedure', 'based', 'on', 'the', 'abc', 'shadow', 'simulation', 'dynamics', 'first', 'the', 'general', 'method', 'is', 'explained', 'and', 'then', 'results', 'on', 'simulated', 'and', 'real', 'data', 'are', 'presented', 'the', 'method', 'is', 'rather', 'general', 'in', 'the', 'sense', 'that', 'it', 'applies', 'for', 'probability', 'densities', 'that', 'are', 'continuously', 'differentiable', 'with', 'respect', 'to', 'their', 'parameters']]
|
[-0.05588773487162002, 0.059359565173918515, -0.11879291104047861, 0.10531191860528952, -0.05559806260739414, -0.12377475566742285, 0.02555208011779567, 0.4195544117353332, -0.2257566021781572, -0.3133458041390863, 0.10723941986003077, -0.21433385621762874, -0.2126827488430369, 0.22503155909321257, -0.10779672028155814, 0.09609744819143498, 0.0786317622315296, 0.027388678811175723, -0.06315509746061035, -0.26997170801287595, 0.30824436682840467, 0.06540026998435947, 0.2974166372712229, -0.007918867328479675, 0.12061554252032296, 0.011802394762897576, -0.041954652222634205, 0.05653595301965383, -0.13228100667560874, 0.1312279682737631, 0.18608669118142465, 0.18528872752286704, 0.2481091122707011, -0.36355372047392837, -0.17397713286041375, 0.06837553005258908, 0.10681338568913265, 0.09018615422062051, -0.07910659471461155, -0.2830160452892453, 0.12174352692623794, -0.1559955419769222, -0.10530005400659333, -0.10501898112903599, 7.73313861917442e-05, 0.05114624478762418, -0.30957907869429924, 0.07160635327290692, 0.016757079019722804, 0.00464659533135488, -0.04183986481331604, -0.1296186063891198, -0.01750802849485001, 0.03694560640478428, 0.014457806138138116, 0.05210403169334774, 0.10879615444401411, -0.0476441463737578, -0.12688606011379563, 0.3305956938527, -0.016523601605333914, -0.26249033734727073, 0.16754821481012647, -0.10056040538343745, -0.17619575423017983, 0.16860031270959847, 0.16586617762091713, 0.15905052405113065, -0.15640907708398052, 0.11423009110476927, -0.0510541933431277, 0.13359222660811854, 0.006265977279506099, -0.07736145761880604, 0.14424373810245117, 0.16463376807285027, 0.11628598018064046, 0.10746681519692212, -0.12934932353804676, -0.16812792750941197, -0.28321510159843405, -0.14801978874741725, -0.244422523121179, -0.02771616201441158, -0.05945248786371503, -0.15111103146271387, 0.3963380296465377, 0.19558149286296586, 0.22052496373915756, 0.10246851269654195, 0.32912937092634154, 0.13717441359849672, 0.014400274810892805, 0.07623429848274714, 0.1846282808897151, 0.08728114791988383, 0.07620603698764888, -0.12667402802822245, 0.10228029720839375, 0.0790798999041214]
|
1,803.06506
|
Learning Unsupervised Visual Grounding Through Semantic Self-Supervision
|
Localizing natural language phrases in images is a challenging problem that
requires joint understanding of both the textual and visual modalities. In the
unsupervised setting, lack of supervisory signals exacerbate this difficulty.
In this paper, we propose a novel framework for unsupervised visual grounding
which uses concept learning as a proxy task to obtain self-supervision. The
simple intuition behind this idea is to encourage the model to localize to
regions which can explain some semantic property in the data, in our case, the
property being the presence of a concept in a set of images. We present
thorough quantitative and qualitative experiments to demonstrate the efficacy
of our approach and show a 5.6% improvement over the current state of the art
on Visual Genome dataset, a 5.8% improvement on the ReferItGame dataset and
comparable to state-of-art performance on the Flickr30k dataset.
|
cs.CV
|
localizing natural language phrases in images is a challenging problem that requires joint understanding of both the textual and visual modalities in the unsupervised setting lack of supervisory signals exacerbate this difficulty in this paper we propose a novel framework for unsupervised visual grounding which uses concept learning as a proxy task to obtain selfsupervision the simple intuition behind this idea is to encourage the model to localize to regions which can explain some semantic property in the data in our case the property being the presence of a concept in a set of images we present thorough quantitative and qualitative experiments to demonstrate the efficacy of our approach and show a 56 improvement over the current state of the art on visual genome dataset a 58 improvement on the referitgame dataset and comparable to stateofart performance on the flickr30k dataset
|
[['localizing', 'natural', 'language', 'phrases', 'in', 'images', 'is', 'a', 'challenging', 'problem', 'that', 'requires', 'joint', 'understanding', 'of', 'both', 'the', 'textual', 'and', 'visual', 'modalities', 'in', 'the', 'unsupervised', 'setting', 'lack', 'of', 'supervisory', 'signals', 'exacerbate', 'this', 'difficulty', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'framework', 'for', 'unsupervised', 'visual', 'grounding', 'which', 'uses', 'concept', 'learning', 'as', 'a', 'proxy', 'task', 'to', 'obtain', 'selfsupervision', 'the', 'simple', 'intuition', 'behind', 'this', 'idea', 'is', 'to', 'encourage', 'the', 'model', 'to', 'localize', 'to', 'regions', 'which', 'can', 'explain', 'some', 'semantic', 'property', 'in', 'the', 'data', 'in', 'our', 'case', 'the', 'property', 'being', 'the', 'presence', 'of', 'a', 'concept', 'in', 'a', 'set', 'of', 'images', 'we', 'present', 'thorough', 'quantitative', 'and', 'qualitative', 'experiments', 'to', 'demonstrate', 'the', 'efficacy', 'of', 'our', 'approach', 'and', 'show', 'a', '56', 'improvement', 'over', 'the', 'current', 'state', 'of', 'the', 'art', 'on', 'visual', 'genome', 'dataset', 'a', '58', 'improvement', 'on', 'the', 'referitgame', 'dataset', 'and', 'comparable', 'to', 'stateofart', 'performance', 'on', 'the', 'flickr30k', 'dataset']]
|
[-0.03946572737537113, -0.04222300040027034, -0.07494964833694992, 0.07700270657998952, -0.14460644099517916, -0.07545162739020818, 0.06408158077359702, 0.4161646514866792, -0.2619598914822894, -0.3634161879143394, 0.04609298345910266, -0.28178572745544583, -0.17899191059198574, 0.19713467551917102, -0.1917400225197751, 0.03526825829679873, 0.1388916311428902, 0.07106391177347578, -0.041888941676316266, -0.2461248654607974, 0.29686519413433493, 0.025806639772833238, 0.35739270082991964, 0.07200310401724162, 0.13345862596282565, -0.03777869267006081, -0.038000667210526314, -0.023049399306244674, -0.035579069088477765, 0.19551292057925215, 0.32751114143501203, 0.2192998908077043, 0.3327387414397077, -0.3752490687745471, -0.21152532870339638, 0.07481472798563699, 0.1270190728444388, 0.10605999081831505, -0.06787445188701444, -0.3720465021072524, 0.10237225482623416, -0.14414229162090214, 0.00480680500243044, -0.12389283043543763, -0.016176124894331005, -0.080683702946449, -0.2813495685741081, 0.05524709027637034, 0.10997969893811284, 0.0966467624992555, -0.07401602726317413, -0.065965265497988, 0.0659647515928703, 0.15813914192047843, 0.030310304719023407, 0.08449658739268251, 0.11472895513338215, -0.19418637920996662, -0.14884216898015257, 0.3740729314162799, -0.07767550412116321, -0.2165693253846773, 0.22857906099686282, -0.06890305850971887, -0.14093908343252773, 0.07432880293551489, 0.21040820819160616, 0.12311796638916464, -0.1662710161899474, 0.01009831111052516, -0.09295056249404736, 0.2107073277051739, 0.010505454408348346, 0.01991056638574954, 0.1794244427818488, 0.2936416423635174, 0.015395176187421837, 0.16606225085557036, -0.12541506772675942, -0.04399865090946918, -0.24422506342851721, -0.13984472772679524, -0.15900329470383465, -0.04087463168737789, -0.08359242112050494, -0.1396149050259421, 0.43111729439585766, 0.276594288947708, 0.23138080543676615, 0.10548911761023527, 0.3504951768818952, -0.02162262649060283, 0.07143568483359636, 0.02550452967390669, 0.182273755779082, 0.0031828292635606324, 0.13526320914450557, -0.1967525224569617, 0.07772316195645389, 0.061273052399451286]
|
1,803.06507
|
Covering Arrays for Equivalence Classes of Words
|
Covering arrays for words of length $t$ over a $d$ letter alphabet are $k
\times n$ arrays with entries from the alphabet so that for each choice of $t$
columns, each of the $d^t$ $t$-letter words appears at least once among the
rows of the selected columns. We study two schemes in which all words are not
considered to be different. In the first case words are equivalent if they
induce the same partition of a $t$ element set. In the second case, words of
the same weight are equivalent. In both cases we produce logarithmic upper
bounds on the minimum size $k=k(n)$ of a covering array. Definitive results for
$t=2,3,4$, as well as general results, are provided.
|
math.CO
|
covering arrays for words of length t over a d letter alphabet are k times n arrays with entries from the alphabet so that for each choice of t columns each of the dt tletter words appears at least once among the rows of the selected columns we study two schemes in which all words are not considered to be different in the first case words are equivalent if they induce the same partition of a t element set in the second case words of the same weight are equivalent in both cases we produce logarithmic upper bounds on the minimum size kkn of a covering array definitive results for t234 as well as general results are provided
|
[['covering', 'arrays', 'for', 'words', 'of', 'length', 't', 'over', 'a', 'd', 'letter', 'alphabet', 'are', 'k', 'times', 'n', 'arrays', 'with', 'entries', 'from', 'the', 'alphabet', 'so', 'that', 'for', 'each', 'choice', 'of', 't', 'columns', 'each', 'of', 'the', 'dt', 'tletter', 'words', 'appears', 'at', 'least', 'once', 'among', 'the', 'rows', 'of', 'the', 'selected', 'columns', 'we', 'study', 'two', 'schemes', 'in', 'which', 'all', 'words', 'are', 'not', 'considered', 'to', 'be', 'different', 'in', 'the', 'first', 'case', 'words', 'are', 'equivalent', 'if', 'they', 'induce', 'the', 'same', 'partition', 'of', 'a', 't', 'element', 'set', 'in', 'the', 'second', 'case', 'words', 'of', 'the', 'same', 'weight', 'are', 'equivalent', 'in', 'both', 'cases', 'we', 'produce', 'logarithmic', 'upper', 'bounds', 'on', 'the', 'minimum', 'size', 'kkn', 'of', 'a', 'covering', 'array', 'definitive', 'results', 'for', 't234', 'as', 'well', 'as', 'general', 'results', 'are', 'provided']]
|
[-0.13349974394028108, 0.1648215801490597, 0.01637175309834844, 0.034340003071258125, -0.02466708091403342, -0.15160393650580387, 0.07384111498747913, 0.38965868208581045, -0.2650404902277672, -0.2567138111542405, 0.12507601679890748, -0.3220517753733922, -0.07701106921382943, 0.1786846088909473, -0.02926740871142533, 0.005287126711988032, 0.04575175109666662, 0.13639981558514855, -0.07360074146930917, -0.3193408702184462, 0.2660526858654536, -0.006073448814893678, 0.2015503929312325, -0.03826636817874545, 0.07233981402212028, -0.024543283848581298, -0.043087646104711094, 0.057675097847141706, -0.11579170267886169, 0.05394425809628062, 0.29578414059765007, 0.12087566819894364, 0.2243999983973296, -0.365953687988853, -0.15096700728192167, 0.13958350110057174, 0.13099067056772568, 0.08492378382134583, 0.02908431343690855, -0.18628808345262876, 0.15230959337189895, -0.11197759702375507, -0.05341973165997257, 0.029669492127017662, 0.08674105807104922, 0.07050009506509908, -0.29697561424454455, 0.00019277194593796286, 0.09367436341945302, 0.013696113859561777, -0.021958254522375636, -0.21759738306558327, 0.023166252564544142, 0.14282125027029444, 0.026935950063674125, 0.025162712679741808, 0.04688164036547355, -0.09590129817784684, -0.09140329297347846, 0.37031806820719426, -0.07154704740081551, -0.2041681037773773, 0.15974845314966674, -0.17770587920084974, -0.14222115344541558, 0.13288622228349795, 0.14668381144292653, 0.12866806894959093, -0.10015831752759168, 0.1052022310584523, -0.15878268210089103, 0.22270661198644567, 0.17242906443474781, 0.0822510826583928, 0.18606933784055507, 0.1134225709306597, 0.07311804149343269, 0.14137627065903902, -0.04982147257877672, -0.02095696050279095, -0.352049076517302, -0.1511038977344978, -0.18047383798077166, 0.016731380297549826, -0.10748336532437322, -0.16543169210613626, 0.3517965959479748, 0.11386258024090933, 0.2577282543436198, 0.10012252508441649, 0.21057381720866186, 0.07499512897962723, 0.1024688401148986, 0.10588354535274587, 0.10449459934133594, 0.12243107765206625, -0.0029552473254517604, -0.14286601804892365, 0.06998094690936989, 0.12772872281592276]
|
1,803.06508
|
MergeNet: A Deep Net Architecture for Small Obstacle Discovery
|
We present here, a novel network architecture called MergeNet for discovering
small obstacles for on-road scenes in the context of autonomous driving. The
basis of the architecture rests on the central consideration of training with
less amount of data since the physical setup and the annotation process for
small obstacles is hard to scale. For making effective use of the limited data,
we propose a multi-stage training procedure involving weight-sharing, separate
learning of low and high level features from the RGBD input and a refining
stage which learns to fuse the obtained complementary features. The model is
trained and evaluated on the Lost and Found dataset and is able to achieve
state-of-art results with just 135 images in comparison to the 1000 images used
by the previous benchmark. Additionally, we also compare our results with
recent methods trained on 6000 images and show that our method achieves
comparable performance with only 1000 training samples.
|
cs.CV cs.RO
|
we present here a novel network architecture called mergenet for discovering small obstacles for onroad scenes in the context of autonomous driving the basis of the architecture rests on the central consideration of training with less amount of data since the physical setup and the annotation process for small obstacles is hard to scale for making effective use of the limited data we propose a multistage training procedure involving weightsharing separate learning of low and high level features from the rgbd input and a refining stage which learns to fuse the obtained complementary features the model is trained and evaluated on the lost and found dataset and is able to achieve stateofart results with just 135 images in comparison to the 1000 images used by the previous benchmark additionally we also compare our results with recent methods trained on 6000 images and show that our method achieves comparable performance with only 1000 training samples
|
[['we', 'present', 'here', 'a', 'novel', 'network', 'architecture', 'called', 'mergenet', 'for', 'discovering', 'small', 'obstacles', 'for', 'onroad', 'scenes', 'in', 'the', 'context', 'of', 'autonomous', 'driving', 'the', 'basis', 'of', 'the', 'architecture', 'rests', 'on', 'the', 'central', 'consideration', 'of', 'training', 'with', 'less', 'amount', 'of', 'data', 'since', 'the', 'physical', 'setup', 'and', 'the', 'annotation', 'process', 'for', 'small', 'obstacles', 'is', 'hard', 'to', 'scale', 'for', 'making', 'effective', 'use', 'of', 'the', 'limited', 'data', 'we', 'propose', 'a', 'multistage', 'training', 'procedure', 'involving', 'weightsharing', 'separate', 'learning', 'of', 'low', 'and', 'high', 'level', 'features', 'from', 'the', 'rgbd', 'input', 'and', 'a', 'refining', 'stage', 'which', 'learns', 'to', 'fuse', 'the', 'obtained', 'complementary', 'features', 'the', 'model', 'is', 'trained', 'and', 'evaluated', 'on', 'the', 'lost', 'and', 'found', 'dataset', 'and', 'is', 'able', 'to', 'achieve', 'stateofart', 'results', 'with', 'just', '135', 'images', 'in', 'comparison', 'to', 'the', '1000', 'images', 'used', 'by', 'the', 'previous', 'benchmark', 'additionally', 'we', 'also', 'compare', 'our', 'results', 'with', 'recent', 'methods', 'trained', 'on', '6000', 'images', 'and', 'show', 'that', 'our', 'method', 'achieves', 'comparable', 'performance', 'with', 'only', '1000', 'training', 'samples']]
|
[-0.027158215799211682, 0.02397781912261596, -0.05420019404279286, 0.04267848167663552, -0.08351297351961061, -0.15095584346555996, 0.054835749637371825, 0.42478542327397056, -0.2174137083196698, -0.38484376835237655, 0.09658620458598212, -0.2761177077763578, -0.13553247355868098, 0.22868154805256416, -0.1151510070882399, 0.06935429355120529, 0.1699403086095117, 0.04606978179790176, -0.049376753901204024, -0.27428736190565606, 0.32588271717631634, 0.06304453069332068, 0.3295937859144836, 0.004429398808331991, 0.17385260819369783, -0.04366571718241789, -0.04832013212174613, -0.010496933673139565, -0.04921775795966304, 0.17812956460031934, 0.25606860566352097, 0.15476353743790902, 0.2806967756583948, -0.42783333284949715, -0.1950520675057884, 0.044174700905115334, 0.11529161829150633, 0.10231998398999817, -0.056321015205784614, -0.3318275347013365, 0.11689615259839028, -0.13481405455401385, -0.015835585347800094, -0.1292857773626199, -0.009643650511672793, -0.014940078300726297, -0.3216432551671932, 0.037172346931501205, 0.026036854476559085, 0.06332311351698908, -0.07123647502460215, -0.11545183192110808, 0.016052455565734924, 0.15883183909592208, 0.009248005189780183, 0.05666992479618548, 0.136163686241882, -0.1712235902925929, -0.08861965363748468, 0.381161596589758, -0.07296224883092302, -0.1655536074941228, 0.2357524859525457, -0.06862259925911565, -0.12676110918718306, 0.13132007310602378, 0.20329924990130474, 0.13546160219672632, -0.16167970298329828, -0.01810629513245469, -0.02975729335698166, 0.1987065003410756, 0.015768267256631094, -0.009015296673547332, 0.12796610543298742, 0.27696912515569816, -0.0009267633333318419, 0.16345942063656235, -0.19136831765335247, -0.052894915239401645, -0.24171923312612556, -0.08275469295323717, -0.20390169853163134, -0.03335332037282309, -0.1015000649231415, -0.10523368443465222, 0.377575937434789, 0.27111185893912304, 0.2536739344805382, 0.1197623852164146, 0.34919554224939314, 0.013301103589028217, 0.13439196209701432, 0.08331688375260632, 0.2063665589682044, 0.001608721251968391, 0.11873217579015144, -0.15205795989619786, 0.05413330151388034, 0.01788163599527937]
|
1,803.06509
|
Explosive shock tube of xenon non-ideal plasma for proton radiography
|
A high explosive shock tube of non-ideal gaseous plasma for proton
radiography is described. The gas dynamic flow in the shock compressed xenon at
initial pressure of 7 bar was investigated in the tube. The velocity of the
shock wave in xenon and the associated particle velocity were measured by a
high-speed rotating mirror streak camera. Experimental time-distance data was
used for approximation of the velocities by exponential decay functions. The
shock tube is intended for generation of non-ideal plasma of xenon at the
pressure of 5-12 kbar, the density of 0.24-0.3 g/cm3 when the initial pressure
is about 7 bar.
|
physics.plasm-ph
|
a high explosive shock tube of nonideal gaseous plasma for proton radiography is described the gas dynamic flow in the shock compressed xenon at initial pressure of 7 bar was investigated in the tube the velocity of the shock wave in xenon and the associated particle velocity were measured by a highspeed rotating mirror streak camera experimental timedistance data was used for approximation of the velocities by exponential decay functions the shock tube is intended for generation of nonideal plasma of xenon at the pressure of 512 kbar the density of 02403 gcm3 when the initial pressure is about 7 bar
|
[['a', 'high', 'explosive', 'shock', 'tube', 'of', 'nonideal', 'gaseous', 'plasma', 'for', 'proton', 'radiography', 'is', 'described', 'the', 'gas', 'dynamic', 'flow', 'in', 'the', 'shock', 'compressed', 'xenon', 'at', 'initial', 'pressure', 'of', '7', 'bar', 'was', 'investigated', 'in', 'the', 'tube', 'the', 'velocity', 'of', 'the', 'shock', 'wave', 'in', 'xenon', 'and', 'the', 'associated', 'particle', 'velocity', 'were', 'measured', 'by', 'a', 'highspeed', 'rotating', 'mirror', 'streak', 'camera', 'experimental', 'timedistance', 'data', 'was', 'used', 'for', 'approximation', 'of', 'the', 'velocities', 'by', 'exponential', 'decay', 'functions', 'the', 'shock', 'tube', 'is', 'intended', 'for', 'generation', 'of', 'nonideal', 'plasma', 'of', 'xenon', 'at', 'the', 'pressure', 'of', '512', 'kbar', 'the', 'density', 'of', '02403', 'gcm3', 'when', 'the', 'initial', 'pressure', 'is', 'about', '7', 'bar']]
|
[-0.09054425109701697, 0.23618994459509848, -0.06510715230833738, 0.0363856859866064, 0.010721917813643813, -0.08443718910391908, -0.044806727804243565, 0.3580448902677745, -0.23225844225846232, -0.2936241501569748, 0.07890030431444757, -0.2628833692986518, 0.050362907969392835, 0.19708234603167513, 0.04072969294153154, 0.13085164331365376, 0.04831179506145418, 0.008067156495526433, -0.07005233796779066, -0.1707565369689837, 0.24976568503305316, 0.12052288056351244, 0.23716187419369816, 0.06340821357443929, 0.12029499405995012, -0.07395255784969777, -0.028042326960712672, -0.009609589809551835, -0.14314943262113958, -0.010551702975062653, 0.19879266230855136, 0.0845999368513003, 0.18669513057917356, -0.5020990873686969, -0.24987198455259205, -0.03333409643732011, 0.12322814930230379, 0.057535329076927155, -0.05797218770487234, -0.28723986956290903, 0.08378311801701784, -0.19766878692433237, -0.20862398156081327, 0.07428727048449218, 0.04408474532421678, 0.088972686114721, -0.26032915668562057, 0.14752138033509254, -0.011335376771166921, 0.06890656569506973, -0.10843502354808152, -0.09311191116925328, -0.017355502252466976, -0.0024641417115344668, 0.039666075876448305, 0.10291827390436083, 0.28088328647369054, -0.18719713446684183, 0.03658817828632891, 0.39162531432695685, -0.0728166164830327, -0.08374013270251453, 0.19453692971728742, -0.22160955863073467, -0.01889311144128442, 0.29376510189846156, 0.1766544486489147, 0.028585131601430475, -0.11204709312718478, 0.009381824330848759, -0.04867824489818304, 0.14170434756204486, 0.19344017043709755, -0.10033852404449135, 0.20194831000466365, 0.20508015239262023, 0.025679322695359587, 0.13217576218652538, -0.2394980541203404, 0.01623988973442465, -0.31857294861227275, -0.17751427627168595, -0.1302884402871132, -0.00888497732070391, -0.08964736546840868, -0.13643140430096537, 0.34839877419173715, 0.06710294112563134, 0.12306670204270631, -0.06854981118813157, 0.3395100707188249, 0.08649773992598057, 0.018730099350214004, 0.10993439552745259, 0.2801310440152884, 0.23752614085911772, 0.21582072510849684, -0.27673139051999895, 0.07691625731997193, 0.04422129966784269]
|
1,803.0651
|
Hidden Integrality and Semi-random Robustness of SDP Relaxation for
Sub-Gaussian Mixture Model
|
We consider the problem of estimating the discrete clustering structures
under the Sub-Gaussian Mixture Model. Our main results establish a hidden
integrality property of a semidefinite programming (SDP) relaxation for this
problem: while the optimal solution to the SDP is not integer-valued in
general, its estimation error can be upper bounded by that of an idealized
integer program. The error of the integer program, and hence that of the SDP,
are further shown to decay exponentially in the signal-to-noise ratio. In
addition, we show that the SDP relaxation is robust under the semi-random
setting in which an adversary can modify the data generated from the mixture
model. In particular, we generalize the hidden integrality property to the
semi-random model and thereby show that SDP achieves the optimal error bound in
this setting. These results together highlight the "global-to-local" mechanism
that drives the performance of the SDP relaxation.
To the best of our knowledge, our result is the first exponentially decaying
error bound for convex relaxations of mixture models. A corollary of our
results shows that in certain regimes the SDP solutions are in fact integral
and exact. More generally, our results establish sufficient conditions for the
SDP to correctly recover the cluster memberships of $(1-\delta)$ fraction of
the points for any $\delta\in(0,1)$. As a special case, we show that under the
$d$-dimensional Stochastic Ball Model, SDP achieves non-trivial (sometimes
exact) recovery when the center separation is as small as $\sqrt{1/d}$, which
improves upon previous exact recovery results that require constant separation.
|
stat.ML cs.IT cs.LG math.IT math.OC math.ST stat.TH
|
we consider the problem of estimating the discrete clustering structures under the subgaussian mixture model our main results establish a hidden integrality property of a semidefinite programming sdp relaxation for this problem while the optimal solution to the sdp is not integervalued in general its estimation error can be upper bounded by that of an idealized integer program the error of the integer program and hence that of the sdp are further shown to decay exponentially in the signaltonoise ratio in addition we show that the sdp relaxation is robust under the semirandom setting in which an adversary can modify the data generated from the mixture model in particular we generalize the hidden integrality property to the semirandom model and thereby show that sdp achieves the optimal error bound in this setting these results together highlight the globaltolocal mechanism that drives the performance of the sdp relaxation to the best of our knowledge our result is the first exponentially decaying error bound for convex relaxations of mixture models a corollary of our results shows that in certain regimes the sdp solutions are in fact integral and exact more generally our results establish sufficient conditions for the sdp to correctly recover the cluster memberships of 1delta fraction of the points for any deltain01 as a special case we show that under the ddimensional stochastic ball model sdp achieves nontrivial sometimes exact recovery when the center separation is as small as sqrt1d which improves upon previous exact recovery results that require constant separation
|
[['we', 'consider', 'the', 'problem', 'of', 'estimating', 'the', 'discrete', 'clustering', 'structures', 'under', 'the', 'subgaussian', 'mixture', 'model', 'our', 'main', 'results', 'establish', 'a', 'hidden', 'integrality', 'property', 'of', 'a', 'semidefinite', 'programming', 'sdp', 'relaxation', 'for', 'this', 'problem', 'while', 'the', 'optimal', 'solution', 'to', 'the', 'sdp', 'is', 'not', 'integervalued', 'in', 'general', 'its', 'estimation', 'error', 'can', 'be', 'upper', 'bounded', 'by', 'that', 'of', 'an', 'idealized', 'integer', 'program', 'the', 'error', 'of', 'the', 'integer', 'program', 'and', 'hence', 'that', 'of', 'the', 'sdp', 'are', 'further', 'shown', 'to', 'decay', 'exponentially', 'in', 'the', 'signaltonoise', 'ratio', 'in', 'addition', 'we', 'show', 'that', 'the', 'sdp', 'relaxation', 'is', 'robust', 'under', 'the', 'semirandom', 'setting', 'in', 'which', 'an', 'adversary', 'can', 'modify', 'the', 'data', 'generated', 'from', 'the', 'mixture', 'model', 'in', 'particular', 'we', 'generalize', 'the', 'hidden', 'integrality', 'property', 'to', 'the', 'semirandom', 'model', 'and', 'thereby', 'show', 'that', 'sdp', 'achieves', 'the', 'optimal', 'error', 'bound', 'in', 'this', 'setting', 'these', 'results', 'together', 'highlight', 'the', 'globaltolocal', 'mechanism', 'that', 'drives', 'the', 'performance', 'of', 'the', 'sdp', 'relaxation', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'our', 'result', 'is', 'the', 'first', 'exponentially', 'decaying', 'error', 'bound', 'for', 'convex', 'relaxations', 'of', 'mixture', 'models', 'a', 'corollary', 'of', 'our', 'results', 'shows', 'that', 'in', 'certain', 'regimes', 'the', 'sdp', 'solutions', 'are', 'in', 'fact', 'integral', 'and', 'exact', 'more', 'generally', 'our', 'results', 'establish', 'sufficient', 'conditions', 'for', 'the', 'sdp', 'to', 'correctly', 'recover', 'the', 'cluster', 'memberships', 'of', '1delta', 'fraction', 'of', 'the', 'points', 'for', 'any', 'deltain01', 'as', 'a', 'special', 'case', 'we', 'show', 'that', 'under', 'the', 'ddimensional', 'stochastic', 'ball', 'model', 'sdp', 'achieves', 'nontrivial', 'sometimes', 'exact', 'recovery', 'when', 'the', 'center', 'separation', 'is', 'as', 'small', 'as', 'sqrt1d', 'which', 'improves', 'upon', 'previous', 'exact', 'recovery', 'results', 'that', 'require', 'constant', 'separation']]
|
[-0.11331592745006648, 0.02673429345623479, -0.09942059375649964, 0.0920781364160742, -0.05857431250661463, -0.15933575550376242, 0.07323335569196072, 0.3237150208931787, -0.32005207728876534, -0.3135373772222148, 0.1404023152225061, -0.22725705067864602, -0.17337649012637507, 0.18086307981808436, -0.07801236644891867, 0.07828470726105091, 0.06723782993237158, 0.027025217876817838, -0.10245764587840726, -0.299746980193995, 0.2787914795697151, 0.036857465460184084, 0.24694494306911302, 0.04824816081158082, 0.0790531310253773, 2.926789072019408e-05, 0.05132102803976472, 0.01190143749553829, -0.1279252154497055, 0.098900826809746, 0.2757160448757738, 0.16530249828836358, 0.279124530163998, -0.393274067558786, -0.16719421497648174, 0.10694556355854845, 0.13418657273372758, 0.12177957045526588, -0.04790197636411976, -0.2556152365409743, 0.13135577102777998, -0.09944634908041268, -0.08397956900261491, -0.08128876206223887, -0.02688278950031001, -0.00045561186799527226, -0.3547014791668723, 0.09488974198090484, 0.14860539538674503, -0.04032799441924419, -0.10753369378436178, -0.16323240072256792, 0.03575900689127347, 0.07452420054193293, 0.0692623668434692, 0.045520698768550534, 0.08069702369936434, -0.09973742086551639, -0.12104239061278146, 0.31800040886162284, -0.08079263779605586, -0.22371843339136963, 0.16130916498540215, -0.12631479529218667, -0.15436527771185118, 0.14606074911896585, 0.1719320002865358, 0.14420705555244331, -0.10580821577915263, 0.11549668773508769, -0.14598752864343356, 0.1844117222882555, 0.02636800630322372, 0.04103043574799943, 0.10908150981529152, 0.14765496751519877, 0.16609551957567256, 0.19448216294821544, -0.04665670555457844, -0.10947489007877045, -0.29591730847004877, -0.1206923954381767, -0.23818199072205704, 0.022045504987349758, -0.14425875413848646, -0.12695319497755142, 0.37203819020484313, 0.15436987145117437, 0.18256290508916534, 0.19131174864362466, 0.2959993599034638, 0.11834333454415506, 0.023891428564359763, 0.11690922766419283, 0.23708476576364165, 0.09845790527093101, 0.03393607310472108, -0.25009860974677145, 0.11296956757068694, 0.07597881575054498]
|
1,803.06511
|
On discretization of the Euler top
|
Application of the intersection theory to construction of n-point
finite-difference equations associated with classical integrable systems is
discussed. As an example, we present a few new discretizations of motion of the
Euler top sharing the integrals of motion with the continuous time system and
the Poisson bracket up to the integer scaling factor.
|
nlin.SI math-ph math.DS math.MP
|
application of the intersection theory to construction of npoint finitedifference equations associated with classical integrable systems is discussed as an example we present a few new discretizations of motion of the euler top sharing the integrals of motion with the continuous time system and the poisson bracket up to the integer scaling factor
|
[['application', 'of', 'the', 'intersection', 'theory', 'to', 'construction', 'of', 'npoint', 'finitedifference', 'equations', 'associated', 'with', 'classical', 'integrable', 'systems', 'is', 'discussed', 'as', 'an', 'example', 'we', 'present', 'a', 'few', 'new', 'discretizations', 'of', 'motion', 'of', 'the', 'euler', 'top', 'sharing', 'the', 'integrals', 'of', 'motion', 'with', 'the', 'continuous', 'time', 'system', 'and', 'the', 'poisson', 'bracket', 'up', 'to', 'the', 'integer', 'scaling', 'factor']]
|
[-0.20029323701834623, 0.06729833332998546, -0.07736481458194694, 0.0344155957715867, -0.0778519388920856, -0.10555575682588343, -0.023726745717280177, 0.3080280036929081, -0.34446411952376366, -0.2825219017225054, 0.10890335185708092, -0.24744065901492987, -0.16228605750596747, 0.1999331779145407, -0.03866800266968192, 0.12180238652904078, 0.06362366078878348, 0.03996770124759455, -0.11128552526868177, -0.25212250744818515, 0.35482484141786425, 0.02071263679777676, 0.20063500406818008, -0.017348420507503005, 0.190204454462905, -0.010212025425027846, -0.04170661880019701, -0.015387584305948243, -0.10475528180897939, 0.13117962353423518, 0.22076099653912815, 0.011986707117549091, 0.22136006493753982, -0.3937824542089453, -0.14720485589130922, 0.03415011205130591, 0.13862894753099614, 0.08026623620458369, -0.014930741914178966, -0.27878229276118976, 0.044709484953925294, -0.17929449256614977, -0.2196426011340798, -0.08059979774901327, 0.04113310990187357, 0.07354660286515388, -0.235078512357091, 0.07481858291540225, 0.05713847513257895, 0.06659699053907732, -0.08315454430456432, -0.1113401505863294, -0.002566097620523201, 0.08720083526810105, 0.010553956181162371, 0.03605227804971191, 0.07099175977713938, -0.11555967853351864, -0.18909815833288826, 0.4221355876147325, -0.06694761434139437, -0.28423028070268763, 0.1739040894152702, -0.1405779994005021, -0.12952527769331662, 0.12857913858485673, 0.1609118863377931, 0.13790347363870098, -0.12995495589203993, 0.10262813990966435, -0.018206094655225862, 0.1024562129926569, 0.07219101226765592, 0.006445356451396672, 0.14713220801292304, 0.17261384508379227, 0.07810631733308634, 0.13722636249742276, -0.04180365208786789, -0.2054602217878092, -0.3821614055701022, -0.1978129268813887, -0.14966402023608955, 0.10845189311383467, -0.13995538043041653, -0.23018614821276576, 0.37651779147673325, 0.1313457259730401, 0.13276891658117748, 0.10449671098206825, 0.25275991277171755, 0.22793251636025127, 0.06100932888264926, 0.05259603243496901, 0.10318993900041536, 0.1642241721691669, 0.1067093219256626, -0.20814701044088546, -0.06162458441202652, 0.18294464322773493]
|
1,803.06512
|
Quantum engineering of transistors based on 2D materials
heterostructures
|
Quantum engineering entails atom by atom design and fabrication of electronic
devices. This innovative technology that unifies materials science and device
engineering has been fostered by the recent progress in the fabrication of
vertical and lateral heterostructures of two-dimensional materials and by the
assessment of the technology potential via computational nanotechnology. But
how close are we to the possibility of practical realisation of the next
generation atomically thin transistors? In this perspective we analyse the
outlook and the challenges of quantum- engineered transistors using
heterostructures of two-dimensional materials against the benchmark of silicon
technology and its foreseeable evolution in terms of potential performance and
manufacturability. Transistors based on lateral heterostructures emerge as the
most promising option from a performance point of view, even if heterostructure
formation and control are in the initial technology development stage.
|
cond-mat.mtrl-sci cond-mat.mes-hall
|
quantum engineering entails atom by atom design and fabrication of electronic devices this innovative technology that unifies materials science and device engineering has been fostered by the recent progress in the fabrication of vertical and lateral heterostructures of twodimensional materials and by the assessment of the technology potential via computational nanotechnology but how close are we to the possibility of practical realisation of the next generation atomically thin transistors in this perspective we analyse the outlook and the challenges of quantum engineered transistors using heterostructures of twodimensional materials against the benchmark of silicon technology and its foreseeable evolution in terms of potential performance and manufacturability transistors based on lateral heterostructures emerge as the most promising option from a performance point of view even if heterostructure formation and control are in the initial technology development stage
|
[['quantum', 'engineering', 'entails', 'atom', 'by', 'atom', 'design', 'and', 'fabrication', 'of', 'electronic', 'devices', 'this', 'innovative', 'technology', 'that', 'unifies', 'materials', 'science', 'and', 'device', 'engineering', 'has', 'been', 'fostered', 'by', 'the', 'recent', 'progress', 'in', 'the', 'fabrication', 'of', 'vertical', 'and', 'lateral', 'heterostructures', 'of', 'twodimensional', 'materials', 'and', 'by', 'the', 'assessment', 'of', 'the', 'technology', 'potential', 'via', 'computational', 'nanotechnology', 'but', 'how', 'close', 'are', 'we', 'to', 'the', 'possibility', 'of', 'practical', 'realisation', 'of', 'the', 'next', 'generation', 'atomically', 'thin', 'transistors', 'in', 'this', 'perspective', 'we', 'analyse', 'the', 'outlook', 'and', 'the', 'challenges', 'of', 'quantum', 'engineered', 'transistors', 'using', 'heterostructures', 'of', 'twodimensional', 'materials', 'against', 'the', 'benchmark', 'of', 'silicon', 'technology', 'and', 'its', 'foreseeable', 'evolution', 'in', 'terms', 'of', 'potential', 'performance', 'and', 'manufacturability', 'transistors', 'based', 'on', 'lateral', 'heterostructures', 'emerge', 'as', 'the', 'most', 'promising', 'option', 'from', 'a', 'performance', 'point', 'of', 'view', 'even', 'if', 'heterostructure', 'formation', 'and', 'control', 'are', 'in', 'the', 'initial', 'technology', 'development', 'stage']]
|
[-0.12394513308794962, 0.09443307233353455, -0.011869059263349132, -0.06829338960513404, -0.03531421450553117, -0.18777749953032644, 0.03613848572734881, 0.42621802853213414, -0.2357515293458063, -0.31973671335037107, 0.09164784257990066, -0.26555198138855673, -0.21438606027168808, 0.2943740478268376, -0.061416378941524914, 0.1080755294753342, 0.052985380956454685, -0.1453599574044347, -0.05545691183457772, -0.21197615830158745, 0.25526563542791536, 0.08284425978479838, 0.3903502636088955, 0.11407889150841921, 0.07764911763542504, -0.028569789025587617, 0.07314182632878699, -0.0332398491523539, -0.137487834150724, 0.19577409620914193, 0.2861662606725952, 0.021032463747111183, 0.3323006446438807, -0.5259971383545133, -0.22424867775774113, -0.01613944675428448, 0.1258244784893813, 0.13486481474160597, -0.16716156238776253, -0.2745592281429304, 0.07192997929674608, -0.18468500229150608, -0.12136016881117097, -0.067891393829551, 0.004996228559563557, 0.016368769288614943, -0.15186962214755584, -0.03512633527042689, 0.012829156840840976, 0.057969116047024725, -0.047663163163168876, -0.12847415765540468, -0.0065431300567945945, 0.10205011158422739, -0.022335346302672945, 0.008714008096743513, 0.2309598078084592, -0.21107495042874858, -0.20019890892974757, 0.4003865669584937, -0.019685438209799705, -0.10780764549832653, 0.17279188446700572, -0.1271193435519106, -0.05952551668785788, 0.032889731631924705, 0.1760143781856944, 0.05750681609950132, -0.1575551720103249, 0.12955746853172226, 0.09601273462176323, 0.11203227230041564, 0.060950262221956146, 0.12272128808070663, 0.2935974897299376, 0.2985734892871093, 0.05488391188663189, 0.11888658150478645, -0.08389042434282601, -0.0549315031790347, -0.2267161126214045, -0.23919040673860797, -0.20923077751089025, 0.10124907842664807, -0.04047377290876789, -0.1901521896150101, 0.414487177906213, 0.21552836145101875, 0.07529459505997323, -0.09043573794403562, 0.3283871926367283, 0.0428389078963341, 0.10096175081820952, -0.050026535685174164, 0.25227634642549135, 0.12085762162761832, 0.15891461307366153, -0.18616466281280197, 0.10630643220566627, -0.03620482148749202]
|
1,803.06513
|
Two-color electromagnetically induced transparency via modulated
coupling between a mechanical resonator and a qubit
|
We discuss level splitting and sideband transitions induced by a modulated
coupling between a superconducting quantum circuit and a nanomechanical
resonator. First, we show how to achieve an unconventional time-dependent
longitudinal coupling between a flux (transmon) qubit and the resonator.
Considering a sinusoidal modulation of the coupling strength, we find that a
first-order sideband transition can be split into two. Moreover, under the
driving of a red-detuned field, we discuss the optical response of the qubit
for a resonant probe field. We show that level splitting induced by modulating
this longitudinal coupling can enable two-color electromagnetically induced
transparency (EIT), in addition to single-color EIT. In contrast to standard
predictions of two-color EIT in atomic systems, we apply here only a single
drive (control) field. The monochromatic modulation of the coupling strength is
equivalent to employing two eigenfrequency-tunable mechanical resonators. Both
drive-probe detuning for single-color EIT and the distance between transparent
windows for two-color EIT, can be adjusted by tuning the modulation frequency
of the coupling.
|
quant-ph
|
we discuss level splitting and sideband transitions induced by a modulated coupling between a superconducting quantum circuit and a nanomechanical resonator first we show how to achieve an unconventional timedependent longitudinal coupling between a flux transmon qubit and the resonator considering a sinusoidal modulation of the coupling strength we find that a firstorder sideband transition can be split into two moreover under the driving of a reddetuned field we discuss the optical response of the qubit for a resonant probe field we show that level splitting induced by modulating this longitudinal coupling can enable twocolor electromagnetically induced transparency eit in addition to singlecolor eit in contrast to standard predictions of twocolor eit in atomic systems we apply here only a single drive control field the monochromatic modulation of the coupling strength is equivalent to employing two eigenfrequencytunable mechanical resonators both driveprobe detuning for singlecolor eit and the distance between transparent windows for twocolor eit can be adjusted by tuning the modulation frequency of the coupling
|
[['we', 'discuss', 'level', 'splitting', 'and', 'sideband', 'transitions', 'induced', 'by', 'a', 'modulated', 'coupling', 'between', 'a', 'superconducting', 'quantum', 'circuit', 'and', 'a', 'nanomechanical', 'resonator', 'first', 'we', 'show', 'how', 'to', 'achieve', 'an', 'unconventional', 'timedependent', 'longitudinal', 'coupling', 'between', 'a', 'flux', 'transmon', 'qubit', 'and', 'the', 'resonator', 'considering', 'a', 'sinusoidal', 'modulation', 'of', 'the', 'coupling', 'strength', 'we', 'find', 'that', 'a', 'firstorder', 'sideband', 'transition', 'can', 'be', 'split', 'into', 'two', 'moreover', 'under', 'the', 'driving', 'of', 'a', 'reddetuned', 'field', 'we', 'discuss', 'the', 'optical', 'response', 'of', 'the', 'qubit', 'for', 'a', 'resonant', 'probe', 'field', 'we', 'show', 'that', 'level', 'splitting', 'induced', 'by', 'modulating', 'this', 'longitudinal', 'coupling', 'can', 'enable', 'twocolor', 'electromagnetically', 'induced', 'transparency', 'eit', 'in', 'addition', 'to', 'singlecolor', 'eit', 'in', 'contrast', 'to', 'standard', 'predictions', 'of', 'twocolor', 'eit', 'in', 'atomic', 'systems', 'we', 'apply', 'here', 'only', 'a', 'single', 'drive', 'control', 'field', 'the', 'monochromatic', 'modulation', 'of', 'the', 'coupling', 'strength', 'is', 'equivalent', 'to', 'employing', 'two', 'eigenfrequencytunable', 'mechanical', 'resonators', 'both', 'driveprobe', 'detuning', 'for', 'singlecolor', 'eit', 'and', 'the', 'distance', 'between', 'transparent', 'windows', 'for', 'twocolor', 'eit', 'can', 'be', 'adjusted', 'by', 'tuning', 'the', 'modulation', 'frequency', 'of', 'the', 'coupling']]
|
[-0.21496612647765437, 0.2550761055157904, -0.014676826391826195, 0.018184391358878716, -0.04365009385978152, -0.17821875713662777, 0.09457069133876886, 0.4942445822425781, -0.25386699517057537, -0.26884600804101655, -0.01896031338512966, -0.19999005274984277, -0.13021665833536192, 0.23712583534430964, 0.020587866198831448, 0.008218555388389372, 0.015583138010161786, -0.02374240126392227, -0.02037870521982846, -0.10148079808018645, 0.29769730694382024, -0.016775179126562744, 0.3164872537492746, 0.06212852847229609, 0.101541502866894, -0.0025529241377910588, 0.11790758398635759, 0.009997310162596177, -0.08957026069785648, 0.06954047939757262, 0.2066336082597406, -0.005294982822429092, 0.2500213156882788, -0.41798566456632746, -0.1967086983184713, 0.08070907226557975, 0.14415366427567244, 0.18466186664278614, -0.060720065317225236, -0.32243110166371236, -0.02417339821648927, -0.11758824776389573, -0.06525193951006956, -0.09313280580199661, -0.045773739538704006, 0.019632384818092995, -0.33139864830700166, 0.005816203150669673, 0.01948808395286645, 0.06868761094527011, -0.030083740798562218, 0.028678633312643306, 0.014025870944870397, 0.06513254748274533, -0.08010339503964992, 0.023758880205900963, 0.17575663898962957, -0.11475687360096769, -0.1310452384334286, 0.3461434726690462, -0.19912865432836344, -0.10985350693958851, 0.12834934961976358, -0.13399442617832882, 0.0021531014571800552, 0.110977633447712, 0.1293982310460572, 0.04115699756828221, -0.13426042123868392, 0.028198512898118127, 0.03721731974589038, 0.2545893487621933, 0.17231549120913803, 0.10180389252062773, 0.18986939456588103, 0.15931989398693516, 0.060290581203905715, 0.20508293558534899, -0.1056680142410968, -0.04388662266539284, -0.27656030989440583, -0.09694282623847798, -0.13681899145405535, 0.06986951736584762, -0.06215817107286224, -0.14937175334444802, 0.46258430437190584, 0.17872510988529888, 0.17055452821856262, -0.09163906347675055, 0.3502575857079148, 0.21138411075265312, 0.06525505696669039, -0.01869792294934209, 0.3736662149509312, 0.2141547336591625, 0.049303292548226796, -0.3747235828313542, -0.05932829867008548, -0.007529526120451696]
|
1,803.06514
|
On weak universality of three-dimensional Larger than Life cellular
automaton
|
Larger than Life cellular automaton (LtL) is a class of cellular automata and
is a generalization of the game of Life by extending its neighborhood radius.
We have studied the three-dimensional extension of LtL. In this paper, we show
a radius-4 three-dimensional LtL rule is a candidate for weakly universal one.
|
nlin.CG
|
larger than life cellular automaton ltl is a class of cellular automata and is a generalization of the game of life by extending its neighborhood radius we have studied the threedimensional extension of ltl in this paper we show a radius4 threedimensional ltl rule is a candidate for weakly universal one
|
[['larger', 'than', 'life', 'cellular', 'automaton', 'ltl', 'is', 'a', 'class', 'of', 'cellular', 'automata', 'and', 'is', 'a', 'generalization', 'of', 'the', 'game', 'of', 'life', 'by', 'extending', 'its', 'neighborhood', 'radius', 'we', 'have', 'studied', 'the', 'threedimensional', 'extension', 'of', 'ltl', 'in', 'this', 'paper', 'we', 'show', 'a', 'radius4', 'threedimensional', 'ltl', 'rule', 'is', 'a', 'candidate', 'for', 'weakly', 'universal', 'one']]
|
[-0.12989064602705183, 0.10502184376120567, -0.03758671731688082, 0.12075806489679962, -0.08928853280842304, -0.15150503146462144, 0.0873243764624931, 0.3733477511256933, -0.27062556467950344, -0.2224995655566454, 0.12048053609440103, -0.23347671158611774, -0.156410924308002, 0.17435847528278828, -0.10121634631883353, 0.058680281935958194, 0.05186779836192727, 0.11819311464205384, 0.0033393735624849797, -0.20301289831753822, 0.292928517293185, 0.018069770992733537, 0.20217890644911676, -0.020280567947775125, 0.05736712006386369, -0.024696206003427507, 0.01356636207550764, 0.09959725487977267, -0.10360627983696759, 0.13736288474872707, 0.24658176412340255, 0.22407797820866107, 0.30722637569531797, -0.381158372182399, -0.27811271412298083, 0.18015713511034848, 0.13630613190121948, 0.07857457045465707, -0.011268456580583007, -0.24291161241009832, 0.1195729278307408, -0.2477245091088116, -0.12095690488815308, -0.005916806481545791, 0.09816508537624032, -0.003158385388087481, -0.23588723577558995, -0.037178492937237025, 0.1513368515856564, 0.10422180159162962, -0.08347012247191742, -0.05656913615763187, 0.030054082721471788, 0.05165749751031399, -0.06687906078528613, -0.02396351587027311, 0.12749008597806097, -0.0991882650507614, -0.174876528121531, 0.4240096718072891, -0.03411972194589907, -0.1757096598856151, 0.17665396861732005, -0.11070134242996574, -0.14958837926387786, 0.13340377770364284, 0.08446556524839252, 0.17580536853522064, -0.14440490679815413, 0.13335943663376384, -0.1954925641301088, 0.19558247450739144, 0.06767017345875502, 0.016371986297890544, 0.21730336997658015, 0.36366278200410307, 0.08968907630536706, 0.19220546025782823, -0.0011744032055139542, -0.14724051997065543, -0.23469869315624237, -0.262635718556121, -0.132855032607913, 0.03161522762966342, -0.02095820598275168, -0.17909240620210767, 0.4309730093926191, 0.13045278120785953, 0.10387672124430537, 0.2509954308345914, 0.26491220455616715, 0.11844398513436317, 0.10499251386150718, 0.022139991614967585, 0.13180822461843492, 0.12798967903014272, 0.12801112062297762, -0.19863054336747155, 0.07636128464248032, 0.150896042753011]
|
1,803.06515
|
From nonholonomic quantum constraint to canonical variables of photons
I: true intrinsic degree of freedom
|
We report that the true intrinsic degree of freedom of the photon is neither
the polarization nor the spin. It describes a local property in momentum space
and is represented in the local representation by the Pauli matrices. This
result is achieved by treating the transversality condition on the vector
wavefunction as a nonholonomic quantum constraint. We find that the quantum
constraint makes it possible to generalize the Stokes parameters to
characterize the polarization of a general state. Unexpectedly, the generalized
Stokes parameters are specified in a momentum-space local reference system that
is fixed by another degree of freedom, called Stratton vector. Only constant
Stokes parameters in one particular local reference system can convey the
intrinsic degree of freedom of the photon. We show that the optical rotation is
one of such processes that change the Stratton vector with the intrinsic
quantum number remaining fixed. Changing the Stratton vector of the eigenstate
of the helicity will give rise to a Berry's phase.
|
quant-ph math.RT physics.optics
|
we report that the true intrinsic degree of freedom of the photon is neither the polarization nor the spin it describes a local property in momentum space and is represented in the local representation by the pauli matrices this result is achieved by treating the transversality condition on the vector wavefunction as a nonholonomic quantum constraint we find that the quantum constraint makes it possible to generalize the stokes parameters to characterize the polarization of a general state unexpectedly the generalized stokes parameters are specified in a momentumspace local reference system that is fixed by another degree of freedom called stratton vector only constant stokes parameters in one particular local reference system can convey the intrinsic degree of freedom of the photon we show that the optical rotation is one of such processes that change the stratton vector with the intrinsic quantum number remaining fixed changing the stratton vector of the eigenstate of the helicity will give rise to a berrys phase
|
[['we', 'report', 'that', 'the', 'true', 'intrinsic', 'degree', 'of', 'freedom', 'of', 'the', 'photon', 'is', 'neither', 'the', 'polarization', 'nor', 'the', 'spin', 'it', 'describes', 'a', 'local', 'property', 'in', 'momentum', 'space', 'and', 'is', 'represented', 'in', 'the', 'local', 'representation', 'by', 'the', 'pauli', 'matrices', 'this', 'result', 'is', 'achieved', 'by', 'treating', 'the', 'transversality', 'condition', 'on', 'the', 'vector', 'wavefunction', 'as', 'a', 'nonholonomic', 'quantum', 'constraint', 'we', 'find', 'that', 'the', 'quantum', 'constraint', 'makes', 'it', 'possible', 'to', 'generalize', 'the', 'stokes', 'parameters', 'to', 'characterize', 'the', 'polarization', 'of', 'a', 'general', 'state', 'unexpectedly', 'the', 'generalized', 'stokes', 'parameters', 'are', 'specified', 'in', 'a', 'momentumspace', 'local', 'reference', 'system', 'that', 'is', 'fixed', 'by', 'another', 'degree', 'of', 'freedom', 'called', 'stratton', 'vector', 'only', 'constant', 'stokes', 'parameters', 'in', 'one', 'particular', 'local', 'reference', 'system', 'can', 'convey', 'the', 'intrinsic', 'degree', 'of', 'freedom', 'of', 'the', 'photon', 'we', 'show', 'that', 'the', 'optical', 'rotation', 'is', 'one', 'of', 'such', 'processes', 'that', 'change', 'the', 'stratton', 'vector', 'with', 'the', 'intrinsic', 'quantum', 'number', 'remaining', 'fixed', 'changing', 'the', 'stratton', 'vector', 'of', 'the', 'eigenstate', 'of', 'the', 'helicity', 'will', 'give', 'rise', 'to', 'a', 'berrys', 'phase']]
|
[-0.1947347326664093, 0.19907856945891256, -0.06621057136030292, 0.03569552292874842, -0.09374424686115006, -0.12607533518903324, 0.026254679398312244, 0.32699675887915086, -0.29128533064813156, -0.26968017454190113, 0.033215049338055615, -0.2240337677253985, -0.13061103358703816, 0.13627685214116894, -0.045239340548438055, 0.03967838903406152, 0.028659626525355343, 0.07699496030841989, -0.08684774399857198, -0.21979363870312585, 0.34580063954409623, 0.016040770213384136, 0.2607918078781186, 0.029130422376544663, 0.16751524462813028, 0.07049218078293366, 0.00043231437994558134, 0.013950985025457843, -0.07447525642976276, 0.08260708650643075, 0.18734770290910002, 0.11968812689380605, 0.20424461095409904, -0.3606720663446151, -0.2009736861881619, 0.11356196881927273, 0.0857698096215357, 0.1548374894902938, 0.01921181677967126, -0.24879137229427328, 0.05848302127345017, -0.11908906962775358, -0.1958240743332692, -0.09835930535983708, 0.013166326063650625, 0.007005708895761658, -0.2678511761887758, 0.0758954492846021, 0.09541500827303318, 0.049848272315697904, -0.03345437551400176, -0.08590128571786745, -0.07637152530505885, 0.09198843297422116, 0.017945406054445532, 0.06393826174561257, 0.11279239707603407, -0.1390721631742278, -0.09667044657751067, 0.38313483197334003, -0.06294169409177554, -0.26812661044374336, 0.11823333830883105, -0.1492336869418023, -0.0941101860414535, 0.11261360192337981, 0.12546462536915953, 0.08553629186303344, -0.11581193750586223, 0.09803416950442759, -0.0707332340563521, 0.18766877912904745, 0.0428261863575087, 0.09764902981430763, 0.2007565246470974, 0.06755383461886258, 0.09890834834242676, 0.13559925695018912, -0.08931307096672417, -0.10580336301117549, -0.34500368371789836, -0.18334527902972, -0.2318795568275231, 0.09589805940328162, -0.1100832088993263, -0.13953243036765928, 0.4341819672040457, 0.1258388221261011, 0.20868656616284292, -0.011625498143760602, 0.28492575523409025, 0.1590375630838946, 0.058806454350332514, 0.058476627674988575, 0.284992348253267, 0.1656759509652922, 0.0813790948337151, -0.25052585258482046, 0.07286810875657578, 0.05601860383341526]
|
1,803.06516
|
Presentation Proposal: Towards Efficient Data-flow Test Data Generation
Using KLEE
|
Dataflow coverage, one of the white-box testing criteria, focuses on the
relations between variable definitions and their uses.Several empirical studies
have proved data-flow testing is more effective than control-flow testing.
However, data-flow testing still cannot find its adoption in practice, due to
the lack of effective tool support. To this end, we propose a guided symbolic
execution approach to efficiently search for program paths to satisfy data-flow
coverage criteria. We implemented this approach on KLEE and evaluated with 30
program subjects which are constructed by the subjects used in previous
data-flow testing literature, SIR, SV-COMP benchmarks. Moreover, we are
planning to integrate the data-flow testing technique into the new proposed
symbolic execution engine, SmartUnit, which is a cloud-based unit testing
service for industrial software, supporting coverage-based testing. It has
successfully helped several well-known corporations and institutions in China
to adopt coverage-based testing in practice, totally tested more than one
million lines of real code from industry.
|
cs.SE
|
dataflow coverage one of the whitebox testing criteria focuses on the relations between variable definitions and their usesseveral empirical studies have proved dataflow testing is more effective than controlflow testing however dataflow testing still cannot find its adoption in practice due to the lack of effective tool support to this end we propose a guided symbolic execution approach to efficiently search for program paths to satisfy dataflow coverage criteria we implemented this approach on klee and evaluated with 30 program subjects which are constructed by the subjects used in previous dataflow testing literature sir svcomp benchmarks moreover we are planning to integrate the dataflow testing technique into the new proposed symbolic execution engine smartunit which is a cloudbased unit testing service for industrial software supporting coveragebased testing it has successfully helped several wellknown corporations and institutions in china to adopt coveragebased testing in practice totally tested more than one million lines of real code from industry
|
[['dataflow', 'coverage', 'one', 'of', 'the', 'whitebox', 'testing', 'criteria', 'focuses', 'on', 'the', 'relations', 'between', 'variable', 'definitions', 'and', 'their', 'usesseveral', 'empirical', 'studies', 'have', 'proved', 'dataflow', 'testing', 'is', 'more', 'effective', 'than', 'controlflow', 'testing', 'however', 'dataflow', 'testing', 'still', 'can', 'not', 'find', 'its', 'adoption', 'in', 'practice', 'due', 'to', 'the', 'lack', 'of', 'effective', 'tool', 'support', 'to', 'this', 'end', 'we', 'propose', 'a', 'guided', 'symbolic', 'execution', 'approach', 'to', 'efficiently', 'search', 'for', 'program', 'paths', 'to', 'satisfy', 'dataflow', 'coverage', 'criteria', 'we', 'implemented', 'this', 'approach', 'on', 'klee', 'and', 'evaluated', 'with', '30', 'program', 'subjects', 'which', 'are', 'constructed', 'by', 'the', 'subjects', 'used', 'in', 'previous', 'dataflow', 'testing', 'literature', 'sir', 'svcomp', 'benchmarks', 'moreover', 'we', 'are', 'planning', 'to', 'integrate', 'the', 'dataflow', 'testing', 'technique', 'into', 'the', 'new', 'proposed', 'symbolic', 'execution', 'engine', 'smartunit', 'which', 'is', 'a', 'cloudbased', 'unit', 'testing', 'service', 'for', 'industrial', 'software', 'supporting', 'coveragebased', 'testing', 'it', 'has', 'successfully', 'helped', 'several', 'wellknown', 'corporations', 'and', 'institutions', 'in', 'china', 'to', 'adopt', 'coveragebased', 'testing', 'in', 'practice', 'totally', 'tested', 'more', 'than', 'one', 'million', 'lines', 'of', 'real', 'code', 'from', 'industry']]
|
[-0.06429851543343364, -0.02079743156448389, -0.10415019477472807, 0.09144087405039523, -0.13580035711064015, -0.2045124347279899, 0.08313428511461005, 0.42287797135754657, -0.2117295756768913, -0.37102463913078493, 0.11757617721853492, -0.22461165875817338, -0.10812097509057285, 0.24145684452005065, -0.09432261735081482, 0.12404469119419212, 0.09880999607057908, -0.02806886004952666, -0.006918138991004059, -0.29439129890838206, 0.24334159289500326, 0.04914487059860944, 0.34020815895947193, 0.024822060969502974, 0.007621746979659805, 0.02363782340529351, -0.08379695792861569, 0.016202826969301663, -0.07490979284734632, 0.15613597695520207, 0.3666587313159536, 0.31018361870724803, 0.3339024511171887, -0.4304467199134449, -0.1573017553324835, 0.0812413609938887, 0.10904709910615705, 0.03375672060214222, -0.0032163473564977697, -0.3113081773611693, 0.11346470183418252, -0.2117851888328098, -0.03497410689492543, -0.1011989224942413, 0.005419203738804357, -0.0444750316218676, -0.26516405079000366, -0.0567864104258404, 0.04550367425261543, 0.12435104201685111, -0.008565275399283005, -0.09895756182213052, 0.027635779972068775, 0.14789024177484977, 0.05877972020206448, -0.0028547375009228024, 0.15778293350460723, -0.04806025570127158, -0.18859811124797815, 0.3855981924332296, 0.009837256243582278, -0.1609219373950066, 0.2375797753652128, -0.02081864768973528, -0.2022298357825583, 0.05651557527912351, 0.22107143245207575, 0.08946572142378546, -0.24332001914556783, 0.053109674149219736, 0.009061696697384693, 0.17760498120706195, 0.08158124758241077, -0.06543882099019054, 0.17630122827652556, 0.22381916833229554, 0.04075560987574789, 0.17412974712482163, -0.023588945160810955, -0.11489005352277906, -0.20893977076271908, -0.17014450468839362, -0.12896086051552677, -0.0412670927291448, -0.08283868622759026, -0.16840626931009003, 0.3652436391999706, 0.21115634818441975, 0.06176606408702449, 0.12585160379948762, 0.34122045001444906, 0.02982994949203343, 0.1619710883805032, 0.14602871317989552, 0.16985298893847264, 0.04148662147762922, 0.14474676531524613, -0.14282005250891253, 0.1283561304742948, 0.015431865603880933]
|
1,803.06517
|
Optimal Designs for the Generalized Partial Credit Model
|
Analyzing ordinal data becomes increasingly important in psychology,
especially in the context of item response theory. The generalized partial
credit model (GPCM) is probably the most widely used ordinal model and finds
application in many large scale educational assessment studies such as PISA. In
the present paper, optimal test designs are investigated for estimating
persons' abilities with the GPCM for calibrated tests when item parameters are
known from previous studies. We will derive that local optimality may be
achieved by assigning non-zero probability only to the first and last category
independently of a person's ability. That is, when using such a design, the
GPCM reduces to the dichotomous 2PL model. Since locally optimal designs
require the true ability to be known, we consider alternative Bayesian design
criteria using weight distributions over the ability parameter space. For
symmetric weight distributions, we derive necessary conditions for the optimal
one-point design of two response categories to be Bayes optimal. Furthermore,
we discuss examples of common symmetric weight distributions and investigate,
in which cases the necessary conditions are also sufficient. Since the 2PL
model is a special case of the GPCM, all of these results hold for the 2PL
model as well.
|
math.ST stat.ME stat.TH
|
analyzing ordinal data becomes increasingly important in psychology especially in the context of item response theory the generalized partial credit model gpcm is probably the most widely used ordinal model and finds application in many large scale educational assessment studies such as pisa in the present paper optimal test designs are investigated for estimating persons abilities with the gpcm for calibrated tests when item parameters are known from previous studies we will derive that local optimality may be achieved by assigning nonzero probability only to the first and last category independently of a persons ability that is when using such a design the gpcm reduces to the dichotomous 2pl model since locally optimal designs require the true ability to be known we consider alternative bayesian design criteria using weight distributions over the ability parameter space for symmetric weight distributions we derive necessary conditions for the optimal onepoint design of two response categories to be bayes optimal furthermore we discuss examples of common symmetric weight distributions and investigate in which cases the necessary conditions are also sufficient since the 2pl model is a special case of the gpcm all of these results hold for the 2pl model as well
|
[['analyzing', 'ordinal', 'data', 'becomes', 'increasingly', 'important', 'in', 'psychology', 'especially', 'in', 'the', 'context', 'of', 'item', 'response', 'theory', 'the', 'generalized', 'partial', 'credit', 'model', 'gpcm', 'is', 'probably', 'the', 'most', 'widely', 'used', 'ordinal', 'model', 'and', 'finds', 'application', 'in', 'many', 'large', 'scale', 'educational', 'assessment', 'studies', 'such', 'as', 'pisa', 'in', 'the', 'present', 'paper', 'optimal', 'test', 'designs', 'are', 'investigated', 'for', 'estimating', 'persons', 'abilities', 'with', 'the', 'gpcm', 'for', 'calibrated', 'tests', 'when', 'item', 'parameters', 'are', 'known', 'from', 'previous', 'studies', 'we', 'will', 'derive', 'that', 'local', 'optimality', 'may', 'be', 'achieved', 'by', 'assigning', 'nonzero', 'probability', 'only', 'to', 'the', 'first', 'and', 'last', 'category', 'independently', 'of', 'a', 'persons', 'ability', 'that', 'is', 'when', 'using', 'such', 'a', 'design', 'the', 'gpcm', 'reduces', 'to', 'the', 'dichotomous', '2pl', 'model', 'since', 'locally', 'optimal', 'designs', 'require', 'the', 'true', 'ability', 'to', 'be', 'known', 'we', 'consider', 'alternative', 'bayesian', 'design', 'criteria', 'using', 'weight', 'distributions', 'over', 'the', 'ability', 'parameter', 'space', 'for', 'symmetric', 'weight', 'distributions', 'we', 'derive', 'necessary', 'conditions', 'for', 'the', 'optimal', 'onepoint', 'design', 'of', 'two', 'response', 'categories', 'to', 'be', 'bayes', 'optimal', 'furthermore', 'we', 'discuss', 'examples', 'of', 'common', 'symmetric', 'weight', 'distributions', 'and', 'investigate', 'in', 'which', 'cases', 'the', 'necessary', 'conditions', 'are', 'also', 'sufficient', 'since', 'the', '2pl', 'model', 'is', 'a', 'special', 'case', 'of', 'the', 'gpcm', 'all', 'of', 'these', 'results', 'hold', 'for', 'the', '2pl', 'model', 'as', 'well']]
|
[-0.03750066705062195, 0.0598625883511785, -0.04919107604038083, 0.1274574643060932, -0.10650453571291321, -0.18081054128494792, 0.036220160927952764, 0.39777920414891205, -0.23461986835305157, -0.29135764294746097, 0.14582497499621683, -0.22493856431413065, -0.18243589683087788, 0.18768450844388532, -0.10595022600539254, 0.08708201386528372, 0.041698863471721796, 0.060323501920628575, -0.034385300525981516, -0.28372219611415544, 0.3197881900411419, 0.07066792152020046, 0.31499169040659464, 0.0032099266371906103, 0.08227666761347498, 0.03258658260473925, -0.03574979642871767, 0.026415479408771918, -0.1450053931874925, 0.09951234284101637, 0.3183140915564515, 0.17622622516890518, 0.31473668482486217, -0.3814671771786637, -0.19589027598255662, 0.14417951736208803, 0.09158492876142393, 0.08850487552975972, -0.013545714755015767, -0.23981455344156447, 0.0944349310399654, -0.1864011235478701, -0.11072770225350402, -0.09657470884731727, 0.012998789745251262, 0.03976961392721142, -0.34916705842308626, 0.052593843259870994, 0.03262004689983741, 0.032755078283383164, -0.09067589088079679, -0.16500072697685522, 0.006614222319448611, 0.1488532353632947, 0.0445619691398484, -0.028454885199534322, 0.09197432988539639, -0.13737401412799954, -0.12069932236853573, 0.37894360593172033, -0.01540363149516369, -0.22625084344245908, 0.16078521677138838, -0.10452246977100996, -0.1462564006620651, 0.050565977948317964, 0.17310109132232915, 0.11314726972745524, -0.16845054305179133, 0.060869950802604, -0.061392443776695116, 0.13473994683620116, 0.047884625191635666, 0.01641852333859512, 0.15433703398336704, 0.15648099314186234, 0.06187580547423685, 0.14579255076659128, -0.06808562721878365, -0.10393815887198228, -0.290280827457518, -0.13121906811644257, -0.1445767893943926, 0.008401313189868673, -0.08447445514827974, -0.14840183929408515, 0.3753528799367786, 0.1879846628072126, 0.1657316971480884, 0.0780190547353193, 0.2607562105463009, 0.09082953118768548, 0.04520735355028151, 0.05646413658637403, 0.19954209102184225, 0.09027045815265879, 0.02926290092808712, -0.13342413759785657, 0.14018035587966984, 0.030800922751436106]
|
1,803.06518
|
Provable Convex Co-clustering of Tensors
|
Cluster analysis is a fundamental tool for pattern discovery of complex
heterogeneous data. Prevalent clustering methods mainly focus on vector or
matrix-variate data and are not applicable to general-order tensors, which
arise frequently in modern scientific and business applications. Moreover,
there is a gap between statistical guarantees and computational efficiency for
existing tensor clustering solutions due to the nature of their non-convex
formulations. In this work, we bridge this gap by developing a provable convex
formulation of tensor co-clustering. Our convex co-clustering (CoCo) estimator
enjoys stability guarantees and its computational and storage costs are
polynomial in the size of the data. We further establish a non-asymptotic error
bound for the CoCo estimator, which reveals a surprising "blessing of
dimensionality" phenomenon that does not exist in vector or matrix-variate
cluster analysis. Our theoretical findings are supported by extensive simulated
studies. Finally, we apply the CoCo estimator to the cluster analysis of
advertisement click tensor data from a major online company. Our clustering
results provide meaningful business insights to improve advertising
effectiveness.
|
stat.ME stat.AP stat.CO stat.ML
|
cluster analysis is a fundamental tool for pattern discovery of complex heterogeneous data prevalent clustering methods mainly focus on vector or matrixvariate data and are not applicable to generalorder tensors which arise frequently in modern scientific and business applications moreover there is a gap between statistical guarantees and computational efficiency for existing tensor clustering solutions due to the nature of their nonconvex formulations in this work we bridge this gap by developing a provable convex formulation of tensor coclustering our convex coclustering coco estimator enjoys stability guarantees and its computational and storage costs are polynomial in the size of the data we further establish a nonasymptotic error bound for the coco estimator which reveals a surprising blessing of dimensionality phenomenon that does not exist in vector or matrixvariate cluster analysis our theoretical findings are supported by extensive simulated studies finally we apply the coco estimator to the cluster analysis of advertisement click tensor data from a major online company our clustering results provide meaningful business insights to improve advertising effectiveness
|
[['cluster', 'analysis', 'is', 'a', 'fundamental', 'tool', 'for', 'pattern', 'discovery', 'of', 'complex', 'heterogeneous', 'data', 'prevalent', 'clustering', 'methods', 'mainly', 'focus', 'on', 'vector', 'or', 'matrixvariate', 'data', 'and', 'are', 'not', 'applicable', 'to', 'generalorder', 'tensors', 'which', 'arise', 'frequently', 'in', 'modern', 'scientific', 'and', 'business', 'applications', 'moreover', 'there', 'is', 'a', 'gap', 'between', 'statistical', 'guarantees', 'and', 'computational', 'efficiency', 'for', 'existing', 'tensor', 'clustering', 'solutions', 'due', 'to', 'the', 'nature', 'of', 'their', 'nonconvex', 'formulations', 'in', 'this', 'work', 'we', 'bridge', 'this', 'gap', 'by', 'developing', 'a', 'provable', 'convex', 'formulation', 'of', 'tensor', 'coclustering', 'our', 'convex', 'coclustering', 'coco', 'estimator', 'enjoys', 'stability', 'guarantees', 'and', 'its', 'computational', 'and', 'storage', 'costs', 'are', 'polynomial', 'in', 'the', 'size', 'of', 'the', 'data', 'we', 'further', 'establish', 'a', 'nonasymptotic', 'error', 'bound', 'for', 'the', 'coco', 'estimator', 'which', 'reveals', 'a', 'surprising', 'blessing', 'of', 'dimensionality', 'phenomenon', 'that', 'does', 'not', 'exist', 'in', 'vector', 'or', 'matrixvariate', 'cluster', 'analysis', 'our', 'theoretical', 'findings', 'are', 'supported', 'by', 'extensive', 'simulated', 'studies', 'finally', 'we', 'apply', 'the', 'coco', 'estimator', 'to', 'the', 'cluster', 'analysis', 'of', 'advertisement', 'click', 'tensor', 'data', 'from', 'a', 'major', 'online', 'company', 'our', 'clustering', 'results', 'provide', 'meaningful', 'business', 'insights', 'to', 'improve', 'advertising', 'effectiveness']]
|
[-0.07902371923384421, -0.016257350843892817, -0.10714099858339657, 0.10280490128652138, -0.14687693565262153, -0.1404625690131284, 0.08849245394436259, 0.3953518942436751, -0.27343009364352944, -0.3155752282315756, 0.13572319477029582, -0.28063019719796584, -0.19406639084302107, 0.18899637982934056, -0.10852565844680237, 0.07995823605828371, 0.12752680096446592, -0.011347858063184986, -0.05896325335317456, -0.3028708121903679, 0.2839530810261803, 0.04789013084082398, 0.3644982378340929, 0.08368263456230873, 0.04178043807606788, -0.0032241508775555034, -0.08576014635481817, 0.020362828430884026, -0.1193417207490711, 0.19135198876919116, 0.3348558201728498, 0.227972656003583, 0.3488881678046549, -0.39043818336966285, -0.16625125897390877, 0.10329864700872671, 0.14038437119315322, 0.0628285342704176, -0.09209071251851342, -0.288913973690668, 0.09743661780239028, -0.15774270310477517, -0.05457835371660836, -0.14737385167767678, -0.029338813878541044, -1.1413424919523737e-05, -0.28680714180638245, 0.11381680424434736, 0.0856385495267151, 0.0574601652484168, -0.057481040605617796, -0.1545516836717177, 0.04309572688550414, 0.0827728871947757, 0.09522740974584047, -0.0036483307547100327, 0.12725124071910293, -0.12058194551397772, -0.14657973186934695, 0.36630683095906585, -0.008979553765247521, -0.2002657032930395, 0.20500693608020595, -0.06365131867830368, -0.1934594452381134, 0.08237185927299673, 0.23908188348526463, 0.07837872624205534, -0.13892526940223487, 0.09063892271061537, -0.04889493071857621, 0.1716790137346834, 0.0026771115769139106, 0.010453010980478104, 0.1321438086219132, 0.2182802907355568, 0.10414155208889175, 0.135417587299119, -0.04739091445226222, -0.12308756089495386, -0.23842236494974178, -0.13302030132104203, -0.23399199502652182, -0.019381066282135984, -0.15885981178306632, -0.1790055692415027, 0.3586250905002303, 0.1595296262023861, 0.1470671690055443, 0.08825359224095283, 0.33457109207177865, 0.04425610474735389, 0.04704581026727443, 0.10912880613194668, 0.21398130291525055, 0.10180797252310987, 0.10686652391655918, -0.17485067283645656, 0.09789676168207627, 0.01425035659716848]
|
1,803.06519
|
Signal detection via Phi-divergences for general mixtures
|
In this paper we are interested in testing whether there are any signals
hidden in high dimensional noise data. Therefore we study the family of
goodness-of-fit tests based on $\Phi$-divergences including the test of Berk
and Jones as well as Tukey's higher criticism test. The optimality of this
family is already known for the heterogeneous normal mixture model. We now
present a technique to transfer this optimality to more general models. For
illustration we apply our results to dense signal and sparse signal models
including the exponential-$\chi^2$ mixture model and general exponential
families as the normal, exponential and Gumbel distribution. Beside the
optimality of the whole family we discuss the power behavior on the detection
boundary and show that the whole family has no power there, whereas the
likelihood ratio test does.
|
math.ST stat.TH
|
in this paper we are interested in testing whether there are any signals hidden in high dimensional noise data therefore we study the family of goodnessoffit tests based on phidivergences including the test of berk and jones as well as tukeys higher criticism test the optimality of this family is already known for the heterogeneous normal mixture model we now present a technique to transfer this optimality to more general models for illustration we apply our results to dense signal and sparse signal models including the exponentialchi2 mixture model and general exponential families as the normal exponential and gumbel distribution beside the optimality of the whole family we discuss the power behavior on the detection boundary and show that the whole family has no power there whereas the likelihood ratio test does
|
[['in', 'this', 'paper', 'we', 'are', 'interested', 'in', 'testing', 'whether', 'there', 'are', 'any', 'signals', 'hidden', 'in', 'high', 'dimensional', 'noise', 'data', 'therefore', 'we', 'study', 'the', 'family', 'of', 'goodnessoffit', 'tests', 'based', 'on', 'phidivergences', 'including', 'the', 'test', 'of', 'berk', 'and', 'jones', 'as', 'well', 'as', 'tukeys', 'higher', 'criticism', 'test', 'the', 'optimality', 'of', 'this', 'family', 'is', 'already', 'known', 'for', 'the', 'heterogeneous', 'normal', 'mixture', 'model', 'we', 'now', 'present', 'a', 'technique', 'to', 'transfer', 'this', 'optimality', 'to', 'more', 'general', 'models', 'for', 'illustration', 'we', 'apply', 'our', 'results', 'to', 'dense', 'signal', 'and', 'sparse', 'signal', 'models', 'including', 'the', 'exponentialchi2', 'mixture', 'model', 'and', 'general', 'exponential', 'families', 'as', 'the', 'normal', 'exponential', 'and', 'gumbel', 'distribution', 'beside', 'the', 'optimality', 'of', 'the', 'whole', 'family', 'we', 'discuss', 'the', 'power', 'behavior', 'on', 'the', 'detection', 'boundary', 'and', 'show', 'that', 'the', 'whole', 'family', 'has', 'no', 'power', 'there', 'whereas', 'the', 'likelihood', 'ratio', 'test', 'does']]
|
[-0.049976027287180244, 0.03778685699394755, -0.0809232074205714, 0.10296586602179775, -0.06397908949470929, -0.13597436442985447, 0.04521910531023332, 0.3612418124409577, -0.22094093761220496, -0.3023314664659325, 0.1516944465648653, -0.24401538155062963, -0.16881020317024742, 0.19151721122312068, -0.07840051949255254, 0.09389550762805547, 0.018061216813974254, 0.03696380653738521, -0.06756830155557975, -0.2400886764383754, 0.31662883693067967, 0.0642223994101874, 0.32862852589149055, -0.0025017073534372197, 0.0761596418975831, -0.00354331859764252, -0.015640277714105963, -0.00422512553987726, -0.1306508037722994, 0.0871613354720744, 0.23312443755248266, 0.1847959283820086, 0.26529777928731824, -0.3548871334926545, -0.22345297333592448, 0.18420696915536125, 0.11213775264909705, 0.07701182970066221, -0.06468279763955342, -0.24264861792610345, 0.07670715737746645, -0.16760513589198467, -0.12429559209476446, -0.09875986174118655, -0.02214289247236065, 0.03585105574910195, -0.31382318474494547, 0.10786691938974817, 0.11516971856387659, 0.052591698805851336, -0.03151130708972461, -0.14049067558055986, 0.031123653381266665, 0.07689190567613273, 0.06220845328217358, -0.040636750018110374, 0.0616395462980629, -0.12864385294188782, -0.10240428429096937, 0.3551770320770025, -0.08388981770747163, -0.21204684484920655, 0.22707784258518796, -0.1372369864674726, -0.17752375034970863, 0.05963268940770672, 0.21793598414377402, 0.11659821674213496, -0.15751527751376496, 0.06658230785534625, -0.07325533892557679, 0.1463393774310141, 0.0636313471601892, -0.020587246077675515, 0.15249570057094666, 0.1636707977256702, 0.04664551304255164, 0.18414798027921098, -0.1116744535104265, -0.10779756257836601, -0.31439778459825346, -0.16223621626476978, -0.18478546218985678, 0.005277487733721278, -0.10150979515038455, -0.19173757501572142, 0.41497877909880104, 0.1690075982354034, 0.18571418961190142, 0.11971636956827786, 0.28686759972461423, 0.10708932236782524, 0.02097613882728433, 0.08595970635093972, 0.21519340621662958, 0.10405255534743023, 0.03770919433503433, -0.13651304966805658, 0.0978739777813623, 0.008616607593557308]
|
1,803.0652
|
Analysis of Triplet Motifs in Biological Signed Oriented Graphs Suggests
a Relationship Between Fine Topology and Function
|
Background: Networks in different domains are characterized by similar global
characteristics while differing in local structures. To further extend this
concept, we investigated network regularities on a fine scale in order to
examine the functional impact of recurring motifs in signed oriented biological
networks. In this work we generalize to signaling net works some considerations
made on feedback and feed forward loops and extend them by adding a close
scrutiny of Linear Triplets, which have not yet been investigate in detail.
Results: We studied the role of triplets, either open or closed (Loops or
linear events) by enumerating them in different biological signaling networks
and by comparing their significance profiles. We compared different data
sources and investigated the fine topology of protein networks representing
causal relationships based on transcriptional control, phosphorylation,
ubiquitination and binding. Not only were we able to generalize findings that
have already been reported but we also highlighted a connection between
relative motif abundance and node function. Furthermore, by analyzing for the
first time Linear Triplets, we highlighted the relative importance of nodes
sitting in specific positions in closed signaling triplets. Finally, we tried
to apply machine learning to show that a combination of motifs features can be
used to derive node function. Availability: The triplets counter used for this
work is available as a Cytoscape App and as a standalone command line Java
application. http://apps.cytoscape.org/apps/counttriplets Keywords: Graph
theory, graph analysis, graph topology, machine learning, cytoscape
|
q-bio.MN cs.LG
|
background networks in different domains are characterized by similar global characteristics while differing in local structures to further extend this concept we investigated network regularities on a fine scale in order to examine the functional impact of recurring motifs in signed oriented biological networks in this work we generalize to signaling net works some considerations made on feedback and feed forward loops and extend them by adding a close scrutiny of linear triplets which have not yet been investigate in detail results we studied the role of triplets either open or closed loops or linear events by enumerating them in different biological signaling networks and by comparing their significance profiles we compared different data sources and investigated the fine topology of protein networks representing causal relationships based on transcriptional control phosphorylation ubiquitination and binding not only were we able to generalize findings that have already been reported but we also highlighted a connection between relative motif abundance and node function furthermore by analyzing for the first time linear triplets we highlighted the relative importance of nodes sitting in specific positions in closed signaling triplets finally we tried to apply machine learning to show that a combination of motifs features can be used to derive node function availability the triplets counter used for this work is available as a cytoscape app and as a standalone command line java application httpappscytoscapeorgappscounttriplets keywords graph theory graph analysis graph topology machine learning cytoscape
|
[['background', 'networks', 'in', 'different', 'domains', 'are', 'characterized', 'by', 'similar', 'global', 'characteristics', 'while', 'differing', 'in', 'local', 'structures', 'to', 'further', 'extend', 'this', 'concept', 'we', 'investigated', 'network', 'regularities', 'on', 'a', 'fine', 'scale', 'in', 'order', 'to', 'examine', 'the', 'functional', 'impact', 'of', 'recurring', 'motifs', 'in', 'signed', 'oriented', 'biological', 'networks', 'in', 'this', 'work', 'we', 'generalize', 'to', 'signaling', 'net', 'works', 'some', 'considerations', 'made', 'on', 'feedback', 'and', 'feed', 'forward', 'loops', 'and', 'extend', 'them', 'by', 'adding', 'a', 'close', 'scrutiny', 'of', 'linear', 'triplets', 'which', 'have', 'not', 'yet', 'been', 'investigate', 'in', 'detail', 'results', 'we', 'studied', 'the', 'role', 'of', 'triplets', 'either', 'open', 'or', 'closed', 'loops', 'or', 'linear', 'events', 'by', 'enumerating', 'them', 'in', 'different', 'biological', 'signaling', 'networks', 'and', 'by', 'comparing', 'their', 'significance', 'profiles', 'we', 'compared', 'different', 'data', 'sources', 'and', 'investigated', 'the', 'fine', 'topology', 'of', 'protein', 'networks', 'representing', 'causal', 'relationships', 'based', 'on', 'transcriptional', 'control', 'phosphorylation', 'ubiquitination', 'and', 'binding', 'not', 'only', 'were', 'we', 'able', 'to', 'generalize', 'findings', 'that', 'have', 'already', 'been', 'reported', 'but', 'we', 'also', 'highlighted', 'a', 'connection', 'between', 'relative', 'motif', 'abundance', 'and', 'node', 'function', 'furthermore', 'by', 'analyzing', 'for', 'the', 'first', 'time', 'linear', 'triplets', 'we', 'highlighted', 'the', 'relative', 'importance', 'of', 'nodes', 'sitting', 'in', 'specific', 'positions', 'in', 'closed', 'signaling', 'triplets', 'finally', 'we', 'tried', 'to', 'apply', 'machine', 'learning', 'to', 'show', 'that', 'a', 'combination', 'of', 'motifs', 'features', 'can', 'be', 'used', 'to', 'derive', 'node', 'function', 'availability', 'the', 'triplets', 'counter', 'used', 'for', 'this', 'work', 'is', 'available', 'as', 'a', 'cytoscape', 'app', 'and', 'as', 'a', 'standalone', 'command', 'line', 'java', 'application', 'httpappscytoscapeorgappscounttriplets', 'keywords', 'graph', 'theory', 'graph', 'analysis', 'graph', 'topology', 'machine', 'learning', 'cytoscape']]
|
[-0.11272818525739305, 0.06223080652070385, -0.025220332851924224, 0.1195473419185551, -0.10276414522015045, -0.1593342706853846, 0.08473120851919054, 0.4396401049828605, -0.25049019531339, -0.313908394323937, 0.06798794079829353, -0.2703163814298683, -0.20274895774485457, 0.14465760167212646, -0.060552157482273786, 0.038552658038532146, 0.05810803693978564, 0.050121049218877896, -0.0051647241636010414, -0.22889793585022647, 0.3175887982793278, 0.06643474665725847, 0.2894760944059252, 0.04958105146077379, 0.0720292614062635, -0.022788544761150574, -0.07102518232012725, 0.06786750285505054, -0.12605144452080888, 0.14282281251962176, 0.29660586731799166, 0.16019337802259268, 0.2529864599692482, -0.4721577070449098, -0.243526730336689, 0.11615779564248296, 0.1530768905161145, 0.10406461678187949, -0.043463844094201454, -0.2781578829268363, 0.11507631347265157, -0.1439610471406692, -0.07951154538630685, -0.10134438719582756, 0.007712005541310155, 0.054858052932004554, -0.19925565161066375, 0.011110193342562835, 0.046048300841615444, 0.10331075926771081, -0.04194702290662639, -0.10253961901730595, -0.02958046787375199, 0.16243848742186268, 0.025364734962354668, 0.001075520237145419, 0.14860929871363102, -0.1131287410389632, -0.18223635805868996, 0.3180943196442937, -0.036258208191853394, -0.20955881296007653, 0.20332912513730803, -0.06628670964393969, -0.21173222389225435, 0.07167327261180126, 0.20650725659053726, 0.09364427012717548, -0.1857107135522246, 0.027207940665834075, -0.010250361396573515, 0.1798230231015546, 0.1125816075889716, 0.0010867779249254662, 0.16908867116958562, 0.16324218098400356, 0.01983564242304063, 0.15186068558729476, -0.06586747275977808, -0.09931848232952666, -0.22430060906232557, -0.10691693674906586, -0.14347585399128213, 0.011438384561387838, -0.06170391144565226, -0.1354125313564471, 0.4160529879444448, 0.1287707669458687, 0.2309790856130264, 0.048905075338122904, 0.25906890930159937, 0.03288984906914711, 0.11751887466825293, 0.0645831990043951, 0.18736334289937429, 0.11244423691584152, 0.10725120400895959, -0.1708711961751906, 0.10161755819812826, 0.035746637778946114]
|
1,803.06521
|
Beyond the Low-Degree Algorithm: Mixtures of Subcubes and Their
Applications
|
We introduce the problem of learning mixtures of $k$ subcubes over
$\{0,1\}^n$, which contains many classic learning theory problems as a special
case (and is itself a special case of others). We give a surprising $n^{O(\log
k)}$-time learning algorithm based on higher-order multilinear moments. It is
not possible to learn the parameters because the same distribution can be
represented by quite different models. Instead, we develop a framework for
reasoning about how multilinear moments can pinpoint essential features of the
mixture, like the number of components.
We also give applications of our algorithm to learning decision trees with
stochastic transitions (which also capture interesting scenarios where the
transitions are deterministic but there are latent variables). Using our
algorithm for learning mixtures of subcubes, we can approximate the Bayes
optimal classifier within additive error $\epsilon$ on $k$-leaf decision trees
with at most $s$ stochastic transitions on any root-to-leaf path in $n^{O(s +
\log k)}\cdot\text{poly}(1/\epsilon)$ time. In this stochastic setting, the
classic Occam algorithms for learning decision trees with zero stochastic
transitions break down, while the low-degree algorithm of Linial et al.
inherently has a quasipolynomial dependence on $1/\epsilon$.
In contrast, as we will show, mixtures of $k$ subcubes are uniquely
determined by their degree $2 \log k$ moments and hence provide a useful
abstraction for simultaneously achieving the polynomial dependence on
$1/\epsilon$ of the classic Occam algorithms for decision trees and the
flexibility of the low-degree algorithm in being able to accommodate stochastic
transitions. Using our multilinear moment techniques, we also give the first
improved upper and lower bounds since the work of Feldman et al. for the
related but harder problem of learning mixtures of binary product
distributions.
|
cs.LG cs.CC cs.DS stat.ML
|
we introduce the problem of learning mixtures of k subcubes over 01n which contains many classic learning theory problems as a special case and is itself a special case of others we give a surprising nolog ktime learning algorithm based on higherorder multilinear moments it is not possible to learn the parameters because the same distribution can be represented by quite different models instead we develop a framework for reasoning about how multilinear moments can pinpoint essential features of the mixture like the number of components we also give applications of our algorithm to learning decision trees with stochastic transitions which also capture interesting scenarios where the transitions are deterministic but there are latent variables using our algorithm for learning mixtures of subcubes we can approximate the bayes optimal classifier within additive error epsilon on kleaf decision trees with at most s stochastic transitions on any roottoleaf path in nos log kcdottextpoly1epsilon time in this stochastic setting the classic occam algorithms for learning decision trees with zero stochastic transitions break down while the lowdegree algorithm of linial et al inherently has a quasipolynomial dependence on 1epsilon in contrast as we will show mixtures of k subcubes are uniquely determined by their degree 2 log k moments and hence provide a useful abstraction for simultaneously achieving the polynomial dependence on 1epsilon of the classic occam algorithms for decision trees and the flexibility of the lowdegree algorithm in being able to accommodate stochastic transitions using our multilinear moment techniques we also give the first improved upper and lower bounds since the work of feldman et al for the related but harder problem of learning mixtures of binary product distributions
|
[['we', 'introduce', 'the', 'problem', 'of', 'learning', 'mixtures', 'of', 'k', 'subcubes', 'over', '01n', 'which', 'contains', 'many', 'classic', 'learning', 'theory', 'problems', 'as', 'a', 'special', 'case', 'and', 'is', 'itself', 'a', 'special', 'case', 'of', 'others', 'we', 'give', 'a', 'surprising', 'nolog', 'ktime', 'learning', 'algorithm', 'based', 'on', 'higherorder', 'multilinear', 'moments', 'it', 'is', 'not', 'possible', 'to', 'learn', 'the', 'parameters', 'because', 'the', 'same', 'distribution', 'can', 'be', 'represented', 'by', 'quite', 'different', 'models', 'instead', 'we', 'develop', 'a', 'framework', 'for', 'reasoning', 'about', 'how', 'multilinear', 'moments', 'can', 'pinpoint', 'essential', 'features', 'of', 'the', 'mixture', 'like', 'the', 'number', 'of', 'components', 'we', 'also', 'give', 'applications', 'of', 'our', 'algorithm', 'to', 'learning', 'decision', 'trees', 'with', 'stochastic', 'transitions', 'which', 'also', 'capture', 'interesting', 'scenarios', 'where', 'the', 'transitions', 'are', 'deterministic', 'but', 'there', 'are', 'latent', 'variables', 'using', 'our', 'algorithm', 'for', 'learning', 'mixtures', 'of', 'subcubes', 'we', 'can', 'approximate', 'the', 'bayes', 'optimal', 'classifier', 'within', 'additive', 'error', 'epsilon', 'on', 'kleaf', 'decision', 'trees', 'with', 'at', 'most', 's', 'stochastic', 'transitions', 'on', 'any', 'roottoleaf', 'path', 'in', 'nos', 'log', 'kcdottextpoly1epsilon', 'time', 'in', 'this', 'stochastic', 'setting', 'the', 'classic', 'occam', 'algorithms', 'for', 'learning', 'decision', 'trees', 'with', 'zero', 'stochastic', 'transitions', 'break', 'down', 'while', 'the', 'lowdegree', 'algorithm', 'of', 'linial', 'et', 'al', 'inherently', 'has', 'a', 'quasipolynomial', 'dependence', 'on', '1epsilon', 'in', 'contrast', 'as', 'we', 'will', 'show', 'mixtures', 'of', 'k', 'subcubes', 'are', 'uniquely', 'determined', 'by', 'their', 'degree', '2', 'log', 'k', 'moments', 'and', 'hence', 'provide', 'a', 'useful', 'abstraction', 'for', 'simultaneously', 'achieving', 'the', 'polynomial', 'dependence', 'on', '1epsilon', 'of', 'the', 'classic', 'occam', 'algorithms', 'for', 'decision', 'trees', 'and', 'the', 'flexibility', 'of', 'the', 'lowdegree', 'algorithm', 'in', 'being', 'able', 'to', 'accommodate', 'stochastic', 'transitions', 'using', 'our', 'multilinear', 'moment', 'techniques', 'we', 'also', 'give', 'the', 'first', 'improved', 'upper', 'and', 'lower', 'bounds', 'since', 'the', 'work', 'of', 'feldman', 'et', 'al', 'for', 'the', 'related', 'but', 'harder', 'problem', 'of', 'learning', 'mixtures', 'of', 'binary', 'product', 'distributions']]
|
[-0.06897672271525318, 0.0830974976699376, -0.07509930134750903, 0.0838956459294158, -0.09889625638892705, -0.16881053343415262, 0.09965238265248692, 0.37685209374197504, -0.2915477536622943, -0.33368738428943534, 0.07646029421424662, -0.2394114071554081, -0.17746096070855855, 0.1757663234511115, -0.07977465566163036, 0.07574898811268874, 0.028720532232810826, 0.04731656643233939, -0.053494977932000025, -0.3102136274334043, 0.2877604578909549, 0.04966684522572905, 0.22055718198968943, 0.0019020809504118833, 0.10879876726899634, 0.029356987892904064, -0.007457327940077944, 0.020060812835158273, -0.13344062957002528, 0.12160991234260357, 0.32523178585441204, 0.1954799982922321, 0.27882661856033586, -0.37217351046158, -0.17942508217836306, 0.15767674098553305, 0.14513114617237907, 0.0877722400164401, 0.019074466754682363, -0.2567410809957338, 0.05843696712008254, -0.10824479418177031, -0.049036419597793035, -0.12978128057311883, 0.017606929056346417, 0.034635475565552375, -0.31580249089239676, 0.04558974849282425, 0.13545467783252454, 0.03758788894428025, -0.005144357473843477, -0.1952721606880765, 0.05521831440062008, 0.08517266247590835, -0.007739100300452926, 0.03478362473489886, 0.09124336741081523, -0.09636929337072864, -0.18991935611279173, 0.34683707155964594, -0.048536506911570375, -0.17951667766880497, 0.17390346799638462, -0.07393404238561, -0.20473676475950262, 0.12958750028332525, 0.21374050630849192, 0.16292972635223785, -0.10447238937358964, 0.10621579940600151, -0.07232205672020262, 0.15248521278739313, 0.09613792856393212, 0.0015415948680178686, 0.12915599758220858, 0.15399912183426998, 0.09091292703394588, 0.1483481013897637, -0.04509964234661311, -0.10177611655365168, -0.24562967667864127, -0.11280652977356856, -0.18552372688935562, -0.0010014575372174891, -0.15266823667609555, -0.18071610356961504, 0.3369674963267012, 0.15876153535886922, 0.21525264373260805, 0.14627446352144366, 0.27490634150295096, 0.11630161600568416, 0.017694194051860408, 0.14431706552986395, 0.1569386632761664, 0.1299885212443769, 0.06675467982845888, -0.17620514394673095, 0.15600659912113438, 0.08684357339685614]
|
1,803.06522
|
Fragment Distribution in Reactions of $^{78,86}$Kr+$^{181}$Ta
|
Within the framework of the isospin-dependent quantum molecular dynamics
model along with the GEMINI model, the reaction of $^{86}$Kr+$^{181}$Ta at
80,120 and 160 MeV/nucleon and the reaction of $^{78}$Kr+$^{181}$Ta at 160
MeV/nucleon are studied, and the production cross sections of the generated
fragments are calculated. More intermediate and large mass fragments can be
produced in the reaction with a large range of impact parameter. The production
cross sections of nuclei such as the isotopes of Si and P generally decrease
with the increasing incident energy. The isotopes near the neutron drip line
are produced more in the neutron-rich system $^{86}$Kr+$^{181}$Ta.
|
nucl-th
|
within the framework of the isospindependent quantum molecular dynamics model along with the gemini model the reaction of 86kr181ta at 80120 and 160 mevnucleon and the reaction of 78kr181ta at 160 mevnucleon are studied and the production cross sections of the generated fragments are calculated more intermediate and large mass fragments can be produced in the reaction with a large range of impact parameter the production cross sections of nuclei such as the isotopes of si and p generally decrease with the increasing incident energy the isotopes near the neutron drip line are produced more in the neutronrich system 86kr181ta
|
[['within', 'the', 'framework', 'of', 'the', 'isospindependent', 'quantum', 'molecular', 'dynamics', 'model', 'along', 'with', 'the', 'gemini', 'model', 'the', 'reaction', 'of', '86kr181ta', 'at', '80120', 'and', '160', 'mevnucleon', 'and', 'the', 'reaction', 'of', '78kr181ta', 'at', '160', 'mevnucleon', 'are', 'studied', 'and', 'the', 'production', 'cross', 'sections', 'of', 'the', 'generated', 'fragments', 'are', 'calculated', 'more', 'intermediate', 'and', 'large', 'mass', 'fragments', 'can', 'be', 'produced', 'in', 'the', 'reaction', 'with', 'a', 'large', 'range', 'of', 'impact', 'parameter', 'the', 'production', 'cross', 'sections', 'of', 'nuclei', 'such', 'as', 'the', 'isotopes', 'of', 'si', 'and', 'p', 'generally', 'decrease', 'with', 'the', 'increasing', 'incident', 'energy', 'the', 'isotopes', 'near', 'the', 'neutron', 'drip', 'line', 'are', 'produced', 'more', 'in', 'the', 'neutronrich', 'system', '86kr181ta']]
|
[-0.030819596182650972, 0.22163450852343716, -0.03839558491947792, 0.07432437469203447, 0.0831068198090976, -0.08476226429752622, 0.0022469486863611592, 0.3547931553546301, -0.22908024615896194, -0.3301648605499685, -0.05637455209561614, -0.372328195538487, 0.04701702099907951, 0.1744666640435528, 0.12964763444579525, 0.05543288456506489, 0.08312600137685071, 0.04185609473155562, -0.0439610423942663, -0.16969984830429144, 0.3247710554140438, 0.16291923537135086, 0.20802063946180122, 0.1516128042616795, 0.057142276153659695, 0.015263808492724736, 0.018382148026277495, -0.046584960918143854, -0.11827540011193181, 0.11970949581987464, 0.2767517472204474, 0.08195388388637569, 0.12033205899918817, -0.4127602247694104, -0.17302517906868273, 0.09452309294306126, 0.13568090605693534, 0.12510342022269658, -0.056710539173548465, -0.27764969175086196, 0.09579286489098035, -0.22746296324911192, -0.1239580011436927, 0.007944879602141602, 0.05866294090165613, 0.1100273335678983, -0.24141385542593666, 0.031647126929661665, -0.04828240699734846, 0.10534455076570517, -0.1170203483341857, -0.21228948246433219, -0.1279195286621599, 0.031743912309523406, 0.06655871254372765, 0.015443460885903404, 0.25231106249020274, -0.11130342717983366, -0.02699312708369389, 0.4227732983753853, -0.018486482480099212, -0.09248146441640313, 0.1254837193823967, -0.18888638484694986, -0.10682245970886085, 0.24857768349195877, 0.2177297825848242, 0.18398364118574015, -0.14429758235178503, 0.05605530812220225, 0.04384920323632427, 0.17128201998703027, 0.1126763146519469, 0.016702559490966582, 0.1559920633744602, 0.22904462653413876, -0.05710937405369945, 0.040574999179297425, -0.22138495359224142, -0.16238438583833656, -0.3050387577038527, -0.13552158075317586, -0.04859203708924584, 0.025187649224049497, -0.05679970441464714, -0.059944623342556784, 0.313229074087186, 0.02927376001055554, 0.265615308782105, -0.01217795213679639, 0.27055086026486663, 0.10975164106744581, 0.08787178021097153, 0.05409192964050573, 0.3157099522842267, 0.19293115650946946, 0.0936801052489078, -0.2476638806887816, 0.09898655406996301, -0.03844764141711531]
|
1,803.06523
|
Stochastic model-based minimization of weakly convex functions
|
We consider a family of algorithms that successively sample and minimize
simple stochastic models of the objective function. We show that under
reasonable conditions on approximation quality and regularity of the models,
any such algorithm drives a natural stationarity measure to zero at the rate
$O(k^{-1/4})$. As a consequence, we obtain the first complexity guarantees for
the stochastic proximal point, proximal subgradient, and regularized
Gauss-Newton methods for minimizing compositions of convex functions with
smooth maps. The guiding principle, underlying the complexity guarantees, is
that all algorithms under consideration can be interpreted as approximate
descent methods on an implicit smoothing of the problem, given by the Moreau
envelope. Specializing to classical circumstances, we obtain the long-sought
convergence rate of the stochastic projected gradient method, without batching,
for minimizing a smooth function on a closed convex set.
|
math.OC cs.LG
|
we consider a family of algorithms that successively sample and minimize simple stochastic models of the objective function we show that under reasonable conditions on approximation quality and regularity of the models any such algorithm drives a natural stationarity measure to zero at the rate ok14 as a consequence we obtain the first complexity guarantees for the stochastic proximal point proximal subgradient and regularized gaussnewton methods for minimizing compositions of convex functions with smooth maps the guiding principle underlying the complexity guarantees is that all algorithms under consideration can be interpreted as approximate descent methods on an implicit smoothing of the problem given by the moreau envelope specializing to classical circumstances we obtain the longsought convergence rate of the stochastic projected gradient method without batching for minimizing a smooth function on a closed convex set
|
[['we', 'consider', 'a', 'family', 'of', 'algorithms', 'that', 'successively', 'sample', 'and', 'minimize', 'simple', 'stochastic', 'models', 'of', 'the', 'objective', 'function', 'we', 'show', 'that', 'under', 'reasonable', 'conditions', 'on', 'approximation', 'quality', 'and', 'regularity', 'of', 'the', 'models', 'any', 'such', 'algorithm', 'drives', 'a', 'natural', 'stationarity', 'measure', 'to', 'zero', 'at', 'the', 'rate', 'ok14', 'as', 'a', 'consequence', 'we', 'obtain', 'the', 'first', 'complexity', 'guarantees', 'for', 'the', 'stochastic', 'proximal', 'point', 'proximal', 'subgradient', 'and', 'regularized', 'gaussnewton', 'methods', 'for', 'minimizing', 'compositions', 'of', 'convex', 'functions', 'with', 'smooth', 'maps', 'the', 'guiding', 'principle', 'underlying', 'the', 'complexity', 'guarantees', 'is', 'that', 'all', 'algorithms', 'under', 'consideration', 'can', 'be', 'interpreted', 'as', 'approximate', 'descent', 'methods', 'on', 'an', 'implicit', 'smoothing', 'of', 'the', 'problem', 'given', 'by', 'the', 'moreau', 'envelope', 'specializing', 'to', 'classical', 'circumstances', 'we', 'obtain', 'the', 'longsought', 'convergence', 'rate', 'of', 'the', 'stochastic', 'projected', 'gradient', 'method', 'without', 'batching', 'for', 'minimizing', 'a', 'smooth', 'function', 'on', 'a', 'closed', 'convex', 'set']]
|
[-0.09513134034695449, -0.02680739989683153, -0.10666818610151056, 0.12150641166329108, -0.05816197991888556, -0.1250955226900125, 0.07641071408159203, 0.4012113741357569, -0.3487237891527238, -0.24247817840703106, 0.11629217887314519, -0.20190772648568747, -0.15887595629492016, 0.22036884260812292, -0.12199096333373476, 0.11203439461964149, 0.06517095799661345, 0.022099821304005604, -0.1644637444142804, -0.2689024361272998, 0.2984611410095736, 0.018557725943349025, 0.25728877023966223, 0.015314196477023263, 0.17922574086718399, 0.002607928864933826, 0.04944058356599675, 0.04771807936054689, -0.12265984474382734, 0.09929063920259337, 0.21365410954140654, 0.20937230185502106, 0.3674796416665669, -0.42194257728314605, -0.19886241495281595, 0.16706358384065054, 0.10203464478189643, 0.08947763189811397, -0.05991904021120044, -0.22866286958257356, 0.10189931488733876, -0.0785916205254142, -0.11642183900500337, -0.09580395242406262, -0.08697732706657714, 0.09126999388552375, -0.35186182484030726, 0.05753937039386343, 0.07966868156153295, 0.04457989012589678, -0.10478981717627633, -0.12297034871385053, 0.012197796370903098, 0.06283402973096128, 0.061618201583796356, 0.08648333647805784, 0.13527284116587704, -0.08228693573425214, -0.10665979479543036, 0.34267572399392654, -0.10583123188741782, -0.26208730479357417, 0.17222925246589713, -0.05572486554738134, -0.1392987891410788, 0.1452937604514537, 0.22328324138911235, 0.2001311699618344, -0.1641290270688909, 0.10434495535446331, -0.05339643925566364, 0.09643012386751017, 0.047267909968892734, 0.003768142195487464, 0.11349609950212416, 0.14303832768842026, 0.22339772120876997, 0.1587760569381148, -0.04123578484308112, -0.1212801561020401, -0.32706266669211564, -0.1375622284633142, -0.19414582989368312, 0.02213720797078201, -0.15760422050058237, -0.18184937342863391, 0.3611334377968753, 0.10967867872979561, 0.19472585990335103, 0.16493205374313724, 0.3287989332858059, 0.164636994523311, 0.02649014980652956, 0.11644165194765838, 0.17767288716233992, 0.1163429308777537, 0.0183902393474623, -0.23885148790561492, 0.11271764278687812, 0.16990069477232517]
|
1,803.06524
|
SeqFace: Make full use of sequence information for face recognition
|
Deep convolutional neural networks (CNNs) have greatly improved the Face
Recognition (FR) performance in recent years. Almost all CNNs in FR are trained
on the carefully labeled datasets containing plenty of identities. However,
such high-quality datasets are very expensive to collect, which restricts many
researchers to achieve state-of-the-art performance. In this paper, we propose
a framework, called SeqFace, for learning discriminative face features. Besides
a traditional identity training dataset, the designed SeqFace can train CNNs by
using an additional dataset which includes a large number of face sequences
collected from videos. Moreover, the label smoothing regularization (LSR) and a
new proposed discriminative sequence agent (DSA) loss are employed to enhance
discrimination power of deep face features via making full use of the sequence
data. Our method achieves excellent performance on Labeled Faces in the Wild
(LFW), YouTube Faces (YTF), only with a single ResNet. The code and models are
publicly available on-line (https://github.com/huangyangyu/SeqFace).
|
cs.CV
|
deep convolutional neural networks cnns have greatly improved the face recognition fr performance in recent years almost all cnns in fr are trained on the carefully labeled datasets containing plenty of identities however such highquality datasets are very expensive to collect which restricts many researchers to achieve stateoftheart performance in this paper we propose a framework called seqface for learning discriminative face features besides a traditional identity training dataset the designed seqface can train cnns by using an additional dataset which includes a large number of face sequences collected from videos moreover the label smoothing regularization lsr and a new proposed discriminative sequence agent dsa loss are employed to enhance discrimination power of deep face features via making full use of the sequence data our method achieves excellent performance on labeled faces in the wild lfw youtube faces ytf only with a single resnet the code and models are publicly available online httpsgithubcomhuangyangyuseqface
|
[['deep', 'convolutional', 'neural', 'networks', 'cnns', 'have', 'greatly', 'improved', 'the', 'face', 'recognition', 'fr', 'performance', 'in', 'recent', 'years', 'almost', 'all', 'cnns', 'in', 'fr', 'are', 'trained', 'on', 'the', 'carefully', 'labeled', 'datasets', 'containing', 'plenty', 'of', 'identities', 'however', 'such', 'highquality', 'datasets', 'are', 'very', 'expensive', 'to', 'collect', 'which', 'restricts', 'many', 'researchers', 'to', 'achieve', 'stateoftheart', 'performance', 'in', 'this', 'paper', 'we', 'propose', 'a', 'framework', 'called', 'seqface', 'for', 'learning', 'discriminative', 'face', 'features', 'besides', 'a', 'traditional', 'identity', 'training', 'dataset', 'the', 'designed', 'seqface', 'can', 'train', 'cnns', 'by', 'using', 'an', 'additional', 'dataset', 'which', 'includes', 'a', 'large', 'number', 'of', 'face', 'sequences', 'collected', 'from', 'videos', 'moreover', 'the', 'label', 'smoothing', 'regularization', 'lsr', 'and', 'a', 'new', 'proposed', 'discriminative', 'sequence', 'agent', 'dsa', 'loss', 'are', 'employed', 'to', 'enhance', 'discrimination', 'power', 'of', 'deep', 'face', 'features', 'via', 'making', 'full', 'use', 'of', 'the', 'sequence', 'data', 'our', 'method', 'achieves', 'excellent', 'performance', 'on', 'labeled', 'faces', 'in', 'the', 'wild', 'lfw', 'youtube', 'faces', 'ytf', 'only', 'with', 'a', 'single', 'resnet', 'the', 'code', 'and', 'models', 'are', 'publicly', 'available', 'online', 'httpsgithubcomhuangyangyuseqface']]
|
[-0.029909367289704582, -0.05986352970115452, -0.025392859590550265, 0.05647198015435909, -0.1362877995427698, -0.22932410035903256, -0.025472238272583735, 0.5017064937669784, -0.2514925868685047, -0.3485337348965307, 0.07853196296220025, -0.33122652865946295, -0.1741093053870524, 0.21179055832326413, -0.2032907837536186, 0.10809574332553894, 0.2396294890716672, 0.05977787454767774, -0.03229945951604653, -0.3836174970927338, 0.2769480267477532, 0.040960474302604175, 0.37393793147057297, -0.009284653554980954, 0.1579033904375198, -0.08723877422356358, -0.022351696357751884, -0.022105223598579565, -0.01648938087746501, 0.22375925516321635, 0.31424592608539875, 0.22331192224596938, 0.3130399790522642, -0.3990898208102832, -0.2204084546274195, 0.0959379347693175, 0.1545303454808891, 0.11254902844647101, -0.06877843208455792, -0.36260255965093774, 0.11503543539904058, -0.1899186200182885, 0.07080596027274927, -0.1842954580586714, -0.05554360223313173, -0.02292487763101235, -0.31282388751705487, 0.027192506932963927, 0.02712100399658084, 0.10838151982674996, -0.0009781587620576223, -0.14469690041306119, 0.014465178758837283, 0.1896728180721402, 0.03889615279932817, 0.04787557620089501, 0.10879496578748027, -0.24664015317801385, -0.1254035565800344, 0.3413121940071384, -0.05474608382831017, -0.20252766198168198, 0.2073935668884466, 0.0038367932258794703, -0.16061737878248095, 0.1392646848441412, 0.2613036294809232, 0.13953594870244462, -0.18843615600839259, 0.022619390196632595, -0.07394013422851761, 0.18459969999268652, 0.0770306687305371, -0.004590193613742789, 0.1574399600387551, 0.2785899359236161, -0.031187634759116917, 0.15281731199473142, -0.18306693327923615, -0.004241772141928474, -0.16271823631599547, -0.04388311735820025, -0.23034400457283483, -0.027259868869247535, -0.1352994043098685, -0.14505048702626178, 0.4170823419342438, 0.24846562792236607, 0.2038379420960943, 0.13715102561671907, 0.3522363749394814, -0.05446243894208844, 0.19940563274935508, 0.09889031877741218, 0.16618340997568642, -0.05718551344393442, 0.13539164472720586, -0.12746016655272494, 0.05128755423317974, 0.06325562155805528]
|
1,803.06525
|
A Benchmark Study on Sentiment Analysis for Software Engineering
Research
|
A recent research trend has emerged to identify developers' emotions, by
applying sentiment analysis to the content of communication traces left in
collaborative development environments. Trying to overcome the limitations
posed by using off-the-shelf sentiment analysis tools, researchers recently
started to develop their own tools for the software engineering domain. In this
paper, we report a benchmark study to assess the performance and reliability of
three sentiment analysis tools specifically customized for software
engineering. Furthermore, we offer a reflection on the open challenges, as they
emerge from a qualitative analysis of misclassified texts.
|
cs.SE
|
a recent research trend has emerged to identify developers emotions by applying sentiment analysis to the content of communication traces left in collaborative development environments trying to overcome the limitations posed by using offtheshelf sentiment analysis tools researchers recently started to develop their own tools for the software engineering domain in this paper we report a benchmark study to assess the performance and reliability of three sentiment analysis tools specifically customized for software engineering furthermore we offer a reflection on the open challenges as they emerge from a qualitative analysis of misclassified texts
|
[['a', 'recent', 'research', 'trend', 'has', 'emerged', 'to', 'identify', 'developers', 'emotions', 'by', 'applying', 'sentiment', 'analysis', 'to', 'the', 'content', 'of', 'communication', 'traces', 'left', 'in', 'collaborative', 'development', 'environments', 'trying', 'to', 'overcome', 'the', 'limitations', 'posed', 'by', 'using', 'offtheshelf', 'sentiment', 'analysis', 'tools', 'researchers', 'recently', 'started', 'to', 'develop', 'their', 'own', 'tools', 'for', 'the', 'software', 'engineering', 'domain', 'in', 'this', 'paper', 'we', 'report', 'a', 'benchmark', 'study', 'to', 'assess', 'the', 'performance', 'and', 'reliability', 'of', 'three', 'sentiment', 'analysis', 'tools', 'specifically', 'customized', 'for', 'software', 'engineering', 'furthermore', 'we', 'offer', 'a', 'reflection', 'on', 'the', 'open', 'challenges', 'as', 'they', 'emerge', 'from', 'a', 'qualitative', 'analysis', 'of', 'misclassified', 'texts']]
|
[-0.05854469511948366, -0.048274215711380845, -0.09109262708431831, 0.07231756773907491, -0.17287528497837884, -0.1582392448038664, 0.0914211078829843, 0.4333751244891074, -0.24811008255127617, -0.359106606964062, 0.14834146627966033, -0.3188917689245715, -0.17967599249815427, 0.216436349105851, -0.11267320745654645, 0.08041204704392341, 0.09524937154179419, -0.0275636737832849, -0.035205031711337785, -0.25684115945571856, 0.30593681451614185, 0.04553221062486691, 0.36288110597399614, 0.08537979825570058, -0.0043278128529588384, -0.028555621367989368, -0.13733162747205346, -0.017330931026428457, -0.10563204628014837, 0.21816338432492108, 0.4016305732025054, 0.24713080604210175, 0.41200179714829693, -0.4188747315877868, -0.21083308254638988, 0.011992923009099179, 0.17879252323958403, 0.0655954159115271, -0.1024515136991257, -0.3510402556789178, 0.08685354583005431, -0.20883653035777952, -0.11845139573298154, -0.12580524647222852, 0.003038701542492916, -0.013784662945576573, -0.17495957581746963, -0.046137012911820284, 0.05567321689018319, 0.1596377616527901, -0.006453316685022606, -0.10443477564921944, 0.06040619576089485, 0.2374202077557403, 0.09979606099221455, -0.0063450029345169185, 0.1592492273087383, -0.14878672655792005, -0.20350216555043615, 0.3610347973343025, -0.05141532077624272, -0.1785339510008212, 0.23002839731352945, -0.012790464400564151, -0.22041722755098053, 0.01867768023869083, 0.2597497554135419, 0.047454939494209904, -0.2088567199666173, 0.044243236652560414, 0.036032901185574714, 0.19698978814681972, 0.057232060469686985, -0.03685702113259424, 0.21256759769523575, 0.223788336680461, 0.0032991295860659692, 0.14675877894955858, -0.019369585842635203, -0.04030103804743899, -0.16246195756379636, -0.14195081876010024, -0.11193107278086245, 0.029449000849478667, 0.007046445728666449, -0.15503226588129676, 0.41733515298654955, 0.23575924713444965, 0.10079915576704568, 0.024071448332359715, 0.3444927875152839, 0.029371403516971217, 0.06439300994789328, 0.07037265905897604, 0.16694680177256144, 0.0528241788658003, 0.22174826084626137, -0.14689508522860706, 0.06635052804529706, -0.01410493172544946]
|
1,803.06526
|
Titanium diboride ceramics for solar thermal absorbers
|
Titanium diboride (TiB2) is a low-density refractory material belonging to
the family of ultra-high temperature ceramics (UHTCs). This paper reports on
the production and microstructural and optical characterization of nearly fully
dense TiB2, with particular interest to its potential utilization as novel
thermal solar absorber. Monolithic bulk samples are produced starting from
elemental reactants by a two-step method consisting of the Self-propagating
High-temperature Synthesis (SHS) followed by the Spark Plasma Sintering (SPS)
of the resulting powders. The surface of obtained samples has-been
characterized from the microstructural and topological points of view. The
hemispherical reflectance spectrum has been measured from 0.3 to 15 um
wavelength, to evaluate the potential of this material as solar absorber for
future concentrating solar plants.
|
physics.app-ph cond-mat.mtrl-sci
|
titanium diboride tib2 is a lowdensity refractory material belonging to the family of ultrahigh temperature ceramics uhtcs this paper reports on the production and microstructural and optical characterization of nearly fully dense tib2 with particular interest to its potential utilization as novel thermal solar absorber monolithic bulk samples are produced starting from elemental reactants by a twostep method consisting of the selfpropagating hightemperature synthesis shs followed by the spark plasma sintering sps of the resulting powders the surface of obtained samples hasbeen characterized from the microstructural and topological points of view the hemispherical reflectance spectrum has been measured from 03 to 15 um wavelength to evaluate the potential of this material as solar absorber for future concentrating solar plants
|
[['titanium', 'diboride', 'tib2', 'is', 'a', 'lowdensity', 'refractory', 'material', 'belonging', 'to', 'the', 'family', 'of', 'ultrahigh', 'temperature', 'ceramics', 'uhtcs', 'this', 'paper', 'reports', 'on', 'the', 'production', 'and', 'microstructural', 'and', 'optical', 'characterization', 'of', 'nearly', 'fully', 'dense', 'tib2', 'with', 'particular', 'interest', 'to', 'its', 'potential', 'utilization', 'as', 'novel', 'thermal', 'solar', 'absorber', 'monolithic', 'bulk', 'samples', 'are', 'produced', 'starting', 'from', 'elemental', 'reactants', 'by', 'a', 'twostep', 'method', 'consisting', 'of', 'the', 'selfpropagating', 'hightemperature', 'synthesis', 'shs', 'followed', 'by', 'the', 'spark', 'plasma', 'sintering', 'sps', 'of', 'the', 'resulting', 'powders', 'the', 'surface', 'of', 'obtained', 'samples', 'hasbeen', 'characterized', 'from', 'the', 'microstructural', 'and', 'topological', 'points', 'of', 'view', 'the', 'hemispherical', 'reflectance', 'spectrum', 'has', 'been', 'measured', 'from', '03', 'to', '15', 'um', 'wavelength', 'to', 'evaluate', 'the', 'potential', 'of', 'this', 'material', 'as', 'solar', 'absorber', 'for', 'future', 'concentrating', 'solar', 'plants']]
|
[-0.03327247322836922, 0.17964262164087366, -0.04341371020823086, -0.10209901233586499, -0.005154904421079525, -0.09335964139140511, 0.05356370769658173, 0.40273272752035727, -0.25025566640483626, -0.3342826514212825, 0.057243014014941654, -0.3127481311054553, -0.06012407164049919, 0.19128650902786246, -0.042605675097902196, 0.09896737584889614, -0.004680592391119039, -0.09310904350052825, -0.053555546002857134, -0.17684887291200585, 0.24657629478833307, 0.10530109088192102, 0.30777254629035683, 0.019946894324305704, 0.06566881803574703, -0.08751274213185968, 0.018981102505260763, 0.012341767054256367, -0.12628196167448336, 0.11311319695343658, 0.2651026885861815, 0.031147673489304924, 0.17893375898711383, -0.4204120147831233, -0.2747207366529915, 0.039114663535255494, 0.09228654482828105, 0.04100342067274249, -0.13446059501019575, -0.22721425448228622, 0.08596040345323903, -0.13917070677724935, -0.13041029882348948, 0.012174754731072965, -0.027356624386225967, 0.009325339868309575, -0.238123678389179, 0.030190708332742424, 0.006346656702620656, 0.10854590204307589, -0.13146876662444734, -0.16532766664910262, -0.0979855559071747, 0.053896616560296484, 0.008152902917541817, -0.0007059244967807652, 0.24174174584322056, -0.0786243900473568, -0.02220586816369856, 0.4089121483517929, -0.06078820470404827, 0.008603531105633257, 0.20192380978773206, -0.16226357653326653, -0.07462108728349588, 0.2130565272557344, 0.17970125314826935, 0.11345612506976083, -0.22126100098288035, 0.039615601382585304, -0.006587809020795433, 0.1803832611037513, 0.10387941799915822, 0.06571135598913593, 0.2438510117136826, 0.27332267569973906, -0.03380538424342808, 0.170037501131508, -0.1287539064454041, 0.027566781622689156, -0.2065396112630586, -0.1867048638099331, -0.1719415829343311, 0.07593094611489135, -0.09117529874085942, -0.24564586352493803, 0.40543801930212114, 0.09829822318308781, 0.17174056596694892, -0.047914078766953645, 0.2695146156948502, 0.02570457892863364, 0.05356665909235066, -0.0014214870353205667, 0.266996414258571, 0.14758836652025958, 0.16955399190438752, -0.20758130062189964, 0.11475089682321364, 0.02518436015125806]
|
1,803.06527
|
Presence of horizon makes particle motion chaotic
|
We analyze the motion of a {\it massless} and {\it chargeless} particle very
near to the event horizon. It reveals that the radial motion has exponential
growing nature which indicates that there is a possibility of inducing chaos in
the particle motion of an integrable system when it comes under the influence
of the horizon. This is being confirmed by investigating the Poincar$\acute{e}$
section of the trajectories with the introduction of a harmonic trap to confine
the particle's motion. Two situations are investigated: (a) {\it any} static,
spherically symmetric black hole and, (b) spacetime represents a stationary,
axisymmetric black hole (e.g., Kerr metric). In both cases, the largest
Lyapunov exponent has upper bound which is the surface gravity of the horizon.
We find that the inclusion of rotation in the spacetime introduces more chaotic
fluctuations in the system. The possible implications are finally discussed.
|
gr-qc astro-ph.GA hep-th nlin.CD
|
we analyze the motion of a it massless and it chargeless particle very near to the event horizon it reveals that the radial motion has exponential growing nature which indicates that there is a possibility of inducing chaos in the particle motion of an integrable system when it comes under the influence of the horizon this is being confirmed by investigating the poincaracutee section of the trajectories with the introduction of a harmonic trap to confine the particles motion two situations are investigated a it any static spherically symmetric black hole and b spacetime represents a stationary axisymmetric black hole eg kerr metric in both cases the largest lyapunov exponent has upper bound which is the surface gravity of the horizon we find that the inclusion of rotation in the spacetime introduces more chaotic fluctuations in the system the possible implications are finally discussed
|
[['we', 'analyze', 'the', 'motion', 'of', 'a', 'it', 'massless', 'and', 'it', 'chargeless', 'particle', 'very', 'near', 'to', 'the', 'event', 'horizon', 'it', 'reveals', 'that', 'the', 'radial', 'motion', 'has', 'exponential', 'growing', 'nature', 'which', 'indicates', 'that', 'there', 'is', 'a', 'possibility', 'of', 'inducing', 'chaos', 'in', 'the', 'particle', 'motion', 'of', 'an', 'integrable', 'system', 'when', 'it', 'comes', 'under', 'the', 'influence', 'of', 'the', 'horizon', 'this', 'is', 'being', 'confirmed', 'by', 'investigating', 'the', 'poincaracutee', 'section', 'of', 'the', 'trajectories', 'with', 'the', 'introduction', 'of', 'a', 'harmonic', 'trap', 'to', 'confine', 'the', 'particles', 'motion', 'two', 'situations', 'are', 'investigated', 'a', 'it', 'any', 'static', 'spherically', 'symmetric', 'black', 'hole', 'and', 'b', 'spacetime', 'represents', 'a', 'stationary', 'axisymmetric', 'black', 'hole', 'eg', 'kerr', 'metric', 'in', 'both', 'cases', 'the', 'largest', 'lyapunov', 'exponent', 'has', 'upper', 'bound', 'which', 'is', 'the', 'surface', 'gravity', 'of', 'the', 'horizon', 'we', 'find', 'that', 'the', 'inclusion', 'of', 'rotation', 'in', 'the', 'spacetime', 'introduces', 'more', 'chaotic', 'fluctuations', 'in', 'the', 'system', 'the', 'possible', 'implications', 'are', 'finally', 'discussed']]
|
[-0.18895155348177972, 0.14155333473910206, -0.11973352871427778, 0.0889284621694565, -0.04756374562930432, -0.14230349083663896, -0.020240725254148453, 0.3135900410785932, -0.2098371375112846, -0.24759958702553478, 0.1113265383222218, -0.2975394529510393, -0.1392675677392011, 0.19307098189407648, -0.03495834907678525, 0.0382220839218361, 0.019016862943923723, 0.08058928461266784, -0.03757341297427451, -0.2063377742241654, 0.3478248468826577, 0.07370020075985748, 0.23238975724962074, 0.010819862858220909, 0.12376688050507154, 0.007331870898876029, 0.0005039598961755271, 0.05455881283067912, -0.13897749307130247, 0.06351276898446183, 0.15217538723502205, 0.08935127733922046, 0.2420198138408725, -0.36476370881104636, -0.22346460949241495, 0.10358428771723993, 0.14451237712586995, 0.159611328974481, -0.0923328859584621, -0.2892835086806574, 0.06150596245101446, -0.16969892171780682, -0.19651645583346383, -0.03321501261477048, 0.11322189817373227, -0.029468597609795526, -0.2172857362181983, 0.1011516672846887, 0.12078718357952312, -0.01276297044488375, -0.1001312458532387, -0.017133167498589803, -0.049020285543520004, 0.09089103192289055, 0.1288864721985495, 0.015854650495991034, 0.17332649088348262, -0.10591085598086163, -0.09270934497504237, 0.38586479506921023, -0.04191068559925447, -0.23665554567964542, 0.1844302501865766, -0.24556735124658896, -0.06952384409669321, 0.14096015316479477, 0.14841569376747227, 0.14488505155572462, -0.16159891428883888, 0.13983186353693278, -0.026812652074214485, 0.148469509346291, 0.0971538966987282, 0.026706022317133222, 0.29889630261136013, 0.15736524908020832, 0.08604539054067573, 0.16877724820981005, -0.10586289619904063, -0.14397689413979403, -0.31263125721468693, -0.1521938624585649, -0.16088062225026079, 0.06128992826496768, -0.11901624927264089, -0.20028276281825835, 0.3505303034455412, 0.1146854850974503, 0.15553462521024308, -0.010512027386640612, 0.23806085985335004, 0.12251860423485697, 0.023665039570510596, 0.1262393929090043, 0.3278772722179484, 0.11297128045084213, 0.11806128786863862, -0.2512005727524714, -0.0003377890453622159, 0.04023300811564291]
|
1,803.06528
|
Optical properties of dense zirconium and tantalum diborides for solar
thermal absorbers
|
Ultra-high temperature ceramics (UHTCs) are interesting materials for a large
variety of applications under extreme conditions. This paper reports on the
production and extensive characterization of highly dense, pure zirconium and
tantalum diborides, with particular interest to their potential utilization in
the thermal solar energy field. Monolithic bulk samples are produced by Spark
Plasma Sintering starting from elemental reactants or using metal diboride
powders previously synthesized by Self-propagating High-temperature Synthesis
(SHS). Microstructural and optical properties of products obtained by the two
processing methods have been comparatively evaluated. We found that pure
diborides show a good spectral selectivity, which is an appealing
characteristic for solar absorber applications. No, or very small, differences
in the optical properties have been evidenced when the two investigated
processes adopted for the fabrication of dense TaB2 and ZrB2, respectively, are
compared.
|
cond-mat.mtrl-sci
|
ultrahigh temperature ceramics uhtcs are interesting materials for a large variety of applications under extreme conditions this paper reports on the production and extensive characterization of highly dense pure zirconium and tantalum diborides with particular interest to their potential utilization in the thermal solar energy field monolithic bulk samples are produced by spark plasma sintering starting from elemental reactants or using metal diboride powders previously synthesized by selfpropagating hightemperature synthesis shs microstructural and optical properties of products obtained by the two processing methods have been comparatively evaluated we found that pure diborides show a good spectral selectivity which is an appealing characteristic for solar absorber applications no or very small differences in the optical properties have been evidenced when the two investigated processes adopted for the fabrication of dense tab2 and zrb2 respectively are compared
|
[['ultrahigh', 'temperature', 'ceramics', 'uhtcs', 'are', 'interesting', 'materials', 'for', 'a', 'large', 'variety', 'of', 'applications', 'under', 'extreme', 'conditions', 'this', 'paper', 'reports', 'on', 'the', 'production', 'and', 'extensive', 'characterization', 'of', 'highly', 'dense', 'pure', 'zirconium', 'and', 'tantalum', 'diborides', 'with', 'particular', 'interest', 'to', 'their', 'potential', 'utilization', 'in', 'the', 'thermal', 'solar', 'energy', 'field', 'monolithic', 'bulk', 'samples', 'are', 'produced', 'by', 'spark', 'plasma', 'sintering', 'starting', 'from', 'elemental', 'reactants', 'or', 'using', 'metal', 'diboride', 'powders', 'previously', 'synthesized', 'by', 'selfpropagating', 'hightemperature', 'synthesis', 'shs', 'microstructural', 'and', 'optical', 'properties', 'of', 'products', 'obtained', 'by', 'the', 'two', 'processing', 'methods', 'have', 'been', 'comparatively', 'evaluated', 'we', 'found', 'that', 'pure', 'diborides', 'show', 'a', 'good', 'spectral', 'selectivity', 'which', 'is', 'an', 'appealing', 'characteristic', 'for', 'solar', 'absorber', 'applications', 'no', 'or', 'very', 'small', 'differences', 'in', 'the', 'optical', 'properties', 'have', 'been', 'evidenced', 'when', 'the', 'two', 'investigated', 'processes', 'adopted', 'for', 'the', 'fabrication', 'of', 'dense', 'tab2', 'and', 'zrb2', 'respectively', 'are', 'compared']]
|
[-0.044484085849931104, 0.17455409464190466, -0.03348670880755048, -0.018838165383507955, 0.002509352168130841, -0.11830514418169745, 0.02313293501432401, 0.4792177316579801, -0.21028860940584052, -0.313979480471184, 0.10641697330796507, -0.28829638793397305, -0.0937561633937589, 0.23596882830902155, -0.02093485885285842, 0.09390658708706276, 0.05000363299432002, -0.06525389758658025, -0.09009939279761721, -0.19754565753904518, 0.24755378581110887, 0.06776663970003259, 0.35496403436774193, 0.04370380118411076, 0.053327160698896856, -0.08545611573404062, 0.025250896712879774, 0.05491081193965206, -0.1180284887718088, 0.09758380598930726, 0.26877594628517254, 0.01211115370205701, 0.1913907471453465, -0.4555717465787459, -0.2848632436301281, 0.05589640645115678, 0.100755572431971, 0.04964901929036645, -0.19097849831363853, -0.2315478131327945, 0.09603873185584072, -0.1371051163122461, -0.08562024584415355, -0.08099422586122666, 0.006297460247227338, 0.04698746927854007, -0.24875770057606947, 0.01689092027989508, 0.011391901284709934, 0.11683234513507906, -0.10271156927633251, -0.20156182499546835, -0.04588915519902844, 0.06060101702021359, 0.016087674259541752, -0.05099655702925607, 0.20842148686773074, -0.12828723896023775, -0.06563869082897122, 0.40825757054862244, -0.04763955547154617, -0.05865414155935591, 0.267087354651416, -0.1234967573250491, -0.12963338536140856, 0.19349884669602252, 0.1337889109654769, 0.13530562679047015, -0.20891047356558579, 0.059012917501143, 0.006222687699873723, 0.14668711999069844, 0.11454602913694706, 0.09404729094283322, 0.20238899433318136, 0.2235529926125961, -0.06355820546524404, 0.1574718459829021, -0.07088046464478291, -0.005375559455645618, -0.1607640340017266, -0.19184471863502664, -0.16982974883850052, 0.06179240266636098, -0.09240533773215669, -0.20081242858154227, 0.33928241220532235, 0.10569997854989523, 0.1612753619239214, -0.08623098422783608, 0.25545742199408694, 0.043425963493064046, 0.05709671232946662, 0.016556967639298276, 0.2753058976994188, 0.1553676448564337, 0.14341326815131775, -0.19701872533361026, 0.13593897309828437, -0.020942828704867123]
|
1,803.06529
|
Connecting Coronal Mass Ejections to their Solar Active Region Sources:
Combining Results from the HELCATS and FLARECAST Projects
|
Coronal mass ejections (CMEs) and other solar eruptive phenomena can be
physically linked by combining data from a multitude of ground-based and
space-based instruments alongside models, however this can be challenging for
automated operational systems. The EU Framework Package 7 HELCATS project
provides catalogues of CME observations and properties from the Helio- spheric
Imagers onboard the two NASA/STEREO spacecraft in order to track the evolution
of CMEs in the inner heliosphere. From the main HICAT catalogue of over 2,000
CME detections, an automated algorithm has been developed to connect the CMEs
observed by STEREO to any corresponding solar flares and active region (AR)
sources on the solar surface. CME kinematic properties, such as speed and
angular width, are compared with AR magnetic field properties, such as magnetic
flux, area, and neutral line characteristics. The resulting LOWCAT catalogue is
also compared to the extensive AR property database created by the EU Horizon
2020 FLARECAST project, which provides more complex magnetic field parameters
derived from vector magnetograms. Initial statistical analysis has been
undertaken on the new data to provide insight into the link between flare and
CME events, and characteristics of eruptive ARs. Warning thresholds determined
from analysis of the evolution of these parameters is shown to be a useful
output for operational space weather purposes. Parameters of particular
interest for further analysis include total unsigned flux, vertical current,
and current helicity. The automated method developed to create the LOWCAT
catalogue may also be useful for future efforts to develop operational CME
forecasting.
|
astro-ph.SR
|
coronal mass ejections cmes and other solar eruptive phenomena can be physically linked by combining data from a multitude of groundbased and spacebased instruments alongside models however this can be challenging for automated operational systems the eu framework package 7 helcats project provides catalogues of cme observations and properties from the helio spheric imagers onboard the two nasastereo spacecraft in order to track the evolution of cmes in the inner heliosphere from the main hicat catalogue of over 2000 cme detections an automated algorithm has been developed to connect the cmes observed by stereo to any corresponding solar flares and active region ar sources on the solar surface cme kinematic properties such as speed and angular width are compared with ar magnetic field properties such as magnetic flux area and neutral line characteristics the resulting lowcat catalogue is also compared to the extensive ar property database created by the eu horizon 2020 flarecast project which provides more complex magnetic field parameters derived from vector magnetograms initial statistical analysis has been undertaken on the new data to provide insight into the link between flare and cme events and characteristics of eruptive ars warning thresholds determined from analysis of the evolution of these parameters is shown to be a useful output for operational space weather purposes parameters of particular interest for further analysis include total unsigned flux vertical current and current helicity the automated method developed to create the lowcat catalogue may also be useful for future efforts to develop operational cme forecasting
|
[['coronal', 'mass', 'ejections', 'cmes', 'and', 'other', 'solar', 'eruptive', 'phenomena', 'can', 'be', 'physically', 'linked', 'by', 'combining', 'data', 'from', 'a', 'multitude', 'of', 'groundbased', 'and', 'spacebased', 'instruments', 'alongside', 'models', 'however', 'this', 'can', 'be', 'challenging', 'for', 'automated', 'operational', 'systems', 'the', 'eu', 'framework', 'package', '7', 'helcats', 'project', 'provides', 'catalogues', 'of', 'cme', 'observations', 'and', 'properties', 'from', 'the', 'helio', 'spheric', 'imagers', 'onboard', 'the', 'two', 'nasastereo', 'spacecraft', 'in', 'order', 'to', 'track', 'the', 'evolution', 'of', 'cmes', 'in', 'the', 'inner', 'heliosphere', 'from', 'the', 'main', 'hicat', 'catalogue', 'of', 'over', '2000', 'cme', 'detections', 'an', 'automated', 'algorithm', 'has', 'been', 'developed', 'to', 'connect', 'the', 'cmes', 'observed', 'by', 'stereo', 'to', 'any', 'corresponding', 'solar', 'flares', 'and', 'active', 'region', 'ar', 'sources', 'on', 'the', 'solar', 'surface', 'cme', 'kinematic', 'properties', 'such', 'as', 'speed', 'and', 'angular', 'width', 'are', 'compared', 'with', 'ar', 'magnetic', 'field', 'properties', 'such', 'as', 'magnetic', 'flux', 'area', 'and', 'neutral', 'line', 'characteristics', 'the', 'resulting', 'lowcat', 'catalogue', 'is', 'also', 'compared', 'to', 'the', 'extensive', 'ar', 'property', 'database', 'created', 'by', 'the', 'eu', 'horizon', '2020', 'flarecast', 'project', 'which', 'provides', 'more', 'complex', 'magnetic', 'field', 'parameters', 'derived', 'from', 'vector', 'magnetograms', 'initial', 'statistical', 'analysis', 'has', 'been', 'undertaken', 'on', 'the', 'new', 'data', 'to', 'provide', 'insight', 'into', 'the', 'link', 'between', 'flare', 'and', 'cme', 'events', 'and', 'characteristics', 'of', 'eruptive', 'ars', 'warning', 'thresholds', 'determined', 'from', 'analysis', 'of', 'the', 'evolution', 'of', 'these', 'parameters', 'is', 'shown', 'to', 'be', 'a', 'useful', 'output', 'for', 'operational', 'space', 'weather', 'purposes', 'parameters', 'of', 'particular', 'interest', 'for', 'further', 'analysis', 'include', 'total', 'unsigned', 'flux', 'vertical', 'current', 'and', 'current', 'helicity', 'the', 'automated', 'method', 'developed', 'to', 'create', 'the', 'lowcat', 'catalogue', 'may', 'also', 'be', 'useful', 'for', 'future', 'efforts', 'to', 'develop', 'operational', 'cme', 'forecasting']]
|
[-0.05764423356477862, 0.14140353441401995, -0.03908366912078383, 0.11954665487686608, -0.11471173167416465, -0.05076621239066064, 0.006507407193214843, 0.42791413313769283, -0.17664172512013465, -0.42632801888037414, 0.09812435670286387, -0.25867192736346156, -0.09605888274522693, 0.2741023417115831, -0.06160753952715294, 0.07362569861805006, 0.13902445382817888, -0.02637510755671575, -0.04308869674493889, -0.19335549857820414, 0.23501177019657446, 0.12400454870845762, 0.22718314618067514, -0.018019420875427915, 0.08349086046819726, -0.07530264746052243, -0.09347215845933064, 0.024249163797879104, -0.11252513762378986, 0.08110845989487585, 0.24246523776458073, 0.19889200122223324, 0.224026694465729, -0.42845888792597236, -0.25404726430837576, 0.00840291727311729, 0.15955191398332377, -0.022874771092075766, -0.018489958108470855, -0.3369876048077018, 0.04100892741036894, -0.17126623471643054, -0.12300520113316335, -0.01825664130973887, 0.04081635002606368, 0.03192990714254143, -0.2838738202042277, 0.024109099213092122, -0.022490396487785714, 0.13150800592519507, -0.11337078422413117, -0.07845169361755852, -0.08359672827833903, 0.17567851108727947, 0.09906783868416003, 0.0698105233102744, 0.1667402011014694, -0.09843396342588559, -0.10642151737521353, 0.34415993732663114, -0.01712740985197841, -0.06398491430386898, 0.173414863001052, -0.165522661250678, -0.15440354548815277, 0.16548886737314938, 0.2046363235053685, 0.04391275618822434, -0.19521422364613822, 0.0145778642212052, 0.0006408947257084712, 0.1320069261865067, 0.015065754429792098, 0.020983351413310775, 0.27825651833348186, 0.1291898128439507, 0.0723968167909451, 0.10288098580865827, -0.2137275854077181, -0.04307493352614749, -0.2569197705729053, -0.14391119447499212, -0.10081265717294187, 0.012054850647297327, -0.0696110364470153, -0.16047329610439426, 0.41902315792920547, 0.21758887535642932, 0.15489972152769746, -0.06441273777965116, 0.315468538882992, 0.0680759000308406, 0.07655617376440205, 0.11726685639399465, 0.28599929764506316, 0.16160179541501776, 0.19778880669365473, -0.17457432207565063, 0.08804650648756163, 0.08428592799088708]
|
1,803.0653
|
Designing Quantum Router in IBM Quantum Computer
|
Quantum router is an essential ingredient in a quantum network. Here, we
propose a new quantum circuit for designing quantum router by using IBM's
five-qubit quantum computer. We design an equivalent quantum circuit, by the
means of single-qubit and two-qubit quantum gates, which can perform the
operation of a quantum router. Here, we show the routing of signal information
in two different paths (two signal qubits) which is directed by a control
qubit. According to the process of routing, the signal information is found to
be in a coherent superposition of two paths. We demonstrate the quantum nature
of the router by illustrating the entanglement between the control qubit and
the two signal qubits (two paths), and confirm the well preservation of the
signal information in either of the two paths after the routing process. We
perform quantum state tomography to verify the generation of entanglement and
preservation of information. It is found that the experimental results are
obtained with good fidelity.
|
quant-ph
|
quantum router is an essential ingredient in a quantum network here we propose a new quantum circuit for designing quantum router by using ibms fivequbit quantum computer we design an equivalent quantum circuit by the means of singlequbit and twoqubit quantum gates which can perform the operation of a quantum router here we show the routing of signal information in two different paths two signal qubits which is directed by a control qubit according to the process of routing the signal information is found to be in a coherent superposition of two paths we demonstrate the quantum nature of the router by illustrating the entanglement between the control qubit and the two signal qubits two paths and confirm the well preservation of the signal information in either of the two paths after the routing process we perform quantum state tomography to verify the generation of entanglement and preservation of information it is found that the experimental results are obtained with good fidelity
|
[['quantum', 'router', 'is', 'an', 'essential', 'ingredient', 'in', 'a', 'quantum', 'network', 'here', 'we', 'propose', 'a', 'new', 'quantum', 'circuit', 'for', 'designing', 'quantum', 'router', 'by', 'using', 'ibms', 'fivequbit', 'quantum', 'computer', 'we', 'design', 'an', 'equivalent', 'quantum', 'circuit', 'by', 'the', 'means', 'of', 'singlequbit', 'and', 'twoqubit', 'quantum', 'gates', 'which', 'can', 'perform', 'the', 'operation', 'of', 'a', 'quantum', 'router', 'here', 'we', 'show', 'the', 'routing', 'of', 'signal', 'information', 'in', 'two', 'different', 'paths', 'two', 'signal', 'qubits', 'which', 'is', 'directed', 'by', 'a', 'control', 'qubit', 'according', 'to', 'the', 'process', 'of', 'routing', 'the', 'signal', 'information', 'is', 'found', 'to', 'be', 'in', 'a', 'coherent', 'superposition', 'of', 'two', 'paths', 'we', 'demonstrate', 'the', 'quantum', 'nature', 'of', 'the', 'router', 'by', 'illustrating', 'the', 'entanglement', 'between', 'the', 'control', 'qubit', 'and', 'the', 'two', 'signal', 'qubits', 'two', 'paths', 'and', 'confirm', 'the', 'well', 'preservation', 'of', 'the', 'signal', 'information', 'in', 'either', 'of', 'the', 'two', 'paths', 'after', 'the', 'routing', 'process', 'we', 'perform', 'quantum', 'state', 'tomography', 'to', 'verify', 'the', 'generation', 'of', 'entanglement', 'and', 'preservation', 'of', 'information', 'it', 'is', 'found', 'that', 'the', 'experimental', 'results', 'are', 'obtained', 'with', 'good', 'fidelity']]
|
[-0.17715919005377706, 0.16769255548129922, -0.06561850823237803, 0.0028254527687413093, 0.013356386354756484, -0.213953865568418, 0.0788929002204289, 0.4102557324286964, -0.2751742200466034, -0.29080125374753996, 0.07986102454122845, -0.26317052642906796, -0.15349648307066088, 0.24121868313738593, -0.055968468045861815, 0.1582612940483945, 0.08346715028524215, 0.03923173465932731, -0.02132185206340373, -0.24272356289266436, 0.2911993797128678, 0.03577831125800946, 0.321291169985255, 0.04614014893534513, 0.13192795929613949, 0.023582825362452386, 0.015123014620010868, -0.036473873470606995, -0.08974370611480324, 0.11530068230148359, 0.28246709286597455, 0.16290819410372664, 0.23163293027261525, -0.4696818942916982, -0.19679445187334133, 0.06792654045124503, 0.09959421263821566, 0.19415785927457713, -0.0417388391531544, -0.3265724390124281, 0.06565432134659294, -0.16199678127987333, -0.01153077615172039, -0.07215087926935082, -0.04195765752264839, -0.01940483557359304, -0.22576844088667083, -0.002369809898628313, 0.07054241926353252, 0.020040779506764663, 0.05207612030323089, 0.021881526767241734, 0.02480702261141513, 0.17780228231366677, -0.12012486476961373, -0.0034653007018345373, 0.15485809235452722, -0.13321024030561984, -0.2675695611986067, 0.3587387327656702, 0.002036238842310361, -0.18241108025504668, 0.10089504725104313, -0.04779094905250442, -0.0775747958737437, 0.04757430937923031, 0.1027171690042855, 0.06042595082939959, -0.1711050935526505, 0.01841365613106546, 0.01928429282270372, 0.19949632718653224, 0.00878635714445723, 0.1275599028521367, 0.18147055459795175, 0.14535816142588487, 0.11111472818402597, 0.21042690888969917, -0.0892410502642577, -0.16490457743049863, -0.3115629223175347, -0.2352207485804863, -0.2589154682858031, 0.09580123930146205, -0.08270914048814491, -0.11241646306186823, 0.4414803877035961, 0.15921244507994686, 0.1760387470044575, 0.0048381880969154065, 0.35071039676988197, 0.1192433428088272, 0.04394503907059078, 0.09367855476290217, 0.2350544468269764, 0.1550315058859134, 0.044389242904237756, -0.27214238330445906, 0.055558834196194826, 0.0063885532112585176]
|
1,803.06531
|
Topology Estimation using Graphical Models in Multi-Phase Power
Distribution Grids
|
Distribution grid is the medium and low voltage part of a large power system.
Structurally, the majority of distribution networks operate radially, such that
energized lines form a collection of trees, i.e. forest, with a substation
being at the root of any tree. The operational topology/forest may change from
time to time, however tracking these changes, even though important for the
distribution grid operation and control, is hindered by limited real-time
monitoring. This paper develops a learning framework to reconstruct radial
operational structure of the distribution grid from synchronized voltage
measurements in the grid subject to the exogenous fluctuations in nodal power
consumption. To detect operational lines our learning algorithm uses
conditional independence tests for continuous random variables that is
applicable to a wide class of probability distributions of the nodal
consumption and Gaussian injections in particular. Moreover, our algorithm
applies to the practical case of unbalanced three-phase power flow. Algorithm
performance is validated on AC power flow simulations over IEEE distribution
grid test cases.
|
cs.SY math.OC stat.ML
|
distribution grid is the medium and low voltage part of a large power system structurally the majority of distribution networks operate radially such that energized lines form a collection of trees ie forest with a substation being at the root of any tree the operational topologyforest may change from time to time however tracking these changes even though important for the distribution grid operation and control is hindered by limited realtime monitoring this paper develops a learning framework to reconstruct radial operational structure of the distribution grid from synchronized voltage measurements in the grid subject to the exogenous fluctuations in nodal power consumption to detect operational lines our learning algorithm uses conditional independence tests for continuous random variables that is applicable to a wide class of probability distributions of the nodal consumption and gaussian injections in particular moreover our algorithm applies to the practical case of unbalanced threephase power flow algorithm performance is validated on ac power flow simulations over ieee distribution grid test cases
|
[['distribution', 'grid', 'is', 'the', 'medium', 'and', 'low', 'voltage', 'part', 'of', 'a', 'large', 'power', 'system', 'structurally', 'the', 'majority', 'of', 'distribution', 'networks', 'operate', 'radially', 'such', 'that', 'energized', 'lines', 'form', 'a', 'collection', 'of', 'trees', 'ie', 'forest', 'with', 'a', 'substation', 'being', 'at', 'the', 'root', 'of', 'any', 'tree', 'the', 'operational', 'topologyforest', 'may', 'change', 'from', 'time', 'to', 'time', 'however', 'tracking', 'these', 'changes', 'even', 'though', 'important', 'for', 'the', 'distribution', 'grid', 'operation', 'and', 'control', 'is', 'hindered', 'by', 'limited', 'realtime', 'monitoring', 'this', 'paper', 'develops', 'a', 'learning', 'framework', 'to', 'reconstruct', 'radial', 'operational', 'structure', 'of', 'the', 'distribution', 'grid', 'from', 'synchronized', 'voltage', 'measurements', 'in', 'the', 'grid', 'subject', 'to', 'the', 'exogenous', 'fluctuations', 'in', 'nodal', 'power', 'consumption', 'to', 'detect', 'operational', 'lines', 'our', 'learning', 'algorithm', 'uses', 'conditional', 'independence', 'tests', 'for', 'continuous', 'random', 'variables', 'that', 'is', 'applicable', 'to', 'a', 'wide', 'class', 'of', 'probability', 'distributions', 'of', 'the', 'nodal', 'consumption', 'and', 'gaussian', 'injections', 'in', 'particular', 'moreover', 'our', 'algorithm', 'applies', 'to', 'the', 'practical', 'case', 'of', 'unbalanced', 'threephase', 'power', 'flow', 'algorithm', 'performance', 'is', 'validated', 'on', 'ac', 'power', 'flow', 'simulations', 'over', 'ieee', 'distribution', 'grid', 'test', 'cases']]
|
[-0.15153348746460368, 0.07525546623893627, -0.0564079683017775, 0.01612213881694848, -0.0498555631805552, -0.15893725846701007, 0.07708266916757212, 0.38447373785879235, -0.27381033810684685, -0.31432263114739484, 0.10986082675148415, -0.25730965878223866, -0.08208637991522598, 0.20829355430671456, -0.1154538473964771, 0.0997078350813287, 0.05598702951243556, -0.001473260508202834, -0.0004313748980100017, -0.21514192380993513, 0.2767347806550721, 0.08821615826895052, 0.3511286627063982, -0.017595311859622598, 0.10158473417651272, -0.005783908760527194, -0.02633624584960649, 0.0675490801826771, -0.031439874898063776, 0.0914876090484496, 0.27550332001751154, 0.14892869988149712, 0.2826301955899065, -0.40909062603079693, -0.24211072847360698, 0.14677697716340446, 0.10999630936442749, 0.05410416820086539, -0.02435054897299468, -0.20542938613599712, 0.0903725930341951, -0.19954070693631543, -0.10735877558146036, -0.05816973952247148, 0.018628008023370057, 0.09529576922139357, -0.3175079339150504, 0.04337767845661402, 0.044202693880013216, 0.08573244383030502, -0.030787245643029853, -0.07337599327410117, -0.02683351657469757, 0.13602204157270933, -0.015398367716953522, -0.004989473944921728, 0.18024742031447227, -0.1144465376216941, -0.08930113934059968, 0.3578434004490945, -0.023680659770722808, -0.17657308154398713, 0.14919746204892673, -0.13960811941282505, -0.1359186042384131, 0.15762556406169584, 0.25019742759965397, 0.08682610221752306, -0.1372398144374573, 0.03289201720557374, -0.013454891803032696, 0.17169778444591297, 0.05108868730788278, -0.024654691093374134, 0.19723960518462175, 0.1846096255580849, 0.13225687492749563, 0.14037736107257376, -0.12047378889003928, -0.11990695343943449, -0.2636535139584051, -0.07753958987272998, -0.21580352686152499, 0.03820724823588801, -0.09793006967039418, -0.18990800176497277, 0.4236641434949777, 0.17778340990374022, 0.16803499802424596, 0.10520120350382768, 0.36736143119178893, 0.1309980313703929, 0.03984967306846889, 0.1276306044452301, 0.14809275402619346, 0.11203213010647721, 0.15857846569837775, -0.20610454142173162, 0.11918405918177308, -0.010098905115183897]
|
1,803.06532
|
Highly charged ions: optical clocks and applications in fundamental
physics
|
Recent developments in frequency metrology and optical clocks have been based
on electronic transitions in atoms and singly charged ions as references. These
systems have enabled relative frequency uncertainties at a level of a few parts
in $10^{-18}$. This accomplishment not only allows for extremely accurate time
and frequency measurements, but also to probe our understanding of fundamental
physics, such as variation of fundamental constants, violation of the local
Lorentz invariance, and forces beyond the Standard Model of Physics. In
addition, novel clocks are driving the development of sophisticated technical
applications. Crucial for applications of clocks in fundamental physics are a
high sensitivity to effects beyond the Standard Model and Einstein's Theory of
Relativity and a small frequency uncertainty of the clock. Highly charged ions
offer both. They have been proposed as highly accurate clocks, since they
possess optical transitions which can be extremely narrow and less sensitive to
external perturbations compared to current atomic clock species. The selection
of highly charged ions in different charge states offers narrow transitions
that are among the most sensitive ones for a change in the fine-structure
constant and the electron-to-proton mass ratio, as well as other new physics
effects. Recent advances in trapping and sympathetic cooling of highly charged
ions will in the future enable high accuracy optical spectroscopy. Progress in
calculating the properties of selected highly charged ions has allowed the
evaluation of systematic shifts and the prediction of the sensitivity to the
"new physics" effects. This article reviews the current status of theory and
experiment in the field.
|
physics.atom-ph
|
recent developments in frequency metrology and optical clocks have been based on electronic transitions in atoms and singly charged ions as references these systems have enabled relative frequency uncertainties at a level of a few parts in 1018 this accomplishment not only allows for extremely accurate time and frequency measurements but also to probe our understanding of fundamental physics such as variation of fundamental constants violation of the local lorentz invariance and forces beyond the standard model of physics in addition novel clocks are driving the development of sophisticated technical applications crucial for applications of clocks in fundamental physics are a high sensitivity to effects beyond the standard model and einsteins theory of relativity and a small frequency uncertainty of the clock highly charged ions offer both they have been proposed as highly accurate clocks since they possess optical transitions which can be extremely narrow and less sensitive to external perturbations compared to current atomic clock species the selection of highly charged ions in different charge states offers narrow transitions that are among the most sensitive ones for a change in the finestructure constant and the electrontoproton mass ratio as well as other new physics effects recent advances in trapping and sympathetic cooling of highly charged ions will in the future enable high accuracy optical spectroscopy progress in calculating the properties of selected highly charged ions has allowed the evaluation of systematic shifts and the prediction of the sensitivity to the new physics effects this article reviews the current status of theory and experiment in the field
|
[['recent', 'developments', 'in', 'frequency', 'metrology', 'and', 'optical', 'clocks', 'have', 'been', 'based', 'on', 'electronic', 'transitions', 'in', 'atoms', 'and', 'singly', 'charged', 'ions', 'as', 'references', 'these', 'systems', 'have', 'enabled', 'relative', 'frequency', 'uncertainties', 'at', 'a', 'level', 'of', 'a', 'few', 'parts', 'in', '1018', 'this', 'accomplishment', 'not', 'only', 'allows', 'for', 'extremely', 'accurate', 'time', 'and', 'frequency', 'measurements', 'but', 'also', 'to', 'probe', 'our', 'understanding', 'of', 'fundamental', 'physics', 'such', 'as', 'variation', 'of', 'fundamental', 'constants', 'violation', 'of', 'the', 'local', 'lorentz', 'invariance', 'and', 'forces', 'beyond', 'the', 'standard', 'model', 'of', 'physics', 'in', 'addition', 'novel', 'clocks', 'are', 'driving', 'the', 'development', 'of', 'sophisticated', 'technical', 'applications', 'crucial', 'for', 'applications', 'of', 'clocks', 'in', 'fundamental', 'physics', 'are', 'a', 'high', 'sensitivity', 'to', 'effects', 'beyond', 'the', 'standard', 'model', 'and', 'einsteins', 'theory', 'of', 'relativity', 'and', 'a', 'small', 'frequency', 'uncertainty', 'of', 'the', 'clock', 'highly', 'charged', 'ions', 'offer', 'both', 'they', 'have', 'been', 'proposed', 'as', 'highly', 'accurate', 'clocks', 'since', 'they', 'possess', 'optical', 'transitions', 'which', 'can', 'be', 'extremely', 'narrow', 'and', 'less', 'sensitive', 'to', 'external', 'perturbations', 'compared', 'to', 'current', 'atomic', 'clock', 'species', 'the', 'selection', 'of', 'highly', 'charged', 'ions', 'in', 'different', 'charge', 'states', 'offers', 'narrow', 'transitions', 'that', 'are', 'among', 'the', 'most', 'sensitive', 'ones', 'for', 'a', 'change', 'in', 'the', 'finestructure', 'constant', 'and', 'the', 'electrontoproton', 'mass', 'ratio', 'as', 'well', 'as', 'other', 'new', 'physics', 'effects', 'recent', 'advances', 'in', 'trapping', 'and', 'sympathetic', 'cooling', 'of', 'highly', 'charged', 'ions', 'will', 'in', 'the', 'future', 'enable', 'high', 'accuracy', 'optical', 'spectroscopy', 'progress', 'in', 'calculating', 'the', 'properties', 'of', 'selected', 'highly', 'charged', 'ions', 'has', 'allowed', 'the', 'evaluation', 'of', 'systematic', 'shifts', 'and', 'the', 'prediction', 'of', 'the', 'sensitivity', 'to', 'the', 'new', 'physics', 'effects', 'this', 'article', 'reviews', 'the', 'current', 'status', 'of', 'theory', 'and', 'experiment', 'in', 'the', 'field']]
|
[-0.0875688475694377, 0.19300418567448738, -0.004609209567794018, 0.04097889548852489, -0.0359067154272753, -0.14954961995605076, 0.05887584911717341, 0.3743632787001475, -0.22017646046488543, -0.3462572274131679, 0.0808783612827361, -0.2717950950379068, -0.06274079217426913, 0.21234817931053485, -0.018507514929884488, 0.06355987671365897, 0.032581845833829344, -0.0013171882162066285, -0.0521985323667519, -0.15736698162839802, 0.21959224385155024, 0.13718209658289177, 0.29340061949428303, 0.09435980470945284, 0.054085359877837885, -0.028900253075512004, -0.03381200719276871, 0.014317378414892647, -0.07575863471315519, 0.14023334976962445, 0.2554346365522451, 0.07863934557787089, 0.2657565589765891, -0.4440891558326172, -0.21658694198634112, 0.09067643739979878, 0.14084185044560218, 0.17221869643123508, -0.10416491227795222, -0.29167831287780915, -0.019670829070226475, -0.14867519659222583, -0.1349179323414768, -0.1333945857321097, 0.060012270407008315, 0.05697325832692449, -0.2262394625930467, 0.07822674839539501, -0.0012355447253463736, 0.06326609621085372, -0.05177412221614989, -0.12489333802767112, 0.04049977438219964, 0.13366495479344018, 0.035974911912815495, 0.017272762525831223, 0.18449327002681704, -0.15305038132832025, -0.13222308352894008, 0.449420528261694, -0.08696215241379195, -0.1615128606496241, 0.2275331349796996, -0.1944112786588328, -0.1664533929442733, 0.11714506560686526, 0.18840728510635024, 0.114678056132418, -0.15060251903201993, 0.058590025200956075, 0.052364809795532825, 0.1801178297716472, 0.06250870853647995, 0.15411729110741865, 0.2565942745554308, 0.17202388513869524, 0.034742556486083084, 0.033619883198224024, -0.0877493452316998, -0.08063998151251663, -0.26840466905769383, -0.13554800144233198, -0.10751361120265732, 0.023907905229847926, -0.04275614099609004, -0.13871390217098006, 0.39192956180315364, 0.1776726898569197, 0.15666059691074816, -0.06524785840838554, 0.30595019310785293, 0.06872252814774311, 0.0716276034642127, -0.004012159651674417, 0.3482648972770678, 0.15401932983459898, 0.1300982717163716, -0.2231650166014202, 0.05913066747779541, 0.0049174487625216114]
|
1,803.06533
|
Moduli of quiver representations for exceptional collections on surfaces
|
Suppose $S$ is a smooth projective surface over an algebraically closed field
$k$, $\mathcal{L}=\{L_1,\ldots,L_n\}$ is a full strong exceptional collection
of line bundles on $S$. Let $Q$ be the quiver associated to this collection.
One might hope that $S$ is the moduli space of representations of $Q$ with
dimension vector $(1,\ldots,1)$ for a suitably chosen stability condition
$\theta$: $S\cong M_\theta$. In this paper, we show that this is the case for
del Pezzo surfaces. Furthermore, we show the blow-up at a point can be
recovered from an augmentation of exceptional collections (in the sense of L.
Hille and M.Perling) via morphism between moduli of quiver representations.
|
math.AG
|
suppose s is a smooth projective surface over an algebraically closed field k mathcalll_1ldotsl_n is a full strong exceptional collection of line bundles on s let q be the quiver associated to this collection one might hope that s is the moduli space of representations of q with dimension vector 1ldots1 for a suitably chosen stability condition theta scong m_theta in this paper we show that this is the case for del pezzo surfaces furthermore we show the blowup at a point can be recovered from an augmentation of exceptional collections in the sense of l hille and mperling via morphism between moduli of quiver representations
|
[['suppose', 's', 'is', 'a', 'smooth', 'projective', 'surface', 'over', 'an', 'algebraically', 'closed', 'field', 'k', 'mathcalll_1ldotsl_n', 'is', 'a', 'full', 'strong', 'exceptional', 'collection', 'of', 'line', 'bundles', 'on', 's', 'let', 'q', 'be', 'the', 'quiver', 'associated', 'to', 'this', 'collection', 'one', 'might', 'hope', 'that', 's', 'is', 'the', 'moduli', 'space', 'of', 'representations', 'of', 'q', 'with', 'dimension', 'vector', '1ldots1', 'for', 'a', 'suitably', 'chosen', 'stability', 'condition', 'theta', 'scong', 'm_theta', 'in', 'this', 'paper', 'we', 'show', 'that', 'this', 'is', 'the', 'case', 'for', 'del', 'pezzo', 'surfaces', 'furthermore', 'we', 'show', 'the', 'blowup', 'at', 'a', 'point', 'can', 'be', 'recovered', 'from', 'an', 'augmentation', 'of', 'exceptional', 'collections', 'in', 'the', 'sense', 'of', 'l', 'hille', 'and', 'mperling', 'via', 'morphism', 'between', 'moduli', 'of', 'quiver', 'representations']]
|
[-0.21244498622337624, 0.1024878989059722, -0.09617596485518984, 0.01649037616970461, -0.07583779269119813, -0.16904190305975222, 0.008091482403688132, 0.3557317481154487, -0.3359533170504229, -0.19003153989712399, 0.05848352426602062, -0.24667775423842528, -0.1369849898408921, 0.19449180365495738, -0.14796894717784154, -0.06340025671358619, 0.061439911893657634, 0.10717811263388112, -0.09125873771540466, -0.32269469968575454, 0.4158397176081226, -0.05534176318684504, 0.23200041343945832, 0.036131029079357786, 0.10806856106611945, 0.027950799329915926, 0.05620655887538478, 0.015334864645653094, -0.13847510894120205, 0.12842029671051672, 0.3211673433759383, 0.08782781162742703, 0.1769015443311738, -0.3135147629483115, -0.17712448957553578, 0.2371761692421777, 0.15857003090370977, 0.023115306729007336, 0.03565241205616899, -0.25386047237109216, 0.1428140083682679, -0.10164092270036539, -0.1763506724321771, -0.07133603043676842, 0.08624353965056972, 0.0074595568790322255, -0.2904995959961698, -0.06377312611965906, 0.07197009735252885, 0.1597127719737944, -0.035495115510587184, -0.08284371767991355, -0.1077483725734055, 0.02159507087365325, -0.0031965532783596287, 0.11498804030762542, 0.05131177435008188, -0.11644808872868972, -0.071475948075143, 0.32524797969187297, -0.09378130143242223, -0.21635485842735286, 0.12917912990032207, -0.15075191966524082, -0.0934637965678814, 0.16335178967565298, 0.10615649632111723, 0.18205803318747452, -0.005828452026028008, 0.2200275440716983, -0.12106434321474462, 0.10398570805084005, 0.10205104319999615, -0.05329528801320564, 0.19554180702460663, 0.09844410883240579, 0.07716263627544755, 0.10727744316016989, -0.0461682461451606, 0.017416025552942995, -0.42885663683215774, -0.206219344346651, -0.12344974515782225, 0.19595954323276168, -0.11794780381453512, -0.13363893912173808, 0.35895921341365294, 0.051239427143619176, 0.26350002573536974, 0.08312954794438113, 0.173387216723391, 0.036858603640437304, 0.027543402463197707, 0.05622891893255569, 0.11623597120245298, 0.15700290076257217, -0.030148381550264145, -0.15283151422849015, -0.02287792731963453, 0.17138940866681793]
|
1,803.06534
|
LoRa Throughput Analysis with Imperfect Spreading Factor Orthogonality
|
LoRa is one of the promising techniques for enabling Low Power Wide Area
Networks (LPWANs) for future Internet-of-Things (IoT) devices. Although LoRa
allows flexible adaptations of coverage and data rates, it is subject to
intrinsic types of interferences: co-SF interferences where end-devices with
the same Spreading Factors (SFs) are subject to collisions, and inter-SF
interferences where end-devices with different SFs experience collisions. Most
current works have considered perfect orthogonality among different SFs. In
this work, we provide a theoretical analysis of the achievable LoRa throughput
in uplink, where the capture conditions specific to LoRa are included. Results
show the accuracy of our analysis despite approximations, and the throughput
losses from imperfect SF orthogonality, under different SF allocations. Our
analysis will enable the design of specific SF allocation mechanisms, in view
of further throughput enhancements.
|
cs.NI
|
lora is one of the promising techniques for enabling low power wide area networks lpwans for future internetofthings iot devices although lora allows flexible adaptations of coverage and data rates it is subject to intrinsic types of interferences cosf interferences where enddevices with the same spreading factors sfs are subject to collisions and intersf interferences where enddevices with different sfs experience collisions most current works have considered perfect orthogonality among different sfs in this work we provide a theoretical analysis of the achievable lora throughput in uplink where the capture conditions specific to lora are included results show the accuracy of our analysis despite approximations and the throughput losses from imperfect sf orthogonality under different sf allocations our analysis will enable the design of specific sf allocation mechanisms in view of further throughput enhancements
|
[['lora', 'is', 'one', 'of', 'the', 'promising', 'techniques', 'for', 'enabling', 'low', 'power', 'wide', 'area', 'networks', 'lpwans', 'for', 'future', 'internetofthings', 'iot', 'devices', 'although', 'lora', 'allows', 'flexible', 'adaptations', 'of', 'coverage', 'and', 'data', 'rates', 'it', 'is', 'subject', 'to', 'intrinsic', 'types', 'of', 'interferences', 'cosf', 'interferences', 'where', 'enddevices', 'with', 'the', 'same', 'spreading', 'factors', 'sfs', 'are', 'subject', 'to', 'collisions', 'and', 'intersf', 'interferences', 'where', 'enddevices', 'with', 'different', 'sfs', 'experience', 'collisions', 'most', 'current', 'works', 'have', 'considered', 'perfect', 'orthogonality', 'among', 'different', 'sfs', 'in', 'this', 'work', 'we', 'provide', 'a', 'theoretical', 'analysis', 'of', 'the', 'achievable', 'lora', 'throughput', 'in', 'uplink', 'where', 'the', 'capture', 'conditions', 'specific', 'to', 'lora', 'are', 'included', 'results', 'show', 'the', 'accuracy', 'of', 'our', 'analysis', 'despite', 'approximations', 'and', 'the', 'throughput', 'losses', 'from', 'imperfect', 'sf', 'orthogonality', 'under', 'different', 'sf', 'allocations', 'our', 'analysis', 'will', 'enable', 'the', 'design', 'of', 'specific', 'sf', 'allocation', 'mechanisms', 'in', 'view', 'of', 'further', 'throughput', 'enhancements']]
|
[-0.20776525056406633, 0.02152918163450685, -0.032467732821076886, 0.05282816522165702, -0.05041276494305191, -0.16615582754793787, 0.06840501612733438, 0.398630687355328, -0.21767677592700904, -0.2822919816174892, 0.0537193715337789, -0.2741232371400154, -0.13817962167225084, 0.19054177940698036, -0.09904593449614163, 0.046986568070176656, 0.05844948391183349, -0.029595146339461417, -0.025469104109554372, -0.27030731979088596, 0.26015127732404575, 0.11713189584265615, 0.404594074357857, 0.09516305944303732, -0.005538015135515259, 0.004655959866523965, -0.021874174489570197, -0.009948394826001752, -0.12985573683273735, 0.0891679479126339, 0.35760257680163676, 0.1700654925688156, 0.26853281971233994, -0.4669217207927757, -0.23480062621103517, 0.07419150165124073, 0.15739603637224203, 0.040098808832647305, -0.05104111128750799, -0.23043430919251615, 0.12664761498992666, -0.2163081872415965, -0.05488483335832812, -0.03116818722823996, -0.025414959050596816, 0.12127200930393231, -0.3190599852867091, 0.040640439130991364, 0.013925633989205, 0.03636113924683252, -0.02466680739544516, -0.12508372906873474, 0.01986130835043628, 0.173333154172018, 0.04817470455535257, -0.03541510451824835, 0.11616299832031242, -0.1431341548815175, -0.1311455685784345, 0.35907727644653686, 0.04277835806498109, -0.17850045116840682, 0.2044958026276957, -0.10599052991523449, -0.1333751296416036, 0.13201612135249455, 0.22365749675742308, 0.05164110823881937, -0.16937478121592484, -0.002569684262062534, 0.04872325875921481, 0.1214265434324234, 0.07984513470880451, 0.1811242546893156, 0.17398422012633796, 0.2163413251409613, 0.09879369184343534, 0.09673432405488983, -0.1010266273393671, -0.11754483273322347, -0.22656860317228666, -0.07267226307581652, -0.12418544333108436, 0.04956377259066412, -0.08337395706654044, -0.07137353302791033, 0.36494544413941565, 0.17649907943529403, 0.1411860778844401, 0.07625566062399311, 0.3833425758656726, 0.09198913558685123, 0.09347486461220837, 0.08429375650465867, 0.21176395146958113, 0.06833290160327816, 0.14722730833064043, -0.20036605352435066, 0.08170550323869866, -0.09083708423670249]
|
1,803.06535
|
Dear Sir or Madam, May I introduce the GYAFC Dataset: Corpus, Benchmarks
and Metrics for Formality Style Transfer
|
Style transfer is the task of automatically transforming a piece of text in
one particular style into another. A major barrier to progress in this field
has been a lack of training and evaluation datasets, as well as benchmarks and
automatic metrics. In this work, we create the largest corpus for a particular
stylistic transfer (formality) and show that techniques from the machine
translation community can serve as strong baselines for future work. We also
discuss challenges of using automatic metrics.
|
cs.CL
|
style transfer is the task of automatically transforming a piece of text in one particular style into another a major barrier to progress in this field has been a lack of training and evaluation datasets as well as benchmarks and automatic metrics in this work we create the largest corpus for a particular stylistic transfer formality and show that techniques from the machine translation community can serve as strong baselines for future work we also discuss challenges of using automatic metrics
|
[['style', 'transfer', 'is', 'the', 'task', 'of', 'automatically', 'transforming', 'a', 'piece', 'of', 'text', 'in', 'one', 'particular', 'style', 'into', 'another', 'a', 'major', 'barrier', 'to', 'progress', 'in', 'this', 'field', 'has', 'been', 'a', 'lack', 'of', 'training', 'and', 'evaluation', 'datasets', 'as', 'well', 'as', 'benchmarks', 'and', 'automatic', 'metrics', 'in', 'this', 'work', 'we', 'create', 'the', 'largest', 'corpus', 'for', 'a', 'particular', 'stylistic', 'transfer', 'formality', 'and', 'show', 'that', 'techniques', 'from', 'the', 'machine', 'translation', 'community', 'can', 'serve', 'as', 'strong', 'baselines', 'for', 'future', 'work', 'we', 'also', 'discuss', 'challenges', 'of', 'using', 'automatic', 'metrics']]
|
[-0.0556630772124562, -0.01599605962128183, -0.06962204986700306, 0.08803150901013272, -0.139848392393532, -0.11785002222951547, 0.02923420460227831, 0.4461220760404328, -0.2572798819890545, -0.34042108576905766, 0.1216084274339754, -0.2745528786247711, -0.1672216294632282, 0.2549770010382305, -0.12436463112402478, 0.06592513347726552, 0.15770035086452594, 0.0347527519190385, -0.06077740461864497, -0.23283272060381685, 0.3656074903261514, 0.0332203370484489, 0.3408877029325123, 0.12431571686663377, 0.10775441703398103, -0.04534578211260615, -0.0361790134554246, -0.014548894683370528, -0.0467483267637385, 0.16994476608679066, 0.328910503614073, 0.2197694770940062, 0.3387311737133581, -0.3472228969711764, -0.19716680126931566, 0.09019080282729348, 0.16011530855371628, 0.17753860228109306, -0.09095739131724392, -0.30316200109635605, 0.08939518320681757, -0.19559345818642113, -0.006475480261868165, -0.1487734571651176, 0.03293112440201466, -0.004762554087066724, -0.23854661617933967, -0.01470544052139258, 0.13263013997017464, 0.12192739644892697, -0.02877237362338713, -0.11576231469020799, 0.030449753483458433, 0.2475141469090257, 0.10821880979382974, 0.11296070868402351, 0.10157007523122485, -0.18921614912508147, -0.1936883676889134, 0.4075780564022285, -0.11187965685018787, -0.20611973495774524, 0.17540334044369282, -0.004168438725173473, -0.1800858121721741, 0.008022860577904883, 0.22585329451356773, 0.10792675216532784, -0.16301006561628095, 0.04210436988958261, -0.042944726867624274, 0.18472823101659247, 0.08494264059872539, -0.02249911829346308, 0.21646045697967947, 0.2624313300303011, 0.013765604338712163, 0.1675935245728419, -0.07755167956785931, -0.03156235799147391, -0.25709708080983457, -0.2171182252558661, -0.1492754519905573, 0.010699106334352199, -0.027166319406845746, -0.16056499570424174, 0.4130641548480425, 0.2127821159342097, 0.1881305203301671, 0.05186582231365236, 0.3370730799197415, 0.001797345123414732, 0.1373850783724108, 0.04354265470698729, 0.17857554089996597, -0.0012536042105452513, 0.16529779949076015, -0.12635310500268077, 0.07548614198135005, 0.03482367407622529]
|
1,803.06536
|
Optimal Design of Experiments for Nonlinear Response Surface Models
|
Many chemical and biological experiments involve multiple treatment factors
and often it is convenient to fit a nonlinear model in these factors. This
nonlinear model can be mechanistic, empirical or a hybrid of the two. Motivated
by experiments in chemical engineering, we focus on D-optimal design for
multifactor nonlinear response surfaces in general. In order to find and study
optimal designs, we first implement conventional point and coordinate exchange
algorithms. Next, we develop a novel multiphase optimisation method to
construct D-optimal designs with improved properties. The benefits of this
method are demonstrated by application to two experiments involving nonlinear
regression models. The designs obtained are shown to be considerably more
informative than designs obtained using traditional design optimality
algorithms.
|
stat.CO stat.AP
|
many chemical and biological experiments involve multiple treatment factors and often it is convenient to fit a nonlinear model in these factors this nonlinear model can be mechanistic empirical or a hybrid of the two motivated by experiments in chemical engineering we focus on doptimal design for multifactor nonlinear response surfaces in general in order to find and study optimal designs we first implement conventional point and coordinate exchange algorithms next we develop a novel multiphase optimisation method to construct doptimal designs with improved properties the benefits of this method are demonstrated by application to two experiments involving nonlinear regression models the designs obtained are shown to be considerably more informative than designs obtained using traditional design optimality algorithms
|
[['many', 'chemical', 'and', 'biological', 'experiments', 'involve', 'multiple', 'treatment', 'factors', 'and', 'often', 'it', 'is', 'convenient', 'to', 'fit', 'a', 'nonlinear', 'model', 'in', 'these', 'factors', 'this', 'nonlinear', 'model', 'can', 'be', 'mechanistic', 'empirical', 'or', 'a', 'hybrid', 'of', 'the', 'two', 'motivated', 'by', 'experiments', 'in', 'chemical', 'engineering', 'we', 'focus', 'on', 'doptimal', 'design', 'for', 'multifactor', 'nonlinear', 'response', 'surfaces', 'in', 'general', 'in', 'order', 'to', 'find', 'and', 'study', 'optimal', 'designs', 'we', 'first', 'implement', 'conventional', 'point', 'and', 'coordinate', 'exchange', 'algorithms', 'next', 'we', 'develop', 'a', 'novel', 'multiphase', 'optimisation', 'method', 'to', 'construct', 'doptimal', 'designs', 'with', 'improved', 'properties', 'the', 'benefits', 'of', 'this', 'method', 'are', 'demonstrated', 'by', 'application', 'to', 'two', 'experiments', 'involving', 'nonlinear', 'regression', 'models', 'the', 'designs', 'obtained', 'are', 'shown', 'to', 'be', 'considerably', 'more', 'informative', 'than', 'designs', 'obtained', 'using', 'traditional', 'design', 'optimality', 'algorithms']]
|
[-0.047948749831822866, 0.017515008427797497, -0.06253809963564287, 0.07332200990004677, -0.10629794672679375, -0.191354403886631, 0.02979192738773442, 0.4530735213716491, -0.24496110181222444, -0.30253041733619795, 0.1138481624080103, -0.21814243727903657, -0.2671466286571994, 0.2638445778636403, -0.056919017010329274, 0.12648582214317403, 0.04878131948614947, -0.06877166599410922, -0.08280010080011953, -0.26182536973359705, 0.2706859169621803, 0.053703750029769765, 0.3237220456964579, -0.015240079339812784, 0.07455208191663779, -0.013798439084794842, -0.04027554449946189, 0.04478566663950181, -0.14484975081985862, 0.1617635100563409, 0.3218240529594284, 0.12835426325322824, 0.30834350287288176, -0.4498680261347224, -0.24726225002160093, 0.09793245333771244, 0.08785627167593657, 0.12070409696893532, -0.058319347941521126, -0.21846071849068424, 0.04655145389661819, -0.1590887337116947, -0.10445974407005398, -0.17309200551513457, -0.09117626138970632, 0.034436624917835626, -0.37163899532135797, 0.031053906547281296, 0.01926613277354583, 0.04297336740341006, -0.02817767343538649, -0.16864841631241925, 0.05820113181786126, 0.06997960925634418, 0.009888559282452119, -0.04590223394060398, 0.12600448749129886, -0.09790545693371727, -0.17968983357349613, 0.37620811809261306, -0.015588855577907682, -0.25799183672716636, 0.20332978716699265, -0.05012730455824307, -0.13004219041307682, 0.11030457899397035, 0.24931649743587153, 0.1178482423747788, -0.21298155263692392, 0.017495164888355286, 0.015611336112585888, 0.1437510437493021, 0.01880713032769869, -0.01949423663621424, 0.13941079901899173, 0.23036361635200867, 0.05363169385212231, 0.14888757992997578, -0.009077418456636682, -0.11872620085457794, -0.23458943536804458, -0.11952139635985139, -0.1196348226018751, -9.310256079340182e-05, -0.07865122930653502, -0.13935196658028015, 0.3892143104507142, 0.18748031708826662, 0.1616268600063289, 0.03508126266895473, 0.3155972066984958, 0.09657679987335656, 0.07314546014957067, 0.04300913265945405, 0.23372166827634103, 0.07175625522793153, 0.05432917952474927, -0.19036511541931195, 0.053919650931224354, 0.04450130702202803]
|
1,803.06537
|
Renormalization of the Hutchinson Operator
|
One of the easiest and common ways of generating fractal sets in ${\mathbb
R}^D$ is as attractors of affine iterated function systems (IFS). The classic
theory of IFS's requires that they are made with contractive functions. In this
paper, we relax this hypothesis considering a new operator $H_\rho$ obtained by
renormalizing the usual Hutchinson operator $H$. Namely, the $H_\rho$-orbit of
a given compact set $K_0$ is built from the original sequence
$\big(H^n(K_0)\big)_n$ by rescaling each set by its distance from $0$. We state
several results for the convergence of these orbits and give a geometrical
description of the corresponding limit sets. In particular, it provides a way
to construct some eigensets for $H$. Our strategy to tackle the problem is to
link these new sequences to some classic ones but it will depend on whether the
IFS is strictly linear or not. We illustrate the different results with various
detailed examples. Finally, we discuss some possible generalizations.
|
math.DS
|
one of the easiest and common ways of generating fractal sets in mathbb rd is as attractors of affine iterated function systems ifs the classic theory of ifss requires that they are made with contractive functions in this paper we relax this hypothesis considering a new operator h_rho obtained by renormalizing the usual hutchinson operator h namely the h_rhoorbit of a given compact set k_0 is built from the original sequence bighnk_0big_n by rescaling each set by its distance from 0 we state several results for the convergence of these orbits and give a geometrical description of the corresponding limit sets in particular it provides a way to construct some eigensets for h our strategy to tackle the problem is to link these new sequences to some classic ones but it will depend on whether the ifs is strictly linear or not we illustrate the different results with various detailed examples finally we discuss some possible generalizations
|
[['one', 'of', 'the', 'easiest', 'and', 'common', 'ways', 'of', 'generating', 'fractal', 'sets', 'in', 'mathbb', 'rd', 'is', 'as', 'attractors', 'of', 'affine', 'iterated', 'function', 'systems', 'ifs', 'the', 'classic', 'theory', 'of', 'ifss', 'requires', 'that', 'they', 'are', 'made', 'with', 'contractive', 'functions', 'in', 'this', 'paper', 'we', 'relax', 'this', 'hypothesis', 'considering', 'a', 'new', 'operator', 'h_rho', 'obtained', 'by', 'renormalizing', 'the', 'usual', 'hutchinson', 'operator', 'h', 'namely', 'the', 'h_rhoorbit', 'of', 'a', 'given', 'compact', 'set', 'k_0', 'is', 'built', 'from', 'the', 'original', 'sequence', 'bighnk_0big_n', 'by', 'rescaling', 'each', 'set', 'by', 'its', 'distance', 'from', '0', 'we', 'state', 'several', 'results', 'for', 'the', 'convergence', 'of', 'these', 'orbits', 'and', 'give', 'a', 'geometrical', 'description', 'of', 'the', 'corresponding', 'limit', 'sets', 'in', 'particular', 'it', 'provides', 'a', 'way', 'to', 'construct', 'some', 'eigensets', 'for', 'h', 'our', 'strategy', 'to', 'tackle', 'the', 'problem', 'is', 'to', 'link', 'these', 'new', 'sequences', 'to', 'some', 'classic', 'ones', 'but', 'it', 'will', 'depend', 'on', 'whether', 'the', 'ifs', 'is', 'strictly', 'linear', 'or', 'not', 'we', 'illustrate', 'the', 'different', 'results', 'with', 'various', 'detailed', 'examples', 'finally', 'we', 'discuss', 'some', 'possible', 'generalizations']]
|
[-0.10750949171420138, 0.07805953103695186, -0.0930928975077612, 0.08108881881684307, -0.0768635414764527, -0.12201419611032084, 0.03692086584421552, 0.35465667355660496, -0.31305990209984413, -0.22425141115975264, 0.12616415517389556, -0.27711455716884564, -0.17251572290635003, 0.22713627991744306, -0.09217198604155429, 0.060762152185001375, 0.05201828436526869, 0.05637704045284999, -0.07241577620719342, -0.27514220475424805, 0.3984386110466651, -0.002231545135523979, 0.19302123716832803, 0.007814397711863185, 0.07676570887024237, -0.004950606137175451, -0.04788700935382444, 0.03967825229984236, -0.17088939225953714, 0.12863409683915678, 0.20345331807983677, 0.17782345627640167, 0.28184718997580566, -0.3742564863876089, -0.16618931285625735, 0.14138736985260983, 0.1267342599390026, 0.06999710445101796, -0.029047114141481964, -0.2741148901389694, 0.09936063990069481, -0.11512554971449827, -0.15791190706810296, -0.09777126280445751, 0.01808602404296882, 0.05301833485990956, -0.27092094725155114, 0.005032733557503912, 0.10144643438828795, 0.03757077909086819, -0.05225772911443847, -0.11945231339150386, -0.001664823467704141, 0.11722141510486457, 0.02716889066694232, 0.0545983531500225, 0.0954695773891524, -0.06431093283886598, -0.12010513847639373, 0.37137861335166283, -0.0392070345806605, -0.25019325427227207, 0.22338663612480286, -0.14575989786898355, -0.16438142426898583, 0.07670886063186283, 0.09776866515529911, 0.10792845424700093, -0.15216432161048635, 0.11735976457689562, -0.08553189413573642, 0.11145171300544367, 0.07902926324213577, 0.04060281495648352, 0.1504684553917062, 0.12251389630149458, 0.10813554067711963, 0.1667158135557668, -0.017173668652373766, -0.08115395087205998, -0.3433079266461072, -0.1207288528955844, -0.15640298697444333, 0.08112461722084373, -0.10241453326893094, -0.17736129065319386, 0.3887169334459929, 0.133999909020283, 0.22856445067755685, 0.09405699657735886, 0.24568896828364437, 0.12119495287532284, 0.035874431340897746, 0.042049205184660175, 0.17500877873624324, 0.10681697880764576, 0.042097623922632305, -0.14576995102749146, 0.017347362167625266, 0.12646349160871528]
|
1,803.06538
|
Interaction between stimulated current injection and polariton
condensate
|
In this paper, we see a strong effect of the injected current on the light
emission from the polariton condensate in an n-i-n structure, when we monitor
the luminescence intensity under applied bias at various pump powers. We
present here three thresholds for nonlinear increase of the intensity. We show
that small changes of the incoherent injected current lead to stimulated
enhancement of the coherent light emission from free carriers. We conclude that
the polariton condensate-current system is a highly nonlinear electro-optical
system.
|
cond-mat.mes-hall
|
in this paper we see a strong effect of the injected current on the light emission from the polariton condensate in an nin structure when we monitor the luminescence intensity under applied bias at various pump powers we present here three thresholds for nonlinear increase of the intensity we show that small changes of the incoherent injected current lead to stimulated enhancement of the coherent light emission from free carriers we conclude that the polariton condensatecurrent system is a highly nonlinear electrooptical system
|
[['in', 'this', 'paper', 'we', 'see', 'a', 'strong', 'effect', 'of', 'the', 'injected', 'current', 'on', 'the', 'light', 'emission', 'from', 'the', 'polariton', 'condensate', 'in', 'an', 'nin', 'structure', 'when', 'we', 'monitor', 'the', 'luminescence', 'intensity', 'under', 'applied', 'bias', 'at', 'various', 'pump', 'powers', 'we', 'present', 'here', 'three', 'thresholds', 'for', 'nonlinear', 'increase', 'of', 'the', 'intensity', 'we', 'show', 'that', 'small', 'changes', 'of', 'the', 'incoherent', 'injected', 'current', 'lead', 'to', 'stimulated', 'enhancement', 'of', 'the', 'coherent', 'light', 'emission', 'from', 'free', 'carriers', 'we', 'conclude', 'that', 'the', 'polariton', 'condensatecurrent', 'system', 'is', 'a', 'highly', 'nonlinear', 'electrooptical', 'system']]
|
[-0.12391177770431812, 0.18027430167013536, -0.06537555162681312, 0.03898703373355291, 0.009026035922011587, -0.08405771463109953, 0.04643029987772291, 0.4432736385341098, -0.29394005959081215, -0.23620831076532783, 0.009882735954484016, -0.2963666527009592, -0.13666364145692347, 0.25186781252439067, -0.023236413929248002, 0.00015739181147115988, 0.014646847346206991, -0.038601159561062005, 0.018657139485429335, -0.19360043128339074, 0.3344294228363873, 0.011452922881467313, 0.3529343345577306, 0.11130774643757699, 0.11427783955274741, -0.0010046272754396608, 0.04665057253228819, -0.020705246116693426, -0.07015899230996515, 0.08029508937610577, 0.19199416965882227, 0.02557484521076265, 0.23384805398754685, -0.4576838534927314, -0.21851093457193999, 0.08863017729642551, 0.15357666516643892, 0.1711917165326091, -0.09942626337827433, -0.26699482754054593, 0.027198800831328987, -0.14505654598427256, -0.117351328079566, -0.011116056884752541, 0.001820181791738766, 0.03937728325382057, -0.24993414743931214, 0.05185353271833553, 0.06513651711695896, 0.04719167458443269, -0.07506122889860374, -0.042735986738102284, -0.025324015297484015, 0.06479613702615053, 0.01990709374034096, -0.0016412063070186755, 0.17959126569444267, -0.1707359556443762, -0.06582535594338323, 0.3251075721005114, -0.15916641726635578, -0.10461762398708521, 0.13235772197793533, -0.20485026031596268, -0.06334316750942934, 0.20019191856178023, 0.21032232976456106, 0.11170752603197243, -0.09642549950459818, 0.0032381578746092754, -0.011213287188694245, 0.22404644291893375, 0.06344721593507906, 0.12090825576834925, 0.22977430715577724, 0.1788972050104881, 0.055676002566498226, 0.19531642203787114, -0.15317460210005776, -0.0014722628132780877, -0.28994593719338496, -0.10351683684374864, -0.13743406174159267, 0.1114931734869393, -0.01817986087464705, -0.11956006841643191, 0.4605192190615415, 0.21676254856241187, 0.16645200741363736, -0.009602144792130807, 0.31172049095536153, 0.20232140723639044, 0.02408977650196814, 0.03690790180003316, 0.2998367189543276, 0.10997234361541526, 0.11396783004832886, -0.3246585102751851, 0.02170933242432955, -0.07096741060022174]
|
1,803.06539
|
The Graph Structure of Chebyshev Polynomials over Finite Fields and
Applications
|
We completely describe the functional graph associated to iterations of
Chebyshev polynomials over finite fields. Then, we use our structural results
to obtain estimates for the average rho length, average number of connected
components and the expected value for the period and preperiod of iterating
Chebyshev polynomials.
|
cs.DM math.CO
|
we completely describe the functional graph associated to iterations of chebyshev polynomials over finite fields then we use our structural results to obtain estimates for the average rho length average number of connected components and the expected value for the period and preperiod of iterating chebyshev polynomials
|
[['we', 'completely', 'describe', 'the', 'functional', 'graph', 'associated', 'to', 'iterations', 'of', 'chebyshev', 'polynomials', 'over', 'finite', 'fields', 'then', 'we', 'use', 'our', 'structural', 'results', 'to', 'obtain', 'estimates', 'for', 'the', 'average', 'rho', 'length', 'average', 'number', 'of', 'connected', 'components', 'and', 'the', 'expected', 'value', 'for', 'the', 'period', 'and', 'preperiod', 'of', 'iterating', 'chebyshev', 'polynomials']]
|
[-0.1714058856658162, 0.10367545728234852, -0.09809085463193502, 0.025217495224577315, -0.07287796186481385, -0.056456133822335844, 0.09088183792823172, 0.34813008199822393, -0.3254308778634097, -0.24228383353019647, 0.10925247993795796, -0.26399852335453033, -0.1281996470271669, 0.20635626865848106, -0.04390071855580553, 0.057086210668166264, 0.049637508231829455, 0.1167345627884757, -0.11426268062217439, -0.3343783157234863, 0.2936549401505196, 0.004996357029898369, 0.16488390251439303, 0.012320284028240341, 0.12628180025383196, 0.011890464660493618, -0.0483253472317456, 0.011763295990989563, -0.17589835268742543, 0.12331070624133374, 0.2667084761518747, 0.12537186305494386, 0.23476197142550287, -0.3935003554091809, -0.1159063975544686, 0.17759615369141102, 0.144200214680205, 0.021144310170982745, 0.05695246385925628, -0.2223431669928609, 0.12768543813813557, -0.13982867354903608, -0.17395788163660056, -0.09172903104348386, 0.03910937032444363, 0.12335454940082545, -0.31750371150593176, 0.06593066866093493, 0.006921413040006573, 0.0975001251840211, -0.04463271958198636, -0.18604805002464575, 0.03633166741124017, 0.10712602180726033, 0.018030106070193837, 0.037367109447083574, 0.07747841743316422, -0.09076794256713797, -0.07023762468684544, 0.28428860400070216, -0.06759921673368266, -0.17374014565126694, 0.11371028019075698, -0.13248778800380992, -0.14132229381419242, 0.13135234061430426, 0.16363338612891892, 0.12255314465096974, -0.047443889358893356, 0.04723874273204661, -0.04806947153299413, 0.1813894002599285, 0.11373748950798937, 0.033533349217094006, 0.086391951720369, 0.02248028314042653, 0.11248986599233096, 0.16426676023810943, -0.04647053602929326, -0.09521714512734337, -0.2903594901349316, -0.17795800770375322, -0.2166150901912454, 0.029306097768564174, -0.21554904887787105, -0.17904852970721238, 0.4644933216115262, 0.13532101612617362, 0.18230653138078273, 0.1910723530231638, 0.23150294628539222, 0.1639247880183517, 0.046999253678455095, 0.1128511614106754, 0.10711673607534551, 0.23301558516810628, 0.01161760825693528, -0.21298440716704947, 0.03146368791250155, 0.17577194328360418]
|
1,803.0654
|
Learning over Knowledge-Base Embeddings for Recommendation
|
State-of-the-art recommendation algorithms -- especially the collaborative
filtering (CF) based approaches with shallow or deep models -- usually work
with various unstructured information sources for recommendation, such as
textual reviews, visual images, and various implicit or explicit feedbacks.
Though structured knowledge bases were considered in content-based approaches,
they have been largely neglected recently due to the availability of vast
amount of data, and the learning power of many complex models.
However, structured knowledge bases exhibit unique advantages in personalized
recommendation systems. When the explicit knowledge about users and items is
considered for recommendation, the system could provide highly customized
recommendations based on users' historical behaviors. A great challenge for
using knowledge bases for recommendation is how to integrated large-scale
structured and unstructured data, while taking advantage of collaborative
filtering for highly accurate performance. Recent achievements on knowledge
base embedding sheds light on this problem, which makes it possible to learn
user and item representations while preserving the structure of their
relationship with external knowledge. In this work, we propose to reason over
knowledge base embeddings for personalized recommendation. Specifically, we
propose a knowledge base representation learning approach to embed
heterogeneous entities for recommendation. Experimental results on real-world
dataset verified the superior performance of our approach compared with
state-of-the-art baselines.
|
cs.IR
|
stateoftheart recommendation algorithms especially the collaborative filtering cf based approaches with shallow or deep models usually work with various unstructured information sources for recommendation such as textual reviews visual images and various implicit or explicit feedbacks though structured knowledge bases were considered in contentbased approaches they have been largely neglected recently due to the availability of vast amount of data and the learning power of many complex models however structured knowledge bases exhibit unique advantages in personalized recommendation systems when the explicit knowledge about users and items is considered for recommendation the system could provide highly customized recommendations based on users historical behaviors a great challenge for using knowledge bases for recommendation is how to integrated largescale structured and unstructured data while taking advantage of collaborative filtering for highly accurate performance recent achievements on knowledge base embedding sheds light on this problem which makes it possible to learn user and item representations while preserving the structure of their relationship with external knowledge in this work we propose to reason over knowledge base embeddings for personalized recommendation specifically we propose a knowledge base representation learning approach to embed heterogeneous entities for recommendation experimental results on realworld dataset verified the superior performance of our approach compared with stateoftheart baselines
|
[['stateoftheart', 'recommendation', 'algorithms', 'especially', 'the', 'collaborative', 'filtering', 'cf', 'based', 'approaches', 'with', 'shallow', 'or', 'deep', 'models', 'usually', 'work', 'with', 'various', 'unstructured', 'information', 'sources', 'for', 'recommendation', 'such', 'as', 'textual', 'reviews', 'visual', 'images', 'and', 'various', 'implicit', 'or', 'explicit', 'feedbacks', 'though', 'structured', 'knowledge', 'bases', 'were', 'considered', 'in', 'contentbased', 'approaches', 'they', 'have', 'been', 'largely', 'neglected', 'recently', 'due', 'to', 'the', 'availability', 'of', 'vast', 'amount', 'of', 'data', 'and', 'the', 'learning', 'power', 'of', 'many', 'complex', 'models', 'however', 'structured', 'knowledge', 'bases', 'exhibit', 'unique', 'advantages', 'in', 'personalized', 'recommendation', 'systems', 'when', 'the', 'explicit', 'knowledge', 'about', 'users', 'and', 'items', 'is', 'considered', 'for', 'recommendation', 'the', 'system', 'could', 'provide', 'highly', 'customized', 'recommendations', 'based', 'on', 'users', 'historical', 'behaviors', 'a', 'great', 'challenge', 'for', 'using', 'knowledge', 'bases', 'for', 'recommendation', 'is', 'how', 'to', 'integrated', 'largescale', 'structured', 'and', 'unstructured', 'data', 'while', 'taking', 'advantage', 'of', 'collaborative', 'filtering', 'for', 'highly', 'accurate', 'performance', 'recent', 'achievements', 'on', 'knowledge', 'base', 'embedding', 'sheds', 'light', 'on', 'this', 'problem', 'which', 'makes', 'it', 'possible', 'to', 'learn', 'user', 'and', 'item', 'representations', 'while', 'preserving', 'the', 'structure', 'of', 'their', 'relationship', 'with', 'external', 'knowledge', 'in', 'this', 'work', 'we', 'propose', 'to', 'reason', 'over', 'knowledge', 'base', 'embeddings', 'for', 'personalized', 'recommendation', 'specifically', 'we', 'propose', 'a', 'knowledge', 'base', 'representation', 'learning', 'approach', 'to', 'embed', 'heterogeneous', 'entities', 'for', 'recommendation', 'experimental', 'results', 'on', 'realworld', 'dataset', 'verified', 'the', 'superior', 'performance', 'of', 'our', 'approach', 'compared', 'with', 'stateoftheart', 'baselines']]
|
[-0.031703826647413814, -0.04928909933558949, -0.034145125203680446, 0.0616266132660822, -0.21310770875720333, -0.16958534728695193, 0.055218422903503844, 0.4812788868093512, -0.24227260813063037, -0.3633329731084357, 0.07055422325839937, -0.32365919091791623, -0.19024136509737316, 0.1941747629839549, -0.11164663842505806, 0.06353947998964844, 0.13536555045914211, 0.07686166325373156, -0.08281369324731933, -0.31525314602649945, 0.33916980931805313, 0.05862789676546632, 0.38730800745711813, 0.04685229986933046, 0.11684181119747244, 0.001451929132476593, -0.12190435261686067, -0.033868656836783036, -0.04411334383800842, 0.21804206669026904, 0.40885971781870395, 0.22962965135314112, 0.3229431878586394, -0.4190069423034643, -0.2592484939546473, 0.05769088390116818, 0.16800465403492496, 0.10203490527695414, -0.10017678464632392, -0.3411221901980647, 0.06995385786482461, -0.20435831959219874, 0.010362298164718025, -0.1694867368326365, -0.015330546923040228, 0.010684222510480434, -0.30293379753860666, -0.007918562179944221, 0.09773519072807642, 0.0917394163293971, -0.05620625785159415, -0.1653304939662446, 0.0690154964239269, 0.19890890632610395, 0.04517937557555843, -0.014903798256213394, 0.12192707100730156, -0.18197100547002854, -0.1696073073755437, 0.4020729693561648, -0.03615856743395184, -0.23999383101118324, 0.20050948101617755, -0.0009513931699853013, -0.1510200326843862, 0.10801901481145822, 0.26040057985984905, 0.09760811238590142, -0.1772692357443733, 0.02057242045344353, -0.039188835562931165, 0.2046879976644779, 0.025541490423020678, 0.044625768422234605, 0.19655578233895526, 0.2638769923284164, 0.023735207099195316, 0.03885992793343817, -0.017814746596692986, -0.11409316606316851, -0.10868318528521824, -0.09807211413785787, -0.17280322389906624, 0.015052039249336733, -0.10813328869389718, -0.14058941809280837, 0.36437356363810997, 0.24310489040282038, 0.16432800920509197, 0.051654327457775207, 0.3828354710083149, -0.014136274558928422, 0.09085132866301507, 0.09543315255069647, 0.1408989567468213, -0.004435999054632685, 0.1738298395620479, -0.11338325938747539, 0.13921995598267187, 0.006869496968867266]
|
1,803.06541
|
Adaptive strategy for superpixel-based region-growing image segmentation
|
This work presents a region-growing image segmentation approach based on
superpixel decomposition. From an initial contour-constrained over-segmentation
of the input image, the image segmentation is achieved by iteratively merging
similar superpixels into regions. This approach raises two key issues: (1) how
to compute the similarity between superpixels in order to perform accurate
merging and (2) in which order those superpixels must be merged together. In
this perspective, we firstly introduce a robust adaptive multi-scale superpixel
similarity in which region comparisons are made both at content and common
border level. Secondly, we propose a global merging strategy to efficiently
guide the region merging process. Such strategy uses an adpative merging
criterion to ensure that best region aggregations are given highest priorities.
This allows to reach a final segmentation into consistent regions with strong
boundary adherence. We perform experiments on the BSDS500 image dataset to
highlight to which extent our method compares favorably against other
well-known image segmentation algorithms. The obtained results demonstrate the
promising potential of the proposed approach.
|
cs.CV
|
this work presents a regiongrowing image segmentation approach based on superpixel decomposition from an initial contourconstrained oversegmentation of the input image the image segmentation is achieved by iteratively merging similar superpixels into regions this approach raises two key issues 1 how to compute the similarity between superpixels in order to perform accurate merging and 2 in which order those superpixels must be merged together in this perspective we firstly introduce a robust adaptive multiscale superpixel similarity in which region comparisons are made both at content and common border level secondly we propose a global merging strategy to efficiently guide the region merging process such strategy uses an adpative merging criterion to ensure that best region aggregations are given highest priorities this allows to reach a final segmentation into consistent regions with strong boundary adherence we perform experiments on the bsds500 image dataset to highlight to which extent our method compares favorably against other wellknown image segmentation algorithms the obtained results demonstrate the promising potential of the proposed approach
|
[['this', 'work', 'presents', 'a', 'regiongrowing', 'image', 'segmentation', 'approach', 'based', 'on', 'superpixel', 'decomposition', 'from', 'an', 'initial', 'contourconstrained', 'oversegmentation', 'of', 'the', 'input', 'image', 'the', 'image', 'segmentation', 'is', 'achieved', 'by', 'iteratively', 'merging', 'similar', 'superpixels', 'into', 'regions', 'this', 'approach', 'raises', 'two', 'key', 'issues', '1', 'how', 'to', 'compute', 'the', 'similarity', 'between', 'superpixels', 'in', 'order', 'to', 'perform', 'accurate', 'merging', 'and', '2', 'in', 'which', 'order', 'those', 'superpixels', 'must', 'be', 'merged', 'together', 'in', 'this', 'perspective', 'we', 'firstly', 'introduce', 'a', 'robust', 'adaptive', 'multiscale', 'superpixel', 'similarity', 'in', 'which', 'region', 'comparisons', 'are', 'made', 'both', 'at', 'content', 'and', 'common', 'border', 'level', 'secondly', 'we', 'propose', 'a', 'global', 'merging', 'strategy', 'to', 'efficiently', 'guide', 'the', 'region', 'merging', 'process', 'such', 'strategy', 'uses', 'an', 'adpative', 'merging', 'criterion', 'to', 'ensure', 'that', 'best', 'region', 'aggregations', 'are', 'given', 'highest', 'priorities', 'this', 'allows', 'to', 'reach', 'a', 'final', 'segmentation', 'into', 'consistent', 'regions', 'with', 'strong', 'boundary', 'adherence', 'we', 'perform', 'experiments', 'on', 'the', 'bsds500', 'image', 'dataset', 'to', 'highlight', 'to', 'which', 'extent', 'our', 'method', 'compares', 'favorably', 'against', 'other', 'wellknown', 'image', 'segmentation', 'algorithms', 'the', 'obtained', 'results', 'demonstrate', 'the', 'promising', 'potential', 'of', 'the', 'proposed', 'approach']]
|
[-0.015407566047071603, -0.02256196460820572, -0.11493430624600971, 0.07302417192986688, -0.08540274886167552, -0.1161990589630532, 0.05252528915754014, 0.45796092622071866, -0.2510878542053839, -0.3484815115232514, 0.08242553625261434, -0.2546830641692932, -0.13507806642418616, 0.13554071896451425, -0.11319910355262228, 0.07134301633243056, 0.13934339433263268, 0.034914826895727454, -0.04908887954872012, -0.263038032472201, 0.31752303403981746, 0.06005520801935121, 0.3534873333557632, 0.0021060460916136853, 0.11394863354924228, -0.04122420598006617, -0.08220612167111452, 0.020723239507481277, -0.11249475018563997, 0.15899145357866198, 0.29441967604300345, 0.17492694017920554, 0.31755132623948157, -0.4069777117391308, -0.17322254859904074, 0.031157302854797266, 0.18252665404768953, 0.10204307162076662, -0.06807606567415488, -0.35195729487957095, 0.12718267650175166, -0.1319673671148695, -0.021830934000268847, -0.12347574432728341, -0.06541791311391568, -0.047461166471545864, -0.31222997463858093, 0.06160720210965633, 0.0433052845568542, -0.026990384993940054, -0.08562922672717832, -0.10986056937611695, 0.018210499792875923, 0.17363576568713612, -0.016244637548638766, 0.09633742740846951, 0.14311765377263885, -0.1408332110893161, -0.12170175464083273, 0.35342088527977467, -0.0024192434614973076, -0.19703107749193302, 0.22871872690977552, -0.061418738523329866, -0.15350602639850275, 0.1342192552886456, 0.1795130247469004, 0.1317771578387144, -0.12444036154929235, -0.054471000532496226, -0.012914865633265216, 0.1771772107760231, 0.06472250511056284, -0.031111928122398633, 0.20514748584204184, 0.22771045275548674, 0.0919768640796755, 0.17753497292729464, -0.1637005687327298, -0.06401118865315185, -0.24652979960789587, -0.09819467397221204, -0.14974371771081293, -0.0934226926940729, -0.10960830932084038, -0.134951895675117, 0.39309585489141924, 0.2504202032977917, 0.25006872965079024, 0.03940341990589759, 0.3703055039114117, 0.03608793265632275, 0.09069586599088576, 0.050586787879983164, 0.19157385305888636, 0.02869483006484133, 0.05703011197767344, -0.17150842129808277, 0.06089550537879141, 0.14943652482512576]
|
1,803.06542
|
Convolutional Point-set Representation: A Convolutional Bridge Between a
Densely Annotated Image and 3D Face Alignment
|
We present a robust method for estimating the facial pose and shape
information from a densely annotated facial image. The method relies on
Convolutional Point-set Representation (CPR), a carefully designed matrix
representation to summarize different layers of information encoded in the set
of detected points in the annotated image. The CPR disentangles the
dependencies of shape and different pose parameters and enables updating
different parameters in a sequential manner via convolutional neural networks
and recurrent layers. When updating the pose parameters, we sample reprojection
errors along with a predicted direction and update the parameters based on the
pattern of reprojection errors. This technique boosts the model's capability in
searching a local minimum under challenging scenarios. We also demonstrate that
annotation from different sources can be merged under the framework of CPR and
contributes to outperforming the current state-of-the-art solutions for 3D face
alignment. Experiments indicate the proposed CPRFA (CPR-based Face Alignment)
significantly improves 3D alignment accuracy when the densely annotated image
contains noise and missing values, which is common under "in-the-wild"
acquisition scenarios.
|
cs.CV cs.GR
|
we present a robust method for estimating the facial pose and shape information from a densely annotated facial image the method relies on convolutional pointset representation cpr a carefully designed matrix representation to summarize different layers of information encoded in the set of detected points in the annotated image the cpr disentangles the dependencies of shape and different pose parameters and enables updating different parameters in a sequential manner via convolutional neural networks and recurrent layers when updating the pose parameters we sample reprojection errors along with a predicted direction and update the parameters based on the pattern of reprojection errors this technique boosts the models capability in searching a local minimum under challenging scenarios we also demonstrate that annotation from different sources can be merged under the framework of cpr and contributes to outperforming the current stateoftheart solutions for 3d face alignment experiments indicate the proposed cprfa cprbased face alignment significantly improves 3d alignment accuracy when the densely annotated image contains noise and missing values which is common under inthewild acquisition scenarios
|
[['we', 'present', 'a', 'robust', 'method', 'for', 'estimating', 'the', 'facial', 'pose', 'and', 'shape', 'information', 'from', 'a', 'densely', 'annotated', 'facial', 'image', 'the', 'method', 'relies', 'on', 'convolutional', 'pointset', 'representation', 'cpr', 'a', 'carefully', 'designed', 'matrix', 'representation', 'to', 'summarize', 'different', 'layers', 'of', 'information', 'encoded', 'in', 'the', 'set', 'of', 'detected', 'points', 'in', 'the', 'annotated', 'image', 'the', 'cpr', 'disentangles', 'the', 'dependencies', 'of', 'shape', 'and', 'different', 'pose', 'parameters', 'and', 'enables', 'updating', 'different', 'parameters', 'in', 'a', 'sequential', 'manner', 'via', 'convolutional', 'neural', 'networks', 'and', 'recurrent', 'layers', 'when', 'updating', 'the', 'pose', 'parameters', 'we', 'sample', 'reprojection', 'errors', 'along', 'with', 'a', 'predicted', 'direction', 'and', 'update', 'the', 'parameters', 'based', 'on', 'the', 'pattern', 'of', 'reprojection', 'errors', 'this', 'technique', 'boosts', 'the', 'models', 'capability', 'in', 'searching', 'a', 'local', 'minimum', 'under', 'challenging', 'scenarios', 'we', 'also', 'demonstrate', 'that', 'annotation', 'from', 'different', 'sources', 'can', 'be', 'merged', 'under', 'the', 'framework', 'of', 'cpr', 'and', 'contributes', 'to', 'outperforming', 'the', 'current', 'stateoftheart', 'solutions', 'for', '3d', 'face', 'alignment', 'experiments', 'indicate', 'the', 'proposed', 'cprfa', 'cprbased', 'face', 'alignment', 'significantly', 'improves', '3d', 'alignment', 'accuracy', 'when', 'the', 'densely', 'annotated', 'image', 'contains', 'noise', 'and', 'missing', 'values', 'which', 'is', 'common', 'under', 'inthewild', 'acquisition', 'scenarios']]
|
[-0.06553889303032462, -0.002856813898454393, -0.03259482168271179, 0.05034227222639915, -0.0723258979694798, -0.1621490861534288, 0.034246483648860314, 0.4499083843057681, -0.27667364948401935, -0.3493286265245481, 0.06270986017961687, -0.2644071576991581, -0.17516059775929355, 0.1695363052565147, -0.1628382089629508, 0.10473345690864691, 0.17840923001303485, 0.025362508695529043, -0.1282407996045044, -0.24252598477276968, 0.2954340778680638, 0.017043553731180945, 0.3699132379863346, -0.017316662341190163, 0.15992170937729683, 0.005938706492013925, -0.05473918797756676, 0.01902416494419003, -0.050991534830245655, 0.18273041706276263, 0.24780982513926064, 0.18813063561023152, 0.2210632556101732, -0.4419563320934366, -0.21439869922574892, 0.05733089409877508, 0.13633772000474365, 0.13312651994924077, -0.04936171940947224, -0.36788782841193746, 0.09555431496493562, -0.10895711122549068, 0.0262076025365781, -0.09541645181387097, -0.021715422706918147, -0.018049598600693613, -0.3281085428030214, 0.07875223392440273, 0.04758344302280692, 0.0667719002636095, -0.06380396398132918, -0.12944542472550308, 0.006843473567567461, 0.19637982515456176, 0.021062017587280414, 0.049948388731722554, 0.1542453352519861, -0.20390169831433289, -0.08842891200216846, 0.34616853546198695, -0.03808962628286201, -0.2633204480799253, 0.1453848673011672, -0.04647423552447244, -0.13816136940061088, 0.12688018463835207, 0.2095157632778524, 0.12523369500903705, -0.16569499549001854, 0.018265652203760845, -0.026767394587136152, 0.22150627985509516, 0.05395791859826215, 0.0020536953632376695, 0.20998580349140872, 0.22306992385634467, 0.04446797720626356, 0.1409729127874271, -0.23731188985045282, -0.0327650621963654, -0.21807009172053976, -0.05718116683896348, -0.17664614187727806, -0.07470180184651189, -0.1259184582724831, -0.146037059585218, 0.46713889584119556, 0.24531068756620875, 0.2531407439117238, 0.08273626416472293, 0.3620206572371399, 0.015766244547183582, 0.1297128063392395, 0.0745657482402323, 0.1797440564014802, 0.008630986491555881, 0.07139683778435864, -0.18945027807623976, 0.13135615628000283, 0.0860993550240732]
|
1,803.06543
|
The parametrix method for parabolic SPDEs
|
We consider the Cauchy problem for a linear stochastic partial differential
equation. By extending the parametrix method for PDEs whose coefficients are
only measurable with respect to the time variable, we prove existence,
regularity in H\"older classes and estimates from above and below of the
fundamental solution. This result is applied to SPDEs by means of the
Ito-Wentzell formula, through a random change of variables which transforms the
SPDE into a PDE with random coefficients.
|
math.PR math.AP
|
we consider the cauchy problem for a linear stochastic partial differential equation by extending the parametrix method for pdes whose coefficients are only measurable with respect to the time variable we prove existence regularity in holder classes and estimates from above and below of the fundamental solution this result is applied to spdes by means of the itowentzell formula through a random change of variables which transforms the spde into a pde with random coefficients
|
[['we', 'consider', 'the', 'cauchy', 'problem', 'for', 'a', 'linear', 'stochastic', 'partial', 'differential', 'equation', 'by', 'extending', 'the', 'parametrix', 'method', 'for', 'pdes', 'whose', 'coefficients', 'are', 'only', 'measurable', 'with', 'respect', 'to', 'the', 'time', 'variable', 'we', 'prove', 'existence', 'regularity', 'in', 'holder', 'classes', 'and', 'estimates', 'from', 'above', 'and', 'below', 'of', 'the', 'fundamental', 'solution', 'this', 'result', 'is', 'applied', 'to', 'spdes', 'by', 'means', 'of', 'the', 'itowentzell', 'formula', 'through', 'a', 'random', 'change', 'of', 'variables', 'which', 'transforms', 'the', 'spde', 'into', 'a', 'pde', 'with', 'random', 'coefficients']]
|
[-0.08968185874206634, 0.05835013946518302, -0.07908541681865851, 0.03475393045693636, -0.11971641346812248, -0.11685206249977152, 0.028185667428188024, 0.2886964107801517, -0.3774998383969069, -0.2230271876238597, 0.17479441239653776, -0.2913823051253955, -0.13371203149358432, 0.2278623649974664, -0.08048360977321863, 0.13775927907476823, 0.03754708278613786, 0.012770749876896541, -0.10285954642420014, -0.21652261088602245, 0.3894566247612238, -0.06970376358677943, 0.17140329706172147, -0.017763022209207217, 0.20580076040079195, 0.010009654915581147, -0.06979714270060261, 0.004816493404408296, -0.1600231334163497, 0.09868322821799666, 0.26225318330650527, 0.030684406766667963, 0.31067844258272087, -0.37051539596480626, -0.2340655775119861, 0.10057690698032577, 0.08461325375324426, 0.07937300411829104, -0.027526950069392722, -0.32555988639593125, 0.09826121542913219, -0.0796940911312898, -0.18982638099541266, -0.06945928007364273, 0.00411725473900636, 0.1181712268665433, -0.33442659452557566, 0.13874927987655003, 0.12369302436088522, 0.015779041464750964, -0.12213905250964065, -0.071343201075991, -0.0022993892369170986, 0.02886377732579907, 0.06649278576330592, -0.0014310899563133716, 0.029049582406878473, -0.08970537944075962, -0.09727589794124167, 0.3304999682183067, -0.14597101916869482, -0.31008244725565115, 0.1025863292813301, -0.16666643742471934, -0.12012837167518835, 0.1526262331008911, 0.19556276900072891, 0.1793529836833477, -0.1871871713300546, 0.1388339930695171, -0.05705376283576091, 0.14462044719917078, 0.1025499013500909, -0.015995842243234318, 0.07433097468068202, 0.10977535136664907, 0.1724131809361279, 0.1478998241821925, 0.02972513768201073, -0.1111551599514981, -0.3464393548667431, -0.15330989871174097, -0.15556060880422592, 0.10624116595834493, -0.14783377291324237, -0.1921902662018935, 0.37963586459557214, 0.1349629774192969, 0.18971984919160603, 0.11389919312205166, 0.21723478864257534, 0.2658741018921137, -0.008453694097697735, 0.05617870941137274, 0.13721077863126993, 0.22660838083364068, 0.13763267209132513, -0.17016063717814783, 0.10101705889838437, 0.1897953894858559]
|
1,803.06544
|
Long ligands reinforce biological adhesion under shear flow
|
In this work the computer modeling has been used to show that longer ligands
allow biological cells (e.g., blood platelets) to withstand stronger flows
after their adhesion to solid walls. Mechanistic model of polymer-mediated
ligand-receptor adhesion between a microparticle (cell) and a flat wall has
been developed. Theoretical threshold between adherent and non-adherent regimes
has been derived analytically and confirmed by simulations. These results lead
to a deeper understanding of numerous biophysical processes, e.g., arterial
thrombosis, and to the design of new biomimetic colloid-polymer systems.
|
cond-mat.soft physics.bio-ph q-bio.CB
|
in this work the computer modeling has been used to show that longer ligands allow biological cells eg blood platelets to withstand stronger flows after their adhesion to solid walls mechanistic model of polymermediated ligandreceptor adhesion between a microparticle cell and a flat wall has been developed theoretical threshold between adherent and nonadherent regimes has been derived analytically and confirmed by simulations these results lead to a deeper understanding of numerous biophysical processes eg arterial thrombosis and to the design of new biomimetic colloidpolymer systems
|
[['in', 'this', 'work', 'the', 'computer', 'modeling', 'has', 'been', 'used', 'to', 'show', 'that', 'longer', 'ligands', 'allow', 'biological', 'cells', 'eg', 'blood', 'platelets', 'to', 'withstand', 'stronger', 'flows', 'after', 'their', 'adhesion', 'to', 'solid', 'walls', 'mechanistic', 'model', 'of', 'polymermediated', 'ligandreceptor', 'adhesion', 'between', 'a', 'microparticle', 'cell', 'and', 'a', 'flat', 'wall', 'has', 'been', 'developed', 'theoretical', 'threshold', 'between', 'adherent', 'and', 'nonadherent', 'regimes', 'has', 'been', 'derived', 'analytically', 'and', 'confirmed', 'by', 'simulations', 'these', 'results', 'lead', 'to', 'a', 'deeper', 'understanding', 'of', 'numerous', 'biophysical', 'processes', 'eg', 'arterial', 'thrombosis', 'and', 'to', 'the', 'design', 'of', 'new', 'biomimetic', 'colloidpolymer', 'systems']]
|
[-0.043795333890353935, 0.12907092781080043, -0.09958845850847223, 0.021573984240839148, -0.06067097622572499, -0.18237285307772896, 0.05229021864669288, 0.4241367138483945, -0.21142559273113662, -0.28591467575854895, 0.037561127177768334, -0.21149060056572233, -0.24504699175629546, 0.20923902466619276, -0.08662902411511715, 0.09792149877723526, 0.04132958652506418, -0.07645579769604785, 0.08059115910299999, -0.15846705542986883, 0.17037095109767775, 0.055369001876234135, 0.3137771984671845, 0.12405076169354075, 0.10918820517904618, -0.0743264461045756, 0.023628422267296736, 0.05402548825368285, -0.24408304044088308, 0.1266461179098662, 0.26123799046172813, 0.021975050978910397, 0.29784244567374973, -0.5754301576053396, -0.36181053846855377, 0.09197734714869191, 0.17071451871922952, 0.1255191349205287, -0.030335594949257725, -0.2450160958968541, 0.10013206168351804, -0.16383931734873092, -0.09847029923077892, -0.07747680637985468, 0.05112187456449165, 0.0558336605947903, -0.2101650017163004, 0.08205907944220063, 0.04445496448178721, 0.12079693392357406, -0.07189856947070974, -0.10240205259007566, -0.07483014138415456, 0.1967504693154136, 0.06360507237409098, -0.014820773450329023, 0.2517369099125704, -0.14837127559927896, -0.10043459319345215, 0.37648748932954146, 0.057361084784326305, -0.19906303606489126, 0.32036516048178515, -0.10652901027899454, -0.07546834198977141, 0.16207319859634428, 0.18613567374208395, 0.041015375421985106, -0.194744557742139, -0.013146334982422344, 0.006067660256453297, 0.16545977753669242, 0.12395657817833125, -0.06843229193678674, 0.21650920539327403, 0.26630770922364555, -0.03854101781240281, 0.13083522597273045, -0.0762435530887588, -0.10019527702482746, -0.15777538565590102, -0.15924229450962124, -0.11342372450539294, 0.032883260811350366, -0.05981642151292523, -0.16657208658426123, 0.3133339317789411, 0.09433009596952402, 0.14284122596898882, 0.023926667680087336, 0.23668579759131023, -0.01697881059611545, 0.08175198717645424, -0.05078206054373261, 0.2620236316695809, 0.15146691819159863, 0.15099594016723772, -0.22211338805911296, 0.11539413999656543, 0.027336103759486887]
|
1,803.06545
|
Improving Vulnerability Inspection Efficiency Using Active Learning
|
Software engineers can find vulnerabilities with less effort if they are
directed towards code that might contain more vulnerabilities. HARMLESS is an
incremental support vector machine tool that builds a vulnerability prediction
model from the sourcecode inspected to date, then suggests what source code
files should be inspected next. In this way, HARMLESS can reduce the time and
effort required to achieve some desired level of recall for finding
vulnerabilities. The tool also provides feedback on when to stop (at that
desired level of recall) while at the same time, correcting human errors by
double-checking suspicious files.
This paper evaluates HARMLESS on Mozilla Firefox vulnerability data. HARMLESS
found 80, 90, 95, 99% of the vulnerabilities by inspecting 10, 16, 20, 34% of
the source code files. When targeting 90, 95, 99% recall, HARMLESS could stop
after inspecting 23, 30, 47% of the source code files. Even when human
reviewers fail to identify half of the vulnerabilities (50% false negative
rate), HARMLESScould detect 96% of the missing vulnerabilities by
double-checking half of the inspected files.
Our results serve to highlight the very steep cost of protecting software
from vulnerabilities (in our case study that cost is, for example, the human
effort of inspecting 28,750$\times$20% = 5,750 source code files to identify
95% of the vulnerabilities). While this result could benefit the
mission-critical projects where human resources are available for inspecting
thousands of source code files, the research challenge for future work is how
to further reduce that cost. The conclusion of this paper discusses various
ways that goal might be achieved.
|
cs.SE
|
software engineers can find vulnerabilities with less effort if they are directed towards code that might contain more vulnerabilities harmless is an incremental support vector machine tool that builds a vulnerability prediction model from the sourcecode inspected to date then suggests what source code files should be inspected next in this way harmless can reduce the time and effort required to achieve some desired level of recall for finding vulnerabilities the tool also provides feedback on when to stop at that desired level of recall while at the same time correcting human errors by doublechecking suspicious files this paper evaluates harmless on mozilla firefox vulnerability data harmless found 80 90 95 99 of the vulnerabilities by inspecting 10 16 20 34 of the source code files when targeting 90 95 99 recall harmless could stop after inspecting 23 30 47 of the source code files even when human reviewers fail to identify half of the vulnerabilities 50 false negative rate harmlesscould detect 96 of the missing vulnerabilities by doublechecking half of the inspected files our results serve to highlight the very steep cost of protecting software from vulnerabilities in our case study that cost is for example the human effort of inspecting 28750times20 5750 source code files to identify 95 of the vulnerabilities while this result could benefit the missioncritical projects where human resources are available for inspecting thousands of source code files the research challenge for future work is how to further reduce that cost the conclusion of this paper discusses various ways that goal might be achieved
|
[['software', 'engineers', 'can', 'find', 'vulnerabilities', 'with', 'less', 'effort', 'if', 'they', 'are', 'directed', 'towards', 'code', 'that', 'might', 'contain', 'more', 'vulnerabilities', 'harmless', 'is', 'an', 'incremental', 'support', 'vector', 'machine', 'tool', 'that', 'builds', 'a', 'vulnerability', 'prediction', 'model', 'from', 'the', 'sourcecode', 'inspected', 'to', 'date', 'then', 'suggests', 'what', 'source', 'code', 'files', 'should', 'be', 'inspected', 'next', 'in', 'this', 'way', 'harmless', 'can', 'reduce', 'the', 'time', 'and', 'effort', 'required', 'to', 'achieve', 'some', 'desired', 'level', 'of', 'recall', 'for', 'finding', 'vulnerabilities', 'the', 'tool', 'also', 'provides', 'feedback', 'on', 'when', 'to', 'stop', 'at', 'that', 'desired', 'level', 'of', 'recall', 'while', 'at', 'the', 'same', 'time', 'correcting', 'human', 'errors', 'by', 'doublechecking', 'suspicious', 'files', 'this', 'paper', 'evaluates', 'harmless', 'on', 'mozilla', 'firefox', 'vulnerability', 'data', 'harmless', 'found', '80', '90', '95', '99', 'of', 'the', 'vulnerabilities', 'by', 'inspecting', '10', '16', '20', '34', 'of', 'the', 'source', 'code', 'files', 'when', 'targeting', '90', '95', '99', 'recall', 'harmless', 'could', 'stop', 'after', 'inspecting', '23', '30', '47', 'of', 'the', 'source', 'code', 'files', 'even', 'when', 'human', 'reviewers', 'fail', 'to', 'identify', 'half', 'of', 'the', 'vulnerabilities', '50', 'false', 'negative', 'rate', 'harmlesscould', 'detect', '96', 'of', 'the', 'missing', 'vulnerabilities', 'by', 'doublechecking', 'half', 'of', 'the', 'inspected', 'files', 'our', 'results', 'serve', 'to', 'highlight', 'the', 'very', 'steep', 'cost', 'of', 'protecting', 'software', 'from', 'vulnerabilities', 'in', 'our', 'case', 'study', 'that', 'cost', 'is', 'for', 'example', 'the', 'human', 'effort', 'of', 'inspecting', '28750times20', '5750', 'source', 'code', 'files', 'to', 'identify', '95', 'of', 'the', 'vulnerabilities', 'while', 'this', 'result', 'could', 'benefit', 'the', 'missioncritical', 'projects', 'where', 'human', 'resources', 'are', 'available', 'for', 'inspecting', 'thousands', 'of', 'source', 'code', 'files', 'the', 'research', 'challenge', 'for', 'future', 'work', 'is', 'how', 'to', 'further', 'reduce', 'that', 'cost', 'the', 'conclusion', 'of', 'this', 'paper', 'discusses', 'various', 'ways', 'that', 'goal', 'might', 'be', 'achieved']]
|
[-0.11125474963969087, 0.05396970050145124, -0.017706391031958944, 0.10441933900203033, -0.09555124945880605, -0.21882823341189075, 0.14605122685508534, 0.3436485993809969, -0.219183337312112, -0.41674173131027054, 0.1301656816818784, -0.32508811426388845, -0.08547789655111238, 0.21795629571076003, -0.10831142111986397, 0.0630257056812223, 0.11787771620490527, 0.01525050820918674, -0.0039073119969614545, -0.3754805903555644, 0.25592557319796894, 0.13276969054387702, 0.25564727191505265, 0.07931424270235436, 0.01587755162203648, -0.04194792961316267, -0.08571389087399736, -0.06123952108212467, -0.03621044527490828, 0.09070851122199446, 0.34669758148259455, 0.23786382001719586, 0.33460407409498083, -0.3938870472613367, -0.1558516495288096, 0.059232056463419926, 0.15664449989195942, 0.1193333487261942, -0.027321082585437334, -0.28470508610568795, 0.18498534309167727, -0.20986761760459452, -0.1330845228746055, -0.04168333770464454, 0.0106265550906904, -0.047426829014129694, -0.1896850793420406, 0.008017975826913505, 0.00041073458885288426, 0.09575640454033121, 0.0024097663520723, -0.11126675016286598, -0.06444365049282937, 0.18127986656559417, 0.06260816658374126, 0.07693876448592012, 0.18048743652687171, -0.12316309821299107, -0.11156949975232482, 0.3731148411095838, -0.027370208640608226, -0.15207217220970745, 0.14747566688291236, -0.06241699488804556, -0.1557764686469228, 0.17406549269300867, 0.20976102607259492, 0.028652493471410197, -0.2245448875903575, -0.0032679609134920115, 0.04142888596033177, 0.26301123390467074, 0.08136794251908008, 0.02558311888022196, 0.2270867574130138, 0.14426176468588064, 0.012960040086612163, 0.14119266933881122, -0.0928484449640518, -0.012468095970292964, -0.25609294356323475, -0.14230368050596232, -0.11302318292079269, 0.02220474688176805, -0.06677233579233134, -0.10038155502121504, 0.3928909933852242, 0.24813984360265934, 0.11270663865519405, 0.09481368876326873, 0.3100351285196638, -0.013952928626047382, 0.12331362230275623, 0.1487827679121519, 0.19894320891270004, -0.05373873307047129, 0.10367265757869074, -0.1360416752847948, 0.1400293146970352, -0.04976702018655431]
|
1,803.06546
|
Microscale resolution thermal mapping using a flexible platform of
patterned quantum sensors
|
Temperature sensors with micro- and nanoscale spatial resolution have long
been explored for their potential to investigate the details of physical
systems at an unprecedented scale. In particular, the rapid miniaturization of
transistor technology, with the associated steep boost in power density, calls
for sensors that accurately monitor heating distributions. Here, we report on a
simple and scalable fabrication approach, based on directed self-assembly and
transfer printing techniques, to construct arrays of nanodiamonds containing
temperature sensitive fluorescent spin defects. The nanoparticles are embedded
within a low thermal conductivity matrix that allows for repeated use on a wide
range of systems with minimal spurious effects. Additionally, we demonstrate
access to a wide spectrum of array parameters ranging from sparser single
particle arrays to denser devices with approximately 100 % yield and stronger
photoluminescence signal, ideal for temperature measurements. With these we
experimentally reconstruct the temperature map of an operating coplanar
waveguide to confirm the accuracy of these platforms.
|
physics.app-ph cond-mat.mes-hall
|
temperature sensors with micro and nanoscale spatial resolution have long been explored for their potential to investigate the details of physical systems at an unprecedented scale in particular the rapid miniaturization of transistor technology with the associated steep boost in power density calls for sensors that accurately monitor heating distributions here we report on a simple and scalable fabrication approach based on directed selfassembly and transfer printing techniques to construct arrays of nanodiamonds containing temperature sensitive fluorescent spin defects the nanoparticles are embedded within a low thermal conductivity matrix that allows for repeated use on a wide range of systems with minimal spurious effects additionally we demonstrate access to a wide spectrum of array parameters ranging from sparser single particle arrays to denser devices with approximately 100 yield and stronger photoluminescence signal ideal for temperature measurements with these we experimentally reconstruct the temperature map of an operating coplanar waveguide to confirm the accuracy of these platforms
|
[['temperature', 'sensors', 'with', 'micro', 'and', 'nanoscale', 'spatial', 'resolution', 'have', 'long', 'been', 'explored', 'for', 'their', 'potential', 'to', 'investigate', 'the', 'details', 'of', 'physical', 'systems', 'at', 'an', 'unprecedented', 'scale', 'in', 'particular', 'the', 'rapid', 'miniaturization', 'of', 'transistor', 'technology', 'with', 'the', 'associated', 'steep', 'boost', 'in', 'power', 'density', 'calls', 'for', 'sensors', 'that', 'accurately', 'monitor', 'heating', 'distributions', 'here', 'we', 'report', 'on', 'a', 'simple', 'and', 'scalable', 'fabrication', 'approach', 'based', 'on', 'directed', 'selfassembly', 'and', 'transfer', 'printing', 'techniques', 'to', 'construct', 'arrays', 'of', 'nanodiamonds', 'containing', 'temperature', 'sensitive', 'fluorescent', 'spin', 'defects', 'the', 'nanoparticles', 'are', 'embedded', 'within', 'a', 'low', 'thermal', 'conductivity', 'matrix', 'that', 'allows', 'for', 'repeated', 'use', 'on', 'a', 'wide', 'range', 'of', 'systems', 'with', 'minimal', 'spurious', 'effects', 'additionally', 'we', 'demonstrate', 'access', 'to', 'a', 'wide', 'spectrum', 'of', 'array', 'parameters', 'ranging', 'from', 'sparser', 'single', 'particle', 'arrays', 'to', 'denser', 'devices', 'with', 'approximately', '100', 'yield', 'and', 'stronger', 'photoluminescence', 'signal', 'ideal', 'for', 'temperature', 'measurements', 'with', 'these', 'we', 'experimentally', 'reconstruct', 'the', 'temperature', 'map', 'of', 'an', 'operating', 'coplanar', 'waveguide', 'to', 'confirm', 'the', 'accuracy', 'of', 'these', 'platforms']]
|
[-0.09361728690661646, 0.14203520763224403, -0.01632087202802396, -0.03522732266141341, -0.03862197633283452, -0.1564499555265334, 0.02074549211195121, 0.46806368846088076, -0.23009201406071392, -0.3523493352680443, 0.08712473457517962, -0.2795232167298262, -0.09000455369562424, 0.24848508097616454, -0.02180977967919973, 0.08516832968355932, 0.033640671061733976, -0.04023195859283591, -0.06636779942513946, -0.1534855569091936, 0.23157150914164212, 0.10700084402140839, 0.32497702165244097, 0.0790222849090918, 0.12861738260760783, 0.0006117442180999579, 0.027147449860468697, 0.01961315057437437, -0.13523084215138134, 0.11618380720028654, 0.2541081429226324, 0.024769941387393583, 0.21113506184431174, -0.48983431889269596, -0.2494355613986651, 0.07968905813383269, 0.13229856530550677, 0.11315724504395173, -0.10002519998577042, -0.23678899725946861, 0.10608616571586865, -0.1612405563952425, -0.13627892643508416, -0.09604307261850828, 0.030413531869924508, 0.03674325805571663, -0.24467955937441915, 0.03638669584641974, -0.020564946366879992, 0.08192873636009888, -0.03447148232739076, -0.08433281548115282, 0.014503598623634435, 0.10127529078939308, -0.06985242848989004, -0.035283020531866126, 0.2320987606056942, -0.1142525748612407, -0.11505923046766278, 0.33755281871148884, -0.05234464849136435, -0.12115315058364128, 0.23472219578121814, -0.1717850272207915, -0.09106069003852706, 0.17746912118775818, 0.22637767086808497, 0.10381819576454851, -0.16911599551512596, 0.025959810146723144, 0.04658459328959744, 0.2372771368156044, 0.07145021692700446, 0.11120434504790375, 0.2688196052227002, 0.23457841243063554, 0.05993001182333757, 0.13969858831730492, -0.13906623602088075, -0.015366360097407149, -0.18914920196104318, -0.1394053271640307, -0.18791170904669577, 0.07362370823736852, -0.11780662072385148, -0.1966744947089748, 0.3714280549902469, 0.21427737602528232, 0.1864104374408504, 0.02762476378120482, 0.30259321736864364, 0.06406852071403335, 0.12791843358457136, 0.01131092152522447, 0.21692544673882927, 0.14817777776326507, 0.132111061887535, -0.22277305688401564, 0.011173337799473068, -0.08498206856296374]
|
1,803.06547
|
Meta-F*: Proof Automation with SMT, Tactics, and Metaprograms
|
We introduce Meta-F*, a tactics and metaprogramming framework for the F*
program verifier. The main novelty of Meta-F* is allowing the use of tactics
and metaprogramming to discharge assertions not solvable by SMT, or to just
simplify them into well-behaved SMT fragments. Plus, Meta-F* can be used to
generate verified code automatically.
Meta-F* is implemented as an F* effect, which, given the powerful effect
system of F*, heavily increases code reuse and even enables the lightweight
verification of metaprograms. Metaprograms can be either interpreted, or
compiled to efficient native code that can be dynamically loaded into the F*
type-checker and can interoperate with interpreted code. Evaluation on
realistic case studies shows that Meta-F* provides substantial gains in proof
development, efficiency, and robustness.
|
cs.PL cs.LO
|
we introduce metaf a tactics and metaprogramming framework for the f program verifier the main novelty of metaf is allowing the use of tactics and metaprogramming to discharge assertions not solvable by smt or to just simplify them into wellbehaved smt fragments plus metaf can be used to generate verified code automatically metaf is implemented as an f effect which given the powerful effect system of f heavily increases code reuse and even enables the lightweight verification of metaprograms metaprograms can be either interpreted or compiled to efficient native code that can be dynamically loaded into the f typechecker and can interoperate with interpreted code evaluation on realistic case studies shows that metaf provides substantial gains in proof development efficiency and robustness
|
[['we', 'introduce', 'metaf', 'a', 'tactics', 'and', 'metaprogramming', 'framework', 'for', 'the', 'f', 'program', 'verifier', 'the', 'main', 'novelty', 'of', 'metaf', 'is', 'allowing', 'the', 'use', 'of', 'tactics', 'and', 'metaprogramming', 'to', 'discharge', 'assertions', 'not', 'solvable', 'by', 'smt', 'or', 'to', 'just', 'simplify', 'them', 'into', 'wellbehaved', 'smt', 'fragments', 'plus', 'metaf', 'can', 'be', 'used', 'to', 'generate', 'verified', 'code', 'automatically', 'metaf', 'is', 'implemented', 'as', 'an', 'f', 'effect', 'which', 'given', 'the', 'powerful', 'effect', 'system', 'of', 'f', 'heavily', 'increases', 'code', 'reuse', 'and', 'even', 'enables', 'the', 'lightweight', 'verification', 'of', 'metaprograms', 'metaprograms', 'can', 'be', 'either', 'interpreted', 'or', 'compiled', 'to', 'efficient', 'native', 'code', 'that', 'can', 'be', 'dynamically', 'loaded', 'into', 'the', 'f', 'typechecker', 'and', 'can', 'interoperate', 'with', 'interpreted', 'code', 'evaluation', 'on', 'realistic', 'case', 'studies', 'shows', 'that', 'metaf', 'provides', 'substantial', 'gains', 'in', 'proof', 'development', 'efficiency', 'and', 'robustness']]
|
[-0.10057832407536077, 0.013678376972374742, -0.08770696973794552, 0.08327024269536076, -0.13141056990678437, -0.21230062155709525, 0.05329423832905586, 0.3713979875271926, -0.26635333859804466, -0.3499306935023089, 0.09720475721214974, -0.19623747335166716, -0.05798234710790461, 0.23595949274976355, -0.07937128920505038, 0.04557943327321869, 0.08999617785390955, -0.0448385928013194, -0.0192363202146285, -0.2504774835552318, 0.2546215105313258, 0.07827782062966315, 0.24635768595502758, 0.06604221099071571, 0.04734611592244082, 0.016768297258779773, -0.017660791447508286, 0.022997492863262286, -0.03223599849584165, 0.09968176115682105, 0.29773283829210234, 0.2510717702747063, 0.27274002264574415, -0.4344482244417972, -0.15798735371256462, 0.03852558479984062, 0.1646500727348793, 0.09023958740118494, -0.01949255130364422, -0.3031909742533825, 0.13911365352372532, -0.2372040186901806, -0.08251515664656447, -0.14509225000253284, -0.028420869287744652, 0.004814763251428691, -0.27240731049191635, -0.06429828023041798, 0.1174359057465049, 0.05983102086178942, -0.00768037265945287, -0.10752034420433805, -0.055597088055410346, 0.1332793521587966, -0.014239895543022478, 0.07591389483756951, 0.15899835175788793, -0.040398968695223976, -0.12494788007032065, 0.3822549777563478, -0.10353714767003767, -0.2043108485684898, 0.2141863214363512, -0.017860139723958782, -0.11829843482152429, 0.11745426757261157, 0.1707832132882179, 0.11783115693261145, -0.12342331843206385, 0.0816430089948508, 0.015235703201872891, 0.2748628551384709, 0.043992159491191146, -0.00968297846523709, 0.20182327571950975, 0.13692766709680684, -0.025733028866778144, 0.2197963066034584, 0.01965150864175559, -0.03983242373119612, -0.2606029062928846, -0.16893837854388308, -0.11946039088833772, 0.005555584288290969, -0.018919552929606863, -0.14247842563591043, 0.36287226619534807, 0.16980571751520954, 0.07796907516532257, 0.09138090012475303, 0.32917091626002165, 0.08836932208476832, 0.16794013546123246, 0.09686479531991922, 0.15332048945415186, 0.031715360546454054, 0.051797664903684475, -0.18328338453630139, 0.12935799420606078, 0.05947107021681598]
|
1,803.06548
|
Perpetual emulation threshold of PT-symmetric Hamiltonians
|
We describe a technique to emulate a two-level \PT-symmetric spin
Hamiltonian, replete with gain and loss, using only the unitary dynamics of a
larger quantum system. This we achieve by embedding the two-level system in
question in a subspace of a four-level Hamiltonian. Using an \textit{amplitude
recycling} scheme that couples the levels exterior to the \PT-symmetric
subspace, we show that it is possible to emulate the desired behaviour of the
\PT-symmetric Hamiltonian without depleting the exterior, reservoir levels. We
are thus able to extend the emulation time indefinitely, despite the
non-unitary \PT dynamics. We propose a realistic experimental implementation
using dynamically decoupled magnetic sublevels of ultracold atoms.
|
quant-ph cond-mat.quant-gas
|
we describe a technique to emulate a twolevel ptsymmetric spin hamiltonian replete with gain and loss using only the unitary dynamics of a larger quantum system this we achieve by embedding the twolevel system in question in a subspace of a fourlevel hamiltonian using an textitamplitude recycling scheme that couples the levels exterior to the ptsymmetric subspace we show that it is possible to emulate the desired behaviour of the ptsymmetric hamiltonian without depleting the exterior reservoir levels we are thus able to extend the emulation time indefinitely despite the nonunitary pt dynamics we propose a realistic experimental implementation using dynamically decoupled magnetic sublevels of ultracold atoms
|
[['we', 'describe', 'a', 'technique', 'to', 'emulate', 'a', 'twolevel', 'ptsymmetric', 'spin', 'hamiltonian', 'replete', 'with', 'gain', 'and', 'loss', 'using', 'only', 'the', 'unitary', 'dynamics', 'of', 'a', 'larger', 'quantum', 'system', 'this', 'we', 'achieve', 'by', 'embedding', 'the', 'twolevel', 'system', 'in', 'question', 'in', 'a', 'subspace', 'of', 'a', 'fourlevel', 'hamiltonian', 'using', 'an', 'textitamplitude', 'recycling', 'scheme', 'that', 'couples', 'the', 'levels', 'exterior', 'to', 'the', 'ptsymmetric', 'subspace', 'we', 'show', 'that', 'it', 'is', 'possible', 'to', 'emulate', 'the', 'desired', 'behaviour', 'of', 'the', 'ptsymmetric', 'hamiltonian', 'without', 'depleting', 'the', 'exterior', 'reservoir', 'levels', 'we', 'are', 'thus', 'able', 'to', 'extend', 'the', 'emulation', 'time', 'indefinitely', 'despite', 'the', 'nonunitary', 'pt', 'dynamics', 'we', 'propose', 'a', 'realistic', 'experimental', 'implementation', 'using', 'dynamically', 'decoupled', 'magnetic', 'sublevels', 'of', 'ultracold', 'atoms']]
|
[-0.1570874281514819, 0.1719560425296898, -0.04339079679399033, 0.0211563681722314, -0.015166662737866429, -0.18428248865529895, 0.023783402293311242, 0.4040257502173152, -0.2565889849771406, -0.2645914999541835, 0.007820467982510819, -0.23486973923221927, -0.15800011399959293, 0.15040206223308483, -0.03812459258310427, 0.07161479699207801, 0.08115820808142477, 0.02505234038352827, -0.07040658953140498, -0.21133835125218414, 0.3096958333713429, 0.05074741095021611, 0.2126295125399168, -0.01790672780458476, 0.14446922035661536, -0.00448804848599487, 0.13799555742434252, -0.051955614402176484, -0.07406848406260855, 0.09657797471959596, 0.226237503472263, 0.08826522772944594, 0.26458909709842127, -0.48331453757377985, -0.21363297001639311, 0.09712233276010673, 0.1585586589987381, 0.19995903340385895, -0.05435842064113539, -0.3139163991741, 0.01567399522254818, -0.2237229814609321, -0.16112788378861603, -0.13193126714072478, -0.04173028586589009, -0.047288267777484155, -0.26141125621778943, 0.0027182079181423255, 0.08006418175194586, 0.03079877113140075, -0.07071111564063162, 0.010583826995707143, -0.010321487463732189, 0.07642911744486784, -0.0987291657822816, -0.015402592866568365, 0.16345224373268885, -0.0761918662894935, -0.1118383932440916, 0.393894671505996, -0.09968801645483717, -0.23919583423167606, 0.18142677847922684, -0.094832289216509, -0.06077141724700961, 0.1250917912748094, 0.1590087336148614, 0.09195190052736864, -0.1507186803914537, 0.12081075133701404, -0.038734328967875965, 0.2174259160164413, 0.024750805518668248, 0.06516306127517302, 0.162068011241347, 0.17134608732205686, 0.07791406667664012, 0.19546135372229825, -0.025230146774795847, -0.17818321332729326, -0.24676694720983505, -0.14247471783647453, -0.21757127605509188, 0.08655158450683387, -0.03280468358183345, -0.11601412483865273, 0.43102455978122267, 0.19455269096575886, 0.19705949238692977, -0.006569130749144661, 0.3040845789729017, 0.15154452371698257, 0.0673322808693781, 0.07587104198461939, 0.2256328636675934, 0.13366018808620903, 0.06559627470734451, -0.32714842621315376, -0.036651047969086824, 0.038205862215015096]
|
1,803.06549
|
Low-Order Control Design using a Reduced-Order Model with a Stability
Constraint on the Full-Order Model
|
We consider low-order controller design for large-scale linear time-invariant
dynamical systems with inputs and outputs. Model order reduction is a popular
technique, but controllers designed for reduced-order models may result in
unstable closed-loop plants when applied to the full-order system. We introduce
a new method to design a fixed-order controller by minimizing the $L_\infty$
norm of a reduced-order closed-loop transfer matrix function subject to
stability constraints on the closed-loop systems for both the reduced-order and
the full-order models. Since the optimization objective and the constraints are
all nonsmooth and nonconvex we use a sequential quadratic programming method
based on quasi-Newton updating that is intended for this problem class,
available in the open-source software package GRANSO. Using a publicly
available test set, the controllers obtained by the new method are compared
with those computed by the HIFOO (H-Infinity Fixed-Order Optimization) toolbox
applied to a reduced-order model alone, which frequently fail to stabilize the
closed-loop system for the associated full-order model.
|
math.OC
|
we consider loworder controller design for largescale linear timeinvariant dynamical systems with inputs and outputs model order reduction is a popular technique but controllers designed for reducedorder models may result in unstable closedloop plants when applied to the fullorder system we introduce a new method to design a fixedorder controller by minimizing the l_infty norm of a reducedorder closedloop transfer matrix function subject to stability constraints on the closedloop systems for both the reducedorder and the fullorder models since the optimization objective and the constraints are all nonsmooth and nonconvex we use a sequential quadratic programming method based on quasinewton updating that is intended for this problem class available in the opensource software package granso using a publicly available test set the controllers obtained by the new method are compared with those computed by the hifoo hinfinity fixedorder optimization toolbox applied to a reducedorder model alone which frequently fail to stabilize the closedloop system for the associated fullorder model
|
[['we', 'consider', 'loworder', 'controller', 'design', 'for', 'largescale', 'linear', 'timeinvariant', 'dynamical', 'systems', 'with', 'inputs', 'and', 'outputs', 'model', 'order', 'reduction', 'is', 'a', 'popular', 'technique', 'but', 'controllers', 'designed', 'for', 'reducedorder', 'models', 'may', 'result', 'in', 'unstable', 'closedloop', 'plants', 'when', 'applied', 'to', 'the', 'fullorder', 'system', 'we', 'introduce', 'a', 'new', 'method', 'to', 'design', 'a', 'fixedorder', 'controller', 'by', 'minimizing', 'the', 'l_infty', 'norm', 'of', 'a', 'reducedorder', 'closedloop', 'transfer', 'matrix', 'function', 'subject', 'to', 'stability', 'constraints', 'on', 'the', 'closedloop', 'systems', 'for', 'both', 'the', 'reducedorder', 'and', 'the', 'fullorder', 'models', 'since', 'the', 'optimization', 'objective', 'and', 'the', 'constraints', 'are', 'all', 'nonsmooth', 'and', 'nonconvex', 'we', 'use', 'a', 'sequential', 'quadratic', 'programming', 'method', 'based', 'on', 'quasinewton', 'updating', 'that', 'is', 'intended', 'for', 'this', 'problem', 'class', 'available', 'in', 'the', 'opensource', 'software', 'package', 'granso', 'using', 'a', 'publicly', 'available', 'test', 'set', 'the', 'controllers', 'obtained', 'by', 'the', 'new', 'method', 'are', 'compared', 'with', 'those', 'computed', 'by', 'the', 'hifoo', 'hinfinity', 'fixedorder', 'optimization', 'toolbox', 'applied', 'to', 'a', 'reducedorder', 'model', 'alone', 'which', 'frequently', 'fail', 'to', 'stabilize', 'the', 'closedloop', 'system', 'for', 'the', 'associated', 'fullorder', 'model']]
|
[-0.0943412363154908, -0.04314870656691963, -0.07232855874444565, 0.061123514274589105, -0.08375787575245847, -0.21467142225069266, -0.022843082806779238, 0.3766527989749573, -0.31930104636033124, -0.29807017891685467, 0.17152768283009623, -0.19835801502281528, -0.17563411952998442, 0.23021504367978748, -0.10977638427969776, 0.22177626387086474, 0.1237450256130269, -0.021077530712030734, -0.06917880423428915, -0.2396124797000821, 0.2762833892285258, 0.050659993188927256, 0.23170284739724226, -0.08658164625845943, 0.14056640557423117, -0.01763584819634127, 0.018939884355928326, 0.011263462431917462, -0.10829181865741289, 0.15225867697485734, 0.29786536497819344, 0.17125732196742505, 0.33989988504378477, -0.419100347694151, -0.19114160906417366, 0.09050502732714426, 0.07905367811363709, 0.11923157054815983, -0.033830609273709226, -0.2776500853957443, 0.10985686225577883, -0.21581602472181233, -0.07590776363305182, -0.1437082133429785, -0.08548703680663736, 0.029768781765965344, -0.3904272885462623, 0.025435563857678936, 0.014665351030262057, 0.050099321567347345, -0.1105083687499142, -0.1296220719221172, -0.02306633186673958, 0.08613515241440721, -0.017743216305853255, 0.021001831478073815, 0.14648606680345402, -0.06782336675862581, -0.12560859458120185, 0.36800973927248504, -0.04216353235621877, -0.28804939992348605, 0.16383108594366408, -0.020564393891917564, -0.10888352483670122, 0.12407060840485405, 0.2693293606862426, 0.12112627397409251, -0.2155389736832563, 0.07017716872535316, 0.011238617566119454, 0.21025017272427537, -0.050565368476724604, -0.0464777282580639, 0.1208558797960087, 0.20249266848645964, 0.13250464082531974, 0.15209932614683727, 0.0134846363271899, -0.15262544274336035, -0.28414588621994363, -0.04467268807878364, -0.14798062375770246, -0.07422068809185625, -0.0637000458564792, -0.15571274314830197, 0.39175198168222664, 0.18533658560238708, 0.11655302832044567, 0.13056301400271728, 0.3973058787516401, 0.10451587238520328, 0.07838966927337873, 0.11774529089349546, 0.23220201032943552, 0.10153238866124538, 0.09848726599158932, -0.2750101272559053, 0.07741158522806968, 0.1082131422413631]
|
1,803.0655
|
On Mahalanobis distance in functional settings
|
Mahalanobis distance is a classical tool in multivariate analysis. We suggest
here an extension of this concept to the case of functional data. More
precisely, the proposed definition concerns those statistical problems where
the sample data are real functions defined on a compact interval of the real
line. The obvious difficulty for such a functional extension is the
non-invertibility of the covariance operator in infinite-dimensional cases.
Unlike other recent proposals, our definition is suggested and motivated in
terms of the Reproducing Kernel Hilbert Space (RKHS) associated with the
stochastic process that generates the data. The proposed distance is a true
metric; it depends on a unique real smoothing parameter which is fully
motivated in RKHS terms. Moreover, it shares some properties of its finite
dimensional counterpart: it is invariant under isometries, it can be
consistently estimated from the data and its sampling distribution is known
under Gaussian models. An empirical study for two statistical applications,
outliers detection and binary classification, is included. The obtained results
are quite competitive when compared to other recent proposals of the
literature.
|
stat.ME
|
mahalanobis distance is a classical tool in multivariate analysis we suggest here an extension of this concept to the case of functional data more precisely the proposed definition concerns those statistical problems where the sample data are real functions defined on a compact interval of the real line the obvious difficulty for such a functional extension is the noninvertibility of the covariance operator in infinitedimensional cases unlike other recent proposals our definition is suggested and motivated in terms of the reproducing kernel hilbert space rkhs associated with the stochastic process that generates the data the proposed distance is a true metric it depends on a unique real smoothing parameter which is fully motivated in rkhs terms moreover it shares some properties of its finite dimensional counterpart it is invariant under isometries it can be consistently estimated from the data and its sampling distribution is known under gaussian models an empirical study for two statistical applications outliers detection and binary classification is included the obtained results are quite competitive when compared to other recent proposals of the literature
|
[['mahalanobis', 'distance', 'is', 'a', 'classical', 'tool', 'in', 'multivariate', 'analysis', 'we', 'suggest', 'here', 'an', 'extension', 'of', 'this', 'concept', 'to', 'the', 'case', 'of', 'functional', 'data', 'more', 'precisely', 'the', 'proposed', 'definition', 'concerns', 'those', 'statistical', 'problems', 'where', 'the', 'sample', 'data', 'are', 'real', 'functions', 'defined', 'on', 'a', 'compact', 'interval', 'of', 'the', 'real', 'line', 'the', 'obvious', 'difficulty', 'for', 'such', 'a', 'functional', 'extension', 'is', 'the', 'noninvertibility', 'of', 'the', 'covariance', 'operator', 'in', 'infinitedimensional', 'cases', 'unlike', 'other', 'recent', 'proposals', 'our', 'definition', 'is', 'suggested', 'and', 'motivated', 'in', 'terms', 'of', 'the', 'reproducing', 'kernel', 'hilbert', 'space', 'rkhs', 'associated', 'with', 'the', 'stochastic', 'process', 'that', 'generates', 'the', 'data', 'the', 'proposed', 'distance', 'is', 'a', 'true', 'metric', 'it', 'depends', 'on', 'a', 'unique', 'real', 'smoothing', 'parameter', 'which', 'is', 'fully', 'motivated', 'in', 'rkhs', 'terms', 'moreover', 'it', 'shares', 'some', 'properties', 'of', 'its', 'finite', 'dimensional', 'counterpart', 'it', 'is', 'invariant', 'under', 'isometries', 'it', 'can', 'be', 'consistently', 'estimated', 'from', 'the', 'data', 'and', 'its', 'sampling', 'distribution', 'is', 'known', 'under', 'gaussian', 'models', 'an', 'empirical', 'study', 'for', 'two', 'statistical', 'applications', 'outliers', 'detection', 'and', 'binary', 'classification', 'is', 'included', 'the', 'obtained', 'results', 'are', 'quite', 'competitive', 'when', 'compared', 'to', 'other', 'recent', 'proposals', 'of', 'the', 'literature']]
|
[-0.06619601523290562, 0.02431339649289536, -0.10902876927422643, 0.11648768727839827, -0.10113465915944449, -0.10300319302711362, -2.175707522632375e-05, 0.38899521855900515, -0.2788249620967834, -0.24968015878214, 0.13554166889082545, -0.2948019873156175, -0.17533982011139668, 0.23769571727909947, -0.11206352182316705, 0.08823008949692114, 0.07751422928709348, 0.06917079296331369, -0.08820833675537026, -0.26845582898201076, 0.3590831380905741, 0.06342615323972567, 0.2934147130255982, -0.007318685671162007, 0.10444489630770548, -0.00302208355157031, -0.07471704132339291, 0.023595764871862553, -0.08355666796623704, 0.13313804750756944, 0.2516857016864563, 0.1565469537393353, 0.2848838992985123, -0.33153967232564907, -0.2480449618634868, 0.1532827603050618, 0.09295942301261449, 0.04533043164709888, -0.032887259759104254, -0.30279215232871665, 0.063105334965499, -0.1372898064690542, -0.11576938562063595, -0.08995850480064266, 0.01583839895593076, -0.020096720905322055, -0.289052658751186, 0.08147683145878258, 0.07859575721871971, 0.03980845468655481, -0.07076174290955993, -0.11854030982470193, 0.013685797168846941, 0.07135908561577826, 0.06146644117388911, 0.057029161111604276, 0.10676040660407747, -0.09123658430079389, -0.11474189229078044, 0.36167801121554977, -0.04029652838546541, -0.249242097076218, 0.21019394558691287, -0.12331179092838139, -0.14940301422227048, 0.069387712707943, 0.12409240753510914, 0.12955642516572174, -0.1489043518165712, 0.143230986984323, -0.07646509130369598, 0.12319863743364474, -0.0032641287665487934, 0.03413135727136107, 0.1171059940683808, 0.16388184995400998, 0.07969111321680775, 0.1303543123831949, -0.07452143193123925, -0.13868327011580522, -0.30796301151273275, -0.14793537129709855, -0.23738412002343579, 0.003254631008705556, -0.12443466743661188, -0.1687734319097073, 0.3797798236479488, 0.1391322258484976, 0.22257447580143935, 0.06277568658385005, 0.29834107234863577, 0.13906352680457998, 0.07101861593224067, 0.06353835519639996, 0.1901703628477585, 0.12665576639579934, 0.03283596458702774, -0.15371451239985556, 0.09482625739696293, 0.04238020804826444]
|
1,803.06551
|
A new elliptical-beam method based on time-domain thermoreflectance
(TDTR) to measure the in-plane anisotropic thermal conductivity and its
comparison with the beam-offset method
|
Materials lacking in-plane symmetry are ubiquitous in a wide range of
applications such as electronics, thermoelectrics, and high-temperature
superconductors, in all of which the thermal properties of the materials play a
critical part. However, very few experimental techniques can be used to measure
in-plane anisotropic thermal conductivity. A beam-offset method based on
time-domain thermoreflectance (TDTR) was previously proposed to measure
in-plane anisotropic thermal conductivity. However, a detailed analysis of the
beam-offset method is still lacking. Our analysis shows that uncertainties can
be large if the laser spot size or the modulation frequency is not properly
chosen. Here we propose an alternative approach based on TDTR to measure
in-plane anisotropic thermal conductivity using a highly elliptical pump
(heating) beam. The highly elliptical pump beam induces a quasi-one-dimensional
temperature profile on the sample surface that has a fast decay along the short
axis of the pump beam. The detected TDTR signal is exclusively sensitive to the
in-plane thermal conductivity along the short axis of the elliptical beam. By
conducting TDTR measurements as a function of delay time with the rotation of
the elliptical pump beam to different orientations, the in-plane thermal
conductivity tensor of the sample can be determined. In this work, we first
conduct detailed signal sensitivity analyses for both techniques and provide
guidelines in determining the optimal experimental conditions. We then compare
the two techniques under their optimal experimental conditions by measuring the
in-plane thermal conductivity tensor of a ZnO [11-20] sample. The accuracy and
limitations of both methods are discussed.
|
physics.app-ph
|
materials lacking inplane symmetry are ubiquitous in a wide range of applications such as electronics thermoelectrics and hightemperature superconductors in all of which the thermal properties of the materials play a critical part however very few experimental techniques can be used to measure inplane anisotropic thermal conductivity a beamoffset method based on timedomain thermoreflectance tdtr was previously proposed to measure inplane anisotropic thermal conductivity however a detailed analysis of the beamoffset method is still lacking our analysis shows that uncertainties can be large if the laser spot size or the modulation frequency is not properly chosen here we propose an alternative approach based on tdtr to measure inplane anisotropic thermal conductivity using a highly elliptical pump heating beam the highly elliptical pump beam induces a quasionedimensional temperature profile on the sample surface that has a fast decay along the short axis of the pump beam the detected tdtr signal is exclusively sensitive to the inplane thermal conductivity along the short axis of the elliptical beam by conducting tdtr measurements as a function of delay time with the rotation of the elliptical pump beam to different orientations the inplane thermal conductivity tensor of the sample can be determined in this work we first conduct detailed signal sensitivity analyses for both techniques and provide guidelines in determining the optimal experimental conditions we then compare the two techniques under their optimal experimental conditions by measuring the inplane thermal conductivity tensor of a zno 1120 sample the accuracy and limitations of both methods are discussed
|
[['materials', 'lacking', 'inplane', 'symmetry', 'are', 'ubiquitous', 'in', 'a', 'wide', 'range', 'of', 'applications', 'such', 'as', 'electronics', 'thermoelectrics', 'and', 'hightemperature', 'superconductors', 'in', 'all', 'of', 'which', 'the', 'thermal', 'properties', 'of', 'the', 'materials', 'play', 'a', 'critical', 'part', 'however', 'very', 'few', 'experimental', 'techniques', 'can', 'be', 'used', 'to', 'measure', 'inplane', 'anisotropic', 'thermal', 'conductivity', 'a', 'beamoffset', 'method', 'based', 'on', 'timedomain', 'thermoreflectance', 'tdtr', 'was', 'previously', 'proposed', 'to', 'measure', 'inplane', 'anisotropic', 'thermal', 'conductivity', 'however', 'a', 'detailed', 'analysis', 'of', 'the', 'beamoffset', 'method', 'is', 'still', 'lacking', 'our', 'analysis', 'shows', 'that', 'uncertainties', 'can', 'be', 'large', 'if', 'the', 'laser', 'spot', 'size', 'or', 'the', 'modulation', 'frequency', 'is', 'not', 'properly', 'chosen', 'here', 'we', 'propose', 'an', 'alternative', 'approach', 'based', 'on', 'tdtr', 'to', 'measure', 'inplane', 'anisotropic', 'thermal', 'conductivity', 'using', 'a', 'highly', 'elliptical', 'pump', 'heating', 'beam', 'the', 'highly', 'elliptical', 'pump', 'beam', 'induces', 'a', 'quasionedimensional', 'temperature', 'profile', 'on', 'the', 'sample', 'surface', 'that', 'has', 'a', 'fast', 'decay', 'along', 'the', 'short', 'axis', 'of', 'the', 'pump', 'beam', 'the', 'detected', 'tdtr', 'signal', 'is', 'exclusively', 'sensitive', 'to', 'the', 'inplane', 'thermal', 'conductivity', 'along', 'the', 'short', 'axis', 'of', 'the', 'elliptical', 'beam', 'by', 'conducting', 'tdtr', 'measurements', 'as', 'a', 'function', 'of', 'delay', 'time', 'with', 'the', 'rotation', 'of', 'the', 'elliptical', 'pump', 'beam', 'to', 'different', 'orientations', 'the', 'inplane', 'thermal', 'conductivity', 'tensor', 'of', 'the', 'sample', 'can', 'be', 'determined', 'in', 'this', 'work', 'we', 'first', 'conduct', 'detailed', 'signal', 'sensitivity', 'analyses', 'for', 'both', 'techniques', 'and', 'provide', 'guidelines', 'in', 'determining', 'the', 'optimal', 'experimental', 'conditions', 'we', 'then', 'compare', 'the', 'two', 'techniques', 'under', 'their', 'optimal', 'experimental', 'conditions', 'by', 'measuring', 'the', 'inplane', 'thermal', 'conductivity', 'tensor', 'of', 'a', 'zno', '1120', 'sample', 'the', 'accuracy', 'and', 'limitations', 'of', 'both', 'methods', 'are', 'discussed']]
|
[-0.1335699556276445, 0.1391629318645121, -0.10272316084952053, -0.011548812484899276, -0.0964029884537259, -0.12252870808722845, 0.0304005679950875, 0.47354353888635614, -0.2529880734683716, -0.28004924698818134, 0.09574982331438636, -0.26717902648733904, -0.07777972813172496, 0.26678548937578095, 0.004929743890847224, 0.08723293604566697, 0.016058089593628887, -0.07962458228506426, -0.06627210384500083, -0.1854743965311473, 0.23476101354922194, 0.08246792169611074, 0.3715632241738745, 0.07051523645414018, 0.06735982382354656, -0.0037806544571640007, 0.012397868716458519, 0.03799481341611609, -0.13937133745425076, 0.06135269095198218, 0.23944210125396836, -0.025484469337054932, 0.20682406418055177, -0.4204988953693915, -0.20988316199857282, 0.05154474883500776, 0.11998011442031192, 0.13184364206218846, -0.07215402645951292, -0.22731258933974124, 0.06597199620478657, -0.10061507404362598, -0.13362156873405634, -0.08817516217208597, -0.003262820845169286, 0.021994768144688995, -0.25210491603284896, 0.10780538393525904, 0.040683286680108996, 0.0918999412486634, -0.0890557007007004, -0.14030518230659317, -0.02393573669455129, 0.047468161144557285, 0.05122487794188597, 0.03491974639311151, 0.21780536279677826, -0.08895715984397111, -0.07537596040327414, 0.37297626932808364, -0.08054179735333321, -0.14720253174462675, 0.13199904893684494, -0.15943759441212474, -0.05706736220202717, 0.1591638622576356, 0.1751580869823516, 0.12078840574026999, -0.17446527666592251, 0.013158845907472357, -0.00040699216255183474, 0.1953997709551841, 0.051687209699970794, 0.06158681558927454, 0.23650996806656577, 0.19688998341636427, 0.041566330798534286, 0.166323296070392, -0.15362668573110552, 0.03496231195661592, -0.2322625155791184, -0.12671672072691983, -0.21941523544584954, 0.05758407823777381, -0.09574771905857077, -0.17709048705702402, 0.40938730744192325, 0.16416429681146882, 0.16255199385341257, -0.02995988369995424, 0.34760387313080976, 0.10620276435172608, 0.06372753052510306, 0.018574125109336884, 0.2751616460064322, 0.17611890735078706, 0.13379915091079247, -0.28595251424017315, 0.08032762825273838, -0.04431466468928968]
|
1,803.06552
|
Generators of semigroups on Banach spaces inducing holomorphic semiflows
|
Let $A$ be the generator of a $C_0$-semigroup $T$ on a Banach space of
analytic functions on the open unit disc. If $T$ consists of composition
operators, then there exists a holomorphic function $G:{\mathbb D}\to{\mathbb
C}$ such that $Af=Gf'$ with maximal domain. The aim of the paper is the study
of the reciprocal implication.
|
math.FA
|
let a be the generator of a c_0semigroup t on a banach space of analytic functions on the open unit disc if t consists of composition operators then there exists a holomorphic function gmathbb dtomathbb c such that afgf with maximal domain the aim of the paper is the study of the reciprocal implication
|
[['let', 'a', 'be', 'the', 'generator', 'of', 'a', 'c_0semigroup', 't', 'on', 'a', 'banach', 'space', 'of', 'analytic', 'functions', 'on', 'the', 'open', 'unit', 'disc', 'if', 't', 'consists', 'of', 'composition', 'operators', 'then', 'there', 'exists', 'a', 'holomorphic', 'function', 'gmathbb', 'dtomathbb', 'c', 'such', 'that', 'afgf', 'with', 'maximal', 'domain', 'the', 'aim', 'of', 'the', 'paper', 'is', 'the', 'study', 'of', 'the', 'reciprocal', 'implication']]
|
[-0.17886343001629468, 0.11075804499840294, -0.054356125627506385, 0.008286349744863671, -0.08138286569414453, -0.06463140044016419, 0.04206041714254146, 0.3560655608911205, -0.3087564157666983, -0.11936695354611233, 0.12683460844197758, -0.27473461667627647, -0.13359717848814195, 0.2020887538480262, -0.04927644425899618, 0.011830118760742523, 0.048549235358627305, 0.09732434506252131, -0.09003749527295844, -0.20253352314035442, 0.4304844694281066, -0.04759934779118608, 0.14076686196926017, 0.06287760050165364, 0.15829063396624946, 0.02046332919659714, -0.005950614559912571, -0.040446495322545094, -0.17773283839172413, 0.1030864638828293, 0.22796984272146667, 0.14523438069348535, 0.3030931340116594, -0.343510997550631, -0.16087478616585335, 0.20827427629760845, 0.10852578763539593, -0.12048542739271566, -0.05357670651843633, -0.20031846022336847, 0.12227439201281716, -0.11732491688733851, -0.13463844181279894, -0.023470310908224847, 0.10543751565705019, 0.026355383943559393, -0.3240514425905766, -0.014661757904967224, 0.1389206442637024, 0.089557946694118, -0.08836447727797483, -0.07108850020018441, -0.08751630446770126, 0.06548613758274803, -0.017238774604198558, 0.1985257129072798, 0.09177940845903423, -0.044603038803432825, -0.09427090122847369, 0.3448286434394066, -0.10616767684135724, -0.2573744590842613, 0.13402791104831355, -0.24023111956194043, -0.10958055988023127, 0.03055171688363232, 0.1273608272895217, 0.1636302939236716, -0.08945776794657663, 0.2887887822947017, -0.14763506743367072, 0.15491992321632872, 0.04792461908180957, -0.002208489722020372, 0.1624583740097781, 0.14816391261087525, 0.12183704154772891, 0.16306758605383542, 0.025444269965023355, -0.009511986462813284, -0.4144754790942426, -0.2003401000984013, -0.1733069373995359, 0.12586112208319483, -0.10185177239623887, -0.20978196294702314, 0.40448504550968883, 0.05223571437117816, 0.24532433364678313, 0.07483026688849484, 0.2119706238822632, 0.10678812161225963, 0.08206042093095473, 0.09692651420590226, 0.06547748078527446, 0.1538500148087257, 0.025501416409733118, -0.19064607338427944, 0.049694017274305224, 0.15404002847908824]
|
1,803.06553
|
Search for additional neutral MSSM Higgs bosons in the $\tau\tau$ final
state in proton-proton collisions at $\sqrt{s}=$ 13 TeV
|
A search is presented for additional neutral Higgs bosons in the $\tau\tau$
final state in proton-proton collisions at the LHC. The search is performed in
the context of the minimal supersymmetric extension of the standard model
(MSSM), using the data collected with the CMS detector in 2016 at a
center-of-mass energy of 13 TeV, corresponding to an integrated luminosity of
35.9 fb$^{-1}$. To enhance the sensitivity to neutral MSSM Higgs bosons, the
search includes production of the Higgs boson in association with b quarks. No
significant deviation above the expected background is observed.
Model-independent limits at 95% confidence level (CL) are set on the product of
the branching fraction for the decay into $\tau$ leptons and the cross section
for the production via gluon fusion or in association with b quarks. These
limits range from 18 pb at 90 GeV to 3.5 fb at 3.2 TeV for gluon fusion and
from 15 pb (at 90 GeV) to 2.5 fb (at 3.2 TeV) for production in association
with b quarks, assuming a narrow width resonance. In the
m$_{\text{h}}^{\text{mod+}}$ scenario these limits translate into a 95% CL
exclusion of $\tan\beta>$ 6 for neutral Higgs boson masses below 250 GeV, where
$\tan\beta$ is the ratio of the vacuum expectation values of the neutral
components of the two Higgs doublets. The 95% CL exclusion contour reaches 1.6
TeV for $\tan\beta=$ 60.
|
hep-ex
|
a search is presented for additional neutral higgs bosons in the tautau final state in protonproton collisions at the lhc the search is performed in the context of the minimal supersymmetric extension of the standard model mssm using the data collected with the cms detector in 2016 at a centerofmass energy of 13 tev corresponding to an integrated luminosity of 359 fb1 to enhance the sensitivity to neutral mssm higgs bosons the search includes production of the higgs boson in association with b quarks no significant deviation above the expected background is observed modelindependent limits at 95 confidence level cl are set on the product of the branching fraction for the decay into tau leptons and the cross section for the production via gluon fusion or in association with b quarks these limits range from 18 pb at 90 gev to 35 fb at 32 tev for gluon fusion and from 15 pb at 90 gev to 25 fb at 32 tev for production in association with b quarks assuming a narrow width resonance in the m_texthtextmod scenario these limits translate into a 95 cl exclusion of tanbeta 6 for neutral higgs boson masses below 250 gev where tanbeta is the ratio of the vacuum expectation values of the neutral components of the two higgs doublets the 95 cl exclusion contour reaches 16 tev for tanbeta 60
|
[['a', 'search', 'is', 'presented', 'for', 'additional', 'neutral', 'higgs', 'bosons', 'in', 'the', 'tautau', 'final', 'state', 'in', 'protonproton', 'collisions', 'at', 'the', 'lhc', 'the', 'search', 'is', 'performed', 'in', 'the', 'context', 'of', 'the', 'minimal', 'supersymmetric', 'extension', 'of', 'the', 'standard', 'model', 'mssm', 'using', 'the', 'data', 'collected', 'with', 'the', 'cms', 'detector', 'in', '2016', 'at', 'a', 'centerofmass', 'energy', 'of', '13', 'tev', 'corresponding', 'to', 'an', 'integrated', 'luminosity', 'of', '359', 'fb1', 'to', 'enhance', 'the', 'sensitivity', 'to', 'neutral', 'mssm', 'higgs', 'bosons', 'the', 'search', 'includes', 'production', 'of', 'the', 'higgs', 'boson', 'in', 'association', 'with', 'b', 'quarks', 'no', 'significant', 'deviation', 'above', 'the', 'expected', 'background', 'is', 'observed', 'modelindependent', 'limits', 'at', '95', 'confidence', 'level', 'cl', 'are', 'set', 'on', 'the', 'product', 'of', 'the', 'branching', 'fraction', 'for', 'the', 'decay', 'into', 'tau', 'leptons', 'and', 'the', 'cross', 'section', 'for', 'the', 'production', 'via', 'gluon', 'fusion', 'or', 'in', 'association', 'with', 'b', 'quarks', 'these', 'limits', 'range', 'from', '18', 'pb', 'at', '90', 'gev', 'to', '35', 'fb', 'at', '32', 'tev', 'for', 'gluon', 'fusion', 'and', 'from', '15', 'pb', 'at', '90', 'gev', 'to', '25', 'fb', 'at', '32', 'tev', 'for', 'production', 'in', 'association', 'with', 'b', 'quarks', 'assuming', 'a', 'narrow', 'width', 'resonance', 'in', 'the', 'm_texthtextmod', 'scenario', 'these', 'limits', 'translate', 'into', 'a', '95', 'cl', 'exclusion', 'of', 'tanbeta', '6', 'for', 'neutral', 'higgs', 'boson', 'masses', 'below', '250', 'gev', 'where', 'tanbeta', 'is', 'the', 'ratio', 'of', 'the', 'vacuum', 'expectation', 'values', 'of', 'the', 'neutral', 'components', 'of', 'the', 'two', 'higgs', 'doublets', 'the', '95', 'cl', 'exclusion', 'contour', 'reaches', '16', 'tev', 'for', 'tanbeta', '60']]
|
[-0.03543553916882699, 0.24735550667717898, 0.031043563577948154, 0.15960607589717, -0.0042618706830637116, -0.1528661892032333, 0.11175448542323779, 0.31506567538419195, -0.15354038352420785, -0.3477981828763026, -0.0021401667200951976, -0.34193491979411483, 0.17717201774630828, 0.13024268438627498, 0.11302127132287035, 0.06699167054093214, 0.11520210002544871, 0.032000382729616444, -0.0034037828852373085, -0.26706502204183985, 0.22378527660920094, 0.0797937130318559, 0.2112715491856061, 0.13103604484225861, 0.08269083784610874, 0.024365932529223505, -0.011329215790806504, -0.14924366641954512, -0.09495426744605884, 0.0903396543819278, 0.20238156871565213, 0.07159450610654544, 0.10183935525077106, -0.24090280096186736, -0.02436630694356343, 0.1691480266049801, 0.16409050967272337, 0.012621732305558152, -0.03424901240845252, -0.36420582655602984, 0.157116259001113, -0.22920799843835094, -0.08135626438914477, 0.06928296934141555, 0.007966247387230396, -0.15020236451759836, -0.35853247040783803, 0.1358560011062804, -0.09701110765572835, 0.08508280798714542, -0.033930992527320916, -0.24890594624407358, -0.12422322323113119, -0.10488253831348292, 0.08948152396463237, 0.04209065794379685, 0.22179379851343028, -0.19139931521215908, -0.20299425896306614, 0.3637588224250131, -0.11960386338569554, -0.15100773316251723, 0.2082381229569509, -0.21311543721796336, -0.15006022014247203, 0.24451286061996577, 0.27962541955201764, 0.004897546066914941, -0.2395796649594816, 0.18954493087640165, -0.015868318491755466, 0.19735859347758733, 0.103368560328206, 0.032792270597198206, 0.2609283471535644, 0.23913208095241437, 0.029146756567554166, 0.05052722109465209, -0.1842684255577047, -0.06438158966592653, -0.4778259221167691, -0.11482569105488936, 0.004521277698634638, 0.06881926492908949, -0.09335615488469283, -0.01797341545003227, 0.3615501349899028, 0.12855486440370828, 0.3349402093274964, 0.0323619581758976, 0.2452273930441506, 0.1225328144022553, 0.07576100591367185, 0.0536810636470935, 0.39672828773325064, 0.14528051594404123, 0.15200450095148196, -0.13700989566834035, -0.058641935524580156, 0.0355637417879549]
|
1,803.06554
|
Fusion of an Ensemble of Augmented Image Detectors for Robust Object
Detection
|
A significant challenge in object detection is accurate identification of an
object's position in image space, whereas one algorithm with one set of
parameters is usually not enough, and the fusion of multiple algorithms and/or
parameters can lead to more robust results. Herein, a new computational
intelligence fusion approach based on the dynamic analysis of agreement among
object detection outputs is proposed. Furthermore, we propose an online versus
just in training image augmentation strategy. Experiments comparing the results
both with and without fusion are presented. We demonstrate that the augmented
and fused combination results are the best, with respect to higher accuracy
rates and reduction of outlier influences. The approach is demonstrated in the
context of cone, pedestrian and box detection for Advanced Driver Assistance
Systems (ADAS) applications.
|
cs.CV cs.AI eess.IV
|
a significant challenge in object detection is accurate identification of an objects position in image space whereas one algorithm with one set of parameters is usually not enough and the fusion of multiple algorithms andor parameters can lead to more robust results herein a new computational intelligence fusion approach based on the dynamic analysis of agreement among object detection outputs is proposed furthermore we propose an online versus just in training image augmentation strategy experiments comparing the results both with and without fusion are presented we demonstrate that the augmented and fused combination results are the best with respect to higher accuracy rates and reduction of outlier influences the approach is demonstrated in the context of cone pedestrian and box detection for advanced driver assistance systems adas applications
|
[['a', 'significant', 'challenge', 'in', 'object', 'detection', 'is', 'accurate', 'identification', 'of', 'an', 'objects', 'position', 'in', 'image', 'space', 'whereas', 'one', 'algorithm', 'with', 'one', 'set', 'of', 'parameters', 'is', 'usually', 'not', 'enough', 'and', 'the', 'fusion', 'of', 'multiple', 'algorithms', 'andor', 'parameters', 'can', 'lead', 'to', 'more', 'robust', 'results', 'herein', 'a', 'new', 'computational', 'intelligence', 'fusion', 'approach', 'based', 'on', 'the', 'dynamic', 'analysis', 'of', 'agreement', 'among', 'object', 'detection', 'outputs', 'is', 'proposed', 'furthermore', 'we', 'propose', 'an', 'online', 'versus', 'just', 'in', 'training', 'image', 'augmentation', 'strategy', 'experiments', 'comparing', 'the', 'results', 'both', 'with', 'and', 'without', 'fusion', 'are', 'presented', 'we', 'demonstrate', 'that', 'the', 'augmented', 'and', 'fused', 'combination', 'results', 'are', 'the', 'best', 'with', 'respect', 'to', 'higher', 'accuracy', 'rates', 'and', 'reduction', 'of', 'outlier', 'influences', 'the', 'approach', 'is', 'demonstrated', 'in', 'the', 'context', 'of', 'cone', 'pedestrian', 'and', 'box', 'detection', 'for', 'advanced', 'driver', 'assistance', 'systems', 'adas', 'applications']]
|
[-0.05705810321478566, 0.007817228745125249, -0.055617480604269076, 0.026691967919191484, -0.08171977050369605, -0.1578971261260449, 0.02239569956327614, 0.43765658934717067, -0.20404929177675513, -0.34941325652334854, 0.11376069563266356, -0.2643457542435499, -0.17557878650404746, 0.25756243890646147, -0.134812937641982, 0.08835799883672735, 0.15324537247852277, 0.07082851033919724, -0.05053203842271614, -0.25458590046946483, 0.28602068559393956, 0.07822340782149695, 0.3249889613070991, 0.03256280029381742, 0.11922817411686992, 0.020673159742727876, -0.07383972717343568, 0.03532326065374036, -0.03136885562008729, 0.17912480847007828, 0.2717449347892398, 0.17574439872987568, 0.27950988682277966, -0.3907339165452868, -0.20514867324527586, 0.08560565957486688, 0.1378755029199965, 0.12981677149582538, -0.08359068355787258, -0.3129309389496484, 0.12499212439070106, -0.18321716256650689, -0.04808444914306165, -0.11436471380875446, -0.010273988151311642, 0.007290424586244626, -0.31790686581598493, 0.04068834817553579, 0.044279789148276905, 0.055072006023692666, -0.10312771219832939, -0.10625050157250371, 0.022501637375171413, 0.13297214538397384, 0.006438845332013443, 0.03587249044176133, 0.156463106521187, -0.20572025380533887, -0.16549545835368917, 0.39023453137633624, -0.04272795496217441, -0.21490510956073194, 0.25760897485633905, -0.062236216363089625, -0.12534330186099396, 0.14069752932118718, 0.1951096406482975, 0.13258558829875255, -0.13072377177741146, -0.00881932792481166, 0.004631243071344215, 0.18632649174833205, 0.03181298240633623, 0.00974060643369512, 0.1627467689140758, 0.23846483101078775, 0.07899149841978215, 0.11119633019370667, -0.15239167611252924, -0.07468353188414767, -0.2623279087752053, -0.1384674708650664, -0.1603111025360704, -0.08783020126691099, -0.08289333695699952, -0.1036388692446053, 0.3617540553059371, 0.21636593458606512, 0.2142662877008661, 0.04366403392305074, 0.35410617305751657, 0.0838321862676139, 0.0735572669073008, 0.05731061188998865, 0.2241648579865796, 0.04163949570465775, 0.053351717888290295, -0.19168223362066783, 0.09696758458085242, 0.05562385345183429]
|
1,803.06555
|
Tell Me Why Is It So? Explaining Knowledge Graph Relationships by
Finding Descriptive Support Passages
|
We address the problem of finding descriptive explanations of facts stored in
a knowledge graph. This is important in high-risk domains such as healthcare,
intelligence, etc. where users need additional information for decision making
and is especially crucial for applications that rely on automatically
constructed knowledge bases where machine learned systems extract facts from an
input corpus and working of the extractors is opaque to the end-user. We follow
an approach inspired from information retrieval and propose a simple and
efficient, yet effective solution that takes into account passage level as well
as document level properties to produce a ranked list of passages describing a
given input relation. We test our approach using Wikidata as the knowledge base
and Wikipedia as the source corpus and report results of user studies conducted
to study the effectiveness of our proposed model.
|
cs.AI cs.IR
|
we address the problem of finding descriptive explanations of facts stored in a knowledge graph this is important in highrisk domains such as healthcare intelligence etc where users need additional information for decision making and is especially crucial for applications that rely on automatically constructed knowledge bases where machine learned systems extract facts from an input corpus and working of the extractors is opaque to the enduser we follow an approach inspired from information retrieval and propose a simple and efficient yet effective solution that takes into account passage level as well as document level properties to produce a ranked list of passages describing a given input relation we test our approach using wikidata as the knowledge base and wikipedia as the source corpus and report results of user studies conducted to study the effectiveness of our proposed model
|
[['we', 'address', 'the', 'problem', 'of', 'finding', 'descriptive', 'explanations', 'of', 'facts', 'stored', 'in', 'a', 'knowledge', 'graph', 'this', 'is', 'important', 'in', 'highrisk', 'domains', 'such', 'as', 'healthcare', 'intelligence', 'etc', 'where', 'users', 'need', 'additional', 'information', 'for', 'decision', 'making', 'and', 'is', 'especially', 'crucial', 'for', 'applications', 'that', 'rely', 'on', 'automatically', 'constructed', 'knowledge', 'bases', 'where', 'machine', 'learned', 'systems', 'extract', 'facts', 'from', 'an', 'input', 'corpus', 'and', 'working', 'of', 'the', 'extractors', 'is', 'opaque', 'to', 'the', 'enduser', 'we', 'follow', 'an', 'approach', 'inspired', 'from', 'information', 'retrieval', 'and', 'propose', 'a', 'simple', 'and', 'efficient', 'yet', 'effective', 'solution', 'that', 'takes', 'into', 'account', 'passage', 'level', 'as', 'well', 'as', 'document', 'level', 'properties', 'to', 'produce', 'a', 'ranked', 'list', 'of', 'passages', 'describing', 'a', 'given', 'input', 'relation', 'we', 'test', 'our', 'approach', 'using', 'wikidata', 'as', 'the', 'knowledge', 'base', 'and', 'wikipedia', 'as', 'the', 'source', 'corpus', 'and', 'report', 'results', 'of', 'user', 'studies', 'conducted', 'to', 'study', 'the', 'effectiveness', 'of', 'our', 'proposed', 'model']]
|
[-0.04815726674315955, 0.01014200152294114, -0.07033100288039704, 0.09453616669341225, -0.17971719511225148, -0.12934999775958897, 0.1033271200043692, 0.3944344745694304, -0.26318798413191985, -0.37123857711930924, 0.10381080211381422, -0.29598584491592034, -0.17483092648506487, 0.2042015998158604, -0.09240788136602199, 0.03718337032729559, 0.09556601026343356, 0.09026151643931973, 0.002148880988439853, -0.24264628367214597, 0.3386662730866735, 0.05261390715529271, 0.32173203546285845, 0.05498353986860179, 0.12545690646482188, 0.013148022370024336, -0.07782326078229992, -0.023761363472226713, -0.09075407432310581, 0.17730080415645494, 0.37348476314930606, 0.25978197458555263, 0.3016730519715134, -0.4108959189582643, -0.20134873932274394, 0.03725989102285436, 0.13735896251800891, 0.1176734214963512, -0.06044242451748, -0.3209639158595702, 0.07932674424327481, -0.1757549547704218, -0.036333095329426725, -0.13513886187991492, 0.004744962179403511, -0.010036527881023587, -0.2832236747502805, -0.005916365517157619, 0.11430904599060111, 0.09387435017906552, -0.061870641688139535, -0.10252525986393364, 0.03779500081177077, 0.22941690907150292, 0.051719898935038894, 0.03142179164444197, 0.13586185818785976, -0.1617323245581829, -0.1645591280309202, 0.42355192147811754, -0.037029887668507025, -0.17344195953161595, 0.15422471929860818, -0.02248526512973493, -0.15407366369241218, 0.05531959351245984, 0.24053178470340564, 0.10602490368831849, -0.18509871827559077, 0.015126250896153957, -0.05225747674971604, 0.2213451509102643, 0.06635217312321388, 0.023141462540106593, 0.20274798569383382, 0.23732330004195515, -0.0031127637928927976, 0.15055503942266696, -0.04416079723222597, -0.07070639098344518, -0.2581383978023375, -0.1267899611844219, -0.2161629929930883, 0.006235041240190002, -0.06964299710163438, -0.15806679803837867, 0.36608524963581307, 0.2513401104043499, 0.20235396105889902, 0.039410421242242304, 0.33180559886177236, 0.032604394441222595, 0.0716785495018707, 0.09454407730213493, 0.11894533617033375, 0.030386071427718556, 0.12139098963988341, -0.10266595186787932, 0.1114371036356918, 0.031954045580003226]
|
1,803.06556
|
Linearization of third-order ordinary differential equations
u'''=f(x,u,u',u'') via point transformations
|
The linearization problem by use of the Cartan equivalence method for scalar
third-order ODEs via point transformations was solved partially in [1,2]. In
order to solve this problem completely, the Cartan equivalence method is
applied to provide an invariant characterization of the linearizable
third-order ordinary differential equation u'''=f(x,u,u',u'') which admits a
four-dimensional point symmetry Lie algebra. The invariant characterization is
given in terms of the function f in a compact form. A simple procedure to
construct the equivalent canonical form by use of an obtained invariant is also
presented. The method provides auxiliary functions which can be utilized to
efficiently determine the point transformation that does the reduction to the
equivalent canonical form. Furthermore, illustrations to the main theorem and
applications are given.
|
math.CA math.DG
|
the linearization problem by use of the cartan equivalence method for scalar thirdorder odes via point transformations was solved partially in 12 in order to solve this problem completely the cartan equivalence method is applied to provide an invariant characterization of the linearizable thirdorder ordinary differential equation ufxuuu which admits a fourdimensional point symmetry lie algebra the invariant characterization is given in terms of the function f in a compact form a simple procedure to construct the equivalent canonical form by use of an obtained invariant is also presented the method provides auxiliary functions which can be utilized to efficiently determine the point transformation that does the reduction to the equivalent canonical form furthermore illustrations to the main theorem and applications are given
|
[['the', 'linearization', 'problem', 'by', 'use', 'of', 'the', 'cartan', 'equivalence', 'method', 'for', 'scalar', 'thirdorder', 'odes', 'via', 'point', 'transformations', 'was', 'solved', 'partially', 'in', '12', 'in', 'order', 'to', 'solve', 'this', 'problem', 'completely', 'the', 'cartan', 'equivalence', 'method', 'is', 'applied', 'to', 'provide', 'an', 'invariant', 'characterization', 'of', 'the', 'linearizable', 'thirdorder', 'ordinary', 'differential', 'equation', 'ufxuuu', 'which', 'admits', 'a', 'fourdimensional', 'point', 'symmetry', 'lie', 'algebra', 'the', 'invariant', 'characterization', 'is', 'given', 'in', 'terms', 'of', 'the', 'function', 'f', 'in', 'a', 'compact', 'form', 'a', 'simple', 'procedure', 'to', 'construct', 'the', 'equivalent', 'canonical', 'form', 'by', 'use', 'of', 'an', 'obtained', 'invariant', 'is', 'also', 'presented', 'the', 'method', 'provides', 'auxiliary', 'functions', 'which', 'can', 'be', 'utilized', 'to', 'efficiently', 'determine', 'the', 'point', 'transformation', 'that', 'does', 'the', 'reduction', 'to', 'the', 'equivalent', 'canonical', 'form', 'furthermore', 'illustrations', 'to', 'the', 'main', 'theorem', 'and', 'applications', 'are', 'given']]
|
[-0.10639409758756316, 0.03067259990436979, -0.10575842031663875, 0.07971675849019937, -0.13364397002217487, -0.13680183520631456, -0.017595036174889986, 0.3258232495679361, -0.3165026569826059, -0.2625265917475752, 0.09649038842190208, -0.21848189363604395, -0.19240903896771797, 0.1820988057908125, -0.07054995892311984, 0.05729779803552106, 0.03850344567544516, 0.06947945133897446, -0.16283341599779763, -0.2540456924087754, 0.36082854346046606, -0.006727914893772544, 0.25252119550193713, 0.0006893833273855167, 0.18813236900491687, 0.006895469857485798, -0.01651454630981737, 0.008885597647357036, -0.11192948293780607, 0.10898583038990212, 0.28384292769677394, 0.10933782919726479, 0.2130645419720833, -0.3501720235690596, -0.12588739373183588, 0.12470450430608741, 0.1233139360527985, 0.08851322474486263, -0.035594557938558744, -0.27593532586243097, 0.10831134529700086, -0.13035195846322592, -0.20023019471001335, -0.12808889761657977, -0.013891194496546092, -0.03312292696181231, -0.27878060648444947, 0.04943583697080967, 0.09333779358464044, 0.032560215907065364, -0.06218282506248452, -0.032599470173046596, -0.017765751892201056, 0.06716409614461104, -0.025796431557812947, 0.049570133826294084, 0.08389481169273849, -0.04875430839734409, -0.10415138846842527, 0.40867284009217975, -0.08059802577297044, -0.3081039251774792, 0.1115644473082772, -0.07338127322737278, -0.1481260941591023, 0.16809505458572896, 0.12230287825809867, 0.15296817946103894, -0.2031062698991197, 0.14580171044520293, -0.07106882882327205, 0.1137322827232377, 0.07063887723744279, -0.055017572763277504, 0.12879782835801504, 0.07225301036444622, 0.09602718918046695, 0.18528085025841354, 0.04026045130444615, -0.09816960159810335, -0.34848028860562213, -0.17516160383820534, -0.14059237188212875, 0.09934485475229841, -0.07916184797931777, -0.16834803953827396, 0.37730089803907746, 0.11362465448314096, 0.17366738764879605, 0.042662268903909055, 0.2492543049989556, 0.22996272806388637, 0.078031451799585, 0.05225391675362257, 0.19571944672947492, 0.21179662437208482, 0.03023950649686612, -0.19125927291333494, -0.01950295689720206, 0.20689550527500186]
|
1,803.06557
|
Estimation of treatment effects under endogeneous heteroskedasticity
|
The empirical literature on program evaluation limits its scope almost
exclusively to models where treatment effects are homogenous for
observationally identical individuals. This paper considers a treatment effect
model in which treatment effects may be heterogeneous, even among
observationally identical individuals. Specifically, extending the classical
instrumental variables (IV) model with an endogenous binary treatment and a
binary instrument, we allow the heteroskedasticity of the error disturbance to
also depend upon the treatment variable so that treatment has both mean and
variance effects on the outcome. In this endogenous heteroskedasticity IV
(EHIV) model with heterogeneous individual treatment effects, the standard IV
estimator can be inconsistent and lead to incorrect inference. After showing
identification of the mean and variance treatment effects in a nonparametric
version of the EHIV model, we provide closed-form estimators for the linear
EHIV for the mean and variance treatment effects and the individual treatment
effects (ITE). Asymptotic properties of the estimators are provided. A Monte
Carlo simulation investigates the performance of the proposed approach, and an
empirical application regarding the effects of fertility on female labor supply
is considered.
|
stat.ME
|
the empirical literature on program evaluation limits its scope almost exclusively to models where treatment effects are homogenous for observationally identical individuals this paper considers a treatment effect model in which treatment effects may be heterogeneous even among observationally identical individuals specifically extending the classical instrumental variables iv model with an endogenous binary treatment and a binary instrument we allow the heteroskedasticity of the error disturbance to also depend upon the treatment variable so that treatment has both mean and variance effects on the outcome in this endogenous heteroskedasticity iv ehiv model with heterogeneous individual treatment effects the standard iv estimator can be inconsistent and lead to incorrect inference after showing identification of the mean and variance treatment effects in a nonparametric version of the ehiv model we provide closedform estimators for the linear ehiv for the mean and variance treatment effects and the individual treatment effects ite asymptotic properties of the estimators are provided a monte carlo simulation investigates the performance of the proposed approach and an empirical application regarding the effects of fertility on female labor supply is considered
|
[['the', 'empirical', 'literature', 'on', 'program', 'evaluation', 'limits', 'its', 'scope', 'almost', 'exclusively', 'to', 'models', 'where', 'treatment', 'effects', 'are', 'homogenous', 'for', 'observationally', 'identical', 'individuals', 'this', 'paper', 'considers', 'a', 'treatment', 'effect', 'model', 'in', 'which', 'treatment', 'effects', 'may', 'be', 'heterogeneous', 'even', 'among', 'observationally', 'identical', 'individuals', 'specifically', 'extending', 'the', 'classical', 'instrumental', 'variables', 'iv', 'model', 'with', 'an', 'endogenous', 'binary', 'treatment', 'and', 'a', 'binary', 'instrument', 'we', 'allow', 'the', 'heteroskedasticity', 'of', 'the', 'error', 'disturbance', 'to', 'also', 'depend', 'upon', 'the', 'treatment', 'variable', 'so', 'that', 'treatment', 'has', 'both', 'mean', 'and', 'variance', 'effects', 'on', 'the', 'outcome', 'in', 'this', 'endogenous', 'heteroskedasticity', 'iv', 'ehiv', 'model', 'with', 'heterogeneous', 'individual', 'treatment', 'effects', 'the', 'standard', 'iv', 'estimator', 'can', 'be', 'inconsistent', 'and', 'lead', 'to', 'incorrect', 'inference', 'after', 'showing', 'identification', 'of', 'the', 'mean', 'and', 'variance', 'treatment', 'effects', 'in', 'a', 'nonparametric', 'version', 'of', 'the', 'ehiv', 'model', 'we', 'provide', 'closedform', 'estimators', 'for', 'the', 'linear', 'ehiv', 'for', 'the', 'mean', 'and', 'variance', 'treatment', 'effects', 'and', 'the', 'individual', 'treatment', 'effects', 'ite', 'asymptotic', 'properties', 'of', 'the', 'estimators', 'are', 'provided', 'a', 'monte', 'carlo', 'simulation', 'investigates', 'the', 'performance', 'of', 'the', 'proposed', 'approach', 'and', 'an', 'empirical', 'application', 'regarding', 'the', 'effects', 'of', 'fertility', 'on', 'female', 'labor', 'supply', 'is', 'considered']]
|
[-0.041110595991160945, 0.05836254064117826, -0.10857663268624748, 0.11332007857278834, -0.06654666646419721, -0.15180416473120614, 0.09011130530042419, 0.3856623379194605, -0.1980056557598529, -0.3037709778853955, 0.11122754252083518, -0.26702036918526856, -0.14842032915938297, 0.18224606127606818, -0.10361785596771711, 0.032287383106349356, 0.07632756182146953, -0.011499870928533077, -0.011032706592231989, -0.28491182804483284, 0.24471120147847503, 0.12288019491760935, 0.30147074344207775, -0.010134418939435803, 0.09148244917629421, 0.060491637306195264, -0.09992518609399953, 0.06513313984611581, -0.1267728568918605, 0.0697747740498358, 0.21617608230898447, 0.12762971999617653, 0.3588785113797662, -0.39620480898546456, -0.2313274832504148, 0.1280738372865097, 0.10592208578873899, 0.12273630971852459, 0.0041958646500195014, -0.25295576958104105, -0.015041659143624713, -0.1979875108304315, -0.08935259809480846, -0.04369122944566426, -0.03478538262199878, 0.02489805310058989, -0.3400511351260948, 0.15925048000821768, 0.0642649624239427, 0.09267906773609022, -0.08637622701330883, -0.18031726113664634, 0.02429249631601144, 0.12249447510819574, 0.10141582739248728, -0.07563221314093883, 0.1435448506677225, -0.12453385936713762, -0.09565267304166925, 0.31928289748049077, -0.03520912198396142, -0.24812281497069816, 0.15899408389865652, -0.12743800277538722, -0.11877201634037272, 0.08055540873252308, 0.2224768384189978, 0.09242566387125327, -0.20585208549807416, 0.045010815341429505, 0.02419667571103869, 0.13902158507799411, -0.02813342484794763, 0.019804151214206415, 0.19578488424770246, 0.15641561033749612, 0.008783268423889923, 0.10084814386756175, -0.09760885831040654, -0.1244009107361594, -0.31140236734047283, -0.10392188073974618, -0.09139037065243977, 0.029732147427224322, -0.11936788749696176, -0.22737624311757929, 0.35915815017252994, 0.1989202170767204, 0.1121331288772558, 0.10121521219232979, 0.30554246778975536, 0.10368530741939064, 0.01790137116370198, 0.041582873043506434, 0.21926066219209803, 0.1230580581979857, 0.004000042807002094, -0.2663295560256573, 0.21502175300320334, 0.005660605490804542]
|
1,803.06558
|
Insensitivity of bulk properties to the twisted boundary condition
|
The symmetry and the locality are the two major sources of various nontrivial
statements in quantum many-body systems. We demonstrate that, in gapped phases
of a U(1) symmetric Hamiltonian with finite-range interactions, the bulk
properties such as the expectation value of local operators, the ground state
energy and the excitation gap, and the static and low-frequency dynamical
responses in general, do not depend on the U(1) phase of the twisted boundary
condition in the limit of the large system size. Specifically, their dependence
on the twisted angle is exponentially suppressed with the linear dimension of
the system. The argument is based on the exponential decay of various types of
equal-time correlation functions.
|
cond-mat.stat-mech cond-mat.str-el
|
the symmetry and the locality are the two major sources of various nontrivial statements in quantum manybody systems we demonstrate that in gapped phases of a u1 symmetric hamiltonian with finiterange interactions the bulk properties such as the expectation value of local operators the ground state energy and the excitation gap and the static and lowfrequency dynamical responses in general do not depend on the u1 phase of the twisted boundary condition in the limit of the large system size specifically their dependence on the twisted angle is exponentially suppressed with the linear dimension of the system the argument is based on the exponential decay of various types of equaltime correlation functions
|
[['the', 'symmetry', 'and', 'the', 'locality', 'are', 'the', 'two', 'major', 'sources', 'of', 'various', 'nontrivial', 'statements', 'in', 'quantum', 'manybody', 'systems', 'we', 'demonstrate', 'that', 'in', 'gapped', 'phases', 'of', 'a', 'u1', 'symmetric', 'hamiltonian', 'with', 'finiterange', 'interactions', 'the', 'bulk', 'properties', 'such', 'as', 'the', 'expectation', 'value', 'of', 'local', 'operators', 'the', 'ground', 'state', 'energy', 'and', 'the', 'excitation', 'gap', 'and', 'the', 'static', 'and', 'lowfrequency', 'dynamical', 'responses', 'in', 'general', 'do', 'not', 'depend', 'on', 'the', 'u1', 'phase', 'of', 'the', 'twisted', 'boundary', 'condition', 'in', 'the', 'limit', 'of', 'the', 'large', 'system', 'size', 'specifically', 'their', 'dependence', 'on', 'the', 'twisted', 'angle', 'is', 'exponentially', 'suppressed', 'with', 'the', 'linear', 'dimension', 'of', 'the', 'system', 'the', 'argument', 'is', 'based', 'on', 'the', 'exponential', 'decay', 'of', 'various', 'types', 'of', 'equaltime', 'correlation', 'functions']]
|
[-0.19639917695686954, 0.20803822276086845, -0.0775081272778542, 0.07506686131611266, -0.02563485952019359, -0.10368317778193159, 0.011084388053859584, 0.33054287914585856, -0.2457139388352516, -0.25970230444467496, 0.10030131221823727, -0.2956316095909902, -0.12507860903653117, 0.1296794689021356, 0.04235983930993825, 0.10047085216917497, -0.0038916457207441063, 0.05579302168501142, -0.14542820759691363, -0.20218524189632653, 0.3915010073687881, -0.007725326224837252, 0.3111151742383039, 0.08548960359517618, 0.0479973742123028, 0.0315171292064146, 0.04127638933173979, 0.004374373221902975, -0.10165646225953294, 0.0675357618061493, 0.16376236192133678, 0.029929120519747294, 0.1976963710081431, -0.4425650811754167, -0.1695019775901788, 0.0907946033569585, 0.09690859141950828, 0.10611770494142547, -0.004264567329041061, -0.3111575194405824, 0.043795542571128214, -0.17037967028279258, -0.14875543834205018, -0.06773420771267931, 0.0021617277566942255, 0.029111783801844076, -0.24943471819902438, 0.12512313771627045, 0.07941053328431735, 0.06185063393578665, -0.10620413954789651, -0.08645982374374787, -0.058542131028454084, 0.13043634648264352, 0.07349379906476575, -0.013667125818756176, 0.12750642144133703, -0.17240642832725175, -0.1087092875142324, 0.35520641931881464, -0.05423699760597499, -0.21727707766071294, 0.19920751633097616, -0.16366221899092384, -0.11817313657021648, 0.10374986895684353, 0.1425179052499256, 0.114029592942513, -0.09498425215549235, 0.1368715097009304, -0.035441656828749855, 0.1799471746063708, -0.0023562424342214528, 0.12754543396970672, 0.19846011542332626, 0.09391939325723797, 0.08238180875923717, 0.13610372672389662, -0.05384807569186835, -0.1522714112943504, -0.3365657986141741, -0.13210923092888802, -0.20265623253570603, 0.07656075482178235, -0.11210153502127339, -0.20276414624355052, 0.4438615893595852, 0.11409188759509041, 0.18835746748871834, 0.03205672259667024, 0.24335054050399257, 0.1537223312511092, 0.08462271396378387, 0.04076896499171718, 0.26631855726840775, 0.12382549581733267, 0.06593424986515727, -0.28996033973193597, 0.030923055445392884, 0.08205985145260845]
|
1,803.06559
|
Improving Bitcoin's Resilience to Churn
|
Efficient and reliable block propagation on the Bitcoin network is vital for
ensuring the scalability of this peer-to-peer network. To this end, several
schemes have been proposed over the last few years to speed up the block
propagation, most notably the compact block protocol (BIP 152). Despite this,
we show experimental evidence that nodes that have recently joined the network
may need about ten days until this protocol becomes 90% effective. This problem
is endemic for nodes that do not have persistent network connectivity. We
propose to mitigate this ineffectiveness by maintaining mempool synchronization
among Bitcoin nodes. For this purpose, we design and implement into Bitcoin a
new prioritized data synchronization protocol, called FalafelSync. Our
experiments show that FalafelSync helps intermittently connected nodes to
maintain better consistency with more stable nodes, thereby showing promise for
improving block propagation in the broader network. In the process, we have
also developed an effective logging mechanism for bitcoin nodes we release for
public use.
|
cs.CR
|
efficient and reliable block propagation on the bitcoin network is vital for ensuring the scalability of this peertopeer network to this end several schemes have been proposed over the last few years to speed up the block propagation most notably the compact block protocol bip 152 despite this we show experimental evidence that nodes that have recently joined the network may need about ten days until this protocol becomes 90 effective this problem is endemic for nodes that do not have persistent network connectivity we propose to mitigate this ineffectiveness by maintaining mempool synchronization among bitcoin nodes for this purpose we design and implement into bitcoin a new prioritized data synchronization protocol called falafelsync our experiments show that falafelsync helps intermittently connected nodes to maintain better consistency with more stable nodes thereby showing promise for improving block propagation in the broader network in the process we have also developed an effective logging mechanism for bitcoin nodes we release for public use
|
[['efficient', 'and', 'reliable', 'block', 'propagation', 'on', 'the', 'bitcoin', 'network', 'is', 'vital', 'for', 'ensuring', 'the', 'scalability', 'of', 'this', 'peertopeer', 'network', 'to', 'this', 'end', 'several', 'schemes', 'have', 'been', 'proposed', 'over', 'the', 'last', 'few', 'years', 'to', 'speed', 'up', 'the', 'block', 'propagation', 'most', 'notably', 'the', 'compact', 'block', 'protocol', 'bip', '152', 'despite', 'this', 'we', 'show', 'experimental', 'evidence', 'that', 'nodes', 'that', 'have', 'recently', 'joined', 'the', 'network', 'may', 'need', 'about', 'ten', 'days', 'until', 'this', 'protocol', 'becomes', '90', 'effective', 'this', 'problem', 'is', 'endemic', 'for', 'nodes', 'that', 'do', 'not', 'have', 'persistent', 'network', 'connectivity', 'we', 'propose', 'to', 'mitigate', 'this', 'ineffectiveness', 'by', 'maintaining', 'mempool', 'synchronization', 'among', 'bitcoin', 'nodes', 'for', 'this', 'purpose', 'we', 'design', 'and', 'implement', 'into', 'bitcoin', 'a', 'new', 'prioritized', 'data', 'synchronization', 'protocol', 'called', 'falafelsync', 'our', 'experiments', 'show', 'that', 'falafelsync', 'helps', 'intermittently', 'connected', 'nodes', 'to', 'maintain', 'better', 'consistency', 'with', 'more', 'stable', 'nodes', 'thereby', 'showing', 'promise', 'for', 'improving', 'block', 'propagation', 'in', 'the', 'broader', 'network', 'in', 'the', 'process', 'we', 'have', 'also', 'developed', 'an', 'effective', 'logging', 'mechanism', 'for', 'bitcoin', 'nodes', 'we', 'release', 'for', 'public', 'use']]
|
[-0.18993684305747546, 0.04590619509810172, -0.0262822373976483, 0.027948470097726386, -0.10505367041553688, -0.1961623158960167, 0.1281812671230092, 0.4362917634528838, -0.26028390527965173, -0.2991703512571469, 0.1220031651105331, -0.24993318958278699, -0.18219684766122152, 0.17039762188082183, -0.09188317081336922, 0.06761822818234693, 0.10573191610382299, 0.03241918432007579, 0.016601114138913683, -0.3197571001180648, 0.2630636222230247, 0.11437853435761755, 0.34434505183061087, 0.07497403241069162, 0.08817277402879341, -0.0025668932726205904, -0.012343340211465388, -0.022430344344384946, -0.07571191066832582, 0.12820820627023785, 0.29913903143893505, 0.19252518881583894, 0.3464486879603112, -0.47010617410098027, -0.23241611706576298, 0.13432080485516146, 0.1927665741064238, 0.14536683928645863, -0.04300968117595288, -0.2685549959151334, 0.17313463973173213, -0.2497991209767193, -0.09098531621732289, -0.10328828897165088, 0.01377450972736542, -0.02301187183239344, -0.21035041615862068, 0.011648052723678949, 0.03053158457550114, 0.016390120581859322, 0.01988829286692405, -0.04479963638925854, 0.01631335016558112, 0.15606892088434035, 0.010984121812794864, -0.010242252164856306, 0.09695411413757696, -0.06268500742543771, -0.1392491304085743, 0.32087836131347414, 0.0037974157087693485, -0.10936267491241422, 0.17140567839024826, -0.010377743287502694, -0.20064710805051122, 0.10399872213130511, 0.21829716949664715, 0.0519139541996808, -0.1908034044317901, -0.02623092974432968, -0.032349261814799114, 0.1760880146706123, 0.055973740780867545, 0.05083317181119059, 0.1566870576537014, 0.23990011976183026, 0.15423152225439826, 0.10488943961048144, -0.06690342481029986, -0.11545410065151326, -0.20185959181760119, -0.14505992054200992, -0.1388408101128438, 0.005166468682903001, -0.10891579980118336, -0.115106758488603, 0.43688901393568214, 0.2296136992407338, 0.16725159676736692, 0.09642283212912234, 0.32835013011494013, 0.015862473172483422, 0.13044973083144007, 0.2003728057953376, 0.2367941012806436, 0.059303339287827286, 0.1590043027889679, -0.14307733401184594, 0.16186464366007927, 0.007434320100251574]
|
1,803.0656
|
Leading Pomeron Contributions and the TOTEM Data at 13 TeV
|
The recent data by the TOTEM Collaboration on $\sigma_{tot}$ and $\rho$ at 13
TeV, have shown agreement with a leading Odderon contribution at the highest
energies, as demonstrated in the very recent analysis by Martynov and Nicolescu
(MN). In order to investigate the same dataset by means of Pomeron dominance,
we introduce a general class of forward scattering amplitude, with leading
contributions even under crossing, associated with simple, double and triple
poles in the complex angular momentum plane. For the lower energy region, we
consider the usual non-degenerated Regge trajectories, with even and odd
symmetry. The analytic connection between $\sigma_{tot}$ and $\rho$ is obtained
by means of dispersion relations and we carry out fits to $pp$ and $\bar{p}p$
data in the interval $\sqrt{s}=5$ GeV - 13 TeV; following MN we consider only
the TOTEM data at the LHC energy region. From the fits, we conclude that the
general analytic model, as well as some particular cases representing standard
parameterizations, are not able to describe satisfactorily the $\sigma_{tot}$
and $\rho$ data at 13 TeV. Further analyses in course and some perspectives are
outlined.
|
hep-ph hep-ex
|
the recent data by the totem collaboration on sigma_tot and rho at 13 tev have shown agreement with a leading odderon contribution at the highest energies as demonstrated in the very recent analysis by martynov and nicolescu mn in order to investigate the same dataset by means of pomeron dominance we introduce a general class of forward scattering amplitude with leading contributions even under crossing associated with simple double and triple poles in the complex angular momentum plane for the lower energy region we consider the usual nondegenerated regge trajectories with even and odd symmetry the analytic connection between sigma_tot and rho is obtained by means of dispersion relations and we carry out fits to pp and barpp data in the interval sqrts5 gev 13 tev following mn we consider only the totem data at the lhc energy region from the fits we conclude that the general analytic model as well as some particular cases representing standard parameterizations are not able to describe satisfactorily the sigma_tot and rho data at 13 tev further analyses in course and some perspectives are outlined
|
[['the', 'recent', 'data', 'by', 'the', 'totem', 'collaboration', 'on', 'sigma_tot', 'and', 'rho', 'at', '13', 'tev', 'have', 'shown', 'agreement', 'with', 'a', 'leading', 'odderon', 'contribution', 'at', 'the', 'highest', 'energies', 'as', 'demonstrated', 'in', 'the', 'very', 'recent', 'analysis', 'by', 'martynov', 'and', 'nicolescu', 'mn', 'in', 'order', 'to', 'investigate', 'the', 'same', 'dataset', 'by', 'means', 'of', 'pomeron', 'dominance', 'we', 'introduce', 'a', 'general', 'class', 'of', 'forward', 'scattering', 'amplitude', 'with', 'leading', 'contributions', 'even', 'under', 'crossing', 'associated', 'with', 'simple', 'double', 'and', 'triple', 'poles', 'in', 'the', 'complex', 'angular', 'momentum', 'plane', 'for', 'the', 'lower', 'energy', 'region', 'we', 'consider', 'the', 'usual', 'nondegenerated', 'regge', 'trajectories', 'with', 'even', 'and', 'odd', 'symmetry', 'the', 'analytic', 'connection', 'between', 'sigma_tot', 'and', 'rho', 'is', 'obtained', 'by', 'means', 'of', 'dispersion', 'relations', 'and', 'we', 'carry', 'out', 'fits', 'to', 'pp', 'and', 'barpp', 'data', 'in', 'the', 'interval', 'sqrts5', 'gev', '13', 'tev', 'following', 'mn', 'we', 'consider', 'only', 'the', 'totem', 'data', 'at', 'the', 'lhc', 'energy', 'region', 'from', 'the', 'fits', 'we', 'conclude', 'that', 'the', 'general', 'analytic', 'model', 'as', 'well', 'as', 'some', 'particular', 'cases', 'representing', 'standard', 'parameterizations', 'are', 'not', 'able', 'to', 'describe', 'satisfactorily', 'the', 'sigma_tot', 'and', 'rho', 'data', 'at', '13', 'tev', 'further', 'analyses', 'in', 'course', 'and', 'some', 'perspectives', 'are', 'outlined']]
|
[-0.09143505679303265, 0.12885190400896976, -0.08841728917142963, 0.14395539462373422, -0.04365436534155469, -0.12013348985401635, 0.028475520604943537, 0.35340088916021445, -0.2084266062342248, -0.33069356779943515, 0.041420315527825075, -0.334594394502266, -0.05112947508929431, 0.18233144020749184, 0.04139381136394039, 0.05284890763394699, 0.09190195785053602, 0.04055366093467777, -0.053319589077952985, -0.19728529191503907, 0.33142452348970414, 0.0871553876931208, 0.2240097034331514, 0.10661915422562582, 0.05821943354087969, 0.06079340871238247, -0.05117129894405686, -0.01570001784357725, -0.177203656651682, 0.09007836559829842, 0.26017055096289976, 0.04266801063043389, 0.1362537453362708, -0.3769062752037911, -0.13994314577636305, 0.08316152390010284, 0.12377339541057937, 0.04892684711472682, -0.016987877252810115, -0.25445301586360725, 0.09322058895052261, -0.18516198571421494, -0.1766255228582111, -0.07805995587825529, 0.0068480690454971556, -0.005242141061436735, -0.2647610785714891, 0.09999374142276812, -0.005601506746497561, 0.05987700459274633, -0.059377408179953614, -0.183567869512992, -0.04205072075977551, 0.03988387225226638, 0.08496996784712656, 0.06500267140690794, 0.06883743454545263, -0.12707805341670486, -0.13383319702781532, 0.33655250530936937, -0.03358752041372074, -0.14768611777201424, 0.16707171849200234, -0.22244724237941493, -0.15858832684999014, 0.1450206681723238, 0.15566341009232837, 0.046641681389143506, -0.15337607200715422, 0.13248113068611778, -0.017512288042318427, 0.13911118266785014, 0.09275462556995698, -0.00039743672763235425, 0.1634642820591776, 0.14543390811873774, 0.0013371074130985041, 0.08413731439286092, -0.12196127626336134, -0.0785514063675224, -0.378867222582767, -0.06479718008989375, -0.10408488787306751, 0.03487875014590164, -0.07400416901638379, -0.022915934604040775, 0.3535558275919593, 0.07532838995192838, 0.3030792336308948, 0.05656016422229824, 0.27384540518920725, 0.11964218252890316, 0.057512339254717715, 0.10524754331849814, 0.26977411730797674, 0.11472409579115636, 0.16268790187828697, -0.1908821175325127, 0.0056512627778935, 0.019692713729213943]
|
1,803.06561
|
AutoML from Service Provider's Perspective: Multi-device, Multi-tenant
Model Selection with GP-EI
|
AutoML has become a popular service that is provided by most leading cloud
service providers today. In this paper, we focus on the AutoML problem from the
\emph{service provider's perspective}, motivated by the following practical
consideration: When an AutoML service needs to serve {\em multiple users} with
{\em multiple devices} at the same time, how can we allocate these devices to
users in an efficient way? We focus on GP-EI, one of the most popular
algorithms for automatic model selection and hyperparameter tuning, used by
systems such as Google Vizer. The technical contribution of this paper is the
first multi-device, multi-tenant algorithm for GP-EI that is aware of
\emph{multiple} computation devices and multiple users sharing the same set of
computation devices. Theoretically, given $N$ users and $M$ devices, we obtain
a regret bound of $O((\text{\bf {MIU}}(T,K) + M)\frac{N^2}{M})$, where
$\text{\bf {MIU}}(T,K)$ refers to the maximal incremental uncertainty up to
time $T$ for the covariance matrix $K$. Empirically, we evaluate our algorithm
on two applications of automatic model selection, and show that our algorithm
significantly outperforms the strategy of serving users independently.
Moreover, when multiple computation devices are available, we achieve
near-linear speedup when the number of users is much larger than the number of
devices.
|
cs.LG cs.DC stat.ML
|
automl has become a popular service that is provided by most leading cloud service providers today in this paper we focus on the automl problem from the emphservice providers perspective motivated by the following practical consideration when an automl service needs to serve em multiple users with em multiple devices at the same time how can we allocate these devices to users in an efficient way we focus on gpei one of the most popular algorithms for automatic model selection and hyperparameter tuning used by systems such as google vizer the technical contribution of this paper is the first multidevice multitenant algorithm for gpei that is aware of emphmultiple computation devices and multiple users sharing the same set of computation devices theoretically given n users and m devices we obtain a regret bound of otextbf miutk mfracn2m where textbf miutk refers to the maximal incremental uncertainty up to time t for the covariance matrix k empirically we evaluate our algorithm on two applications of automatic model selection and show that our algorithm significantly outperforms the strategy of serving users independently moreover when multiple computation devices are available we achieve nearlinear speedup when the number of users is much larger than the number of devices
|
[['automl', 'has', 'become', 'a', 'popular', 'service', 'that', 'is', 'provided', 'by', 'most', 'leading', 'cloud', 'service', 'providers', 'today', 'in', 'this', 'paper', 'we', 'focus', 'on', 'the', 'automl', 'problem', 'from', 'the', 'emphservice', 'providers', 'perspective', 'motivated', 'by', 'the', 'following', 'practical', 'consideration', 'when', 'an', 'automl', 'service', 'needs', 'to', 'serve', 'em', 'multiple', 'users', 'with', 'em', 'multiple', 'devices', 'at', 'the', 'same', 'time', 'how', 'can', 'we', 'allocate', 'these', 'devices', 'to', 'users', 'in', 'an', 'efficient', 'way', 'we', 'focus', 'on', 'gpei', 'one', 'of', 'the', 'most', 'popular', 'algorithms', 'for', 'automatic', 'model', 'selection', 'and', 'hyperparameter', 'tuning', 'used', 'by', 'systems', 'such', 'as', 'google', 'vizer', 'the', 'technical', 'contribution', 'of', 'this', 'paper', 'is', 'the', 'first', 'multidevice', 'multitenant', 'algorithm', 'for', 'gpei', 'that', 'is', 'aware', 'of', 'emphmultiple', 'computation', 'devices', 'and', 'multiple', 'users', 'sharing', 'the', 'same', 'set', 'of', 'computation', 'devices', 'theoretically', 'given', 'n', 'users', 'and', 'm', 'devices', 'we', 'obtain', 'a', 'regret', 'bound', 'of', 'otextbf', 'miutk', 'mfracn2m', 'where', 'textbf', 'miutk', 'refers', 'to', 'the', 'maximal', 'incremental', 'uncertainty', 'up', 'to', 'time', 't', 'for', 'the', 'covariance', 'matrix', 'k', 'empirically', 'we', 'evaluate', 'our', 'algorithm', 'on', 'two', 'applications', 'of', 'automatic', 'model', 'selection', 'and', 'show', 'that', 'our', 'algorithm', 'significantly', 'outperforms', 'the', 'strategy', 'of', 'serving', 'users', 'independently', 'moreover', 'when', 'multiple', 'computation', 'devices', 'are', 'available', 'we', 'achieve', 'nearlinear', 'speedup', 'when', 'the', 'number', 'of', 'users', 'is', 'much', 'larger', 'than', 'the', 'number', 'of', 'devices']]
|
[-0.15056320234323528, 0.025706467827245002, -0.04170357143206887, 0.034966813897639136, -0.10941080994033558, -0.19709687943841755, 0.11473248797485221, 0.4122324508881599, -0.2506364370197825, -0.34680046257211933, 0.0834703446780074, -0.2797099012241233, -0.15541809719130772, 0.21803621946478347, -0.10430450426679615, 0.07105301676116808, 0.05727728709037973, 0.04941006543158071, 0.006875226539723463, -0.3252500175456306, 0.2872998080258468, 0.0609221579038992, 0.3217115618672278, 0.03928852082351831, 0.058915776912539485, 0.02025959970916261, -0.028804490049650435, -0.026335308239350666, -0.07961864118231314, 0.15312976046434917, 0.2962038542796862, 0.1987591617151009, 0.36290173649544544, -0.42086233262290906, -0.14916533274323346, 0.10179559314089953, 0.179441509831547, 0.07467120707072505, -0.03754561979864167, -0.2568134741012906, 0.1529109142556899, -0.21135668360701898, -0.030740404114651905, -0.06878172593242746, 0.005086977348368072, 0.0039017970800100258, -0.307418055462665, -0.03848592136242432, -0.005687526050468336, 0.01911261537575617, -0.018279623941868783, -0.13226018434427866, 0.04975368768964244, 0.16954888938443535, 0.05576889191393802, -0.0016878479962625036, 0.13893987082094703, -0.12124544282846156, -0.14199434155504684, 0.3943831064743013, -0.016742116904214385, -0.1650769192322939, 0.16811903268590234, -0.031363303288723804, -0.16359353530918008, 0.07041760616504059, 0.22288079617718168, 0.133952684140935, -0.17030495121639547, 0.06047452659575484, -0.034019694626144126, 0.15991988423369338, 0.04550064806522212, 0.06178878430960391, 0.13233168811382884, 0.21142301762865004, 0.1412287468310614, 0.10890537360683084, -0.029918385709954153, -0.059225603671341984, -0.204554836344133, -0.15903153529843483, -0.22817135111068437, 0.012358826647124174, -0.10664143174361372, -0.11905209735578778, 0.36400828757627524, 0.2238249456271267, 0.156439322571097, 0.10251029785699094, 0.37649784492207083, 0.07950070829824814, 0.09108333207021033, 0.15861728332758923, 0.13747200368079895, -0.006710460726007931, 0.1445224014410384, -0.1883204953941568, 0.10470649439855549, 0.010244824715314349]
|
1,803.06562
|
Nanoscale domain patterns and a concept for an energy harvester
|
The current work employs a phase-field model to test the stability of
nanoscale periodic domain patterns, and to explore the application of one
pattern in an energy harvester device. At first, the stability of several
periodic domain patterns with in-plane polarizations is tested under
stress-free and electric field-free conditions. It is found that simple domain
patterns with stripe-like features are stable, while patterns with more complex
domain configurations are typically unstable at the nanoscale. Upon identifying
a stable domain pattern with suitable properties, a conceptual design of a thin
film energy harvester device is explored. The harvester is modelled as a thin
ferroelectric film bound to a substrate. In the initial state a periodic stripe
domain pattern with zero net charge on the top electrode is modelled. On
bending the substrate, a mechanical strain is induced in the film, causing
polarized domains to undergo ferroelectric switching and thus generate
electrical energy. The results demonstrate the working cycle of a conceptual
energy harvester which, on operating at kHz frequencies, such as from
vibrations in the environment, could produce an area power density of about
40W/m2.
|
physics.app-ph
|
the current work employs a phasefield model to test the stability of nanoscale periodic domain patterns and to explore the application of one pattern in an energy harvester device at first the stability of several periodic domain patterns with inplane polarizations is tested under stressfree and electric fieldfree conditions it is found that simple domain patterns with stripelike features are stable while patterns with more complex domain configurations are typically unstable at the nanoscale upon identifying a stable domain pattern with suitable properties a conceptual design of a thin film energy harvester device is explored the harvester is modelled as a thin ferroelectric film bound to a substrate in the initial state a periodic stripe domain pattern with zero net charge on the top electrode is modelled on bending the substrate a mechanical strain is induced in the film causing polarized domains to undergo ferroelectric switching and thus generate electrical energy the results demonstrate the working cycle of a conceptual energy harvester which on operating at khz frequencies such as from vibrations in the environment could produce an area power density of about 40wm2
|
[['the', 'current', 'work', 'employs', 'a', 'phasefield', 'model', 'to', 'test', 'the', 'stability', 'of', 'nanoscale', 'periodic', 'domain', 'patterns', 'and', 'to', 'explore', 'the', 'application', 'of', 'one', 'pattern', 'in', 'an', 'energy', 'harvester', 'device', 'at', 'first', 'the', 'stability', 'of', 'several', 'periodic', 'domain', 'patterns', 'with', 'inplane', 'polarizations', 'is', 'tested', 'under', 'stressfree', 'and', 'electric', 'fieldfree', 'conditions', 'it', 'is', 'found', 'that', 'simple', 'domain', 'patterns', 'with', 'stripelike', 'features', 'are', 'stable', 'while', 'patterns', 'with', 'more', 'complex', 'domain', 'configurations', 'are', 'typically', 'unstable', 'at', 'the', 'nanoscale', 'upon', 'identifying', 'a', 'stable', 'domain', 'pattern', 'with', 'suitable', 'properties', 'a', 'conceptual', 'design', 'of', 'a', 'thin', 'film', 'energy', 'harvester', 'device', 'is', 'explored', 'the', 'harvester', 'is', 'modelled', 'as', 'a', 'thin', 'ferroelectric', 'film', 'bound', 'to', 'a', 'substrate', 'in', 'the', 'initial', 'state', 'a', 'periodic', 'stripe', 'domain', 'pattern', 'with', 'zero', 'net', 'charge', 'on', 'the', 'top', 'electrode', 'is', 'modelled', 'on', 'bending', 'the', 'substrate', 'a', 'mechanical', 'strain', 'is', 'induced', 'in', 'the', 'film', 'causing', 'polarized', 'domains', 'to', 'undergo', 'ferroelectric', 'switching', 'and', 'thus', 'generate', 'electrical', 'energy', 'the', 'results', 'demonstrate', 'the', 'working', 'cycle', 'of', 'a', 'conceptual', 'energy', 'harvester', 'which', 'on', 'operating', 'at', 'khz', 'frequencies', 'such', 'as', 'from', 'vibrations', 'in', 'the', 'environment', 'could', 'produce', 'an', 'area', 'power', 'density', 'of', 'about', '40wm2']]
|
[-0.18145292654030454, 0.16502827491316704, -0.07599855088781504, -0.01493695673413188, -0.08012984156013146, -0.13169076140776603, 0.04701703394218628, 0.43741580243400535, -0.2876689350919523, -0.28372322761865915, 0.09017662079292324, -0.2431933633827915, -0.10338667805606876, 0.21701706477563035, -0.02775346525675042, 0.031205392711734795, 0.023092930530238632, -0.010166328779518442, -0.010087313630511283, -0.11628510060725235, 0.26735029959939216, 0.03434850304461303, 0.37152132801100857, 0.048883713151727765, 0.08137894138856663, -0.05847892488602325, 0.09242405371659033, 0.007908893941871088, -0.1265827621019759, 0.07752295533103533, 0.24961850457809498, -0.03438065057783261, 0.2164328881447799, -0.5016718461621003, -0.24037314824635275, 0.02750530684071967, 0.0681359111611309, 0.13550823271501036, -0.060246834834790125, -0.2491450932721704, 0.12612639031693584, -0.10184540366881166, -0.15247651228243536, -0.042912499992895106, 0.009759703371164902, 0.04425794544917292, -0.2541678924949412, 0.041042241379822215, 0.08715682617940367, 0.09499814986286918, -0.11779362638608191, -0.08923414478312587, -0.08258724394330724, 0.07308081342314518, 0.045215706169844445, 0.04689875147000077, 0.21300653983263776, -0.12324865201654808, -0.09591170268062034, 0.3586962352572976, -0.029150717367565696, -0.19986947959726625, 0.1787855280792249, -0.13769355677628045, -0.006247186455672067, 0.1604061762705608, 0.17089611195429238, 0.09215523280162628, -0.15131402335032984, 0.04542433841155888, 0.03740052270379854, 0.22961038317724736, 0.13924013754948364, 0.0077420584507581726, 0.2623198355911961, 0.2643118229029252, 0.10521080624821082, 0.18881659441922735, -0.09782541353545594, -0.06768509354684095, -0.26251835982592603, -0.09668647083027614, -0.19436033506358621, 0.030307927866125368, -0.06715408653821453, -0.20462712826197102, 0.4391734238785228, 0.06738907596493354, 0.155487710869581, -0.03861530657327744, 0.28895103554953844, 0.0704497390927981, 0.07185487495544443, 0.020049209922776035, 0.22300813024446287, 0.11695106698154303, 0.16055279693078336, -0.23151760178495992, 0.06440808172617617, -0.03930489137600802]
|
1,803.06563
|
Viewpoint: Artificial Intelligence and Labour
|
The welfare of modern societies has been intrinsically linked to wage labour.
With some exceptions, the modern human has to sell her labour-power to be able
reproduce biologically and socially. Thus, a lingering fear of technological
unemployment features predominately as a theme among Artificial Intelligence
researchers. In this short paper we show that, if past trends are anything to
go by, this fear is irrational. On the contrary, we argue that the main problem
humanity will be facing is the normalisation of extremely long working hours.
|
cs.CY cs.AI
|
the welfare of modern societies has been intrinsically linked to wage labour with some exceptions the modern human has to sell her labourpower to be able reproduce biologically and socially thus a lingering fear of technological unemployment features predominately as a theme among artificial intelligence researchers in this short paper we show that if past trends are anything to go by this fear is irrational on the contrary we argue that the main problem humanity will be facing is the normalisation of extremely long working hours
|
[['the', 'welfare', 'of', 'modern', 'societies', 'has', 'been', 'intrinsically', 'linked', 'to', 'wage', 'labour', 'with', 'some', 'exceptions', 'the', 'modern', 'human', 'has', 'to', 'sell', 'her', 'labourpower', 'to', 'be', 'able', 'reproduce', 'biologically', 'and', 'socially', 'thus', 'a', 'lingering', 'fear', 'of', 'technological', 'unemployment', 'features', 'predominately', 'as', 'a', 'theme', 'among', 'artificial', 'intelligence', 'researchers', 'in', 'this', 'short', 'paper', 'we', 'show', 'that', 'if', 'past', 'trends', 'are', 'anything', 'to', 'go', 'by', 'this', 'fear', 'is', 'irrational', 'on', 'the', 'contrary', 'we', 'argue', 'that', 'the', 'main', 'problem', 'humanity', 'will', 'be', 'facing', 'is', 'the', 'normalisation', 'of', 'extremely', 'long', 'working', 'hours']]
|
[-0.06408726930180017, 0.13150503723060383, -0.11511823464842404, 0.12861946681514383, -0.16330696339445078, -0.16307336545604117, 0.04695914349902202, 0.4172746521037291, -0.28389952985898537, -0.2989935486166574, 0.12252686091780882, -0.31846708810669094, -0.2010870587105541, 0.17662886163110242, -0.21429401563809197, -0.027305209198418785, 0.06104546371600864, 0.04324855884427534, 0.07478705051848117, -0.3210338100352708, 0.2653620892149561, 0.07585101098589161, 0.2527684185653925, 0.07325129484867349, 0.03761468659743995, -0.09164693879840129, -0.01336089556434137, -0.01139544588239754, -0.06883696857925423, 0.18073510776739568, 0.3579150648239781, 0.20519232045694746, 0.43508880955769735, -0.4717929056736038, -0.17367640558137176, 0.15639845363740973, 0.11934814972200376, 0.06688006512601585, -0.003437003427568604, -0.24253546367673312, 0.06316922533818904, -0.20126196579624187, -0.13243133735788218, -0.07327092719103401, 0.09626219107166809, 0.013024946031681098, -0.15938079376253025, 0.00294480037272853, 0.0288161472106688, 0.11019814397082775, -0.04293912003255066, -0.09495630374191986, 0.021613467744935083, 0.18783569126116, 0.1738156312638346, 0.031865302588352386, 0.15223630380761974, -0.1549482860712006, -0.1439169816672802, 0.40639062160078215, -0.004708051944480223, -0.12186901088913574, 0.19221586625584786, -0.1352796187514768, -0.16673540910432005, 0.07185108244199963, 0.1467260133475065, 0.028436731333460877, -0.1704604003140155, 0.033399128869367654, -0.05066403822206399, 0.2012826824451194, 0.08505866262952194, -0.0026937920161906413, 0.2758051672731252, 0.19068415181040216, 0.0655066903351861, 0.022983826677698424, 0.009060446553699234, -0.11651980988955235, -0.19895737698739943, -0.12534238646519097, -0.1181325270629981, 0.10727895330911612, 0.006522934938787812, -0.12994481660425664, 0.3334752971196876, 0.2159827049657264, 0.1518882795401356, 0.049320061394246294, 0.28843098893925984, 0.05827094257179209, 0.11311079674016904, 0.06702565540395239, 0.24968266699305625, -0.0059476551572408744, 0.17366598760709168, -0.16420365871094605, 0.20691850653794758, -0.05228900116430048]
|
1,803.06564
|
Nanoscale periodic domain patterns in tetragonal ferroelectrics: A
phase-field study
|
Ferroelectrics form domain patterns that minimize their energy subject to
imposed boundary conditions. In a linear, constrained theory, that neglects
domain wall energy, periodic domain patterns in the form of multi-rank
laminates can be identified as minimum-energy states. However, when these
laminates (formed in a macroscopic crystal) comprise domains that are a few
nanometers in size, the domain-wall energy becomes significant, and the
behaviour of laminate patterns at this scale is not known. Here, a phase-field
model, which accounts for gradient energy and strain energy contributions, is
employed to explore the stability and evolution of the nanoscale multi-rank
laminates. The stress, electric field, and domain wall energies in the
laminates are computed. The effect of scaling is also discussed. In the absence
of external loading, stripe domain patterns are found to be lower energy states
than the more complex, multi-rank laminates, which mostly collapse into simpler
patterns. However, complex laminates can be stabilized by imposing external
loads such as electric field, average strain and polarization. The study
provides insight into the domain patterns that may form on a macroscopic single
crystal but comprising of nanoscale periodic patterns, and on the effect of
external loads on these patterns.
|
cond-mat.mtrl-sci
|
ferroelectrics form domain patterns that minimize their energy subject to imposed boundary conditions in a linear constrained theory that neglects domain wall energy periodic domain patterns in the form of multirank laminates can be identified as minimumenergy states however when these laminates formed in a macroscopic crystal comprise domains that are a few nanometers in size the domainwall energy becomes significant and the behaviour of laminate patterns at this scale is not known here a phasefield model which accounts for gradient energy and strain energy contributions is employed to explore the stability and evolution of the nanoscale multirank laminates the stress electric field and domain wall energies in the laminates are computed the effect of scaling is also discussed in the absence of external loading stripe domain patterns are found to be lower energy states than the more complex multirank laminates which mostly collapse into simpler patterns however complex laminates can be stabilized by imposing external loads such as electric field average strain and polarization the study provides insight into the domain patterns that may form on a macroscopic single crystal but comprising of nanoscale periodic patterns and on the effect of external loads on these patterns
|
[['ferroelectrics', 'form', 'domain', 'patterns', 'that', 'minimize', 'their', 'energy', 'subject', 'to', 'imposed', 'boundary', 'conditions', 'in', 'a', 'linear', 'constrained', 'theory', 'that', 'neglects', 'domain', 'wall', 'energy', 'periodic', 'domain', 'patterns', 'in', 'the', 'form', 'of', 'multirank', 'laminates', 'can', 'be', 'identified', 'as', 'minimumenergy', 'states', 'however', 'when', 'these', 'laminates', 'formed', 'in', 'a', 'macroscopic', 'crystal', 'comprise', 'domains', 'that', 'are', 'a', 'few', 'nanometers', 'in', 'size', 'the', 'domainwall', 'energy', 'becomes', 'significant', 'and', 'the', 'behaviour', 'of', 'laminate', 'patterns', 'at', 'this', 'scale', 'is', 'not', 'known', 'here', 'a', 'phasefield', 'model', 'which', 'accounts', 'for', 'gradient', 'energy', 'and', 'strain', 'energy', 'contributions', 'is', 'employed', 'to', 'explore', 'the', 'stability', 'and', 'evolution', 'of', 'the', 'nanoscale', 'multirank', 'laminates', 'the', 'stress', 'electric', 'field', 'and', 'domain', 'wall', 'energies', 'in', 'the', 'laminates', 'are', 'computed', 'the', 'effect', 'of', 'scaling', 'is', 'also', 'discussed', 'in', 'the', 'absence', 'of', 'external', 'loading', 'stripe', 'domain', 'patterns', 'are', 'found', 'to', 'be', 'lower', 'energy', 'states', 'than', 'the', 'more', 'complex', 'multirank', 'laminates', 'which', 'mostly', 'collapse', 'into', 'simpler', 'patterns', 'however', 'complex', 'laminates', 'can', 'be', 'stabilized', 'by', 'imposing', 'external', 'loads', 'such', 'as', 'electric', 'field', 'average', 'strain', 'and', 'polarization', 'the', 'study', 'provides', 'insight', 'into', 'the', 'domain', 'patterns', 'that', 'may', 'form', 'on', 'a', 'macroscopic', 'single', 'crystal', 'but', 'comprising', 'of', 'nanoscale', 'periodic', 'patterns', 'and', 'on', 'the', 'effect', 'of', 'external', 'loads', 'on', 'these', 'patterns']]
|
[-0.16175522192482963, 0.1960650391801057, -0.06612382553810925, 0.04074273990386823, -0.09075542666292205, -0.0815144053761975, 0.014774591741766686, 0.40580112843533156, -0.2899939351819153, -0.3032577549235016, 0.10421495133571251, -0.23138291335329036, -0.13384788252678015, 0.17320238937136864, -0.003145435328600068, 0.006990299515218148, 0.007172920581586848, -0.025170916744607127, -0.030324896895929432, -0.1666067772956215, 0.2781040880292522, 0.004886813839391668, 0.3518312497107019, 0.0734651070797277, 0.048040716147740484, -0.04309077289659852, 0.06223760755274085, 0.08703799799278492, -0.11453174620817727, 0.08224621623090284, 0.2326056377218828, -0.018062131864675864, 0.21868161230258226, -0.5314452842842352, -0.25232318486205213, 0.06580605987244614, 0.12897032142621537, 0.13445847026583016, -0.044433414529276856, -0.24592233742918196, 0.09892963347034671, -0.09667749057623184, -0.1289950816178231, -0.08584710525414968, -0.004192816340577254, 0.04567346995138578, -0.25263481439909125, 0.11320705561136926, 0.05481992218747433, 0.06794489898865447, -0.14103899653268231, -0.12401170629847247, -0.07121960045107957, 0.07603330194177745, 0.06360949659637331, 0.015151824860072454, 0.1953655925418633, -0.1520437560502799, -0.06756344973996073, 0.399755167297376, 0.0007070281201126148, -0.25345226601806237, 0.15823283515690925, -0.13413943929437, -0.04466452012145845, 0.15738061663746683, 0.19937070121744596, 0.09019856151151423, -0.16911468694737325, 0.03438050760934838, 0.01962087896290864, 0.19328667150413248, 0.12889574558667952, 0.027814219669713095, 0.2098270112951168, 0.18149067814518619, 0.06462208275224654, 0.18614240920260966, -0.04730655222677337, -0.0873454139534819, -0.2660878095397641, -0.09637793190044536, -0.1835807823495665, 0.0325225687215399, -0.09512781404472324, -0.1994861317331652, 0.39792316119886256, 0.07702655706207179, 0.1474615783161167, -0.008648973987745074, 0.24648459800779063, 0.08630662542758367, 0.12846251536836745, 0.042484360574484625, 0.2393490262495042, 0.10181364044783457, 0.1311708776348833, -0.2131885200878369, 0.07268789052481049, -0.01844795127068339]
|
1,803.06565
|
Effect of Electron-RBM Phonon Interaction on Conductance of carbon
nanotubes
|
We use the energy analysis as a perturbative method to study the effect of
electron-radial breathing mode (RBM) phonon interaction on the electrical
conductivity of long metallic zigzag carbon nanotubes (CNTs). The band
structure of zigzag CNTs is calculated by exerting zone-folding method on
relations derived by using the nearest neighbor approximation of tight-binding
expression for the $\pi$ valence and conduction bands of graphene. The small
hollow cylinder model, with two different approximations, is used to obtain the
RBM frequency in our calculation. As the result, we have calculated the effects
of electron$ - $RBM phonon interaction on the conductance of zigzag CNTs. It
has been observed that current is a step$ - $like function of bias voltage
because of the absorption or emission by electron injection in the system.
Moreover, the dependence of the conductance to the temperature in low bias and
high bias voltages has been studied. In this paper, we propose a simple and
useful method for phonon spectroscopy. Also, since RBM mode determines the
geometry and structure of CNT, this approach can be used for characterization
of CNTs.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
we use the energy analysis as a perturbative method to study the effect of electronradial breathing mode rbm phonon interaction on the electrical conductivity of long metallic zigzag carbon nanotubes cnts the band structure of zigzag cnts is calculated by exerting zonefolding method on relations derived by using the nearest neighbor approximation of tightbinding expression for the pi valence and conduction bands of graphene the small hollow cylinder model with two different approximations is used to obtain the rbm frequency in our calculation as the result we have calculated the effects of electron rbm phonon interaction on the conductance of zigzag cnts it has been observed that current is a step like function of bias voltage because of the absorption or emission by electron injection in the system moreover the dependence of the conductance to the temperature in low bias and high bias voltages has been studied in this paper we propose a simple and useful method for phonon spectroscopy also since rbm mode determines the geometry and structure of cnt this approach can be used for characterization of cnts
|
[['we', 'use', 'the', 'energy', 'analysis', 'as', 'a', 'perturbative', 'method', 'to', 'study', 'the', 'effect', 'of', 'electronradial', 'breathing', 'mode', 'rbm', 'phonon', 'interaction', 'on', 'the', 'electrical', 'conductivity', 'of', 'long', 'metallic', 'zigzag', 'carbon', 'nanotubes', 'cnts', 'the', 'band', 'structure', 'of', 'zigzag', 'cnts', 'is', 'calculated', 'by', 'exerting', 'zonefolding', 'method', 'on', 'relations', 'derived', 'by', 'using', 'the', 'nearest', 'neighbor', 'approximation', 'of', 'tightbinding', 'expression', 'for', 'the', 'pi', 'valence', 'and', 'conduction', 'bands', 'of', 'graphene', 'the', 'small', 'hollow', 'cylinder', 'model', 'with', 'two', 'different', 'approximations', 'is', 'used', 'to', 'obtain', 'the', 'rbm', 'frequency', 'in', 'our', 'calculation', 'as', 'the', 'result', 'we', 'have', 'calculated', 'the', 'effects', 'of', 'electron', 'rbm', 'phonon', 'interaction', 'on', 'the', 'conductance', 'of', 'zigzag', 'cnts', 'it', 'has', 'been', 'observed', 'that', 'current', 'is', 'a', 'step', 'like', 'function', 'of', 'bias', 'voltage', 'because', 'of', 'the', 'absorption', 'or', 'emission', 'by', 'electron', 'injection', 'in', 'the', 'system', 'moreover', 'the', 'dependence', 'of', 'the', 'conductance', 'to', 'the', 'temperature', 'in', 'low', 'bias', 'and', 'high', 'bias', 'voltages', 'has', 'been', 'studied', 'in', 'this', 'paper', 'we', 'propose', 'a', 'simple', 'and', 'useful', 'method', 'for', 'phonon', 'spectroscopy', 'also', 'since', 'rbm', 'mode', 'determines', 'the', 'geometry', 'and', 'structure', 'of', 'cnt', 'this', 'approach', 'can', 'be', 'used', 'for', 'characterization', 'of', 'cnts']]
|
[-0.10893534494865706, 0.10875428586940714, -0.07133653159409387, 0.01495955629318474, -0.0308670901603003, -0.16463811506449594, 0.09452093445485218, 0.45841636610680453, -0.27520924955918635, -0.2752655431753097, 0.018179061799180076, -0.2815761108389749, -0.1340624059826219, 0.17213166590946513, 0.04046014117794996, 0.028860043467540494, 0.06657354420378762, -0.02675526960773716, -0.03316560160699066, -0.17644254451841324, 0.24969508554058034, 0.06748466270158911, 0.3480053204293857, 0.126598780829064, 0.04459391803059248, 0.03347190472495081, 0.07583633883903063, 0.0514476229670827, -0.14796438767257186, 0.10556013934969818, 0.22209056351378081, -0.07815838154072369, 0.238645838058486, -0.4492993422747491, -0.20182620989959998, -0.0030170605103641375, 0.1560103387192058, 0.16669706295780296, -0.00847372787649478, -0.22835455016446346, 0.06933026625020378, -0.1665156743744149, -0.0977185989720955, -0.0790208738008462, 0.012742266345082381, 0.005229588417211475, -0.2191631256494744, 0.11144835598862407, 0.04536468990559445, 0.06316528723486725, -0.08840662751648595, -0.14432031510582496, -0.06567549410369768, 0.0796875898980252, 0.06015186700982942, -0.008437711230411543, 0.18673358940618248, -0.08843178729989759, -0.09557790956954217, 0.38896486606428077, -0.10855742367296661, -0.1505794737744275, 0.13651661260193995, -0.15677105927548513, -0.05299480781011159, 0.13516070677862405, 0.13084237013914876, 0.09711123345674708, -0.16500595301993232, 0.06696859996537574, 0.0018037193527642907, 0.1235128104239286, 0.0796029116105101, 0.04162907480995832, 0.20287998234488944, 0.2143199298915833, 0.038061058196868724, 0.14645449341048472, -0.171264454931822, 0.02170514820830366, -0.2003300819889377, -0.1547732335026246, -0.24648753089235845, 0.05226730135355311, -0.06429323543340498, -0.22782122868232887, 0.46027414850869824, 0.11675151750996875, 0.16313670501737287, 0.012635809550186693, 0.28798092156648636, 0.18324690370094657, 0.10188341070767805, 0.017571576933331615, 0.26183845915222886, 0.1985635206704262, 0.07570982601379132, -0.29724771090309715, 0.06914490841162604, 0.0306671009744991]
|
1,803.06566
|
Computing the Best Approximation Over the Intersection of a Polyhedral
Set and the Doubly Nonnegative Cone
|
This paper introduces an efficient algorithm for computing the best
approximation of a given matrix onto the intersection of linear equalities,
inequalities and the doubly nonnegative cone (the cone of all positive
semidefinite matrices whose elements are nonnegative). In contrast to directly
applying the block coordinate descent type methods, we propose an inexact
accelerated (two-)block coordinate descent algorithm to tackle the four-block
unconstrained nonsmooth dual program. The proposed algorithm hinges on the
efficient semismooth Newton method to solve the subproblems, which have no
closed form solutions since the original four blocks are merged into two larger
blocks. The $O(1/k^2)$ iteration complexity of the proposed algorithm is
established. Extensive numerical results over various large scale semidefinite
programming instances from relaxations of combinatorial problems demonstrate
the effectiveness of the proposed algorithm.
|
math.OC
|
this paper introduces an efficient algorithm for computing the best approximation of a given matrix onto the intersection of linear equalities inequalities and the doubly nonnegative cone the cone of all positive semidefinite matrices whose elements are nonnegative in contrast to directly applying the block coordinate descent type methods we propose an inexact accelerated twoblock coordinate descent algorithm to tackle the fourblock unconstrained nonsmooth dual program the proposed algorithm hinges on the efficient semismooth newton method to solve the subproblems which have no closed form solutions since the original four blocks are merged into two larger blocks the o1k2 iteration complexity of the proposed algorithm is established extensive numerical results over various large scale semidefinite programming instances from relaxations of combinatorial problems demonstrate the effectiveness of the proposed algorithm
|
[['this', 'paper', 'introduces', 'an', 'efficient', 'algorithm', 'for', 'computing', 'the', 'best', 'approximation', 'of', 'a', 'given', 'matrix', 'onto', 'the', 'intersection', 'of', 'linear', 'equalities', 'inequalities', 'and', 'the', 'doubly', 'nonnegative', 'cone', 'the', 'cone', 'of', 'all', 'positive', 'semidefinite', 'matrices', 'whose', 'elements', 'are', 'nonnegative', 'in', 'contrast', 'to', 'directly', 'applying', 'the', 'block', 'coordinate', 'descent', 'type', 'methods', 'we', 'propose', 'an', 'inexact', 'accelerated', 'twoblock', 'coordinate', 'descent', 'algorithm', 'to', 'tackle', 'the', 'fourblock', 'unconstrained', 'nonsmooth', 'dual', 'program', 'the', 'proposed', 'algorithm', 'hinges', 'on', 'the', 'efficient', 'semismooth', 'newton', 'method', 'to', 'solve', 'the', 'subproblems', 'which', 'have', 'no', 'closed', 'form', 'solutions', 'since', 'the', 'original', 'four', 'blocks', 'are', 'merged', 'into', 'two', 'larger', 'blocks', 'the', 'o1k2', 'iteration', 'complexity', 'of', 'the', 'proposed', 'algorithm', 'is', 'established', 'extensive', 'numerical', 'results', 'over', 'various', 'large', 'scale', 'semidefinite', 'programming', 'instances', 'from', 'relaxations', 'of', 'combinatorial', 'problems', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'algorithm']]
|
[-0.10997049563723191, -0.044244172529618854, -0.07453588809991299, 0.05231066933984673, -0.09741727162925021, -0.19766949639698966, -0.00023953490818366986, 0.35103875340879426, -0.3670900301978916, -0.25515561966634315, 0.15019044837672552, -0.23094026794451353, -0.1910931028302961, 0.18487090512012788, -0.07457424484395472, 0.11609643479978825, 0.08780646381733664, -0.028287703917693894, -0.16160535035638432, -0.34538692531948406, 0.27000452818478954, 0.008996204160832504, 0.250255583709669, 0.007220043842283677, 0.17967801789442697, -0.010290907194130412, -0.018798664089494436, 0.05854660851787054, -0.05265596595614455, 0.17708436079150022, 0.29469747509439154, 0.2432669021672923, 0.34402872923790484, -0.4500602219946856, -0.07167308853285806, 0.12061032213905985, 0.16047600627328132, 0.09070298125400648, -0.06674832808550504, -0.247543460342044, 0.09744377694157667, -0.09361727710798845, -0.0770963061593704, -0.10470925571303093, -0.06614677074397805, 0.0038600141325128056, -0.3096267740962334, -0.0015723573498774407, 0.04570437044486432, -0.009944455213519896, -0.07907222074550367, -0.20637341319446184, 0.07766562584307507, 0.0014863404979597228, 0.0561176547618193, 0.012207944972202355, 0.10632796372221999, 0.004479171998813286, -0.15862695961403697, 0.3318692844779801, -0.005662566442547958, -0.2527483794098186, 0.1405583218664162, -0.027967027659246396, -0.14282988219218717, 0.18595600426341444, 0.2264834316196949, 0.24290783999328927, -0.14147035756541865, 0.1441291448034801, -0.10438053379225176, 0.10237600109287241, 0.05368688002286493, -0.04052582882117307, 0.10423633722992715, 0.10199904782731851, 0.16879874657182556, 0.16449214425118452, -0.007311655453933302, -0.15427323909433083, -0.25877963650480723, -0.13977886331556438, -0.236552562531221, -0.026583941638931748, -0.18219745059508033, -0.18367134506973012, 0.40481827164595846, 0.10393015598849387, 0.18267892090993565, 0.15524244238532242, 0.33755481478491034, 0.11018517174822993, 0.079110895254642, 0.14302044511274542, 0.17621516956146374, 0.15235357312124598, 0.060716203109779966, -0.27930722142706893, 0.06645869840542938, 0.23074833778736664]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.