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.08967
|
Automatic phase calibration for RF cavities using beam-loading signals
|
Precise calibration of the cavity phase signals is necessary for the
operation of any particle accelerator. For many systems this requires human in
the loop adjustments based on measurements of the beam parameters downstream.
Some recent work has developed a scheme for the calibration of the cavity phase
using beam measurements and beam-loading however this scheme is still a
multi-step process that requires heavy automation or human in the loop. In this
paper we analyze a new scheme that uses only RF signals reacting to
beam-loading to calculate the phase of the beam relative to the cavity. This
technique could be used in slow control loops to provide real-time adjustment
of the cavity phase calibration without human intervention thereby increasing
the stability and reliability of the accelerator.
|
physics.acc-ph
|
precise calibration of the cavity phase signals is necessary for the operation of any particle accelerator for many systems this requires human in the loop adjustments based on measurements of the beam parameters downstream some recent work has developed a scheme for the calibration of the cavity phase using beam measurements and beamloading however this scheme is still a multistep process that requires heavy automation or human in the loop in this paper we analyze a new scheme that uses only rf signals reacting to beamloading to calculate the phase of the beam relative to the cavity this technique could be used in slow control loops to provide realtime adjustment of the cavity phase calibration without human intervention thereby increasing the stability and reliability of the accelerator
|
[['precise', 'calibration', 'of', 'the', 'cavity', 'phase', 'signals', 'is', 'necessary', 'for', 'the', 'operation', 'of', 'any', 'particle', 'accelerator', 'for', 'many', 'systems', 'this', 'requires', 'human', 'in', 'the', 'loop', 'adjustments', 'based', 'on', 'measurements', 'of', 'the', 'beam', 'parameters', 'downstream', 'some', 'recent', 'work', 'has', 'developed', 'a', 'scheme', 'for', 'the', 'calibration', 'of', 'the', 'cavity', 'phase', 'using', 'beam', 'measurements', 'and', 'beamloading', 'however', 'this', 'scheme', 'is', 'still', 'a', 'multistep', 'process', 'that', 'requires', 'heavy', 'automation', 'or', 'human', 'in', 'the', 'loop', 'in', 'this', 'paper', 'we', 'analyze', 'a', 'new', 'scheme', 'that', 'uses', 'only', 'rf', 'signals', 'reacting', 'to', 'beamloading', 'to', 'calculate', 'the', 'phase', 'of', 'the', 'beam', 'relative', 'to', 'the', 'cavity', 'this', 'technique', 'could', 'be', 'used', 'in', 'slow', 'control', 'loops', 'to', 'provide', 'realtime', 'adjustment', 'of', 'the', 'cavity', 'phase', 'calibration', 'without', 'human', 'intervention', 'thereby', 'increasing', 'the', 'stability', 'and', 'reliability', 'of', 'the', 'accelerator']]
|
[-0.13301487503881296, 0.1334907868987052, -0.08715263178469393, -0.009903592713321922, -0.061129118858535926, -0.1709670254073333, 0.09150842700692582, 0.4029925088654822, -0.2131830571277991, -0.3138025414022639, 0.11719462433169911, -0.20242073190009852, -0.08539779178658867, 0.2531450649413581, -0.09958931248576387, 0.12744238529735663, 0.09415592055118782, 0.008127303451426166, -0.04590382122372343, -0.16319366111640093, 0.2695328085463289, 0.1211459721698917, 0.28991426078705335, 0.04772888382486119, 0.13268939305947522, 0.008969013260193462, -0.021841969839700565, -0.044989296376309176, -0.07300750616863168, 0.11096382787401649, 0.23839957173524137, 0.12580375028334148, 0.2775401416726, -0.4593630037380485, -0.23040942934994388, 0.10700659905321984, 0.14382786421823923, 0.13388100729917918, -0.07388397004532327, -0.23467771772764565, 0.053297563265334434, -0.1694895423010109, -0.125609673790663, -0.06828182639451477, -0.045186344304994686, 0.006237994508238465, -0.3049521570893254, 0.006414104091722195, 0.03877410267354365, 0.07825269195889159, -0.007897856007293454, -0.040595268896656246, 0.04898591395504186, 0.1505180479514992, 0.0036403714808888412, 0.042668215684798054, 0.17534782968124185, -0.13152004367723238, -0.10366479380745587, 0.3678821653538332, -0.026340961122636015, -0.17587893900615492, 0.1509240499136632, -0.14960221450145203, -0.09953259703094565, 0.15704175216827806, 0.19516917433237702, 0.0814918020344156, -0.17226647106769283, 0.019773938325527086, 0.05310905701297475, 0.21000780084896392, 0.04639530935009399, 0.008410120634068772, 0.14885575944689786, 0.20290785500647748, 0.08196800130952928, 0.13641096533763802, -0.12353136044868275, -0.06191929429036191, -0.3031214405700022, -0.16564461841581637, -0.11412190522001249, -0.04062066857307035, -0.04409324072322471, -0.14107574727092906, 0.42060935876897, 0.1821785666943183, 0.14888937671588162, -0.018217133059291037, 0.3959108898196164, 0.10245851287434948, 0.08396385506704801, 0.005580022544270073, 0.27745621548493493, 0.10024847517039363, 0.14617822260969854, -0.2827807060501531, 0.0848726298243878, 0.029853044515915625]
|
1,803.08968
|
LLRF system for the Fermilab Muon g-2 and Mu2e projects
|
The Mu2e experiment measures the conversion rate of muons into electrons and
the Muon g-2 experiment measures the muon magnetic moment. Both experiments
require 53 MHz batches of 8 GeV protons to be re-bunched into 150 ns, 2.5 MHz
pulses for extraction to the g-2 target for Muon g-2 and to a delivery ring
with a single RF cavity running at 2.36 MHz for Mu2e. The LLRF system for both
experiments is implemented in a SOC FPGA board integrated into the existing 53
MHz LLRF system in a VXI crate. The tight timing requirements, the large
frequency difference and the non-harmonic relationship between the two RF
systems provide unique challenges to the LLRF system design to achieve the
required phase alignment specifications for beam formation, transfers and beam
extinction between pulses. The new LLRF system design for both projects is
described and the results of the initial beam commissioning tests for the Muon
g-2 experiment are presented.
|
physics.acc-ph
|
the mu2e experiment measures the conversion rate of muons into electrons and the muon g2 experiment measures the muon magnetic moment both experiments require 53 mhz batches of 8 gev protons to be rebunched into 150 ns 25 mhz pulses for extraction to the g2 target for muon g2 and to a delivery ring with a single rf cavity running at 236 mhz for mu2e the llrf system for both experiments is implemented in a soc fpga board integrated into the existing 53 mhz llrf system in a vxi crate the tight timing requirements the large frequency difference and the nonharmonic relationship between the two rf systems provide unique challenges to the llrf system design to achieve the required phase alignment specifications for beam formation transfers and beam extinction between pulses the new llrf system design for both projects is described and the results of the initial beam commissioning tests for the muon g2 experiment are presented
|
[['the', 'mu2e', 'experiment', 'measures', 'the', 'conversion', 'rate', 'of', 'muons', 'into', 'electrons', 'and', 'the', 'muon', 'g2', 'experiment', 'measures', 'the', 'muon', 'magnetic', 'moment', 'both', 'experiments', 'require', '53', 'mhz', 'batches', 'of', '8', 'gev', 'protons', 'to', 'be', 'rebunched', 'into', '150', 'ns', '25', 'mhz', 'pulses', 'for', 'extraction', 'to', 'the', 'g2', 'target', 'for', 'muon', 'g2', 'and', 'to', 'a', 'delivery', 'ring', 'with', 'a', 'single', 'rf', 'cavity', 'running', 'at', '236', 'mhz', 'for', 'mu2e', 'the', 'llrf', 'system', 'for', 'both', 'experiments', 'is', 'implemented', 'in', 'a', 'soc', 'fpga', 'board', 'integrated', 'into', 'the', 'existing', '53', 'mhz', 'llrf', 'system', 'in', 'a', 'vxi', 'crate', 'the', 'tight', 'timing', 'requirements', 'the', 'large', 'frequency', 'difference', 'and', 'the', 'nonharmonic', 'relationship', 'between', 'the', 'two', 'rf', 'systems', 'provide', 'unique', 'challenges', 'to', 'the', 'llrf', 'system', 'design', 'to', 'achieve', 'the', 'required', 'phase', 'alignment', 'specifications', 'for', 'beam', 'formation', 'transfers', 'and', 'beam', 'extinction', 'between', 'pulses', 'the', 'new', 'llrf', 'system', 'design', 'for', 'both', 'projects', 'is', 'described', 'and', 'the', 'results', 'of', 'the', 'initial', 'beam', 'commissioning', 'tests', 'for', 'the', 'muon', 'g2', 'experiment', 'are', 'presented']]
|
[-0.14168706011080828, 0.1588112543328092, 0.0011600767805551488, 0.044116507611201644, -0.017964267995781623, -0.17553487981263644, 0.03651424642101539, 0.3943107866992553, -0.18603102120164877, -0.3815628640019359, 0.0754886019190636, -0.2861401596769261, 0.04608382342251925, 0.27559007227850646, 0.02284722424407776, 0.08443929897083972, 0.09981482330476865, -0.03463040989691553, -0.0511207688230057, -0.19258633609234282, 0.17609892774206132, 0.14847502968190476, 0.3173942594633748, 0.06461597682955937, 0.16750770273248258, -0.07103892458447565, 0.03511894241763422, -0.11150185315189166, -0.07625452082048959, 0.062157405083640836, 0.27392352911052653, 0.14988567161923036, 0.17369984006150985, -0.4159344674613422, -0.08188633658350088, 0.05609267936923947, 0.07481868029124318, 0.012522633629254041, -0.07361869966067995, -0.30653508446919614, 0.08661055193545344, -0.18634902300217596, -0.10927802555931684, 0.003648566828372005, -0.016421147556497883, 0.0609733125147147, -0.3072637216014883, -0.03309704754979183, 0.01280315871983289, 0.08249471120488568, -0.06743300607941376, -0.14083296788605645, 0.08277365742012477, 0.1083940424813101, 0.00872271810658276, 0.10435412859302372, 0.17201707958399007, -0.0645953880120009, -0.15281265552263135, 0.34690569831470314, -0.03899643633354945, -0.12725807215349796, 0.1434565577775431, -0.22113490944805866, -0.0792828048709989, 0.18017325307935095, 0.21746658849625441, -0.011349347851370485, -0.20468602021066593, 0.012962118953510071, 0.05862681176035832, 0.2686354474474986, 0.08844341999755646, 0.02253111104857033, 0.21758137091707724, 0.24010683719713527, 0.08119200592437455, 0.13630665834614028, -0.1750393642190223, -0.01237319245074804, -0.3121076305337155, -0.12252239561908376, -0.11854830692456557, 0.024815448958319254, -0.01983548964189816, -0.030820712327766113, 0.4267317807922761, 0.08810390018446085, 0.12601301420885974, -0.004031168174920962, 0.38504547882490814, 0.07475720869544415, 0.08790386342204726, 0.04275647355004763, 0.2765622019696121, 0.13300590306365243, 0.18000714879674026, -0.29259326480006653, -0.03687718767338456, -0.009493889803520571]
|
1,803.08969
|
Operational experience of ALBA's Digital LLRF at SOLARIS Light Source
|
For control of RF cavities installed in Solaris storage ring light source the
digital Low Level RF (dLLRF) system was necessary from the beginning of
operation. Since there were no expertise at the new constructed facility and no
time for development due to funds deadline, almost turn-key dLLRF from Alba has
been implemented according to MAXIV selection. Thanks to high flexibility of
dLLRF only small adaptations were needed in terms of interfaces to auxiliary
systems and setup of parameters. This paper summarizes operational experience
about installation, commissioning, learning-curve from entry-level user, beam
operation and future upgrades of this dLLRF.
|
physics.acc-ph
|
for control of rf cavities installed in solaris storage ring light source the digital low level rf dllrf system was necessary from the beginning of operation since there were no expertise at the new constructed facility and no time for development due to funds deadline almost turnkey dllrf from alba has been implemented according to maxiv selection thanks to high flexibility of dllrf only small adaptations were needed in terms of interfaces to auxiliary systems and setup of parameters this paper summarizes operational experience about installation commissioning learningcurve from entrylevel user beam operation and future upgrades of this dllrf
|
[['for', 'control', 'of', 'rf', 'cavities', 'installed', 'in', 'solaris', 'storage', 'ring', 'light', 'source', 'the', 'digital', 'low', 'level', 'rf', 'dllrf', 'system', 'was', 'necessary', 'from', 'the', 'beginning', 'of', 'operation', 'since', 'there', 'were', 'no', 'expertise', 'at', 'the', 'new', 'constructed', 'facility', 'and', 'no', 'time', 'for', 'development', 'due', 'to', 'funds', 'deadline', 'almost', 'turnkey', 'dllrf', 'from', 'alba', 'has', 'been', 'implemented', 'according', 'to', 'maxiv', 'selection', 'thanks', 'to', 'high', 'flexibility', 'of', 'dllrf', 'only', 'small', 'adaptations', 'were', 'needed', 'in', 'terms', 'of', 'interfaces', 'to', 'auxiliary', 'systems', 'and', 'setup', 'of', 'parameters', 'this', 'paper', 'summarizes', 'operational', 'experience', 'about', 'installation', 'commissioning', 'learningcurve', 'from', 'entrylevel', 'user', 'beam', 'operation', 'and', 'future', 'upgrades', 'of', 'this', 'dllrf']]
|
[-0.1287833315092234, 0.09526208264049979, -0.04600206420908929, -0.034081713014938016, -0.10077689887661183, -0.20219749391877226, 0.06507262101810311, 0.4081930788091327, -0.18858239897621834, -0.37014412943140734, 0.17086192369888709, -0.22105927402818842, -0.039276352698667624, 0.2355517205991307, -0.1327672862466805, 0.09499723584467203, 0.09052033575574811, -0.003375143850963487, -0.027534407933244995, -0.2561517455900202, 0.20547907075806693, 0.20047868434244728, 0.3113199415027487, 0.044495097798656444, 0.14302218236665867, 0.018050420100976503, -0.05690225421828788, -0.08738351663955005, -0.06281920189568915, 0.06451742782504583, 0.33541309322249524, 0.17523555957227566, 0.2748330036292271, -0.4689775684002635, -0.13240029049855515, 0.07722921849095396, 0.08244112144671001, 0.040457586078353376, -0.0675657953097656, -0.24040338822773524, 0.08096757878214406, -0.22628182272114364, -0.12119169557010945, -0.028055020512974992, -0.0021760310806638126, 0.05569679399819246, -0.22563900924715385, -0.08273422514677656, 0.003940290837947812, 0.12370598631464325, -0.03458366635711674, -0.1273759535920084, 0.006740660942397176, 0.1413706542771994, 0.005828170737783823, 0.035866336135861314, 0.11386216230386374, -0.09834277966743982, -0.09904988389937397, 0.3449440116480905, 0.011464562046113519, -0.07586347223532729, 0.1950024495053352, -0.1367480284249296, -0.1274638355243951, 0.16283225709078264, 0.21064141931544458, 0.0085190861599938, -0.21574049165629192, 0.06289413181099118, 0.09405585621692697, 0.19002602779667596, 0.14038494991896466, 0.06249507702174312, 0.20360218631388732, 0.19546330371415432, 0.07916618848952456, 0.1469822422772342, -0.04829898101458212, -0.043918376118514915, -0.30651067106091245, -0.11625740392019554, -0.14743075628761362, -0.0016879978843926623, 0.04251753375672483, -0.06774887069109448, 0.3825268151181541, 0.15165086835147623, 0.07346892503935996, -0.01378850267287724, 0.3426502946079994, 0.03533279832110417, 0.13884451960650634, 0.05957149306198758, 0.20579527088616767, 0.06950952878402432, 0.22519680409103024, -0.16939620627862478, 0.09884963570903911, -0.015695277551588203]
|
1,803.0897
|
State measurement error-to-state stability results based on approximate
discrete-time models
|
Digital controller design for nonlinear systems may be complicated by the
fact that an exact discrete-time plant model is not known. One existing
approach employs approximate discrete-time models for stability analysis and
control design, and ensures different types of closedloop stability properties
based on the approximate model and on specific bounds on the mismatch between
the exact and approximate models. Although existing conditions for practical
stability exist, some of which consider the presence of process disturbances,
input-to-state stability with respect to state-measurement errors and based on
approximate discretetime models has not been addressed. In this paper, we thus
extend existing results in two main directions: (a) we provide input-to-state
stability (ISS)-related results where the input is the state measurement error
and (b) our results allow for some specific varying-sampling-rate scenarios. We
provide conditions to ensure semiglobal practical ISS, even under some specific
forms of varying sampling rate. These conditions employ Lyapunov-like
functions. We illustrate the application of our results on numerical examples,
where we show that a bounded state-measurement error can cause a semiglobal
practically stable system to diverge.
|
cs.SY
|
digital controller design for nonlinear systems may be complicated by the fact that an exact discretetime plant model is not known one existing approach employs approximate discretetime models for stability analysis and control design and ensures different types of closedloop stability properties based on the approximate model and on specific bounds on the mismatch between the exact and approximate models although existing conditions for practical stability exist some of which consider the presence of process disturbances inputtostate stability with respect to statemeasurement errors and based on approximate discretetime models has not been addressed in this paper we thus extend existing results in two main directions a we provide inputtostate stability issrelated results where the input is the state measurement error and b our results allow for some specific varyingsamplingrate scenarios we provide conditions to ensure semiglobal practical iss even under some specific forms of varying sampling rate these conditions employ lyapunovlike functions we illustrate the application of our results on numerical examples where we show that a bounded statemeasurement error can cause a semiglobal practically stable system to diverge
|
[['digital', 'controller', 'design', 'for', 'nonlinear', 'systems', 'may', 'be', 'complicated', 'by', 'the', 'fact', 'that', 'an', 'exact', 'discretetime', 'plant', 'model', 'is', 'not', 'known', 'one', 'existing', 'approach', 'employs', 'approximate', 'discretetime', 'models', 'for', 'stability', 'analysis', 'and', 'control', 'design', 'and', 'ensures', 'different', 'types', 'of', 'closedloop', 'stability', 'properties', 'based', 'on', 'the', 'approximate', 'model', 'and', 'on', 'specific', 'bounds', 'on', 'the', 'mismatch', 'between', 'the', 'exact', 'and', 'approximate', 'models', 'although', 'existing', 'conditions', 'for', 'practical', 'stability', 'exist', 'some', 'of', 'which', 'consider', 'the', 'presence', 'of', 'process', 'disturbances', 'inputtostate', 'stability', 'with', 'respect', 'to', 'statemeasurement', 'errors', 'and', 'based', 'on', 'approximate', 'discretetime', 'models', 'has', 'not', 'been', 'addressed', 'in', 'this', 'paper', 'we', 'thus', 'extend', 'existing', 'results', 'in', 'two', 'main', 'directions', 'a', 'we', 'provide', 'inputtostate', 'stability', 'issrelated', 'results', 'where', 'the', 'input', 'is', 'the', 'state', 'measurement', 'error', 'and', 'b', 'our', 'results', 'allow', 'for', 'some', 'specific', 'varyingsamplingrate', 'scenarios', 'we', 'provide', 'conditions', 'to', 'ensure', 'semiglobal', 'practical', 'iss', 'even', 'under', 'some', 'specific', 'forms', 'of', 'varying', 'sampling', 'rate', 'these', 'conditions', 'employ', 'lyapunovlike', 'functions', 'we', 'illustrate', 'the', 'application', 'of', 'our', 'results', 'on', 'numerical', 'examples', 'where', 'we', 'show', 'that', 'a', 'bounded', 'statemeasurement', 'error', 'can', 'cause', 'a', 'semiglobal', 'practically', 'stable', 'system', 'to', 'diverge']]
|
[-0.13670746109706197, 0.01572532824835527, -0.073407035578821, 0.059579403872498014, -0.05005957239365342, -0.17389033387788694, 0.04813465549108062, 0.3836625382767222, -0.26037164059293977, -0.26473936149067806, 0.21238346518501428, -0.19168125984579915, -0.18986636972170598, 0.2535402280946741, -0.12384358344147098, 0.1295834658456977, 0.07426637518324884, 0.012852224766337286, -0.0809799465265304, -0.24345733607230619, 0.31138180816903877, 0.03681784654614952, 0.2930707985950939, 0.03165688555218058, 0.10031012840842628, -0.029279225170454483, 0.008208411932517748, 0.00033078828003089137, -0.1663590123154924, 0.08511608426253926, 0.22863069261664884, 0.13521668393990963, 0.29092210721182454, -0.43827052514915915, -0.21087292233931879, 0.1254586085557443, 0.11933295652901722, 0.12539643996282043, -0.07400977268807148, -0.28618525262293276, 0.13286655522898724, -0.13527438583478626, -0.12033537600852423, -0.1324631153740052, -0.057088239576225566, 0.07734086762029825, -0.33905210210757575, 0.05961469292514405, 0.08841646800612199, 0.039589434630621624, -0.11926113946973688, -0.10781931445741826, 0.007076629033669997, 0.13343192969243658, 0.025115714764115952, -0.056743253495986176, 0.10253710561599004, -0.0696334423573614, -0.13569416368306525, 0.32654025478783133, -0.025723389844478525, -0.28167577567220914, 0.21442378832337758, -0.060227928634490925, -0.14563569105572283, 0.09419972647118283, 0.2106206721105313, 0.11100381505438837, -0.1394641005978683, 0.07432014888249822, -0.019034482807047285, 0.1880800264971699, 0.024230870644504066, 0.05835055142620021, 0.14259250080186642, 0.1700019525550832, 0.13135332050391257, 0.15236945466551466, -0.02544948833436826, -0.1613271031226163, -0.325732787823736, -0.07788818993468868, -0.10931578213822539, -0.006329463069204841, -0.08275982597267313, -0.15026424650700057, 0.3945494865325127, 0.21797541208197901, 0.15477733370863786, 0.10435450333762535, 0.33238131492951156, 0.12588010116553955, -0.012083598262943475, 0.07050903438258979, 0.2642394320690402, 0.1052277637974459, 0.06443620694927492, -0.21066971023476255, 0.10901136465612693, 0.04578994929099569]
|
1,803.08971
|
Computational Power and the Social Impact of Artificial Intelligence
|
Machine learning is a computational process. To that end, it is inextricably
tied to computational power - the tangible material of chips and semiconductors
that the algorithms of machine intelligence operate on. Most obviously,
computational power and computing architectures shape the speed of training and
inference in machine learning, and therefore influence the rate of progress in
the technology. But, these relationships are more nuanced than that: hardware
shapes the methods used by researchers and engineers in the design and
development of machine learning models. Characteristics such as the power
consumption of chips also define where and how machine learning can be used in
the real world.
Despite this, many analyses of the social impact of the current wave of
progress in AI have not substantively brought the dimension of hardware into
their accounts. While a common trope in both the popular press and scholarly
literature is to highlight the massive increase in computational power that has
enabled the recent breakthroughs in machine learning, the analysis frequently
goes no further than this observation around magnitude. This paper aims to dig
more deeply into the relationship between computational power and the
development of machine learning. Specifically, it examines how changes in
computing architectures, machine learning methodologies, and supply chains
might influence the future of AI. In doing so, it seeks to trace a set of
specific relationships between this underlying hardware layer and the broader
social impacts and risks around AI.
|
cs.AI cs.CY
|
machine learning is a computational process to that end it is inextricably tied to computational power the tangible material of chips and semiconductors that the algorithms of machine intelligence operate on most obviously computational power and computing architectures shape the speed of training and inference in machine learning and therefore influence the rate of progress in the technology but these relationships are more nuanced than that hardware shapes the methods used by researchers and engineers in the design and development of machine learning models characteristics such as the power consumption of chips also define where and how machine learning can be used in the real world despite this many analyses of the social impact of the current wave of progress in ai have not substantively brought the dimension of hardware into their accounts while a common trope in both the popular press and scholarly literature is to highlight the massive increase in computational power that has enabled the recent breakthroughs in machine learning the analysis frequently goes no further than this observation around magnitude this paper aims to dig more deeply into the relationship between computational power and the development of machine learning specifically it examines how changes in computing architectures machine learning methodologies and supply chains might influence the future of ai in doing so it seeks to trace a set of specific relationships between this underlying hardware layer and the broader social impacts and risks around ai
|
[['machine', 'learning', 'is', 'a', 'computational', 'process', 'to', 'that', 'end', 'it', 'is', 'inextricably', 'tied', 'to', 'computational', 'power', 'the', 'tangible', 'material', 'of', 'chips', 'and', 'semiconductors', 'that', 'the', 'algorithms', 'of', 'machine', 'intelligence', 'operate', 'on', 'most', 'obviously', 'computational', 'power', 'and', 'computing', 'architectures', 'shape', 'the', 'speed', 'of', 'training', 'and', 'inference', 'in', 'machine', 'learning', 'and', 'therefore', 'influence', 'the', 'rate', 'of', 'progress', 'in', 'the', 'technology', 'but', 'these', 'relationships', 'are', 'more', 'nuanced', 'than', 'that', 'hardware', 'shapes', 'the', 'methods', 'used', 'by', 'researchers', 'and', 'engineers', 'in', 'the', 'design', 'and', 'development', 'of', 'machine', 'learning', 'models', 'characteristics', 'such', 'as', 'the', 'power', 'consumption', 'of', 'chips', 'also', 'define', 'where', 'and', 'how', 'machine', 'learning', 'can', 'be', 'used', 'in', 'the', 'real', 'world', 'despite', 'this', 'many', 'analyses', 'of', 'the', 'social', 'impact', 'of', 'the', 'current', 'wave', 'of', 'progress', 'in', 'ai', 'have', 'not', 'substantively', 'brought', 'the', 'dimension', 'of', 'hardware', 'into', 'their', 'accounts', 'while', 'a', 'common', 'trope', 'in', 'both', 'the', 'popular', 'press', 'and', 'scholarly', 'literature', 'is', 'to', 'highlight', 'the', 'massive', 'increase', 'in', 'computational', 'power', 'that', 'has', 'enabled', 'the', 'recent', 'breakthroughs', 'in', 'machine', 'learning', 'the', 'analysis', 'frequently', 'goes', 'no', 'further', 'than', 'this', 'observation', 'around', 'magnitude', 'this', 'paper', 'aims', 'to', 'dig', 'more', 'deeply', 'into', 'the', 'relationship', 'between', 'computational', 'power', 'and', 'the', 'development', 'of', 'machine', 'learning', 'specifically', 'it', 'examines', 'how', 'changes', 'in', 'computing', 'architectures', 'machine', 'learning', 'methodologies', 'and', 'supply', 'chains', 'might', 'influence', 'the', 'future', 'of', 'ai', 'in', 'doing', 'so', 'it', 'seeks', 'to', 'trace', 'a', 'set', 'of', 'specific', 'relationships', 'between', 'this', 'underlying', 'hardware', 'layer', 'and', 'the', 'broader', 'social', 'impacts', 'and', 'risks', 'around', 'ai']]
|
[-0.06693644002627801, 0.058594054454436696, -0.08161185583307118, 0.045085220513345944, -0.12937718354744696, -0.15412533809939602, 0.04542751282506364, 0.3992641738228531, -0.2905355226742534, -0.34239951619181874, 0.08442601621857289, -0.2751213632046613, -0.20334872742723517, 0.23149413755946174, -0.10712731539216988, 0.07263415487054657, 0.061002192177962385, 0.03830670494539272, -0.04757204969969241, -0.2886290069025777, 0.2891910563143823, 0.08320798742596623, 0.34258894151968866, 0.05299888959764933, 0.042992602012456714, -0.04871740423244651, -0.03331873182377567, 0.0005805544024959457, -0.08284759999325249, 0.2293257694963198, 0.3393420698597643, 0.24970944887349977, 0.4024165782044415, -0.46707015121727397, -0.20886719875082183, 0.13058269327455552, 0.15791136440977516, 0.05761449798225511, -0.03221141232508763, -0.24060877131791236, 0.05215188881901813, -0.18658366999412818, -0.046577520359370135, -0.1019508757221536, 0.03981872480127867, 0.009923162565619427, -0.1808032827283561, -0.028848949349372835, 0.08189690864191022, 0.09987520818263997, -0.0029901307806990914, -0.12210588353566684, 0.027407617140913523, 0.15359868144786706, 0.08506586610526923, 0.031170399873732674, 0.17899990539817812, -0.22479921194212119, -0.15457606127342804, 0.3802322555204243, 0.018774941717563078, -0.16413858791367159, 0.2216842597000254, -0.07683020783392634, -0.16694309959430717, 0.07257104730683558, 0.2706785208698237, 0.025155151959414743, -0.15604539227304087, 0.055748406090351026, 0.062350435785133836, 0.15997976815609746, 0.03181865773537439, 0.017994481905367413, 0.2053847680506179, 0.2394924121145785, 0.029235494895124055, 0.09544525802587434, -0.06490212722638418, -0.1173860476696629, -0.18536465921431405, -0.16161605697262155, -0.17025650932723577, 0.017953090309292593, -0.06872874070981227, -0.13175742432512755, 0.38582489701347944, 0.22729691689421408, 0.15004924437649422, 0.045661692771700624, 0.3536459845089659, 0.06866125756696878, 0.13132127189613535, 0.12554653890297882, 0.2383894803610967, 0.0651685156861414, 0.19225298885760844, -0.1910663917768324, 0.1141952870696384, -0.052614243060326936]
|
1,803.08972
|
Recursive formulas for $_{2}F_{1}$ and $_{3}F_{2}$ hypergeometric series
|
Recursive formulas extending some known $_{2}F_{1}$ and $_{3}F_{2}$ summation
formulas by using contiguous relations have been obtained. On the one hand,
these recursive equations are quite suitable for symbolic and numerical
evaluation by means of computer algebra. On the other hand, sometimes
closed-forms of such extensions can be derived by induction. It is expected
that the method used to obtain the different recursive equations can be applied
to extend other hypergeometric summation formulas given in the literature.
|
math.CA
|
recursive formulas extending some known _2f_1 and _3f_2 summation formulas by using contiguous relations have been obtained on the one hand these recursive equations are quite suitable for symbolic and numerical evaluation by means of computer algebra on the other hand sometimes closedforms of such extensions can be derived by induction it is expected that the method used to obtain the different recursive equations can be applied to extend other hypergeometric summation formulas given in the literature
|
[['recursive', 'formulas', 'extending', 'some', 'known', '_2f_1', 'and', '_3f_2', 'summation', 'formulas', 'by', 'using', 'contiguous', 'relations', 'have', 'been', 'obtained', 'on', 'the', 'one', 'hand', 'these', 'recursive', 'equations', 'are', 'quite', 'suitable', 'for', 'symbolic', 'and', 'numerical', 'evaluation', 'by', 'means', 'of', 'computer', 'algebra', 'on', 'the', 'other', 'hand', 'sometimes', 'closedforms', 'of', 'such', 'extensions', 'can', 'be', 'derived', 'by', 'induction', 'it', 'is', 'expected', 'that', 'the', 'method', 'used', 'to', 'obtain', 'the', 'different', 'recursive', 'equations', 'can', 'be', 'applied', 'to', 'extend', 'other', 'hypergeometric', 'summation', 'formulas', 'given', 'in', 'the', 'literature']]
|
[-0.058576035747597864, 0.021673138483197657, -0.11405751075256955, 0.13723529343850088, -0.1603648652407256, -0.15994402226786336, 0.012410026267412808, 0.33954102212151926, -0.29020594024135693, -0.28533493038478563, 0.15849024983116897, -0.24387354718206763, -0.16803465684416233, 0.3497982050183338, -0.03869023592254395, 0.08833246853492864, 0.04496210256240681, 0.03866559929855458, -0.11052261484944105, -0.2859719052197194, 0.3021998916353498, -0.03979982781018336, 0.21757943523055934, 0.0001603627185089296, 0.08892360601767704, 0.002107535670329998, -0.08928308163031742, 0.04088861331367841, -0.12408511296820648, 0.12719135393400666, 0.30226534732327154, 0.1439695280595598, 0.21388594907793132, -0.4618399530504044, -0.15979473319436824, 0.04882866147960016, 0.20264748001906585, 0.08206428315296962, 0.0060095815320632285, -0.28475921424468614, 0.07977641366615698, -0.22102313205696544, -0.11044671237105866, -0.176754568014052, -0.0019705248981496536, 0.1276653839408287, -0.24240738804173934, 0.034598974054437376, 0.04717359713967281, 0.06218545344452579, -0.03364480360011969, -0.21809528936184458, 0.01882089020732742, 0.12166925793658796, 0.05055422798803003, -0.020741632785769057, 0.07424500472117941, -0.07026798293212211, -0.16570855272546797, 0.332195373227844, -0.02738177707999364, -0.2795461363026074, 0.1448777902768562, -0.09715288396707022, -0.16410454084443582, 0.1007134813041269, 0.04481400139387939, 0.1589879896491766, -0.16825197747146542, 0.08915578226056918, -0.08260386930052917, 0.0779755094463562, 0.18216356046667154, -0.020185065268260704, 0.11399489739159872, 0.021675567463185493, -0.014536068442144565, 0.17292662716452517, 0.021814297279947763, -0.1178451825368714, -0.28243646461081195, -0.12178731176324865, -0.16050260475826866, 0.00921608569922966, -0.12130710922669946, -0.14625165583686783, 0.34499410917232565, 0.16120080692185598, 0.12002441391058556, 0.1289899975980644, 0.28236929939261507, 0.25838871643721284, 0.14348031832026198, 0.020750258096747777, 0.1529358548445585, 0.16696937949178958, 0.04291518256914886, -0.1338823177888022, 0.10146568944169716, 0.19299695433976202]
|
1,803.08973
|
The Nested Kingman Coalescent: Speed of Coming Down from Infinity
|
The nested Kingman coalescent describes the ancestral tree of a population
undergoing neutral evolution at the level of individuals and at the level of
species, simultaneously. We study the speed at which the number of lineages
descends from infinity in this hierarchical coalescent process and prove the
existence of an early-time phase during which the number of lineages at time
$t$ decays as $ 2\gamma/ct^2$, where $c$ is the ratio of the coalescence rates
at the individual and species levels, and the constant $\gamma\approx 3.45$ is
derived from a recursive distributional equation for the number of lineages
contained within a species at a typical time.
|
math.PR
|
the nested kingman coalescent describes the ancestral tree of a population undergoing neutral evolution at the level of individuals and at the level of species simultaneously we study the speed at which the number of lineages descends from infinity in this hierarchical coalescent process and prove the existence of an earlytime phase during which the number of lineages at time t decays as 2gammact2 where c is the ratio of the coalescence rates at the individual and species levels and the constant gammaapprox 345 is derived from a recursive distributional equation for the number of lineages contained within a species at a typical time
|
[['the', 'nested', 'kingman', 'coalescent', 'describes', 'the', 'ancestral', 'tree', 'of', 'a', 'population', 'undergoing', 'neutral', 'evolution', 'at', 'the', 'level', 'of', 'individuals', 'and', 'at', 'the', 'level', 'of', 'species', 'simultaneously', 'we', 'study', 'the', 'speed', 'at', 'which', 'the', 'number', 'of', 'lineages', 'descends', 'from', 'infinity', 'in', 'this', 'hierarchical', 'coalescent', 'process', 'and', 'prove', 'the', 'existence', 'of', 'an', 'earlytime', 'phase', 'during', 'which', 'the', 'number', 'of', 'lineages', 'at', 'time', 't', 'decays', 'as', '2gammact2', 'where', 'c', 'is', 'the', 'ratio', 'of', 'the', 'coalescence', 'rates', 'at', 'the', 'individual', 'and', 'species', 'levels', 'and', 'the', 'constant', 'gammaapprox', '345', 'is', 'derived', 'from', 'a', 'recursive', 'distributional', 'equation', 'for', 'the', 'number', 'of', 'lineages', 'contained', 'within', 'a', 'species', 'at', 'a', 'typical', 'time']]
|
[-0.07915073802278748, 0.20587527299725375, -0.052126125884649245, 0.05419008267398947, 0.04772108724087622, -0.09114191898153824, 0.13364931759854, 0.3020828908435928, -0.2981589080367997, -0.28243630660643565, 0.0477923370199278, -0.2819907676464724, -0.04839678927442258, 0.09465838539712493, 0.006832821943426451, -0.03139725818018456, 0.0828922408140147, 0.07980888988822699, 0.035882841542507836, -0.21790046945386068, 0.3097600223297633, 0.08333381391537276, 0.2473019313799597, -0.024162514194014294, 0.17885927491859777, -0.03152161479014361, -0.029848200680452932, -0.03609585046804356, -0.13045849225673717, 0.034561398466235224, 0.22650067950824945, 0.17213262639062715, 0.2787356807000356, -0.38405474660086253, -0.1696150387745821, 0.12179600398589685, 0.17865509308368258, 0.16251216333097263, 0.012128179888376623, -0.23884079965437283, 0.05115715238193357, -0.1142929721922044, -0.15500552286800828, 0.07299287395678389, 0.04514502200469809, 0.03219110050546096, -0.25413046842350545, 0.12450323059241676, 0.028712184645362127, 0.06910413564567101, -0.01261637721536229, -0.14767213350216163, -0.07853077843929958, 0.12854967693102012, 0.08772323517670214, 0.01863561795266612, 0.12117775775564527, -0.12890600120350357, -0.08947023843387955, 0.32219296893629346, -0.10313078195977847, -0.13435095939242725, 0.236408571226667, -0.19638540528859327, -0.1981007790970571, 0.19451853701645888, 0.17825017926436895, 0.12189763420017309, -0.15737611528269005, 0.08877869338945495, 0.00903927004959398, 0.13361143235804387, 0.12948569472996718, -0.019728987387300116, 0.21588729288501357, 0.20987635682725791, 0.031463713405509165, 0.0918603382294871, -0.10089555747571935, -0.09705137007743192, -0.2854389448659223, -0.15784378724570558, -0.11464202141240058, 0.04247571009853222, -0.1505874341339081, -0.1742362899398341, 0.39369418865377176, 0.07688559174652944, 0.2517202465062581, 0.16431733251784394, 0.21843191146742083, 0.10500746841420357, 0.04243994722915904, 0.09333184955741089, 0.11611361087308926, 0.09631441322944208, 0.08390498029303203, -0.25116644047869785, 0.1470324128811944, 0.07746879998775362]
|
1,803.08974
|
The Optimal Use of Silicon Pixel Charge Information for Particle
Identification
|
Particle identification using the energy loss in silicon detectors is a
powerful technique for probing the Standard Model (SM) as well as searching for
new particles beyond the SM. Traditionally, such techniques use the truncated
mean of the energy loss on multiple layers, in order to mitigate heavy tails in
the charge fluctuation distribution. We show that the optimal scheme using the
charge in multiple layers significantly outperforms the truncated mean.
Truncation itself does not significantly degrade performance and the optimal
classifier is well-approximated by a linear combination of the truncated mean
and truncated variance.
|
physics.ins-det
|
particle identification using the energy loss in silicon detectors is a powerful technique for probing the standard model sm as well as searching for new particles beyond the sm traditionally such techniques use the truncated mean of the energy loss on multiple layers in order to mitigate heavy tails in the charge fluctuation distribution we show that the optimal scheme using the charge in multiple layers significantly outperforms the truncated mean truncation itself does not significantly degrade performance and the optimal classifier is wellapproximated by a linear combination of the truncated mean and truncated variance
|
[['particle', 'identification', 'using', 'the', 'energy', 'loss', 'in', 'silicon', 'detectors', 'is', 'a', 'powerful', 'technique', 'for', 'probing', 'the', 'standard', 'model', 'sm', 'as', 'well', 'as', 'searching', 'for', 'new', 'particles', 'beyond', 'the', 'sm', 'traditionally', 'such', 'techniques', 'use', 'the', 'truncated', 'mean', 'of', 'the', 'energy', 'loss', 'on', 'multiple', 'layers', 'in', 'order', 'to', 'mitigate', 'heavy', 'tails', 'in', 'the', 'charge', 'fluctuation', 'distribution', 'we', 'show', 'that', 'the', 'optimal', 'scheme', 'using', 'the', 'charge', 'in', 'multiple', 'layers', 'significantly', 'outperforms', 'the', 'truncated', 'mean', 'truncation', 'itself', 'does', 'not', 'significantly', 'degrade', 'performance', 'and', 'the', 'optimal', 'classifier', 'is', 'wellapproximated', 'by', 'a', 'linear', 'combination', 'of', 'the', 'truncated', 'mean', 'and', 'truncated', 'variance']]
|
[-0.02834687037454722, 0.10102289774896282, -0.08105751823045705, 0.11663845316016752, -0.014670129277204213, -0.1242684698712669, 0.050897154539186314, 0.350584911633479, -0.30433246255117025, -0.3063280010693952, 0.06914783156427898, -0.29104225964922653, -0.1026237944827268, 0.1655637109509706, -0.06478483156840267, 0.08892593773964204, 0.037109554509975405, 0.031712208668652334, -0.11276259641408136, -0.2107690137958056, 0.26098988974270854, 0.13005126920087556, 0.3147890795610453, 0.007142712456468297, 0.10817480510549533, 0.07303756921503105, -0.023120987414088297, 0.015902292536645147, -0.05816427399320099, 0.09041119813673983, 0.1728762599002374, 0.07206299888754361, 0.2829632044328671, -0.41028935242640346, -0.24597114215261842, 0.10492329813147847, 0.18906730162469965, 0.08195340078029978, -0.07119738065613139, -0.22163774278995238, 0.09315485834683243, -0.21086506225952978, -0.12642385763067163, -0.0702782957471515, -0.1151940525411383, 0.04192356453522256, -0.3271037304136706, 0.12767098528872195, 0.06043943329101526, -0.0068756584286395655, -0.023778939850040173, -0.1650992121057291, -0.009388212487101555, 0.07737742865360096, 0.04230209262367632, 0.00022120717422742593, 0.1650149989186933, -0.1582806602806637, -0.12006660965271294, 0.3303566689578522, -0.1403395764934095, -0.22961243561616068, 0.17584324944274207, -0.13180453179183563, -0.056688734726968074, 0.1429112736331789, 0.19640850507115062, 0.13579653466218397, -0.14821874057187845, 0.07799414734380614, -0.0027168676649269303, 0.18948468903177662, 0.06364581127111849, 0.05662512741982937, 0.19295917934934168, 0.20033427874900792, 0.07438449892705601, 0.09616122036853707, -0.16438136952439028, -0.10359927315853144, -0.2645737720077465, -0.13657021165678376, -0.208742916679598, -0.03183879263340618, -0.11034732514679874, -0.17928912067099623, 0.395639195576376, 0.1543364101334622, 0.19345875073616442, 0.052377630963823515, 0.3425441870367841, 0.12527267836083314, 0.138883333192452, 0.07636801243857726, 0.2649748858664871, 0.07245452171926828, 0.05763058162931549, -0.2295078980675163, 0.0661927033607897, 0.07857324673647159]
|
1,803.08975
|
The stable algebra of a Wieler solenoid: inductive limits and K-theory
|
Wieler has shown that every irreducible Smale space with totally disconnected
stable sets is a solenoid (i.e., obtained via a stationary inverse limit
construction). Using her construction, we show that the associated stable
C*-algebra is the stationary inductive limit of a C*-stable Fell algebra that
has compact spectrum and trivial Dixmier-Douady invariant. This result applies
in particular to Williams solenoids along with other examples. Beyond the
structural implications of this inductive limit, one can use this result to in
principle compute the K-theory of the stable C*-algebra. A specific
one-dimensional Smale space (the aab/ab-solenoid) is considered as an
illustrative running example throughout.
|
math.OA math.DS math.KT
|
wieler has shown that every irreducible smale space with totally disconnected stable sets is a solenoid ie obtained via a stationary inverse limit construction using her construction we show that the associated stable calgebra is the stationary inductive limit of a cstable fell algebra that has compact spectrum and trivial dixmierdouady invariant this result applies in particular to williams solenoids along with other examples beyond the structural implications of this inductive limit one can use this result to in principle compute the ktheory of the stable calgebra a specific onedimensional smale space the aababsolenoid is considered as an illustrative running example throughout
|
[['wieler', 'has', 'shown', 'that', 'every', 'irreducible', 'smale', 'space', 'with', 'totally', 'disconnected', 'stable', 'sets', 'is', 'a', 'solenoid', 'ie', 'obtained', 'via', 'a', 'stationary', 'inverse', 'limit', 'construction', 'using', 'her', 'construction', 'we', 'show', 'that', 'the', 'associated', 'stable', 'calgebra', 'is', 'the', 'stationary', 'inductive', 'limit', 'of', 'a', 'cstable', 'fell', 'algebra', 'that', 'has', 'compact', 'spectrum', 'and', 'trivial', 'dixmierdouady', 'invariant', 'this', 'result', 'applies', 'in', 'particular', 'to', 'williams', 'solenoids', 'along', 'with', 'other', 'examples', 'beyond', 'the', 'structural', 'implications', 'of', 'this', 'inductive', 'limit', 'one', 'can', 'use', 'this', 'result', 'to', 'in', 'principle', 'compute', 'the', 'ktheory', 'of', 'the', 'stable', 'calgebra', 'a', 'specific', 'onedimensional', 'smale', 'space', 'the', 'aababsolenoid', 'is', 'considered', 'as', 'an', 'illustrative', 'running', 'example', 'throughout']]
|
[-0.15101690952652272, 0.13713023634203872, -0.10001792755130089, 0.08235172730049875, -0.08009471331197436, -0.13319764996297878, 0.010297048348232661, 0.3518384549729895, -0.2828411593811937, -0.18210955711524232, 0.13569842345579206, -0.2276278597280835, -0.13974323975715305, 0.23255824348382134, -0.14051500955333768, -0.012684141170454792, 0.0897380484102091, 0.11039500830621266, -0.08625179584746683, -0.21121600101526716, 0.384665363606545, 0.02448339571272678, 0.24684462189158002, 0.022564545047865942, 0.12046933885073603, 0.015506877072874715, 0.0037564196148979485, 0.038248696751168716, -0.11403478520089878, 0.08978692282655157, 0.30024673045373124, 0.07544758291638429, 0.2058777345141562, -0.3330707786046314, -0.17123608680679417, 0.17861716966098634, 0.12185783454650405, 0.04285176673738083, -0.043438868276719556, -0.28293109048932497, 0.0932732059730973, -0.22915121765419988, -0.17513383537678434, -0.11345202975104203, 0.08528721860914242, -0.03700260819272498, -0.2265835715974174, -0.037630730921789854, 0.15721132386807757, 0.05441911348907074, -0.07617520617948163, -0.04114893967709919, -0.07284858141389519, 0.095220686194699, 0.012622268461866655, 0.022849055679369772, 0.13869310677971342, 0.00021811093245218001, -0.168192548230106, 0.3305336952320125, -0.09213478127863295, -0.2000155897114004, 0.19835560514803718, -0.14321218522283996, -0.18959346075201094, 0.15443837061745697, 0.060205217460078175, 0.14022985623577738, -0.05862896285932696, 0.21016623442105045, -0.12638671140619875, 0.09080045162625196, 0.07924110635119204, -0.0274212994373007, 0.14495031740793055, 0.14056681480839628, 0.13628880750609212, 0.19664470767106695, 0.026001140585349004, -0.09137083935127178, -0.342578751837263, -0.15120222413564322, -0.15304202985221355, 0.1370297644499431, -0.07418696012905232, -0.1950513148080387, 0.3659309056486086, 0.08980711679781746, 0.18301093859579598, 0.07338986030346391, 0.2754728151197167, 0.11262316907419463, 0.016081469548441987, 0.08771060602186193, 0.1902749123071069, 0.21156380509054012, 0.03653058657966702, -0.12592230363066612, -0.021598649022197075, 0.16883900723798145]
|
1,803.08976
|
Speech2Vec: A Sequence-to-Sequence Framework for Learning Word
Embeddings from Speech
|
In this paper, we propose a novel deep neural network architecture,
Speech2Vec, for learning fixed-length vector representations of audio segments
excised from a speech corpus, where the vectors contain semantic information
pertaining to the underlying spoken words, and are close to other vectors in
the embedding space if their corresponding underlying spoken words are
semantically similar. The proposed model can be viewed as a speech version of
Word2Vec. Its design is based on a RNN Encoder-Decoder framework, and borrows
the methodology of skipgrams or continuous bag-of-words for training. Learning
word embeddings directly from speech enables Speech2Vec to make use of the
semantic information carried by speech that does not exist in plain text. The
learned word embeddings are evaluated and analyzed on 13 widely used word
similarity benchmarks, and outperform word embeddings learned by Word2Vec from
the transcriptions.
|
cs.CL
|
in this paper we propose a novel deep neural network architecture speech2vec for learning fixedlength vector representations of audio segments excised from a speech corpus where the vectors contain semantic information pertaining to the underlying spoken words and are close to other vectors in the embedding space if their corresponding underlying spoken words are semantically similar the proposed model can be viewed as a speech version of word2vec its design is based on a rnn encoderdecoder framework and borrows the methodology of skipgrams or continuous bagofwords for training learning word embeddings directly from speech enables speech2vec to make use of the semantic information carried by speech that does not exist in plain text the learned word embeddings are evaluated and analyzed on 13 widely used word similarity benchmarks and outperform word embeddings learned by word2vec from the transcriptions
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'deep', 'neural', 'network', 'architecture', 'speech2vec', 'for', 'learning', 'fixedlength', 'vector', 'representations', 'of', 'audio', 'segments', 'excised', 'from', 'a', 'speech', 'corpus', 'where', 'the', 'vectors', 'contain', 'semantic', 'information', 'pertaining', 'to', 'the', 'underlying', 'spoken', 'words', 'and', 'are', 'close', 'to', 'other', 'vectors', 'in', 'the', 'embedding', 'space', 'if', 'their', 'corresponding', 'underlying', 'spoken', 'words', 'are', 'semantically', 'similar', 'the', 'proposed', 'model', 'can', 'be', 'viewed', 'as', 'a', 'speech', 'version', 'of', 'word2vec', 'its', 'design', 'is', 'based', 'on', 'a', 'rnn', 'encoderdecoder', 'framework', 'and', 'borrows', 'the', 'methodology', 'of', 'skipgrams', 'or', 'continuous', 'bagofwords', 'for', 'training', 'learning', 'word', 'embeddings', 'directly', 'from', 'speech', 'enables', 'speech2vec', 'to', 'make', 'use', 'of', 'the', 'semantic', 'information', 'carried', 'by', 'speech', 'that', 'does', 'not', 'exist', 'in', 'plain', 'text', 'the', 'learned', 'word', 'embeddings', 'are', 'evaluated', 'and', 'analyzed', 'on', '13', 'widely', 'used', 'word', 'similarity', 'benchmarks', 'and', 'outperform', 'word', 'embeddings', 'learned', 'by', 'word2vec', 'from', 'the', 'transcriptions']]
|
[0.017260193948031348, 0.028134000127251698, -0.05839335217880195, 0.13198742890210055, -0.19387043870451368, -0.17212049685408334, 0.030556616487207495, 0.49022246191195923, -0.3419401949846788, -0.25031580275561494, 0.032100464303820284, -0.3269795845810543, -0.18480742581510534, 0.18586041443888782, -0.14736213465563625, 0.08752545760901687, 0.13529950101270943, 0.17518327407785417, -0.07759355391060714, -0.27446202977786444, 0.3288746479323463, -0.020912752721522015, 0.38200802186004107, -0.07116078225354773, 0.15858202378405942, -0.039186928212396145, -0.06072073161725283, -0.10294256736768362, -0.02062153276801837, 0.22881794841412237, 0.4088152435142547, 0.2742801474112853, 0.2785911047552979, -0.3837832669994575, -0.2329340142519761, 0.08153554744443253, 0.15715108739609338, 0.11455726902247132, -0.0034699292069383185, -0.4445107370368479, 0.11115449067438021, -0.1696466047433205, 0.17258141165160956, -0.13703372610389658, -0.028010695066768676, -0.010342995982843122, -0.2371580847675967, 0.018148260964902446, 0.17292960279155523, 0.067858168423888, -0.06520445224818747, -0.11891153749242864, 0.006365148462303777, 0.17929527516689098, 0.04004506973005311, 0.1366745328568333, 0.11470952300313751, -0.16058024260949905, -0.16575759370992754, 0.40619388050125804, -0.11236999428022981, -0.3017388711587581, 0.17479419532772975, 0.03132058686049491, -0.12870965728207545, 0.06268963551915743, 0.26527580592493694, 0.0333423531778595, -0.19208976833204575, 0.02374199877564987, -0.08526931123753242, 0.2670164445255924, 0.11641637792105458, -0.0021166200235979084, 0.20124770008602783, 0.24413569485905634, -0.08909437361666385, 0.14811202354330283, -0.111747282293543, -0.022751649290405435, -0.1817597462590236, -0.09971963509451598, -0.22651942310211085, -0.0720801924710352, -0.13701684852704227, -0.16324922893203192, 0.4155811120666947, 0.2402101061289774, 0.21319568174315945, 0.14401820767157272, 0.27943094926612344, -0.018438105794142328, 0.14634539913694264, 0.12709088739596636, 0.10241462062249947, -0.01784217529861695, 0.14035912328536676, -0.07741859651800684, 0.12049634038532317, 0.1465388926838333]
|
1,803.08977
|
Characterizing and Detecting Hateful Users on Twitter
|
Most current approaches to characterize and detect hate speech focus on
\textit{content} posted in Online Social Networks. They face shortcomings to
collect and annotate hateful speech due to the incompleteness and noisiness of
OSN text and the subjectivity of hate speech. These limitations are often aided
with constraints that oversimplify the problem, such as considering only tweets
containing hate-related words. In this work we partially address these issues
by shifting the focus towards \textit{users}. We develop and employ a robust
methodology to collect and annotate hateful users which does not depend
directly on lexicon and where the users are annotated given their entire
profile. This results in a sample of Twitter's retweet graph containing
$100,386$ users, out of which $4,972$ were annotated. We also collect the users
who were banned in the three months that followed the data collection. We show
that hateful users differ from normal ones in terms of their activity patterns,
word usage and as well as network structure. We obtain similar results
comparing the neighbors of hateful vs. neighbors of normal users and also
suspended users vs. active users, increasing the robustness of our analysis. We
observe that hateful users are densely connected, and thus formulate the hate
speech detection problem as a task of semi-supervised learning over a graph,
exploiting the network of connections on Twitter. We find that a node embedding
algorithm, which exploits the graph structure, outperforms content-based
approaches for the detection of both hateful ($95\%$ AUC vs $88\%$ AUC) and
suspended users ($93\%$ AUC vs $88\%$ AUC). Altogether, we present a
user-centric view of hate speech, paving the way for better detection and
understanding of this relevant and challenging issue.
|
cs.CY cs.SI
|
most current approaches to characterize and detect hate speech focus on textitcontent posted in online social networks they face shortcomings to collect and annotate hateful speech due to the incompleteness and noisiness of osn text and the subjectivity of hate speech these limitations are often aided with constraints that oversimplify the problem such as considering only tweets containing haterelated words in this work we partially address these issues by shifting the focus towards textitusers we develop and employ a robust methodology to collect and annotate hateful users which does not depend directly on lexicon and where the users are annotated given their entire profile this results in a sample of twitters retweet graph containing 100386 users out of which 4972 were annotated we also collect the users who were banned in the three months that followed the data collection we show that hateful users differ from normal ones in terms of their activity patterns word usage and as well as network structure we obtain similar results comparing the neighbors of hateful vs neighbors of normal users and also suspended users vs active users increasing the robustness of our analysis we observe that hateful users are densely connected and thus formulate the hate speech detection problem as a task of semisupervised learning over a graph exploiting the network of connections on twitter we find that a node embedding algorithm which exploits the graph structure outperforms contentbased approaches for the detection of both hateful 95 auc vs 88 auc and suspended users 93 auc vs 88 auc altogether we present a usercentric view of hate speech paving the way for better detection and understanding of this relevant and challenging issue
|
[['most', 'current', 'approaches', 'to', 'characterize', 'and', 'detect', 'hate', 'speech', 'focus', 'on', 'textitcontent', 'posted', 'in', 'online', 'social', 'networks', 'they', 'face', 'shortcomings', 'to', 'collect', 'and', 'annotate', 'hateful', 'speech', 'due', 'to', 'the', 'incompleteness', 'and', 'noisiness', 'of', 'osn', 'text', 'and', 'the', 'subjectivity', 'of', 'hate', 'speech', 'these', 'limitations', 'are', 'often', 'aided', 'with', 'constraints', 'that', 'oversimplify', 'the', 'problem', 'such', 'as', 'considering', 'only', 'tweets', 'containing', 'haterelated', 'words', 'in', 'this', 'work', 'we', 'partially', 'address', 'these', 'issues', 'by', 'shifting', 'the', 'focus', 'towards', 'textitusers', 'we', 'develop', 'and', 'employ', 'a', 'robust', 'methodology', 'to', 'collect', 'and', 'annotate', 'hateful', 'users', 'which', 'does', 'not', 'depend', 'directly', 'on', 'lexicon', 'and', 'where', 'the', 'users', 'are', 'annotated', 'given', 'their', 'entire', 'profile', 'this', 'results', 'in', 'a', 'sample', 'of', 'twitters', 'retweet', 'graph', 'containing', '100386', 'users', 'out', 'of', 'which', '4972', 'were', 'annotated', 'we', 'also', 'collect', 'the', 'users', 'who', 'were', 'banned', 'in', 'the', 'three', 'months', 'that', 'followed', 'the', 'data', 'collection', 'we', 'show', 'that', 'hateful', 'users', 'differ', 'from', 'normal', 'ones', 'in', 'terms', 'of', 'their', 'activity', 'patterns', 'word', 'usage', 'and', 'as', 'well', 'as', 'network', 'structure', 'we', 'obtain', 'similar', 'results', 'comparing', 'the', 'neighbors', 'of', 'hateful', 'vs', 'neighbors', 'of', 'normal', 'users', 'and', 'also', 'suspended', 'users', 'vs', 'active', 'users', 'increasing', 'the', 'robustness', 'of', 'our', 'analysis', 'we', 'observe', 'that', 'hateful', 'users', 'are', 'densely', 'connected', 'and', 'thus', 'formulate', 'the', 'hate', 'speech', 'detection', 'problem', 'as', 'a', 'task', 'of', 'semisupervised', 'learning', 'over', 'a', 'graph', 'exploiting', 'the', 'network', 'of', 'connections', 'on', 'twitter', 'we', 'find', 'that', 'a', 'node', 'embedding', 'algorithm', 'which', 'exploits', 'the', 'graph', 'structure', 'outperforms', 'contentbased', 'approaches', 'for', 'the', 'detection', 'of', 'both', 'hateful', '95', 'auc', 'vs', '88', 'auc', 'and', 'suspended', 'users', '93', 'auc', 'vs', '88', 'auc', 'altogether', 'we', 'present', 'a', 'usercentric', 'view', 'of', 'hate', 'speech', 'paving', 'the', 'way', 'for', 'better', 'detection', 'and', 'understanding', 'of', 'this', 'relevant', 'and', 'challenging', 'issue']]
|
[-0.08131262742547593, 0.0085966395355258, -0.015110996437095866, 0.07432972583503387, -0.164062533446037, -0.18185930543096504, 0.1358814026211239, 0.42379293870180845, -0.222825994693426, -0.34340296244018464, 0.07842829325329852, -0.3810455117860714, -0.20017280555874054, 0.15672828287526075, -0.15713380207114452, -0.0038342955305553754, 0.099033544812586, 0.0963242442022506, -0.014060058533282013, -0.3143438713209335, 0.29692857031520103, 0.008237426514213863, 0.34598121461356535, 0.06387375852906839, 0.06736717230056576, -0.010833958307039808, -0.0984863179075586, 0.0034379085139660368, -0.0667581497961632, 0.1614313902839828, 0.36142403946468865, 0.23158741135653244, 0.30588485596082887, -0.3777847308009881, -0.17781626188152055, 0.09957082282214759, 0.16709826683904297, 0.07802777133304643, -0.017602555941956893, -0.39162175264889304, 0.13252803212861075, -0.17897118754212465, 0.03846545105593544, -0.06940523869643518, -0.0027963734388242673, 0.015936149364969537, -0.22647605797940404, 0.06068527724157958, 0.06191153873317284, 0.121533600844606, -0.033622955497231904, -0.09285112619688939, 0.019899265160852105, 0.21459047108834242, 0.07509837468175122, -0.004760971034530306, 0.17146452401580295, -0.18411023134703877, -0.12653317381470655, 0.3875934295339279, -0.023920965018124747, -0.17026311552587958, 0.2008975781381375, -0.0331958666372446, -0.14462346001358253, 0.07449748499844101, 0.2614494198074999, 0.10879009353833097, -0.17713080528642589, -0.04154919656749856, -0.05345931037900167, 0.20101873181848684, 0.10534775639687882, 0.008764639659104937, 0.17164992711024127, 0.1989579279023311, 0.02963598230114397, 0.1057915958281892, -0.08540202527184611, -0.009840561384235315, -0.17744627489239304, -0.1238441590787367, -0.1490028244086344, 0.002924615793904361, -0.08468577568690135, -0.14186304376883785, 0.4175439775262001, 0.21045368315352903, 0.19756947480818515, 0.10388585140414104, 0.297739269565383, -0.0036422783881935707, 0.0653529477383887, 0.1101672400779475, 0.15378203892903605, -0.012320277881876559, 0.15235194463383095, -0.1611283606221648, 0.11819684263624686, -0.011855946381297642]
|
1,803.08978
|
Broad Learning for Healthcare
|
A broad spectrum of data from different modalities are generated in the
healthcare domain every day, including scalar data (e.g., clinical measures
collected at hospitals), tensor data (e.g., neuroimages analyzed by research
institutes), graph data (e.g., brain connectivity networks), and sequence data
(e.g., digital footprints recorded on smart sensors). Capability for modeling
information from these heterogeneous data sources is potentially transformative
for investigating disease mechanisms and for informing therapeutic
interventions.
Our works in this thesis attempt to facilitate healthcare applications in the
setting of broad learning which focuses on fusing heterogeneous data sources
for a variety of synergistic knowledge discovery and machine learning tasks. We
are generally interested in computer-aided diagnosis, precision medicine, and
mobile health by creating accurate user profiles which include important
biomarkers, brain connectivity patterns, and latent representations. In
particular, our works involve four different data mining problems with
application to the healthcare domain: multi-view feature selection, subgraph
pattern mining, brain network embedding, and multi-view sequence prediction.
|
cs.LG stat.ML
|
a broad spectrum of data from different modalities are generated in the healthcare domain every day including scalar data eg clinical measures collected at hospitals tensor data eg neuroimages analyzed by research institutes graph data eg brain connectivity networks and sequence data eg digital footprints recorded on smart sensors capability for modeling information from these heterogeneous data sources is potentially transformative for investigating disease mechanisms and for informing therapeutic interventions our works in this thesis attempt to facilitate healthcare applications in the setting of broad learning which focuses on fusing heterogeneous data sources for a variety of synergistic knowledge discovery and machine learning tasks we are generally interested in computeraided diagnosis precision medicine and mobile health by creating accurate user profiles which include important biomarkers brain connectivity patterns and latent representations in particular our works involve four different data mining problems with application to the healthcare domain multiview feature selection subgraph pattern mining brain network embedding and multiview sequence prediction
|
[['a', 'broad', 'spectrum', 'of', 'data', 'from', 'different', 'modalities', 'are', 'generated', 'in', 'the', 'healthcare', 'domain', 'every', 'day', 'including', 'scalar', 'data', 'eg', 'clinical', 'measures', 'collected', 'at', 'hospitals', 'tensor', 'data', 'eg', 'neuroimages', 'analyzed', 'by', 'research', 'institutes', 'graph', 'data', 'eg', 'brain', 'connectivity', 'networks', 'and', 'sequence', 'data', 'eg', 'digital', 'footprints', 'recorded', 'on', 'smart', 'sensors', 'capability', 'for', 'modeling', 'information', 'from', 'these', 'heterogeneous', 'data', 'sources', 'is', 'potentially', 'transformative', 'for', 'investigating', 'disease', 'mechanisms', 'and', 'for', 'informing', 'therapeutic', 'interventions', 'our', 'works', 'in', 'this', 'thesis', 'attempt', 'to', 'facilitate', 'healthcare', 'applications', 'in', 'the', 'setting', 'of', 'broad', 'learning', 'which', 'focuses', 'on', 'fusing', 'heterogeneous', 'data', 'sources', 'for', 'a', 'variety', 'of', 'synergistic', 'knowledge', 'discovery', 'and', 'machine', 'learning', 'tasks', 'we', 'are', 'generally', 'interested', 'in', 'computeraided', 'diagnosis', 'precision', 'medicine', 'and', 'mobile', 'health', 'by', 'creating', 'accurate', 'user', 'profiles', 'which', 'include', 'important', 'biomarkers', 'brain', 'connectivity', 'patterns', 'and', 'latent', 'representations', 'in', 'particular', 'our', 'works', 'involve', 'four', 'different', 'data', 'mining', 'problems', 'with', 'application', 'to', 'the', 'healthcare', 'domain', 'multiview', 'feature', 'selection', 'subgraph', 'pattern', 'mining', 'brain', 'network', 'embedding', 'and', 'multiview', 'sequence', 'prediction']]
|
[-0.053058548091212285, 0.03354037451208569, -0.01833786884235451, 0.06890514225233346, -0.16115200866770465, -0.17061607625219039, 0.035661365614214444, 0.4323670067184139, -0.2558016073307954, -0.3422109516803175, 0.14120067867843317, -0.3384765843162313, -0.17979466338292696, 0.2184631405165419, -0.14759894149901812, 0.06968799990281696, 0.14915214512002423, 0.0487513086583931, 0.051990918483352286, -0.23748038837384228, 0.3151510586438235, -0.0007218556245788931, 0.41399762776563875, 0.034068297303383586, 0.058969490627350754, 0.05301804952323437, -0.12863986028824, -0.0434157968913496, -0.08241104220796842, 0.21689509521529543, 0.4965510220266879, 0.28892296251433436, 0.3534565824884339, -0.4523750970509354, -0.3036872862401651, 0.12299318603472784, 0.1259433128998353, 0.05412125121074496, -0.06564914596528978, -0.36937442304333673, 0.05365329965279671, -0.1380012949479351, -0.013015557685866952, -0.12312918209354393, 0.00045457879605237395, -0.009859670478908811, -0.30585111159016376, 0.04363530188275035, -0.02091032784373965, 0.2054430847230833, -0.08573029096587562, -0.12695220786554273, 0.022667606695904396, 0.2182266759831691, 0.04800533878587885, 0.0264609657919209, 0.20614147938867972, -0.22091938198864228, -0.1795061814071232, 0.32051792297861537, 0.059804457933933006, -0.1293594879360171, 0.19983660506550222, -0.040726198378251866, -0.2127243538358016, 0.07010186666739174, 0.2818806134397164, 0.06601060864923056, -0.24384201774082612, -0.009678537915897322, 0.06599562203336973, 0.13468480929859653, 0.060590810353460256, 0.01698665380536113, 0.191539202783315, 0.2511610790199484, 0.028639092422963586, 0.07742149705882184, -0.10918211936077568, -0.04804935003594437, -0.16948090650548692, -0.07967906095791477, -0.17163589936535573, -0.02015449194914254, -0.15128435216556682, -0.12786645445230532, 0.4024078523681965, 0.17143656935077162, 0.13018050336140732, 0.0016508411266840995, 0.3261661688564345, -0.04835285624285461, 0.119526177510852, 0.060572412665351294, 0.05944400293519721, 0.006525551725098921, 0.22189334991562645, -0.12073893035121727, 0.11653827614209149, -0.05967519406112842]
|
1,803.08979
|
From Shannon's Channel to Semantic Channel via New Bayes' Formulas for
Machine Learning
|
A group of transition probability functions form a Shannon's channel whereas
a group of truth functions form a semantic channel. By the third kind of Bayes'
theorem, we can directly convert a Shannon's channel into an optimized semantic
channel. When a sample is not big enough, we can use a truth function with
parameters to produce the likelihood function, then train the truth function by
the conditional sampling distribution. The third kind of Bayes' theorem is
proved. A semantic information theory is simply introduced. The semantic
information measure reflects Popper's hypothesis-testing thought. The Semantic
Information Method (SIM) adheres to maximum semantic information criterion
which is compatible with maximum likelihood criterion and Regularized Least
Squares criterion. It supports Wittgenstein's view: the meaning of a word lies
in its use. Letting the two channels mutually match, we obtain the Channels'
Matching (CM) algorithm for machine learning. The CM algorithm is used to
explain the evolution of the semantic meaning of natural language, such as "Old
age". The semantic channel for medical tests and the confirmation measures of
test-positive and test-negative are discussed. The applications of the CM
algorithm to semi-supervised learning and non-supervised learning are simply
introduced. As a predictive model, the semantic channel fits variable sources
and hence can overcome class-imbalance problem. The SIM strictly distinguishes
statistical probability and logical probability and uses both at the same time.
This method is compatible with the thoughts of Bayes, Fisher, Shannon, Zadeh,
Tarski, Davidson, Wittgenstein, and Popper.It is a competitive alternative to
Bayesian inference.
|
cs.LG stat.ML
|
a group of transition probability functions form a shannons channel whereas a group of truth functions form a semantic channel by the third kind of bayes theorem we can directly convert a shannons channel into an optimized semantic channel when a sample is not big enough we can use a truth function with parameters to produce the likelihood function then train the truth function by the conditional sampling distribution the third kind of bayes theorem is proved a semantic information theory is simply introduced the semantic information measure reflects poppers hypothesistesting thought the semantic information method sim adheres to maximum semantic information criterion which is compatible with maximum likelihood criterion and regularized least squares criterion it supports wittgensteins view the meaning of a word lies in its use letting the two channels mutually match we obtain the channels matching cm algorithm for machine learning the cm algorithm is used to explain the evolution of the semantic meaning of natural language such as old age the semantic channel for medical tests and the confirmation measures of testpositive and testnegative are discussed the applications of the cm algorithm to semisupervised learning and nonsupervised learning are simply introduced as a predictive model the semantic channel fits variable sources and hence can overcome classimbalance problem the sim strictly distinguishes statistical probability and logical probability and uses both at the same time this method is compatible with the thoughts of bayes fisher shannon zadeh tarski davidson wittgenstein and popperit is a competitive alternative to bayesian inference
|
[['a', 'group', 'of', 'transition', 'probability', 'functions', 'form', 'a', 'shannons', 'channel', 'whereas', 'a', 'group', 'of', 'truth', 'functions', 'form', 'a', 'semantic', 'channel', 'by', 'the', 'third', 'kind', 'of', 'bayes', 'theorem', 'we', 'can', 'directly', 'convert', 'a', 'shannons', 'channel', 'into', 'an', 'optimized', 'semantic', 'channel', 'when', 'a', 'sample', 'is', 'not', 'big', 'enough', 'we', 'can', 'use', 'a', 'truth', 'function', 'with', 'parameters', 'to', 'produce', 'the', 'likelihood', 'function', 'then', 'train', 'the', 'truth', 'function', 'by', 'the', 'conditional', 'sampling', 'distribution', 'the', 'third', 'kind', 'of', 'bayes', 'theorem', 'is', 'proved', 'a', 'semantic', 'information', 'theory', 'is', 'simply', 'introduced', 'the', 'semantic', 'information', 'measure', 'reflects', 'poppers', 'hypothesistesting', 'thought', 'the', 'semantic', 'information', 'method', 'sim', 'adheres', 'to', 'maximum', 'semantic', 'information', 'criterion', 'which', 'is', 'compatible', 'with', 'maximum', 'likelihood', 'criterion', 'and', 'regularized', 'least', 'squares', 'criterion', 'it', 'supports', 'wittgensteins', 'view', 'the', 'meaning', 'of', 'a', 'word', 'lies', 'in', 'its', 'use', 'letting', 'the', 'two', 'channels', 'mutually', 'match', 'we', 'obtain', 'the', 'channels', 'matching', 'cm', 'algorithm', 'for', 'machine', 'learning', 'the', 'cm', 'algorithm', 'is', 'used', 'to', 'explain', 'the', 'evolution', 'of', 'the', 'semantic', 'meaning', 'of', 'natural', 'language', 'such', 'as', 'old', 'age', 'the', 'semantic', 'channel', 'for', 'medical', 'tests', 'and', 'the', 'confirmation', 'measures', 'of', 'testpositive', 'and', 'testnegative', 'are', 'discussed', 'the', 'applications', 'of', 'the', 'cm', 'algorithm', 'to', 'semisupervised', 'learning', 'and', 'nonsupervised', 'learning', 'are', 'simply', 'introduced', 'as', 'a', 'predictive', 'model', 'the', 'semantic', 'channel', 'fits', 'variable', 'sources', 'and', 'hence', 'can', 'overcome', 'classimbalance', 'problem', 'the', 'sim', 'strictly', 'distinguishes', 'statistical', 'probability', 'and', 'logical', 'probability', 'and', 'uses', 'both', 'at', 'the', 'same', 'time', 'this', 'method', 'is', 'compatible', 'with', 'the', 'thoughts', 'of', 'bayes', 'fisher', 'shannon', 'zadeh', 'tarski', 'davidson', 'wittgenstein', 'and', 'popperit', 'is', 'a', 'competitive', 'alternative', 'to', 'bayesian', 'inference']]
|
[-0.06469011132327479, 0.03648723271961048, -0.12075207891100417, 0.1499530856653432, -0.1423215531824333, -0.1717975621718177, 0.10116810711511906, 0.37336545012564576, -0.30062634358933615, -0.3086064112327632, 0.07378257157811717, -0.264686591210193, -0.1263715679937553, 0.14529853385418742, -0.13648374849599937, 0.08727668479790032, 0.06771121934270335, 0.11099943263510678, -0.07147253361425453, -0.2341277475070749, 0.30709016371861986, 0.05227229270836218, 0.3220723759685267, 0.016211361495680327, 0.14815037004498136, 0.013156273427622153, -0.0519747122363638, -0.012644621966061212, -0.11745520768266532, 0.14727810802709898, 0.2973116985792125, 0.2597842223063532, 0.32579997545408623, -0.3331636175917377, -0.2021206389894829, 0.11297940148036897, 0.11451256592127104, 0.0817441265676133, 0.033525139713028985, -0.32250375154704203, 0.082082540394866, -0.18262922319568572, -0.026407355299940514, -0.06821619552483166, -0.0366324718399424, -0.01317260717593355, -0.31716025684398763, 0.07364278811691029, 0.09089459231378691, 0.047999620789332474, -0.025368651478915597, -0.12479718325900443, 0.010026209824343001, 0.10806182962824096, 0.012787650839234102, 0.0768291886648043, 0.12586534009460593, -0.13578807923195493, -0.1342331726599725, 0.32656347069273434, -0.04602934169276024, -0.21259127584879375, 0.14006153939267424, -0.05949566180765208, -0.11231545429872049, 0.09319267890250851, 0.13736105366467288, 0.07479216896500739, -0.18067462775217147, 0.034981205762784566, -0.052950093059823095, 0.2033355728039638, 0.06619298509547426, 0.020642436628423317, 0.1955649415725812, 0.16801124935380124, 0.05243922080168681, 0.12833596610899775, -0.10792346719104136, -0.07985843278020771, -0.2724664857979083, -0.18004448368259135, -0.2318875659125737, 0.0030493481092801838, -0.13772905627857038, -0.15455392534427265, 0.32754296046703296, 0.15166559805642935, 0.17904503029703553, 0.12307044346450693, 0.30221038230416936, 0.10487653434017463, 0.07146811401781311, 0.09626976460229696, 0.16954627278591355, 0.1680117864358885, 0.07154637116247849, -0.12183356885572956, 0.1256648158906178, 0.09368272110699646]
|
1,803.0898
|
Lyapunov Event-triggered Stabilization with a Known Convergence Rate
|
A constructive tool of nonlinear control systems design, the method of
Control Lyapunov Functions (CLF) has found numerous applications in
stabilization problems for continuous time, discrete-time and hybrid systems.
In this paper, we address the fundamental question: given a CLF, corresponding
to the continuous-time controller with some predefined (e.g. exponential)
convergence rate, can the same convergence rate be provided by an
event-triggered controller? Under certain assumptions, we give an affirmative
answer to this question and show that the corresponding event-based controllers
provide positive dwelltimes between the consecutive events. Furthermore, we
prove the existence of self-triggered and periodic event-triggered controllers,
providing stabilization with a known convergence rate.
|
eess.SY cs.SY math.DS math.OC
|
a constructive tool of nonlinear control systems design the method of control lyapunov functions clf has found numerous applications in stabilization problems for continuous time discretetime and hybrid systems in this paper we address the fundamental question given a clf corresponding to the continuoustime controller with some predefined eg exponential convergence rate can the same convergence rate be provided by an eventtriggered controller under certain assumptions we give an affirmative answer to this question and show that the corresponding eventbased controllers provide positive dwelltimes between the consecutive events furthermore we prove the existence of selftriggered and periodic eventtriggered controllers providing stabilization with a known convergence rate
|
[['a', 'constructive', 'tool', 'of', 'nonlinear', 'control', 'systems', 'design', 'the', 'method', 'of', 'control', 'lyapunov', 'functions', 'clf', 'has', 'found', 'numerous', 'applications', 'in', 'stabilization', 'problems', 'for', 'continuous', 'time', 'discretetime', 'and', 'hybrid', 'systems', 'in', 'this', 'paper', 'we', 'address', 'the', 'fundamental', 'question', 'given', 'a', 'clf', 'corresponding', 'to', 'the', 'continuoustime', 'controller', 'with', 'some', 'predefined', 'eg', 'exponential', 'convergence', 'rate', 'can', 'the', 'same', 'convergence', 'rate', 'be', 'provided', 'by', 'an', 'eventtriggered', 'controller', 'under', 'certain', 'assumptions', 'we', 'give', 'an', 'affirmative', 'answer', 'to', 'this', 'question', 'and', 'show', 'that', 'the', 'corresponding', 'eventbased', 'controllers', 'provide', 'positive', 'dwelltimes', 'between', 'the', 'consecutive', 'events', 'furthermore', 'we', 'prove', 'the', 'existence', 'of', 'selftriggered', 'and', 'periodic', 'eventtriggered', 'controllers', 'providing', 'stabilization', 'with', 'a', 'known', 'convergence', 'rate']]
|
[-0.18537776005225923, 0.019681934412527073, -0.08424827684472613, 0.06562640690537831, -0.04969038330654137, -0.19591463747750618, 0.05718778206786703, 0.3738467588423277, -0.33548489969469747, -0.26039960609643525, 0.1647807319213654, -0.16566298388709086, -0.1869226884940323, 0.24034872197739357, -0.15143895151866776, 0.16461999937540517, 0.030570586440417002, 0.01768705727480888, -0.035627937772451844, -0.2735482113576441, 0.28220194661638365, 0.018138293551395315, 0.24617233261782326, 0.004356354472275718, 0.17153213085290395, -0.0046255631802849615, 0.019202972327376593, -0.031017265572511363, -0.16393442278243833, 0.10250295225732942, 0.2813421021795498, 0.15367282642148225, 0.38265922124374585, -0.394015302670733, -0.16455008926195144, 0.15543190245890007, 0.13691997333725733, 0.08835568233340416, -0.11755581487646713, -0.2880072701757528, 0.1428528054142898, -0.15411380691594392, -0.11819885581081628, -0.08181808383274332, -0.0015714089517956072, 0.07878569430970359, -0.34267713187508425, 0.021399310179371037, 0.0990546491559384, 0.07441900009377245, -0.1280917405185975, -0.029057752371783246, 0.021862412728193514, 0.14433797880269164, 0.021415081409246202, -0.002746137049057925, 0.11745469986004228, -0.049610670827294014, -0.21298166089207987, 0.29843604406956936, -0.008285105333856816, -0.2363402081548043, 0.19320666998238215, -0.08472544189876402, -0.13040398303770795, 0.11447495930028623, 0.20390899315968436, 0.11172341775667485, -0.1874449725904203, 0.06535990495192993, -0.0394994735515694, 0.211681248128133, 0.05417048169150597, 0.060330640177576327, 0.12266792619890832, 0.18926167647125866, 0.2101949058464324, 0.1563846337650727, 0.049781311716322066, -0.11806396888305415, -0.3042726387568521, -0.09693501432830433, -0.09420529708160826, 0.054843218153658904, -0.07258716360888255, -0.14741247816819628, 0.3865177406542847, 0.16520302293092926, 0.17101032248223727, 0.15306955599226058, 0.2959198476527027, 0.19016008967322842, -0.03988569202165137, 0.0851485568160089, 0.21098469807420428, 0.11448367186909858, 0.11942326425100272, -0.2602581840518089, 0.09297610586948411, 0.1028204759547733]
|
1,803.08981
|
Unix Memory Allocations are Not Poisson
|
In multitasking operating systems, requests for free memory are traditionally
modeled as a stochastic counting process with independent,
exponentially-distributed interarrival times because of the analytic simplicity
such Poisson models afford. We analyze the distribution of several million unix
page commits to show that although this approach could be valid over relatively
long timespans, the behavior of the arrival process over shorter periods is
decidedly not Poisson. We find that this result holds regardless of the
originator of the request: unlike network packets, there is little difference
between system- and user-level page-request distributions. We believe this to
be due to the bursty nature of page allocations, which tend to occur in either
small or extremely large increments. Burstiness and persistent variance have
recently been found in self-similar processes in computer networks, but we show
that although page commits are both bursty and possess high variance over long
timescales, they are probably not self-similar. These results suggest that
altogether different models are needed for fine-grained analysis of memory
systems, an important consideration not only for understanding behavior but
also for the design of online control systems.
|
cs.PF
|
in multitasking operating systems requests for free memory are traditionally modeled as a stochastic counting process with independent exponentiallydistributed interarrival times because of the analytic simplicity such poisson models afford we analyze the distribution of several million unix page commits to show that although this approach could be valid over relatively long timespans the behavior of the arrival process over shorter periods is decidedly not poisson we find that this result holds regardless of the originator of the request unlike network packets there is little difference between system and userlevel pagerequest distributions we believe this to be due to the bursty nature of page allocations which tend to occur in either small or extremely large increments burstiness and persistent variance have recently been found in selfsimilar processes in computer networks but we show that although page commits are both bursty and possess high variance over long timescales they are probably not selfsimilar these results suggest that altogether different models are needed for finegrained analysis of memory systems an important consideration not only for understanding behavior but also for the design of online control systems
|
[['in', 'multitasking', 'operating', 'systems', 'requests', 'for', 'free', 'memory', 'are', 'traditionally', 'modeled', 'as', 'a', 'stochastic', 'counting', 'process', 'with', 'independent', 'exponentiallydistributed', 'interarrival', 'times', 'because', 'of', 'the', 'analytic', 'simplicity', 'such', 'poisson', 'models', 'afford', 'we', 'analyze', 'the', 'distribution', 'of', 'several', 'million', 'unix', 'page', 'commits', 'to', 'show', 'that', 'although', 'this', 'approach', 'could', 'be', 'valid', 'over', 'relatively', 'long', 'timespans', 'the', 'behavior', 'of', 'the', 'arrival', 'process', 'over', 'shorter', 'periods', 'is', 'decidedly', 'not', 'poisson', 'we', 'find', 'that', 'this', 'result', 'holds', 'regardless', 'of', 'the', 'originator', 'of', 'the', 'request', 'unlike', 'network', 'packets', 'there', 'is', 'little', 'difference', 'between', 'system', 'and', 'userlevel', 'pagerequest', 'distributions', 'we', 'believe', 'this', 'to', 'be', 'due', 'to', 'the', 'bursty', 'nature', 'of', 'page', 'allocations', 'which', 'tend', 'to', 'occur', 'in', 'either', 'small', 'or', 'extremely', 'large', 'increments', 'burstiness', 'and', 'persistent', 'variance', 'have', 'recently', 'been', 'found', 'in', 'selfsimilar', 'processes', 'in', 'computer', 'networks', 'but', 'we', 'show', 'that', 'although', 'page', 'commits', 'are', 'both', 'bursty', 'and', 'possess', 'high', 'variance', 'over', 'long', 'timescales', 'they', 'are', 'probably', 'not', 'selfsimilar', 'these', 'results', 'suggest', 'that', 'altogether', 'different', 'models', 'are', 'needed', 'for', 'finegrained', 'analysis', 'of', 'memory', 'systems', 'an', 'important', 'consideration', 'not', 'only', 'for', 'understanding', 'behavior', 'but', 'also', 'for', 'the', 'design', 'of', 'online', 'control', 'systems']]
|
[-0.1548411760446132, 0.10779808850297666, -0.09239346496926244, 0.11322267629378975, -0.07088889625900593, -0.1711572835176084, 0.05088418081041446, 0.4450681243152892, -0.26433849134711457, -0.3127256115603317, 0.12981323614370466, -0.24061647181137072, -0.1408226655483185, 0.22036193944183, -0.10706208098445678, 0.02064036636974642, 0.07919334332888713, 0.04104896664716141, -0.006970668751033929, -0.2859876703705048, 0.26011802981826454, 0.06504779786019092, 0.2906532164540936, 0.026899813365221757, 0.07771207550175575, -0.016406096439157192, -0.06485236119962415, -0.0009704755162413084, -0.059885177217567684, 0.04479050907704603, 0.2776601349665288, 0.1281937250000017, 0.28218812304625257, -0.44611998959927934, -0.24494570292038792, 0.13779110853468662, 0.17864081523870373, 0.0912825876631891, -0.008648947402936676, -0.23384887235025403, 0.14492754396044807, -0.20787768699788575, -0.055726677690800586, -0.07271592457246931, 0.07432005999742147, 0.07866332948187499, -0.22730404316941327, 0.06555975921934883, 0.09632516992303843, 0.03618521009230874, -0.03933371519867097, -0.09258397554538512, -0.0015712381617924392, 0.15791352632038214, 0.10205202081394661, -0.026464051185010377, 0.11598672681676397, -0.10328104920161105, -0.13061778500798296, 0.37178356989790673, -0.01843106713212131, -0.17859702257062893, 0.2231366539404529, -0.14711305051736656, -0.1698061697276645, 0.15599257295666252, 0.19457999675196233, 0.09853952954131398, -0.1784212316438566, 0.00473952515571139, -0.01642756081247305, 0.1885476791569607, 0.0719591759163072, 0.0719343323325433, 0.20100758940266455, 0.1687543190089487, 0.05612166548692341, 0.07537000161682159, -0.03373153252613634, -0.16004884867964547, -0.24191221151032735, -0.12121310498046338, -0.1664909985962278, 0.0829734298004737, -0.08673139338744512, -0.17888637200567892, 0.33040841982593055, 0.18272004526775187, 0.19499838565949534, 0.103780351271134, 0.26159397791562183, 0.1195601256191476, 0.09568842778318241, 0.13570707537936139, 0.14623786827111668, 0.016347711280502296, 0.14555674988860418, -0.13835525335050622, 0.15928918798581335, -0.037229416795237794]
|
1,803.08982
|
Distributed consensus of linear MASs with an unknown leader via a
predictive extended state observer considering input delay and disturbances
|
The problem of disturbance rejection/attenuation for constant-input delayed
linear multi-agent systems (MASs) with the directed communication topology is
tackled in this paper, where a classic model reduction technique is introduced
to transform the delayed MAS into the delay-free one. First, when the leader
has no control input, a novel adaptive predictive extended state observer (ESO)
using only relative state information of neighboring agents is designed to
achieve disturbance-rejected consensus tracking. The stabilization analysis is
presented via the Lyapunov function and sufficient conditions are derived in
terms of linear matrix inequalities. Then the result is extended to the
disturbance-attenuated case where the leader has bounded control input which is
only known by a portion of followers. Finally, two numerical examples are
presented to illustrate the effectiveness of proposed strategies. The main
contribution focuses on the design of adaptive predictive ESO protocols with
the fully distributed property.
|
cs.SY
|
the problem of disturbance rejectionattenuation for constantinput delayed linear multiagent systems mass with the directed communication topology is tackled in this paper where a classic model reduction technique is introduced to transform the delayed mas into the delayfree one first when the leader has no control input a novel adaptive predictive extended state observer eso using only relative state information of neighboring agents is designed to achieve disturbancerejected consensus tracking the stabilization analysis is presented via the lyapunov function and sufficient conditions are derived in terms of linear matrix inequalities then the result is extended to the disturbanceattenuated case where the leader has bounded control input which is only known by a portion of followers finally two numerical examples are presented to illustrate the effectiveness of proposed strategies the main contribution focuses on the design of adaptive predictive eso protocols with the fully distributed property
|
[['the', 'problem', 'of', 'disturbance', 'rejectionattenuation', 'for', 'constantinput', 'delayed', 'linear', 'multiagent', 'systems', 'mass', 'with', 'the', 'directed', 'communication', 'topology', 'is', 'tackled', 'in', 'this', 'paper', 'where', 'a', 'classic', 'model', 'reduction', 'technique', 'is', 'introduced', 'to', 'transform', 'the', 'delayed', 'mas', 'into', 'the', 'delayfree', 'one', 'first', 'when', 'the', 'leader', 'has', 'no', 'control', 'input', 'a', 'novel', 'adaptive', 'predictive', 'extended', 'state', 'observer', 'eso', 'using', 'only', 'relative', 'state', 'information', 'of', 'neighboring', 'agents', 'is', 'designed', 'to', 'achieve', 'disturbancerejected', 'consensus', 'tracking', 'the', 'stabilization', 'analysis', 'is', 'presented', 'via', 'the', 'lyapunov', 'function', 'and', 'sufficient', 'conditions', 'are', 'derived', 'in', 'terms', 'of', 'linear', 'matrix', 'inequalities', 'then', 'the', 'result', 'is', 'extended', 'to', 'the', 'disturbanceattenuated', 'case', 'where', 'the', 'leader', 'has', 'bounded', 'control', 'input', 'which', 'is', 'only', 'known', 'by', 'a', 'portion', 'of', 'followers', 'finally', 'two', 'numerical', 'examples', 'are', 'presented', 'to', 'illustrate', 'the', 'effectiveness', 'of', 'proposed', 'strategies', 'the', 'main', 'contribution', 'focuses', 'on', 'the', 'design', 'of', 'adaptive', 'predictive', 'eso', 'protocols', 'with', 'the', 'fully', 'distributed', 'property']]
|
[-0.129448249297058, 0.041421513509084566, -0.07345017699808781, 0.015509460379818705, -0.09526721194406297, -0.20045276079657123, 0.01788740808306037, 0.3633126949112043, -0.3047947812006406, -0.28342842809353946, 0.14892979273147358, -0.22435393779545176, -0.15440793013107693, 0.1634707174359669, -0.123374653175962, 0.08605900238076529, 0.060823255180586, 0.05804025445212709, -0.007763622252680097, -0.278060804477873, 0.306204338806536, 0.06873393565431198, 0.27484682732400423, -0.019702370948957423, 0.1544561512530484, 0.014194981115771102, -0.04960139510419933, 0.019694619313384412, -0.0986000299668402, 0.10332091116422377, 0.2805319438599288, 0.1487941540998955, 0.34760951874315316, -0.37445476257526283, -0.18969233929186213, 0.1034405713691211, 0.12935351981972973, 0.0864399507640141, -0.061247244337738774, -0.30930374306956876, 0.11088848797644073, -0.16603072389220516, -0.10146763492111407, -0.022927504318521905, -0.02594084197866684, 0.038899079523320106, -0.32630281242152265, 0.032395590709337424, 0.06295673244869945, 0.03198364827243598, -0.07503128751901024, -0.07157015220381002, -0.012667338079805916, 0.13660626935567013, -0.007837113228309503, 0.00546106125363512, 0.11333190202911167, -0.08214599962663302, -0.15541971255017853, 0.34514112456070906, -0.005233410630682285, -0.22804919583661026, 0.15244058396581375, -0.06760265213166568, -0.11964673603098866, 0.11226770914562628, 0.20154565667852442, 0.12544193645239088, -0.18386349190864135, 0.06683140076285704, -0.04596578390568706, 0.22182055416100838, -0.0018601248995235838, 0.02656463882638181, 0.09648904943482038, 0.1949380872695185, 0.1575765589863914, 0.16811341596833357, -0.05283330738749223, -0.16938222572537706, -0.2869544396282616, -0.09126007999623763, -0.18213940799857178, -0.02039099082017172, -0.06732032801417208, -0.09651079291563666, 0.38583158512751686, 0.10960943780258192, 0.14167077205282577, 0.07877696135018603, 0.3603126089640147, 0.1155364650164579, 0.02616797031913983, 0.08477145938057426, 0.27023115058607877, 0.14516396378992613, 0.10416201584318534, -0.23652651915756048, 0.12644170098508714, 0.08674963428306555]
|
1,803.08983
|
Automated Evaluation of Out-of-Context Errors
|
We present a new approach to evaluate computational models for the task of
text understanding by the means of out-of-context error detection. Through the
novel design of our automated modification process, existing large-scale data
sources can be adopted for a vast number of text understanding tasks. The data
is thereby altered on a semantic level, allowing models to be tested against a
challenging set of modified text passages that require to comprise a broader
narrative discourse. Our newly introduced task targets actual real-world
problems of transcription and translation systems by inserting authentic
out-of-context errors. The automated modification process is applied to the
2016 TEDTalk corpus. Entirely automating the process allows the adoption of
complete datasets at low cost, facilitating supervised learning procedures and
deeper networks to be trained and tested. To evaluate the quality of the
modification algorithm a language model and a supervised binary classification
model are trained and tested on the altered dataset. A human baseline
evaluation is examined to compare the results with human performance. The
outcome of the evaluation task indicates the difficulty to detect semantic
errors for machine-learning algorithms and humans, showing that the errors
cannot be identified when limited to a single sentence.
|
cs.CL cs.AI
|
we present a new approach to evaluate computational models for the task of text understanding by the means of outofcontext error detection through the novel design of our automated modification process existing largescale data sources can be adopted for a vast number of text understanding tasks the data is thereby altered on a semantic level allowing models to be tested against a challenging set of modified text passages that require to comprise a broader narrative discourse our newly introduced task targets actual realworld problems of transcription and translation systems by inserting authentic outofcontext errors the automated modification process is applied to the 2016 tedtalk corpus entirely automating the process allows the adoption of complete datasets at low cost facilitating supervised learning procedures and deeper networks to be trained and tested to evaluate the quality of the modification algorithm a language model and a supervised binary classification model are trained and tested on the altered dataset a human baseline evaluation is examined to compare the results with human performance the outcome of the evaluation task indicates the difficulty to detect semantic errors for machinelearning algorithms and humans showing that the errors cannot be identified when limited to a single sentence
|
[['we', 'present', 'a', 'new', 'approach', 'to', 'evaluate', 'computational', 'models', 'for', 'the', 'task', 'of', 'text', 'understanding', 'by', 'the', 'means', 'of', 'outofcontext', 'error', 'detection', 'through', 'the', 'novel', 'design', 'of', 'our', 'automated', 'modification', 'process', 'existing', 'largescale', 'data', 'sources', 'can', 'be', 'adopted', 'for', 'a', 'vast', 'number', 'of', 'text', 'understanding', 'tasks', 'the', 'data', 'is', 'thereby', 'altered', 'on', 'a', 'semantic', 'level', 'allowing', 'models', 'to', 'be', 'tested', 'against', 'a', 'challenging', 'set', 'of', 'modified', 'text', 'passages', 'that', 'require', 'to', 'comprise', 'a', 'broader', 'narrative', 'discourse', 'our', 'newly', 'introduced', 'task', 'targets', 'actual', 'realworld', 'problems', 'of', 'transcription', 'and', 'translation', 'systems', 'by', 'inserting', 'authentic', 'outofcontext', 'errors', 'the', 'automated', 'modification', 'process', 'is', 'applied', 'to', 'the', '2016', 'tedtalk', 'corpus', 'entirely', 'automating', 'the', 'process', 'allows', 'the', 'adoption', 'of', 'complete', 'datasets', 'at', 'low', 'cost', 'facilitating', 'supervised', 'learning', 'procedures', 'and', 'deeper', 'networks', 'to', 'be', 'trained', 'and', 'tested', 'to', 'evaluate', 'the', 'quality', 'of', 'the', 'modification', 'algorithm', 'a', 'language', 'model', 'and', 'a', 'supervised', 'binary', 'classification', 'model', 'are', 'trained', 'and', 'tested', 'on', 'the', 'altered', 'dataset', 'a', 'human', 'baseline', 'evaluation', 'is', 'examined', 'to', 'compare', 'the', 'results', 'with', 'human', 'performance', 'the', 'outcome', 'of', 'the', 'evaluation', 'task', 'indicates', 'the', 'difficulty', 'to', 'detect', 'semantic', 'errors', 'for', 'machinelearning', 'algorithms', 'and', 'humans', 'showing', 'that', 'the', 'errors', 'can', 'not', 'be', 'identified', 'when', 'limited', 'to', 'a', 'single', 'sentence']]
|
[-0.047202336229559445, -0.0061027629970193805, -0.06238334673461528, 0.10052794149427126, -0.1476359778919243, -0.15735455378702837, 0.09517162141446305, 0.4145443036136727, -0.23919807300767182, -0.3752713837665529, 0.06457944202643992, -0.24826652418341472, -0.13098987326699885, 0.24400819867297108, -0.13124259818466988, 0.09675306865674017, 0.18841404576397422, 0.036485175808058615, -0.033371607748728396, -0.29926202793947265, 0.30034821103245074, 0.07690658993157909, 0.3351984231138424, 0.04527613553821095, 0.10461725194203719, -0.042506650888159796, -0.07743513715060325, -0.005994441390187297, -0.029939890631264537, 0.17020227355606404, 0.33764244191485004, 0.21945674577493912, 0.31889759747770113, -0.38350851640886807, -0.21827647718015927, 0.07628575398296529, 0.1269238609650954, 0.12720343604078108, -0.010254401101698004, -0.387651412975366, 0.09767060240627683, -0.16309399811560335, -0.0003006848150948484, -0.14452922421544978, -0.01097712487487787, -0.037032648378131375, -0.2783655334964872, 0.051216136327191214, 0.07669835440327774, 0.09119264935915494, -0.01750346111986627, -0.10452190164626393, 0.02972745771950401, 0.18910203723604885, 0.03465922345742513, 0.06829959497481103, 0.179367446516121, -0.17526302620908654, -0.1685402064359555, 0.3961068206752215, -0.05595030691404476, -0.2245292403271899, 0.1907343281638907, -0.003909049752219837, -0.15401522669445106, 0.11958758304148313, 0.24682350686708016, 0.09672424869012818, -0.19770788767729855, -0.01611763137160454, 0.016283523393139692, 0.23664964463716215, 0.024824294501485013, -0.06270433114794781, 0.1925432268020009, 0.28568012652867214, -0.04483033666602481, 0.1313767955608048, -0.1006778201004069, -0.04225375551681254, -0.21029812406722792, -0.10953083940771123, -0.17160765412520973, -0.03457460004183167, -0.07675450488626044, -0.13999038627040666, 0.38398019664326505, 0.23506182243570162, 0.17794129187030597, 0.08868302520359843, 0.3289736817045671, 0.017901256358810822, 0.10936857803359665, 0.0481079692648719, 0.1831694268820405, -0.015647746996963443, 0.1095814901478963, -0.18537489519028658, 0.1271199641091721, 0.03255991379136042]
|
1,803.08984
|
The slice hyperholomorphic Bergman space on $\mathbb{B}_R$: Integral
representation and asymptotic behavior
|
The aim of the present paper is three folds. Firstly, we complete the study
of the weighted hyperholomorphic Bergman space of the second kind on the ball
of radius $R$ centred at the origin. The explicit expression of its Bergman
kernel is given and can be written in terms of special hypergeometric functions
of two non-commuting (quaternionic) variables. Secondly, we introduce and study
some basic properties of an associated integral transform, the quaternionic
analogue of the so-called second Bargmann transform for the holomorphic Bergman
space. Finally, we establish the asymptotic behavior as $R$ goes to infinity.
We show in particular that the reproducing kernel of the weighted slice
hyperholomorphic Bergman space gives rise to its analogue for the slice
hyperholomorphic Bargamann-Fock space.
|
math.CV
|
the aim of the present paper is three folds firstly we complete the study of the weighted hyperholomorphic bergman space of the second kind on the ball of radius r centred at the origin the explicit expression of its bergman kernel is given and can be written in terms of special hypergeometric functions of two noncommuting quaternionic variables secondly we introduce and study some basic properties of an associated integral transform the quaternionic analogue of the socalled second bargmann transform for the holomorphic bergman space finally we establish the asymptotic behavior as r goes to infinity we show in particular that the reproducing kernel of the weighted slice hyperholomorphic bergman space gives rise to its analogue for the slice hyperholomorphic bargamannfock space
|
[['the', 'aim', 'of', 'the', 'present', 'paper', 'is', 'three', 'folds', 'firstly', 'we', 'complete', 'the', 'study', 'of', 'the', 'weighted', 'hyperholomorphic', 'bergman', 'space', 'of', 'the', 'second', 'kind', 'on', 'the', 'ball', 'of', 'radius', 'r', 'centred', 'at', 'the', 'origin', 'the', 'explicit', 'expression', 'of', 'its', 'bergman', 'kernel', 'is', 'given', 'and', 'can', 'be', 'written', 'in', 'terms', 'of', 'special', 'hypergeometric', 'functions', 'of', 'two', 'noncommuting', 'quaternionic', 'variables', 'secondly', 'we', 'introduce', 'and', 'study', 'some', 'basic', 'properties', 'of', 'an', 'associated', 'integral', 'transform', 'the', 'quaternionic', 'analogue', 'of', 'the', 'socalled', 'second', 'bargmann', 'transform', 'for', 'the', 'holomorphic', 'bergman', 'space', 'finally', 'we', 'establish', 'the', 'asymptotic', 'behavior', 'as', 'r', 'goes', 'to', 'infinity', 'we', 'show', 'in', 'particular', 'that', 'the', 'reproducing', 'kernel', 'of', 'the', 'weighted', 'slice', 'hyperholomorphic', 'bergman', 'space', 'gives', 'rise', 'to', 'its', 'analogue', 'for', 'the', 'slice', 'hyperholomorphic', 'bargamannfock', 'space']]
|
[-0.14245579516792223, 0.02615617751059688, -0.09489735591125266, 0.1290153066746983, -0.12441214963732179, -0.03779448173201281, -0.01853217583723089, 0.36290319088446205, -0.27368447652533034, -0.14759212475239245, 0.12832580334199054, -0.2450892561180748, -0.20938283025695026, 0.1783826838955591, -0.10636270869992796, 0.03193537545224944, 0.0012349571940327478, 0.11204239419730734, -0.16655523895116692, -0.2611044113262564, 0.43234679235283996, 0.030824935079113512, 0.19285519555411187, 0.033169935642133566, 0.1098166226071675, 0.044312230045791746, -0.06746066218118899, -0.07197491708500234, -0.1888951280076477, 0.1491601032720617, 0.21329182149334389, 0.13508331819537503, 0.2820167083693437, -0.38306038317170515, -0.14357204424709943, 0.19203961555161014, 0.15012698100248645, -0.07664671692393975, 0.043355761360461736, -0.2667013898276347, 0.005465717881356081, -0.09965215626457506, -0.20146413059897475, -0.10848748575403425, -0.0024827192268095724, 0.04476054063959679, -0.22042001730354488, 0.04218143496416078, 0.10431298856769712, 0.030705744246682844, -0.11325594629084092, -0.11098645658478572, 0.00865161440081217, 0.11425509791020766, 0.013858828120210692, 0.08019261762946228, 0.061546160559283476, -0.04999550159497202, -0.0868741987534791, 0.32039774140758703, -0.09705028939686239, -0.2578844873403961, 0.09158104083169837, -0.23482687205984448, -0.14112523174267416, 0.07827279253137367, 0.14014307006978052, 0.16987058634230914, -0.07678026499703897, 0.1854067829289389, -0.11733755040894578, 0.06045212523726946, 0.13963024271459681, 0.06341733039579978, 0.10642506138321535, 0.0967891028377974, 0.0636462183507575, 0.23390763485323146, -0.07610722759609642, -0.09873454168839149, -0.41454408139236704, -0.27762924341777384, -0.20148847203195183, 0.06543767703158304, -0.136628134660798, -0.21929177195449506, 0.4528326512399045, 0.0510418853060581, 0.234224057229128, 0.11443398380844493, 0.21336360815296734, 0.12635893582401042, 0.020539874984490232, 0.033849171913144266, 0.1418360926199816, 0.18622297249457315, 0.08163879147907796, -0.18434191430189592, -0.038989349768674075, 0.22352592346127614]
|
1,803.08985
|
Some Comments on BPS systems
|
We look at simple BPS systems involving more than one field. We discuss the
conditions that have to be imposed on various terms in Lagrangians involving
many fields to produce BPS systems and then look in more detail at the simplest
of such cases. We analyse in detail BPS systems involving 2 interacting
Sine-Gordon like fields, both when one of them has a kink solution and the
second one either a kink or an antikink solution. We take their solitonic
static solutions and use them as initial conditions for their evolution in
Lorentz covariant versions of such models. We send these structures towards
themselves and find that when they interact weakly they can pass through each
other with a phase shift which is related to the strength of their interaction.
When they interact strongly they repel and reflect on each other. We use the
method of a modified gradient flow in order to visualize the solutions in the
space of fields.
|
hep-th nlin.SI
|
we look at simple bps systems involving more than one field we discuss the conditions that have to be imposed on various terms in lagrangians involving many fields to produce bps systems and then look in more detail at the simplest of such cases we analyse in detail bps systems involving 2 interacting sinegordon like fields both when one of them has a kink solution and the second one either a kink or an antikink solution we take their solitonic static solutions and use them as initial conditions for their evolution in lorentz covariant versions of such models we send these structures towards themselves and find that when they interact weakly they can pass through each other with a phase shift which is related to the strength of their interaction when they interact strongly they repel and reflect on each other we use the method of a modified gradient flow in order to visualize the solutions in the space of fields
|
[['we', 'look', 'at', 'simple', 'bps', 'systems', 'involving', 'more', 'than', 'one', 'field', 'we', 'discuss', 'the', 'conditions', 'that', 'have', 'to', 'be', 'imposed', 'on', 'various', 'terms', 'in', 'lagrangians', 'involving', 'many', 'fields', 'to', 'produce', 'bps', 'systems', 'and', 'then', 'look', 'in', 'more', 'detail', 'at', 'the', 'simplest', 'of', 'such', 'cases', 'we', 'analyse', 'in', 'detail', 'bps', 'systems', 'involving', '2', 'interacting', 'sinegordon', 'like', 'fields', 'both', 'when', 'one', 'of', 'them', 'has', 'a', 'kink', 'solution', 'and', 'the', 'second', 'one', 'either', 'a', 'kink', 'or', 'an', 'antikink', 'solution', 'we', 'take', 'their', 'solitonic', 'static', 'solutions', 'and', 'use', 'them', 'as', 'initial', 'conditions', 'for', 'their', 'evolution', 'in', 'lorentz', 'covariant', 'versions', 'of', 'such', 'models', 'we', 'send', 'these', 'structures', 'towards', 'themselves', 'and', 'find', 'that', 'when', 'they', 'interact', 'weakly', 'they', 'can', 'pass', 'through', 'each', 'other', 'with', 'a', 'phase', 'shift', 'which', 'is', 'related', 'to', 'the', 'strength', 'of', 'their', 'interaction', 'when', 'they', 'interact', 'strongly', 'they', 'repel', 'and', 'reflect', 'on', 'each', 'other', 'we', 'use', 'the', 'method', 'of', 'a', 'modified', 'gradient', 'flow', 'in', 'order', 'to', 'visualize', 'the', 'solutions', 'in', 'the', 'space', 'of', 'fields']]
|
[-0.12371082506605326, 0.1293741643512137, -0.07429090356859176, 0.11505295530031001, -0.08998192808307383, -0.1692125872992303, -0.009889464576653443, 0.40386094914760834, -0.2554902324528196, -0.2766942324128395, 0.13158057011253207, -0.3020587445552004, -0.13798597992559813, 0.19519393465782497, 0.006408209941797418, -0.012661792063125357, 0.02008588152492176, 0.10919595324081478, -0.06415415424506486, -0.2552963026614154, 0.3582887889713234, -0.027047381559907463, 0.21064127636321398, -0.015988571549077398, 0.05279148151079968, -0.011073359670782728, 0.030094768690026325, 0.049703439483490916, -0.10618878993459165, 0.09995398401450481, 0.1872859233964326, 0.0914990410775594, 0.2368734865543369, -0.5035204012409685, -0.2059579566873101, 0.11696600621589315, 0.17254115519314853, 0.15681741488678091, -0.03626243459796157, -0.26805624622064905, 0.06794208386531157, -0.14127265086964422, -0.14782778348958825, -0.12112096518925998, -0.009338073720953063, 0.061100893989436744, -0.21753399439954332, 0.0443616378300401, 0.02668920604971972, -0.0022565300217742877, -0.08974375866602251, -0.0627823331832932, -0.05446625144223781, 0.1430566718001772, 0.0740263985125753, -0.004584314611086749, 0.1090057233539381, -0.21189441647878068, -0.09672340759081963, 0.40277733084722567, -0.049404620609165936, -0.2630514857931907, 0.2737485812293649, -0.13294953164233833, -0.15496242665888174, 0.08043322917681349, 0.19083037339902906, 0.14819579809088468, -0.10598605540022471, 0.03759812862541446, 0.004426807656837916, 0.13311712039050339, 0.11201583259299351, 0.04454953974743391, 0.24177536709662178, 0.08720879082463867, 0.07229170293629644, 0.1330350855718257, -0.036444897011793015, -0.1178700744365313, -0.2933590828342745, -0.1546448210994742, -0.08477985989071013, 0.02141712769368513, -0.04703870838208295, -0.17833453966651736, 0.397859916788011, 0.16318203737056866, 0.2072614266519776, 0.0012372039231003163, 0.2329602043335297, 0.13843109871055467, 0.09031129300576976, 0.08154306397050248, 0.2501641029798605, 0.09575365404656261, 0.12063498960110874, -0.17309252134981992, -0.018702444976184125, 0.05924376589824555]
|
1,803.08986
|
DeepMood: Modeling Mobile Phone Typing Dynamics for Mood Detection
|
The increasing use of electronic forms of communication presents new
opportunities in the study of mental health, including the ability to
investigate the manifestations of psychiatric diseases unobtrusively and in the
setting of patients' daily lives. A pilot study to explore the possible
connections between bipolar affective disorder and mobile phone usage was
conducted. In this study, participants were provided a mobile phone to use as
their primary phone. This phone was loaded with a custom keyboard that
collected metadata consisting of keypress entry time and accelerometer
movement. Individual character data with the exceptions of the backspace key
and space bar were not collected due to privacy concerns. We propose an
end-to-end deep architecture based on late fusion, named DeepMood, to model the
multi-view metadata for the prediction of mood scores. Experimental results
show that 90.31% prediction accuracy on the depression score can be achieved
based on session-level mobile phone typing dynamics which is typically less
than one minute. It demonstrates the feasibility of using mobile phone metadata
to infer mood disturbance and severity.
|
cs.HC cs.AI
|
the increasing use of electronic forms of communication presents new opportunities in the study of mental health including the ability to investigate the manifestations of psychiatric diseases unobtrusively and in the setting of patients daily lives a pilot study to explore the possible connections between bipolar affective disorder and mobile phone usage was conducted in this study participants were provided a mobile phone to use as their primary phone this phone was loaded with a custom keyboard that collected metadata consisting of keypress entry time and accelerometer movement individual character data with the exceptions of the backspace key and space bar were not collected due to privacy concerns we propose an endtoend deep architecture based on late fusion named deepmood to model the multiview metadata for the prediction of mood scores experimental results show that 9031 prediction accuracy on the depression score can be achieved based on sessionlevel mobile phone typing dynamics which is typically less than one minute it demonstrates the feasibility of using mobile phone metadata to infer mood disturbance and severity
|
[['the', 'increasing', 'use', 'of', 'electronic', 'forms', 'of', 'communication', 'presents', 'new', 'opportunities', 'in', 'the', 'study', 'of', 'mental', 'health', 'including', 'the', 'ability', 'to', 'investigate', 'the', 'manifestations', 'of', 'psychiatric', 'diseases', 'unobtrusively', 'and', 'in', 'the', 'setting', 'of', 'patients', 'daily', 'lives', 'a', 'pilot', 'study', 'to', 'explore', 'the', 'possible', 'connections', 'between', 'bipolar', 'affective', 'disorder', 'and', 'mobile', 'phone', 'usage', 'was', 'conducted', 'in', 'this', 'study', 'participants', 'were', 'provided', 'a', 'mobile', 'phone', 'to', 'use', 'as', 'their', 'primary', 'phone', 'this', 'phone', 'was', 'loaded', 'with', 'a', 'custom', 'keyboard', 'that', 'collected', 'metadata', 'consisting', 'of', 'keypress', 'entry', 'time', 'and', 'accelerometer', 'movement', 'individual', 'character', 'data', 'with', 'the', 'exceptions', 'of', 'the', 'backspace', 'key', 'and', 'space', 'bar', 'were', 'not', 'collected', 'due', 'to', 'privacy', 'concerns', 'we', 'propose', 'an', 'endtoend', 'deep', 'architecture', 'based', 'on', 'late', 'fusion', 'named', 'deepmood', 'to', 'model', 'the', 'multiview', 'metadata', 'for', 'the', 'prediction', 'of', 'mood', 'scores', 'experimental', 'results', 'show', 'that', '9031', 'prediction', 'accuracy', 'on', 'the', 'depression', 'score', 'can', 'be', 'achieved', 'based', 'on', 'sessionlevel', 'mobile', 'phone', 'typing', 'dynamics', 'which', 'is', 'typically', 'less', 'than', 'one', 'minute', 'it', 'demonstrates', 'the', 'feasibility', 'of', 'using', 'mobile', 'phone', 'metadata', 'to', 'infer', 'mood', 'disturbance', 'and', 'severity']]
|
[-0.12033848346178529, 0.033696907827699, -0.02502808901535477, 0.05699641469170253, -0.10325560072805126, -0.18254045221337312, 0.10292354761419796, 0.4124177054307142, -0.22135606929010085, -0.33856098433458354, 0.08895157934180027, -0.3296935988351876, -0.18472494373198187, 0.189054450674015, -0.16520805749500733, 0.023606411028425967, 0.1054271423084618, 0.10300831045673857, -0.0035382419405640426, -0.28316773129640643, 0.279018050011621, 0.05883485474742185, 0.35508867410596373, 0.057194944909328076, 0.06441593717656445, 0.017429571899282206, -0.06663607348698776, -0.05499860869336814, -0.04126328395905994, 0.19315743560058085, 0.28226739365667064, 0.20131543336901814, 0.3440527274479093, -0.4528927335591424, -0.19557837097429084, 0.04364614809868684, 0.13713413149492035, 0.0516868962894118, -0.033185751298523705, -0.39829384475989743, 0.1060747453268769, -0.2328136803008356, -0.06785207025017752, -0.07061449869340936, 0.01457210180625796, 0.02265593295965647, -0.2446185926457347, 0.04220201531127312, -0.05190227128332481, 0.1920208925717012, -0.06740961110944925, -0.05820884615816393, -0.0012314883981246589, 0.2324814999091634, 0.08011629586825472, -0.019484979091049712, 0.18884782427055544, -0.14148564349188533, -0.1490138019110228, 0.3657964841072816, -0.005084060981675446, -0.13386755072454878, 0.18976715916150444, -0.08267286955108216, -0.09649656862995132, 0.07537383014650278, 0.2644736033100851, 0.030483076568871607, -0.19182919341052862, -0.05421432523025731, -0.015150639970332037, 0.22807256291555458, 0.06630841599842317, 0.010226114353213762, 0.16789367260884488, 0.25140417148467414, -0.01260896387975663, 0.1147679847734168, -0.13381759790557457, -0.04246029194727334, -0.1945777034067527, -0.15573838503549395, -0.14607426510321053, 0.03062324975436177, -0.058756245657118705, -0.1407716548839194, 0.41168989282003926, 0.2174558582976948, 0.151876452243562, 0.04794718158434059, 0.31945171936680455, -0.0003864236205117777, 0.11238336407574066, 0.047295578100263726, 0.13963551308856845, -0.01928457968900803, 0.19478329082376994, -0.1934999988500982, 0.14511004942848327, 0.012184468349766766]
|
1,803.08987
|
Polarization Modeling and Predictions for DKIST Part 3: Focal Ratio and
Thermal Dependencies of Spectral Polarization Fringes and Optic Retardance
|
Data products from high spectral resolution astronomical polarimeters are
often limited by fringes. Fringes can skew derived magnetic field properties
from spectropolarimetric data. Fringe removal algorithms can also corrupt the
data if the fringes and object signals are too similar. For some narrow-band
imaging polarimeters, fringes change the calibration retarder properties, and
dominate the calibration errors. Systems-level engineering tools for
polarimetric instrumentation require accurate predictions of fringe amplitudes,
periods for transmission, diattenuation and retardance. The relevant
instabilities caused by environmental, thermal and optical properties can be
modeled and mitigation tools developed. We create spectral polarization fringe
amplitude and temporal instability predictions by applying the Berreman
calculus and simple interferrometric calculations to optics in beams of varying
F/ number. We then apply the formalism to super-achromatic six crystal
retarders in converging beams under beam thermal loading in outdoor
environmental conditions for two of the worlds largest observatories: the 10m
Keck telescope and the Daniel K. Inouye Solar Telescope (DKIST). DKIST will
produce a 300 Watt optical beam which has imposed stringent requirements on the
large diameter six-crystal retarders, dichroic beamsplitters and internal
optics. DKIST retarders are used in a converging beams with F/ ratios between 8
and 62. The fringe spectral periods, amplitudes and thermal models of retarder
behavior assisted DKIST optical designs and calibration plans with future
application to many astronomical spectropolarimeters. The Low Resolution
Imaging Spectrograph with polarimetry (LRISp) instrument at Keck also uses
six-crystal retarders in a converging F/ 13 beam in a Cassegrain focus exposed
to summit environmental conditions providing observational verification of our
predictions.
|
astro-ph.IM
|
data products from high spectral resolution astronomical polarimeters are often limited by fringes fringes can skew derived magnetic field properties from spectropolarimetric data fringe removal algorithms can also corrupt the data if the fringes and object signals are too similar for some narrowband imaging polarimeters fringes change the calibration retarder properties and dominate the calibration errors systemslevel engineering tools for polarimetric instrumentation require accurate predictions of fringe amplitudes periods for transmission diattenuation and retardance the relevant instabilities caused by environmental thermal and optical properties can be modeled and mitigation tools developed we create spectral polarization fringe amplitude and temporal instability predictions by applying the berreman calculus and simple interferrometric calculations to optics in beams of varying f number we then apply the formalism to superachromatic six crystal retarders in converging beams under beam thermal loading in outdoor environmental conditions for two of the worlds largest observatories the 10m keck telescope and the daniel k inouye solar telescope dkist dkist will produce a 300 watt optical beam which has imposed stringent requirements on the large diameter sixcrystal retarders dichroic beamsplitters and internal optics dkist retarders are used in a converging beams with f ratios between 8 and 62 the fringe spectral periods amplitudes and thermal models of retarder behavior assisted dkist optical designs and calibration plans with future application to many astronomical spectropolarimeters the low resolution imaging spectrograph with polarimetry lrisp instrument at keck also uses sixcrystal retarders in a converging f 13 beam in a cassegrain focus exposed to summit environmental conditions providing observational verification of our predictions
|
[['data', 'products', 'from', 'high', 'spectral', 'resolution', 'astronomical', 'polarimeters', 'are', 'often', 'limited', 'by', 'fringes', 'fringes', 'can', 'skew', 'derived', 'magnetic', 'field', 'properties', 'from', 'spectropolarimetric', 'data', 'fringe', 'removal', 'algorithms', 'can', 'also', 'corrupt', 'the', 'data', 'if', 'the', 'fringes', 'and', 'object', 'signals', 'are', 'too', 'similar', 'for', 'some', 'narrowband', 'imaging', 'polarimeters', 'fringes', 'change', 'the', 'calibration', 'retarder', 'properties', 'and', 'dominate', 'the', 'calibration', 'errors', 'systemslevel', 'engineering', 'tools', 'for', 'polarimetric', 'instrumentation', 'require', 'accurate', 'predictions', 'of', 'fringe', 'amplitudes', 'periods', 'for', 'transmission', 'diattenuation', 'and', 'retardance', 'the', 'relevant', 'instabilities', 'caused', 'by', 'environmental', 'thermal', 'and', 'optical', 'properties', 'can', 'be', 'modeled', 'and', 'mitigation', 'tools', 'developed', 'we', 'create', 'spectral', 'polarization', 'fringe', 'amplitude', 'and', 'temporal', 'instability', 'predictions', 'by', 'applying', 'the', 'berreman', 'calculus', 'and', 'simple', 'interferrometric', 'calculations', 'to', 'optics', 'in', 'beams', 'of', 'varying', 'f', 'number', 'we', 'then', 'apply', 'the', 'formalism', 'to', 'superachromatic', 'six', 'crystal', 'retarders', 'in', 'converging', 'beams', 'under', 'beam', 'thermal', 'loading', 'in', 'outdoor', 'environmental', 'conditions', 'for', 'two', 'of', 'the', 'worlds', 'largest', 'observatories', 'the', '10m', 'keck', 'telescope', 'and', 'the', 'daniel', 'k', 'inouye', 'solar', 'telescope', 'dkist', 'dkist', 'will', 'produce', 'a', '300', 'watt', 'optical', 'beam', 'which', 'has', 'imposed', 'stringent', 'requirements', 'on', 'the', 'large', 'diameter', 'sixcrystal', 'retarders', 'dichroic', 'beamsplitters', 'and', 'internal', 'optics', 'dkist', 'retarders', 'are', 'used', 'in', 'a', 'converging', 'beams', 'with', 'f', 'ratios', 'between', '8', 'and', '62', 'the', 'fringe', 'spectral', 'periods', 'amplitudes', 'and', 'thermal', 'models', 'of', 'retarder', 'behavior', 'assisted', 'dkist', 'optical', 'designs', 'and', 'calibration', 'plans', 'with', 'future', 'application', 'to', 'many', 'astronomical', 'spectropolarimeters', 'the', 'low', 'resolution', 'imaging', 'spectrograph', 'with', 'polarimetry', 'lrisp', 'instrument', 'at', 'keck', 'also', 'uses', 'sixcrystal', 'retarders', 'in', 'a', 'converging', 'f', '13', 'beam', 'in', 'a', 'cassegrain', 'focus', 'exposed', 'to', 'summit', 'environmental', 'conditions', 'providing', 'observational', 'verification', 'of', 'our', 'predictions']]
|
[-0.12030443213880063, 0.1900320364016236, -0.09355085006933295, 0.03194258163418329, -0.1142164118033286, -0.1769041772347455, -0.009576515240740834, 0.4580781980180273, -0.19863652799086756, -0.37409246394447254, 0.13315899439302145, -0.278592943536419, -0.08073073673956827, 0.26544793107108594, -0.08483340339369926, 0.08420325759598556, 0.12132525176047255, -0.12064058746886897, -0.02495410321097748, -0.18038633659701137, 0.2056169167864045, 0.1444731694664441, 0.2949563709126475, -0.04883326337074715, 0.09805088247875592, 0.020871839532172125, -0.0807280980707968, -0.017912137518436008, -0.10647367777967114, 0.03976269853575265, 0.2946545555427078, 0.12826367950651282, 0.17483162038831734, -0.4244156075458901, -0.1656135004269434, 0.0489297356661957, 0.07598854807643768, 0.029300570469258318, -0.009950052681561633, -0.295921130982392, -0.002890920720528811, -0.09925005102128374, -0.16527668316072475, -0.03485622050904888, -0.019990023121000358, 0.06753633547501237, -0.2979976478197119, -0.03638162755375436, -0.05354151498873298, 0.15095653496656963, -0.06581212926756444, -0.12952921376107077, -0.01304488399559084, 0.0825711786527844, -0.07539806380941003, 0.0021443103540542663, 0.1316100541228319, -0.12196938771772764, -0.06556730396890392, 0.33940937725242737, -0.07210958393509774, -0.08458215102334232, 0.15974335899010447, -0.21158592202061532, -0.10176444191704778, 0.1824522211020082, 0.17660172126922463, 0.09018227950505474, -0.1295503403461885, 0.013682604251160085, 0.07018936046527005, 0.20693719560718712, 0.1924627556684701, 0.1278997819030694, 0.239927537741103, 0.12900389231303158, 0.05373308718108627, 0.1013945138168649, -0.2581918849116739, 0.04406574365920296, -0.23970286570119617, -0.06151594199708437, -0.11532728493706706, 0.03730509079554502, -0.08208884343347403, -0.0957679360744306, 0.36174653852723687, 0.16112435289439472, 0.09273470380873072, -0.017939983441622235, 0.37754360411462246, 0.041563567786258374, 0.11314498666381718, -0.003687239127854506, 0.2759077854359787, 0.18637631062473006, 0.1845557625158964, -0.21785866411987181, 0.0059863895086535055, -0.024810814255547216]
|
1,803.08988
|
Evaluating Sentence-Level Relevance Feedback for High-Recall Information
Retrieval
|
This study uses a novel simulation framework to evaluate whether the time and
effort necessary to achieve high recall using active learning is reduced by
presenting the reviewer with isolated sentences, as opposed to full documents,
for relevance feedback. Under the weak assumption that more time and effort is
required to review an entire document than a single sentence, simulation
results indicate that the use of isolated sentences for relevance feedback can
yield comparable accuracy and higher efficiency, relative to the
state-of-the-art Baseline Model Implementation (BMI) of the AutoTAR Continuous
Active Learning ("CAL") method employed in the TREC 2015 and 2016 Total Recall
Track.
|
cs.IR
|
this study uses a novel simulation framework to evaluate whether the time and effort necessary to achieve high recall using active learning is reduced by presenting the reviewer with isolated sentences as opposed to full documents for relevance feedback under the weak assumption that more time and effort is required to review an entire document than a single sentence simulation results indicate that the use of isolated sentences for relevance feedback can yield comparable accuracy and higher efficiency relative to the stateoftheart baseline model implementation bmi of the autotar continuous active learning cal method employed in the trec 2015 and 2016 total recall track
|
[['this', 'study', 'uses', 'a', 'novel', 'simulation', 'framework', 'to', 'evaluate', 'whether', 'the', 'time', 'and', 'effort', 'necessary', 'to', 'achieve', 'high', 'recall', 'using', 'active', 'learning', 'is', 'reduced', 'by', 'presenting', 'the', 'reviewer', 'with', 'isolated', 'sentences', 'as', 'opposed', 'to', 'full', 'documents', 'for', 'relevance', 'feedback', 'under', 'the', 'weak', 'assumption', 'that', 'more', 'time', 'and', 'effort', 'is', 'required', 'to', 'review', 'an', 'entire', 'document', 'than', 'a', 'single', 'sentence', 'simulation', 'results', 'indicate', 'that', 'the', 'use', 'of', 'isolated', 'sentences', 'for', 'relevance', 'feedback', 'can', 'yield', 'comparable', 'accuracy', 'and', 'higher', 'efficiency', 'relative', 'to', 'the', 'stateoftheart', 'baseline', 'model', 'implementation', 'bmi', 'of', 'the', 'autotar', 'continuous', 'active', 'learning', 'cal', 'method', 'employed', 'in', 'the', 'trec', '2015', 'and', '2016', 'total', 'recall', 'track']]
|
[-0.01522844423454038, 0.012281781877532321, -0.04062722400237707, 0.06887684129201128, -0.10732664914521416, -0.13328064952805205, 0.08641206114824174, 0.42463153647710977, -0.19344054699595115, -0.3927048105945431, 0.06725593193578851, -0.25773721710932485, -0.10242912606833485, 0.1945563705063886, -0.10159054785532859, 0.07758456970863406, 0.1281380313493818, 0.0692937512570106, -0.08638742151760577, -0.3238477903391117, 0.2576967450830796, 0.141761794532604, 0.3288125022612874, 0.017418130695960005, 0.13228102133256717, -0.01971101373415983, -0.08271763792478488, 0.0076447772246432824, -0.08865934031977639, 0.12488542380516679, 0.29320146768010286, 0.18637120972378451, 0.32212713152821204, -0.3946574612620097, -0.18366496848141395, 0.07348598945587512, 0.09573923205070704, 0.09255962277360225, -0.04519662971100295, -0.28153028201709673, 0.12674683308934123, -0.20459267192348404, -0.03314112633855525, -0.12852421107258902, 0.01899230449451405, -0.008513710301733085, -0.26849941263264676, 0.0744355522656759, 0.07830975752458648, 0.04660300848083299, -0.030948197279233956, -0.08665230420409041, 0.014329734068472409, 0.16485031634496833, 0.004963843688793769, 0.09472052117773486, 0.139811059432918, -0.14026725383014, -0.18221710356250767, 0.38323950785601024, -0.08308712064892673, -0.18291098128063876, 0.22330848235202935, -0.06461656262230092, -0.1022406454849084, 0.14597924187490083, 0.2218698383064814, 0.1277387377182112, -0.13692821253959125, -0.008289648082053054, -0.023426771362863696, 0.2585959405868848, 0.030451911121823834, -0.011899424499823051, 0.15006539808333064, 0.25628310284640604, 0.016839603622199842, 0.1430416540129707, -0.05776469701747365, -0.07782541820553393, -0.2774138894583126, -0.13875181805025966, -0.1347664551248828, -0.014364026107111023, -0.04465280226330065, -0.09049742659373046, 0.3728690547416511, 0.237936327934663, 0.17329048314719525, 0.1003251291870239, 0.3245908598804358, 0.04166362287128543, 0.04727878250425808, 0.07983044387537588, 0.20227010668372936, 0.052422745291197906, 0.1217967886432499, -0.22071466099434686, 0.09144721385453222, 0.04952449670730574]
|
1,803.08989
|
A unified framework of fully distributed adaptive output time-varying
formation control for linear multi-agent systems: an observer viewpoint
|
This paper presents a unified framework of time-varying formation (TVF)
design for general linear multi-agent systems (MAS) based on an observer
viewpoint from undirected to directed topology, from stabilization to tracking
and from a leader without input to a one with bounded input. The followers can
form a TVF shape which is specified by piecewise continuously differential
vectors. The leader's trajectory, which is available to only a subset of
followers, is also time-varying. For the undirected formation tracking and
directed formation stabilization cases, only the relative output measurements
of neighbors are required to design control protocols; for the directed
formation tracking case, the agents need to be introspective (i.e. agents have
partial knowledge of their own states) and the output measurements are
required. Furthermore, considering the real applications, the leader with
bounded input case is studied. One main contribution of this paper is that
fully distributed adaptive output protocols, which require no global
information of communication topology and do not need the absolute or relative
state information, are proposed to solve the TVF control problem. Numerical
simulations including an application to nonholonomic mobile vehicles are
provided to verify the theoretical results.
|
cs.SY
|
this paper presents a unified framework of timevarying formation tvf design for general linear multiagent systems mas based on an observer viewpoint from undirected to directed topology from stabilization to tracking and from a leader without input to a one with bounded input the followers can form a tvf shape which is specified by piecewise continuously differential vectors the leaders trajectory which is available to only a subset of followers is also timevarying for the undirected formation tracking and directed formation stabilization cases only the relative output measurements of neighbors are required to design control protocols for the directed formation tracking case the agents need to be introspective ie agents have partial knowledge of their own states and the output measurements are required furthermore considering the real applications the leader with bounded input case is studied one main contribution of this paper is that fully distributed adaptive output protocols which require no global information of communication topology and do not need the absolute or relative state information are proposed to solve the tvf control problem numerical simulations including an application to nonholonomic mobile vehicles are provided to verify the theoretical results
|
[['this', 'paper', 'presents', 'a', 'unified', 'framework', 'of', 'timevarying', 'formation', 'tvf', 'design', 'for', 'general', 'linear', 'multiagent', 'systems', 'mas', 'based', 'on', 'an', 'observer', 'viewpoint', 'from', 'undirected', 'to', 'directed', 'topology', 'from', 'stabilization', 'to', 'tracking', 'and', 'from', 'a', 'leader', 'without', 'input', 'to', 'a', 'one', 'with', 'bounded', 'input', 'the', 'followers', 'can', 'form', 'a', 'tvf', 'shape', 'which', 'is', 'specified', 'by', 'piecewise', 'continuously', 'differential', 'vectors', 'the', 'leaders', 'trajectory', 'which', 'is', 'available', 'to', 'only', 'a', 'subset', 'of', 'followers', 'is', 'also', 'timevarying', 'for', 'the', 'undirected', 'formation', 'tracking', 'and', 'directed', 'formation', 'stabilization', 'cases', 'only', 'the', 'relative', 'output', 'measurements', 'of', 'neighbors', 'are', 'required', 'to', 'design', 'control', 'protocols', 'for', 'the', 'directed', 'formation', 'tracking', 'case', 'the', 'agents', 'need', 'to', 'be', 'introspective', 'ie', 'agents', 'have', 'partial', 'knowledge', 'of', 'their', 'own', 'states', 'and', 'the', 'output', 'measurements', 'are', 'required', 'furthermore', 'considering', 'the', 'real', 'applications', 'the', 'leader', 'with', 'bounded', 'input', 'case', 'is', 'studied', 'one', 'main', 'contribution', 'of', 'this', 'paper', 'is', 'that', 'fully', 'distributed', 'adaptive', 'output', 'protocols', 'which', 'require', 'no', 'global', 'information', 'of', 'communication', 'topology', 'and', 'do', 'not', 'need', 'the', 'absolute', 'or', 'relative', 'state', 'information', 'are', 'proposed', 'to', 'solve', 'the', 'tvf', 'control', 'problem', 'numerical', 'simulations', 'including', 'an', 'application', 'to', 'nonholonomic', 'mobile', 'vehicles', 'are', 'provided', 'to', 'verify', 'the', 'theoretical', 'results']]
|
[-0.13851755358161727, 0.06599806018398602, -0.0402617426686652, -0.002530442993888017, -0.14883881169541968, -0.18283778225731212, 0.026637695818720143, 0.4050489228550364, -0.3056684622165615, -0.32763053874694864, 0.11393767587855186, -0.2451473469187686, -0.13804866983165173, 0.14647633709800942, -0.1299120859280765, 0.08527460479523732, 0.08654580350492286, 0.07992111835189905, 0.008051959030983569, -0.2520037387300853, 0.30021451398454785, 0.03734483389630036, 0.25388929302955326, 0.0028617484226861863, 0.11763360575865467, 0.02047720292573356, -0.017855201993522803, 0.03868417078708943, -0.11628632666318371, 0.1342959891622569, 0.28851556295226694, 0.15346662947878786, 0.29591511653648467, -0.4253884339071225, -0.21378657764009157, 0.1308689530699938, 0.1302197400080674, 0.12503639003322875, -0.03898223017096149, -0.30614498974170284, 0.1139726256573797, -0.15862071374675055, -0.07993622051054583, -0.04368557371150371, 0.0046787951190356185, 0.06510074212366998, -0.32687194441586576, -0.0013446910125483802, 0.05773933605982432, 0.04178350304341168, -0.09234729160540078, -0.048567313510139536, -0.033463598136346376, 0.19718299072945286, -0.014708279964821267, 0.02592822160761979, 0.1530185981521978, -0.12213676478177388, -0.17648734607129157, 0.3721824133797934, 0.024863126585308794, -0.24588236897996096, 0.16911045912438663, -0.06679030259856612, -0.11582134339436694, 0.1119694957675422, 0.22118638384190062, 0.12525640761830809, -0.1582125920548801, 0.03051264089025089, -0.027518875306930528, 0.19698413545253604, 0.018208308791478424, 0.012707158855798883, 0.15399415197255606, 0.15522853838504141, 0.165315459294035, 0.09769881759399636, -0.023609570971006254, -0.1615118365375208, -0.29038758229230244, -0.08283506172187431, -0.17184172794759195, 0.01951071389724381, -0.0653955442896442, -0.12710319682029295, 0.38455533736424413, 0.12861361347519212, 0.17818808308631884, 0.08913324091946755, 0.3613173209072252, 0.0819609656046798, 0.01556784040642005, 0.123298755049686, 0.21833736732777656, 0.11511907950458142, 0.11642275321302224, -0.19918335741263918, 0.1459580929706078, 0.03294021563152831]
|
1,803.0899
|
Thermodynamic Black Holes
|
Black holes pose great difficulties for theory since gravity and quantum
theory must be combined in some as yet unknown way. An additional difficulty is
that detailed black hole observational data to guide theorists is lacking. In
this paper, I sidestep the difficulties of combining gravity and quantum theory
by employing black hole thermodynamics augmented by ideas from the information
geometry of thermodynamics. I propose a purely thermodynamic agenda for
choosing correct candidate black hole thermodynamic scaled equations of state,
parameterized by two exponents. These two adjustable exponents may be set to
accommodate additional black hole information, either from astrophysical
observations or from some microscopic theory, such as string theory. My
approach assumes implicitly that the as yet unknown microscopic black hole
constituents have strong effective interactions between them, of a type found
in critical phenomena. In this picture, the details of the microscopic
interaction forces are not important, and the essential macroscopic picture
emerges from general assumptions about the number of independent thermodynamic
variables, types of critical points, boundary conditions, and analyticity. I
use the simple Kerr and Reissner-Nordstrom black holes for guidance, and find
candidate equations of state that embody a number of the features of these
purely gravitational models. My approach may offer a productive new way to
select black hole thermodynamic equations of state representing both
gravitational and quantum properties.
|
gr-qc
|
black holes pose great difficulties for theory since gravity and quantum theory must be combined in some as yet unknown way an additional difficulty is that detailed black hole observational data to guide theorists is lacking in this paper i sidestep the difficulties of combining gravity and quantum theory by employing black hole thermodynamics augmented by ideas from the information geometry of thermodynamics i propose a purely thermodynamic agenda for choosing correct candidate black hole thermodynamic scaled equations of state parameterized by two exponents these two adjustable exponents may be set to accommodate additional black hole information either from astrophysical observations or from some microscopic theory such as string theory my approach assumes implicitly that the as yet unknown microscopic black hole constituents have strong effective interactions between them of a type found in critical phenomena in this picture the details of the microscopic interaction forces are not important and the essential macroscopic picture emerges from general assumptions about the number of independent thermodynamic variables types of critical points boundary conditions and analyticity i use the simple kerr and reissnernordstrom black holes for guidance and find candidate equations of state that embody a number of the features of these purely gravitational models my approach may offer a productive new way to select black hole thermodynamic equations of state representing both gravitational and quantum properties
|
[['black', 'holes', 'pose', 'great', 'difficulties', 'for', 'theory', 'since', 'gravity', 'and', 'quantum', 'theory', 'must', 'be', 'combined', 'in', 'some', 'as', 'yet', 'unknown', 'way', 'an', 'additional', 'difficulty', 'is', 'that', 'detailed', 'black', 'hole', 'observational', 'data', 'to', 'guide', 'theorists', 'is', 'lacking', 'in', 'this', 'paper', 'i', 'sidestep', 'the', 'difficulties', 'of', 'combining', 'gravity', 'and', 'quantum', 'theory', 'by', 'employing', 'black', 'hole', 'thermodynamics', 'augmented', 'by', 'ideas', 'from', 'the', 'information', 'geometry', 'of', 'thermodynamics', 'i', 'propose', 'a', 'purely', 'thermodynamic', 'agenda', 'for', 'choosing', 'correct', 'candidate', 'black', 'hole', 'thermodynamic', 'scaled', 'equations', 'of', 'state', 'parameterized', 'by', 'two', 'exponents', 'these', 'two', 'adjustable', 'exponents', 'may', 'be', 'set', 'to', 'accommodate', 'additional', 'black', 'hole', 'information', 'either', 'from', 'astrophysical', 'observations', 'or', 'from', 'some', 'microscopic', 'theory', 'such', 'as', 'string', 'theory', 'my', 'approach', 'assumes', 'implicitly', 'that', 'the', 'as', 'yet', 'unknown', 'microscopic', 'black', 'hole', 'constituents', 'have', 'strong', 'effective', 'interactions', 'between', 'them', 'of', 'a', 'type', 'found', 'in', 'critical', 'phenomena', 'in', 'this', 'picture', 'the', 'details', 'of', 'the', 'microscopic', 'interaction', 'forces', 'are', 'not', 'important', 'and', 'the', 'essential', 'macroscopic', 'picture', 'emerges', 'from', 'general', 'assumptions', 'about', 'the', 'number', 'of', 'independent', 'thermodynamic', 'variables', 'types', 'of', 'critical', 'points', 'boundary', 'conditions', 'and', 'analyticity', 'i', 'use', 'the', 'simple', 'kerr', 'and', 'reissnernordstrom', 'black', 'holes', 'for', 'guidance', 'and', 'find', 'candidate', 'equations', 'of', 'state', 'that', 'embody', 'a', 'number', 'of', 'the', 'features', 'of', 'these', 'purely', 'gravitational', 'models', 'my', 'approach', 'may', 'offer', 'a', 'productive', 'new', 'way', 'to', 'select', 'black', 'hole', 'thermodynamic', 'equations', 'of', 'state', 'representing', 'both', 'gravitational', 'and', 'quantum', 'properties']]
|
[-0.11625556689146574, 0.10840859063585283, -0.11313653982324468, 0.13346451484747895, -0.13500537934409554, -0.19603474012520955, 0.06035059172323339, 0.2798803294811348, -0.2286180566713613, -0.3437705975291984, 0.06456025991012991, -0.3087176044251204, -0.1462406900505552, 0.17486657439959735, -0.059104385318018364, 0.061703925387908906, -0.00046146326557001364, 0.019977245167995403, -0.06908256806465422, -0.19146444792880044, 0.36698206167576636, 0.0576281375049023, 0.22356461118891144, 0.005911567417829896, 0.09158911796995588, -0.005343059429183735, 0.0071483930285986775, 0.07432447680704561, -0.16433228032315128, 0.09504869832536704, 0.2628822342594016, 0.14925610331475322, 0.2591378833645389, -0.4796056773588394, -0.27306120631120784, 0.021614751023922248, 0.13795031163109733, 0.17678990917712717, -0.09092890347528737, -0.2716635902636751, 0.03224028693096313, -0.20001908372588723, -0.17387728483299725, -0.10718008661725824, 0.042005591491553265, -0.02689743471080825, -0.1906063237204632, 0.09716700654553279, 0.07635314664262946, -0.0052466234083112795, -0.10754477297138822, -0.07512330642982436, -0.019350374534302058, 0.1251681967998073, 0.09400040122376854, 0.012280442242107321, 0.16285073058731672, -0.14622868281107262, -0.12782796112462944, 0.3589712585817324, 0.015433365447928995, -0.20031292325750524, 0.19144432356136218, -0.15107095749902197, -0.15139749231041474, 0.0849825109284471, 0.12098377997712564, 0.14297030774676905, -0.2075153429884397, 0.1056843524573716, 0.019225264947765806, 0.16510048928362916, 0.04915879566449023, 0.09976491537989725, 0.3840041704700395, 0.10691596472003896, -0.018656851853717984, 0.0882779298494175, -0.007094286802254958, -0.13392495607383484, -0.3419839318874957, -0.10836707557583784, -0.17246699157528514, 0.11937230472390833, -0.14643142162984596, -0.16691149392577895, 0.3030506601977062, 0.1736559482492989, 0.1598693910351098, -0.029359642283712413, 0.2511490916384836, 0.06687880287225718, 0.00026548330684558356, 0.056781282382352014, 0.2960096476248769, 0.12339117105148034, 0.10037230884647995, -0.19789107462773764, 0.029234756031135994, 0.103270504637164]
|
1,803.08991
|
Leveraging translations for speech transcription in low-resource
settings
|
Recently proposed data collection frameworks for endangered language
documentation aim not only to collect speech in the language of interest, but
also to collect translations into a high-resource language that will render the
collected resource interpretable. We focus on this scenario and explore whether
we can improve transcription quality under these extremely low-resource
settings with the assistance of text translations. We present a neural
multi-source model and evaluate several variations of it on three low-resource
datasets. We find that our multi-source model with shared attention outperforms
the baselines, reducing transcription character error rate by up to 12.3%.
|
cs.CL
|
recently proposed data collection frameworks for endangered language documentation aim not only to collect speech in the language of interest but also to collect translations into a highresource language that will render the collected resource interpretable we focus on this scenario and explore whether we can improve transcription quality under these extremely lowresource settings with the assistance of text translations we present a neural multisource model and evaluate several variations of it on three lowresource datasets we find that our multisource model with shared attention outperforms the baselines reducing transcription character error rate by up to 123
|
[['recently', 'proposed', 'data', 'collection', 'frameworks', 'for', 'endangered', 'language', 'documentation', 'aim', 'not', 'only', 'to', 'collect', 'speech', 'in', 'the', 'language', 'of', 'interest', 'but', 'also', 'to', 'collect', 'translations', 'into', 'a', 'highresource', 'language', 'that', 'will', 'render', 'the', 'collected', 'resource', 'interpretable', 'we', 'focus', 'on', 'this', 'scenario', 'and', 'explore', 'whether', 'we', 'can', 'improve', 'transcription', 'quality', 'under', 'these', 'extremely', 'lowresource', 'settings', 'with', 'the', 'assistance', 'of', 'text', 'translations', 'we', 'present', 'a', 'neural', 'multisource', 'model', 'and', 'evaluate', 'several', 'variations', 'of', 'it', 'on', 'three', 'lowresource', 'datasets', 'we', 'find', 'that', 'our', 'multisource', 'model', 'with', 'shared', 'attention', 'outperforms', 'the', 'baselines', 'reducing', 'transcription', 'character', 'error', 'rate', 'by', 'up', 'to', '123']]
|
[-0.06978027840125729, 0.02052353756003005, -0.0005985767455752363, 0.10241806217032418, -0.14481713798991644, -0.18723338656127453, 0.08656344861848299, 0.4560740225247501, -0.23965414961051082, -0.32227204673618715, 0.06761134915970765, -0.28326530574062436, -0.13609161533261696, 0.2538693872491647, -0.15467400944398083, 0.0444514762571792, 0.1664598010595619, 0.058420525402906015, -0.011802745234106005, -0.32722168133507684, 0.2780265420598468, 0.030382204330382273, 0.3657802577831389, 0.053538825902391764, 0.09940806190248042, -0.06843476533678543, -0.04232970613280561, -0.06735335395085751, -0.057998488809146494, 0.18785347113597026, 0.34498801248474525, 0.261805371256526, 0.27940145313509346, -0.38832926750183105, -0.22460479729031166, 0.0903980514567499, 0.13329453391896695, 0.11465164742413932, -0.05574129931100635, -0.3538761804283587, 0.0856046769671987, -0.22220916671620816, 0.06608969113818303, -0.1550493214048983, 0.0010082481006525226, -0.022867537247612306, -0.27152486218585986, 0.01838411903218846, 0.1025297967044963, 0.09702058028929013, -0.031249056159777893, -0.08609351792766415, 0.036398823572245914, 0.17178072769329258, 0.08380932045245985, 0.05259307114810673, 0.11245826595299638, -0.14549137729142983, -0.1409763368422684, 0.40766079698391644, -0.07985955630381082, -0.2732168008746176, 0.24750525343049432, -0.06053480102690225, -0.2149849092088563, 0.04255869313498441, 0.25952651777986396, 0.06285902839538056, -0.20782055504159214, 0.029716529166950008, -0.028059592960191143, 0.2615743756399864, 0.09977947093892037, 0.007687562914594009, 0.1538544329094518, 0.2324997074518007, -0.022154980838375606, 0.1761919183358934, -0.09358953143537198, -0.04172546743924163, -0.2095002265954294, -0.09720104189647227, -0.12503924209278883, -0.027517898092088384, -0.03319752571795894, -0.10826619472546675, 0.38703622363661366, 0.274269320469196, 0.16652759391161584, 0.11062227989566158, 0.29346953347786187, -0.04294036100642545, 0.11605762873689845, 0.09333221828949052, 0.1242537175163569, -0.05393442597729874, 0.12867104377328736, -0.17947115249134907, 0.0892843484696116, 0.00430987698995729]
|
1,803.08992
|
Clogging and Depinning of Ballistic Active Matter Systems in Disordered
Media
|
We numerically examine ballistic active disks driven through a random
obstacle array. Formation of a pinned or clogged state occurs at much lower
obstacle densities for the active disks than for passive disks. As a function
of obstacle density we identify several distinct phases including a depinned
fluctuating cluster state, a pinned single cluster or jammed state, a pinned
multicluster state, a pinned gel state, and a pinned disordered state. At lower
active disk densities, a drifting uniform liquid forms in the absence of
obstacles, but when even a small number of obstacles are introduced, the disks
organize into a pinned phase-separated cluster state in which clusters nucleate
around the obstacles, similar to a wetting phenomenon. We examine how the
depinning threshold changes as a function of disk or obstacle density, and find
a crossover from a collectively pinned cluster state to a disordered plastic
depinning transition as a function of increasing obstacle density. We compare
this to the behavior of nonballistic active particles and show that as we vary
the activity from completely passive to completely ballistic, a clogged
phase-separated state appears in both the active and passive limits, while for
intermediate activity, a readily flowing liquid state appears and there is an
optimal activity level that maximizes the flux through the sample.
|
cond-mat.soft cond-mat.stat-mech
|
we numerically examine ballistic active disks driven through a random obstacle array formation of a pinned or clogged state occurs at much lower obstacle densities for the active disks than for passive disks as a function of obstacle density we identify several distinct phases including a depinned fluctuating cluster state a pinned single cluster or jammed state a pinned multicluster state a pinned gel state and a pinned disordered state at lower active disk densities a drifting uniform liquid forms in the absence of obstacles but when even a small number of obstacles are introduced the disks organize into a pinned phaseseparated cluster state in which clusters nucleate around the obstacles similar to a wetting phenomenon we examine how the depinning threshold changes as a function of disk or obstacle density and find a crossover from a collectively pinned cluster state to a disordered plastic depinning transition as a function of increasing obstacle density we compare this to the behavior of nonballistic active particles and show that as we vary the activity from completely passive to completely ballistic a clogged phaseseparated state appears in both the active and passive limits while for intermediate activity a readily flowing liquid state appears and there is an optimal activity level that maximizes the flux through the sample
|
[['we', 'numerically', 'examine', 'ballistic', 'active', 'disks', 'driven', 'through', 'a', 'random', 'obstacle', 'array', 'formation', 'of', 'a', 'pinned', 'or', 'clogged', 'state', 'occurs', 'at', 'much', 'lower', 'obstacle', 'densities', 'for', 'the', 'active', 'disks', 'than', 'for', 'passive', 'disks', 'as', 'a', 'function', 'of', 'obstacle', 'density', 'we', 'identify', 'several', 'distinct', 'phases', 'including', 'a', 'depinned', 'fluctuating', 'cluster', 'state', 'a', 'pinned', 'single', 'cluster', 'or', 'jammed', 'state', 'a', 'pinned', 'multicluster', 'state', 'a', 'pinned', 'gel', 'state', 'and', 'a', 'pinned', 'disordered', 'state', 'at', 'lower', 'active', 'disk', 'densities', 'a', 'drifting', 'uniform', 'liquid', 'forms', 'in', 'the', 'absence', 'of', 'obstacles', 'but', 'when', 'even', 'a', 'small', 'number', 'of', 'obstacles', 'are', 'introduced', 'the', 'disks', 'organize', 'into', 'a', 'pinned', 'phaseseparated', 'cluster', 'state', 'in', 'which', 'clusters', 'nucleate', 'around', 'the', 'obstacles', 'similar', 'to', 'a', 'wetting', 'phenomenon', 'we', 'examine', 'how', 'the', 'depinning', 'threshold', 'changes', 'as', 'a', 'function', 'of', 'disk', 'or', 'obstacle', 'density', 'and', 'find', 'a', 'crossover', 'from', 'a', 'collectively', 'pinned', 'cluster', 'state', 'to', 'a', 'disordered', 'plastic', 'depinning', 'transition', 'as', 'a', 'function', 'of', 'increasing', 'obstacle', 'density', 'we', 'compare', 'this', 'to', 'the', 'behavior', 'of', 'nonballistic', 'active', 'particles', 'and', 'show', 'that', 'as', 'we', 'vary', 'the', 'activity', 'from', 'completely', 'passive', 'to', 'completely', 'ballistic', 'a', 'clogged', 'phaseseparated', 'state', 'appears', 'in', 'both', 'the', 'active', 'and', 'passive', 'limits', 'while', 'for', 'intermediate', 'activity', 'a', 'readily', 'flowing', 'liquid', 'state', 'appears', 'and', 'there', 'is', 'an', 'optimal', 'activity', 'level', 'that', 'maximizes', 'the', 'flux', 'through', 'the', 'sample']]
|
[-0.15479831370442373, 0.2614213697896932, -0.08787501615550473, 0.03776995724972303, -0.020224193238357308, -0.13043521491540858, 0.10735516949169442, 0.3679142502423759, -0.2567209264037208, -0.2637812207576984, 0.09205625809252559, -0.2896814672537496, -0.10677738613710155, 0.09835576364731363, 0.022724977827187035, 0.02986532123759389, -0.008764287871395665, 0.0017582501859238773, -0.04063118099361206, -0.1545495227238742, 0.27696453395874077, -0.03629903510366849, 0.2766056408818428, 0.0008039033262355027, 0.09078052308993571, -0.03546347370954387, 0.08926350680815283, 0.07900211258321374, -0.16343995166767583, 0.01335430677404772, 0.2609966338947241, -0.03826710675129336, 0.2641384948097239, -0.4715906195123242, -0.2328858471238359, 0.0847232530500618, 0.20179134138498594, 0.1368630678533298, -0.08159195159934025, -0.2917492481385941, 0.05183741274489977, -0.17111530423460303, -0.19212933986721925, 0.02273625013716062, 0.04838738689268721, 0.02585945476692988, -0.22253771775149714, 0.13640447467359906, 0.07710617483363957, 0.02421251581122263, -0.11355867103138224, -0.061511257849960095, -0.049520773029773035, 0.1261128628063157, -0.012003884141857815, 0.06621903198769546, 0.27033577000757103, -0.21192006638304062, -0.06146226996647316, 0.32363246398690704, -0.02179435938663365, -0.14848419502136792, 0.2550758246863348, -0.16433090906679712, -0.0744531369946514, 0.21990936713850248, 0.17656240767525144, 0.1007006726522547, -0.09180809902257088, -0.025366247574217776, -0.03866439347457854, 0.1926848129608677, 0.045430649222074966, -0.014492355671136806, 0.2836906549250968, 0.21031493847976465, 0.1362394353518454, 0.22551834421389014, -0.1355463704426129, -0.1357144323160228, -0.2576687554393625, -0.136700866438196, -0.21294656876805368, 0.04556286430571698, -0.05163142657326045, -0.21031523999653617, 0.32720728217249856, 0.06603089785018379, 0.2492964124202589, 0.027666433410235967, 0.24726292541190475, 0.05544339340815547, 0.020000563486191992, 0.1132376907789366, 0.23886123888638464, 0.13309877160523156, 0.09417305088266904, -0.21696169712149896, 0.09251540541585217, -0.007890124000156316]
|
1,803.08993
|
Deep Learning Phase Segregation
|
Phase segregation, the process by which the components of a binary mixture
spontaneously separate, is a key process in the evolution and design of many
chemical, mechanical, and biological systems. In this work, we present a
data-driven approach for the learning, modeling, and prediction of phase
segregation. A direct mapping between an initially dispersed, immiscible binary
fluid and the equilibrium concentration field is learned by conditional
generative convolutional neural networks. Concentration field predictions by
the deep learning model conserve phase fraction, correctly predict phase
transition, and reproduce area, perimeter, and total free energy distributions
up to 98% accuracy.
|
cs.LG physics.comp-ph stat.ML
|
phase segregation the process by which the components of a binary mixture spontaneously separate is a key process in the evolution and design of many chemical mechanical and biological systems in this work we present a datadriven approach for the learning modeling and prediction of phase segregation a direct mapping between an initially dispersed immiscible binary fluid and the equilibrium concentration field is learned by conditional generative convolutional neural networks concentration field predictions by the deep learning model conserve phase fraction correctly predict phase transition and reproduce area perimeter and total free energy distributions up to 98 accuracy
|
[['phase', 'segregation', 'the', 'process', 'by', 'which', 'the', 'components', 'of', 'a', 'binary', 'mixture', 'spontaneously', 'separate', 'is', 'a', 'key', 'process', 'in', 'the', 'evolution', 'and', 'design', 'of', 'many', 'chemical', 'mechanical', 'and', 'biological', 'systems', 'in', 'this', 'work', 'we', 'present', 'a', 'datadriven', 'approach', 'for', 'the', 'learning', 'modeling', 'and', 'prediction', 'of', 'phase', 'segregation', 'a', 'direct', 'mapping', 'between', 'an', 'initially', 'dispersed', 'immiscible', 'binary', 'fluid', 'and', 'the', 'equilibrium', 'concentration', 'field', 'is', 'learned', 'by', 'conditional', 'generative', 'convolutional', 'neural', 'networks', 'concentration', 'field', 'predictions', 'by', 'the', 'deep', 'learning', 'model', 'conserve', 'phase', 'fraction', 'correctly', 'predict', 'phase', 'transition', 'and', 'reproduce', 'area', 'perimeter', 'and', 'total', 'free', 'energy', 'distributions', 'up', 'to', '98', 'accuracy']]
|
[-0.05896017365442703, 0.15647169946332354, -0.08587257717308418, 0.03232324779840995, -0.015601108530156163, -0.13175343092036795, 0.06360158746900531, 0.3883871794583238, -0.2803976059444629, -0.3523445151252102, 0.032723511980219305, -0.25406133664809927, -0.17460245557335188, 0.07022848888300359, -0.04065413856213646, 0.09674309225448845, 0.06471437013860108, -0.022165548569541806, -0.036939464438212465, -0.198891767386195, 0.3117024202317912, 0.045081097972092254, 0.3379479745231873, -0.01275109374249468, 0.1228689438691933, -0.00603235116447037, 0.022266451972631777, -0.009034376648463766, -0.1320289736993763, 0.10717781992838243, 0.25806938509494826, 0.1067096501379749, 0.2744351648012822, -0.4157207908146844, -0.3022274176343059, 0.12157692827464898, 0.12969450987115197, 0.09694832839827262, -0.08034131924944873, -0.27220914359156956, 0.006602273600613128, -0.19505493335273802, -0.059508007604210655, -0.09817502604873508, 0.021188792290299067, 0.023835542934889695, -0.25900676585163696, 0.1123085425624966, 0.09075575821785903, 0.06047992416828567, -0.09305005453108829, -0.08173675661816318, -0.04150423901725789, 0.14415948480671767, -0.01083540613941221, 0.06883811977530392, 0.19266346486627448, -0.17676261732145687, -0.06425102637624558, 0.34209733065550346, -0.06529291522480091, -0.1650685646799298, 0.19353424277802816, -0.08344307807464228, -0.12080586634158176, 0.18638236039289635, 0.23798808400348134, 0.09461398324834144, -0.20703260248469912, -0.009010006292314477, 0.017230648927542627, 0.2118949900637856, 0.012916313367895782, -0.07185588430458702, 0.2637048908081666, 0.24878946022719753, -0.0050427465526920465, 0.14113560412079096, -0.11533531987545442, -0.15691644902702193, -0.2223163476185303, -0.16960779003494855, -0.19841970955211746, -0.007908592090884946, -0.12559983715158413, -0.1524301658584071, 0.3702785829842395, 0.1443430984330991, 0.22636522390708633, 0.07649592814696192, 0.29662858972763073, 0.06374572057452775, 0.048107933390847575, 0.06341496244671621, 0.2340884246644849, 0.151123391941893, 0.13194312553791024, -0.21363990642700573, 0.11723167147981572, 0.03918538714416933]
|
1,803.08994
|
Hard scale uncertainty in collinear factorization: Perspective from
$k_t$-factorization
|
We analyze two consequences of the relationship between collinear
factorization and $k_t$-factorization. First, we show that the
$k_t$-factorization gives a fundamental justification for the choice of the
hard scale $Q^2$ done in the collinear factorization. Second, we show that in
the collinear factorization there is an uncertainty on this choice which will
not be reduced by higher orders. This uncertainty is absent within the
$k_t$-factorization formalism.
|
hep-ph
|
we analyze two consequences of the relationship between collinear factorization and k_tfactorization first we show that the k_tfactorization gives a fundamental justification for the choice of the hard scale q2 done in the collinear factorization second we show that in the collinear factorization there is an uncertainty on this choice which will not be reduced by higher orders this uncertainty is absent within the k_tfactorization formalism
|
[['we', 'analyze', 'two', 'consequences', 'of', 'the', 'relationship', 'between', 'collinear', 'factorization', 'and', 'k_tfactorization', 'first', 'we', 'show', 'that', 'the', 'k_tfactorization', 'gives', 'a', 'fundamental', 'justification', 'for', 'the', 'choice', 'of', 'the', 'hard', 'scale', 'q2', 'done', 'in', 'the', 'collinear', 'factorization', 'second', 'we', 'show', 'that', 'in', 'the', 'collinear', 'factorization', 'there', 'is', 'an', 'uncertainty', 'on', 'this', 'choice', 'which', 'will', 'not', 'be', 'reduced', 'by', 'higher', 'orders', 'this', 'uncertainty', 'is', 'absent', 'within', 'the', 'k_tfactorization', 'formalism']]
|
[-0.10879568153089195, 0.12431121335887865, -0.14624698752198706, 0.1555922462068724, -0.046927709075989144, -0.007532080039240871, 0.010055539409883997, 0.42235453600402584, -0.24960664202543822, -0.1918996242862759, 0.01741085158110681, -0.21501779199267426, -0.08309626158072868, 0.12006754907214957, -0.02467240567079209, 0.03089720830603531, 0.03732169698923826, 0.000641686926511201, -0.12704539452115018, -0.21417962398140156, 0.3779062752922376, -0.011011221220321728, 0.2721331660268885, 0.12928166881090764, 0.09083879938010465, 0.11329555273705134, -0.018915915579506844, 0.008510409529800669, -0.1170480483236712, 0.13110030279494822, 0.29443707877318515, 0.07813182569842672, 0.22559520443830866, -0.3706858974853248, -0.11318773035468026, 0.04156066820194775, 0.13840952691988964, 0.08736398461041972, 0.018401308639581795, -0.192139497873458, 0.10160140194012925, -0.23424533174627207, -0.12005962810309773, -0.14550000653517517, -0.02216634667958274, -0.09581312223930251, -0.26276981201954186, 0.0498342676878427, 0.08663656333969398, -0.0040150139001057005, 0.026220764915430635, -0.16710948063568634, 0.056734844985784905, 0.0761075009464879, 0.10790391307973275, 0.05313182317397811, 0.05756165207166112, -0.14336741448267165, -0.18764786155555735, 0.41044002229517157, -0.027444159061732618, -0.19283323342714345, 0.11295269333729238, -0.20873497260706217, -0.22950548354084743, 0.11874001171919658, 0.11093245457970735, 0.13672440108723205, -0.18235444741775142, 0.11383963995666074, -0.05361875677022688, 0.21904429680470264, 0.09387714647560973, -0.016441266546308092, 0.11073431973063359, 0.18759693415609724, 0.00878263461036664, 0.11476170520516903, -0.05262265773137298, -0.15711022183567172, -0.42157580322501337, -0.11800003487041977, -0.16688908585770565, 0.03965892516112724, -0.14517966666321488, -0.11325084511190653, 0.3442483517283108, 0.2027358413448162, 0.23225466726404248, 0.025423628438588683, 0.34700200997405883, 0.18393682231279937, 0.06908465896479109, 0.0705212710943835, 0.3115794494409453, 0.11357040351934054, 0.046660893325073026, -0.21209964495210443, 0.06225752175051832, 0.08924360683357174]
|
1,803.08995
|
Iterative Low-Rank Approximation for CNN Compression
|
Deep convolutional neural networks contain tens of millions of parameters,
making them impossible to work efficiently on embedded devices. We propose
iterative approach of applying low-rank approximation to compress deep
convolutional neural networks. Since classification and object detection are
the most favored tasks for embedded devices, we demonstrate the effectiveness
of our approach by compressing AlexNet, VGG-16, YOLOv2 and Tiny YOLO networks.
Our results show the superiority of the proposed method compared to
non-repetitive ones. We demonstrate higher compression ratio providing less
accuracy loss.
|
cs.CV
|
deep convolutional neural networks contain tens of millions of parameters making them impossible to work efficiently on embedded devices we propose iterative approach of applying lowrank approximation to compress deep convolutional neural networks since classification and object detection are the most favored tasks for embedded devices we demonstrate the effectiveness of our approach by compressing alexnet vgg16 yolov2 and tiny yolo networks our results show the superiority of the proposed method compared to nonrepetitive ones we demonstrate higher compression ratio providing less accuracy loss
|
[['deep', 'convolutional', 'neural', 'networks', 'contain', 'tens', 'of', 'millions', 'of', 'parameters', 'making', 'them', 'impossible', 'to', 'work', 'efficiently', 'on', 'embedded', 'devices', 'we', 'propose', 'iterative', 'approach', 'of', 'applying', 'lowrank', 'approximation', 'to', 'compress', 'deep', 'convolutional', 'neural', 'networks', 'since', 'classification', 'and', 'object', 'detection', 'are', 'the', 'most', 'favored', 'tasks', 'for', 'embedded', 'devices', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approach', 'by', 'compressing', 'alexnet', 'vgg16', 'yolov2', 'and', 'tiny', 'yolo', 'networks', 'our', 'results', 'show', 'the', 'superiority', 'of', 'the', 'proposed', 'method', 'compared', 'to', 'nonrepetitive', 'ones', 'we', 'demonstrate', 'higher', 'compression', 'ratio', 'providing', 'less', 'accuracy', 'loss']]
|
[-0.08098474048477199, -0.055707214649633637, 0.007346538848997582, 0.03793350141634056, -0.09117031671727698, -0.1955964100502786, 0.02437500938374017, 0.5097348715755201, -0.2504340755223807, -0.36474052248966127, 0.050349008497072474, -0.27448072633706033, -0.26213136044264373, 0.22562981808247665, -0.11315057524812541, 0.12658984420981834, 0.19966011884666623, -0.017408420295742827, -0.0805725720433873, -0.3789795349529457, 0.2354633212311282, 0.04650752343323326, 0.3659804061365624, 0.028614611608818882, 0.13583295495897932, -0.07916322678820939, -0.008663895639723964, -0.03860670956228638, 0.015647313779308683, 0.2292809713676217, 0.26095860364979934, 0.18537384203989946, 0.31141023923798156, -0.46983428498996155, -0.2855679107985149, 0.09233803021544147, 0.17067265441264248, 0.10980214704094189, -0.022618644656003675, -0.34819414073024835, 0.17926420944942428, -0.22150356736078503, 0.04129765555297213, -0.2231182723272858, -0.057469288929409924, -0.02495709919769849, -0.24736764188855886, 0.045296686729194506, 0.06441528385593778, -0.025756372773598525, -0.03509395745606439, -0.14640641807844595, 0.0584950954930502, 0.10862612735391372, -0.029266064077438342, 0.053265279826952054, 0.18571764430574453, -0.20927846695606908, -0.1367297548235261, 0.3347733693552159, -0.0628884272439228, -0.16688014498157872, 0.19532019042387783, 0.01945275291689627, -0.12576221408034188, 0.13297902420163155, 0.262888545148252, 0.18305651683892524, -0.09734742035202328, -0.046197287734165524, -0.009319787379354239, 0.19997768492681817, 0.09772699866776488, 0.013282893014894355, 0.13909411397651725, 0.33852761432838935, -0.007246019651315042, 0.17575733765815607, -0.1918523776614512, -0.0511562889774463, -0.13821629955921144, -0.05533878280160328, -0.2208630940197812, -0.005649121555810173, -0.14912075049297918, -0.10643180678016506, 0.3852957839567569, 0.28879748811180306, 0.22456444283514948, 0.18052766517558622, 0.39751964590201777, -0.015554253541354444, 0.19804541048194682, 0.15153176754912628, 0.22817462638375305, 0.06905683683553002, 0.09569918375079094, -0.13565436216248644, 0.05782469313791288, 0.08083938899549789]
|
1,803.08996
|
Pattern Analysis with Layered Self-Organizing Maps
|
This paper defines a new learning architecture, Layered Self-Organizing Maps
(LSOMs), that uses the SOM and supervised-SOM learning algorithms. The
architecture is validated with the MNIST database of hand-written digit images.
LSOMs are similar to convolutional neural nets (covnets) in the way they sample
data, but different in the way they represent features and learn. LSOMs analyze
(or generate) image patches with maps of exemplars determined by the SOM
learning algorithm rather than feature maps from filter-banks learned via
backprop.
LSOMs provide an alternative to features derived from covnets. Multi-layer
LSOMs are trained bottom-up, without the use of backprop and therefore may be
of interest as a model of the visual cortex. The results show organization at
multiple levels. The algorithm appears to be resource efficient in learning,
classifying and generating images. Although LSOMs can be used for
classification, their validation accuracy for these exploratory runs was well
below the state of the art. The goal of this article is to define the
architecture and display the structures resulting from its application to the
MNIST images.
|
cs.CV cs.LG stat.ML
|
this paper defines a new learning architecture layered selforganizing maps lsoms that uses the som and supervisedsom learning algorithms the architecture is validated with the mnist database of handwritten digit images lsoms are similar to convolutional neural nets covnets in the way they sample data but different in the way they represent features and learn lsoms analyze or generate image patches with maps of exemplars determined by the som learning algorithm rather than feature maps from filterbanks learned via backprop lsoms provide an alternative to features derived from covnets multilayer lsoms are trained bottomup without the use of backprop and therefore may be of interest as a model of the visual cortex the results show organization at multiple levels the algorithm appears to be resource efficient in learning classifying and generating images although lsoms can be used for classification their validation accuracy for these exploratory runs was well below the state of the art the goal of this article is to define the architecture and display the structures resulting from its application to the mnist images
|
[['this', 'paper', 'defines', 'a', 'new', 'learning', 'architecture', 'layered', 'selforganizing', 'maps', 'lsoms', 'that', 'uses', 'the', 'som', 'and', 'supervisedsom', 'learning', 'algorithms', 'the', 'architecture', 'is', 'validated', 'with', 'the', 'mnist', 'database', 'of', 'handwritten', 'digit', 'images', 'lsoms', 'are', 'similar', 'to', 'convolutional', 'neural', 'nets', 'covnets', 'in', 'the', 'way', 'they', 'sample', 'data', 'but', 'different', 'in', 'the', 'way', 'they', 'represent', 'features', 'and', 'learn', 'lsoms', 'analyze', 'or', 'generate', 'image', 'patches', 'with', 'maps', 'of', 'exemplars', 'determined', 'by', 'the', 'som', 'learning', 'algorithm', 'rather', 'than', 'feature', 'maps', 'from', 'filterbanks', 'learned', 'via', 'backprop', 'lsoms', 'provide', 'an', 'alternative', 'to', 'features', 'derived', 'from', 'covnets', 'multilayer', 'lsoms', 'are', 'trained', 'bottomup', 'without', 'the', 'use', 'of', 'backprop', 'and', 'therefore', 'may', 'be', 'of', 'interest', 'as', 'a', 'model', 'of', 'the', 'visual', 'cortex', 'the', 'results', 'show', 'organization', 'at', 'multiple', 'levels', 'the', 'algorithm', 'appears', 'to', 'be', 'resource', 'efficient', 'in', 'learning', 'classifying', 'and', 'generating', 'images', 'although', 'lsoms', 'can', 'be', 'used', 'for', 'classification', 'their', 'validation', 'accuracy', 'for', 'these', 'exploratory', 'runs', 'was', 'well', 'below', 'the', 'state', 'of', 'the', 'art', 'the', 'goal', 'of', 'this', 'article', 'is', 'to', 'define', 'the', 'architecture', 'and', 'display', 'the', 'structures', 'resulting', 'from', 'its', 'application', 'to', 'the', 'mnist', 'images']]
|
[-0.012556646252050996, 0.001008915613392621, -0.10375841472915648, 0.06575504722708912, -0.08802524449659048, -0.1594876898210388, 0.007657448271951622, 0.4516311565661706, -0.30138704428924357, -0.3452988001585244, 0.07755203504247235, -0.258980376907016, -0.218650911941403, 0.1992264030248228, -0.1137394295081616, 0.06256045967392958, 0.09950198885726318, 0.05273822963529137, -0.053984901418295726, -0.2775346771470739, 0.2972367247310871, 0.057677603057569506, 0.3361684142092426, -0.06250354685050817, 0.12252902155917009, -0.08131425806881074, -0.03603369833610823, -0.024897527164978787, -0.0398699745626779, 0.19822301617466892, 0.32317003308434705, 0.20767660995654633, 0.25122468347655813, -0.40662818572683646, -0.17992303877896657, 0.08260483680039946, 0.14330946833818525, 0.13098865765486065, -0.02638818735708994, -0.36428969320666177, 0.11093224800660173, -0.1207731851198942, 0.0016908047591589089, -0.16240661023051756, -0.046218123040000524, -0.000964280245139269, -0.27941924470444507, 0.015793992494800898, 0.0905035389903556, 0.09334310561397, -0.07699403442601227, -0.11697668724044326, -0.027062356914797355, 0.1790374167992954, -0.026292118216283362, 0.0833843685901923, 0.15333579069627934, -0.18284244679898357, -0.14800465989331688, 0.3678289770681648, -0.047655899205929435, -0.18067675817006193, 0.1982582853716728, -0.002500595629882778, -0.13217194838653926, 0.11255345707072882, 0.2269497057530663, 0.09596195701924233, -0.16821968938746204, 0.004092782815565716, -0.048018363244546246, 0.1739782290371684, 0.05127624479947461, -0.014907860600879426, 0.19826206310202685, 0.24007913441467232, -0.009164084147425056, 0.18516669913283898, -0.14695738759860827, -0.044482428286456085, -0.1857552073301742, -0.10808176261970417, -0.19973986271252006, -0.027722012907040516, -0.09496576828850807, -0.14638948656937897, 0.40960306989169015, 0.2004896308735519, 0.25674905553675453, 0.12802003315418442, 0.3069356547202915, 0.0350092506686204, 0.1568729170595398, 0.09086605802049182, 0.1608701895524053, 0.02571948981881572, 0.11551257541855377, -0.11738304394792572, 0.08931492904545685, 0.07225280797537659]
|
1,803.08997
|
Towards a Microscopic Theory of the Knight Shift in an Anisotropic,
Multiband Type-II Superconductor
|
A method is proposed to extend the zero-temperature Hall-Klemm microscopic
theory of the Knight shift $K$ in an anisotropic and correlated, multi-band
metal to calculate $K(T)$ at finite temperatures $T$ both above and into its
superconducting state. The transverse part of the magnetic induction ${\bf
B}(t)={\bf B}_0+{\bf B}_1(t)$ causes adiabatic changes suitable for treatment
with the Keldysh contour formalism and analytic continuation onto the real
axis. We propose that the Keldysh-modified version of the Gor'kov method can be
used to evaluate $K(T)$ at high ${\bf B}_0$ both in the normal state, and by
quantizing the conduction electrons or holes with Landau orbits arising from
${\bf B}_0$, also in the entire superconducting regime for an anisotropic,
multiband Type-II BCS superconductor. Although the details have not yet been
calculated in detail, it appears that this approach could lead to the simple
result $K_S(T)\approx a({\bf B}_0)-b({\bf B}_0)|\Delta({\bf B}_0,T)|^2$, where
$2|\Delta({\bf B}_0,T)|$ is the effective superconducting gap. More generally,
this approach can lead to analytic expressions for $K_S(T)$ for anisotropic,
multiband Type-II superconductors of various orbital symmetries that could aid
in the interpretation of experimental data on unconventional superconductors.
|
cond-mat.supr-con cond-mat.str-el
|
a method is proposed to extend the zerotemperature hallklemm microscopic theory of the knight shift k in an anisotropic and correlated multiband metal to calculate kt at finite temperatures t both above and into its superconducting state the transverse part of the magnetic induction bf btbf b_0bf b_1t causes adiabatic changes suitable for treatment with the keldysh contour formalism and analytic continuation onto the real axis we propose that the keldyshmodified version of the gorkov method can be used to evaluate kt at high bf b_0 both in the normal state and by quantizing the conduction electrons or holes with landau orbits arising from bf b_0 also in the entire superconducting regime for an anisotropic multiband typeii bcs superconductor although the details have not yet been calculated in detail it appears that this approach could lead to the simple result k_stapprox abf b_0bbf b_0deltabf b_0t2 where 2deltabf b_0t is the effective superconducting gap more generally this approach can lead to analytic expressions for k_st for anisotropic multiband typeii superconductors of various orbital symmetries that could aid in the interpretation of experimental data on unconventional superconductors
|
[['a', 'method', 'is', 'proposed', 'to', 'extend', 'the', 'zerotemperature', 'hallklemm', 'microscopic', 'theory', 'of', 'the', 'knight', 'shift', 'k', 'in', 'an', 'anisotropic', 'and', 'correlated', 'multiband', 'metal', 'to', 'calculate', 'kt', 'at', 'finite', 'temperatures', 't', 'both', 'above', 'and', 'into', 'its', 'superconducting', 'state', 'the', 'transverse', 'part', 'of', 'the', 'magnetic', 'induction', 'bf', 'btbf', 'b_0bf', 'b_1t', 'causes', 'adiabatic', 'changes', 'suitable', 'for', 'treatment', 'with', 'the', 'keldysh', 'contour', 'formalism', 'and', 'analytic', 'continuation', 'onto', 'the', 'real', 'axis', 'we', 'propose', 'that', 'the', 'keldyshmodified', 'version', 'of', 'the', 'gorkov', 'method', 'can', 'be', 'used', 'to', 'evaluate', 'kt', 'at', 'high', 'bf', 'b_0', 'both', 'in', 'the', 'normal', 'state', 'and', 'by', 'quantizing', 'the', 'conduction', 'electrons', 'or', 'holes', 'with', 'landau', 'orbits', 'arising', 'from', 'bf', 'b_0', 'also', 'in', 'the', 'entire', 'superconducting', 'regime', 'for', 'an', 'anisotropic', 'multiband', 'typeii', 'bcs', 'superconductor', 'although', 'the', 'details', 'have', 'not', 'yet', 'been', 'calculated', 'in', 'detail', 'it', 'appears', 'that', 'this', 'approach', 'could', 'lead', 'to', 'the', 'simple', 'result', 'k_stapprox', 'abf', 'b_0bbf', 'b_0deltabf', 'b_0t2', 'where', '2deltabf', 'b_0t', 'is', 'the', 'effective', 'superconducting', 'gap', 'more', 'generally', 'this', 'approach', 'can', 'lead', 'to', 'analytic', 'expressions', 'for', 'k_st', 'for', 'anisotropic', 'multiband', 'typeii', 'superconductors', 'of', 'various', 'orbital', 'symmetries', 'that', 'could', 'aid', 'in', 'the', 'interpretation', 'of', 'experimental', 'data', 'on', 'unconventional', 'superconductors']]
|
[-0.1309189750247502, 0.1699927643841199, -0.07904522668437235, 0.06737925604983631, -0.09884734703760062, -0.13737797440927743, 0.07054513956220554, 0.37423727712460925, -0.22386693060398102, -0.26144976951181886, 0.011192166430742613, -0.2602676670466151, -0.1105164650973997, 0.21178299783462926, -0.009878159621730448, -0.0017004150004400539, -0.03587445268806602, 0.013381626051518002, -0.1508943184398647, -0.2096503354702145, 0.2997482442110777, 0.008411276175507477, 0.31501205189286596, 0.05975332314348114, 0.01969669853004494, 0.011277417583124979, 0.07741499299183488, 0.029947523775377443, -0.13725170020417343, 0.05888832948806729, 0.28400626623736963, -0.02970888089521655, 0.18572700500642117, -0.4221531840467027, -0.21884676135278175, 0.041842664437634604, 0.1661897192536188, 0.13282465579121241, -0.010017357524900164, -0.2785492685071326, 0.07559966523732457, -0.16197479458259684, -0.13865147012639292, -0.1216511787298701, 0.004144824317523411, -0.05363295269750129, -0.2625230026976871, 0.10626139099875997, 0.06903216346832258, 0.038853919096291066, -0.08874372900796255, -0.12922001674239125, -0.013785916196315416, 0.015926676838259612, 0.035494605479096726, 0.09580567378949906, 0.10369743073275978, -0.10977532328784166, -0.07088663373142481, 0.34814741644476144, -0.05984848656824657, -0.14207503976566452, 0.1494107857373144, -0.15213295489017453, -0.07382049318403006, 0.15298897466223155, 0.12634712580857532, 0.08900532833300531, -0.1575373249607427, 0.12971379622284857, -0.01854638958083732, 0.11259343097651643, 0.004507279497172151, 0.029524818970156567, 0.23922164022390333, 0.12265320393256843, -0.000924847215147955, 0.11837777171882667, -0.12632495338962013, -0.06972759217289942, -0.2961670001915523, -0.13876699600088094, -0.20744303799234332, 0.06982614979821457, -0.0572848872348134, -0.19301154313376173, 0.3941372639792306, 0.17429141585315977, 0.18820753396089587, -0.03997167414320367, 0.254095164692865, 0.15172982567123006, 0.04695946716570428, 0.08072054010948965, 0.2293296052675162, 0.16491707022168806, 0.1073904762982524, -0.29694624268715936, 0.023688455846692835, 0.05055501783000571]
|
1,803.08998
|
Exact solution of Ginzburg's $\Psi$-theory for the Casimir force in
$^4$He superfluid films
|
We present an analytical solution of the Ginzburg's $\Psi$-theory for the
behavior of the Casimir force in a film of $^4$He in equilibrium with its vapor
near the superfluid transition point, and we revisit the corresponding
experiments in light of our findings. We find reasonably good agreement between
the $\Psi$-theory predictions and the experimental data. Our calculated force
is attractive, and the largest absolute value of the scaling function is
$1.848$, while experiment yields $1.30$. The position of the extremum is
predicted to be at $x=(L/\xi_0)(T/T_\lambda-1)^{1/\nu}=\pi$, while experiment
is consistent with $x=3.8$. Here $L$ is the thickness of the film, $T_\lambda$
is the bulk critical temperature and $\xi_0$ is the correlation length
amplitude of the system for $T>T_\lambda$.
|
cond-mat.stat-mech
|
we present an analytical solution of the ginzburgs psitheory for the behavior of the casimir force in a film of 4he in equilibrium with its vapor near the superfluid transition point and we revisit the corresponding experiments in light of our findings we find reasonably good agreement between the psitheory predictions and the experimental data our calculated force is attractive and the largest absolute value of the scaling function is 1848 while experiment yields 130 the position of the extremum is predicted to be at xlxi_0tt_lambda11nupi while experiment is consistent with x38 here l is the thickness of the film t_lambda is the bulk critical temperature and xi_0 is the correlation length amplitude of the system for tt_lambda
|
[['we', 'present', 'an', 'analytical', 'solution', 'of', 'the', 'ginzburgs', 'psitheory', 'for', 'the', 'behavior', 'of', 'the', 'casimir', 'force', 'in', 'a', 'film', 'of', '4he', 'in', 'equilibrium', 'with', 'its', 'vapor', 'near', 'the', 'superfluid', 'transition', 'point', 'and', 'we', 'revisit', 'the', 'corresponding', 'experiments', 'in', 'light', 'of', 'our', 'findings', 'we', 'find', 'reasonably', 'good', 'agreement', 'between', 'the', 'psitheory', 'predictions', 'and', 'the', 'experimental', 'data', 'our', 'calculated', 'force', 'is', 'attractive', 'and', 'the', 'largest', 'absolute', 'value', 'of', 'the', 'scaling', 'function', 'is', '1848', 'while', 'experiment', 'yields', '130', 'the', 'position', 'of', 'the', 'extremum', 'is', 'predicted', 'to', 'be', 'at', 'xlxi_0tt_lambda11nupi', 'while', 'experiment', 'is', 'consistent', 'with', 'x38', 'here', 'l', 'is', 'the', 'thickness', 'of', 'the', 'film', 't_lambda', 'is', 'the', 'bulk', 'critical', 'temperature', 'and', 'xi_0', 'is', 'the', 'correlation', 'length', 'amplitude', 'of', 'the', 'system', 'for', 'tt_lambda']]
|
[-0.13019614877473368, 0.13976260606547217, -0.12174828470227096, 0.017296649436997415, -0.000604858323768304, -0.09233545972720573, 0.06852788776935388, 0.34974360387576253, -0.2106787630360933, -0.2966793263821225, 0.06470683018632005, -0.36794428831260456, -0.09201771154664784, 0.20818522140351042, 0.022068477247988705, 0.07750174316504599, 0.012004524444867121, 0.0644253928095854, -0.08007076600762575, -0.15646783113806395, 0.30244870461817636, 0.08565541243245989, 0.30143097286284165, 0.10741869601617127, 0.060851706417579726, -0.05049322160949375, 0.036069175775832775, 0.03148294252899002, -0.18796875260018728, 0.06098255515915521, 0.2074491159833167, 0.004164405771645538, 0.17711110337915129, -0.37521207072004154, -0.1427733933332523, 0.07362444489875711, 0.09776887799645856, 0.11216880453815847, -0.03788602580683992, -0.23418433261675792, 0.07083590359329, -0.09702629706487387, -0.18308692536594576, -0.028366369534316555, 0.06674356914631892, 0.011659269731209957, -0.2853416851558314, 0.12188986688443836, 0.006308357586692038, 0.07338005952177602, -0.10607473082583103, -0.13835650530803068, -0.014221005664582839, 0.1148907851730065, 0.05827490460707627, 0.09804377010655835, 0.14641067599305851, -0.14267677028679795, -0.032316501929910785, 0.3733581107175141, -0.09760787549404133, -0.09668677690716689, 0.14512405241431112, -0.18105326619166717, -0.010464266073285487, 0.12906783629870533, 0.07134685115561935, 0.07478822856884156, -0.11133450815829922, 0.06325147949820875, -0.057925531117801084, 0.20074943867190373, 0.023662212604999934, -0.017861131354597125, 0.20731146537224976, 0.2404305110797858, 0.028439800451068503, 0.12879507547027938, -0.12615134995308167, -0.09384089466511157, -0.33172422260242074, -0.17283086616774662, -0.20568367847029054, 0.003209422959276197, -0.1160975499114373, -0.1333140540998756, 0.3627485077370677, 0.16528408349978763, 0.23146738585803592, 0.06692859987123755, 0.26381111900697934, 0.13693409854456326, 0.044190559106298904, 0.03804623552500025, 0.3416758480485888, 0.12184112188671797, 0.10505334696356665, -0.3030169735082605, 0.07166777940246423, 0.01839355431627809]
|
1,803.08999
|
LayoutNet: Reconstructing the 3D Room Layout from a Single RGB Image
|
We propose an algorithm to predict room layout from a single image that
generalizes across panoramas and perspective images, cuboid layouts and more
general layouts (e.g. L-shape room). Our method operates directly on the
panoramic image, rather than decomposing into perspective images as do recent
works. Our network architecture is similar to that of RoomNet, but we show
improvements due to aligning the image based on vanishing points, predicting
multiple layout elements (corners, boundaries, size and translation), and
fitting a constrained Manhattan layout to the resulting predictions. Our method
compares well in speed and accuracy to other existing work on panoramas,
achieves among the best accuracy for perspective images, and can handle both
cuboid-shaped and more general Manhattan layouts.
|
cs.CV cs.AI
|
we propose an algorithm to predict room layout from a single image that generalizes across panoramas and perspective images cuboid layouts and more general layouts eg lshape room our method operates directly on the panoramic image rather than decomposing into perspective images as do recent works our network architecture is similar to that of roomnet but we show improvements due to aligning the image based on vanishing points predicting multiple layout elements corners boundaries size and translation and fitting a constrained manhattan layout to the resulting predictions our method compares well in speed and accuracy to other existing work on panoramas achieves among the best accuracy for perspective images and can handle both cuboidshaped and more general manhattan layouts
|
[['we', 'propose', 'an', 'algorithm', 'to', 'predict', 'room', 'layout', 'from', 'a', 'single', 'image', 'that', 'generalizes', 'across', 'panoramas', 'and', 'perspective', 'images', 'cuboid', 'layouts', 'and', 'more', 'general', 'layouts', 'eg', 'lshape', 'room', 'our', 'method', 'operates', 'directly', 'on', 'the', 'panoramic', 'image', 'rather', 'than', 'decomposing', 'into', 'perspective', 'images', 'as', 'do', 'recent', 'works', 'our', 'network', 'architecture', 'is', 'similar', 'to', 'that', 'of', 'roomnet', 'but', 'we', 'show', 'improvements', 'due', 'to', 'aligning', 'the', 'image', 'based', 'on', 'vanishing', 'points', 'predicting', 'multiple', 'layout', 'elements', 'corners', 'boundaries', 'size', 'and', 'translation', 'and', 'fitting', 'a', 'constrained', 'manhattan', 'layout', 'to', 'the', 'resulting', 'predictions', 'our', 'method', 'compares', 'well', 'in', 'speed', 'and', 'accuracy', 'to', 'other', 'existing', 'work', 'on', 'panoramas', 'achieves', 'among', 'the', 'best', 'accuracy', 'for', 'perspective', 'images', 'and', 'can', 'handle', 'both', 'cuboidshaped', 'and', 'more', 'general', 'manhattan', 'layouts']]
|
[-0.02327626511775458, -0.025450755841785477, -0.05890575821801018, 0.027753464647709634, -0.12669896411106868, -0.17379379371854187, 0.03812461837093119, 0.4787433038489157, -0.22672674804143295, -0.375930833082427, 0.07615411129658807, -0.29166460704027103, -0.17360540521096343, 0.23248330613367355, -0.17424253602864362, 0.053730814034870567, 0.12183012657587518, -0.002045783496015713, -0.1110791630902085, -0.24843698086905755, 0.25067277140563216, 0.05208325405612964, 0.3762808343348633, 0.03460336364257861, 0.1221440268148269, 0.004235664961718712, -0.02887722575144858, 0.06852413657876592, -0.04920262508468503, 0.1714213905257306, 0.24670475655618837, 0.1517553967815049, 0.1791708962052685, -0.4286680910110223, -0.20228270071895182, 0.02935137486421824, 0.11675630026424065, 0.11594883856625773, -0.03540095681067314, -0.317751109187233, 0.09286470766797536, -0.08240044069233812, -0.02950693278753457, -0.10470625903739147, -0.03624713108698767, -0.03656620193104565, -0.2797365289283212, 0.009085898072372716, 0.07138708569676842, 0.04123731214013107, -0.06052128621181395, -0.1591305162184363, 0.025502968325177913, 0.17138434134564606, -0.02611859597680511, 0.08445703631517391, 0.13956473507143619, -0.14429734490749216, -0.12863573518742127, 0.4345327931918016, -0.019193221085744974, -0.1985094826414148, 0.21645374597879832, -0.08770464788466896, -0.09834156615440459, 0.11374517480114929, 0.2177943450813534, 0.11686646101894561, -0.12624459097772336, -0.012600166976995798, -0.07080797070809522, 0.1851855976812291, 0.11922213235603911, -0.01573588161549762, 0.1693883914766567, 0.2248943864520514, 0.08316127873151054, 0.14756162118160815, -0.13762393440589496, -0.0788562458180705, -0.186038302854897, -0.09040049528076995, -0.19140583317836418, -0.03304740257498597, -0.10711496582701352, -0.14837207059188112, 0.4171909359948976, 0.22813792635702348, 0.25335480847998576, 0.12770295932183645, 0.39579940534063746, -0.02122163974108691, 0.1330933357009805, 0.0909171305291605, 0.1295929933905977, -0.023720238052559, 0.10005191514882877, -0.12911682639529287, 0.05698440591667724, 0.06334642147911447]
|
1,803.09
|
WikiRank: Improving Keyphrase Extraction Based on Background Knowledge
|
Keyphrase is an efficient representation of the main idea of documents. While
background knowledge can provide valuable information about documents, they are
rarely incorporated in keyphrase extraction methods. In this paper, we propose
WikiRank, an unsupervised method for keyphrase extraction based on the
background knowledge from Wikipedia. Firstly, we construct a semantic graph for
the document. Then we transform the keyphrase extraction problem into an
optimization problem on the graph. Finally, we get the optimal keyphrase set to
be the output. Our method obtains improvements over other state-of-art models
by more than 2% in F1-score.
|
cs.CL cs.IR
|
keyphrase is an efficient representation of the main idea of documents while background knowledge can provide valuable information about documents they are rarely incorporated in keyphrase extraction methods in this paper we propose wikirank an unsupervised method for keyphrase extraction based on the background knowledge from wikipedia firstly we construct a semantic graph for the document then we transform the keyphrase extraction problem into an optimization problem on the graph finally we get the optimal keyphrase set to be the output our method obtains improvements over other stateofart models by more than 2 in f1score
|
[['keyphrase', 'is', 'an', 'efficient', 'representation', 'of', 'the', 'main', 'idea', 'of', 'documents', 'while', 'background', 'knowledge', 'can', 'provide', 'valuable', 'information', 'about', 'documents', 'they', 'are', 'rarely', 'incorporated', 'in', 'keyphrase', 'extraction', 'methods', 'in', 'this', 'paper', 'we', 'propose', 'wikirank', 'an', 'unsupervised', 'method', 'for', 'keyphrase', 'extraction', 'based', 'on', 'the', 'background', 'knowledge', 'from', 'wikipedia', 'firstly', 'we', 'construct', 'a', 'semantic', 'graph', 'for', 'the', 'document', 'then', 'we', 'transform', 'the', 'keyphrase', 'extraction', 'problem', 'into', 'an', 'optimization', 'problem', 'on', 'the', 'graph', 'finally', 'we', 'get', 'the', 'optimal', 'keyphrase', 'set', 'to', 'be', 'the', 'output', 'our', 'method', 'obtains', 'improvements', 'over', 'other', 'stateofart', 'models', 'by', 'more', 'than', '2', 'in', 'f1score']]
|
[0.0101875658085114, -0.0470405223271921, -0.0878428444972242, 0.08683802677873284, -0.16932181643441002, -0.09228270676759805, 0.04059501534372449, 0.4580964219379932, -0.28265820564504, -0.3279017281837444, 0.0628709337399143, -0.3261200395670343, -0.1384635339912146, 0.22348879846407377, -0.12522690553228033, 0.029263016465615403, 0.14015187962139222, 0.11674919560770851, -0.05337917965841777, -0.28508308802624827, 0.35449120288397723, 0.046766931389240506, 0.34590564230258797, 0.05257955942540727, 0.12721441639711129, -0.00032670983172794607, -0.11599089881960065, -0.05720596746640637, -0.08771069610907518, 0.22736236725270034, 0.3491683560341892, 0.27169185897652454, 0.30148564547577755, -0.3703562652176999, -0.19610141730926772, 0.07496842952256903, 0.20503540129519682, 0.17518910097622095, -0.042748267094368124, -0.3338734317531294, 0.1261770081176284, -0.17428069576086042, 0.07349057129504992, -0.14962161248648895, -0.03898779158183235, -0.07095393583121551, -0.27575805073881404, 0.022239221051890166, 0.13290752896523855, 0.02615928247650253, -0.061227554158168905, -0.17515661152069795, 0.08699698110626257, 0.15252737424514712, 0.00898920341166965, 0.09404302384838105, 0.10420833076251314, -0.16324028177335462, -0.17182368589466082, 0.3677251066695503, -0.07908059272093407, -0.2545670734104165, 0.10295210387607283, 0.036705645935689195, -0.16146333623637862, 0.10285423483583145, 0.2276764152214882, 0.14547669384232226, -0.21585322575187904, 0.00281663535242068, -0.052968431006562205, 0.2485800960616387, 0.04669969663162656, -0.00025978425834724246, 0.19588165597041493, 0.2755989005709899, 0.0702520120651164, 0.16481005237871246, -0.07335577431807364, -0.011117125756077548, -0.23094647371784804, -0.131610154466545, -0.1762838846250893, -0.02879907292848889, -0.13766693891561094, -0.1476034360660359, 0.43694879974615064, 0.2783948127130799, 0.17219933859032996, 0.044798458879318166, 0.35951612858062093, 0.05045817610625044, 0.03381637453121391, 0.12269411691801345, 0.13638124038326613, 0.002982692319919613, 0.11294799796033135, -0.11437459861453464, 0.07131046529591797, 0.14079829456997997]
|
1,803.09001
|
Accelerating Learning in Constructive Predictive Frameworks with the
Successor Representation
|
Here we propose using the successor representation (SR) to accelerate
learning in a constructive knowledge system based on general value functions
(GVFs). In real-world settings like robotics for unstructured and dynamic
environments, it is infeasible to model all meaningful aspects of a system and
its environment by hand due to both complexity and size. Instead, robots must
be capable of learning and adapting to changes in their environment and task,
incrementally constructing models from their own experience. GVFs, taken from
the field of reinforcement learning (RL), are a way of modeling the world as
predictive questions. One approach to such models proposes a massive network of
interconnected and interdependent GVFs, which are incrementally added over
time. It is reasonable to expect that new, incrementally added predictions can
be learned more swiftly if the learning process leverages knowledge gained from
past experience. The SR provides such a means of separating the dynamics of the
world from the prediction targets and thus capturing regularities that can be
reused across multiple GVFs. As a primary contribution of this work, we show
that using SR-based predictions can improve sample efficiency and learning
speed in a continual learning setting where new predictions are incrementally
added and learned over time. We analyze our approach in a grid-world and then
demonstrate its potential on data from a physical robot arm.
|
cs.LG cs.AI stat.ML
|
here we propose using the successor representation sr to accelerate learning in a constructive knowledge system based on general value functions gvfs in realworld settings like robotics for unstructured and dynamic environments it is infeasible to model all meaningful aspects of a system and its environment by hand due to both complexity and size instead robots must be capable of learning and adapting to changes in their environment and task incrementally constructing models from their own experience gvfs taken from the field of reinforcement learning rl are a way of modeling the world as predictive questions one approach to such models proposes a massive network of interconnected and interdependent gvfs which are incrementally added over time it is reasonable to expect that new incrementally added predictions can be learned more swiftly if the learning process leverages knowledge gained from past experience the sr provides such a means of separating the dynamics of the world from the prediction targets and thus capturing regularities that can be reused across multiple gvfs as a primary contribution of this work we show that using srbased predictions can improve sample efficiency and learning speed in a continual learning setting where new predictions are incrementally added and learned over time we analyze our approach in a gridworld and then demonstrate its potential on data from a physical robot arm
|
[['here', 'we', 'propose', 'using', 'the', 'successor', 'representation', 'sr', 'to', 'accelerate', 'learning', 'in', 'a', 'constructive', 'knowledge', 'system', 'based', 'on', 'general', 'value', 'functions', 'gvfs', 'in', 'realworld', 'settings', 'like', 'robotics', 'for', 'unstructured', 'and', 'dynamic', 'environments', 'it', 'is', 'infeasible', 'to', 'model', 'all', 'meaningful', 'aspects', 'of', 'a', 'system', 'and', 'its', 'environment', 'by', 'hand', 'due', 'to', 'both', 'complexity', 'and', 'size', 'instead', 'robots', 'must', 'be', 'capable', 'of', 'learning', 'and', 'adapting', 'to', 'changes', 'in', 'their', 'environment', 'and', 'task', 'incrementally', 'constructing', 'models', 'from', 'their', 'own', 'experience', 'gvfs', 'taken', 'from', 'the', 'field', 'of', 'reinforcement', 'learning', 'rl', 'are', 'a', 'way', 'of', 'modeling', 'the', 'world', 'as', 'predictive', 'questions', 'one', 'approach', 'to', 'such', 'models', 'proposes', 'a', 'massive', 'network', 'of', 'interconnected', 'and', 'interdependent', 'gvfs', 'which', 'are', 'incrementally', 'added', 'over', 'time', 'it', 'is', 'reasonable', 'to', 'expect', 'that', 'new', 'incrementally', 'added', 'predictions', 'can', 'be', 'learned', 'more', 'swiftly', 'if', 'the', 'learning', 'process', 'leverages', 'knowledge', 'gained', 'from', 'past', 'experience', 'the', 'sr', 'provides', 'such', 'a', 'means', 'of', 'separating', 'the', 'dynamics', 'of', 'the', 'world', 'from', 'the', 'prediction', 'targets', 'and', 'thus', 'capturing', 'regularities', 'that', 'can', 'be', 'reused', 'across', 'multiple', 'gvfs', 'as', 'a', 'primary', 'contribution', 'of', 'this', 'work', 'we', 'show', 'that', 'using', 'srbased', 'predictions', 'can', 'improve', 'sample', 'efficiency', 'and', 'learning', 'speed', 'in', 'a', 'continual', 'learning', 'setting', 'where', 'new', 'predictions', 'are', 'incrementally', 'added', 'and', 'learned', 'over', 'time', 'we', 'analyze', 'our', 'approach', 'in', 'a', 'gridworld', 'and', 'then', 'demonstrate', 'its', 'potential', 'on', 'data', 'from', 'a', 'physical', 'robot', 'arm']]
|
[-0.02958648737988251, 0.054938773165202195, -0.10692761492113595, 0.038744647967129085, -0.1225535821946413, -0.14752506707991253, 0.06679470297533835, 0.42246733762891836, -0.3013273075143619, -0.348050085812047, 0.0806676230073991, -0.24223907170149042, -0.18787433090306518, 0.21414348069106484, -0.11463756086054204, 0.04642618366260282, 0.09460718237331363, 0.05414531777942795, -0.03196835889577064, -0.24350008282668453, 0.31157720440919323, 0.03361955856864712, 0.25905421633490533, -0.00291627782893956, 0.12457111055676663, -0.011256215857934924, -0.020501459561885572, 0.03190248685256231, -0.03028298454040598, 0.1642089930053755, 0.3071704315027964, 0.2315252603996428, 0.33887719852858195, -0.4404015159232773, -0.2202388585123313, 0.09904760440535877, 0.14937588698000986, 0.11409945767780039, -0.03804810342073259, -0.3391708908028349, 0.08795692580397087, -0.18804872388462848, -0.05780942136037577, -0.1338297221013512, -0.020175039533822225, -0.0067504411401444284, -0.2896301969175849, -0.020904912669712786, 0.06047727968000845, 0.0348807230566716, -0.07524969518568884, -0.09290014528784266, 0.0019205269401667497, 0.18340977961239258, 0.03874456442017087, 0.04770845455021468, 0.17005501562445488, -0.15507303273739637, -0.12734036207316035, 0.37954032469975174, -0.0358341917486427, -0.18898508342342127, 0.22592868167602126, -0.05905319316387845, -0.12335304433956007, 0.0923785602834677, 0.2714256655525065, 0.11538821312122782, -0.1782678474876779, 0.05369815566982122, -0.007014260987538193, 0.17303242897948942, 0.010489581905058982, -0.0024666731637869145, 0.20338843444637922, 0.2390736466453248, 0.041104043000732705, 0.10983749090708508, -0.04388091697620182, -0.12299864440884925, -0.21680029555387803, -0.11076144945093602, -0.1765742401301134, 0.0007768115926650874, -0.10563594060978694, -0.10073426207986914, 0.378294570613736, 0.24775369691917246, 0.21816200006652975, 0.09423521480869164, 0.3386002340825951, 0.044290205151847076, 0.09565378275946317, 0.10608645034886087, 0.18481069171984968, 0.020190577146977255, 0.144765870579865, -0.14912249564376948, 0.12796224900020178, -0.005481932124315089]
|
1,803.09002
|
Socio-spatial Self-organizing Maps: Using Social Media to Assess
Relevant Geographies for Exposure to Social Processes
|
Social media offers a unique window into attitudes like racism and
homophobia, exposure to which are important, hard to measure and understudied
social determinants of health. However, individual geo-located observations
from social media are noisy and geographically inconsistent. Existing areas by
which exposures are measured, like Zip codes, average over irrelevant
administratively-defined boundaries. Hence, in order to enable studies of
online social environmental measures like attitudes on social media and their
possible relationship to health outcomes, first there is a need for a method to
define the collective, underlying degree of social media attitudes by region.
To address this, we create the Socio-spatial-Self organizing map, "SS-SOM"
pipeline to best identify regions by their latent social attitude from Twitter
posts. SS-SOMs use neural embedding for text-classification, and augment
traditional SOMs to generate a controlled number of non-overlapping,
topologically-constrained and topically-similar clusters. We find that not only
are SS-SOMs robust to missing data, the exposure of a cohort of men who are
susceptible to multiple racism and homophobia-linked health outcomes, changes
by up to 42% using SS-SOM measures as compared to using Zip code-based
measures.
|
cs.SI cs.CY
|
social media offers a unique window into attitudes like racism and homophobia exposure to which are important hard to measure and understudied social determinants of health however individual geolocated observations from social media are noisy and geographically inconsistent existing areas by which exposures are measured like zip codes average over irrelevant administrativelydefined boundaries hence in order to enable studies of online social environmental measures like attitudes on social media and their possible relationship to health outcomes first there is a need for a method to define the collective underlying degree of social media attitudes by region to address this we create the sociospatialself organizing map sssom pipeline to best identify regions by their latent social attitude from twitter posts sssoms use neural embedding for textclassification and augment traditional soms to generate a controlled number of nonoverlapping topologicallyconstrained and topicallysimilar clusters we find that not only are sssoms robust to missing data the exposure of a cohort of men who are susceptible to multiple racism and homophobialinked health outcomes changes by up to 42 using sssom measures as compared to using zip codebased measures
|
[['social', 'media', 'offers', 'a', 'unique', 'window', 'into', 'attitudes', 'like', 'racism', 'and', 'homophobia', 'exposure', 'to', 'which', 'are', 'important', 'hard', 'to', 'measure', 'and', 'understudied', 'social', 'determinants', 'of', 'health', 'however', 'individual', 'geolocated', 'observations', 'from', 'social', 'media', 'are', 'noisy', 'and', 'geographically', 'inconsistent', 'existing', 'areas', 'by', 'which', 'exposures', 'are', 'measured', 'like', 'zip', 'codes', 'average', 'over', 'irrelevant', 'administrativelydefined', 'boundaries', 'hence', 'in', 'order', 'to', 'enable', 'studies', 'of', 'online', 'social', 'environmental', 'measures', 'like', 'attitudes', 'on', 'social', 'media', 'and', 'their', 'possible', 'relationship', 'to', 'health', 'outcomes', 'first', 'there', 'is', 'a', 'need', 'for', 'a', 'method', 'to', 'define', 'the', 'collective', 'underlying', 'degree', 'of', 'social', 'media', 'attitudes', 'by', 'region', 'to', 'address', 'this', 'we', 'create', 'the', 'sociospatialself', 'organizing', 'map', 'sssom', 'pipeline', 'to', 'best', 'identify', 'regions', 'by', 'their', 'latent', 'social', 'attitude', 'from', 'twitter', 'posts', 'sssoms', 'use', 'neural', 'embedding', 'for', 'textclassification', 'and', 'augment', 'traditional', 'soms', 'to', 'generate', 'a', 'controlled', 'number', 'of', 'nonoverlapping', 'topologicallyconstrained', 'and', 'topicallysimilar', 'clusters', 'we', 'find', 'that', 'not', 'only', 'are', 'sssoms', 'robust', 'to', 'missing', 'data', 'the', 'exposure', 'of', 'a', 'cohort', 'of', 'men', 'who', 'are', 'susceptible', 'to', 'multiple', 'racism', 'and', 'homophobialinked', 'health', 'outcomes', 'changes', 'by', 'up', 'to', '42', 'using', 'sssom', 'measures', 'as', 'compared', 'to', 'using', 'zip', 'codebased', 'measures']]
|
[-0.049776269734815456, 0.08940710063849787, -0.060955397787417265, 0.11773150833323598, -0.15482695906309324, -0.14364851114805788, 0.11618518426629909, 0.45724839050062865, -0.2670116729947717, -0.3442067380366457, 0.09996249355804879, -0.3659734937557301, -0.18650403390855116, 0.1667116261087358, -0.11018432550782711, 0.02589222795849796, 0.05489192226208573, 0.036637374196542685, 0.04222736234044342, -0.2839902002989791, 0.3219197057268777, 0.050169157213531435, 0.318512232660121, 0.0005863970714123097, 0.08227067558720252, 0.014064594908335875, -0.12589943753271146, 0.05350457946769893, -0.08388007404764086, 0.1808543639206534, 0.3782465566412632, 0.21145203591833367, 0.3822099262534446, -0.41322104058358383, -0.20673922356759566, 0.10452854426220319, 0.11377836007429937, 0.08283803480146669, 0.003219308057491299, -0.36595124965750203, 0.06813881562638291, -0.17607386465677463, -0.05702555537471537, -0.11195859439849723, 0.01203567456172476, 0.03131428791844925, -0.2444842871641307, 0.0810891457665495, -0.03909923956691569, 0.12345144791301167, -0.047390130253746936, -0.0977993899236195, -0.007625654529303659, 0.2512847340644099, 0.09117483797206999, -0.001375947667923377, 0.18815226809035035, -0.1516675921938745, -0.13848767604213208, 0.3966799905891855, -0.002719213647989903, -0.1624288518877895, 0.21555245809763302, -0.0749392596474134, -0.11432887969652278, 0.09950286399594746, 0.2823404686005656, 0.03872658838084791, -0.20853314628055708, -0.06356530391907612, -0.025610149621443694, 0.19568203943023502, 0.09163249147308687, 0.020874566701782303, 0.17248731857432367, 0.12530248254188336, 0.08851356382568389, 0.08075909963253951, -0.04338957228410859, -0.07821582525401366, -0.15085155612465567, -0.12000036204428693, -0.10978759030898123, 0.04892159811754746, -0.10172405351316462, -0.16762948785042173, 0.35708668694268303, 0.18009246952918379, 0.16404227047703815, 0.03522585283255551, 0.2498017780166011, -0.052942181978683354, 0.10073643024309625, 0.05815968545814326, 0.14364719968343284, 0.02526393450720799, 0.14754850350707488, -0.13623379918660017, 0.1591821254493647, -0.04032892436276428]
|
1,803.09003
|
On the structure of matrices avoiding interval-minor patterns
|
We study the structure of 01-matrices avoiding a pattern P as an interval
minor. We focus on critical P-avoiders, i.e., on the P-avoiding matrices in
which changing a 0-entry to a 1-entry always creates a copy of P as an interval
minor.
Let Q be the 3x3 permutation matrix corresponding to the permutation 231. As
our main result, we show that for every pattern P that has no rotated copy of Q
as interval minor, there is a constant c(P) such that any row and any column in
any critical P-avoiding matrix can be partitioned into at most c(P) intervals,
each consisting entirely of 0-entries or entirely of 1-entries. In contrast,
for any pattern P that contains a rotated copy of Q, we construct critical
P-avoiding matrices of arbitrary size $n\times n$ having a row with $\Omega(n)$
alternating intervals of 0-entries and 1-entries.
|
math.CO cs.DM
|
we study the structure of 01matrices avoiding a pattern p as an interval minor we focus on critical pavoiders ie on the pavoiding matrices in which changing a 0entry to a 1entry always creates a copy of p as an interval minor let q be the 3x3 permutation matrix corresponding to the permutation 231 as our main result we show that for every pattern p that has no rotated copy of q as interval minor there is a constant cp such that any row and any column in any critical pavoiding matrix can be partitioned into at most cp intervals each consisting entirely of 0entries or entirely of 1entries in contrast for any pattern p that contains a rotated copy of q we construct critical pavoiding matrices of arbitrary size ntimes n having a row with omegan alternating intervals of 0entries and 1entries
|
[['we', 'study', 'the', 'structure', 'of', '01matrices', 'avoiding', 'a', 'pattern', 'p', 'as', 'an', 'interval', 'minor', 'we', 'focus', 'on', 'critical', 'pavoiders', 'ie', 'on', 'the', 'pavoiding', 'matrices', 'in', 'which', 'changing', 'a', '0entry', 'to', 'a', '1entry', 'always', 'creates', 'a', 'copy', 'of', 'p', 'as', 'an', 'interval', 'minor', 'let', 'q', 'be', 'the', '3x3', 'permutation', 'matrix', 'corresponding', 'to', 'the', 'permutation', '231', 'as', 'our', 'main', 'result', 'we', 'show', 'that', 'for', 'every', 'pattern', 'p', 'that', 'has', 'no', 'rotated', 'copy', 'of', 'q', 'as', 'interval', 'minor', 'there', 'is', 'a', 'constant', 'cp', 'such', 'that', 'any', 'row', 'and', 'any', 'column', 'in', 'any', 'critical', 'pavoiding', 'matrix', 'can', 'be', 'partitioned', 'into', 'at', 'most', 'cp', 'intervals', 'each', 'consisting', 'entirely', 'of', '0entries', 'or', 'entirely', 'of', '1entries', 'in', 'contrast', 'for', 'any', 'pattern', 'p', 'that', 'contains', 'a', 'rotated', 'copy', 'of', 'q', 'we', 'construct', 'critical', 'pavoiding', 'matrices', 'of', 'arbitrary', 'size', 'ntimes', 'n', 'having', 'a', 'row', 'with', 'omegan', 'alternating', 'intervals', 'of', '0entries', 'and', '1entries']]
|
[-0.19058311043690282, 0.1770654926132262, -0.029903478773495723, -0.02599241632013747, -0.00950079327052895, -0.16610561754779085, 0.08353549236735554, 0.36474519627208407, -0.2629511207284353, -0.2510889109012717, 0.11953758321626522, -0.28303180359541735, -0.1105148149059808, 0.10537547947581302, -0.06292415973614796, -0.0042382691159566985, 0.046611241689150006, 0.10429349781760404, -0.08727749470119359, -0.22584863446061731, 0.27915330171908737, -0.05376236858539917, 0.15856945417583623, -0.0010257711574593758, 0.08613935685287236, 0.07271476756081197, 0.009377713584347714, 0.0282076843700484, -0.07956508375437607, 0.03908813126873991, 0.24820271097718083, 0.1635765925261146, 0.22961546003600544, -0.36805136775468306, -0.10982969217002392, 0.22451281704087842, 0.16893718844768427, 0.053672480564531444, -0.042240649233869415, -0.1891109556176845, 0.16847083501597035, -0.1337724768206583, -0.09962448556346039, 0.002446300716714022, 0.10369334634102828, -0.024842189292998074, -0.33069733697929293, 0.007175106907771993, 0.11613450186155366, 0.06491874038829659, 0.03753050601156098, -0.20150880527464635, -0.012962497092109728, 0.10928945477014897, -0.011883148766644563, 0.09924933626993514, 0.08087798731082865, -0.04344634315249153, -0.11425384922045553, 0.39545451861588243, -0.04963233311667193, -0.2128997810303848, 0.09071525961081399, -0.1745890798674672, -0.1640303220817859, 0.12479802579718068, 0.13183370074554485, 0.07954087768886106, -0.04480427329912319, 0.12699439091168688, -0.14906928734853864, 0.23442877572135512, 0.14386382738643505, -0.030834978732861684, 0.1675224370448619, 0.06866232720897236, 0.139736290776719, 0.12794392483130573, -0.03293616826322379, -0.014411438081466348, -0.33043030128939777, -0.15117259668054203, -0.2031417396844279, 0.08782707910377083, -0.15594791260639582, -0.22627639033375901, 0.38303166923793497, 0.05703022440314187, 0.27193976978355267, 0.03629748995584297, 0.23063542880778407, 0.08721931149657974, 0.10345730388451183, 0.08387738047167659, 0.057507347850564945, 0.11813752176174035, -0.021635311694505315, -0.16597248846665025, 0.08818939998118432, 0.08561953917436355]
|
1,803.09004
|
Face Recognition with Hybrid Efficient Convolution Algorithms on FPGAs
|
Deep Convolutional Neural Networks have become a Swiss knife in solving
critical artificial intelligence tasks. However, deploying deep CNN models for
latency-critical tasks remains to be challenging because of the complex nature
of CNNs. Recently, FPGA has become a favorable device to accelerate deep CNNs
thanks to its high parallel processing capability and energy efficiency. In
this work, we explore different fast convolution algorithms including Winograd
and Fast Fourier Transform (FFT), and find an optimal strategy to apply them
together on different types of convolutions. We also propose an optimization
scheme to exploit parallelism on novel CNN architectures such as Inception
modules in GoogLeNet. We implement a configurable IP-based face recognition
acceleration system based on FaceNet using High-Level Synthesis. Our
implementation on a Xilinx Ultrascale device achieves 3.75x latency speedup
compared to a high-end NVIDIA GPU and surpasses previous FPGA results
significantly.
|
cs.CV cs.DC
|
deep convolutional neural networks have become a swiss knife in solving critical artificial intelligence tasks however deploying deep cnn models for latencycritical tasks remains to be challenging because of the complex nature of cnns recently fpga has become a favorable device to accelerate deep cnns thanks to its high parallel processing capability and energy efficiency in this work we explore different fast convolution algorithms including winograd and fast fourier transform fft and find an optimal strategy to apply them together on different types of convolutions we also propose an optimization scheme to exploit parallelism on novel cnn architectures such as inception modules in googlenet we implement a configurable ipbased face recognition acceleration system based on facenet using highlevel synthesis our implementation on a xilinx ultrascale device achieves 375x latency speedup compared to a highend nvidia gpu and surpasses previous fpga results significantly
|
[['deep', 'convolutional', 'neural', 'networks', 'have', 'become', 'a', 'swiss', 'knife', 'in', 'solving', 'critical', 'artificial', 'intelligence', 'tasks', 'however', 'deploying', 'deep', 'cnn', 'models', 'for', 'latencycritical', 'tasks', 'remains', 'to', 'be', 'challenging', 'because', 'of', 'the', 'complex', 'nature', 'of', 'cnns', 'recently', 'fpga', 'has', 'become', 'a', 'favorable', 'device', 'to', 'accelerate', 'deep', 'cnns', 'thanks', 'to', 'its', 'high', 'parallel', 'processing', 'capability', 'and', 'energy', 'efficiency', 'in', 'this', 'work', 'we', 'explore', 'different', 'fast', 'convolution', 'algorithms', 'including', 'winograd', 'and', 'fast', 'fourier', 'transform', 'fft', 'and', 'find', 'an', 'optimal', 'strategy', 'to', 'apply', 'them', 'together', 'on', 'different', 'types', 'of', 'convolutions', 'we', 'also', 'propose', 'an', 'optimization', 'scheme', 'to', 'exploit', 'parallelism', 'on', 'novel', 'cnn', 'architectures', 'such', 'as', 'inception', 'modules', 'in', 'googlenet', 'we', 'implement', 'a', 'configurable', 'ipbased', 'face', 'recognition', 'acceleration', 'system', 'based', 'on', 'facenet', 'using', 'highlevel', 'synthesis', 'our', 'implementation', 'on', 'a', 'xilinx', 'ultrascale', 'device', 'achieves', '375x', 'latency', 'speedup', 'compared', 'to', 'a', 'highend', 'nvidia', 'gpu', 'and', 'surpasses', 'previous', 'fpga', 'results', 'significantly']]
|
[-0.09104960489727504, -0.05829354359562747, -0.05466666639656991, 0.028464070352038753, -0.12620536876010133, -0.25444208127809753, -0.002882244534367788, 0.5207167756248344, -0.27192137395638594, -0.34281352026625833, 0.09178653540930229, -0.18887459433716822, -0.20895327353546173, 0.2853547795609644, -0.14690343862240937, 0.14084818877291316, 0.16609127514711614, -0.028418362893639727, -0.09001208337581987, -0.31259522099685294, 0.20425993512245885, 0.11366543338691043, 0.3921538454741372, 0.026743150293060864, 0.16205910545384103, -0.07420663224741261, 0.027010315631232257, -0.09738610589427622, 0.006699188599191237, 0.18764590305698944, 0.27471478387056736, 0.1843566634553544, 0.3206426669539659, -0.5065224396844282, -0.1875138301616997, 0.039297629580403684, 0.1760047743904424, 0.05424068060353504, -0.050136882298236304, -0.2991521105150435, 0.12341421303927158, -0.21476473099162394, 0.04140886963478864, -0.18820762578133785, -0.008634243650091085, 0.004813275756958397, -0.24094817312500366, -0.040960986988085604, 0.02196016531530107, 0.05911309550126605, -0.014748947312626062, -0.14882919188598764, 0.09643068699932374, 0.10626848819434431, -0.06271400030104589, 0.09000807084516352, 0.1784086160474054, -0.19528926544201872, -0.1796731236688, 0.3258419615474153, -0.023819831903389793, -0.18793247530157578, 0.23013291635933655, 0.050047600990266984, -0.20503559926564388, 0.08627372137138765, 0.29709368972982947, 0.08053064069228498, -0.13814544832294293, 0.0666548768702419, 0.03293681906285227, 0.20336865302479118, 0.07686718515325205, 0.02462224530944508, 0.1602116038945193, 0.33762191181857115, 0.039708918049693745, 0.16713512161621125, -0.1419706178273005, -0.07875223628555734, -0.09155346212433056, -0.15706092539302846, -0.1986553300411939, -0.01573709991730829, -0.09359880180406906, -0.1467546081923424, 0.40907498295773426, 0.2452413856137729, 0.1457994102222964, 0.13716766806253305, 0.40921282949229926, 0.04325286137494952, 0.22740830000859838, 0.16754992283114517, 0.16226305134003283, 0.029762188745464418, 0.1994537415304089, -0.1602748911951649, 0.009458811208936022, 0.049804640475434335]
|
1,803.09005
|
Quantitative characterization of the imaging limits of diffuse low-grade
oligodendrogliomas
|
Background : Supratentorial diffuse low-grade gliomas in adults extend beyond
maximal visible MRI-defined abnormalities, and a gap exists between the imaging
signal changes and the actual tumor margins. Direct quantitative comparisons
between imaging and histological analyses are lacking to date. However, they
are of the utmost importance if one wishes to develop realistic models for
diffuse glioma growth.
Methods : In this study, we quantitatively compare the cell concentration and
the edema fraction from human histological biopsy samples (BSs) performed
inside and outside imaging abnormalities during serial imaging-based
stereotactic biopsy of diffuse low-grade gliomas.
Results : The cell concentration was significantly higher in BSs located
inside (1189 $\pm$ 378 cell/mm$^2$) than outside (740 $\pm$ 124 cell/mm$^2$)
MRI-defined abnormalities (p=0.0003). The edema fraction was significantly
higher in BSs located inside (mean, 45 $\pm$ 23%) than outside (mean, 5 $\pm$
9%) MRI-defined abnormalities (p<0.0001). At borders of the MRI-defined
abnormalities, 20% of the tissue surface area was occupied by edema, and only
3% by tumor cells. The cycling cell concentration was significantly higher in
BSs located inside (10 $\pm$ 12 cell/mm$^2$) compared to outside (0.5 $\pm$ 0.9
cell/mm$^2$) MRI-defined abnormalities (p=0.0001).
Conclusions : We show that the margins of T2-weighted signal changes are
mainly correlated with the edema fraction. In 62.5% of patients, the cycling
tumor cell fraction (defined as the ratio of the cycling tumor cell
concentration to the total number of tumor cells) was higher at the limits of
the MRI-defined abnormalities than closer to the center of the tumor. In the
remaining patients, the cycling tumor cell fraction increased towards the
center of the tumor.
|
q-bio.TO
|
background supratentorial diffuse lowgrade gliomas in adults extend beyond maximal visible mridefined abnormalities and a gap exists between the imaging signal changes and the actual tumor margins direct quantitative comparisons between imaging and histological analyses are lacking to date however they are of the utmost importance if one wishes to develop realistic models for diffuse glioma growth methods in this study we quantitatively compare the cell concentration and the edema fraction from human histological biopsy samples bss performed inside and outside imaging abnormalities during serial imagingbased stereotactic biopsy of diffuse lowgrade gliomas results the cell concentration was significantly higher in bss located inside 1189 pm 378 cellmm2 than outside 740 pm 124 cellmm2 mridefined abnormalities p00003 the edema fraction was significantly higher in bss located inside mean 45 pm 23 than outside mean 5 pm 9 mridefined abnormalities p00001 at borders of the mridefined abnormalities 20 of the tissue surface area was occupied by edema and only 3 by tumor cells the cycling cell concentration was significantly higher in bss located inside 10 pm 12 cellmm2 compared to outside 05 pm 09 cellmm2 mridefined abnormalities p00001 conclusions we show that the margins of t2weighted signal changes are mainly correlated with the edema fraction in 625 of patients the cycling tumor cell fraction defined as the ratio of the cycling tumor cell concentration to the total number of tumor cells was higher at the limits of the mridefined abnormalities than closer to the center of the tumor in the remaining patients the cycling tumor cell fraction increased towards the center of the tumor
|
[['background', 'supratentorial', 'diffuse', 'lowgrade', 'gliomas', 'in', 'adults', 'extend', 'beyond', 'maximal', 'visible', 'mridefined', 'abnormalities', 'and', 'a', 'gap', 'exists', 'between', 'the', 'imaging', 'signal', 'changes', 'and', 'the', 'actual', 'tumor', 'margins', 'direct', 'quantitative', 'comparisons', 'between', 'imaging', 'and', 'histological', 'analyses', 'are', 'lacking', 'to', 'date', 'however', 'they', 'are', 'of', 'the', 'utmost', 'importance', 'if', 'one', 'wishes', 'to', 'develop', 'realistic', 'models', 'for', 'diffuse', 'glioma', 'growth', 'methods', 'in', 'this', 'study', 'we', 'quantitatively', 'compare', 'the', 'cell', 'concentration', 'and', 'the', 'edema', 'fraction', 'from', 'human', 'histological', 'biopsy', 'samples', 'bss', 'performed', 'inside', 'and', 'outside', 'imaging', 'abnormalities', 'during', 'serial', 'imagingbased', 'stereotactic', 'biopsy', 'of', 'diffuse', 'lowgrade', 'gliomas', 'results', 'the', 'cell', 'concentration', 'was', 'significantly', 'higher', 'in', 'bss', 'located', 'inside', '1189', 'pm', '378', 'cellmm2', 'than', 'outside', '740', 'pm', '124', 'cellmm2', 'mridefined', 'abnormalities', 'p00003', 'the', 'edema', 'fraction', 'was', 'significantly', 'higher', 'in', 'bss', 'located', 'inside', 'mean', '45', 'pm', '23', 'than', 'outside', 'mean', '5', 'pm', '9', 'mridefined', 'abnormalities', 'p00001', 'at', 'borders', 'of', 'the', 'mridefined', 'abnormalities', '20', 'of', 'the', 'tissue', 'surface', 'area', 'was', 'occupied', 'by', 'edema', 'and', 'only', '3', 'by', 'tumor', 'cells', 'the', 'cycling', 'cell', 'concentration', 'was', 'significantly', 'higher', 'in', 'bss', 'located', 'inside', '10', 'pm', '12', 'cellmm2', 'compared', 'to', 'outside', '05', 'pm', '09', 'cellmm2', 'mridefined', 'abnormalities', 'p00001', 'conclusions', 'we', 'show', 'that', 'the', 'margins', 'of', 't2weighted', 'signal', 'changes', 'are', 'mainly', 'correlated', 'with', 'the', 'edema', 'fraction', 'in', '625', 'of', 'patients', 'the', 'cycling', 'tumor', 'cell', 'fraction', 'defined', 'as', 'the', 'ratio', 'of', 'the', 'cycling', 'tumor', 'cell', 'concentration', 'to', 'the', 'total', 'number', 'of', 'tumor', 'cells', 'was', 'higher', 'at', 'the', 'limits', 'of', 'the', 'mridefined', 'abnormalities', 'than', 'closer', 'to', 'the', 'center', 'of', 'the', 'tumor', 'in', 'the', 'remaining', 'patients', 'the', 'cycling', 'tumor', 'cell', 'fraction', 'increased', 'towards', 'the', 'center', 'of', 'the', 'tumor']]
|
[-0.025243885575148922, 0.11958751726510505, 0.024862237985675724, 0.04220195719748377, 0.02734577310128281, -0.11092695755740771, 0.12730386986737496, 0.35022806354547636, -0.14709747561271516, -0.32314822918090685, 0.08708171044485286, -0.36362161334389104, -0.09876650918830329, 0.17227797053369265, -0.15467349488908438, -0.04357449532343218, 0.049509497960053314, 0.027515122866652045, 0.009505356637349065, -0.2182669602979261, 0.15556742748191868, 0.03836419271269383, 0.33326511907821094, 0.029326269826420826, 0.05682955362874334, -0.040626084566779005, -0.015544074057386472, -0.02954525898497265, -0.12401609293091706, 0.10838240330390712, 0.29582518673779795, 0.12387312431551087, 0.2805668105604127, -0.4215015935854843, -0.19047922853810284, 0.1187281398389202, 0.1915998339892562, 0.0015238087270587968, 0.007203100453345821, -0.28098912665960735, 0.15588515297903752, -0.11073064972252514, -0.11786683807059979, 0.11037830171766333, 0.016326242944342085, -0.01456650724755421, -0.23643002450072134, 0.23686763888869722, -0.05138257513037668, 0.15889846685951434, -0.1538527097329139, -0.17655957836765224, -0.0624136655143677, 0.18066199485284204, 0.001794296337175183, 0.0928800853242417, 0.2724167784443125, -0.15554532419370773, -0.029296586088961563, 0.3060547911418745, 0.02432975115510859, -0.12420344143174589, 0.1838156800573835, -0.2490616484437711, -0.06299839119713467, 0.24264360155911374, 0.15139026465969016, 0.07616266527105696, -0.16224710941852, -0.06068104978856774, 0.055196217647216356, 0.23122383577552122, 0.13776880194468855, -0.07984728526610595, 0.1675256769513698, 0.21061801080112882, -0.005724232448623158, 0.07618542359873223, -0.2557381451931388, -0.007820999348321213, -0.18696579288583823, -0.14827331877224004, -0.06849213848920324, 0.006858451169234916, -0.13127598313775918, -0.11589393555723991, 0.33037974220485644, 0.08361825372043173, 0.15279072328479604, 0.05497076072049542, 0.2564879547262815, -0.02604661950787816, 0.13215645555501396, 0.011290277909630766, 0.23219515482286135, 0.12388940456439741, 0.10544004588737152, -0.24533954499593863, 0.11134949371827622, -0.04457444810093596]
|
1,803.09006
|
Combinatorial Modeling and Test Case Generation for Industrial Control
Software using ACTS
|
Combinatorial testing has been suggested as an effective method of creating
test cases at a lower cost. However, industrially applicable tools for modeling
and combinatorial test generation are still scarce. As a direct effect,
combinatorial testing has only seen a limited uptake in industry that calls
into question its practical usefulness. This lack of evidence is especially
troublesome if we consider the use of combinatorial test generation for
industrial safety-critical control software, such as are found in trains,
airplanes, and power plants. To study the industrial application of
combinatorial testing, we evaluated ACTS, a popular tool for combinatorial
modeling and test generation, in terms of applicability and test efficiency on
industrial-sized IEC 61131-3 industrial control software running on
Programmable Logic Controllers (PLC). We assessed ACTS in terms of its direct
applicability in combinatorial modeling of IEC 61131-3 industrial software and
the efficiency of ACTS in terms of generation time and test suite size. We used
17 industrial control programs provided by Bombardier Transportation Sweden AB
and used in a train control management system. Our results show that not all
combinations of algorithms and interaction strengths could generate a test
suite within a realistic cut-off time. The results of the modeling process and
the efficiency evaluation of ACTS are useful for practitioners considering to
use combinatorial testing for industrial control software as well as for
researchers trying to improve the use of such combinatorial testing techniques.
|
cs.SE
|
combinatorial testing has been suggested as an effective method of creating test cases at a lower cost however industrially applicable tools for modeling and combinatorial test generation are still scarce as a direct effect combinatorial testing has only seen a limited uptake in industry that calls into question its practical usefulness this lack of evidence is especially troublesome if we consider the use of combinatorial test generation for industrial safetycritical control software such as are found in trains airplanes and power plants to study the industrial application of combinatorial testing we evaluated acts a popular tool for combinatorial modeling and test generation in terms of applicability and test efficiency on industrialsized iec 611313 industrial control software running on programmable logic controllers plc we assessed acts in terms of its direct applicability in combinatorial modeling of iec 611313 industrial software and the efficiency of acts in terms of generation time and test suite size we used 17 industrial control programs provided by bombardier transportation sweden ab and used in a train control management system our results show that not all combinations of algorithms and interaction strengths could generate a test suite within a realistic cutoff time the results of the modeling process and the efficiency evaluation of acts are useful for practitioners considering to use combinatorial testing for industrial control software as well as for researchers trying to improve the use of such combinatorial testing techniques
|
[['combinatorial', 'testing', 'has', 'been', 'suggested', 'as', 'an', 'effective', 'method', 'of', 'creating', 'test', 'cases', 'at', 'a', 'lower', 'cost', 'however', 'industrially', 'applicable', 'tools', 'for', 'modeling', 'and', 'combinatorial', 'test', 'generation', 'are', 'still', 'scarce', 'as', 'a', 'direct', 'effect', 'combinatorial', 'testing', 'has', 'only', 'seen', 'a', 'limited', 'uptake', 'in', 'industry', 'that', 'calls', 'into', 'question', 'its', 'practical', 'usefulness', 'this', 'lack', 'of', 'evidence', 'is', 'especially', 'troublesome', 'if', 'we', 'consider', 'the', 'use', 'of', 'combinatorial', 'test', 'generation', 'for', 'industrial', 'safetycritical', 'control', 'software', 'such', 'as', 'are', 'found', 'in', 'trains', 'airplanes', 'and', 'power', 'plants', 'to', 'study', 'the', 'industrial', 'application', 'of', 'combinatorial', 'testing', 'we', 'evaluated', 'acts', 'a', 'popular', 'tool', 'for', 'combinatorial', 'modeling', 'and', 'test', 'generation', 'in', 'terms', 'of', 'applicability', 'and', 'test', 'efficiency', 'on', 'industrialsized', 'iec', '611313', 'industrial', 'control', 'software', 'running', 'on', 'programmable', 'logic', 'controllers', 'plc', 'we', 'assessed', 'acts', 'in', 'terms', 'of', 'its', 'direct', 'applicability', 'in', 'combinatorial', 'modeling', 'of', 'iec', '611313', 'industrial', 'software', 'and', 'the', 'efficiency', 'of', 'acts', 'in', 'terms', 'of', 'generation', 'time', 'and', 'test', 'suite', 'size', 'we', 'used', '17', 'industrial', 'control', 'programs', 'provided', 'by', 'bombardier', 'transportation', 'sweden', 'ab', 'and', 'used', 'in', 'a', 'train', 'control', 'management', 'system', 'our', 'results', 'show', 'that', 'not', 'all', 'combinations', 'of', 'algorithms', 'and', 'interaction', 'strengths', 'could', 'generate', 'a', 'test', 'suite', 'within', 'a', 'realistic', 'cutoff', 'time', 'the', 'results', 'of', 'the', 'modeling', 'process', 'and', 'the', 'efficiency', 'evaluation', 'of', 'acts', 'are', 'useful', 'for', 'practitioners', 'considering', 'to', 'use', 'combinatorial', 'testing', 'for', 'industrial', 'control', 'software', 'as', 'well', 'as', 'for', 'researchers', 'trying', 'to', 'improve', 'the', 'use', 'of', 'such', 'combinatorial', 'testing', 'techniques']]
|
[-0.07117659435010491, 0.009823441551761944, -0.04048148285931884, 0.08411252160852037, -0.10532736384337689, -0.15656778160442844, 0.039741158145121656, 0.3842650808206895, -0.23310169939978573, -0.3786785004931128, 0.1456321776097314, -0.19784866309621268, -0.13388446889594835, 0.32113197139010596, -0.09651456894372933, 0.10943618783511559, 0.0665369726310516, -0.03194081885680461, -0.004159480710900697, -0.22720495854110384, 0.22238645043560407, 0.06881124834713136, 0.3334190261920389, 0.09066687969681926, 0.0775678611587351, 0.03143290573090283, -0.05799567243124112, 0.00031400531581591797, -0.0773762651228741, 0.12010507443924753, 0.33482665397076566, 0.21550143776664463, 0.33107975365108466, -0.43256317866313404, -0.1865961809292372, 0.09012809873789422, 0.12103042967466271, 0.02541147084094775, -0.10275058499656808, -0.23375910236878306, 0.08511646282879047, -0.22058905001220286, -0.10312425081519128, -0.10935225283317108, 0.010527530402486395, 0.04019229527802652, -0.29118175991476536, -0.028945353219079643, 0.0325474355085733, 0.11645531885198548, -0.022955957123548046, -0.11232821370423254, 0.009706522771913527, 0.1841552761506735, 0.034047456717284784, -0.0282416081853991, 0.1847655037865759, -0.14222982429036607, -0.1829873741660108, 0.42548564117019755, -0.014595021369357586, -0.19578347434329554, 0.231416216540015, -0.00951171163111352, -0.17918917378331098, 0.03424931881933385, 0.24617324028592993, 0.11863094192539525, -0.14745507324681592, 0.09640411422045654, 0.013181503822342453, 0.17078165423212588, 0.065682476071012, -0.0024314649566275696, 0.17969987240448818, 0.2597605796952724, 0.03907597119647325, 0.17479167444259328, -0.030422181169637758, -0.10099978261213335, -0.25319285720734036, -0.15936581064095226, -0.16560586529005814, 0.023513511677024364, -0.06941691562392835, -0.16756392603851536, 0.37661472824999154, 0.18780855857966167, 0.06843255228028657, 0.04972490097165235, 0.3408811554694787, 0.07038135193566927, 0.08719254189775859, 0.039300646696589954, 0.19811713979052156, 0.06743244654956695, 0.1170360585097542, -0.17376527910043174, 0.11810925123520577, 0.0015756771909709796]
|
1,803.09007
|
Detrimental Network Effects in Privacy: A Graph-theoretic Model for
Node-based Intrusions
|
Despite proportionality being one of the tenets of data protection laws, we
currently lack a robust analytical framework to evaluate the reach of modern
data collections and the network effects at play. We here propose a
graph-theoretic model and notions of node- and edge-observability to quantify
the reach of networked data collections. We first prove closed-form expressions
for our metrics and quantify the impact of the graph's structure on
observability. Second, using our model, we quantify how (1) from 270,000
compromised accounts, Cambridge Analytica collected 68.0M Facebook profiles;
(2) from surveilling 0.01\% the nodes in a mobile phone network, a
law-enforcement agency could observe 18.6\% of all communications; and (3) an
app installed on 1\% of smartphones could monitor the location of half of the
London population through close proximity tracing. Better quantifying the reach
of data collection mechanisms is essential to evaluate their proportionality.
|
cs.CY cs.CR
|
despite proportionality being one of the tenets of data protection laws we currently lack a robust analytical framework to evaluate the reach of modern data collections and the network effects at play we here propose a graphtheoretic model and notions of node and edgeobservability to quantify the reach of networked data collections we first prove closedform expressions for our metrics and quantify the impact of the graphs structure on observability second using our model we quantify how 1 from 270000 compromised accounts cambridge analytica collected 680m facebook profiles 2 from surveilling 001 the nodes in a mobile phone network a lawenforcement agency could observe 186 of all communications and 3 an app installed on 1 of smartphones could monitor the location of half of the london population through close proximity tracing better quantifying the reach of data collection mechanisms is essential to evaluate their proportionality
|
[['despite', 'proportionality', 'being', 'one', 'of', 'the', 'tenets', 'of', 'data', 'protection', 'laws', 'we', 'currently', 'lack', 'a', 'robust', 'analytical', 'framework', 'to', 'evaluate', 'the', 'reach', 'of', 'modern', 'data', 'collections', 'and', 'the', 'network', 'effects', 'at', 'play', 'we', 'here', 'propose', 'a', 'graphtheoretic', 'model', 'and', 'notions', 'of', 'node', 'and', 'edgeobservability', 'to', 'quantify', 'the', 'reach', 'of', 'networked', 'data', 'collections', 'we', 'first', 'prove', 'closedform', 'expressions', 'for', 'our', 'metrics', 'and', 'quantify', 'the', 'impact', 'of', 'the', 'graphs', 'structure', 'on', 'observability', 'second', 'using', 'our', 'model', 'we', 'quantify', 'how', '1', 'from', '270000', 'compromised', 'accounts', 'cambridge', 'analytica', 'collected', '680m', 'facebook', 'profiles', '2', 'from', 'surveilling', '001', 'the', 'nodes', 'in', 'a', 'mobile', 'phone', 'network', 'a', 'lawenforcement', 'agency', 'could', 'observe', '186', 'of', 'all', 'communications', 'and', '3', 'an', 'app', 'installed', 'on', '1', 'of', 'smartphones', 'could', 'monitor', 'the', 'location', 'of', 'half', 'of', 'the', 'london', 'population', 'through', 'close', 'proximity', 'tracing', 'better', 'quantifying', 'the', 'reach', 'of', 'data', 'collection', 'mechanisms', 'is', 'essential', 'to', 'evaluate', 'their', 'proportionality']]
|
[-0.13398875917872072, 0.017215649034228654, -0.05673886947399399, 0.08640824572238939, -0.06988666928373277, -0.14044766876072637, 0.10322315908122388, 0.33250227244898783, -0.2468712183574713, -0.376186552969083, 0.10681190172089002, -0.35411090735660894, -0.12495368798132199, 0.18970595557623032, -0.07598273945041001, 0.008428584325166655, 0.043836007509577335, 0.042163925396252265, -0.010433390611966312, -0.223629092873061, 0.3120259277745557, 0.08136805880513094, 0.33399807690301725, 0.08536072229494301, 0.10100798458611088, -0.013363902747276907, -0.07908167455281445, -0.01898193485464271, -0.12411339748257273, 0.14979339438051142, 0.2514088462142956, 0.194928475614624, 0.30139328132573723, -0.44701332755019546, -0.1575799914229412, 0.10380700286346632, 0.11500602117528512, 0.07961723718687262, 0.00034085704787621197, -0.31428934186106733, 0.10272271666859448, -0.21326373766412512, -0.127429494288304, -0.04947749020295664, 0.014948845040840162, 0.02624856483463434, -0.2210837082620087, 0.017058965402432312, -0.021590868239848494, 0.11011110930900339, -0.050537996017046165, -0.07993453493814023, -0.023209793302951982, 0.2189907437669192, -0.002001252354935966, -0.030813629302838947, 0.16731837049493908, -0.11247895270515099, -0.13814933021211814, 0.3848787395178642, -0.014424613788461601, -0.1341603100824524, 0.16537979868417738, -0.12255220266155781, -0.12496155743080546, 0.06739189032412751, 0.2621968378063659, 0.0722824740485931, -0.18188694039151454, 0.009320117898439517, -0.018213467219923164, 0.18072220689902396, 0.023070996984655798, 0.03510392283443624, 0.1786869921783825, 0.20788020767848675, 0.03584173588659352, 0.10286801773726835, -0.13036725144262729, -0.07054430048611067, -0.25152857463870815, -0.13348161585876575, -0.1722741710771413, 0.028416320690795006, -0.11818510182617924, -0.10613359889986229, 0.38686374757229025, 0.21489821837454195, 0.16459947321678733, 0.07271436472672602, 0.29323468032427474, 0.021516107614676823, 0.08125990578530908, 0.10834979057528446, 0.23337252132437178, 0.06096101324664245, 0.11580689083850405, -0.15445849941047335, 0.11548322862306033, -0.011684026844589643]
|
1,803.09008
|
The Jordan property of Cremona groups and essential dimension
|
We use a recent advance in birational geometry to prove new lower bounds on
the essential dimension of some finite groups.
|
math.AG math.GR
|
we use a recent advance in birational geometry to prove new lower bounds on the essential dimension of some finite groups
|
[['we', 'use', 'a', 'recent', 'advance', 'in', 'birational', 'geometry', 'to', 'prove', 'new', 'lower', 'bounds', 'on', 'the', 'essential', 'dimension', 'of', 'some', 'finite', 'groups']]
|
[-0.1245060654445773, 0.06303469331136771, -0.11351177584202517, 0.10772404509286086, -0.14202356354023019, -0.11971933490020178, 0.05579357691818759, 0.30722088881191756, -0.25586939851442975, -0.21733180460120952, 0.13273995901302746, -0.22439028908099448, -0.18027986581659033, 0.2938958029927952, -0.21280200952397926, 0.05570949436653228, -0.009288398282868522, 0.08148830605759508, -0.1402248280300271, -0.36875229488526073, 0.39308744775397436, -0.013106433763390496, 0.24999533735570453, 0.13742795409191222, 0.09519582694130284, -0.0024066726632771037, -0.042783496768346856, -0.027216768956610134, -0.24976859804952428, 0.2343785863014914, 0.27479192215417114, 0.07105392933867517, 0.2320290164844621, -0.4512695207127503, -0.21793865585987943, 0.17355866198028838, 0.13434546396491073, 0.12845865242360605, -0.12263001944492793, -0.23224162824806713, 0.07830531664547466, -0.14943903218954802, -0.17838469875000773, -0.08328185441149842, 0.03992592099876631, 0.004356568324423972, -0.15746915411381496, -0.037402036134153605, 0.10838237914833285, 0.12557361572093906, -0.032192694023251534, -0.1345277260101977, 0.04730593235719772, 0.14139655848321991, -0.020987661910198983, -0.003733968384386528, 0.05149211311003282, -0.0723870728342306, -0.1268917853456168, 0.3103207180143467, -0.07999351443279357, -0.2118059377230349, 0.20429847637812296, -0.2068208582266899, -0.26391095561640604, 0.08697334189145338, 0.252048503252722, 0.15597822020451227, -0.0005536018649027461, 0.18144772858137176, -0.08380722589347334, 0.1329970368671985, 0.06549313770873207, 0.02588032997612442, 0.07500128873756953, 0.12733765815695128, 0.2048860120897492, 0.1441880020623406, 0.019124746111975538, -0.020486979922723202, -0.3644931678261076, -0.1842565956037669, -0.13383900165735257, 0.09993467816994303, -0.16581860459631398, -0.11392698464139055, 0.35227310231753756, 0.1532877152342172, 0.22111203526479326, 0.09659985067056757, 0.28220408174785827, 0.016759047107327552, 0.024701691188272975, 0.09509749444467681, 0.1876162032311272, 0.22211453167810327, -0.01681470726838424, -0.10394539125263691, 0.0226336993731647, 0.22251709654838556]
|
1,803.09009
|
Constructing de Bruijn sequences by concatenating smaller universal
cycles
|
We present sufficient conditions for when an ordering of universal cycles
$\alpha_1, \alpha_2, \ldots, \alpha_m$ for disjoint sets $\mathbf{S}_1,
\mathbf{S}_2, \ldots , \mathbf{S}_m$ can be concatenated together to obtain a
universal cycle for $\mathbf{S} = \mathbf{S}_1 \cup \mathbf{S}_2 \cup \cdots
\cup \mathbf{S}_m$. When $\mathbf{S}$ is the set of all $k$-ary strings of
length $n$, the result of such a successful construction is a de Bruijn
sequence. Our conditions are applied to generalize two previously known de
Bruijn sequence constructions and then they are applied to develop three new de
Bruijn sequence constructions.
|
math.CO
|
we present sufficient conditions for when an ordering of universal cycles alpha_1 alpha_2 ldots alpha_m for disjoint sets mathbfs_1 mathbfs_2 ldots mathbfs_m can be concatenated together to obtain a universal cycle for mathbfs mathbfs_1 cup mathbfs_2 cup cdots cup mathbfs_m when mathbfs is the set of all kary strings of length n the result of such a successful construction is a de bruijn sequence our conditions are applied to generalize two previously known de bruijn sequence constructions and then they are applied to develop three new de bruijn sequence constructions
|
[['we', 'present', 'sufficient', 'conditions', 'for', 'when', 'an', 'ordering', 'of', 'universal', 'cycles', 'alpha_1', 'alpha_2', 'ldots', 'alpha_m', 'for', 'disjoint', 'sets', 'mathbfs_1', 'mathbfs_2', 'ldots', 'mathbfs_m', 'can', 'be', 'concatenated', 'together', 'to', 'obtain', 'a', 'universal', 'cycle', 'for', 'mathbfs', 'mathbfs_1', 'cup', 'mathbfs_2', 'cup', 'cdots', 'cup', 'mathbfs_m', 'when', 'mathbfs', 'is', 'the', 'set', 'of', 'all', 'kary', 'strings', 'of', 'length', 'n', 'the', 'result', 'of', 'such', 'a', 'successful', 'construction', 'is', 'a', 'de', 'bruijn', 'sequence', 'our', 'conditions', 'are', 'applied', 'to', 'generalize', 'two', 'previously', 'known', 'de', 'bruijn', 'sequence', 'constructions', 'and', 'then', 'they', 'are', 'applied', 'to', 'develop', 'three', 'new', 'de', 'bruijn', 'sequence', 'constructions']]
|
[-0.2134309941015783, 0.1996515616998035, -0.05607490539772525, 0.05883141545235135, -0.06229696435011214, -0.14047222128248818, -0.04225608409199465, 0.34421761174287113, -0.3057662757290971, -0.25887226677566233, 0.099482075787992, -0.25638046901717426, -0.14308212653434435, 0.19616660446904244, -0.1447597252304799, -0.013468920609392669, 0.053932160421806784, 0.08215947571720573, 0.008253901857339466, -0.2879799892017174, 0.30472650103980586, -0.062131223313155626, 0.2445820904602962, -0.07395439961137959, 0.0755961891818082, -0.014038521613526558, 0.048523404981963156, -0.031659013780188705, -0.2517684267146424, 0.04491859025854085, 0.3062762541785127, 0.20703326101370512, 0.16134212977652038, -0.3767768302045408, -0.09080358664193357, 0.20257216099499992, 0.19921164740143077, 0.0910472114836531, 0.04631648256188436, -0.22250346677555216, 0.17472946405455114, -0.12196468333076198, -0.04255909316513377, -0.08188925196771465, 0.0919884152854571, 0.021636370647077758, -0.3755586028675593, -0.029949310496227725, 0.11370609853682774, 0.02467907789451558, -0.0031680170989905796, -0.22464679337350563, -0.0161965709190727, 0.1638468148642763, -0.05487399961843732, 0.1007581480468313, 0.019771397889902193, 0.02157194075499276, -0.15877620115809674, 0.29648052745809156, -0.06001160241707805, -0.16192416797968603, 0.08795459395540613, -0.050587790182665536, -0.24413326783992706, 0.05792505051275449, 0.0252253461928506, 0.173781836438658, -0.06502464733681076, 0.1219124738397243, -0.0534238835042786, 0.14569057863471763, 0.21443125613344213, 0.0015527994726740179, 0.19159346989666423, 0.061584446615251226, 0.09783760881761, 0.11622632207166005, 0.026670955625983577, -0.020026175277529375, -0.32186768851464703, -0.1308363419489719, -0.18338270748582935, 0.1092300382997131, -0.15802605027714717, -0.22817721650270478, 0.3091197788183178, 0.09507070420797736, 0.2369216432950149, 0.17240200503285796, 0.18488033503914872, 0.02567176042083745, 0.013619372023857153, 0.05967815566275801, 0.045566615382475514, 0.12322248234219539, -0.0038479698123410344, -0.13336769443343482, 0.008617372335200863, 0.20452470700201092]
|
1,803.0901
|
Datasheets for Datasets
|
The machine learning community currently has no standardized process for
documenting datasets, which can lead to severe consequences in high-stakes
domains. To address this gap, we propose datasheets for datasets. In the
electronics industry, every component, no matter how simple or complex, is
accompanied with a datasheet that describes its operating characteristics, test
results, recommended uses, and other information. By analogy, we propose that
every dataset be accompanied with a datasheet that documents its motivation,
composition, collection process, recommended uses, and so on. Datasheets for
datasets will facilitate better communication between dataset creators and
dataset consumers, and encourage the machine learning community to prioritize
transparency and accountability.
|
cs.DB cs.AI cs.LG
|
the machine learning community currently has no standardized process for documenting datasets which can lead to severe consequences in highstakes domains to address this gap we propose datasheets for datasets in the electronics industry every component no matter how simple or complex is accompanied with a datasheet that describes its operating characteristics test results recommended uses and other information by analogy we propose that every dataset be accompanied with a datasheet that documents its motivation composition collection process recommended uses and so on datasheets for datasets will facilitate better communication between dataset creators and dataset consumers and encourage the machine learning community to prioritize transparency and accountability
|
[['the', 'machine', 'learning', 'community', 'currently', 'has', 'no', 'standardized', 'process', 'for', 'documenting', 'datasets', 'which', 'can', 'lead', 'to', 'severe', 'consequences', 'in', 'highstakes', 'domains', 'to', 'address', 'this', 'gap', 'we', 'propose', 'datasheets', 'for', 'datasets', 'in', 'the', 'electronics', 'industry', 'every', 'component', 'no', 'matter', 'how', 'simple', 'or', 'complex', 'is', 'accompanied', 'with', 'a', 'datasheet', 'that', 'describes', 'its', 'operating', 'characteristics', 'test', 'results', 'recommended', 'uses', 'and', 'other', 'information', 'by', 'analogy', 'we', 'propose', 'that', 'every', 'dataset', 'be', 'accompanied', 'with', 'a', 'datasheet', 'that', 'documents', 'its', 'motivation', 'composition', 'collection', 'process', 'recommended', 'uses', 'and', 'so', 'on', 'datasheets', 'for', 'datasets', 'will', 'facilitate', 'better', 'communication', 'between', 'dataset', 'creators', 'and', 'dataset', 'consumers', 'and', 'encourage', 'the', 'machine', 'learning', 'community', 'to', 'prioritize', 'transparency', 'and', 'accountability']]
|
[-0.06648566363440286, 0.05163009057287127, -0.08810798816435109, 0.07251439298950946, -0.17071598185504847, -0.17183178432599128, 0.07102642846337268, 0.44499109869944714, -0.2472901306263058, -0.33834908939201697, 0.0980317296099057, -0.3216003476703, -0.1409903589716871, 0.2140697127830446, -0.1452318463674703, 0.017106614622861914, 0.14508035613624293, 0.038757394720739295, 0.004594704012221126, -0.25646562956134294, 0.32086770075469095, 0.07614870804196625, 0.3432589402100263, 0.09418607887455097, 0.08259408992158127, -0.029147740266346766, -0.060911076735252534, -0.033322251924078596, -0.08356721036316485, 0.14826360776385067, 0.35423495795438503, 0.2541203966982245, 0.3299507971060958, -0.40118794584218154, -0.17271345441238345, 0.1469820987946728, 0.10359304922276011, 0.04769034159985027, -0.0872615689474863, -0.31522533208758474, 0.055787808253107786, -0.20775476109375743, -0.049953603294512657, -0.1486000870310954, 0.009749303606695662, -0.023131897082230266, -0.26790583922710515, 0.01327430057365482, 0.03895795757873593, 0.09696111257980082, -0.0010111342362676547, -0.12446066326348582, 0.024875103252304492, 0.1633809646787383, 0.044594562469946794, 0.03482891164097726, 0.15258151596459935, -0.1584588047095235, -0.16290494088501295, 0.40507554597108164, -0.041165340863707885, -0.16066525839965476, 0.21000289256144838, -0.04129216672469661, -0.1355520771276728, 0.07697327108618533, 0.21618674195885101, 0.029340479026818387, -0.19146977249254413, 0.02000936178357784, -0.002946698507207019, 0.20182801408923848, 0.03306245914373164, -0.027340297558928067, 0.2024320858034575, 0.25673496612634894, 0.041460945244843714, 0.09915089748841145, -0.05153485890760774, -0.04775668673677518, -0.19546916992098928, -0.14814521535517317, -0.16306058089379397, -0.03446860839047025, -0.04095852381055282, -0.144350960615709, 0.35847784390794896, 0.24362836959641251, 0.1304005481494225, 0.042439843028583606, 0.28621051441355844, -0.021900030212024243, 0.1302950994033262, 0.10123153243683905, 0.17115552070611548, -0.012472860182191585, 0.18574436482860246, -0.1298912849960518, 0.13800263954935788, -0.040034503297375464]
|
1,803.09011
|
On the birational geometry of spaces of complete forms II: skew-forms
|
Moduli spaces of complete skew-forms are compactifications of spaces of
skew-symmetric linear maps of maximal rank on a fixed vector space, where the
added boundary divisor is simple normal crossing. In this paper we compute
their effective, nef and movable cones, the generators of their Cox rings, and
for those spaces having Picard rank two we give an explicit presentation of the
Cox ring. Furthermore, we give a complete description of both the Mori chamber
and stable base locus decompositions of the effective cone of some spaces of
complete skew-forms having Picard rank at most four.
|
math.AG math.RT
|
moduli spaces of complete skewforms are compactifications of spaces of skewsymmetric linear maps of maximal rank on a fixed vector space where the added boundary divisor is simple normal crossing in this paper we compute their effective nef and movable cones the generators of their cox rings and for those spaces having picard rank two we give an explicit presentation of the cox ring furthermore we give a complete description of both the mori chamber and stable base locus decompositions of the effective cone of some spaces of complete skewforms having picard rank at most four
|
[['moduli', 'spaces', 'of', 'complete', 'skewforms', 'are', 'compactifications', 'of', 'spaces', 'of', 'skewsymmetric', 'linear', 'maps', 'of', 'maximal', 'rank', 'on', 'a', 'fixed', 'vector', 'space', 'where', 'the', 'added', 'boundary', 'divisor', 'is', 'simple', 'normal', 'crossing', 'in', 'this', 'paper', 'we', 'compute', 'their', 'effective', 'nef', 'and', 'movable', 'cones', 'the', 'generators', 'of', 'their', 'cox', 'rings', 'and', 'for', 'those', 'spaces', 'having', 'picard', 'rank', 'two', 'we', 'give', 'an', 'explicit', 'presentation', 'of', 'the', 'cox', 'ring', 'furthermore', 'we', 'give', 'a', 'complete', 'description', 'of', 'both', 'the', 'mori', 'chamber', 'and', 'stable', 'base', 'locus', 'decompositions', 'of', 'the', 'effective', 'cone', 'of', 'some', 'spaces', 'of', 'complete', 'skewforms', 'having', 'picard', 'rank', 'at', 'most', 'four']]
|
[-0.1761449585530035, 0.05551477575794164, -0.07451741420663893, 0.0986966428029886, -0.0946925105254582, -0.14669353074017674, 0.006479245809927345, 0.35778181258826813, -0.2777203794858577, -0.1510128428208384, 0.12889902703736492, -0.2520641337119122, -0.13601008523255587, 0.17243867694459697, -0.1576517636075299, -0.02393103555771225, -0.02346283197402954, 0.08385175877706484, -0.161224822771359, -0.3714611654211965, 0.46771590390856915, -0.002735987374994983, 0.2207200472599807, 0.023969204967564092, 0.1676799769642109, 0.020831122442069364, -0.06238298915187888, 0.002195220266932007, -0.15855581679956077, 0.19372153377774706, 0.3069058917165595, 0.0797547600826526, 0.17182619338656993, -0.4077460478515701, -0.09134519382558287, 0.2299981806724471, 0.09047044884472927, 0.031311194551117874, 0.015039682421744107, -0.18240793350529164, 0.0845782244478927, -0.16471599754035235, -0.20996628927086738, -0.11643053038402441, 0.05897658489560312, 0.023192234168899185, -0.2268633841031647, -0.06473184326735444, 0.0562009084969759, 0.1812796680841278, -0.06909699890851737, -0.12322192123912751, -0.09987061469756225, 0.03942853134581225, -0.012819155319990155, -0.022831526104400448, 0.09904924850072463, -0.09853099457711537, -0.0960086984262663, 0.3484046533703804, -0.032228088937699795, -0.21975062975778858, 0.16591273462944764, -0.14499248528575642, -0.0652263202491474, 0.177389409903318, 0.1361541625587864, 0.2039021654311503, 0.00830346062541642, 0.17603335922715216, -0.12243741364193525, 0.008064202409475408, 0.12413151130981823, 0.004217343241412272, 0.12827382695816575, 0.1318994703692721, 0.1243756069616598, 0.09967632534259811, -0.024787491549083843, -0.02606232670145704, -0.42524463344523883, -0.2116661328386436, -0.09396917899040148, 0.11275821754292763, -0.16366439596009863, -0.2151184467242119, 0.4423767392414602, -0.0085453599532868, 0.23437836459104686, 0.12392514575510583, 0.25571407249910716, -0.009134347461401782, -0.0029737616126286857, 0.059458596151980986, 0.13757524127790832, 0.2016621350528712, -0.05219474061828186, -0.13057168642494907, -0.04177997938414263, 0.21201777601852378]
|
1,803.09012
|
Message passing-based joint CFO and channel estimation in millimeter
wave systems with one-bit ADCs
|
Channel estimation at millimeter wave (mmWave) is challenging when large
antenna arrays are used. Prior work has leveraged the sparse nature of mmWave
channels via compressed sensing based algorithms for channel estimation. Most
of these algorithms, though, assume perfect synchronization and are vulnerable
to phase errors that arise due to carrier frequency offset (CFO) and phase
noise. Recently sparsity-aware, non-coherent beamforming algorithms that are
robust to phase errors were proposed for narrowband phased array systems with
full resolution analog-to-digital converters (ADCs). Such energy based
algorithms, however, are not robust to heavy quantization at the receiver. In
this paper, we develop a joint CFO and wideband channel estimation algorithm
that is scalable across different mmWave architectures. Our method exploits the
sparsity of mmWave MIMO channel in the angle-delay domain, in addition to
compressibility of the phase error vector. We formulate the joint estimation as
a sparse bilinear optimization problem and then use message passing for
recovery. We also give an efficient implementation of a generalized bilinear
message passing algorithm for the joint estimation in mmWave systems with
one-bit ADCs. Simulation results show that our method is able to recover the
CFO and the channel compressively, even in the presence of phase noise.
|
cs.IT math.IT
|
channel estimation at millimeter wave mmwave is challenging when large antenna arrays are used prior work has leveraged the sparse nature of mmwave channels via compressed sensing based algorithms for channel estimation most of these algorithms though assume perfect synchronization and are vulnerable to phase errors that arise due to carrier frequency offset cfo and phase noise recently sparsityaware noncoherent beamforming algorithms that are robust to phase errors were proposed for narrowband phased array systems with full resolution analogtodigital converters adcs such energy based algorithms however are not robust to heavy quantization at the receiver in this paper we develop a joint cfo and wideband channel estimation algorithm that is scalable across different mmwave architectures our method exploits the sparsity of mmwave mimo channel in the angledelay domain in addition to compressibility of the phase error vector we formulate the joint estimation as a sparse bilinear optimization problem and then use message passing for recovery we also give an efficient implementation of a generalized bilinear message passing algorithm for the joint estimation in mmwave systems with onebit adcs simulation results show that our method is able to recover the cfo and the channel compressively even in the presence of phase noise
|
[['channel', 'estimation', 'at', 'millimeter', 'wave', 'mmwave', 'is', 'challenging', 'when', 'large', 'antenna', 'arrays', 'are', 'used', 'prior', 'work', 'has', 'leveraged', 'the', 'sparse', 'nature', 'of', 'mmwave', 'channels', 'via', 'compressed', 'sensing', 'based', 'algorithms', 'for', 'channel', 'estimation', 'most', 'of', 'these', 'algorithms', 'though', 'assume', 'perfect', 'synchronization', 'and', 'are', 'vulnerable', 'to', 'phase', 'errors', 'that', 'arise', 'due', 'to', 'carrier', 'frequency', 'offset', 'cfo', 'and', 'phase', 'noise', 'recently', 'sparsityaware', 'noncoherent', 'beamforming', 'algorithms', 'that', 'are', 'robust', 'to', 'phase', 'errors', 'were', 'proposed', 'for', 'narrowband', 'phased', 'array', 'systems', 'with', 'full', 'resolution', 'analogtodigital', 'converters', 'adcs', 'such', 'energy', 'based', 'algorithms', 'however', 'are', 'not', 'robust', 'to', 'heavy', 'quantization', 'at', 'the', 'receiver', 'in', 'this', 'paper', 'we', 'develop', 'a', 'joint', 'cfo', 'and', 'wideband', 'channel', 'estimation', 'algorithm', 'that', 'is', 'scalable', 'across', 'different', 'mmwave', 'architectures', 'our', 'method', 'exploits', 'the', 'sparsity', 'of', 'mmwave', 'mimo', 'channel', 'in', 'the', 'angledelay', 'domain', 'in', 'addition', 'to', 'compressibility', 'of', 'the', 'phase', 'error', 'vector', 'we', 'formulate', 'the', 'joint', 'estimation', 'as', 'a', 'sparse', 'bilinear', 'optimization', 'problem', 'and', 'then', 'use', 'message', 'passing', 'for', 'recovery', 'we', 'also', 'give', 'an', 'efficient', 'implementation', 'of', 'a', 'generalized', 'bilinear', 'message', 'passing', 'algorithm', 'for', 'the', 'joint', 'estimation', 'in', 'mmwave', 'systems', 'with', 'onebit', 'adcs', 'simulation', 'results', 'show', 'that', 'our', 'method', 'is', 'able', 'to', 'recover', 'the', 'cfo', 'and', 'the', 'channel', 'compressively', 'even', 'in', 'the', 'presence', 'of', 'phase', 'noise']]
|
[-0.20634315204598122, 0.04059236164302368, -0.021490631210362883, -0.004041404499839157, -0.08748239570005394, -0.24774624560890135, 0.05531552011455266, 0.4581738915757753, -0.27196400300819723, -0.25909105515274317, 0.15694672547093133, -0.18655835099017887, -0.23832128654594362, 0.1565145915397327, -0.13391811462971775, 0.12785007202892393, 0.09273855177979842, -0.03857003293227201, -0.1107273889712489, -0.2135357326012457, 0.23467000229376836, 0.11074857061800654, 0.3620822445735039, -0.053032913434073625, 0.11979502579660632, 0.025749338145567038, -0.015062888474921831, -0.0793665630814726, -0.06889897663640299, 0.07401762523894564, 0.3690403442579641, 0.15159256385514208, 0.2373598290106921, -0.4117351493737961, -0.2540149904731939, 0.09459798500887048, 0.1860958316881182, 0.14477810686898987, -0.07608780373103305, -0.3141902716394829, 0.16283434850687337, -0.18909451631894011, 0.02329107068145453, -0.024036306868172923, -0.10412366985255361, 0.02528811204629436, -0.3688979022765523, 0.08988622215385919, 0.008306316350267004, -0.005602540654496322, -0.0308039541210312, -0.17433992486947508, 0.09117452500026617, 0.10425556165155195, -0.0006356762764993962, -0.005016266859474763, 0.07914495003173377, -0.07380800346602959, -0.07830576487557397, 0.33814945844794386, -0.01008275749198907, -0.26925853346080625, 0.15166512805307097, -0.08133140243172868, -0.11727331773249376, 0.21388744908056004, 0.27976515154303305, 0.05496449671356721, -0.14786606192201043, 0.03240985782737079, 0.021236681310527736, 0.21704779954775427, 0.05169294448048154, 0.14100608441385612, 0.1476818405564374, 0.1743679169776261, 0.14198717419567763, 0.12666475067994748, -0.2133519751267665, -0.054812844008652134, -0.17925647066544687, -0.09784604121458286, -0.2689520706658933, -0.05462303976684725, -0.08779979878258996, -0.1324145494269865, 0.3483320329180775, 0.21544625697453595, 0.107959637914168, 0.09920189178311868, 0.4423975152199838, 0.09906442478051251, 0.019159913162668397, 0.12715689462391816, 0.22124158206919384, 0.1772398427511051, 0.1368906041838933, -0.1988335901359328, 0.03930256397356812, -0.02870879005826083]
|
1,803.09013
|
Exploring the robustness of features and enhancement on speech
recognition systems in highly-reverberant real environments
|
This paper evaluates the robustness of a DNN-HMM-based speech recognition
system in highly-reverberant real environments using the HRRE database. The
performance of locally-normalized filter bank (LNFB) and Mel filter bank
(MelFB) features in combination with Non-negative Matrix Factorization (NMF),
Suppression of Slowly-varying components and the Falling edge (SSF) and
Weighted Prediction Error (WPE) enhancement methods are discussed and
evaluated. Two training conditions were considered: clean and reverberated
(Reverb). With Reverb training the use of WPE and LNFB provides WERs that are
3% and 20% lower in average than SSF and NMF, respectively. WPE and MelFB
provides WERs that are 11% and 24% lower in average than SSF and NMF,
respectively. With clean training, which represents a significant mismatch
between testing and training conditions, LNFB features clearly outperform MelFB
features. The results show that different types of training, parametrization,
and enhancement techniques may work better for a specific combination of
speaker-microphone distance and reverberation time. This suggests that there
could be some degree of complementarity between systems trained with different
enhancement and parametrization methods.
|
eess.AS cs.SD
|
this paper evaluates the robustness of a dnnhmmbased speech recognition system in highlyreverberant real environments using the hrre database the performance of locallynormalized filter bank lnfb and mel filter bank melfb features in combination with nonnegative matrix factorization nmf suppression of slowlyvarying components and the falling edge ssf and weighted prediction error wpe enhancement methods are discussed and evaluated two training conditions were considered clean and reverberated reverb with reverb training the use of wpe and lnfb provides wers that are 3 and 20 lower in average than ssf and nmf respectively wpe and melfb provides wers that are 11 and 24 lower in average than ssf and nmf respectively with clean training which represents a significant mismatch between testing and training conditions lnfb features clearly outperform melfb features the results show that different types of training parametrization and enhancement techniques may work better for a specific combination of speakermicrophone distance and reverberation time this suggests that there could be some degree of complementarity between systems trained with different enhancement and parametrization methods
|
[['this', 'paper', 'evaluates', 'the', 'robustness', 'of', 'a', 'dnnhmmbased', 'speech', 'recognition', 'system', 'in', 'highlyreverberant', 'real', 'environments', 'using', 'the', 'hrre', 'database', 'the', 'performance', 'of', 'locallynormalized', 'filter', 'bank', 'lnfb', 'and', 'mel', 'filter', 'bank', 'melfb', 'features', 'in', 'combination', 'with', 'nonnegative', 'matrix', 'factorization', 'nmf', 'suppression', 'of', 'slowlyvarying', 'components', 'and', 'the', 'falling', 'edge', 'ssf', 'and', 'weighted', 'prediction', 'error', 'wpe', 'enhancement', 'methods', 'are', 'discussed', 'and', 'evaluated', 'two', 'training', 'conditions', 'were', 'considered', 'clean', 'and', 'reverberated', 'reverb', 'with', 'reverb', 'training', 'the', 'use', 'of', 'wpe', 'and', 'lnfb', 'provides', 'wers', 'that', 'are', '3', 'and', '20', 'lower', 'in', 'average', 'than', 'ssf', 'and', 'nmf', 'respectively', 'wpe', 'and', 'melfb', 'provides', 'wers', 'that', 'are', '11', 'and', '24', 'lower', 'in', 'average', 'than', 'ssf', 'and', 'nmf', 'respectively', 'with', 'clean', 'training', 'which', 'represents', 'a', 'significant', 'mismatch', 'between', 'testing', 'and', 'training', 'conditions', 'lnfb', 'features', 'clearly', 'outperform', 'melfb', 'features', 'the', 'results', 'show', 'that', 'different', 'types', 'of', 'training', 'parametrization', 'and', 'enhancement', 'techniques', 'may', 'work', 'better', 'for', 'a', 'specific', 'combination', 'of', 'speakermicrophone', 'distance', 'and', 'reverberation', 'time', 'this', 'suggests', 'that', 'there', 'could', 'be', 'some', 'degree', 'of', 'complementarity', 'between', 'systems', 'trained', 'with', 'different', 'enhancement', 'and', 'parametrization', 'methods']]
|
[-0.05866454210002857, 0.015052472610445417, -0.06851903942121557, 0.05978334472327322, -0.0335458855464305, -0.19040954699629598, 0.012469412577779379, 0.434382085104269, -0.2068485949083766, -0.33052314765174107, 0.09693514595421984, -0.2907162060762739, -0.1711654319819173, 0.18715830010047854, -0.07053310902391081, 0.053523016650609934, 0.12186627806861439, -0.011315421110360756, -0.12785907062156313, -0.2475520359387018, 0.2615919807628238, 0.04448508250199192, 0.31680009992705027, 0.0423922382747016, 0.1050765691876147, -0.03420035507803447, -0.04990918829950322, -0.012689296376599362, -0.03558694443768083, 0.12626100944895188, 0.26544304693960885, 0.17053091309595433, 0.26050289428087514, -0.33367757255365776, -0.17880337504041793, 0.1032574970341293, 0.11965000828639907, 0.06591339344048552, -0.027065528245345197, -0.30360013946405884, 0.12199791851205498, -0.15581042816548693, 0.02119191255993568, -0.07705225176921875, 0.0098484393413118, 0.003118781317796933, -0.3206573707773488, 0.11923629936580299, 0.07230197154150823, 0.0855013461970895, -0.06794445809065061, -0.20939765259080714, 0.015071313100806354, 0.12727387552769556, 0.02318246236082012, 0.039094544509040006, 0.12318956888984811, -0.1211101840799206, -0.10841806125158951, 0.32455980776087245, -0.11006269095408366, -0.1872996716655394, 0.20847912353446937, -0.08574207796103503, -0.09880102437317438, 0.11756448236090192, 0.1975624585829361, 0.04463786018196736, -0.14739047667595762, -0.01574031641319692, 0.011638338721671401, 0.19724531291251088, 0.10099854286430822, 0.04385817215706293, 0.119405160361168, 0.18980667991122815, 0.022018014760190253, 0.12050357616173114, -0.14438604266443372, -0.026494029117197063, -0.2323119615110949, -0.10788823928430501, -0.1874684944732346, -0.02029272614697204, -0.14308847179892956, -0.11961667840203723, 0.3899821262123317, 0.18151840166067884, 0.20273085541405975, 0.10071884211601921, 0.3073759126262023, 0.07793328277876921, 0.08541406938508594, 0.09026588334222517, 0.2068370547479352, 0.04913444053684775, 0.07518448145197672, -0.18858498833955062, 0.06767342937008075, 0.026958418368036755]
|
1,803.09014
|
Feature Transfer Learning for Deep Face Recognition with
Under-Represented Data
|
Despite the large volume of face recognition datasets, there is a significant
portion of subjects, of which the samples are insufficient and thus
under-represented. Ignoring such significant portion results in insufficient
training data. Training with under-represented data leads to biased classifiers
in conventionally-trained deep networks. In this paper, we propose a
center-based feature transfer framework to augment the feature space of
under-represented subjects from the regular subjects that have sufficiently
diverse samples. A Gaussian prior of the variance is assumed across all
subjects and the variance from regular ones are transferred to the
under-represented ones. This encourages the under-represented distribution to
be closer to the regular distribution. Further, an alternating training regimen
is proposed to simultaneously achieve less biased classifiers and a more
discriminative feature representation. We conduct ablative study to mimic the
under-represented datasets by varying the portion of under-represented classes
on the MS-Celeb-1M dataset. Advantageous results on LFW, IJB-A and MS-Celeb-1M
demonstrate the effectiveness of our feature transfer and training strategy,
compared to both general baselines and state-of-the-art methods. Moreover, our
feature transfer successfully presents smooth visual interpolation, which
conducts disentanglement to preserve identity of a class while augmenting its
feature space with non-identity variations such as pose and lighting.
|
cs.CV
|
despite the large volume of face recognition datasets there is a significant portion of subjects of which the samples are insufficient and thus underrepresented ignoring such significant portion results in insufficient training data training with underrepresented data leads to biased classifiers in conventionallytrained deep networks in this paper we propose a centerbased feature transfer framework to augment the feature space of underrepresented subjects from the regular subjects that have sufficiently diverse samples a gaussian prior of the variance is assumed across all subjects and the variance from regular ones are transferred to the underrepresented ones this encourages the underrepresented distribution to be closer to the regular distribution further an alternating training regimen is proposed to simultaneously achieve less biased classifiers and a more discriminative feature representation we conduct ablative study to mimic the underrepresented datasets by varying the portion of underrepresented classes on the msceleb1m dataset advantageous results on lfw ijba and msceleb1m demonstrate the effectiveness of our feature transfer and training strategy compared to both general baselines and stateoftheart methods moreover our feature transfer successfully presents smooth visual interpolation which conducts disentanglement to preserve identity of a class while augmenting its feature space with nonidentity variations such as pose and lighting
|
[['despite', 'the', 'large', 'volume', 'of', 'face', 'recognition', 'datasets', 'there', 'is', 'a', 'significant', 'portion', 'of', 'subjects', 'of', 'which', 'the', 'samples', 'are', 'insufficient', 'and', 'thus', 'underrepresented', 'ignoring', 'such', 'significant', 'portion', 'results', 'in', 'insufficient', 'training', 'data', 'training', 'with', 'underrepresented', 'data', 'leads', 'to', 'biased', 'classifiers', 'in', 'conventionallytrained', 'deep', 'networks', 'in', 'this', 'paper', 'we', 'propose', 'a', 'centerbased', 'feature', 'transfer', 'framework', 'to', 'augment', 'the', 'feature', 'space', 'of', 'underrepresented', 'subjects', 'from', 'the', 'regular', 'subjects', 'that', 'have', 'sufficiently', 'diverse', 'samples', 'a', 'gaussian', 'prior', 'of', 'the', 'variance', 'is', 'assumed', 'across', 'all', 'subjects', 'and', 'the', 'variance', 'from', 'regular', 'ones', 'are', 'transferred', 'to', 'the', 'underrepresented', 'ones', 'this', 'encourages', 'the', 'underrepresented', 'distribution', 'to', 'be', 'closer', 'to', 'the', 'regular', 'distribution', 'further', 'an', 'alternating', 'training', 'regimen', 'is', 'proposed', 'to', 'simultaneously', 'achieve', 'less', 'biased', 'classifiers', 'and', 'a', 'more', 'discriminative', 'feature', 'representation', 'we', 'conduct', 'ablative', 'study', 'to', 'mimic', 'the', 'underrepresented', 'datasets', 'by', 'varying', 'the', 'portion', 'of', 'underrepresented', 'classes', 'on', 'the', 'msceleb1m', 'dataset', 'advantageous', 'results', 'on', 'lfw', 'ijba', 'and', 'msceleb1m', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'feature', 'transfer', 'and', 'training', 'strategy', 'compared', 'to', 'both', 'general', 'baselines', 'and', 'stateoftheart', 'methods', 'moreover', 'our', 'feature', 'transfer', 'successfully', 'presents', 'smooth', 'visual', 'interpolation', 'which', 'conducts', 'disentanglement', 'to', 'preserve', 'identity', 'of', 'a', 'class', 'while', 'augmenting', 'its', 'feature', 'space', 'with', 'nonidentity', 'variations', 'such', 'as', 'pose', 'and', 'lighting']]
|
[-0.02139284443029142, 0.025031973365233835, -0.055437081168589315, 0.06496322096385691, -0.11680788970876727, -0.13748950545967958, 0.04501187605366333, 0.43783685658590416, -0.2480938478039383, -0.35269341918069924, 0.06853859436834944, -0.30652420267240327, -0.14528001841639554, 0.1962236066381285, -0.18545529225711427, 0.024754321672640908, 0.16140384693321336, 0.011469747920970047, -0.04952024510107119, -0.3200003504706778, 0.3307451895931597, 0.04003355738493169, 0.360344867686514, -0.031760455711526955, 0.10713158525058546, -0.06224040619609646, -0.05691827190530241, 0.004436872927043402, -0.01804765682877881, 0.18318553430732543, 0.33825484818005147, 0.1656589341298932, 0.3282103596245916, -0.36691762975403175, -0.22585354507460598, 0.12204143391986985, 0.12998743181462072, 0.11531290410110259, -0.053302102627603924, -0.33747515204682277, 0.09160278427741254, -0.15232903477318807, 0.007615547652694568, -0.13413334503973745, -0.006755468970748471, -0.012750523243926521, -0.3052053119435869, 0.07940561690573947, 0.09335680272741781, 0.08638572856200052, -0.06673768177843972, -0.14215249261895277, -0.027395666268797806, 0.1946923607168024, 0.07142976441175042, 0.060761953120244974, 0.11834312983746849, -0.1903405504264123, -0.07784549881060103, 0.35958713977435486, -0.04123352195219651, -0.20956735415475394, 0.2352753495519508, -0.10355311387278769, -0.11026452685154937, 0.13345895417553572, 0.22027269131805174, 0.1263412542762646, -0.1386410951178836, -0.018292804686202025, -0.04641610368233712, 0.18503378791299033, 0.036606331256250686, -0.014098041948911025, 0.15926316695575096, 0.2115732953855907, 0.054312167430889624, 0.15725374767882286, -0.15150782530802992, -0.050152817957649996, -0.22317317254095342, -0.06697193177478314, -0.19622327685205554, -0.024551060148607477, -0.09982651902719769, -0.14662787522564627, 0.40501715131196664, 0.23187242509259737, 0.22956593870880332, 0.10650621731959593, 0.28841460386374546, -0.031008728363421462, 0.15271910994234889, 0.07650117922240673, 0.1758096134353809, 0.0025566885796889883, 0.09519651312200325, -0.17891561847634205, 0.10124321323263445, -0.03303649186606134]
|
1,803.09015
|
Difference-in-Differences with Multiple Time Periods
|
In this article, we consider identification, estimation, and inference
procedures for treatment effect parameters using Difference-in-Differences
(DiD) with (i) multiple time periods, (ii) variation in treatment timing, and
(iii) when the "parallel trends assumption" holds potentially only after
conditioning on observed covariates. We show that a family of causal effect
parameters are identified in staggered DiD setups, even if differences in
observed characteristics create non-parallel outcome dynamics between groups.
Our identification results allow one to use outcome regression, inverse
probability weighting, or doubly-robust estimands. We also propose different
aggregation schemes that can be used to highlight treatment effect
heterogeneity across different dimensions as well as to summarize the overall
effect of participating in the treatment. We establish the asymptotic
properties of the proposed estimators and prove the validity of a
computationally convenient bootstrap procedure to conduct asymptotically valid
simultaneous (instead of pointwise) inference. Finally, we illustrate the
relevance of our proposed tools by analyzing the effect of the minimum wage on
teen employment from 2001--2007. Open-source software is available for
implementing the proposed methods.
|
econ.EM math.ST stat.AP stat.TH
|
in this article we consider identification estimation and inference procedures for treatment effect parameters using differenceindifferences did with i multiple time periods ii variation in treatment timing and iii when the parallel trends assumption holds potentially only after conditioning on observed covariates we show that a family of causal effect parameters are identified in staggered did setups even if differences in observed characteristics create nonparallel outcome dynamics between groups our identification results allow one to use outcome regression inverse probability weighting or doublyrobust estimands we also propose different aggregation schemes that can be used to highlight treatment effect heterogeneity across different dimensions as well as to summarize the overall effect of participating in the treatment we establish the asymptotic properties of the proposed estimators and prove the validity of a computationally convenient bootstrap procedure to conduct asymptotically valid simultaneous instead of pointwise inference finally we illustrate the relevance of our proposed tools by analyzing the effect of the minimum wage on teen employment from 20012007 opensource software is available for implementing the proposed methods
|
[['in', 'this', 'article', 'we', 'consider', 'identification', 'estimation', 'and', 'inference', 'procedures', 'for', 'treatment', 'effect', 'parameters', 'using', 'differenceindifferences', 'did', 'with', 'i', 'multiple', 'time', 'periods', 'ii', 'variation', 'in', 'treatment', 'timing', 'and', 'iii', 'when', 'the', 'parallel', 'trends', 'assumption', 'holds', 'potentially', 'only', 'after', 'conditioning', 'on', 'observed', 'covariates', 'we', 'show', 'that', 'a', 'family', 'of', 'causal', 'effect', 'parameters', 'are', 'identified', 'in', 'staggered', 'did', 'setups', 'even', 'if', 'differences', 'in', 'observed', 'characteristics', 'create', 'nonparallel', 'outcome', 'dynamics', 'between', 'groups', 'our', 'identification', 'results', 'allow', 'one', 'to', 'use', 'outcome', 'regression', 'inverse', 'probability', 'weighting', 'or', 'doublyrobust', 'estimands', 'we', 'also', 'propose', 'different', 'aggregation', 'schemes', 'that', 'can', 'be', 'used', 'to', 'highlight', 'treatment', 'effect', 'heterogeneity', 'across', 'different', 'dimensions', 'as', 'well', 'as', 'to', 'summarize', 'the', 'overall', 'effect', 'of', 'participating', 'in', 'the', 'treatment', 'we', 'establish', 'the', 'asymptotic', 'properties', 'of', 'the', 'proposed', 'estimators', 'and', 'prove', 'the', 'validity', 'of', 'a', 'computationally', 'convenient', 'bootstrap', 'procedure', 'to', 'conduct', 'asymptotically', 'valid', 'simultaneous', 'instead', 'of', 'pointwise', 'inference', 'finally', 'we', 'illustrate', 'the', 'relevance', 'of', 'our', 'proposed', 'tools', 'by', 'analyzing', 'the', 'effect', 'of', 'the', 'minimum', 'wage', 'on', 'teen', 'employment', 'from', '20012007', 'opensource', 'software', 'is', 'available', 'for', 'implementing', 'the', 'proposed', 'methods']]
|
[-0.05936818347572103, 0.04696417915040691, -0.08687515159260653, 0.10410235103837953, -0.09545428880715165, -0.1514225106140406, 0.08577863926428568, 0.4185898925442698, -0.21747370044989833, -0.31841689451790317, 0.10223549563670531, -0.22668888165442214, -0.16458404582159744, 0.20261840484688465, -0.09252557613025152, 0.037761228927143516, 0.09537787322522323, -0.003542204704617375, -0.07343523498041149, -0.28010945885586713, 0.280558444420411, 0.0549619435426383, 0.34651586387691824, 0.014101402718980593, 0.07984069009892236, 0.06288005896688749, -0.08388664368165379, 0.05427841072361488, -0.13678516742237107, 0.0810985329267221, 0.2756781444614539, 0.161444158420427, 0.32866504210604075, -0.40803760678732187, -0.2211590727427225, 0.10165527735933147, 0.12992012208252718, 0.1069903244778257, -0.028919379109109956, -0.24681529605589891, 0.046707900675902164, -0.18461680130955452, -0.11277251341380179, -0.1011514757096168, -0.017600380815565586, 0.009922580030778873, -0.31869946766963186, 0.11511758460255805, 0.032541327682108316, 0.08068875653332035, -0.054499074230612864, -0.1476624315997971, 0.015972680841221665, 0.1381815473568136, 0.09550177588277421, -0.08844078488209038, 0.11367613147548132, -0.07656951167288868, -0.14873450443191433, 0.3152389192011009, -0.0431714929401441, -0.23103689657652687, 0.18024001995786681, -0.112712272876424, -0.16630710711456492, 0.042710610373673595, 0.20265739696935334, 0.11324904039609192, -0.15695487575154904, 0.02538375659402856, 0.011811177551360994, 0.1617372583266048, 0.023237974564919526, 0.011128735426149663, 0.15950824926411947, 0.1550993261973898, 0.03196119534483329, 0.1324611550294687, -0.12267028160350418, -0.08368218156252184, -0.29789070091939573, -0.12102145296066529, -0.12435205966159273, 0.010239266304047671, -0.09451764136468845, -0.16740598974765503, 0.37734084124623357, 0.24105940140708854, 0.1474617409664367, 0.0828946806668055, 0.2938559511729955, 0.05879169513589178, 0.044727396385475925, 0.0836473566830565, 0.2084833280686503, 0.07412328543649965, 0.04052956120496423, -0.2378398888120856, 0.16047524579736436, 0.03826747153318305]
|
1,803.09016
|
An improved DNN-based spectral feature mapping that removes noise and
reverberation for robust automatic speech recognition
|
Reverberation and additive noise have detrimental effects on the performance
of automatic speech recognition systems. In this paper we explore the ability
of a DNN-based spectral feature mapping to remove the effects of reverberation
and additive noise. Experiments with the CHiME-2 database show that this DNN
can achieve an average reduction in WER of 4.5%, when compared to the baseline
system, at SNRs equal to -6 dB, -3 dB, 0 dB and 3 dB, and just 0.8% at greater
SNRs of 6 dB and 9 dB. These results suggest that this DNN is more effective in
removing additive noise than reverberation. To improve the DNN performance, we
combine it with the weighted prediction error (WPE) method that shows a
complementary behavior. While this combination provided a reduction in WER of
approximately 11% when compared with the baseline, the observed improvement is
not as great as that obtained using WPE alone. However, modifications to the
DNN training process were applied and an average reduction in WER equal to
18.3% was achieved when compared with the baseline system. Furthermore, the
improved DNN combined with WPE achieves a reduction in WER of 7.9% when
compared with WPE alone.
|
eess.AS cs.SD
|
reverberation and additive noise have detrimental effects on the performance of automatic speech recognition systems in this paper we explore the ability of a dnnbased spectral feature mapping to remove the effects of reverberation and additive noise experiments with the chime2 database show that this dnn can achieve an average reduction in wer of 45 when compared to the baseline system at snrs equal to 6 db 3 db 0 db and 3 db and just 08 at greater snrs of 6 db and 9 db these results suggest that this dnn is more effective in removing additive noise than reverberation to improve the dnn performance we combine it with the weighted prediction error wpe method that shows a complementary behavior while this combination provided a reduction in wer of approximately 11 when compared with the baseline the observed improvement is not as great as that obtained using wpe alone however modifications to the dnn training process were applied and an average reduction in wer equal to 183 was achieved when compared with the baseline system furthermore the improved dnn combined with wpe achieves a reduction in wer of 79 when compared with wpe alone
|
[['reverberation', 'and', 'additive', 'noise', 'have', 'detrimental', 'effects', 'on', 'the', 'performance', 'of', 'automatic', 'speech', 'recognition', 'systems', 'in', 'this', 'paper', 'we', 'explore', 'the', 'ability', 'of', 'a', 'dnnbased', 'spectral', 'feature', 'mapping', 'to', 'remove', 'the', 'effects', 'of', 'reverberation', 'and', 'additive', 'noise', 'experiments', 'with', 'the', 'chime2', 'database', 'show', 'that', 'this', 'dnn', 'can', 'achieve', 'an', 'average', 'reduction', 'in', 'wer', 'of', '45', 'when', 'compared', 'to', 'the', 'baseline', 'system', 'at', 'snrs', 'equal', 'to', '6', 'db', '3', 'db', '0', 'db', 'and', '3', 'db', 'and', 'just', '08', 'at', 'greater', 'snrs', 'of', '6', 'db', 'and', '9', 'db', 'these', 'results', 'suggest', 'that', 'this', 'dnn', 'is', 'more', 'effective', 'in', 'removing', 'additive', 'noise', 'than', 'reverberation', 'to', 'improve', 'the', 'dnn', 'performance', 'we', 'combine', 'it', 'with', 'the', 'weighted', 'prediction', 'error', 'wpe', 'method', 'that', 'shows', 'a', 'complementary', 'behavior', 'while', 'this', 'combination', 'provided', 'a', 'reduction', 'in', 'wer', 'of', 'approximately', '11', 'when', 'compared', 'with', 'the', 'baseline', 'the', 'observed', 'improvement', 'is', 'not', 'as', 'great', 'as', 'that', 'obtained', 'using', 'wpe', 'alone', 'however', 'modifications', 'to', 'the', 'dnn', 'training', 'process', 'were', 'applied', 'and', 'an', 'average', 'reduction', 'in', 'wer', 'equal', 'to', '183', 'was', 'achieved', 'when', 'compared', 'with', 'the', 'baseline', 'system', 'furthermore', 'the', 'improved', 'dnn', 'combined', 'with', 'wpe', 'achieves', 'a', 'reduction', 'in', 'wer', 'of', '79', 'when', 'compared', 'with', 'wpe', 'alone']]
|
[-0.02454172944549241, 0.0015818831697166369, -0.017930250590878355, 0.044608982909126425, 0.005543442106968963, -0.16135892541791053, 0.10584416516310026, 0.4104003713816673, -0.20395884387310326, -0.3529310817965282, 0.09375739688192945, -0.29319083765533166, -0.13650124086686363, 0.23034085322365874, -0.14966756482752636, 0.03993299581379313, 0.13041822159826064, 0.029660843142317896, -0.1238917854912195, -0.33754884285045805, 0.2137178052792844, 0.1318852319382131, 0.3122283363253954, 0.003246497052873799, 0.1274707037547469, -0.06316284163100117, -0.03223718113275533, -0.004984869770513675, -0.037421657159695275, 0.10220426750926244, 0.255602120886288, 0.09042738417293109, 0.2546499735512531, -0.3170870993833643, -0.22861966662608163, 0.10050879563108932, 0.1440480463350787, 0.09467183483330072, 0.018098119029654646, -0.3001907068033482, 0.1703739564413668, -0.2124653943219059, -0.010464893687593261, -0.04430332565416111, -0.0012222537290804165, -0.008812237257010677, -0.31596098403139133, 0.09879420097655084, 0.12673494509978162, 0.1163447375226881, -0.04586679238307568, -0.2124821857282815, 0.04489990384930015, 0.12535461268601364, 0.02364700019810248, 0.11610958508285454, 0.11782301797773977, -0.1347094053167312, -0.125502893946328, 0.3670295296409695, -0.16958475197443665, -0.18859335387452053, 0.1880179687124706, -0.08828937417837147, -0.04836063210122748, 0.18666635361048825, 0.19733925394836294, 0.0149820045515242, -0.12672778762326115, -0.024256448788909223, 0.03910107180096939, 0.27344608470106246, 0.10865029710322167, 0.037736989145488814, 0.08129996044762894, 0.23317200874372088, 0.03029851412002151, 0.155028494100144, -0.18276565857159607, -0.008406382418938518, -0.1992896056935652, -0.0801434167084697, -0.13996849090614616, 0.08283439008454545, -0.13598284715520742, -0.07287195923776586, 0.3464151374592455, 0.20393256824667633, 0.1807286360435495, 0.11811697258873238, 0.32668972552331527, 0.09543111215503983, 0.09748177225516237, 0.09543052662797656, 0.2840520222161263, 0.061010441633623055, 0.08030691067118093, -0.22127136158920133, 0.02913812128106881, -0.04047364797731189]
|
1,803.09017
|
Style Tokens: Unsupervised Style Modeling, Control and Transfer in
End-to-End Speech Synthesis
|
In this work, we propose "global style tokens" (GSTs), a bank of embeddings
that are jointly trained within Tacotron, a state-of-the-art end-to-end speech
synthesis system. The embeddings are trained with no explicit labels, yet learn
to model a large range of acoustic expressiveness. GSTs lead to a rich set of
significant results. The soft interpretable "labels" they generate can be used
to control synthesis in novel ways, such as varying speed and speaking style -
independently of the text content. They can also be used for style transfer,
replicating the speaking style of a single audio clip across an entire
long-form text corpus. When trained on noisy, unlabeled found data, GSTs learn
to factorize noise and speaker identity, providing a path towards highly
scalable but robust speech synthesis.
|
cs.CL cs.LG cs.SD eess.AS
|
in this work we propose global style tokens gsts a bank of embeddings that are jointly trained within tacotron a stateoftheart endtoend speech synthesis system the embeddings are trained with no explicit labels yet learn to model a large range of acoustic expressiveness gsts lead to a rich set of significant results the soft interpretable labels they generate can be used to control synthesis in novel ways such as varying speed and speaking style independently of the text content they can also be used for style transfer replicating the speaking style of a single audio clip across an entire longform text corpus when trained on noisy unlabeled found data gsts learn to factorize noise and speaker identity providing a path towards highly scalable but robust speech synthesis
|
[['in', 'this', 'work', 'we', 'propose', 'global', 'style', 'tokens', 'gsts', 'a', 'bank', 'of', 'embeddings', 'that', 'are', 'jointly', 'trained', 'within', 'tacotron', 'a', 'stateoftheart', 'endtoend', 'speech', 'synthesis', 'system', 'the', 'embeddings', 'are', 'trained', 'with', 'no', 'explicit', 'labels', 'yet', 'learn', 'to', 'model', 'a', 'large', 'range', 'of', 'acoustic', 'expressiveness', 'gsts', 'lead', 'to', 'a', 'rich', 'set', 'of', 'significant', 'results', 'the', 'soft', 'interpretable', 'labels', 'they', 'generate', 'can', 'be', 'used', 'to', 'control', 'synthesis', 'in', 'novel', 'ways', 'such', 'as', 'varying', 'speed', 'and', 'speaking', 'style', 'independently', 'of', 'the', 'text', 'content', 'they', 'can', 'also', 'be', 'used', 'for', 'style', 'transfer', 'replicating', 'the', 'speaking', 'style', 'of', 'a', 'single', 'audio', 'clip', 'across', 'an', 'entire', 'longform', 'text', 'corpus', 'when', 'trained', 'on', 'noisy', 'unlabeled', 'found', 'data', 'gsts', 'learn', 'to', 'factorize', 'noise', 'and', 'speaker', 'identity', 'providing', 'a', 'path', 'towards', 'highly', 'scalable', 'but', 'robust', 'speech', 'synthesis']]
|
[-0.018559466826080485, 0.039375254731395234, -0.06035177881726775, 0.10173135052350768, -0.1775728046791408, -0.2040124492881101, 0.037027832490069364, 0.48740353095015204, -0.3239555175078842, -0.337224386439028, 0.03721626192939974, -0.2689336134692815, -0.13442005094930926, 0.20113506123944236, -0.17675258220108622, 0.04823681099640983, 0.12843619505544818, 0.04712261416304006, -0.03657954992491781, -0.2578083313048238, 0.26696799235880436, -0.008611121359757903, 0.34330069358775933, -0.04249277368818564, 0.16192664807812698, -0.051128749792944406, -0.025360644956332022, -0.04178867142695171, -0.012739744387838831, 0.20012663550469584, 0.41364976212264987, 0.21655876973761232, 0.27916268497984126, -0.3969710383006907, -0.1863291935012566, 0.07737031143422671, 0.14914366489965616, 0.16217894669196856, -0.061212618436525014, -0.37349941697352984, 0.10720606888351067, -0.18580613097571952, 0.0734993202582471, -0.15596153937632173, -0.010620668244467476, -0.011016762606876602, -0.2880964174529347, 0.001863010509781114, 0.12650075280309223, 0.049786742952630275, -0.03749251616642055, -0.0777899103017348, -0.022212314762277748, 0.22033280995789015, 0.006002551295765214, 0.08926098883210674, 0.14069878745926764, -0.16647054692757807, -0.1043854029445843, 0.35173984275632136, -0.09975667652219358, -0.2625076393532662, 0.18506030409824192, 0.02576289928378904, -0.13572908745799947, 0.11794862602140725, 0.2524333578116429, 0.09776346654975861, -0.21058691174855665, -0.025698323672688678, -0.07029021507693733, 0.29481994797380306, 0.10016998906223852, -0.005523602493789311, 0.21671188073893907, 0.22108461218519415, -0.01821554529913298, 0.15151613804797723, -0.05391097503510766, -0.016705490076753097, -0.1912280816628825, -0.07575690579659299, -0.17775847075331047, -0.004573415645845528, -0.11112993052499699, -0.17737923708939596, 0.4000587135656025, 0.22228961924318313, 0.22273869531556384, 0.15533734681098502, 0.30046640966439575, 0.02937851220520129, 0.11156722740453529, 0.07951087532491666, 0.11788766763189544, -0.03439997566687897, 0.1552341245811462, -0.11385323327240043, 0.13788739385405982, 0.03307400404761626]
|
1,803.09018
|
The Importance of Constraint Smoothness for Parameter Estimation in
Computational Cognitive Modeling
|
Psychiatric neuroscience is increasingly aware of the need to define
psychopathology in terms of abnormal neural computation. The central tool in
this endeavour is the fitting of computational models to behavioural data. The
most prominent example of this procedure is fitting reinforcement learning (RL)
models to decision-making data collected from mentally ill and healthy subject
populations. These models are generative models of the decision-making data
themselves, and the parameters we seek to infer can be psychologically and
neurobiologically meaningful. Currently, the gold standard approach to this
inference procedure involves Monte-Carlo sampling, which is robust but
computationally intensive---rendering additional procedures, such as
cross-validation, impractical. Searching for point estimates of model
parameters using optimization procedures remains a popular and interesting
option. On a novel testbed simulating parameter estimation from a common RL
task, we investigated the effects of smooth vs. boundary constraints on
parameter estimation using interior point and deterministic direct search
algorithms for optimization. Ultimately, we show that the use of boundary
constraints can lead to substantial truncation effects. Our results discourage
the use of boundary constraints for these applications.
|
q-bio.QM cs.LG q-bio.NC stat.ML
|
psychiatric neuroscience is increasingly aware of the need to define psychopathology in terms of abnormal neural computation the central tool in this endeavour is the fitting of computational models to behavioural data the most prominent example of this procedure is fitting reinforcement learning rl models to decisionmaking data collected from mentally ill and healthy subject populations these models are generative models of the decisionmaking data themselves and the parameters we seek to infer can be psychologically and neurobiologically meaningful currently the gold standard approach to this inference procedure involves montecarlo sampling which is robust but computationally intensiverendering additional procedures such as crossvalidation impractical searching for point estimates of model parameters using optimization procedures remains a popular and interesting option on a novel testbed simulating parameter estimation from a common rl task we investigated the effects of smooth vs boundary constraints on parameter estimation using interior point and deterministic direct search algorithms for optimization ultimately we show that the use of boundary constraints can lead to substantial truncation effects our results discourage the use of boundary constraints for these applications
|
[['psychiatric', 'neuroscience', 'is', 'increasingly', 'aware', 'of', 'the', 'need', 'to', 'define', 'psychopathology', 'in', 'terms', 'of', 'abnormal', 'neural', 'computation', 'the', 'central', 'tool', 'in', 'this', 'endeavour', 'is', 'the', 'fitting', 'of', 'computational', 'models', 'to', 'behavioural', 'data', 'the', 'most', 'prominent', 'example', 'of', 'this', 'procedure', 'is', 'fitting', 'reinforcement', 'learning', 'rl', 'models', 'to', 'decisionmaking', 'data', 'collected', 'from', 'mentally', 'ill', 'and', 'healthy', 'subject', 'populations', 'these', 'models', 'are', 'generative', 'models', 'of', 'the', 'decisionmaking', 'data', 'themselves', 'and', 'the', 'parameters', 'we', 'seek', 'to', 'infer', 'can', 'be', 'psychologically', 'and', 'neurobiologically', 'meaningful', 'currently', 'the', 'gold', 'standard', 'approach', 'to', 'this', 'inference', 'procedure', 'involves', 'montecarlo', 'sampling', 'which', 'is', 'robust', 'but', 'computationally', 'intensiverendering', 'additional', 'procedures', 'such', 'as', 'crossvalidation', 'impractical', 'searching', 'for', 'point', 'estimates', 'of', 'model', 'parameters', 'using', 'optimization', 'procedures', 'remains', 'a', 'popular', 'and', 'interesting', 'option', 'on', 'a', 'novel', 'testbed', 'simulating', 'parameter', 'estimation', 'from', 'a', 'common', 'rl', 'task', 'we', 'investigated', 'the', 'effects', 'of', 'smooth', 'vs', 'boundary', 'constraints', 'on', 'parameter', 'estimation', 'using', 'interior', 'point', 'and', 'deterministic', 'direct', 'search', 'algorithms', 'for', 'optimization', 'ultimately', 'we', 'show', 'that', 'the', 'use', 'of', 'boundary', 'constraints', 'can', 'lead', 'to', 'substantial', 'truncation', 'effects', 'our', 'results', 'discourage', 'the', 'use', 'of', 'boundary', 'constraints', 'for', 'these', 'applications']]
|
[-0.03709051071462127, 0.019097731071995215, -0.10841984210406388, 0.12691277764368739, -0.14566773323739848, -0.18918964748608938, 0.08251950865757934, 0.40908264778973014, -0.27156866273615154, -0.3578631073089965, 0.14921230417964038, -0.23680285921351713, -0.17569223383776425, 0.20699454952565052, -0.12156051276706217, 0.105368323096341, 0.10276525000926484, -0.016478620534972024, -0.04716335217536458, -0.21894748449283705, 0.28559052834242815, 0.05253860854878603, 0.2931669434255219, -0.0028512178451932046, 0.08136333914313745, -0.0066190648881530156, -0.05570177596031029, 0.0006736781006009224, -0.12788774614671822, 0.15857911854982376, 0.3323166983715014, 0.20600322919657058, 0.3381579986726342, -0.42370015456016813, -0.22715352122996296, 0.14731333570638566, 0.1461048964855753, 0.1149054822790583, -0.029028093208182143, -0.2838538998968146, 0.03438564324018995, -0.1464828820061985, -0.061858436131321436, -0.1372926258691325, -0.02808273105693751, -0.02546873152402512, -0.32821795572507134, 0.06161039174283237, 0.011481989659055064, 0.06478388935230735, -0.05722795555164012, -0.12748756215991347, 0.013503511599788253, 0.1358375587432614, 0.07985113895683957, 0.004571792261486643, 0.1590357164779071, -0.17338026352252894, -0.1426007285415917, 0.35568767263988305, 0.011585440947098678, -0.20519304304027908, 0.2194770958629081, -0.028546898406040803, -0.16474168391615737, 0.06962987719420238, 0.21965061967114635, 0.13177283622031466, -0.2026900628194464, 0.04872917575242385, -0.00012552079004287886, 0.1538694802638316, -0.023271440138538064, -0.03566578319139276, 0.18343976548914745, 0.23849117453210056, 0.0464176658640375, 0.10738098862962903, -0.10176543983384925, -0.10806515707184425, -0.2710085847870227, -0.09092169100277418, -0.13967568049824725, 0.005675831328282196, -0.12421939483579847, -0.17297489466302599, 0.3429356184467579, 0.23840289269269868, 0.17104532839625738, 0.05301335223183936, 0.3362395077043872, 0.09659624674057933, 0.08611869626924437, 0.06418853422876689, 0.19398522108801106, 0.046652961776754036, 0.05974661218515189, -0.18837943397072573, 0.1274841148223142, 0.008282080277005274]
|
1,803.09019
|
Optimal Policies for the Sequential Stochastic Threshold Assignment
Problem
|
The Stochastic Sequential Threshold Assignment Problem (SSTAP) addresses the
optimal assignment of arriving tasks (jobs) to available resources (workers) to
maximize a reward function which consists of indicator functions that
incorporate threshold constraints. We present an optimal assignment policy for
SSTAP, independent of the probability distribution of the job values and of the
number of arriving jobs. We show through an example that this type of reward
function can model aviation security problems. We analyze the performance
limitations of systems that use the SSTAP optimal assignment policy. Finally,
we study the multiple levels SSTAP and the SSTAP with uncertainties in workers
performance rates.
|
math.OC
|
the stochastic sequential threshold assignment problem sstap addresses the optimal assignment of arriving tasks jobs to available resources workers to maximize a reward function which consists of indicator functions that incorporate threshold constraints we present an optimal assignment policy for sstap independent of the probability distribution of the job values and of the number of arriving jobs we show through an example that this type of reward function can model aviation security problems we analyze the performance limitations of systems that use the sstap optimal assignment policy finally we study the multiple levels sstap and the sstap with uncertainties in workers performance rates
|
[['the', 'stochastic', 'sequential', 'threshold', 'assignment', 'problem', 'sstap', 'addresses', 'the', 'optimal', 'assignment', 'of', 'arriving', 'tasks', 'jobs', 'to', 'available', 'resources', 'workers', 'to', 'maximize', 'a', 'reward', 'function', 'which', 'consists', 'of', 'indicator', 'functions', 'that', 'incorporate', 'threshold', 'constraints', 'we', 'present', 'an', 'optimal', 'assignment', 'policy', 'for', 'sstap', 'independent', 'of', 'the', 'probability', 'distribution', 'of', 'the', 'job', 'values', 'and', 'of', 'the', 'number', 'of', 'arriving', 'jobs', 'we', 'show', 'through', 'an', 'example', 'that', 'this', 'type', 'of', 'reward', 'function', 'can', 'model', 'aviation', 'security', 'problems', 'we', 'analyze', 'the', 'performance', 'limitations', 'of', 'systems', 'that', 'use', 'the', 'sstap', 'optimal', 'assignment', 'policy', 'finally', 'we', 'study', 'the', 'multiple', 'levels', 'sstap', 'and', 'the', 'sstap', 'with', 'uncertainties', 'in', 'workers', 'performance', 'rates']]
|
[-0.1612314468620399, 0.023650064877091988, -0.05848897748527307, 0.07076560439501248, -0.10106325880127046, -0.13029086140879584, 0.19436378307523006, 0.41644877423215837, -0.28808290594555797, -0.3477150322326902, 0.07916255532515244, -0.25342602916604395, -0.12021401989300853, 0.12874542653913276, -0.13366213996297888, 0.12230637234997895, 0.09821502990496245, 0.05157202052277992, 0.0053055375990756215, -0.293594169693782, 0.3064895896783587, 0.07774961928755623, 0.32647627477253816, 0.025838554617824503, 0.11380914891663108, 0.03667007586511883, 0.012267430353620387, -0.028308964171672907, -0.12902742920513208, 0.08007625718397604, 0.31153619354500356, 0.2527052439026307, 0.3918411358377164, -0.38155403093082235, -0.13591636946533345, 0.14373203647295826, 0.09938284535909261, 0.04369726992614603, -0.008751165144398663, -0.22040653882267913, 0.08588669310748867, -0.18290241671165505, -0.043691240621784935, 0.0046615711395239946, -0.030801714402487846, 0.07579480393482282, -0.3697334607448248, 0.02139584872943973, -0.03337852788853993, -0.0030134259497077718, -0.12304029840234558, -0.17245888126589068, 0.04899631259800161, 0.19698354276349245, 0.0843017054868645, -0.015403644559290079, 0.16807473162008288, -0.15932395186465126, -0.20731452875092482, 0.36116962240629114, -0.007258397349025331, -0.1984219912041738, 0.09623961321539382, -0.0496310878508878, -0.16405452894571337, 0.09962744386165936, 0.24954605314121084, 0.11557115554737235, -0.17729071167849222, 0.0073548720062267285, -0.05135526463561194, 0.17294576994450853, 0.025369764581431174, 0.04358010191144874, 0.12219721867784279, 0.1650730011966622, 0.13817787951636082, 0.16858891240158344, -0.02731779519721721, -0.11134321542538124, -0.28096590388297255, -0.11690836860029732, -0.16198333579983598, 0.008012821712504023, -0.08305315954076099, -0.11312923971021059, 0.3812531958903792, 0.20993437095391518, 0.1779218519703277, 0.15552164889867554, 0.3212890680336836, 0.16656654561390577, 0.0033180541675356984, 0.13960787909358596, 0.12324738138111181, -0.009743533938675577, 0.07551160793371715, -0.2682337455352027, 0.133192240378087, -0.0034465322709524805]
|
1,803.0902
|
Schooling Choice, Labour Market Matching, and Wages
|
We develop inference for a two-sided matching model where the characteristics
of agents on one side of the market are endogenous due to pre-matching
investments. The model can be used to measure the impact of frictions in labour
markets using a single cross-section of matched employer-employee data. The
observed matching of workers to firms is the outcome of a discrete, two-sided
matching process where firms with heterogeneous preferences over education
sequentially choose workers according to an index correlated with worker
preferences over firms. The distribution of education arises in equilibrium
from a Bayesian game: workers, knowing the distribution of worker and firm
types, invest in education prior to the matching process. Although the observed
matching exhibits strong cross-sectional dependence due to the matching
process, we propose an asymptotically valid inference procedure that combines
discrete choice methods with simulation.
|
econ.EM
|
we develop inference for a twosided matching model where the characteristics of agents on one side of the market are endogenous due to prematching investments the model can be used to measure the impact of frictions in labour markets using a single crosssection of matched employeremployee data the observed matching of workers to firms is the outcome of a discrete twosided matching process where firms with heterogeneous preferences over education sequentially choose workers according to an index correlated with worker preferences over firms the distribution of education arises in equilibrium from a bayesian game workers knowing the distribution of worker and firm types invest in education prior to the matching process although the observed matching exhibits strong crosssectional dependence due to the matching process we propose an asymptotically valid inference procedure that combines discrete choice methods with simulation
|
[['we', 'develop', 'inference', 'for', 'a', 'twosided', 'matching', 'model', 'where', 'the', 'characteristics', 'of', 'agents', 'on', 'one', 'side', 'of', 'the', 'market', 'are', 'endogenous', 'due', 'to', 'prematching', 'investments', 'the', 'model', 'can', 'be', 'used', 'to', 'measure', 'the', 'impact', 'of', 'frictions', 'in', 'labour', 'markets', 'using', 'a', 'single', 'crosssection', 'of', 'matched', 'employeremployee', 'data', 'the', 'observed', 'matching', 'of', 'workers', 'to', 'firms', 'is', 'the', 'outcome', 'of', 'a', 'discrete', 'twosided', 'matching', 'process', 'where', 'firms', 'with', 'heterogeneous', 'preferences', 'over', 'education', 'sequentially', 'choose', 'workers', 'according', 'to', 'an', 'index', 'correlated', 'with', 'worker', 'preferences', 'over', 'firms', 'the', 'distribution', 'of', 'education', 'arises', 'in', 'equilibrium', 'from', 'a', 'bayesian', 'game', 'workers', 'knowing', 'the', 'distribution', 'of', 'worker', 'and', 'firm', 'types', 'invest', 'in', 'education', 'prior', 'to', 'the', 'matching', 'process', 'although', 'the', 'observed', 'matching', 'exhibits', 'strong', 'crosssectional', 'dependence', 'due', 'to', 'the', 'matching', 'process', 'we', 'propose', 'an', 'asymptotically', 'valid', 'inference', 'procedure', 'that', 'combines', 'discrete', 'choice', 'methods', 'with', 'simulation']]
|
[-0.04239552624836934, 0.04826147797682685, -0.12614590565413786, 0.08002774701311169, -0.1290651032451184, -0.15992823126511854, 0.14123672385261776, 0.4245886275106493, -0.2782845928141957, -0.3310932598063065, 0.08590611385657479, -0.28725207295707045, -0.07134578633122146, 0.10564185357447166, -0.1510054195224417, 0.018568681683117413, 0.0398854081696995, 0.04896859206457842, 0.07310342210899655, -0.29575493718627566, 0.2919816729331882, 0.06624881098019507, 0.3537112015080364, -0.020516069010174012, 0.11919300498608637, 0.03925741561483044, -0.061979928173754806, 0.013791776503132817, -0.13095285205080848, 0.15222595726406915, 0.2949165101899245, 0.14200017063344336, 0.3803119517534095, -0.4298932747983867, -0.13033960818532198, 0.13981904828345731, 0.09293262288316756, 0.042652365926187485, 0.02247801762988435, -0.2524479155784802, 0.02899876017096069, -0.22203097605447777, -0.06082347974520149, -0.033190843498553425, -0.025146976469413322, 0.006129246383138439, -0.38602191447417306, 0.047596291419776046, -0.010099312537075841, 0.05612177102525225, -0.05752173393985311, -0.09772047870929408, -0.0262269100999487, 0.19756254612687318, 0.10600459892991827, -0.04620097652214634, 0.155732148566612, -0.165265753694043, -0.20629776189418728, 0.3929811847560546, -0.029452193713308695, -0.18065900910262236, 0.14829058962298886, -0.1267005420248846, -0.12136876017971457, 0.09453194110435159, 0.2274498506269404, 0.06907186112520695, -0.159985052428537, 0.03499291230785756, -0.050919190360325634, 0.18662250043331263, 0.0572242397825261, -0.04192981934380334, 0.2046821546905181, 0.1901722014282474, 0.11314185986103599, 0.10888197518772144, -0.03001138656434384, -0.17298553797402694, -0.23303784624509075, -0.09998392326558721, -0.1671432651757427, 0.01701717887601048, -0.1465919085585483, -0.20623113957973307, 0.35404600516331436, 0.1602693057160222, 0.1579242918010363, 0.08302106366232585, 0.2836665082791382, 0.11295268640456282, 0.029878335173741694, 0.1038123881615534, 0.1335241481394726, 0.03149822604267255, 0.1065280645082513, -0.16846716573276996, 0.21581021282198729, -0.027907475960519686]
|
1,803.09021
|
On Large-Scale Graph Generation with Validation of Diverse Triangle
Statistics at Edges and Vertices
|
Researchers developing implementations of distributed graph analytic
algorithms require graph generators that yield graphs sharing the challenging
characteristics of real-world graphs (small-world, scale-free, heavy-tailed
degree distribution) with efficiently calculable ground-truth solutions to the
desired output. Reproducibility for current generators used in benchmarking are
somewhat lacking in this respect due to their randomness: the output of a
desired graph analytic can only be compared to expected values and not exact
ground truth. Nonstochastic Kronecker product graphs meet these design criteria
for several graph analytics. Here we show that many flavors of triangle
participation can be cheaply calculated while generating a Kronecker product
graph. Given two medium-sized scale-free graphs with adjacency matrices $A$ and
$B$, their Kronecker product graph has adjacency matrix $C = A \otimes B$. Such
graphs are highly compressible: $|{\cal E}|$ edges are represented in ${\cal
O}(|{\cal E}|^{1/2})$ memory and can be built in a distributed setting from
small data structures, making them easy to share in compressed form. Many
interesting graph calculations have worst-case complexity bounds ${\cal
O}(|{\cal E}|^p)$ and often these are reduced to ${\cal O}(|{\cal E}|^{p/2})$
for Kronecker product graphs, when a Kronecker formula can be derived yielding
the sought calculation on $C$ in terms of related calculations on $A$ and $B$.
We focus on deriving formulas for triangle participation at vertices, ${\bf
t}_C$, a vector storing the number of triangles that every vertex is involved
in, and triangle participation at edges, $\Delta_C$, a sparse matrix storing
the number of triangles at every edge.
|
cs.DM cs.SI math.CO
|
researchers developing implementations of distributed graph analytic algorithms require graph generators that yield graphs sharing the challenging characteristics of realworld graphs smallworld scalefree heavytailed degree distribution with efficiently calculable groundtruth solutions to the desired output reproducibility for current generators used in benchmarking are somewhat lacking in this respect due to their randomness the output of a desired graph analytic can only be compared to expected values and not exact ground truth nonstochastic kronecker product graphs meet these design criteria for several graph analytics here we show that many flavors of triangle participation can be cheaply calculated while generating a kronecker product graph given two mediumsized scalefree graphs with adjacency matrices a and b their kronecker product graph has adjacency matrix c a otimes b such graphs are highly compressible cal e edges are represented in cal ocal e12 memory and can be built in a distributed setting from small data structures making them easy to share in compressed form many interesting graph calculations have worstcase complexity bounds cal ocal ep and often these are reduced to cal ocal ep2 for kronecker product graphs when a kronecker formula can be derived yielding the sought calculation on c in terms of related calculations on a and b we focus on deriving formulas for triangle participation at vertices bf t_c a vector storing the number of triangles that every vertex is involved in and triangle participation at edges delta_c a sparse matrix storing the number of triangles at every edge
|
[['researchers', 'developing', 'implementations', 'of', 'distributed', 'graph', 'analytic', 'algorithms', 'require', 'graph', 'generators', 'that', 'yield', 'graphs', 'sharing', 'the', 'challenging', 'characteristics', 'of', 'realworld', 'graphs', 'smallworld', 'scalefree', 'heavytailed', 'degree', 'distribution', 'with', 'efficiently', 'calculable', 'groundtruth', 'solutions', 'to', 'the', 'desired', 'output', 'reproducibility', 'for', 'current', 'generators', 'used', 'in', 'benchmarking', 'are', 'somewhat', 'lacking', 'in', 'this', 'respect', 'due', 'to', 'their', 'randomness', 'the', 'output', 'of', 'a', 'desired', 'graph', 'analytic', 'can', 'only', 'be', 'compared', 'to', 'expected', 'values', 'and', 'not', 'exact', 'ground', 'truth', 'nonstochastic', 'kronecker', 'product', 'graphs', 'meet', 'these', 'design', 'criteria', 'for', 'several', 'graph', 'analytics', 'here', 'we', 'show', 'that', 'many', 'flavors', 'of', 'triangle', 'participation', 'can', 'be', 'cheaply', 'calculated', 'while', 'generating', 'a', 'kronecker', 'product', 'graph', 'given', 'two', 'mediumsized', 'scalefree', 'graphs', 'with', 'adjacency', 'matrices', 'a', 'and', 'b', 'their', 'kronecker', 'product', 'graph', 'has', 'adjacency', 'matrix', 'c', 'a', 'otimes', 'b', 'such', 'graphs', 'are', 'highly', 'compressible', 'cal', 'e', 'edges', 'are', 'represented', 'in', 'cal', 'ocal', 'e12', 'memory', 'and', 'can', 'be', 'built', 'in', 'a', 'distributed', 'setting', 'from', 'small', 'data', 'structures', 'making', 'them', 'easy', 'to', 'share', 'in', 'compressed', 'form', 'many', 'interesting', 'graph', 'calculations', 'have', 'worstcase', 'complexity', 'bounds', 'cal', 'ocal', 'ep', 'and', 'often', 'these', 'are', 'reduced', 'to', 'cal', 'ocal', 'ep2', 'for', 'kronecker', 'product', 'graphs', 'when', 'a', 'kronecker', 'formula', 'can', 'be', 'derived', 'yielding', 'the', 'sought', 'calculation', 'on', 'c', 'in', 'terms', 'of', 'related', 'calculations', 'on', 'a', 'and', 'b', 'we', 'focus', 'on', 'deriving', 'formulas', 'for', 'triangle', 'participation', 'at', 'vertices', 'bf', 't_c', 'a', 'vector', 'storing', 'the', 'number', 'of', 'triangles', 'that', 'every', 'vertex', 'is', 'involved', 'in', 'and', 'triangle', 'participation', 'at', 'edges', 'delta_c', 'a', 'sparse', 'matrix', 'storing', 'the', 'number', 'of', 'triangles', 'at', 'every', 'edge']]
|
[-0.14466317020628133, 0.11981266483886974, -0.007388519304182366, 0.06908225564961039, -0.0970928520152745, -0.18603092060058646, 0.035973331304681805, 0.4248334108908408, -0.274244093189114, -0.30605198819730395, 0.10329048835761045, -0.3068980613595199, -0.14251466845595825, 0.12278414593617383, -0.08329945019377265, 0.09580815193552744, 0.13375357193551837, 0.0788366797964936, -0.04206132286733492, -0.24326542747404467, 0.25200867596335014, 0.00795070298189516, 0.23673989835700968, 0.04382206622496066, 0.017627628747777267, -0.0033971594693940435, -0.001787974423755277, 0.047633376985841136, -0.10705201250077616, 0.13563088434729498, 0.30929856956276575, 0.17236151124411056, 0.20717679624170487, -0.43263201549652064, -0.09896774796735087, 0.18270076376005162, 0.15063236256861523, 0.04673323207082385, 0.03143842945625697, -0.25677237307147577, 0.11905753350937325, -0.17857736258854504, -0.05003574257150956, -0.11668459087919429, 0.05305594965548779, -0.003890355513761054, -0.3176640572407196, -0.002117044814609685, 0.020215683594545886, 0.045326951044168125, 0.063254195041125, -0.19479852162211048, -0.03043935947433144, 0.11586467488228178, -0.026195794872294825, 0.016980644160417863, 0.10191523006043551, -0.12868481189265155, -0.15198744969161582, 0.3865094200259278, 0.022211685941671493, -0.19842661759789718, 0.11150546600431324, -0.1279584784791258, -0.19932020791930707, 0.10959968503813451, 0.17104487268391785, 0.0881150043343273, -0.10770760782880506, 0.12516754258825605, -0.06801575541895483, 0.12199328613923749, 0.11494541720125206, 0.0363994687119299, 0.12168002635738266, 0.10300005134854934, 0.08785425855632992, 0.1361402639900504, 0.04148059134074178, -0.05729308066256193, -0.2532904449556219, -0.10639993323772949, -0.26370263619627426, 0.0670359198745507, -0.22080428349309006, -0.21547608029593143, 0.39636418617307867, 0.09685843409631055, 0.2125507365791542, 0.11636370817304924, 0.24701884674447538, 0.08661376462442431, 0.0721057295208312, 0.16425157971783855, 0.11990209574705586, 0.1616032745346035, 0.06329012288724219, -0.13322612316619137, 0.10957880760825839, 0.09744902126404348]
|
1,803.09022
|
Controller Synthesis for Discrete-Time Polynomial Systems via Occupation
Measures
|
In this paper, we design nonlinear state feedback controllers for
discrete-time polynomial dynamical systems via the occupation measure approach.
We propose the discrete-time controlled Liouville equation, and use it to
formulate the controller synthesis problem as an infinite-dimensional linear
programming problem on measures, which is then relaxed as finite-dimensional
semidefinite programming problems on moments of measures and their duals on
sums-of-squares polynomials. Nonlinear controllers can be extracted from the
solutions to the relaxed problems. The advantage of the occupation measure
approach is that we solve convex problems instead of generally non-convex
problems, and the computational complexity is polynomial in the state and input
dimensions, and hence the approach is more scalable. In addition, we show that
the approach can be applied to over-approximating the backward reachable set of
discrete-time autonomous polynomial systems and the controllable set of
discrete-time polynomial systems under known state feedback control laws. We
illustrate our approach on several dynamical systems.
|
cs.SY cs.RO math.OC
|
in this paper we design nonlinear state feedback controllers for discretetime polynomial dynamical systems via the occupation measure approach we propose the discretetime controlled liouville equation and use it to formulate the controller synthesis problem as an infinitedimensional linear programming problem on measures which is then relaxed as finitedimensional semidefinite programming problems on moments of measures and their duals on sumsofsquares polynomials nonlinear controllers can be extracted from the solutions to the relaxed problems the advantage of the occupation measure approach is that we solve convex problems instead of generally nonconvex problems and the computational complexity is polynomial in the state and input dimensions and hence the approach is more scalable in addition we show that the approach can be applied to overapproximating the backward reachable set of discretetime autonomous polynomial systems and the controllable set of discretetime polynomial systems under known state feedback control laws we illustrate our approach on several dynamical systems
|
[['in', 'this', 'paper', 'we', 'design', 'nonlinear', 'state', 'feedback', 'controllers', 'for', 'discretetime', 'polynomial', 'dynamical', 'systems', 'via', 'the', 'occupation', 'measure', 'approach', 'we', 'propose', 'the', 'discretetime', 'controlled', 'liouville', 'equation', 'and', 'use', 'it', 'to', 'formulate', 'the', 'controller', 'synthesis', 'problem', 'as', 'an', 'infinitedimensional', 'linear', 'programming', 'problem', 'on', 'measures', 'which', 'is', 'then', 'relaxed', 'as', 'finitedimensional', 'semidefinite', 'programming', 'problems', 'on', 'moments', 'of', 'measures', 'and', 'their', 'duals', 'on', 'sumsofsquares', 'polynomials', 'nonlinear', 'controllers', 'can', 'be', 'extracted', 'from', 'the', 'solutions', 'to', 'the', 'relaxed', 'problems', 'the', 'advantage', 'of', 'the', 'occupation', 'measure', 'approach', 'is', 'that', 'we', 'solve', 'convex', 'problems', 'instead', 'of', 'generally', 'nonconvex', 'problems', 'and', 'the', 'computational', 'complexity', 'is', 'polynomial', 'in', 'the', 'state', 'and', 'input', 'dimensions', 'and', 'hence', 'the', 'approach', 'is', 'more', 'scalable', 'in', 'addition', 'we', 'show', 'that', 'the', 'approach', 'can', 'be', 'applied', 'to', 'overapproximating', 'the', 'backward', 'reachable', 'set', 'of', 'discretetime', 'autonomous', 'polynomial', 'systems', 'and', 'the', 'controllable', 'set', 'of', 'discretetime', 'polynomial', 'systems', 'under', 'known', 'state', 'feedback', 'control', 'laws', 'we', 'illustrate', 'our', 'approach', 'on', 'several', 'dynamical', 'systems']]
|
[-0.11072185389658243, 0.02420021194819884, -0.09576695129825649, 0.07131452174158388, -0.09444510755008208, -0.16829951800097553, 0.029537296703526776, 0.3513128557605306, -0.3906606240560869, -0.2545725046112746, 0.16545884384752504, -0.22381645452394452, -0.20016565452316207, 0.23616106015956634, -0.10167454050055572, 0.16516175259633425, 0.04669175778709159, -0.009026531381048745, -0.07717691057410042, -0.27853738858255667, 0.3321434158269413, -0.03448975657705556, 0.23718622123955616, -0.00937782836867823, 0.18517878587817313, -0.009943797253072262, 0.044264890465208075, 0.043320949791096054, -0.09855964995949762, 0.11209003506802845, 0.2975890270930219, 0.1820967634293166, 0.3229991428209348, -0.42028764884483505, -0.16952971720995455, 0.13276551206000511, 0.1324171539699937, 0.12695108454707743, -0.006905736721157816, -0.3038427084230806, 0.07867313663221219, -0.1456829891177257, -0.0885784960315599, -0.10591451326149286, -0.025550722032664466, 0.0093859398442779, -0.3044685654390555, 0.04771497857744818, 0.05392780119829884, 0.019646676456821815, -0.11101681176820988, -0.0897493504151073, 0.013586160435051016, 0.057422117723224614, -0.05040728933383505, -0.012125516718543776, 0.13198579397874993, -0.06609179140045912, -0.2038559091259278, 0.366561483779269, -0.002900287839311913, -0.30332798086251916, 0.19576330462322486, -0.07595504361337849, -0.15950475739127679, 0.07709983170830778, 0.2748168426741205, 0.1637249459548817, -0.16701994656718203, 0.11791163716577115, -0.06029881082789658, 0.17928465326957696, -5.542795482248842e-05, 0.031526965080070996, 0.13986981162414341, 0.1661780679767782, 0.1809582570114161, 0.18449429554907096, 0.05108184467202851, -0.16572926688316436, -0.2582398675345852, -0.10376289430038109, -0.18320421983983803, 0.01884715620718606, -0.09485378776704922, -0.13594901420980354, 0.36953297276170805, 0.1641551852407684, 0.11046172484344283, 0.1669182384503074, 0.3095861089645655, 0.2210655780820941, 1.8764083506539464e-05, 0.06900203811131757, 0.16460539393471674, 0.15520392491349153, 0.09278495864815671, -0.28002907254267484, 0.07343429166448677, 0.10462257367038688]
|
1,803.09023
|
Decomposing Heegaard splittings along separating incompressible surfaces
in 3-manifolds
|
In this paper, by putting a separating incompressible surface in a 3-manifold
into Morse position relative to the height function associated to a strongly
irreducible Heegaard splitting, we show that an incompressible subsurface of
the Heegaard splitting can be found, by decomposing the 3-manifold along the
separating surface. Further if the Heegaard surface is of Hempel distance at
least 4, then there is a pair of such subsurfaces on both sides of the given
separating surface. This gives a particularly simple hierarchy for the
3-manifold.
|
math.GT
|
in this paper by putting a separating incompressible surface in a 3manifold into morse position relative to the height function associated to a strongly irreducible heegaard splitting we show that an incompressible subsurface of the heegaard splitting can be found by decomposing the 3manifold along the separating surface further if the heegaard surface is of hempel distance at least 4 then there is a pair of such subsurfaces on both sides of the given separating surface this gives a particularly simple hierarchy for the 3manifold
|
[['in', 'this', 'paper', 'by', 'putting', 'a', 'separating', 'incompressible', 'surface', 'in', 'a', '3manifold', 'into', 'morse', 'position', 'relative', 'to', 'the', 'height', 'function', 'associated', 'to', 'a', 'strongly', 'irreducible', 'heegaard', 'splitting', 'we', 'show', 'that', 'an', 'incompressible', 'subsurface', 'of', 'the', 'heegaard', 'splitting', 'can', 'be', 'found', 'by', 'decomposing', 'the', '3manifold', 'along', 'the', 'separating', 'surface', 'further', 'if', 'the', 'heegaard', 'surface', 'is', 'of', 'hempel', 'distance', 'at', 'least', '4', 'then', 'there', 'is', 'a', 'pair', 'of', 'such', 'subsurfaces', 'on', 'both', 'sides', 'of', 'the', 'given', 'separating', 'surface', 'this', 'gives', 'a', 'particularly', 'simple', 'hierarchy', 'for', 'the', '3manifold']]
|
[-0.18704103643403333, 0.15288940822202302, -0.14389682604438242, 0.0470275913748671, -0.05603335184483405, -0.16926917204195085, -0.006812616228125989, 0.3397276985294679, -0.3445780613076161, -0.30404494171414304, 0.05021977601298953, -0.2509580854600405, -0.11614403776988826, 0.20073563587605295, -0.12863473109353116, -0.060430467232842656, 0.10406493724269025, 0.013194190250600086, -0.11264818036545288, -0.19591414196800222, 0.41541679685606675, -0.06825027745217085, 0.18170815383988048, 0.17517084420165596, 0.11077598951866521, -0.037543693935389026, 0.0422909769558293, 0.0732603598605184, -0.18008704281126162, 0.12407064459231847, 0.27932302680085686, 0.011644008847446565, 0.18286932641640305, -0.3639388854889309, -0.15243541030076277, 0.10950565377579016, 0.1472427289494697, 0.05117769304608159, -0.0585910124663154, -0.26647217823740316, 0.1030494692899725, -0.08329085760256823, -0.13639035995173104, 0.05127719820422285, 0.03452421518261818, -0.03325193084995536, -0.1442351797266918, -0.01951146197012242, 0.0849155599666547, 0.08636165503412485, -0.021212863708462787, -0.14226505035424933, -0.13210618246675415, 0.15054644564824068, 0.029805291964508155, 0.14065450976657518, 0.061503932471661006, -0.12176590066074448, -0.02717848814037793, 0.35546530605677296, -0.09862966233973994, -0.28860791262020086, 0.1953571266549475, -0.10338899277643684, -0.11089258353938075, 0.1992113749606206, 0.11497194654143908, 0.08216146745664232, -0.08322965777205193, 0.10972196961314801, -0.0813370072228067, 0.16317891160793163, 0.09746086827534087, -0.11369349826675128, 0.23198220912805376, 0.15143991252407432, 0.1733832702971995, 0.16423028440022952, -0.10430912165971035, -0.015173978040761807, -0.32443905532469647, -0.26043054135242366, -0.1849327978075427, 0.07782870987430215, -0.09779574187910732, -0.21464898425209172, 0.4095327761791208, -0.01954086056417402, 0.19242836789173237, 0.08778854102334556, 0.2856201224590597, 0.09847516167689772, 0.010972639786846497, 0.12057405865805991, 0.1698013678083525, 0.1663540224736447, -0.09245203978327267, -0.21637102704604758, 0.004885768884902491, 0.20604048176285097]
|
1,803.09024
|
Splitting the Raman beamsplitter
|
We present an atom interferometry technique in which the beamsplitter is
split into two separate operations. A microwave pulse first creates a
spin-state superposition, before optical adiabatic passage spatially separates
the arms of that superposition. Despite using a thermal atom sample in a small
($600 \, \mu$m) interferometry beam, this procedure delivers an efficiency of
$99\%$ per $\hbar k$ of momentum separation. Utilizing this efficiency, we
first demonstrate interferometry with up to $16\hbar k$ momentum splitting and
free-fall limited interrogation times. We then realize a single-source
gradiometer, in which two interferometers measuring a relative phase originate
from the same atomic wavefunction. Finally, we demonstrate a resonant
interferometer with over 100 adiabatic passages, and thus over $ 400 \hbar k$
total momentum transferred.
|
physics.atom-ph
|
we present an atom interferometry technique in which the beamsplitter is split into two separate operations a microwave pulse first creates a spinstate superposition before optical adiabatic passage spatially separates the arms of that superposition despite using a thermal atom sample in a small 600 mum interferometry beam this procedure delivers an efficiency of 99 per hbar k of momentum separation utilizing this efficiency we first demonstrate interferometry with up to 16hbar k momentum splitting and freefall limited interrogation times we then realize a singlesource gradiometer in which two interferometers measuring a relative phase originate from the same atomic wavefunction finally we demonstrate a resonant interferometer with over 100 adiabatic passages and thus over 400 hbar k total momentum transferred
|
[['we', 'present', 'an', 'atom', 'interferometry', 'technique', 'in', 'which', 'the', 'beamsplitter', 'is', 'split', 'into', 'two', 'separate', 'operations', 'a', 'microwave', 'pulse', 'first', 'creates', 'a', 'spinstate', 'superposition', 'before', 'optical', 'adiabatic', 'passage', 'spatially', 'separates', 'the', 'arms', 'of', 'that', 'superposition', 'despite', 'using', 'a', 'thermal', 'atom', 'sample', 'in', 'a', 'small', '600', 'mum', 'interferometry', 'beam', 'this', 'procedure', 'delivers', 'an', 'efficiency', 'of', '99', 'per', 'hbar', 'k', 'of', 'momentum', 'separation', 'utilizing', 'this', 'efficiency', 'we', 'first', 'demonstrate', 'interferometry', 'with', 'up', 'to', '16hbar', 'k', 'momentum', 'splitting', 'and', 'freefall', 'limited', 'interrogation', 'times', 'we', 'then', 'realize', 'a', 'singlesource', 'gradiometer', 'in', 'which', 'two', 'interferometers', 'measuring', 'a', 'relative', 'phase', 'originate', 'from', 'the', 'same', 'atomic', 'wavefunction', 'finally', 'we', 'demonstrate', 'a', 'resonant', 'interferometer', 'with', 'over', '100', 'adiabatic', 'passages', 'and', 'thus', 'over', '400', 'hbar', 'k', 'total', 'momentum', 'transferred']]
|
[-0.1763401801038223, 0.22694087285611506, -0.0927525954049391, -0.027877201668646497, 0.01726346944148342, -0.13817150947870688, 0.1125843119516503, 0.4320488944494476, -0.2786071578816821, -0.32746008126220355, -0.023674014073912987, -0.23591605508117935, 0.008283793918477993, 0.21019907179288566, 0.013263993564760313, 0.0026890490281706054, 0.07908402880420909, -0.0379524710898598, -0.0809606343798805, -0.17343496312290274, 0.24197468487739873, 0.07032420318379688, 0.25807515423900135, 0.01816435418149922, 0.17402527732871628, -0.006380538135999814, 0.019348578713834285, -0.04831713789996381, -0.08399164098306452, 0.04452478204232951, 0.23697289423823045, 0.07968223170222094, 0.2660177917374919, -0.4106758757724189, -0.1641103092476745, 0.055794582966094214, 0.15633715696749279, 0.15065352338327406, -0.011029222266127665, -0.28251080741174517, -0.021119705533298352, -0.1859639482426701, -0.08199503772193566, -0.052579872154941164, 0.04362606157859166, -0.01550884567356358, -0.2223076102556661, 0.06167809080410128, 0.027992491440879046, 0.03230649648079028, -0.02951881444702546, -0.07165212601539679, 0.05271809191908687, 0.021518195626170685, -0.09503727346697512, 0.07455195209477097, 0.1558729355301087, -0.03526200921817993, -0.10292455459129997, 0.3705186088811994, -0.13146540808423499, -0.07192757234442979, 0.12469841092048833, -0.16975686315757532, -0.040200678488084424, 0.182606844214024, 0.12291183965426171, 0.16127672434280005, -0.10507243775452177, -0.014750258854473942, 0.012895985230958711, 0.24747412757424173, 0.21297909100928034, 0.1059298798480692, 0.24201848400601497, 0.1580828312629213, 0.07782435555321475, 0.1884791093063541, -0.2191490568841497, -0.08577467616996728, -0.2768667780503165, -0.14469886060008624, -0.22042400575786208, 0.09454111598606688, -0.06998821329301184, -0.05711959686207895, 0.3716409627891456, 0.14699000387918204, 0.22355213530827314, -0.018177877061922722, 0.39638091299372413, 0.11057470283897904, 0.0798100062374336, 0.05398485558107495, 0.26360548376105725, 0.1597228692189674, 0.0712945398632049, -0.25605908143140066, -0.06899174241504322, -0.021957454329822212]
|
1,803.09025
|
Realtime Time Synchronized Event-based Stereo
|
In this work, we propose a novel event based stereo method which addresses
the problem of motion blur for a moving event camera. Our method uses the
velocity of the camera and a range of disparities to synchronize the positions
of the events, as if they were captured at a single point in time. We represent
these events using a pair of novel time synchronized event disparity volumes,
which we show remove motion blur for pixels at the correct disparity in the
volume, while further blurring pixels at the wrong disparity. We then apply a
novel matching cost over these time synchronized event disparity volumes, which
both rewards similarity between the volumes while penalizing blurriness. We
show that our method outperforms more expensive, smoothing based event stereo
methods, by evaluating on the Multi Vehicle Stereo Event Camera dataset.
|
cs.CV
|
in this work we propose a novel event based stereo method which addresses the problem of motion blur for a moving event camera our method uses the velocity of the camera and a range of disparities to synchronize the positions of the events as if they were captured at a single point in time we represent these events using a pair of novel time synchronized event disparity volumes which we show remove motion blur for pixels at the correct disparity in the volume while further blurring pixels at the wrong disparity we then apply a novel matching cost over these time synchronized event disparity volumes which both rewards similarity between the volumes while penalizing blurriness we show that our method outperforms more expensive smoothing based event stereo methods by evaluating on the multi vehicle stereo event camera dataset
|
[['in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'event', 'based', 'stereo', 'method', 'which', 'addresses', 'the', 'problem', 'of', 'motion', 'blur', 'for', 'a', 'moving', 'event', 'camera', 'our', 'method', 'uses', 'the', 'velocity', 'of', 'the', 'camera', 'and', 'a', 'range', 'of', 'disparities', 'to', 'synchronize', 'the', 'positions', 'of', 'the', 'events', 'as', 'if', 'they', 'were', 'captured', 'at', 'a', 'single', 'point', 'in', 'time', 'we', 'represent', 'these', 'events', 'using', 'a', 'pair', 'of', 'novel', 'time', 'synchronized', 'event', 'disparity', 'volumes', 'which', 'we', 'show', 'remove', 'motion', 'blur', 'for', 'pixels', 'at', 'the', 'correct', 'disparity', 'in', 'the', 'volume', 'while', 'further', 'blurring', 'pixels', 'at', 'the', 'wrong', 'disparity', 'we', 'then', 'apply', 'a', 'novel', 'matching', 'cost', 'over', 'these', 'time', 'synchronized', 'event', 'disparity', 'volumes', 'which', 'both', 'rewards', 'similarity', 'between', 'the', 'volumes', 'while', 'penalizing', 'blurriness', 'we', 'show', 'that', 'our', 'method', 'outperforms', 'more', 'expensive', 'smoothing', 'based', 'event', 'stereo', 'methods', 'by', 'evaluating', 'on', 'the', 'multi', 'vehicle', 'stereo', 'event', 'camera', 'dataset']]
|
[-0.07694463623751738, 0.06577373258060897, -0.11209398853943507, 0.07179849837025952, -0.06828959509426646, -0.10501126876688036, 0.04581469084887826, 0.46688137195356516, -0.26564407898315595, -0.35952335428379045, 0.08057000874997237, -0.2845690845363382, -0.13553721251884016, 0.18131242797750494, -0.17217974671149167, 0.06974474605564299, 0.16913100863820402, 0.035456454624300415, -0.08618494074756239, -0.23210020413271326, 0.2772395729122724, 0.021862720247304093, 0.28008876302940905, -0.018910107678190496, 0.22521527175305653, 0.04270665781012318, -0.06279674627855285, 0.05152656078554582, -0.04945934347267831, 0.11156735217715007, 0.23752757929690668, 0.14837592251369378, 0.2890291083334149, -0.41394792931775254, -0.19327322189844603, 0.07556203700116147, 0.11597443524669211, 0.07996592490108805, -0.06069685896469257, -0.36375064956888126, 0.06699701782275477, -0.13105885494513897, -0.0128216535575094, -0.02994811607936424, 0.007088106044608614, 0.015825537741150492, -0.2970339949917642, 0.12301985465287082, 0.00412460988846378, 0.03745265255439217, -0.032607781316113214, -0.028287240783211546, 0.024593989769725697, 0.1876270445806069, 0.03204776575022033, 0.03142316595219292, 0.11742065537154027, -0.14600002116260483, -0.0992567695616542, 0.3523923474755408, -0.03233260891790016, -0.17753003321696018, 0.1687932703812755, -0.1149010858397283, -0.11651384072256801, 0.17326482970510487, 0.24344285286328607, 0.1513009884468941, -0.15934603727436153, -0.03951985400171775, -0.009640801654102794, 0.18474919767818326, 0.10997367774446805, -0.003129150100943187, 0.2204531115628239, 0.21251847945572133, 0.10267842373392289, 0.09721320176765363, -0.2709848648865127, -0.04799144960723925, -0.2789526891159029, -0.12324112036056223, -0.20920056313870178, -0.08033789462828334, -0.1083568957248539, -0.1577444231758515, 0.3846645522322776, 0.2796614188970863, 0.2538012500744367, 0.09366533290712918, 0.36143702742360206, 0.048013048719756465, 0.10047038890880303, 0.083926197482219, 0.18873234326947833, -0.07256528893418178, 0.14185854762141337, -0.19629608499277654, 0.06432947426071843, 0.12375157441188028]
|
1,803.09026
|
Towards a New Paradigm of UAV Safety
|
With the rising popularity of UAVs in the civilian world, we are currently
witnessing and paradim shift in terms of operational safety of flying vehicles.
Safe and ubiquitous human-system interaction shall remain the core requirement
but those prescribed in general aviation are not adapted for UAVs. Yet we
believe it is possible to leverage the specific aspects of unmanned aviation to
meet acceptable safety requirements. We start this paper with by discussing the
new operational context of civilian UAVs and investigate the meaning of safety
in light of this new context. Next, we explore the different approaches to
ensuring system safety from an avionics point of view. Subsets of operational
requirements such as geofencing or mechanical systems for termination or impact
limitation can easily be implemented. These are presented with the goal of
limiting the collateral damages of a system failure. We then present some
experimental results regarding two of the major problems with UAVs. With actual
impacts, we demonstrate how dangerous uncontrolled crashes can be. Furthermore,
with the large number of runaway drone experiences during civilian operations,
the risk is even higher as they can travel a long way before crashing. We
provide data on such a case where the software controller is working, keeping
the UAV in the air, but the operator is unable to actually control the system.
It should be terminated! Finally, after having analyzed the context and some
actual solutions, based on a minimal set of requirement and our own experience,
we are proposing a simple mechanical based safety system. It unequivocally
terminates the flight in the most efficient way by instantly removing parts of
the propellers leaving a minimal lifting surface. It takes advantage of what
controllability may remain but with a deterministic ending: a definite landing.
|
cs.RO
|
with the rising popularity of uavs in the civilian world we are currently witnessing and paradim shift in terms of operational safety of flying vehicles safe and ubiquitous humansystem interaction shall remain the core requirement but those prescribed in general aviation are not adapted for uavs yet we believe it is possible to leverage the specific aspects of unmanned aviation to meet acceptable safety requirements we start this paper with by discussing the new operational context of civilian uavs and investigate the meaning of safety in light of this new context next we explore the different approaches to ensuring system safety from an avionics point of view subsets of operational requirements such as geofencing or mechanical systems for termination or impact limitation can easily be implemented these are presented with the goal of limiting the collateral damages of a system failure we then present some experimental results regarding two of the major problems with uavs with actual impacts we demonstrate how dangerous uncontrolled crashes can be furthermore with the large number of runaway drone experiences during civilian operations the risk is even higher as they can travel a long way before crashing we provide data on such a case where the software controller is working keeping the uav in the air but the operator is unable to actually control the system it should be terminated finally after having analyzed the context and some actual solutions based on a minimal set of requirement and our own experience we are proposing a simple mechanical based safety system it unequivocally terminates the flight in the most efficient way by instantly removing parts of the propellers leaving a minimal lifting surface it takes advantage of what controllability may remain but with a deterministic ending a definite landing
|
[['with', 'the', 'rising', 'popularity', 'of', 'uavs', 'in', 'the', 'civilian', 'world', 'we', 'are', 'currently', 'witnessing', 'and', 'paradim', 'shift', 'in', 'terms', 'of', 'operational', 'safety', 'of', 'flying', 'vehicles', 'safe', 'and', 'ubiquitous', 'humansystem', 'interaction', 'shall', 'remain', 'the', 'core', 'requirement', 'but', 'those', 'prescribed', 'in', 'general', 'aviation', 'are', 'not', 'adapted', 'for', 'uavs', 'yet', 'we', 'believe', 'it', 'is', 'possible', 'to', 'leverage', 'the', 'specific', 'aspects', 'of', 'unmanned', 'aviation', 'to', 'meet', 'acceptable', 'safety', 'requirements', 'we', 'start', 'this', 'paper', 'with', 'by', 'discussing', 'the', 'new', 'operational', 'context', 'of', 'civilian', 'uavs', 'and', 'investigate', 'the', 'meaning', 'of', 'safety', 'in', 'light', 'of', 'this', 'new', 'context', 'next', 'we', 'explore', 'the', 'different', 'approaches', 'to', 'ensuring', 'system', 'safety', 'from', 'an', 'avionics', 'point', 'of', 'view', 'subsets', 'of', 'operational', 'requirements', 'such', 'as', 'geofencing', 'or', 'mechanical', 'systems', 'for', 'termination', 'or', 'impact', 'limitation', 'can', 'easily', 'be', 'implemented', 'these', 'are', 'presented', 'with', 'the', 'goal', 'of', 'limiting', 'the', 'collateral', 'damages', 'of', 'a', 'system', 'failure', 'we', 'then', 'present', 'some', 'experimental', 'results', 'regarding', 'two', 'of', 'the', 'major', 'problems', 'with', 'uavs', 'with', 'actual', 'impacts', 'we', 'demonstrate', 'how', 'dangerous', 'uncontrolled', 'crashes', 'can', 'be', 'furthermore', 'with', 'the', 'large', 'number', 'of', 'runaway', 'drone', 'experiences', 'during', 'civilian', 'operations', 'the', 'risk', 'is', 'even', 'higher', 'as', 'they', 'can', 'travel', 'a', 'long', 'way', 'before', 'crashing', 'we', 'provide', 'data', 'on', 'such', 'a', 'case', 'where', 'the', 'software', 'controller', 'is', 'working', 'keeping', 'the', 'uav', 'in', 'the', 'air', 'but', 'the', 'operator', 'is', 'unable', 'to', 'actually', 'control', 'the', 'system', 'it', 'should', 'be', 'terminated', 'finally', 'after', 'having', 'analyzed', 'the', 'context', 'and', 'some', 'actual', 'solutions', 'based', 'on', 'a', 'minimal', 'set', 'of', 'requirement', 'and', 'our', 'own', 'experience', 'we', 'are', 'proposing', 'a', 'simple', 'mechanical', 'based', 'safety', 'system', 'it', 'unequivocally', 'terminates', 'the', 'flight', 'in', 'the', 'most', 'efficient', 'way', 'by', 'instantly', 'removing', 'parts', 'of', 'the', 'propellers', 'leaving', 'a', 'minimal', 'lifting', 'surface', 'it', 'takes', 'advantage', 'of', 'what', 'controllability', 'may', 'remain', 'but', 'with', 'a', 'deterministic', 'ending', 'a', 'definite', 'landing']]
|
[-0.16542867994277216, 0.1170780136480099, -0.06266168728215646, 0.04164695271413633, -0.08492367371298015, -0.144779468988617, 0.07491911421107345, 0.38300820352981657, -0.25672303654503853, -0.3320788039191154, 0.1785289943130521, -0.25944643524357386, -0.14858161241445236, 0.2033571078683639, -0.17511333629236978, 0.08425491861919299, 0.07514290437293686, 0.053677520537784816, -0.01702055197529262, -0.23998256836067375, 0.28706309819364384, 0.06525023286039494, 0.24979941931406469, 0.080369691552446, 0.07548057206719795, -0.01667064774944128, 0.01347712800425018, 0.019449058501926977, -0.07438386088533787, 0.11524453681211103, 0.2768794735082288, 0.20933790217880924, 0.31962042494217724, -0.49837411799761533, -0.19568702644566457, 0.11858764461764734, 0.13313420840231255, 0.09011876437311102, -0.045008500550765135, -0.2989598750974026, 0.07708284840241317, -0.2158163616526234, -0.15571198829454497, -0.05488144685754478, -0.002333164392102969, 0.04122333518829044, -0.2104113458879834, -0.04047839509599128, 0.025998053210034962, 0.0661355090154732, -0.06432930820211705, -0.05756379881624949, -0.01682978959105054, 0.19385826865957462, 0.06948435092217302, -0.025468427303354, 0.16215995829536464, -0.12444774292677335, -0.09115031620404644, 0.4277886010049396, 0.015977734614327894, -0.17529980668300532, 0.2034936939567098, -0.10300960118024394, -0.12647534587120715, 0.09122473388600916, 0.18167770430780564, 0.06721786625064552, -0.16915059771567378, 0.031468891040127, 0.013786984955228558, 0.12022991146470104, 0.0703086231040612, 0.04205569561729559, 0.2290742369257041, 0.22145934636092246, 0.11730446364596639, 0.12058211124481391, -0.04275865587629123, -0.0968029080279736, -0.3051751803778979, -0.1480459162219083, -0.12484190100883708, 0.014966712434178502, -0.038813067593502934, -0.12655649432547275, 0.3724945076109217, 0.19561746112858974, 0.1470388386219944, 0.0576839710978276, 0.34648483401253716, 0.08942621257655484, 0.0732445082055526, 0.10065159086322999, 0.2393409944658107, -0.001181695458785414, 0.12795171668827382, -0.17477326978026722, 0.12632201429159853, -0.0023085791737236694]
|
1,803.09027
|
Comparing Population Means under Local Differential Privacy: with
Significance and Power
|
A statistical hypothesis test determines whether a hypothesis should be
rejected based on samples from populations. In particular, randomized
controlled experiments (or A/B testing) that compare population means using,
e.g., t-tests, have been widely deployed in technology companies to aid in
making data-driven decisions. Samples used in these tests are collected from
users and may contain sensitive information. Both the data collection and the
testing process may compromise individuals' privacy. In this paper, we study
how to conduct hypothesis tests to compare population means while preserving
privacy. We use the notation of local differential privacy (LDP), which has
recently emerged as the main tool to ensure each individual's privacy without
the need of a trusted data collector. We propose LDP tests that inject noise
into every user's data in the samples before collecting them (so users do not
need to trust the data collector), and draw conclusions with bounded type-I
(significance level) and type-II errors (1 - power). Our approaches can be
extended to the scenario where some users require LDP while some are willing to
provide exact data. We report experimental results on real-world datasets to
verify the effectiveness of our approaches.
|
cs.CR math.ST stat.TH
|
a statistical hypothesis test determines whether a hypothesis should be rejected based on samples from populations in particular randomized controlled experiments or ab testing that compare population means using eg ttests have been widely deployed in technology companies to aid in making datadriven decisions samples used in these tests are collected from users and may contain sensitive information both the data collection and the testing process may compromise individuals privacy in this paper we study how to conduct hypothesis tests to compare population means while preserving privacy we use the notation of local differential privacy ldp which has recently emerged as the main tool to ensure each individuals privacy without the need of a trusted data collector we propose ldp tests that inject noise into every users data in the samples before collecting them so users do not need to trust the data collector and draw conclusions with bounded typei significance level and typeii errors 1 power our approaches can be extended to the scenario where some users require ldp while some are willing to provide exact data we report experimental results on realworld datasets to verify the effectiveness of our approaches
|
[['a', 'statistical', 'hypothesis', 'test', 'determines', 'whether', 'a', 'hypothesis', 'should', 'be', 'rejected', 'based', 'on', 'samples', 'from', 'populations', 'in', 'particular', 'randomized', 'controlled', 'experiments', 'or', 'ab', 'testing', 'that', 'compare', 'population', 'means', 'using', 'eg', 'ttests', 'have', 'been', 'widely', 'deployed', 'in', 'technology', 'companies', 'to', 'aid', 'in', 'making', 'datadriven', 'decisions', 'samples', 'used', 'in', 'these', 'tests', 'are', 'collected', 'from', 'users', 'and', 'may', 'contain', 'sensitive', 'information', 'both', 'the', 'data', 'collection', 'and', 'the', 'testing', 'process', 'may', 'compromise', 'individuals', 'privacy', 'in', 'this', 'paper', 'we', 'study', 'how', 'to', 'conduct', 'hypothesis', 'tests', 'to', 'compare', 'population', 'means', 'while', 'preserving', 'privacy', 'we', 'use', 'the', 'notation', 'of', 'local', 'differential', 'privacy', 'ldp', 'which', 'has', 'recently', 'emerged', 'as', 'the', 'main', 'tool', 'to', 'ensure', 'each', 'individuals', 'privacy', 'without', 'the', 'need', 'of', 'a', 'trusted', 'data', 'collector', 'we', 'propose', 'ldp', 'tests', 'that', 'inject', 'noise', 'into', 'every', 'users', 'data', 'in', 'the', 'samples', 'before', 'collecting', 'them', 'so', 'users', 'do', 'not', 'need', 'to', 'trust', 'the', 'data', 'collector', 'and', 'draw', 'conclusions', 'with', 'bounded', 'typei', 'significance', 'level', 'and', 'typeii', 'errors', '1', 'power', 'our', 'approaches', 'can', 'be', 'extended', 'to', 'the', 'scenario', 'where', 'some', 'users', 'require', 'ldp', 'while', 'some', 'are', 'willing', 'to', 'provide', 'exact', 'data', 'we', 'report', 'experimental', 'results', 'on', 'realworld', 'datasets', 'to', 'verify', 'the', 'effectiveness', 'of', 'our', 'approaches']]
|
[-0.06542114868504238, 0.0032827917275426444, -0.0951945009771104, 0.1108873880964154, -0.12424402501589309, -0.20992502552447453, 0.1403078170230098, 0.3984315089037409, -0.22946536185675845, -0.36174729018239304, 0.12123013082964462, -0.3353177764292923, -0.09300381524978245, 0.18204004017206898, -0.13396272425598, 0.07975480342671896, 0.09605405803692217, 0.011818896074013688, 0.01425423725352933, -0.301011026041427, 0.31167542131637066, 0.060274115026307605, 0.34488003007815377, 0.01351602435655271, 0.04335175268776462, -0.021638562764564995, -0.06300989942610613, 0.024676636386478396, -0.08610966571275942, 0.11045253594905564, 0.3197122394340113, 0.2263365495079294, 0.34816353532914945, -0.4726059661884392, -0.15813754245148934, 0.13153080761063998, 0.140131714522416, 0.09538682144201023, -0.09353481763294742, -0.33130862569911795, 0.12045552990457509, -0.15408183279699492, -0.08043534823324687, -0.12205487410634912, -0.06797159986369176, 0.024875096141234582, -0.3168639287468977, 0.016482382674439577, 0.002187542964141661, 0.09293650931067532, 0.0006417021346957578, -0.08173746269919017, 0.0011003137976028181, 0.18581810917991484, 0.08766799605397561, -0.051706018793235366, 0.16571365534734164, -0.06862829127324706, -0.15488121265540636, 0.35563383321277797, 0.0015902855633006159, -0.19868419205765045, 0.18086805494507038, -0.12142680225952063, -0.1817329912640465, 0.05461956778890453, 0.23478262542630546, 0.05869444533042648, -0.21290656657947693, 0.030950118577644996, -0.021607085206293657, 0.2175158211169522, 0.0332832199189094, 0.000999359974230174, 0.17908309920555135, 0.16248020531080934, 0.03439501141595732, 0.08004740878095618, -0.09448483511262869, -0.06159696051327046, -0.2528784752842815, -0.14160735452727144, -0.171142735194735, 0.05550929672616197, -0.061507440724350694, -0.10146847909345524, 0.32624618463160004, 0.25621606883820885, 0.16345933543683108, 0.07684221070485364, 0.3266680404121871, 0.0351531366280445, 0.09403914407933674, 0.09428854621728533, 0.19763391244153658, 0.03380159180960618, 0.09432245600358631, -0.11137889320161776, 0.17587627574054446, -0.052538862215214976]
|
1,803.09028
|
(Short Paper) Towards More Reliable Bitcoin Timestamps
|
Bitcoin provides freshness properties by forming a blockchain where each
block is associated with its timestamp and the previous block. Due to these
properties, the Bitcoin protocol is being used as a decentralized, trusted, and
secure timestamping service. Although Bitcoin participants which create new
blocks cannot modify their order, they can manipulate timestamps almost
undetected. This undermines the Bitcoin protocol as a reliable timestamping
service. In particular, a newcomer that synchronizes the entire blockchain has
a little guarantee about timestamps of all blocks.
In this paper, we present a simple yet powerful mechanism that increases the
reliability of Bitcoin timestamps. Our protocol can provide evidence that a
block was created within a certain time range. The protocol is efficient,
backward compatible, and surprisingly, currently deployed SSL/TLS servers can
act as reference time sources. The protocol has many applications and can be
used for detecting various attacks against the Bitcoin protocol.
|
cs.CR
|
bitcoin provides freshness properties by forming a blockchain where each block is associated with its timestamp and the previous block due to these properties the bitcoin protocol is being used as a decentralized trusted and secure timestamping service although bitcoin participants which create new blocks cannot modify their order they can manipulate timestamps almost undetected this undermines the bitcoin protocol as a reliable timestamping service in particular a newcomer that synchronizes the entire blockchain has a little guarantee about timestamps of all blocks in this paper we present a simple yet powerful mechanism that increases the reliability of bitcoin timestamps our protocol can provide evidence that a block was created within a certain time range the protocol is efficient backward compatible and surprisingly currently deployed ssltls servers can act as reference time sources the protocol has many applications and can be used for detecting various attacks against the bitcoin protocol
|
[['bitcoin', 'provides', 'freshness', 'properties', 'by', 'forming', 'a', 'blockchain', 'where', 'each', 'block', 'is', 'associated', 'with', 'its', 'timestamp', 'and', 'the', 'previous', 'block', 'due', 'to', 'these', 'properties', 'the', 'bitcoin', 'protocol', 'is', 'being', 'used', 'as', 'a', 'decentralized', 'trusted', 'and', 'secure', 'timestamping', 'service', 'although', 'bitcoin', 'participants', 'which', 'create', 'new', 'blocks', 'can', 'not', 'modify', 'their', 'order', 'they', 'can', 'manipulate', 'timestamps', 'almost', 'undetected', 'this', 'undermines', 'the', 'bitcoin', 'protocol', 'as', 'a', 'reliable', 'timestamping', 'service', 'in', 'particular', 'a', 'newcomer', 'that', 'synchronizes', 'the', 'entire', 'blockchain', 'has', 'a', 'little', 'guarantee', 'about', 'timestamps', 'of', 'all', 'blocks', 'in', 'this', 'paper', 'we', 'present', 'a', 'simple', 'yet', 'powerful', 'mechanism', 'that', 'increases', 'the', 'reliability', 'of', 'bitcoin', 'timestamps', 'our', 'protocol', 'can', 'provide', 'evidence', 'that', 'a', 'block', 'was', 'created', 'within', 'a', 'certain', 'time', 'range', 'the', 'protocol', 'is', 'efficient', 'backward', 'compatible', 'and', 'surprisingly', 'currently', 'deployed', 'ssltls', 'servers', 'can', 'act', 'as', 'reference', 'time', 'sources', 'the', 'protocol', 'has', 'many', 'applications', 'and', 'can', 'be', 'used', 'for', 'detecting', 'various', 'attacks', 'against', 'the', 'bitcoin', 'protocol']]
|
[-0.21913674596962304, 0.05622277632417367, -0.09567535454129787, 0.05639293703284509, -0.10626025753718683, -0.24314343425698134, 0.13570010311368064, 0.40562710608509894, -0.27467146376456253, -0.2923971012678762, 0.1589796840419857, -0.26252606891663066, -0.10668910432310887, 0.17747799355524363, -0.11929700964759567, 0.06542715343873368, 0.036350516107439106, 0.04802627229484088, 0.032801875754395214, -0.2965031434929874, 0.21327013140605972, 0.10263244296417923, 0.3213581864348927, 0.05979158926526985, 0.08587703896248527, 0.006203976644832172, -0.016816215944477967, -0.050674073219635456, -0.03781784219132075, 0.09172386922164272, 0.3159025900793687, 0.21376856749211223, 0.31428200357812547, -0.44295690966375323, -0.134791506158299, 0.1193380615371742, 0.1670100246170622, 0.14575848548552822, -0.06841015638721896, -0.29687564140987516, 0.14964442424605667, -0.3064304257076949, -0.11886917923836174, -0.08008575713915737, -0.029433976541217786, 0.043419539222234724, -0.2232098638030719, -0.0074631690559600365, 0.018709199171550325, 0.0028506946250401585, 0.03372789317331838, 0.009773708426621773, -0.026449561580886065, 0.19765824228309292, -0.004899959318919588, -0.006932708710765108, 0.19354056442211942, -0.04229135410120057, -0.1929698042380346, 0.37316140502888634, -0.009934197609399181, -0.11922476422319202, 0.16331247522014605, 0.016854827464959084, -0.16076364320651196, 0.07378102041663763, 0.17237692491601633, 0.07390504758743359, -0.2224249520974345, 0.0055710957753734155, -0.08013258003228843, 0.2509040717715521, 0.057021252750819984, 0.11283918021444157, 0.1793668415576269, 0.16534020786562206, 0.11689871294610511, 0.09552440631268114, -0.01610628478478163, -0.10386701400040199, -0.2436259768375917, -0.1695657364364146, -0.1853845529959827, 0.032866291911591815, -0.07296161871327901, -0.1467720976323722, 0.4029859594803378, 0.19998142737525187, 0.13042366986597784, 0.047166747140500766, 0.3828967528430042, 0.028952986641867174, 0.1361284282826356, 0.16039668777587496, 0.1918336205054938, 0.019811013970980482, 0.16841237831071315, -0.08715426180448495, 0.2688941372873027, -0.005062060353549703]
|
1,803.09029
|
Blockclique: scaling blockchains through transaction sharding in a
multithreaded block graph
|
Decentralized crypto-currencies based on the blockchain architecture
under-utilize available network bandwidth, making them unable to scale to
thousands of transactions per second. We define the Blockclique architecture,
that addresses this limitation by sharding transactions in a block graph with a
fixed number of threads. The architecture allows the creation of intrinsically
compatible blocks in parallel, where each block references one previous block
of each thread. The consistency of the Blockclique protocol is formally
established in presence of attackers. An experimental evaluation of the
architecture's performance in large realistic networks demonstrates an
efficient use of available bandwidth and a throughput of thousands of
transactions per second.
|
cs.CR
|
decentralized cryptocurrencies based on the blockchain architecture underutilize available network bandwidth making them unable to scale to thousands of transactions per second we define the blockclique architecture that addresses this limitation by sharding transactions in a block graph with a fixed number of threads the architecture allows the creation of intrinsically compatible blocks in parallel where each block references one previous block of each thread the consistency of the blockclique protocol is formally established in presence of attackers an experimental evaluation of the architectures performance in large realistic networks demonstrates an efficient use of available bandwidth and a throughput of thousands of transactions per second
|
[['decentralized', 'cryptocurrencies', 'based', 'on', 'the', 'blockchain', 'architecture', 'underutilize', 'available', 'network', 'bandwidth', 'making', 'them', 'unable', 'to', 'scale', 'to', 'thousands', 'of', 'transactions', 'per', 'second', 'we', 'define', 'the', 'blockclique', 'architecture', 'that', 'addresses', 'this', 'limitation', 'by', 'sharding', 'transactions', 'in', 'a', 'block', 'graph', 'with', 'a', 'fixed', 'number', 'of', 'threads', 'the', 'architecture', 'allows', 'the', 'creation', 'of', 'intrinsically', 'compatible', 'blocks', 'in', 'parallel', 'where', 'each', 'block', 'references', 'one', 'previous', 'block', 'of', 'each', 'thread', 'the', 'consistency', 'of', 'the', 'blockclique', 'protocol', 'is', 'formally', 'established', 'in', 'presence', 'of', 'attackers', 'an', 'experimental', 'evaluation', 'of', 'the', 'architectures', 'performance', 'in', 'large', 'realistic', 'networks', 'demonstrates', 'an', 'efficient', 'use', 'of', 'available', 'bandwidth', 'and', 'a', 'throughput', 'of', 'thousands', 'of', 'transactions', 'per', 'second']]
|
[-0.23628379932737775, 0.001437700333883099, 0.012221192896720908, -0.003512549271718377, -0.09835769828142864, -0.17882396430442377, 0.11866793440033992, 0.36917663101284276, -0.2751164737911451, -0.32186674513754304, 0.10011089693400121, -0.24726531161674453, -0.10601140611938067, 0.15107892009185717, -0.10990080555812234, 0.07130385054763229, 0.10134003365944538, 0.05060557731915088, 0.010078126979282214, -0.3281951539365331, 0.25390146322370993, 0.09672680851072073, 0.33404875505893006, 0.020722268025080363, 0.09974343613499687, 0.018458393460050935, -0.04645168757332223, -0.037817316308307154, -0.04216455577109064, 0.1907616659511058, 0.2710506898040573, 0.1830539701728239, 0.35981889819460255, -0.4786532293650366, -0.13694500045496083, 0.048101726094526905, 0.12754802459939604, 0.0818303509127526, 0.02345845854087245, -0.24550617298200017, 0.11757735386047335, -0.2512441334536388, -0.056540394410313596, -0.04663931314966508, -0.008507069954205127, 0.031570264787989716, -0.26512730241076843, 0.007538018974342517, -0.0018013952743439448, 0.02185747954284861, 0.01964670457333947, -0.05317286817977826, 0.010043726781649248, 0.14493834482550266, -0.02178885937845778, -0.033054372966511265, 0.1460207922517189, -0.08838069094566717, -0.17154917551115864, 0.350930541886815, -0.021523474697910605, -0.15107943204098515, 0.14132140934511664, -0.007370478708651804, -0.19005841326323294, 0.10310660416615151, 0.16907782049938327, 0.09325740647812684, -0.1836593203867475, 0.01682192106409708, -0.03499658312205048, 0.2538377412107019, 0.05572385896174681, 0.061572958311686916, 0.18053589262999595, 0.24704349574943382, 0.08814482126562369, 0.15919077614588398, -0.06287224137118928, -0.1194523905714353, -0.26968741130660334, -0.15506306022760413, -0.20882465530719077, -0.01774436260263125, -0.12155925176048185, -0.16721866102445693, 0.3949580564729764, 0.219780895996484, 0.19220470950184834, 0.0965653216555005, 0.3743203292711682, -0.015453955371465001, 0.19484202775195064, 0.15573027958383873, 0.13326191168189758, 0.04863914420074295, 0.15986808043463888, -0.15231864077227544, 0.09756932893457512, 0.012202190953705993]
|
1,803.0903
|
Quantum-state comparison and discrimination
|
We investigate the performance of discrimination strategy in the comparison
task of known quantum states. In the discrimination strategy, one infers
whether or not two quantum systems are in the same state on the basis of the
outcomes of separate discrimination measurements on each system. In some cases
with more than two possible states, the optimal strategy in minimum-error
comparison is that one should infer the two systems are in different states
without any measurement, implying that the discrimination strategy performs
worse than the trivial "no-measurement" strategy. We present a sufficient
condition for this phenomenon to happen. For two pure states with equal prior
probabilities, we determine the optimal comparison success probability with an
error margin, which interpolates the minimum-error and unambiguous comparison.
We find that the discrimination strategy is not optimal except for the
minimum-error case.
|
quant-ph
|
we investigate the performance of discrimination strategy in the comparison task of known quantum states in the discrimination strategy one infers whether or not two quantum systems are in the same state on the basis of the outcomes of separate discrimination measurements on each system in some cases with more than two possible states the optimal strategy in minimumerror comparison is that one should infer the two systems are in different states without any measurement implying that the discrimination strategy performs worse than the trivial nomeasurement strategy we present a sufficient condition for this phenomenon to happen for two pure states with equal prior probabilities we determine the optimal comparison success probability with an error margin which interpolates the minimumerror and unambiguous comparison we find that the discrimination strategy is not optimal except for the minimumerror case
|
[['we', 'investigate', 'the', 'performance', 'of', 'discrimination', 'strategy', 'in', 'the', 'comparison', 'task', 'of', 'known', 'quantum', 'states', 'in', 'the', 'discrimination', 'strategy', 'one', 'infers', 'whether', 'or', 'not', 'two', 'quantum', 'systems', 'are', 'in', 'the', 'same', 'state', 'on', 'the', 'basis', 'of', 'the', 'outcomes', 'of', 'separate', 'discrimination', 'measurements', 'on', 'each', 'system', 'in', 'some', 'cases', 'with', 'more', 'than', 'two', 'possible', 'states', 'the', 'optimal', 'strategy', 'in', 'minimumerror', 'comparison', 'is', 'that', 'one', 'should', 'infer', 'the', 'two', 'systems', 'are', 'in', 'different', 'states', 'without', 'any', 'measurement', 'implying', 'that', 'the', 'discrimination', 'strategy', 'performs', 'worse', 'than', 'the', 'trivial', 'nomeasurement', 'strategy', 'we', 'present', 'a', 'sufficient', 'condition', 'for', 'this', 'phenomenon', 'to', 'happen', 'for', 'two', 'pure', 'states', 'with', 'equal', 'prior', 'probabilities', 'we', 'determine', 'the', 'optimal', 'comparison', 'success', 'probability', 'with', 'an', 'error', 'margin', 'which', 'interpolates', 'the', 'minimumerror', 'and', 'unambiguous', 'comparison', 'we', 'find', 'that', 'the', 'discrimination', 'strategy', 'is', 'not', 'optimal', 'except', 'for', 'the', 'minimumerror', 'case']]
|
[-0.10995528504616126, 0.09557971294833785, -0.10239050926871761, 0.10469838051400725, -0.007682417607764258, -0.24117431840281525, 0.10128689678147924, 0.3925771198786088, -0.19206877009616824, -0.31723356958696225, 0.08623451675138824, -0.2668013109818754, -0.10375572347598844, 0.1855346905050568, -0.08265005260787524, 0.07004584232005324, 0.09532205221314581, 0.09353807721334598, -0.10817701989711759, -0.25150441091650433, 0.33883635115123145, 0.02870933392809969, 0.3457678373984612, -0.013500416457625853, 0.07561456158852381, 0.018664385215889145, 0.002363878229197903, -0.013250151296379575, -0.12556584728587492, 0.06721308714723771, 0.2594841872307941, 0.16992128486779048, 0.2609081472963584, -0.36916568931736, -0.1620734189738975, 0.1793208438554697, 0.09698611947225176, 0.15864902948042936, -0.020273245633669015, -0.2307363541705031, 0.05856112089691289, -0.16225815412119357, -0.06320498129148988, -0.06235793034416916, -0.022326107952662193, -0.05879371738346824, -0.30304562706962557, 0.07694012116484453, 0.06311782273586268, -0.0005322630877477409, -0.08603876670414623, -0.14891926983939008, 0.03714300213504012, 0.17343103637099674, -0.01889469197196682, -0.012662976543439458, 0.09115077711193122, -0.14978924158613885, -0.2041493551941575, 0.3359703357827707, -0.03321504240696672, -0.24557800764032303, 0.19989338714330301, -0.1340879498773601, -0.1123836773666927, 0.09960698233883365, 0.09843077231538448, 0.12175225308776771, -0.1286305965461435, -0.03232743080244842, -0.04166057227981569, 0.20828450715889896, 0.07493384707256825, 0.06921930825269788, 0.16589735889039173, 0.15429001086031216, 0.1501658196190549, 0.13354640166499537, -0.0805838775589899, -0.12185876503506893, -0.3029452278040839, -0.17260278181859504, -0.1862288985068291, 0.014759251324631559, -0.05042972024111672, -0.12043264541557452, 0.38114821412566585, 0.13592065796324046, 0.17822264525087644, 0.04618810041532274, 0.28346691256130696, 0.08943314485151634, -0.027769102674167958, 0.08447787450434449, 0.30392943655525634, 0.05855937593745707, 0.008745973365530915, -0.22828888108981024, 0.15159064920170465, 0.021860269588302738]
|
1,803.09031
|
Landauer-B\"uttiker conductivity for spatially-dependent uniaxial
strained armchair-terminated graphene nanoribbons
|
The Landauer-B\"uttiker conductivity of arbitrary uniaxial spatially
dependent strain in an armchair graphene nanoribbon is studied. Due to the
uniaxial character of the strain, the corresponding transfer matrix can be
reduced to a product of $2\times2$ matrices. Then the conductivity and the Fano
factor can be calculated from this product. As an example of the technique,
sinusoidal space dependent strain fields are studied using two different strain
wavelengths. For the bigger wavelength the conductivity is reduced when
compared with the unstrained case, although both conductivities are almost the
same in shape. Whereas, for the smaller wavelength case, the conductivity is
strongly modified. In spite of this, for energies close to the Dirac point
energy, the conductivity and the Fano factor are quite similar to their
unstrained counterpart for the two strain wavelengths here studied.
|
cond-mat.mes-hall
|
the landauerbuttiker conductivity of arbitrary uniaxial spatially dependent strain in an armchair graphene nanoribbon is studied due to the uniaxial character of the strain the corresponding transfer matrix can be reduced to a product of 2times2 matrices then the conductivity and the fano factor can be calculated from this product as an example of the technique sinusoidal space dependent strain fields are studied using two different strain wavelengths for the bigger wavelength the conductivity is reduced when compared with the unstrained case although both conductivities are almost the same in shape whereas for the smaller wavelength case the conductivity is strongly modified in spite of this for energies close to the dirac point energy the conductivity and the fano factor are quite similar to their unstrained counterpart for the two strain wavelengths here studied
|
[['the', 'landauerbuttiker', 'conductivity', 'of', 'arbitrary', 'uniaxial', 'spatially', 'dependent', 'strain', 'in', 'an', 'armchair', 'graphene', 'nanoribbon', 'is', 'studied', 'due', 'to', 'the', 'uniaxial', 'character', 'of', 'the', 'strain', 'the', 'corresponding', 'transfer', 'matrix', 'can', 'be', 'reduced', 'to', 'a', 'product', 'of', '2times2', 'matrices', 'then', 'the', 'conductivity', 'and', 'the', 'fano', 'factor', 'can', 'be', 'calculated', 'from', 'this', 'product', 'as', 'an', 'example', 'of', 'the', 'technique', 'sinusoidal', 'space', 'dependent', 'strain', 'fields', 'are', 'studied', 'using', 'two', 'different', 'strain', 'wavelengths', 'for', 'the', 'bigger', 'wavelength', 'the', 'conductivity', 'is', 'reduced', 'when', 'compared', 'with', 'the', 'unstrained', 'case', 'although', 'both', 'conductivities', 'are', 'almost', 'the', 'same', 'in', 'shape', 'whereas', 'for', 'the', 'smaller', 'wavelength', 'case', 'the', 'conductivity', 'is', 'strongly', 'modified', 'in', 'spite', 'of', 'this', 'for', 'energies', 'close', 'to', 'the', 'dirac', 'point', 'energy', 'the', 'conductivity', 'and', 'the', 'fano', 'factor', 'are', 'quite', 'similar', 'to', 'their', 'unstrained', 'counterpart', 'for', 'the', 'two', 'strain', 'wavelengths', 'here', 'studied']]
|
[-0.13174101009221276, 0.16276711776332214, -0.027958539790654584, -0.006472073327715217, -0.004771020996676229, -0.14403424600709175, -0.026768533158491353, 0.4523729189757758, -0.2954305253832587, -0.2262623726925465, 0.061874871740791836, -0.24752678128598787, -0.1272532917844104, 0.22016622889925963, -0.0014710900505810086, 0.028298584264772598, -0.007185543209675755, -0.008121186262691643, -0.10506961566618463, -0.24084023311178185, 0.29586535175817447, 0.05257575137457296, 0.34445350099730293, 0.07626263707625999, -0.02210058188830405, 0.026667505306358547, 0.07175219456540115, 0.08684374241887265, -0.13150439203244202, 0.07231320523997463, 0.25681216635831644, -0.11696038518879395, 0.1597904268332493, -0.4046036677622695, -0.18018269752857707, 0.05007452750578523, 0.10472310026204075, 0.15441881911829114, 0.02422007437406191, -0.22854442620274626, 0.07471597253053046, -0.1230959002303877, -0.1421875216261442, -0.031276107037704046, 0.031161760289305403, -0.026680238506715023, -0.24667352255878608, 0.12819770392405785, 0.008867540505346355, 0.036419872364807704, -0.12176083978057019, -0.18669140109542146, -0.08772864071791296, 0.06977217609550171, 0.07971962301387216, 0.016902751800145454, 0.1807031642659498, -0.11431066851034316, -0.06637517274913392, 0.41786571366907055, -0.061083049631552463, -0.16730975728732214, 0.13029570003915855, -0.1660813455497707, -0.02500694280806512, 0.19281400784453961, 0.11693926542691553, 0.10170791970232307, -0.15357800412094724, 0.07836565305913257, -0.004447611790748119, 0.16768274867994912, 0.1290311232841671, 0.04549197653141707, 0.17393840926546436, 0.14582999723046017, 0.06068111532854278, 0.16507623143278674, -0.08842232853952628, -0.011326226181656456, -0.22342890120153105, -0.15634579456119396, -0.2503323652573041, 0.12390146669306194, -0.15104034661516066, -0.19978915082652177, 0.4265494872850658, 0.09500533475804684, 0.18192462226959752, 0.01746191507650178, 0.24650148282161177, 0.19304190277479893, 0.09098140339179438, 0.040086832448298026, 0.2915027373984678, 0.18411040458126243, 0.09432039755646751, -0.2424002641155176, 0.023879813805305912, -0.035769518562106056]
|
1,803.09032
|
Condition for dust evacuation from the first galaxies
|
Dust enables low-mass stars to form from low-metallicity gas by inducing
fragmentation of clouds via the cooling by its thermal emission. Dust may,
however, be evacuated from star-forming clouds due to radiation force from
massive stars. We here study the condition for the dust evacuation by comparing
the dust evacuation time with the time of cloud destruction due to either
expansion of HII regions or supernovae. The cloud destruction time has weak
dependence on the cloud radius, while the dust evacuation time becomes shorter
for a cloud with the smaller radius. The dust evacuation thus occurs in compact
star-forming clouds whose column density is $N_{\rm H} \simeq 10^{24} - 10^{26}
~{\rm cm^{-2}}$. The critical halo mass above which the dust evacuation occurs
becomes lower for higher formation redshift, e.g., $\sim 10^{9}~M_{\odot}$ at
redshift $z \sim 3$ and $\sim 10^{7}~M_{\odot}$ at $z \sim 9$. In addition,
metallicity of the gas should be less than $\sim 10^{-2} ~ Z_{\odot}$.
Otherwise the dust attenuation reduces the radiation force significantly. From
the dust-evacuated gas, massive stars are likely to form even with metallicity
above $\sim 10^{-5}~Z_{\odot}$, the critical value for low-mass star formation
due to the dust cooling. This can explain the dearth of ultra-metal poor stars
with the metallicity lower than $\sim 10^{-4}~Z_{\odot}$.
|
astro-ph.GA astro-ph.SR
|
dust enables lowmass stars to form from lowmetallicity gas by inducing fragmentation of clouds via the cooling by its thermal emission dust may however be evacuated from starforming clouds due to radiation force from massive stars we here study the condition for the dust evacuation by comparing the dust evacuation time with the time of cloud destruction due to either expansion of hii regions or supernovae the cloud destruction time has weak dependence on the cloud radius while the dust evacuation time becomes shorter for a cloud with the smaller radius the dust evacuation thus occurs in compact starforming clouds whose column density is n_rm h simeq 1024 1026 rm cm2 the critical halo mass above which the dust evacuation occurs becomes lower for higher formation redshift eg sim 109m_odot at redshift z sim 3 and sim 107m_odot at z sim 9 in addition metallicity of the gas should be less than sim 102 z_odot otherwise the dust attenuation reduces the radiation force significantly from the dustevacuated gas massive stars are likely to form even with metallicity above sim 105z_odot the critical value for lowmass star formation due to the dust cooling this can explain the dearth of ultrametal poor stars with the metallicity lower than sim 104z_odot
|
[['dust', 'enables', 'lowmass', 'stars', 'to', 'form', 'from', 'lowmetallicity', 'gas', 'by', 'inducing', 'fragmentation', 'of', 'clouds', 'via', 'the', 'cooling', 'by', 'its', 'thermal', 'emission', 'dust', 'may', 'however', 'be', 'evacuated', 'from', 'starforming', 'clouds', 'due', 'to', 'radiation', 'force', 'from', 'massive', 'stars', 'we', 'here', 'study', 'the', 'condition', 'for', 'the', 'dust', 'evacuation', 'by', 'comparing', 'the', 'dust', 'evacuation', 'time', 'with', 'the', 'time', 'of', 'cloud', 'destruction', 'due', 'to', 'either', 'expansion', 'of', 'hii', 'regions', 'or', 'supernovae', 'the', 'cloud', 'destruction', 'time', 'has', 'weak', 'dependence', 'on', 'the', 'cloud', 'radius', 'while', 'the', 'dust', 'evacuation', 'time', 'becomes', 'shorter', 'for', 'a', 'cloud', 'with', 'the', 'smaller', 'radius', 'the', 'dust', 'evacuation', 'thus', 'occurs', 'in', 'compact', 'starforming', 'clouds', 'whose', 'column', 'density', 'is', 'n_rm', 'h', 'simeq', '1024', '1026', 'rm', 'cm2', 'the', 'critical', 'halo', 'mass', 'above', 'which', 'the', 'dust', 'evacuation', 'occurs', 'becomes', 'lower', 'for', 'higher', 'formation', 'redshift', 'eg', 'sim', '109m_odot', 'at', 'redshift', 'z', 'sim', '3', 'and', 'sim', '107m_odot', 'at', 'z', 'sim', '9', 'in', 'addition', 'metallicity', 'of', 'the', 'gas', 'should', 'be', 'less', 'than', 'sim', '102', 'z_odot', 'otherwise', 'the', 'dust', 'attenuation', 'reduces', 'the', 'radiation', 'force', 'significantly', 'from', 'the', 'dustevacuated', 'gas', 'massive', 'stars', 'are', 'likely', 'to', 'form', 'even', 'with', 'metallicity', 'above', 'sim', '105z_odot', 'the', 'critical', 'value', 'for', 'lowmass', 'star', 'formation', 'due', 'to', 'the', 'dust', 'cooling', 'this', 'can', 'explain', 'the', 'dearth', 'of', 'ultrametal', 'poor', 'stars', 'with', 'the', 'metallicity', 'lower', 'than', 'sim', '104z_odot']]
|
[-0.05263136615790201, 0.21926176400620093, -0.004657868679061315, 0.07895025892807081, -0.031837652323234066, -0.027488476592251686, 0.07072205994972164, 0.384344577138285, -0.133996749952327, -0.35341171459611326, 0.053193295362079965, -0.28413642265662115, 0.0834518001017554, 0.17084253620293027, -0.017748569512494795, -0.06395580243343008, -0.020593895529423957, -0.09804665070316455, -0.04319689398418402, -0.27276651125889523, 0.30988637119694384, 0.10939824186238342, 0.12641158927507806, 0.04760925552450449, 0.0115331702919912, -0.17907427792557182, -0.021439042575295688, -0.08432253367237598, -0.183187502533541, -0.02195991456363965, 0.1806282785458906, 0.09577293657625402, 0.23623742337239165, -0.3941567536190297, -0.23076340432213258, 0.1202925029843684, 0.23977204437447583, 0.02549826715297509, -0.050716748902488284, -0.23779671395070923, 0.07227098959208765, -0.2097486115006495, -0.19440341129440145, 0.1346845141831261, 0.08633783409028377, -0.019819879133279154, -0.2610991231834932, 0.20624302972890257, 0.0011313565033578396, 0.05617602348996742, -0.0748952951025697, -0.09086563457391288, -0.07703298944708648, -0.001575847346227146, 0.020005769974515926, 0.12721839501156282, 0.2865366865654738, -0.17706179308582964, 0.09640415926414171, 0.4671164905760907, -0.06987006602273661, 0.0387429237923499, 0.2474853652597233, -0.24832508033277123, -0.12285248251197842, 0.24088501392013745, 0.14495596518057388, 0.10452084443012018, -0.12908587849798422, -0.0076866271960417945, 0.020010105836616592, 0.21290202726252846, 0.1059574916104343, 0.06114578883624771, 0.3493066750335715, 0.12062471149742458, 0.0723920089884399, 0.07375336112341509, -0.20933016005211771, -0.06282979787668684, -0.18686901708811665, -0.12629057253141282, -0.11882847379576596, 0.1376052085780403, -0.22266265153832615, -0.08521010796765535, 0.211001897192316, 0.13654340828093023, 0.2496807552892172, 0.09909706649164787, 0.3467817945853418, 0.1267170102676847, 0.1512199574602879, 0.17800120078931445, 0.2460744535862423, 0.14222497855272434, 0.08710059562801989, -0.2577086244562858, 0.11573509465071183, 0.0031028234691458565]
|
1,803.09033
|
Automatic Music Accompanist
|
Automatic musical accompaniment is where a human musician is accompanied by a
computer musician. The computer musician is able to produce musical
accompaniment that relates musically to the human performance. The
accompaniment should follow the performance using observations of the notes
they are playing. This paper describes a complete and detailed construction of
a score following and accompanying system using Hidden Markov Models (HMMs). It
details how to train a score HMM, how to deal with polyphonic input, how this
HMM work when following score, how to build up a musical accompanist. It
proposes a new parallel hidden Markov model for score following and a fast
decoding algorithm to deal with performance errors.
|
cs.SD cs.MM eess.AS
|
automatic musical accompaniment is where a human musician is accompanied by a computer musician the computer musician is able to produce musical accompaniment that relates musically to the human performance the accompaniment should follow the performance using observations of the notes they are playing this paper describes a complete and detailed construction of a score following and accompanying system using hidden markov models hmms it details how to train a score hmm how to deal with polyphonic input how this hmm work when following score how to build up a musical accompanist it proposes a new parallel hidden markov model for score following and a fast decoding algorithm to deal with performance errors
|
[['automatic', 'musical', 'accompaniment', 'is', 'where', 'a', 'human', 'musician', 'is', 'accompanied', 'by', 'a', 'computer', 'musician', 'the', 'computer', 'musician', 'is', 'able', 'to', 'produce', 'musical', 'accompaniment', 'that', 'relates', 'musically', 'to', 'the', 'human', 'performance', 'the', 'accompaniment', 'should', 'follow', 'the', 'performance', 'using', 'observations', 'of', 'the', 'notes', 'they', 'are', 'playing', 'this', 'paper', 'describes', 'a', 'complete', 'and', 'detailed', 'construction', 'of', 'a', 'score', 'following', 'and', 'accompanying', 'system', 'using', 'hidden', 'markov', 'models', 'hmms', 'it', 'details', 'how', 'to', 'train', 'a', 'score', 'hmm', 'how', 'to', 'deal', 'with', 'polyphonic', 'input', 'how', 'this', 'hmm', 'work', 'when', 'following', 'score', 'how', 'to', 'build', 'up', 'a', 'musical', 'accompanist', 'it', 'proposes', 'a', 'new', 'parallel', 'hidden', 'markov', 'model', 'for', 'score', 'following', 'and', 'a', 'fast', 'decoding', 'algorithm', 'to', 'deal', 'with', 'performance', 'errors']]
|
[-0.01466508736484684, 0.08173792249518945, -0.12511884415289387, 0.10428868238003426, -0.17567103790601582, -0.1879248437154664, 0.02033860834438071, 0.4475643170797931, -0.2377693491788315, -0.34655638749245554, 0.06932683336448722, -0.24343790418268846, -0.23171750417012454, 0.16880514781431494, -0.17760830836985925, 0.06475343667469653, 0.12775057552062208, 0.08187244817755916, -0.019587096012920874, -0.26479024826715303, 0.23996592209108972, 0.09972753172041848, 0.2717025591991842, -0.042133841064891646, 0.15407194777279593, -0.046435454317751076, -0.028940782803277085, -0.05106147712961372, -0.07971197436661116, 0.17649365445998097, 0.32314355253080457, 0.2089408116963958, 0.34163857665095876, -0.37592230262401116, -0.16234500061520002, 0.05735155039915948, 0.10429750355043714, 0.11807049635016094, -0.007070747428640191, -0.3364342586303662, 0.103213564359716, -0.16749053548638976, -0.0038772565437414286, -0.08984605938478905, -0.041333763843535314, -0.014575445311793698, -0.28059608762019445, 0.00874633589410223, 0.10901342084564801, 0.06288628873049415, 0.017698387711009542, -0.0469805884599087, 0.042739472742271446, 0.18208428205694613, 0.05896156598984297, 0.09456967739138886, 0.12165517591139567, -0.13656380787558323, -0.18690993874666414, 0.34802259067406077, -0.08055987275812575, -0.24353742863916392, 0.1683238494484353, -0.016296752998771678, -0.16626008261144826, 0.11334536337692823, 0.2282219737140362, 0.058701962897820134, -0.17396504022703344, -0.028768754761196242, -0.026159568656112242, 0.27800630414276384, 0.045168366644897366, -0.07472607794001565, 0.21372165492045628, 0.22548764661977266, -0.05035320372553542, 0.16599648984473397, -0.03724625872980271, -0.08549930781217492, -0.23043996290672503, -0.15465195464665676, -0.16504861442704818, -0.0024651271108138773, -0.01042892878636589, -0.20599086347803158, 0.4433641597528809, 0.2555438929037856, 0.17937703698407859, 0.12783124543992536, 0.30540279165143147, 0.04549109541195711, 0.016610189200686624, 0.06389893186860718, 0.12536620725794428, 0.0424124201880269, 0.1383626315177285, -0.16954132586085638, 0.12608940201711707, 0.06348306042907227]
|
1,803.09034
|
Derivation of the Invariant Free-Energy Landscape Based on Langevin
Dynamics
|
Conventionally defined free-energy landscape (FEL) exhibits unphysical
dependence on the choice of reaction coordinates and hence lacks universal
predictive ability. We here show that three physically plausible requirements
uniquely determine the FEL formula for a given reaction coordinate. Our FEL is
expressed solely in terms of quantities obtained through time-series data
analysis, namely, the probability distribution and the diffusion matrix. It is
free from any unphysical coordinate dependence and coincides with the
conventional FEL in special cases. The uniqueness and robustness of the formula
strongly suggest that our FEL has universal predictive power.
|
cond-mat.stat-mech
|
conventionally defined freeenergy landscape fel exhibits unphysical dependence on the choice of reaction coordinates and hence lacks universal predictive ability we here show that three physically plausible requirements uniquely determine the fel formula for a given reaction coordinate our fel is expressed solely in terms of quantities obtained through timeseries data analysis namely the probability distribution and the diffusion matrix it is free from any unphysical coordinate dependence and coincides with the conventional fel in special cases the uniqueness and robustness of the formula strongly suggest that our fel has universal predictive power
|
[['conventionally', 'defined', 'freeenergy', 'landscape', 'fel', 'exhibits', 'unphysical', 'dependence', 'on', 'the', 'choice', 'of', 'reaction', 'coordinates', 'and', 'hence', 'lacks', 'universal', 'predictive', 'ability', 'we', 'here', 'show', 'that', 'three', 'physically', 'plausible', 'requirements', 'uniquely', 'determine', 'the', 'fel', 'formula', 'for', 'a', 'given', 'reaction', 'coordinate', 'our', 'fel', 'is', 'expressed', 'solely', 'in', 'terms', 'of', 'quantities', 'obtained', 'through', 'timeseries', 'data', 'analysis', 'namely', 'the', 'probability', 'distribution', 'and', 'the', 'diffusion', 'matrix', 'it', 'is', 'free', 'from', 'any', 'unphysical', 'coordinate', 'dependence', 'and', 'coincides', 'with', 'the', 'conventional', 'fel', 'in', 'special', 'cases', 'the', 'uniqueness', 'and', 'robustness', 'of', 'the', 'formula', 'strongly', 'suggest', 'that', 'our', 'fel', 'has', 'universal', 'predictive', 'power']]
|
[-0.09656313795255878, 0.08242817991162821, -0.1378172972616339, 0.06048653423986448, -0.06867983600785656, -0.1610469938185747, 0.01784242504346435, 0.3649053244340804, -0.2392045628750116, -0.26009077748023374, 0.050102238036674615, -0.24395885272702622, -0.1361372821478634, 0.24161720393045294, -0.05857291760083328, 0.08207504724663112, 0.03956557809054771, 0.054055213352404936, -0.059783432227108746, -0.15549656161938302, 0.31328555903527683, 0.10721951022103268, 0.35810203863788515, 0.06852374822201748, 0.15540355039505108, 0.042213945649564266, -0.025457016102248622, -0.022516964685525626, -0.13742195674226373, 0.07661804598405637, 0.25279399107701034, 0.1415569251252999, 0.20925122166993798, -0.38188087146088323, -0.24854898543888201, 0.09594030712320599, 0.14597871727360193, 0.06571017975057726, -0.015075202456735555, -0.1863253859963308, 0.006231180939858439, -0.18954367206622197, -0.1710036617393295, -0.12177940024193176, 0.006584057574390724, 0.09067625230458635, -0.2654478069675225, 0.07079567958510691, 0.027826839151682072, 0.052199208137569245, -0.07774857625425342, -0.10813315057506163, -0.05172725003312833, 0.07878627503410943, 0.06881919035422666, 0.022004131601387335, 0.16991073710803864, -0.12669290535111902, -0.0827394851273106, 0.37392654630445665, -0.010468410615939446, -0.21732462884517767, 0.11898472629267201, -0.16911380890236105, -0.10753143863672371, 0.13983967778728573, 0.05280170476024029, 0.10559130319824783, -0.15802630311458982, 0.10658053202073901, -0.0146950512482304, 0.18785815040320558, 0.08667459494374212, 0.035749511042189215, 0.13260371174778468, 0.12567956519803852, 0.02030920662782005, 0.12592103716827208, -0.05112172185283114, -0.13930622779674107, -0.3522964197921977, -0.06589874432682591, -0.20133482056960303, 0.059834451751372905, -0.14402502352529536, -0.1769061833419787, 0.42564081634965634, 0.13848260729022885, 0.14396530492431533, 0.05419642170791023, 0.27663928957816253, 0.16335133750802808, 0.039888337354666445, 0.06495341286063194, 0.21343444561165187, 0.08893239972311803, 0.04571648677110031, -0.2821308655929702, 0.1184735810233941, 0.03599285237210732]
|
1,803.09035
|
Astrochemical Evolution Step From Acenaphthylene C12H8 To Pure Carbon
C12 Around A Herbig Ae Young Star
|
Astrochemical evolution step of polycyclic aromatic hydrocarbon (PAH) around
a Herbig Ae young star was analyzed using the first principles quantum chemical
calculation. For simplicity, model molecule was selected to be acenaphthylene
(C12H8) with hydrocarbon one pentagon combined with two hexagons. In a
protoplanetary disk, molecules are illuminated by high energy photon from the
central star and ionized to be cation (C12H8)n+ . Calculation shows that from
n=0 to 6, molecule keeps its polycyclic hydrocarbon configuration. Whereas, at
ionization step n=7, there occurs dehydrogenation of (C12H8) to pure carbon
(C12). Such polycyclic pure carbon (PPC) would be attacked again by photons. At
a stage of eighth ionization (C12)8+, there occur decomposition to aliphatic
carbon chains, C9, C2, and mono carbon C1. Infrared spectra (IR) of those steps
were calculated to identify observed spectra . Carrier molecules of Herbig Ae
star WW Vul and HD145263 were identified by a combination of (C12H8)2+ and
(C12H8)1+. Also, IR of HD37357 could be explained by (C12H8)2+, (C12H8)3+, and
(C12H8)1+. Pure carbon molecules play an important role in many stars. IR of
HD37258 was analyzed by a mixture of pure carbon (C12)2+, hydrocarbon (C12H8)2+
and neutral (C12H8)0+. Also, complex spectrum of HD38120 was analyzed by
(C12)2+, (C12H8)2+ and (C12H8)3+. Acenaphthylene related molecules are just a
typical example. We should apply various size molecules to understand total
view around a new born star.
|
astro-ph.SR physics.chem-ph
|
astrochemical evolution step of polycyclic aromatic hydrocarbon pah around a herbig ae young star was analyzed using the first principles quantum chemical calculation for simplicity model molecule was selected to be acenaphthylene c12h8 with hydrocarbon one pentagon combined with two hexagons in a protoplanetary disk molecules are illuminated by high energy photon from the central star and ionized to be cation c12h8n calculation shows that from n0 to 6 molecule keeps its polycyclic hydrocarbon configuration whereas at ionization step n7 there occurs dehydrogenation of c12h8 to pure carbon c12 such polycyclic pure carbon ppc would be attacked again by photons at a stage of eighth ionization c128 there occur decomposition to aliphatic carbon chains c9 c2 and mono carbon c1 infrared spectra ir of those steps were calculated to identify observed spectra carrier molecules of herbig ae star ww vul and hd145263 were identified by a combination of c12h82 and c12h81 also ir of hd37357 could be explained by c12h82 c12h83 and c12h81 pure carbon molecules play an important role in many stars ir of hd37258 was analyzed by a mixture of pure carbon c122 hydrocarbon c12h82 and neutral c12h80 also complex spectrum of hd38120 was analyzed by c122 c12h82 and c12h83 acenaphthylene related molecules are just a typical example we should apply various size molecules to understand total view around a new born star
|
[['astrochemical', 'evolution', 'step', 'of', 'polycyclic', 'aromatic', 'hydrocarbon', 'pah', 'around', 'a', 'herbig', 'ae', 'young', 'star', 'was', 'analyzed', 'using', 'the', 'first', 'principles', 'quantum', 'chemical', 'calculation', 'for', 'simplicity', 'model', 'molecule', 'was', 'selected', 'to', 'be', 'acenaphthylene', 'c12h8', 'with', 'hydrocarbon', 'one', 'pentagon', 'combined', 'with', 'two', 'hexagons', 'in', 'a', 'protoplanetary', 'disk', 'molecules', 'are', 'illuminated', 'by', 'high', 'energy', 'photon', 'from', 'the', 'central', 'star', 'and', 'ionized', 'to', 'be', 'cation', 'c12h8n', 'calculation', 'shows', 'that', 'from', 'n0', 'to', '6', 'molecule', 'keeps', 'its', 'polycyclic', 'hydrocarbon', 'configuration', 'whereas', 'at', 'ionization', 'step', 'n7', 'there', 'occurs', 'dehydrogenation', 'of', 'c12h8', 'to', 'pure', 'carbon', 'c12', 'such', 'polycyclic', 'pure', 'carbon', 'ppc', 'would', 'be', 'attacked', 'again', 'by', 'photons', 'at', 'a', 'stage', 'of', 'eighth', 'ionization', 'c128', 'there', 'occur', 'decomposition', 'to', 'aliphatic', 'carbon', 'chains', 'c9', 'c2', 'and', 'mono', 'carbon', 'c1', 'infrared', 'spectra', 'ir', 'of', 'those', 'steps', 'were', 'calculated', 'to', 'identify', 'observed', 'spectra', 'carrier', 'molecules', 'of', 'herbig', 'ae', 'star', 'ww', 'vul', 'and', 'hd145263', 'were', 'identified', 'by', 'a', 'combination', 'of', 'c12h82', 'and', 'c12h81', 'also', 'ir', 'of', 'hd37357', 'could', 'be', 'explained', 'by', 'c12h82', 'c12h83', 'and', 'c12h81', 'pure', 'carbon', 'molecules', 'play', 'an', 'important', 'role', 'in', 'many', 'stars', 'ir', 'of', 'hd37258', 'was', 'analyzed', 'by', 'a', 'mixture', 'of', 'pure', 'carbon', 'c122', 'hydrocarbon', 'c12h82', 'and', 'neutral', 'c12h80', 'also', 'complex', 'spectrum', 'of', 'hd38120', 'was', 'analyzed', 'by', 'c122', 'c12h82', 'and', 'c12h83', 'acenaphthylene', 'related', 'molecules', 'are', 'just', 'a', 'typical', 'example', 'we', 'should', 'apply', 'various', 'size', 'molecules', 'to', 'understand', 'total', 'view', 'around', 'a', 'new', 'born', 'star']]
|
[-0.027050591148886353, 0.13418325276465765, -0.017074120813049376, 0.0415860364874737, 0.02867725661534043, -0.16122986172448914, 0.05673940527419788, 0.4562665016460672, -0.2112809756906914, -0.28848693601760733, 0.028142822375916438, -0.30964339171747135, -0.026234723945512912, 0.09147553899509937, -0.010734784052232807, -0.03918909367183795, 0.04452108457752609, -0.087740445658916, 0.04456704857271551, -0.21083698959149122, 0.24892234253446693, 0.07660009687764237, 0.16119364276308706, 0.05640048413748308, -0.012393067237253318, -0.08776843727386188, -0.033380940678432794, -0.03895945451112534, -0.12994939228427133, 0.10693242379303863, 0.29657559111200377, 0.025938795262262365, 0.1633721855955027, -0.4203539429147912, -0.21186668076113147, 0.050352553858966476, 0.1479429140091733, 0.09356624461525946, -0.056309979887682514, -0.20987663806069046, 0.06510714753882361, -0.14773399775182247, -0.16059296528088315, -0.0003282791398957653, 0.06740757420314213, 0.019519427406847617, -0.2074769909168541, 0.0692903290259463, 0.02778953271215114, 0.11436327212470372, -0.10640102492717868, -0.19997066849587872, -0.15388999949483956, 0.07141696726288295, 0.01652055872655869, 0.04185860150851713, 0.26755222359964326, -0.0926232851848428, -0.06514947879664108, 0.4384889939958054, -0.1446932871509695, -0.026890627725735167, 0.24673849264300377, -0.1551427621974276, -0.2197011159337565, 0.27263244918222485, 0.049772313711417944, 0.15772120669519282, -0.1827303807257745, 0.028140898464733013, -0.02816400147385825, 0.18961994849224487, 0.15217551866651707, 0.06842253917283467, 0.2781517576373551, 0.13775195544453794, -0.04105374479764097, 0.17884315134856393, -0.15139936093451842, -0.06808031450123482, -0.19807482983344257, -0.18763889672392803, -0.1528261862673252, 0.09963734764487697, -0.048423483513170995, -0.1098175324622612, 0.2900068246021445, -0.012857821338397081, 0.14283957876229905, -0.08059723306222674, 0.203000563776718, 0.07819009790765913, 0.11226951802711722, 0.023300910573935945, 0.2407688185427654, 0.17786824663569448, 0.07291831293160904, -0.23988816456293757, 0.08426738580477969, 0.04227444254639471]
|
1,803.09036
|
Adaptive beam loading compensation in room temperature bunching cavities
|
In this paper we present the design, simulation, and proof of principle
results of an optimization based adaptive feed-forward algorithm for
beam-loading compensation in a high impedance room temperature cavity. We begin
with an overview of prior developments in beam loading compensation. Then we
discuss different techniques for adaptive beam loading compensation and why the
use of Newton's Method is of interest for this application. This is followed by
simulation and initial experimental results of this method.
|
physics.acc-ph
|
in this paper we present the design simulation and proof of principle results of an optimization based adaptive feedforward algorithm for beamloading compensation in a high impedance room temperature cavity we begin with an overview of prior developments in beam loading compensation then we discuss different techniques for adaptive beam loading compensation and why the use of newtons method is of interest for this application this is followed by simulation and initial experimental results of this method
|
[['in', 'this', 'paper', 'we', 'present', 'the', 'design', 'simulation', 'and', 'proof', 'of', 'principle', 'results', 'of', 'an', 'optimization', 'based', 'adaptive', 'feedforward', 'algorithm', 'for', 'beamloading', 'compensation', 'in', 'a', 'high', 'impedance', 'room', 'temperature', 'cavity', 'we', 'begin', 'with', 'an', 'overview', 'of', 'prior', 'developments', 'in', 'beam', 'loading', 'compensation', 'then', 'we', 'discuss', 'different', 'techniques', 'for', 'adaptive', 'beam', 'loading', 'compensation', 'and', 'why', 'the', 'use', 'of', 'newtons', 'method', 'is', 'of', 'interest', 'for', 'this', 'application', 'this', 'is', 'followed', 'by', 'simulation', 'and', 'initial', 'experimental', 'results', 'of', 'this', 'method']]
|
[-0.09063821673610961, 0.07665960296312674, -0.11826860520069475, -0.03958414968212026, -0.06459687564328506, -0.14131540552918592, 0.042250684922101434, 0.45364075086333533, -0.22951443894923507, -0.3143174862489104, 0.13079452056867863, -0.19344438746716683, -0.1896373876793818, 0.2397273321236883, -0.10675713638835527, 0.09419974462770216, 0.07097952789929393, -0.054075067227875646, -0.08901403539635652, -0.23520414482850532, 0.29643356685024724, 0.1278929320563163, 0.3222729642694066, 0.08548014649710098, 0.16358943579887802, 0.04773294919037393, -0.02247720176668523, 0.010484119544603996, -0.16281117556931138, 0.12709425205770009, 0.25012201450571614, 0.14015251580722532, 0.32155973972244695, -0.4148085032372022, -0.17583548368329738, 0.03367919437345359, 0.13490951976847726, 0.18044354810149638, -0.17509956951797395, -0.20475643386991768, 0.06749407085892442, -0.17269714728191302, -0.12658453421280175, -0.0791275208912693, -0.06962630671582051, 0.03939108783983952, -0.315098265040811, 0.02853645718136391, 0.0659365825863047, 0.11618134892219073, -0.08290946628753242, -0.10811682084164062, 0.12462558356029066, 0.04211171016145449, 0.005923516002132908, 0.009626876054839655, 0.13730690581724048, -0.07701047644164268, -0.1192160424014384, 0.33532654218278923, -0.01956584606948611, -0.15606213520680154, 0.12606908892305543, -0.06279711981074183, -0.1075681180439212, 0.11347824635056707, 0.21442919240224284, 0.1063412808353541, -0.1529301760306993, 0.010034077635258678, 0.02302561616887907, 0.14821827610011223, 0.04741663668099065, -0.020358356175484597, 0.13659379233200974, 0.2562598202425938, 0.07333053757932473, 0.18817517385733398, -0.07800962845492479, -0.03740667937589543, -0.332587555800746, -0.16368115530046937, -0.17269717964839626, 0.005361628313488387, -0.07269382645476567, -0.11056769999989925, 0.3885538332744852, 0.2376077813277771, 0.1639331216113521, 0.03784347921700592, 0.39510968477501496, 0.10277909209782427, -0.004083852498344593, 0.02147802590791668, 0.24074015365580895, 0.11253229167324479, 0.15749796635362429, -0.2702610388370956, 0.0242579176314417, 0.044798499275627846]
|
1,803.09037
|
LLRF controls in SuperKEKB Phase-1 commissioning
|
First beam commissioning of SuperKEKB (Phase-1), which is an asymmetry double
ring collider of 7-GeV electron and 4-GeV positron beams, which had started
from February, has been successfully accomplished at the end of June 2016, and
the desired beam current for Phase-1 was achieved in both rings. This paper
summarize the operation results related to low level RF (LLRF) control issues
during the Phase-1 commissioning, including the system tuning, the coupled
bunch instability and the bunch gap transient effect. RF system of SuperKEKB
consists of about thirty klystron stations in both rings. Newly developed LLRF
control systems were applied to the nine stations among the thirty for Phase-1.
The RF reference signal distribution system has been also upgraded for
SuperKEKB. These new systems worked well without serious problem and they
contributed to smooth progress of the commissioning. The old existing systems,
which had been used in the KEKB operation, were still reused for the most
stations, and they also worked as soundly as performed in the KEKB operation.
|
physics.acc-ph
|
first beam commissioning of superkekb phase1 which is an asymmetry double ring collider of 7gev electron and 4gev positron beams which had started from february has been successfully accomplished at the end of june 2016 and the desired beam current for phase1 was achieved in both rings this paper summarize the operation results related to low level rf llrf control issues during the phase1 commissioning including the system tuning the coupled bunch instability and the bunch gap transient effect rf system of superkekb consists of about thirty klystron stations in both rings newly developed llrf control systems were applied to the nine stations among the thirty for phase1 the rf reference signal distribution system has been also upgraded for superkekb these new systems worked well without serious problem and they contributed to smooth progress of the commissioning the old existing systems which had been used in the kekb operation were still reused for the most stations and they also worked as soundly as performed in the kekb operation
|
[['first', 'beam', 'commissioning', 'of', 'superkekb', 'phase1', 'which', 'is', 'an', 'asymmetry', 'double', 'ring', 'collider', 'of', '7gev', 'electron', 'and', '4gev', 'positron', 'beams', 'which', 'had', 'started', 'from', 'february', 'has', 'been', 'successfully', 'accomplished', 'at', 'the', 'end', 'of', 'june', '2016', 'and', 'the', 'desired', 'beam', 'current', 'for', 'phase1', 'was', 'achieved', 'in', 'both', 'rings', 'this', 'paper', 'summarize', 'the', 'operation', 'results', 'related', 'to', 'low', 'level', 'rf', 'llrf', 'control', 'issues', 'during', 'the', 'phase1', 'commissioning', 'including', 'the', 'system', 'tuning', 'the', 'coupled', 'bunch', 'instability', 'and', 'the', 'bunch', 'gap', 'transient', 'effect', 'rf', 'system', 'of', 'superkekb', 'consists', 'of', 'about', 'thirty', 'klystron', 'stations', 'in', 'both', 'rings', 'newly', 'developed', 'llrf', 'control', 'systems', 'were', 'applied', 'to', 'the', 'nine', 'stations', 'among', 'the', 'thirty', 'for', 'phase1', 'the', 'rf', 'reference', 'signal', 'distribution', 'system', 'has', 'been', 'also', 'upgraded', 'for', 'superkekb', 'these', 'new', 'systems', 'worked', 'well', 'without', 'serious', 'problem', 'and', 'they', 'contributed', 'to', 'smooth', 'progress', 'of', 'the', 'commissioning', 'the', 'old', 'existing', 'systems', 'which', 'had', 'been', 'used', 'in', 'the', 'kekb', 'operation', 'were', 'still', 'reused', 'for', 'the', 'most', 'stations', 'and', 'they', 'also', 'worked', 'as', 'soundly', 'as', 'performed', 'in', 'the', 'kekb', 'operation']]
|
[-0.12598396938881792, 0.10290871329553261, -0.06553437665293348, 0.015842240933644853, -0.042611455474148636, -0.19099755359015294, -0.013758033143295463, 0.37729424258716227, -0.1828859708752827, -0.34702569761429913, 0.16575258775957905, -0.27680801252704224, -0.03515247131941751, 0.24280782491578498, -0.057178369512604105, 0.1445119619609267, 0.09347066055453893, -0.02482299679485593, -0.045365316408736235, -0.30063045925427495, 0.2313053329084401, 0.2021321977995935, 0.3262056198436767, 0.017337944646853776, 0.13235233849540928, -0.01584997424383584, -0.020608085534019795, -0.06618545749820658, -0.04967918690332832, 0.01706511576464566, 0.3085613832032929, 0.13482393494424677, 0.24962209460569457, -0.47269089414649423, -0.12067550447786093, 0.06725314559090682, 0.13462668579554052, 0.04546507607197522, -0.05650414083183499, -0.30929048757423605, 0.07369159629368889, -0.26691494567231056, -0.14705831440819783, 0.016723726906569765, 0.010779183790353792, 0.042752470233522, -0.2253204938717231, -0.06529065497653348, 0.017323073309463716, 0.10340673884604171, -0.013860504770751245, -0.18027496652558467, 0.03552735154932764, 0.12391974724319187, -0.0028447251374711328, 0.04099591231681102, 0.15173779786120922, -0.07827722901129164, -0.15113560459022188, 0.31803518478825155, 0.0036485738810803185, -0.025875099902761923, 0.1633953266067519, -0.1985630288171316, -0.12640684853804054, 0.1596177212126176, 0.21810662972607783, 0.027136215371900193, -0.21446798024477348, 0.05307664023694954, 0.041903358740022496, 0.15327835763344497, 0.14050877363132758, 0.011478068236361392, 0.23892710050789728, 0.223618034689155, 0.08070045017510503, 0.12324742308313337, -0.131883390687844, -0.025668903231798185, -0.30047903074106824, -0.08992103629723369, -0.1001996646976165, -0.011015286764761965, 0.11861659059554984, -0.033270833015974076, 0.4478821784945294, 0.09795807580563373, 0.12330536958428898, -0.07837004582550089, 0.30718459996084374, 0.07213732199826543, 0.09203288809017283, 0.042534804632980795, 0.30252865745985347, 0.11465212643157602, 0.23343950786095644, -0.21568069153831207, 0.02424859231714869, -0.011638265419086176]
|
1,803.09038
|
Simulation of microphonic effects in high $Q_L$ TESLA cavities during CW
operations
|
This document describes a new package to compute high performance simulations
of a module of superconducting accelerating cavities from the LLRF controller
perspective. The reason to make a dedicated C++/Python package is to simulate
all the effects that arise during Continuous Wave (CW) operations at different
timescales to speed-up the LLRF controller design. In particular the speed of
the sampling rate of the ADCs used in a LLRF control system (some MHz) are
$10^4$ - $10^5$ times faster than typical mechanical resonances and
microphonics frequencies.
|
physics.acc-ph
|
this document describes a new package to compute high performance simulations of a module of superconducting accelerating cavities from the llrf controller perspective the reason to make a dedicated cpython package is to simulate all the effects that arise during continuous wave cw operations at different timescales to speedup the llrf controller design in particular the speed of the sampling rate of the adcs used in a llrf control system some mhz are 104 105 times faster than typical mechanical resonances and microphonics frequencies
|
[['this', 'document', 'describes', 'a', 'new', 'package', 'to', 'compute', 'high', 'performance', 'simulations', 'of', 'a', 'module', 'of', 'superconducting', 'accelerating', 'cavities', 'from', 'the', 'llrf', 'controller', 'perspective', 'the', 'reason', 'to', 'make', 'a', 'dedicated', 'cpython', 'package', 'is', 'to', 'simulate', 'all', 'the', 'effects', 'that', 'arise', 'during', 'continuous', 'wave', 'cw', 'operations', 'at', 'different', 'timescales', 'to', 'speedup', 'the', 'llrf', 'controller', 'design', 'in', 'particular', 'the', 'speed', 'of', 'the', 'sampling', 'rate', 'of', 'the', 'adcs', 'used', 'in', 'a', 'llrf', 'control', 'system', 'some', 'mhz', 'are', '104', '105', 'times', 'faster', 'than', 'typical', 'mechanical', 'resonances', 'and', 'microphonics', 'frequencies']]
|
[-0.1753375524179622, 0.10335203149311599, -0.04591529757627064, 0.008884456418898134, -0.06809355566344623, -0.17597825696603173, 0.03377322546605553, 0.3937265436564173, -0.24408883735581877, -0.3079681591396885, 0.11856144064638231, -0.20169837459633572, -0.07649849455836895, 0.299221740547745, -0.05962702514842108, 0.08321308055227357, 0.08254264888819307, -0.012311458656941318, -0.07226955267279186, -0.18917581675175046, 0.19350313222856216, 0.1313243984283569, 0.2809439358811471, -0.044071794872815234, 0.14027717679744542, -0.08829995840399836, 0.018766854218916877, -0.10188158774482352, -0.11735782263167494, 0.04132714163001981, 0.2995323883369565, 0.13526752026795985, 0.3133379129049856, -0.446808849228546, -0.1481104106198819, 0.04839810193516314, 0.09738478550467075, 0.09239614635173764, -0.006374743767082691, -0.23144047827060735, 0.10260799830956828, -0.2331221243366599, -0.12239606517721854, -0.03208738269694593, -0.012489128284089799, 0.03236913909426048, -0.27132896877204377, 0.006579166483355775, -0.005109215194048981, 0.0592200000703867, -0.032413526388284354, -0.07759334356939819, 0.040831719796794154, 0.08375737488053606, -0.018533632084394673, 0.07127814809237384, 0.217974796159459, -0.07452743677588712, -0.13164868567227608, 0.36009187639934853, -0.04306264386399389, -0.1345403875069072, 0.20245600794996357, -0.17192151710124953, -0.08956609192925195, 0.19509654263744042, 0.25310456364726025, 0.03552273750981493, -0.1701436776701095, 0.014592936949200174, 0.09824553934785876, 0.24253061396025477, 0.07924897831565302, 0.06540160494512834, 0.1564677707945174, 0.21064658575813242, 0.015402149397968537, 0.15976406985317312, -0.070007353932375, -0.07125952248627852, -0.25594316542680773, -0.1255882728977927, -0.13576278552257767, 0.006130848454631632, -0.057569535620825174, -0.11872656630086047, 0.4525410660121235, 0.22166314081377572, 0.122222255571701, 0.038702044547313734, 0.3649641130385654, 0.0810403541018743, 0.09325607991333873, 0.10123101345518426, 0.2431302652545301, 0.09632539274779058, 0.15136481058739482, -0.24812447552713343, -0.02149155834091029, -0.00987649364729545]
|
1,803.09039
|
Commissioning and performance of a phase-compensated optical link for
the AWAKE experiment at CERN
|
In this work, we analyze the performance of the solution adopted for the
compensation of the phase drift of a 3 km optical fiber link used for the AWAKE
experiment at CERN. The link is devoted to transmit the reference signals used
to synchronize the SPS beam with the experiment to have a fixed phase relation,
regardless of the external conditions of the electronics and the link itself.
The system has been operating for more than a year without observed drift in
the beam phases. Specific measurements have proven that the jitter introduced
by the system is lower than 0.6 ps and the maximum phase drift of the link is
at the picosecond level.
|
physics.acc-ph
|
in this work we analyze the performance of the solution adopted for the compensation of the phase drift of a 3 km optical fiber link used for the awake experiment at cern the link is devoted to transmit the reference signals used to synchronize the sps beam with the experiment to have a fixed phase relation regardless of the external conditions of the electronics and the link itself the system has been operating for more than a year without observed drift in the beam phases specific measurements have proven that the jitter introduced by the system is lower than 06 ps and the maximum phase drift of the link is at the picosecond level
|
[['in', 'this', 'work', 'we', 'analyze', 'the', 'performance', 'of', 'the', 'solution', 'adopted', 'for', 'the', 'compensation', 'of', 'the', 'phase', 'drift', 'of', 'a', '3', 'km', 'optical', 'fiber', 'link', 'used', 'for', 'the', 'awake', 'experiment', 'at', 'cern', 'the', 'link', 'is', 'devoted', 'to', 'transmit', 'the', 'reference', 'signals', 'used', 'to', 'synchronize', 'the', 'sps', 'beam', 'with', 'the', 'experiment', 'to', 'have', 'a', 'fixed', 'phase', 'relation', 'regardless', 'of', 'the', 'external', 'conditions', 'of', 'the', 'electronics', 'and', 'the', 'link', 'itself', 'the', 'system', 'has', 'been', 'operating', 'for', 'more', 'than', 'a', 'year', 'without', 'observed', 'drift', 'in', 'the', 'beam', 'phases', 'specific', 'measurements', 'have', 'proven', 'that', 'the', 'jitter', 'introduced', 'by', 'the', 'system', 'is', 'lower', 'than', '06', 'ps', 'and', 'the', 'maximum', 'phase', 'drift', 'of', 'the', 'link', 'is', 'at', 'the', 'picosecond', 'level']]
|
[-0.156854945342179, 0.13594599197855578, -0.09200682902806684, 0.024902933199579518, -0.013934643547001638, -0.16102159835741317, 0.055711981628024786, 0.374181717699557, -0.22084834308592244, -0.3170772393544515, 0.1287282960624189, -0.2792196631709343, -0.06385331583748523, 0.19531731155145457, -0.03208554683972085, 0.07390437016198248, 0.03587929457180986, 0.04794070101343095, -0.06029450631978219, -0.1985342473857791, 0.27102752775464434, 0.13474230232174722, 0.31969070339804156, 0.010958402760718999, 0.15102783191883773, -0.024197115926398782, -0.0037623165877895396, -0.03549378588305492, -0.12758649698809135, 0.057750080581427665, 0.22395546886694143, 0.07995682182158098, 0.24249615882964512, -0.41090956293128167, -0.20061684324275375, 0.10758503799718853, 0.09020748385126098, 0.07648240542856224, -0.04867344889894491, -0.2518340838795299, 0.11613409428677537, -0.16513991161461986, -0.12882374936567717, 0.050351157482190614, 0.00752343186749178, 0.03161816102893729, -0.24418324379152373, 0.015865437784477285, 0.0280896894584753, 0.09303819144904417, -0.028387421554183227, -0.08438305958509118, 0.009625563602240985, 0.14938935221238225, 0.00665336997011317, 0.0812467380680589, 0.11647208296824574, -0.11551331798750254, -0.08573785271244305, 0.38299172948392335, -0.06455523209577925, -0.16061633648841003, 0.18002835207765824, -0.19035989089612135, -0.05129693338868061, 0.17963845936352746, 0.18194697944349364, 0.04980798210262468, -0.16047922606588128, -0.007089788691557355, 0.039482348810946734, 0.20254590053911925, 0.0896781918576412, 0.033225114069258176, 0.17855319215123655, 0.21625440321421543, 0.10761985463894937, 0.12814949181649768, -0.14890431100911086, -0.05107987617967617, -0.2812846466473083, -0.141873233983285, -0.1679400881229524, -0.006822302034778292, -0.03339674426962646, -0.04700435131069338, 0.4395995883213912, 0.1511600153928412, 0.15680023181056113, 0.03308460865324984, 0.3118430357160896, 0.14012897126233662, 0.08865565454726222, 0.013737549799036953, 0.3129730096389131, 0.12414560855872799, 0.17498394987431534, -0.24553874904175468, 0.10347943359234354, -0.0014756167340174056]
|
1,803.0904
|
A Bounded Formulation for The School Bus Scheduling Problem
|
This paper proposes a new formulation for the school bus scheduling problem
(SBSP) which optimizes school start times and bus operation times to minimize
transportation cost. Our goal is to minimize the number of buses to serve all
bus routes such that each route arrives in a time window before school starts.
We present a new time-indexed integer linear programming (ILP) formulation for
this problem. Based on a strengthened version of the linear relaxation of the
ILP, we develop a dependent randomized rounding algorithm that yields
near-optimal solutions for large-scale problem instances. We also generalize
our methodologies to solve a robust version of the SBSP.
|
math.OC cs.DS
|
this paper proposes a new formulation for the school bus scheduling problem sbsp which optimizes school start times and bus operation times to minimize transportation cost our goal is to minimize the number of buses to serve all bus routes such that each route arrives in a time window before school starts we present a new timeindexed integer linear programming ilp formulation for this problem based on a strengthened version of the linear relaxation of the ilp we develop a dependent randomized rounding algorithm that yields nearoptimal solutions for largescale problem instances we also generalize our methodologies to solve a robust version of the sbsp
|
[['this', 'paper', 'proposes', 'a', 'new', 'formulation', 'for', 'the', 'school', 'bus', 'scheduling', 'problem', 'sbsp', 'which', 'optimizes', 'school', 'start', 'times', 'and', 'bus', 'operation', 'times', 'to', 'minimize', 'transportation', 'cost', 'our', 'goal', 'is', 'to', 'minimize', 'the', 'number', 'of', 'buses', 'to', 'serve', 'all', 'bus', 'routes', 'such', 'that', 'each', 'route', 'arrives', 'in', 'a', 'time', 'window', 'before', 'school', 'starts', 'we', 'present', 'a', 'new', 'timeindexed', 'integer', 'linear', 'programming', 'ilp', 'formulation', 'for', 'this', 'problem', 'based', 'on', 'a', 'strengthened', 'version', 'of', 'the', 'linear', 'relaxation', 'of', 'the', 'ilp', 'we', 'develop', 'a', 'dependent', 'randomized', 'rounding', 'algorithm', 'that', 'yields', 'nearoptimal', 'solutions', 'for', 'largescale', 'problem', 'instances', 'we', 'also', 'generalize', 'our', 'methodologies', 'to', 'solve', 'a', 'robust', 'version', 'of', 'the', 'sbsp']]
|
[-0.1527383243842494, 0.03866948508879259, -0.10519212783269939, 0.04144461097617057, -0.15401108463161758, -0.22342778725460882, 0.13395027468490991, 0.33993727476114316, -0.3106024545573053, -0.3422338654774995, 0.12004205547384031, -0.21992315505575832, -0.17814709856840116, 0.20519659068612825, -0.14267505972779224, 0.09131968568655707, 0.09450461810366029, -0.021690200082957745, -0.05888226122562108, -0.29554997406722533, 0.20408569851646288, 0.06298705154054221, 0.271313023930859, 0.02179265977326958, 0.1553587743823993, 0.05823955856973217, 0.03481027777084992, 0.054735729621634595, -0.10104236269350318, 0.11761202065917176, 0.3317367099402916, 0.20574910814119945, 0.3666280863540513, -0.4490956121434768, -0.12649597542449123, 0.08116802021173672, 0.06666229264921553, 0.13494061565447954, -0.032481393624939736, -0.19865805056123506, 0.0851371953973458, -0.1295300813657897, -0.07515017376059578, -0.008786635670722241, -0.01783253995790368, -0.03290570102454651, -0.32295280435965174, 0.01401755111307596, 0.014340540766716004, 0.0015331477124986815, -0.06212235674528139, -0.12979542770910832, 0.08845228221533553, 0.07876251912842105, 0.005457648867741227, 0.04732162413142976, 0.09479372407575803, -0.022341223750706938, -0.22696062692308, 0.3944805057453258, -0.007854557950936612, -0.17970165730941864, 0.12720003955154902, 0.024572304467714967, -0.18599761300055043, 0.08323587364561501, 0.29627907602116466, 0.16044108880728128, -0.17016011623754387, 0.025480013566335575, -0.04154517123741763, 0.17501826180655156, 0.044076785179121156, -0.03299995283817961, 0.165938335903255, 0.23087618013932593, 0.22168263965951546, 0.1937037445970678, -0.008069280464024772, -0.09793416413345507, -0.28042890884514365, -0.1615245231737693, -0.17711334665017647, 0.02150502965031635, -0.07091800360261308, -0.126311319897927, 0.43026114840592655, 0.18505134713791666, 0.141065615114002, 0.18069373819910522, 0.3092148889388357, 0.15135084270233554, 0.018407428342782493, 0.16433239713577288, 0.12300600623268457, 0.03715978710956517, 0.1712385811842978, -0.24954017465934158, 0.03171267102339438, 0.12572977693662757]
|
1,803.09041
|
A 1 GHz RF Trigger Unit implemented in FPGA logic
|
Applications of Trigger Units (TU) can be found in almost all accelerators at
CERN. The requirements in terms of operating frequencies, configuration or
modes of operation change from one application to another, how-ever, in terms
of design requirements for the Trigger Unit, the operating frequency is
probably the most demanding one. In this work, we present an implementation of
a Trigger Unit almost fully embedded in the FPGA logic operating at a maximum
frequency of 1 GHz using the internal serializer/deserializer circuitry to
simplify the timing constraints of the design. This implementation allows easy
reconfiguration of the module and the development of new modes of operation,
which are described in this paper.
|
physics.acc-ph
|
applications of trigger units tu can be found in almost all accelerators at cern the requirements in terms of operating frequencies configuration or modes of operation change from one application to another however in terms of design requirements for the trigger unit the operating frequency is probably the most demanding one in this work we present an implementation of a trigger unit almost fully embedded in the fpga logic operating at a maximum frequency of 1 ghz using the internal serializerdeserializer circuitry to simplify the timing constraints of the design this implementation allows easy reconfiguration of the module and the development of new modes of operation which are described in this paper
|
[['applications', 'of', 'trigger', 'units', 'tu', 'can', 'be', 'found', 'in', 'almost', 'all', 'accelerators', 'at', 'cern', 'the', 'requirements', 'in', 'terms', 'of', 'operating', 'frequencies', 'configuration', 'or', 'modes', 'of', 'operation', 'change', 'from', 'one', 'application', 'to', 'another', 'however', 'in', 'terms', 'of', 'design', 'requirements', 'for', 'the', 'trigger', 'unit', 'the', 'operating', 'frequency', 'is', 'probably', 'the', 'most', 'demanding', 'one', 'in', 'this', 'work', 'we', 'present', 'an', 'implementation', 'of', 'a', 'trigger', 'unit', 'almost', 'fully', 'embedded', 'in', 'the', 'fpga', 'logic', 'operating', 'at', 'a', 'maximum', 'frequency', 'of', '1', 'ghz', 'using', 'the', 'internal', 'serializerdeserializer', 'circuitry', 'to', 'simplify', 'the', 'timing', 'constraints', 'of', 'the', 'design', 'this', 'implementation', 'allows', 'easy', 'reconfiguration', 'of', 'the', 'module', 'and', 'the', 'development', 'of', 'new', 'modes', 'of', 'operation', 'which', 'are', 'described', 'in', 'this', 'paper']]
|
[-0.18888522328825685, 0.10695694067197126, -0.023172791090768738, -0.04350267782564032, -0.06443431239726173, -0.1291733019909746, 0.030371012620267097, 0.36770263371301126, -0.2649807769706607, -0.3270430196714294, 0.16011793149408657, -0.18551615063693094, -0.10148491369149236, 0.2383611577055375, -0.060157687235455795, 0.03418742431021455, 0.0652855255406115, 0.036783941295669156, -0.050862255141239716, -0.20708937257180107, 0.2295345610787941, 0.12991302381563294, 0.28600251326454923, 0.024233450043342403, 0.105276064703929, -0.014816398162873008, 0.019643440578334236, -0.056498438254133004, -0.04632949842945547, 0.1256719608287755, 0.31420861879103557, 0.14984168437401857, 0.26845032928368867, -0.4585676110425108, -0.12860398913255414, 0.06252312400327945, 0.11158266841740189, 0.038301408830988176, -0.012614957931627696, -0.1930691802681231, 0.09040596995603394, -0.19935029495910211, -0.1351904325891991, -0.015700745648024855, -0.0006066052629067017, 0.02878398834916486, -0.25438903142941427, -0.029747799022106437, 0.07058208778097823, 0.05972616695840885, -0.04758827259338268, -0.07049114467274095, 0.028480709857634595, 0.1124034750480876, -0.030487162147036142, 0.030399671499827155, 0.15343989764113683, -0.1103775328516054, -0.14613690685380148, 0.3687161719552367, 0.0031434494649639003, -0.1724947139050241, 0.1923714907890236, -0.14724820631614946, -0.15865749126585485, 0.11571282876638679, 0.19185454088791803, 0.06924654254773716, -0.17721295520990482, 0.07126572087931768, 0.0981883566054675, 0.19270812087851735, 0.0991201272301443, 0.10122469543722702, 0.2060172845806658, 0.24538806310292702, 0.08003135329229874, 0.17436453856859221, -0.0772589673414021, -0.03730310213978629, -0.34907153023088033, -0.14662601017216975, -0.15362587043499523, 0.004123628026292437, -0.007082267179702375, -0.13342498401431618, 0.46812094465267284, 0.1619547257443202, 0.1501944882140772, 0.028922193005118887, 0.3420262277998903, 0.12497074254326992, 0.16137310894424314, 0.08733667676160867, 0.25162730858711574, 0.07236404586079959, 0.1524793648471435, -0.1988762371380486, 0.03700312726233188, -0.020488410170802527]
|
1,803.09042
|
Piezo control for XFEL
|
The superconducting cavities operated at high Q level need to be precisely
tuned to the RF frequency. Well tuned cavities assure the good field stability
and require a minimum level of RF power to reach the operating gradient level.
The TESLA cavities at XFEL accelerator are tuned using slow (step motors) and
fast (piezo) tuners driven by the control system. The goal of this control
system is to keep the detuning of the cavity as close to zero as possible even
in the presence of disturbing effects (LFD - Lorentz Force Detuning and
microphonics). The step motor tuners are used to coarse cavity tuning while
piezo actuators are used to fine-tuning and disturbance compensation. The
crucial part of the piezo control system is the piezo driver. To compensate LFD
the piezo driving with relatively high voltage (up to 100V) and high current
(up to 1A) is needed. Since the piezo components are susceptible to destruction
with overvoltage, overcurrent, and also overtemperature, one has to pay special
attention to keep the piezos healthy. What makes things worse and more
critical, is that the piezo exchange is not possible after the module is
assembled. Therefore the special hardware must be assisting the power
amplifier, detecting the dangerous conditions and disabling piezo operation
when needed. It must be fail-safe, so even in a case of failure the piezos
shall survive. It must be also robust and it must not disturb or disable normal
operation. Due to many channels (16 for master/slave RF), the hardware solution
must be well scalable. The paper discuss the design of XFEL's piezo driver
together with PEM (Power and Energy Monitor) supervising the driver operation
and preventing piezos from destruction. The achieved results and operation of
the complete system are demonstrated.
|
physics.acc-ph
|
the superconducting cavities operated at high q level need to be precisely tuned to the rf frequency well tuned cavities assure the good field stability and require a minimum level of rf power to reach the operating gradient level the tesla cavities at xfel accelerator are tuned using slow step motors and fast piezo tuners driven by the control system the goal of this control system is to keep the detuning of the cavity as close to zero as possible even in the presence of disturbing effects lfd lorentz force detuning and microphonics the step motor tuners are used to coarse cavity tuning while piezo actuators are used to finetuning and disturbance compensation the crucial part of the piezo control system is the piezo driver to compensate lfd the piezo driving with relatively high voltage up to 100v and high current up to 1a is needed since the piezo components are susceptible to destruction with overvoltage overcurrent and also overtemperature one has to pay special attention to keep the piezos healthy what makes things worse and more critical is that the piezo exchange is not possible after the module is assembled therefore the special hardware must be assisting the power amplifier detecting the dangerous conditions and disabling piezo operation when needed it must be failsafe so even in a case of failure the piezos shall survive it must be also robust and it must not disturb or disable normal operation due to many channels 16 for masterslave rf the hardware solution must be well scalable the paper discuss the design of xfels piezo driver together with pem power and energy monitor supervising the driver operation and preventing piezos from destruction the achieved results and operation of the complete system are demonstrated
|
[['the', 'superconducting', 'cavities', 'operated', 'at', 'high', 'q', 'level', 'need', 'to', 'be', 'precisely', 'tuned', 'to', 'the', 'rf', 'frequency', 'well', 'tuned', 'cavities', 'assure', 'the', 'good', 'field', 'stability', 'and', 'require', 'a', 'minimum', 'level', 'of', 'rf', 'power', 'to', 'reach', 'the', 'operating', 'gradient', 'level', 'the', 'tesla', 'cavities', 'at', 'xfel', 'accelerator', 'are', 'tuned', 'using', 'slow', 'step', 'motors', 'and', 'fast', 'piezo', 'tuners', 'driven', 'by', 'the', 'control', 'system', 'the', 'goal', 'of', 'this', 'control', 'system', 'is', 'to', 'keep', 'the', 'detuning', 'of', 'the', 'cavity', 'as', 'close', 'to', 'zero', 'as', 'possible', 'even', 'in', 'the', 'presence', 'of', 'disturbing', 'effects', 'lfd', 'lorentz', 'force', 'detuning', 'and', 'microphonics', 'the', 'step', 'motor', 'tuners', 'are', 'used', 'to', 'coarse', 'cavity', 'tuning', 'while', 'piezo', 'actuators', 'are', 'used', 'to', 'finetuning', 'and', 'disturbance', 'compensation', 'the', 'crucial', 'part', 'of', 'the', 'piezo', 'control', 'system', 'is', 'the', 'piezo', 'driver', 'to', 'compensate', 'lfd', 'the', 'piezo', 'driving', 'with', 'relatively', 'high', 'voltage', 'up', 'to', '100v', 'and', 'high', 'current', 'up', 'to', '1a', 'is', 'needed', 'since', 'the', 'piezo', 'components', 'are', 'susceptible', 'to', 'destruction', 'with', 'overvoltage', 'overcurrent', 'and', 'also', 'overtemperature', 'one', 'has', 'to', 'pay', 'special', 'attention', 'to', 'keep', 'the', 'piezos', 'healthy', 'what', 'makes', 'things', 'worse', 'and', 'more', 'critical', 'is', 'that', 'the', 'piezo', 'exchange', 'is', 'not', 'possible', 'after', 'the', 'module', 'is', 'assembled', 'therefore', 'the', 'special', 'hardware', 'must', 'be', 'assisting', 'the', 'power', 'amplifier', 'detecting', 'the', 'dangerous', 'conditions', 'and', 'disabling', 'piezo', 'operation', 'when', 'needed', 'it', 'must', 'be', 'failsafe', 'so', 'even', 'in', 'a', 'case', 'of', 'failure', 'the', 'piezos', 'shall', 'survive', 'it', 'must', 'be', 'also', 'robust', 'and', 'it', 'must', 'not', 'disturb', 'or', 'disable', 'normal', 'operation', 'due', 'to', 'many', 'channels', '16', 'for', 'masterslave', 'rf', 'the', 'hardware', 'solution', 'must', 'be', 'well', 'scalable', 'the', 'paper', 'discuss', 'the', 'design', 'of', 'xfels', 'piezo', 'driver', 'together', 'with', 'pem', 'power', 'and', 'energy', 'monitor', 'supervising', 'the', 'driver', 'operation', 'and', 'preventing', 'piezos', 'from', 'destruction', 'the', 'achieved', 'results', 'and', 'operation', 'of', 'the', 'complete', 'system', 'are', 'demonstrated']]
|
[-0.15378446336571588, 0.1683226697918194, -0.0010687254738907532, -0.004133823662564235, -0.08530574371715002, -0.2521249342204113, 0.055518602883151996, 0.416535715648546, -0.27138216872907583, -0.3257962060312955, 0.14339629943479376, -0.22810218417120912, -0.07258468069823433, 0.23282818391813523, -0.09501077379564085, 0.08097287192956715, 0.03624676082833731, 0.020721885738126243, 0.018030975613250202, -0.21118146613163433, 0.2446992028829853, 0.12927981812860562, 0.3064901758004556, 0.03133190330838036, 0.11937358759061988, -0.03934354052952526, 0.061505447300447026, -0.041887781564370306, -0.031402441259051304, 0.0450291380728675, 0.2709280687353903, 0.05093056648886439, 0.3112944108001965, -0.4680377119508831, -0.15083418578738378, 0.11238992981863916, 0.11308415540499225, 0.10559333163502392, -0.00923684403594124, -0.23121205154291108, 0.11207457563857455, -0.18238063283181427, -0.150469941519124, -0.09256527145534012, -0.03082414342472938, 0.04131545044007292, -0.27827839925785186, -0.029180403832623037, 0.04324099591023471, 0.05388030937722407, -0.02064305728923888, -0.03266086059548857, -0.04152484696128012, 0.16644602539709888, 0.011414530152563787, 0.05891222432871826, 0.23403816280478076, -0.13234345888426124, -0.0450308413116367, 0.3741496011496384, 0.004295266913474118, -0.169964449184137, 0.1716321062259024, -0.13141632648472934, -0.03983605585838716, 0.13807056067252205, 0.15237423690768837, 0.025613456532435932, -0.1492315957135592, -0.006873731569009369, 0.12441043331867077, 0.20463575669036238, 0.10253902052727583, 0.03379977454773, 0.19931764193071225, 0.18676103298117078, 0.0956985975332993, 0.14040601456296212, -0.07982084197968346, -0.013165386449673638, -0.2846950699648855, -0.1010118411774699, -0.1351041880850696, 0.031730495813431514, -0.008320046462561884, -0.10982379610682245, 0.38463276443855765, 0.1636105629237836, 0.13208291135229094, -0.02339435909487486, 0.3671238592940245, 0.12703634324944435, 0.15141453549803532, 0.05674542223432988, 0.29866607941981543, 0.1041240689290297, 0.11942172693200666, -0.258196139636952, 0.07284186839220463, -0.03224576911955025]
|
1,803.09043
|
CNN Based Adversarial Embedding with Minimum Alteration for Image
Steganography
|
Historically, steganographic schemes were designed in a way to preserve image
statistics or steganalytic features. Since most of the state-of-the-art
steganalytic methods employ a machine learning (ML) based classifier, it is
reasonable to consider countering steganalysis by trying to fool the ML
classifiers. However, simply applying perturbations on stego images as
adversarial examples may lead to the failure of data extraction and introduce
unexpected artefacts detectable by other classifiers. In this paper, we present
a steganographic scheme with a novel operation called adversarial embedding,
which achieves the goal of hiding a stego message while at the same time
fooling a convolutional neural network (CNN) based steganalyzer. The proposed
method works under the conventional framework of distortion minimization.
Adversarial embedding is achieved by adjusting the costs of image element
modifications according to the gradients backpropagated from the CNN classifier
targeted by the attack. Therefore, modification direction has a higher
probability to be the same as the sign of the gradient. In this way, the so
called adversarial stego images are generated. Experiments demonstrate that the
proposed steganographic scheme is secure against the targeted adversary-unaware
steganalyzer. In addition, it deteriorates the performance of other
adversary-aware steganalyzers opening the way to a new class of modern
steganographic schemes capable to overcome powerful CNN-based steganalysis.
|
cs.MM
|
historically steganographic schemes were designed in a way to preserve image statistics or steganalytic features since most of the stateoftheart steganalytic methods employ a machine learning ml based classifier it is reasonable to consider countering steganalysis by trying to fool the ml classifiers however simply applying perturbations on stego images as adversarial examples may lead to the failure of data extraction and introduce unexpected artefacts detectable by other classifiers in this paper we present a steganographic scheme with a novel operation called adversarial embedding which achieves the goal of hiding a stego message while at the same time fooling a convolutional neural network cnn based steganalyzer the proposed method works under the conventional framework of distortion minimization adversarial embedding is achieved by adjusting the costs of image element modifications according to the gradients backpropagated from the cnn classifier targeted by the attack therefore modification direction has a higher probability to be the same as the sign of the gradient in this way the so called adversarial stego images are generated experiments demonstrate that the proposed steganographic scheme is secure against the targeted adversaryunaware steganalyzer in addition it deteriorates the performance of other adversaryaware steganalyzers opening the way to a new class of modern steganographic schemes capable to overcome powerful cnnbased steganalysis
|
[['historically', 'steganographic', 'schemes', 'were', 'designed', 'in', 'a', 'way', 'to', 'preserve', 'image', 'statistics', 'or', 'steganalytic', 'features', 'since', 'most', 'of', 'the', 'stateoftheart', 'steganalytic', 'methods', 'employ', 'a', 'machine', 'learning', 'ml', 'based', 'classifier', 'it', 'is', 'reasonable', 'to', 'consider', 'countering', 'steganalysis', 'by', 'trying', 'to', 'fool', 'the', 'ml', 'classifiers', 'however', 'simply', 'applying', 'perturbations', 'on', 'stego', 'images', 'as', 'adversarial', 'examples', 'may', 'lead', 'to', 'the', 'failure', 'of', 'data', 'extraction', 'and', 'introduce', 'unexpected', 'artefacts', 'detectable', 'by', 'other', 'classifiers', 'in', 'this', 'paper', 'we', 'present', 'a', 'steganographic', 'scheme', 'with', 'a', 'novel', 'operation', 'called', 'adversarial', 'embedding', 'which', 'achieves', 'the', 'goal', 'of', 'hiding', 'a', 'stego', 'message', 'while', 'at', 'the', 'same', 'time', 'fooling', 'a', 'convolutional', 'neural', 'network', 'cnn', 'based', 'steganalyzer', 'the', 'proposed', 'method', 'works', 'under', 'the', 'conventional', 'framework', 'of', 'distortion', 'minimization', 'adversarial', 'embedding', 'is', 'achieved', 'by', 'adjusting', 'the', 'costs', 'of', 'image', 'element', 'modifications', 'according', 'to', 'the', 'gradients', 'backpropagated', 'from', 'the', 'cnn', 'classifier', 'targeted', 'by', 'the', 'attack', 'therefore', 'modification', 'direction', 'has', 'a', 'higher', 'probability', 'to', 'be', 'the', 'same', 'as', 'the', 'sign', 'of', 'the', 'gradient', 'in', 'this', 'way', 'the', 'so', 'called', 'adversarial', 'stego', 'images', 'are', 'generated', 'experiments', 'demonstrate', 'that', 'the', 'proposed', 'steganographic', 'scheme', 'is', 'secure', 'against', 'the', 'targeted', 'adversaryunaware', 'steganalyzer', 'in', 'addition', 'it', 'deteriorates', 'the', 'performance', 'of', 'other', 'adversaryaware', 'steganalyzers', 'opening', 'the', 'way', 'to', 'a', 'new', 'class', 'of', 'modern', 'steganographic', 'schemes', 'capable', 'to', 'overcome', 'powerful', 'cnnbased', 'steganalysis']]
|
[-0.06716879550478466, -0.02095432998612523, -0.10116743760493895, 0.07495048969285563, -0.09884890091295044, -0.23989973237649315, 0.05701009920587586, 0.41914734065177894, -0.2869605231525687, -0.31231859992923483, 0.06677838565582143, -0.2593714796982351, -0.1897447931236543, 0.17870915605883403, -0.19328215983918026, 0.13030885111573817, 0.072533698064009, 0.03370546706109529, -0.06880083493777506, -0.3271957224234939, 0.32255455456297133, 0.07625779176485681, 0.3753045527264476, -0.01410531368289542, 0.12209884477321924, -0.04592476644154106, -0.027077364795176046, -0.008876069450308846, -0.025284026477415216, 0.16145417095782857, 0.32439540292689345, 0.1987056899882321, 0.3335322261372182, -0.38413914098803487, -0.2504027223835389, 0.09542232389351175, 0.13056133374338968, 0.16120307218627117, -0.09353175589515428, -0.33236954631616494, 0.16426689722228774, -0.18131669350855406, 0.012015204899944365, -0.11687151116895533, -0.07637563785094591, -0.01583401575612481, -0.27041772362731753, -0.009368908326585023, 0.0810281925812541, 0.03899073739580455, 0.019656908366873505, -0.08134503863485797, 0.029573537067820628, 0.11233557354259704, 0.03542074062473451, 0.08889357938453378, 0.15767368235447932, -0.16841761355753987, -0.14144356088890206, 0.3702467605028124, -0.0746127278915429, -0.2122606909667541, 0.1509863422972904, 0.019886948416630426, -0.11326950378383377, 0.13247033431239072, 0.2153439388521725, 0.12252610179684346, -0.1614103313468929, -0.01806745454474973, 0.0016462790713246379, 0.18133689160237, 0.07551341711077839, 0.0271580049368952, 0.14183635824204732, 0.2044138688616277, 0.0678748647263828, 0.16320753432477692, -0.16486555589141236, -0.026748155141692785, -0.20874886491025488, -0.09765381013442363, -0.20424690602591172, -0.0330388801638037, -0.07776226591799752, -0.1242809685523666, 0.4213344401891629, 0.23780472848752868, 0.20964004451303653, 0.08427881698534335, 0.40895883879136474, 0.015601186774715427, 0.1671757166983471, 0.11981880318905626, 0.2272483535008394, 0.028422424890145306, 0.08528040191962473, -0.14331860638201413, 0.14690823406646294, 0.08365829604943949]
|
1,803.09044
|
The ESS FPGA Framework and its Application on the ESS LLRF System
|
The functions of the Low-Level Radio Frequency (LLRF) system at European
Spallation Source (ESS) are implemented on different Field-Programmable Gate
Array (FPGA) boards in a Micro Telecommunications Computing Architecture (MTCA)
crate. Besides the algorithm, code that provides access to the peripherals
connected to the FPGA is necessary. In order to provide a common platform for
the FPGA developments at ESS - the ESS FPGA Framework has been designed. The
framework facilitates the integration of different algorithms on different FPGA
boards. Three functions are provided by the framework: (1) Communication
interfaces to peripherals, e.g. Analog-to-Digital Converters (ADCs) and
on-board memory, (2) Upstream communication with the control system over
Peripheral Component Interconnect Express (PCIe), and (3) Configuration of the
on-board peripherals. To keep the framework easily extensible by Intellectual
Property (IP) blocks and to enable seamless integration with the Xilinx design
tools, the Advanced eXtensible Interface version 4 (AXI4) bus is the chosen
communication interconnect. Furthermore, scripts automatize the building of the
FPGA configuration, software components and the documentation. The LLRF control
algorithms have been successfully integrated into the framework.
|
physics.ins-det physics.acc-ph
|
the functions of the lowlevel radio frequency llrf system at european spallation source ess are implemented on different fieldprogrammable gate array fpga boards in a micro telecommunications computing architecture mtca crate besides the algorithm code that provides access to the peripherals connected to the fpga is necessary in order to provide a common platform for the fpga developments at ess the ess fpga framework has been designed the framework facilitates the integration of different algorithms on different fpga boards three functions are provided by the framework 1 communication interfaces to peripherals eg analogtodigital converters adcs and onboard memory 2 upstream communication with the control system over peripheral component interconnect express pcie and 3 configuration of the onboard peripherals to keep the framework easily extensible by intellectual property ip blocks and to enable seamless integration with the xilinx design tools the advanced extensible interface version 4 axi4 bus is the chosen communication interconnect furthermore scripts automatize the building of the fpga configuration software components and the documentation the llrf control algorithms have been successfully integrated into the framework
|
[['the', 'functions', 'of', 'the', 'lowlevel', 'radio', 'frequency', 'llrf', 'system', 'at', 'european', 'spallation', 'source', 'ess', 'are', 'implemented', 'on', 'different', 'fieldprogrammable', 'gate', 'array', 'fpga', 'boards', 'in', 'a', 'micro', 'telecommunications', 'computing', 'architecture', 'mtca', 'crate', 'besides', 'the', 'algorithm', 'code', 'that', 'provides', 'access', 'to', 'the', 'peripherals', 'connected', 'to', 'the', 'fpga', 'is', 'necessary', 'in', 'order', 'to', 'provide', 'a', 'common', 'platform', 'for', 'the', 'fpga', 'developments', 'at', 'ess', 'the', 'ess', 'fpga', 'framework', 'has', 'been', 'designed', 'the', 'framework', 'facilitates', 'the', 'integration', 'of', 'different', 'algorithms', 'on', 'different', 'fpga', 'boards', 'three', 'functions', 'are', 'provided', 'by', 'the', 'framework', '1', 'communication', 'interfaces', 'to', 'peripherals', 'eg', 'analogtodigital', 'converters', 'adcs', 'and', 'onboard', 'memory', '2', 'upstream', 'communication', 'with', 'the', 'control', 'system', 'over', 'peripheral', 'component', 'interconnect', 'express', 'pcie', 'and', '3', 'configuration', 'of', 'the', 'onboard', 'peripherals', 'to', 'keep', 'the', 'framework', 'easily', 'extensible', 'by', 'intellectual', 'property', 'ip', 'blocks', 'and', 'to', 'enable', 'seamless', 'integration', 'with', 'the', 'xilinx', 'design', 'tools', 'the', 'advanced', 'extensible', 'interface', 'version', '4', 'axi4', 'bus', 'is', 'the', 'chosen', 'communication', 'interconnect', 'furthermore', 'scripts', 'automatize', 'the', 'building', 'of', 'the', 'fpga', 'configuration', 'software', 'components', 'and', 'the', 'documentation', 'the', 'llrf', 'control', 'algorithms', 'have', 'been', 'successfully', 'integrated', 'into', 'the', 'framework']]
|
[-0.2006506654394219, 0.029163785314515488, -0.044344975946428764, -0.012701918560196646, -0.08208768662329517, -0.26486462903928687, -0.005349549122249961, 0.4567593383518132, -0.2349862560989674, -0.36122669832018967, 0.1413339346856281, -0.2114568697738419, -0.09569678698475896, 0.2698198363240491, -0.04933779098262841, 0.09739679988177324, 0.05980625741226091, -0.05043395489453608, -0.0010700069272967414, -0.21045475587677423, 0.19129488641920034, 0.11569369794398715, 0.37085188199191843, 0.018311790836212986, 0.1429519176943524, -0.030283575869609856, -0.0055907445785123855, -0.09072548804794099, -0.024153821280999018, 0.15138105685036862, 0.35299002853306854, 0.1975352549422744, 0.27020666185787623, -0.5255209327971732, -0.1164991332030199, -0.020255081085699865, 0.10264038726108993, -0.00511494117579952, -0.017298544464706953, -0.2989456597318746, 0.13435409288451244, -0.2844459913374687, -0.08520644792853008, -0.014817211512391541, -0.023464963170805608, 0.07624301717838865, -0.23126460950218394, -0.14997040160762315, -0.02238740318253721, 0.05752282969875854, -0.008650098572781479, -0.08127178711716128, 0.027416557782668282, 0.16668360264950685, -0.10477552691273476, 0.05550440293882275, 0.20572588267069394, -0.044855118476086565, -0.1451449714811381, 0.301079985169715, 0.05773242468223378, -0.17323085049495354, 0.16037645903733475, -0.020117289926433427, -0.12832736902485273, 0.09871932811140803, 0.22692329439186407, -0.02435174905721479, -0.21265053641334156, 0.1176744710511147, 0.09244092548959254, 0.25971968028567394, 0.05475694959353528, 0.05841325810814107, 0.1781775787054688, 0.24210357373919, 0.07104869729263638, 0.17032190702792088, -0.07902763579411178, -0.06908413263326194, -0.24928240235815544, -0.16281601522562347, -0.13009659612725955, -0.05056102983574171, -0.06686888593321783, -0.13079298979242926, 0.41437016772529617, 0.14894128997482106, -0.003645992104958912, 0.05438864536435259, 0.43143606347307056, 0.04129143481523814, 0.20508179054013453, 0.15633582777015612, 0.13739723041494886, 0.06838248631373228, 0.22510995695946887, -0.1821170606073627, 0.041187444495418196, 0.013530556750166315]
|
1,803.09045
|
The upgrade of J-PARC linac low-level radio frequency system
|
The J-PARC linac was consist of 324MHz low-{\beta} section and 972MHz
high-{\beta} section. There is a total of 48 stations. And each station was
equipped with an independent LLRF (Low-Level Radio Frequency) system to realize
an accelerating field stability of $\pm1$% in amplitude and $\pm1${\deg} in
phase. For these llrf system, some of them, especially the 324MHz low-{\beta}
section, had already been used for more than 10 years. Due to lack of supply,
it had become more and more difficult to do the system maintain. And in the
near future, the beam current of j-parc linac was planned to increase to 60mA.
At that time, the current system will face a huge pressure in solving the beam
loading effect. Considering these, a new digital llrf system was developing at
j-parc linac. In this paper, the architecture of the new system will be
reported. The performance of system with a test cavity is summarized.
|
physics.acc-ph
|
the jparc linac was consist of 324mhz lowbeta section and 972mhz highbeta section there is a total of 48 stations and each station was equipped with an independent llrf lowlevel radio frequency system to realize an accelerating field stability of pm1 in amplitude and pm1deg in phase for these llrf system some of them especially the 324mhz lowbeta section had already been used for more than 10 years due to lack of supply it had become more and more difficult to do the system maintain and in the near future the beam current of jparc linac was planned to increase to 60ma at that time the current system will face a huge pressure in solving the beam loading effect considering these a new digital llrf system was developing at jparc linac in this paper the architecture of the new system will be reported the performance of system with a test cavity is summarized
|
[['the', 'jparc', 'linac', 'was', 'consist', 'of', '324mhz', 'lowbeta', 'section', 'and', '972mhz', 'highbeta', 'section', 'there', 'is', 'a', 'total', 'of', '48', 'stations', 'and', 'each', 'station', 'was', 'equipped', 'with', 'an', 'independent', 'llrf', 'lowlevel', 'radio', 'frequency', 'system', 'to', 'realize', 'an', 'accelerating', 'field', 'stability', 'of', 'pm1', 'in', 'amplitude', 'and', 'pm1deg', 'in', 'phase', 'for', 'these', 'llrf', 'system', 'some', 'of', 'them', 'especially', 'the', '324mhz', 'lowbeta', 'section', 'had', 'already', 'been', 'used', 'for', 'more', 'than', '10', 'years', 'due', 'to', 'lack', 'of', 'supply', 'it', 'had', 'become', 'more', 'and', 'more', 'difficult', 'to', 'do', 'the', 'system', 'maintain', 'and', 'in', 'the', 'near', 'future', 'the', 'beam', 'current', 'of', 'jparc', 'linac', 'was', 'planned', 'to', 'increase', 'to', '60ma', 'at', 'that', 'time', 'the', 'current', 'system', 'will', 'face', 'a', 'huge', 'pressure', 'in', 'solving', 'the', 'beam', 'loading', 'effect', 'considering', 'these', 'a', 'new', 'digital', 'llrf', 'system', 'was', 'developing', 'at', 'jparc', 'linac', 'in', 'this', 'paper', 'the', 'architecture', 'of', 'the', 'new', 'system', 'will', 'be', 'reported', 'the', 'performance', 'of', 'system', 'with', 'a', 'test', 'cavity', 'is', 'summarized']]
|
[-0.15890779171683322, 0.12670817727878267, -0.048340794995326446, -0.004522630048922036, -0.0474171452114132, -0.15506701150632188, 0.0007519186332796675, 0.3868310581326384, -0.20719198157343813, -0.32148665463791004, 0.1310268413815081, -0.27901653034260143, -0.03588099894113839, 0.27744509327002, -0.05876524491562835, 0.0862706759881631, 0.06366409190043153, 0.01629444060381502, -0.022336379818404344, -0.23886727782381648, 0.27436545299919873, 0.17301127514361428, 0.29785869381315, 0.03640200141062205, 0.09988621552789433, -0.07219098901259713, 0.018148025242152397, -0.04263510473223554, -0.02141313968904551, 0.06724409080689421, 0.2922949306666851, 0.13430379288252584, 0.2543951113381096, -0.45735237938729495, -0.15264739496381702, 0.08005818406220626, 0.13322888547397294, 0.07049533504460989, -0.03789448710361014, -0.25197487306227356, 0.10766383468502239, -0.23556026644714498, -0.16027598164844284, 0.005303070025990097, 0.016751547105692176, 0.02949750915522108, -0.24148164844027142, -0.032487521945448544, 0.01731914422802023, 0.08406673116622039, -0.04576759076224187, -0.1363193956337479, 0.035622093958679484, 0.0845540077622187, 0.01943664804393602, 0.10210969242128871, 0.13551957186663877, -0.11759829986053896, -0.06577661964488593, 0.36849086249964563, 0.0027457840131663376, -0.11266939491474044, 0.18488268798997476, -0.2017925347994409, -0.08288785096610317, 0.16654649077335726, 0.22237080441334764, 0.026695004983717022, -0.18303729908625796, -0.004184739318490657, 0.034740060692923645, 0.19610826000004905, 0.11088875083982744, -0.008044814462049838, 0.2316151245015774, 0.2711511414019844, 0.09255073893802694, 0.12448215792254494, -0.1259364283353018, -0.03055529881621132, -0.29020852521313606, -0.14101734341474603, -0.10037148563266807, 0.015756324481068028, 0.0515749174068136, -0.07399221765258149, 0.39562622547807247, 0.14982166722089657, 0.13217742980231303, -0.0400552505885276, 0.33650456084492236, 0.10950395898937525, 0.09738944651483483, 0.06402027742886865, 0.2976436244956661, 0.10600554106782216, 0.2115301290885671, -0.20014513928027874, 0.03344901792120623, -0.024059746925706497]
|
1,803.09046
|
High-frequency Oscillations in the Atmosphere above a Sunspot Umbra
|
We use high spatial and temporal resolution observations, simultaneously
obtained with the New Vacuum Solar Telescope and Atmospheric Imaging Assembly
(AIA) on board the Solar Dynamics Observatory, to investigate the
high-frequency oscillations above a sunspot umbra. A novel time--frequency
analysis method, namely the synchrosqueezing transform (SST), is employed to
represent their power spectra and to reconstruct the high-frequency signals at
different solar atmospheric layers. A validation study with synthetic signals
demonstrates that SST is capable to resolving weak signals even when their
strength is comparable with the high-frequency noise. The power spectra,
obtained from both SST and the Fourier transform, of the entire umbral region
indicate that there are significant enhancements between 10 and 14 mHz (labeled
as 12 mHz) at different atmospheric layers. Analyzing the spectrum of a
photospheric region far away from the umbra demonstrates that this 12~mHz
component exists only inside the umbra. The animation based on the
reconstructed 12 mHz component in AIA 171 \AA\ illustrates that an
intermittently propagating wave first emerges near the footpoints of coronal
fan structures, and then propagates outward along the structures. A
time--distance diagram, coupled with a subsonic wave speed ($\sim$ 49 km
s$^{-1}$), highlights the fact that these coronal perturbations are best
described as upwardly propagating magnetoacoustic slow waves. Thus, we first
reveal the high-frequency oscillations with a period around one minute in
imaging observations at different height above an umbra, and these oscillations
seem to be related to the umbral perturbations in the photosphere.
|
astro-ph.SR
|
we use high spatial and temporal resolution observations simultaneously obtained with the new vacuum solar telescope and atmospheric imaging assembly aia on board the solar dynamics observatory to investigate the highfrequency oscillations above a sunspot umbra a novel timefrequency analysis method namely the synchrosqueezing transform sst is employed to represent their power spectra and to reconstruct the highfrequency signals at different solar atmospheric layers a validation study with synthetic signals demonstrates that sst is capable to resolving weak signals even when their strength is comparable with the highfrequency noise the power spectra obtained from both sst and the fourier transform of the entire umbral region indicate that there are significant enhancements between 10 and 14 mhz labeled as 12 mhz at different atmospheric layers analyzing the spectrum of a photospheric region far away from the umbra demonstrates that this 12mhz component exists only inside the umbra the animation based on the reconstructed 12 mhz component in aia 171 aa illustrates that an intermittently propagating wave first emerges near the footpoints of coronal fan structures and then propagates outward along the structures a timedistance diagram coupled with a subsonic wave speed sim 49 km s1 highlights the fact that these coronal perturbations are best described as upwardly propagating magnetoacoustic slow waves thus we first reveal the highfrequency oscillations with a period around one minute in imaging observations at different height above an umbra and these oscillations seem to be related to the umbral perturbations in the photosphere
|
[['we', 'use', 'high', 'spatial', 'and', 'temporal', 'resolution', 'observations', 'simultaneously', 'obtained', 'with', 'the', 'new', 'vacuum', 'solar', 'telescope', 'and', 'atmospheric', 'imaging', 'assembly', 'aia', 'on', 'board', 'the', 'solar', 'dynamics', 'observatory', 'to', 'investigate', 'the', 'highfrequency', 'oscillations', 'above', 'a', 'sunspot', 'umbra', 'a', 'novel', 'timefrequency', 'analysis', 'method', 'namely', 'the', 'synchrosqueezing', 'transform', 'sst', 'is', 'employed', 'to', 'represent', 'their', 'power', 'spectra', 'and', 'to', 'reconstruct', 'the', 'highfrequency', 'signals', 'at', 'different', 'solar', 'atmospheric', 'layers', 'a', 'validation', 'study', 'with', 'synthetic', 'signals', 'demonstrates', 'that', 'sst', 'is', 'capable', 'to', 'resolving', 'weak', 'signals', 'even', 'when', 'their', 'strength', 'is', 'comparable', 'with', 'the', 'highfrequency', 'noise', 'the', 'power', 'spectra', 'obtained', 'from', 'both', 'sst', 'and', 'the', 'fourier', 'transform', 'of', 'the', 'entire', 'umbral', 'region', 'indicate', 'that', 'there', 'are', 'significant', 'enhancements', 'between', '10', 'and', '14', 'mhz', 'labeled', 'as', '12', 'mhz', 'at', 'different', 'atmospheric', 'layers', 'analyzing', 'the', 'spectrum', 'of', 'a', 'photospheric', 'region', 'far', 'away', 'from', 'the', 'umbra', 'demonstrates', 'that', 'this', '12mhz', 'component', 'exists', 'only', 'inside', 'the', 'umbra', 'the', 'animation', 'based', 'on', 'the', 'reconstructed', '12', 'mhz', 'component', 'in', 'aia', '171', 'aa', 'illustrates', 'that', 'an', 'intermittently', 'propagating', 'wave', 'first', 'emerges', 'near', 'the', 'footpoints', 'of', 'coronal', 'fan', 'structures', 'and', 'then', 'propagates', 'outward', 'along', 'the', 'structures', 'a', 'timedistance', 'diagram', 'coupled', 'with', 'a', 'subsonic', 'wave', 'speed', 'sim', '49', 'km', 's1', 'highlights', 'the', 'fact', 'that', 'these', 'coronal', 'perturbations', 'are', 'best', 'described', 'as', 'upwardly', 'propagating', 'magnetoacoustic', 'slow', 'waves', 'thus', 'we', 'first', 'reveal', 'the', 'highfrequency', 'oscillations', 'with', 'a', 'period', 'around', 'one', 'minute', 'in', 'imaging', 'observations', 'at', 'different', 'height', 'above', 'an', 'umbra', 'and', 'these', 'oscillations', 'seem', 'to', 'be', 'related', 'to', 'the', 'umbral', 'perturbations', 'in', 'the', 'photosphere']]
|
[-0.1122293779645418, 0.20137682451397593, -0.01128922589407189, 0.10199019809469308, -0.08780952281511684, -0.07300882203583946, 0.0014894578811273404, 0.4062873093010025, -0.271434528291286, -0.3311954742558755, 0.11122223111939034, -0.29558282456837776, -0.141172530042477, 0.2471418404966835, -0.005035163258056618, -0.016748841729618956, 0.10996739887083479, -0.02276650454841433, -0.023430793582105904, -0.10383000990386643, 0.21141937588402107, 0.10680187948434273, 0.27178074900681776, -0.0232817962088024, 0.09925722497765248, -0.10370633451313507, -0.04872385055317479, -0.011256887932872111, -0.08426982201718061, 0.045611462207289594, 0.2321164447162821, 0.10759283175949401, 0.2173254587517188, -0.44180249124841114, -0.2459392593605671, -0.008056442046962013, 0.1723468101704569, 0.010675227595114611, 0.010459364443918978, -0.310464236696016, 0.08828453224614202, -0.04693633642112004, -0.11756188634260581, 0.03223058832047424, -0.011237702125397594, 0.002785575684970169, -0.23842555048640787, 0.09116793872232026, 0.009227869303412432, 0.1342673311066791, -0.09315605408595345, -0.07376892435765726, -0.05618426394582597, 0.14743483616420108, 0.052291716131896565, 0.036329078907336346, 0.14807235005092087, -0.08377782181113565, -0.03377459895403344, 0.32045595340782823, -0.11313253630717414, -0.046722411052172445, 0.1838873484506976, -0.24462285702972392, -0.09929750992431934, 0.22436979103348847, 0.13980672405124073, 0.05001169696594096, -0.0924677716853117, 0.004990661888066499, -0.03839867781907816, 0.23061372998087265, 0.13899951664412893, 0.0286140218916599, 0.2641859162159688, 0.1095425833378184, 0.060535144362772804, 0.11503824144952014, -0.2767018771264702, -0.03693314401595664, -0.26657194784691945, -0.08826154659973548, -0.10468080444488584, 0.021092242650130225, -0.09070015338215669, -0.1742498650724824, 0.45905390270508645, 0.16371978317459335, 0.19319815296164858, 0.013259564691064199, 0.3272362510324456, 0.1002376941581658, 0.06781343547647442, 0.12690995788443984, 0.29167763222523824, 0.19101373305283031, 0.21729479950135272, -0.22592404847245331, -0.032832790354486344, 0.02038083029664841]
|
1,803.09047
|
Towards End-to-End Prosody Transfer for Expressive Speech Synthesis with
Tacotron
|
We present an extension to the Tacotron speech synthesis architecture that
learns a latent embedding space of prosody, derived from a reference acoustic
representation containing the desired prosody. We show that conditioning
Tacotron on this learned embedding space results in synthesized audio that
matches the prosody of the reference signal with fine time detail even when the
reference and synthesis speakers are different. Additionally, we show that a
reference prosody embedding can be used to synthesize text that is different
from that of the reference utterance. We define several quantitative and
subjective metrics for evaluating prosody transfer, and report results with
accompanying audio samples from single-speaker and 44-speaker Tacotron models
on a prosody transfer task.
|
cs.CL cs.LG cs.SD eess.AS
|
we present an extension to the tacotron speech synthesis architecture that learns a latent embedding space of prosody derived from a reference acoustic representation containing the desired prosody we show that conditioning tacotron on this learned embedding space results in synthesized audio that matches the prosody of the reference signal with fine time detail even when the reference and synthesis speakers are different additionally we show that a reference prosody embedding can be used to synthesize text that is different from that of the reference utterance we define several quantitative and subjective metrics for evaluating prosody transfer and report results with accompanying audio samples from singlespeaker and 44speaker tacotron models on a prosody transfer task
|
[['we', 'present', 'an', 'extension', 'to', 'the', 'tacotron', 'speech', 'synthesis', 'architecture', 'that', 'learns', 'a', 'latent', 'embedding', 'space', 'of', 'prosody', 'derived', 'from', 'a', 'reference', 'acoustic', 'representation', 'containing', 'the', 'desired', 'prosody', 'we', 'show', 'that', 'conditioning', 'tacotron', 'on', 'this', 'learned', 'embedding', 'space', 'results', 'in', 'synthesized', 'audio', 'that', 'matches', 'the', 'prosody', 'of', 'the', 'reference', 'signal', 'with', 'fine', 'time', 'detail', 'even', 'when', 'the', 'reference', 'and', 'synthesis', 'speakers', 'are', 'different', 'additionally', 'we', 'show', 'that', 'a', 'reference', 'prosody', 'embedding', 'can', 'be', 'used', 'to', 'synthesize', 'text', 'that', 'is', 'different', 'from', 'that', 'of', 'the', 'reference', 'utterance', 'we', 'define', 'several', 'quantitative', 'and', 'subjective', 'metrics', 'for', 'evaluating', 'prosody', 'transfer', 'and', 'report', 'results', 'with', 'accompanying', 'audio', 'samples', 'from', 'singlespeaker', 'and', '44speaker', 'tacotron', 'models', 'on', 'a', 'prosody', 'transfer', 'task']]
|
[0.0012005620121367667, 0.03863535918769725, -0.08454215262501844, 0.07862405639893391, -0.13500779376798228, -0.12201383054305456, 0.020069875556305704, 0.49320115724153685, -0.28259151909712765, -0.31201298987307063, 0.044511033797007576, -0.2981371316045784, -0.18419047920523504, 0.19236197876907363, -0.12001745985910754, 0.047791682234801874, 0.13169891292662278, 0.08258591197316714, -0.08732075145133167, -0.187512457468792, 0.30683321459627333, 0.013292623642962752, 0.3548432051432891, -0.055934248577901406, 0.18463888637754217, -0.03909904275509721, -0.02229791764464033, -0.05315823655263031, -0.057846613262913786, 0.18265170369526013, 0.3118916594257985, 0.23580194170701138, 0.23611501803654328, -0.36207922140397786, -0.22938756679037683, 0.02192101520567871, 0.0976143952907398, 0.1533798652112876, -0.07975662179626197, -0.3894383333165917, 0.10645458928570804, -0.14413480576446377, 0.11926116395676345, -0.11706265377844766, -0.002008655815172875, -0.013723346956172272, -0.2753410066004124, 0.008472519981870917, 0.10668790538533869, 0.08557542386513792, -0.14785474101530813, -0.1275985850523667, -0.02802512675458402, 0.22051213361785477, 0.025805528216439774, 0.08810487454920485, 0.12651364328012915, -0.12388215723739561, -0.1048983210828482, 0.39258177630734026, -0.12152272706704312, -0.2676303306463779, 0.1720045983215402, -0.03685724053924021, -0.13786771736034242, 0.06643642131402566, 0.21239492514481148, 0.08384057591473193, -0.16698712082194234, -0.008840247314717425, -0.05862025203379361, 0.28414388509107785, 0.10617069148442201, -0.00668803515860386, 0.14762733339867146, 0.22463340434580714, -0.07747325937165633, 0.18187180234491007, -0.08523400479993015, 0.01096863397233711, -0.28792332941993026, -0.1377233529888224, -0.17901416681706905, -0.003702359159656784, -0.0873235721185011, -0.14858813992325673, 0.44009542889206815, 0.24898687073258324, 0.20928655502696833, 0.119048251782691, 0.3276863415182258, 0.025204976324171742, 0.0464837860577462, 0.027150125213665888, 0.1299286067052826, -0.03671292285026427, 0.11959763539530206, -0.1562190345762167, 0.09314560182719377, 0.06392331347849808]
|
1,803.09048
|
Controllable nonlinearity in a dual-coupling optomechanical system under
a weak-coupling regime
|
Strong quantum nonlinearity gives rise to many interesting quantum effects
and has wide applications in quantum physics. Herewe investigate the quantum
nonlinear effect of an optomechanical system (OMS) consisting of both linear
and quadratic coupling. Interestingly, a controllable optomechanical
nonlinearity is obtained by applying a driving laser into the cavity. This
controllable optomechanical nonlinearity can be enhanced into a strong coupling
regime, even if the system is initially in the weak-coupling regime. Moreover,
the system dissipation can be suppressed effectively, which allows the
appearance of phonon sideband and photon blockade effects in the weak-coupling
regime. This work may inspire the exploration of a dual-coupling optomechanical
system as well as its applications in modern quantum science.
|
quant-ph
|
strong quantum nonlinearity gives rise to many interesting quantum effects and has wide applications in quantum physics herewe investigate the quantum nonlinear effect of an optomechanical system oms consisting of both linear and quadratic coupling interestingly a controllable optomechanical nonlinearity is obtained by applying a driving laser into the cavity this controllable optomechanical nonlinearity can be enhanced into a strong coupling regime even if the system is initially in the weakcoupling regime moreover the system dissipation can be suppressed effectively which allows the appearance of phonon sideband and photon blockade effects in the weakcoupling regime this work may inspire the exploration of a dualcoupling optomechanical system as well as its applications in modern quantum science
|
[['strong', 'quantum', 'nonlinearity', 'gives', 'rise', 'to', 'many', 'interesting', 'quantum', 'effects', 'and', 'has', 'wide', 'applications', 'in', 'quantum', 'physics', 'herewe', 'investigate', 'the', 'quantum', 'nonlinear', 'effect', 'of', 'an', 'optomechanical', 'system', 'oms', 'consisting', 'of', 'both', 'linear', 'and', 'quadratic', 'coupling', 'interestingly', 'a', 'controllable', 'optomechanical', 'nonlinearity', 'is', 'obtained', 'by', 'applying', 'a', 'driving', 'laser', 'into', 'the', 'cavity', 'this', 'controllable', 'optomechanical', 'nonlinearity', 'can', 'be', 'enhanced', 'into', 'a', 'strong', 'coupling', 'regime', 'even', 'if', 'the', 'system', 'is', 'initially', 'in', 'the', 'weakcoupling', 'regime', 'moreover', 'the', 'system', 'dissipation', 'can', 'be', 'suppressed', 'effectively', 'which', 'allows', 'the', 'appearance', 'of', 'phonon', 'sideband', 'and', 'photon', 'blockade', 'effects', 'in', 'the', 'weakcoupling', 'regime', 'this', 'work', 'may', 'inspire', 'the', 'exploration', 'of', 'a', 'dualcoupling', 'optomechanical', 'system', 'as', 'well', 'as', 'its', 'applications', 'in', 'modern', 'quantum', 'science']]
|
[-0.191022010724338, 0.2191322331222054, -0.07400771109835085, 0.0032376988868539533, -0.06829158829427079, -0.23350379990593514, 0.024987935536875994, 0.31221443996356246, -0.3005342507824759, -0.26539219692022653, 0.026378732628041978, -0.2554579632084361, -0.16880842223109907, 0.2918431418212621, -0.023649871259470257, 0.05332390647820655, 0.041125276616137275, -0.0421574516058491, 0.014379335981957092, -0.18954980763067542, 0.24928191382634013, 0.03232045545500066, 0.2906190377206689, 0.08847067352760125, 0.10731737484022967, 0.0007020472834834404, 0.1423280095893955, 0.020287053120371542, -0.08544804640277698, 0.051883101120199025, 0.28544787114910913, -0.03716116878211707, 0.33482560974733677, -0.421291069699484, -0.234491753400091, 0.05964713401912728, 0.17630798979907444, 0.20905386225479705, -0.04460654760661878, -0.32072793848387765, -0.03366686846027477, -0.17935768759956486, -0.09720799297894955, -0.10575329419633929, -0.02657922597503976, -0.022890641084431035, -0.28977681464401256, 0.04174921798454434, 0.10559139638963531, 0.015249882399905147, 0.008121907872887198, 0.03476576868591732, 0.03683972767791139, 0.08188270120636414, -0.056503414204997715, 0.0016647406206302868, 0.17833932238353187, -0.1841185518551675, -0.09781918061995193, 0.40447009714900334, -0.09699498349800706, -0.11662057710386682, 0.1947319599750795, -0.12907302178664076, -0.04059600649736495, 0.09535338699392844, 0.18878335636435895, 0.0441384028475895, -0.1345463003963232, 0.1524149282787428, 0.036375053643592094, 0.20816457830777949, 0.047500183430026495, 0.1838238479022198, 0.23082326194925004, 0.18160768863418253, 0.06207417013693454, 0.2182892409230893, -0.02936321238807419, -0.12027553116428878, -0.2845772459915137, -0.11491969455719779, -0.18790149850476728, 0.09253013315876096, -0.08916072427305871, -0.12824389879926712, 0.38685793318507966, 0.15487176012921786, 0.12438020958532497, -0.07714522270416319, 0.29609129489644576, 0.20842777544493674, 0.06750342215966891, -0.011821032824452248, 0.3610131783419076, 0.15201928318077862, 0.10112564155439797, -0.32927169145101254, -0.005732683595596698, -0.022256270720901198]
|
1,803.09049
|
The Parallel Boundary Condition for Turbulence Simulations in Low
Magnetic Shear Devices
|
Flux tube simulations of plasma turbulence in stellarators and tokamaks
typically employ coordinates which are aligned with the magnetic field lines.
Anisotropic turbulent fluctuations can be represented in such field-aligned
coordinates very efficiently, but the resulting non-trivial boundary conditions
involve all three spatial directions, and must be handled with care. The
standard "twist-and-shift" formulation of the boundary conditions [Beer,
Cowley, Hammett \textit{Phys. Plasmas} \textbf{2}, 2687 (1995)] was derived
assuming axisymmetry and is widely used because it is efficient, as long as the
global magnetic shear is not too small. A generalization of this formulation is
presented, appropriate for studies of non-axisymmetric, stellarator-symmetric
configurations, as well as for axisymmetric configurations with small global
shear. The key idea is to replace the "twist" of the standard approach (which
accounts only for global shear) with the integrated local shear. This
generalization allows one significantly more freedom when choosing the extent
of the simulation domain in each direction, without losing the natural
efficiency of field-line-following coordinates. It also corrects errors
associated with naive application of axisymmetric boundary conditions to
non-axisymmetric configurations. Simulations of stellarator turbulence that
employ the generalized boundary conditions require much less resolution than
simulations that use the (incorrect, axisymmetric) boundary conditions. We also
demonstrate the surprising result that (at least in some cases) an easily
implemented but manifestly incorrect formulation of the boundary conditions
does {\it not} change important predicted quantities, such as the turbulent
heat flux.
|
physics.plasm-ph
|
flux tube simulations of plasma turbulence in stellarators and tokamaks typically employ coordinates which are aligned with the magnetic field lines anisotropic turbulent fluctuations can be represented in such fieldaligned coordinates very efficiently but the resulting nontrivial boundary conditions involve all three spatial directions and must be handled with care the standard twistandshift formulation of the boundary conditions beer cowley hammett textitphys plasmas textbf2 2687 1995 was derived assuming axisymmetry and is widely used because it is efficient as long as the global magnetic shear is not too small a generalization of this formulation is presented appropriate for studies of nonaxisymmetric stellaratorsymmetric configurations as well as for axisymmetric configurations with small global shear the key idea is to replace the twist of the standard approach which accounts only for global shear with the integrated local shear this generalization allows one significantly more freedom when choosing the extent of the simulation domain in each direction without losing the natural efficiency of fieldlinefollowing coordinates it also corrects errors associated with naive application of axisymmetric boundary conditions to nonaxisymmetric configurations simulations of stellarator turbulence that employ the generalized boundary conditions require much less resolution than simulations that use the incorrect axisymmetric boundary conditions we also demonstrate the surprising result that at least in some cases an easily implemented but manifestly incorrect formulation of the boundary conditions does it not change important predicted quantities such as the turbulent heat flux
|
[['flux', 'tube', 'simulations', 'of', 'plasma', 'turbulence', 'in', 'stellarators', 'and', 'tokamaks', 'typically', 'employ', 'coordinates', 'which', 'are', 'aligned', 'with', 'the', 'magnetic', 'field', 'lines', 'anisotropic', 'turbulent', 'fluctuations', 'can', 'be', 'represented', 'in', 'such', 'fieldaligned', 'coordinates', 'very', 'efficiently', 'but', 'the', 'resulting', 'nontrivial', 'boundary', 'conditions', 'involve', 'all', 'three', 'spatial', 'directions', 'and', 'must', 'be', 'handled', 'with', 'care', 'the', 'standard', 'twistandshift', 'formulation', 'of', 'the', 'boundary', 'conditions', 'beer', 'cowley', 'hammett', 'textitphys', 'plasmas', 'textbf2', '2687', '1995', 'was', 'derived', 'assuming', 'axisymmetry', 'and', 'is', 'widely', 'used', 'because', 'it', 'is', 'efficient', 'as', 'long', 'as', 'the', 'global', 'magnetic', 'shear', 'is', 'not', 'too', 'small', 'a', 'generalization', 'of', 'this', 'formulation', 'is', 'presented', 'appropriate', 'for', 'studies', 'of', 'nonaxisymmetric', 'stellaratorsymmetric', 'configurations', 'as', 'well', 'as', 'for', 'axisymmetric', 'configurations', 'with', 'small', 'global', 'shear', 'the', 'key', 'idea', 'is', 'to', 'replace', 'the', 'twist', 'of', 'the', 'standard', 'approach', 'which', 'accounts', 'only', 'for', 'global', 'shear', 'with', 'the', 'integrated', 'local', 'shear', 'this', 'generalization', 'allows', 'one', 'significantly', 'more', 'freedom', 'when', 'choosing', 'the', 'extent', 'of', 'the', 'simulation', 'domain', 'in', 'each', 'direction', 'without', 'losing', 'the', 'natural', 'efficiency', 'of', 'fieldlinefollowing', 'coordinates', 'it', 'also', 'corrects', 'errors', 'associated', 'with', 'naive', 'application', 'of', 'axisymmetric', 'boundary', 'conditions', 'to', 'nonaxisymmetric', 'configurations', 'simulations', 'of', 'stellarator', 'turbulence', 'that', 'employ', 'the', 'generalized', 'boundary', 'conditions', 'require', 'much', 'less', 'resolution', 'than', 'simulations', 'that', 'use', 'the', 'incorrect', 'axisymmetric', 'boundary', 'conditions', 'we', 'also', 'demonstrate', 'the', 'surprising', 'result', 'that', 'at', 'least', 'in', 'some', 'cases', 'an', 'easily', 'implemented', 'but', 'manifestly', 'incorrect', 'formulation', 'of', 'the', 'boundary', 'conditions', 'does', 'it', 'not', 'change', 'important', 'predicted', 'quantities', 'such', 'as', 'the', 'turbulent', 'heat', 'flux']]
|
[-0.12185224515431892, 0.12891952965121023, -0.06829680627223919, 0.08740629866477422, -0.07446150194110085, -0.12373668422858539, -0.05421435072080756, 0.35446022863423876, -0.23531678323174304, -0.3077277050137744, 0.1234604794204299, -0.1699980618722578, -0.10749883823248642, 0.2018967421101846, -0.06440249839946258, 0.05701726815456429, 0.08542375220260642, -0.014770674675627104, -0.061997020637737425, -0.19892788112918994, 0.28241666685939715, 0.09034899971697703, 0.2897583997984269, 0.019179175698793946, 0.07017589473393405, -0.0417177739229389, -0.015876426443441616, 0.08918980735433536, -0.1385276131868093, 0.023556541956765296, 0.19815972274071397, 0.05416082172572629, 0.2400507653140075, -0.4748667175421899, -0.2542277071385169, 0.06923866621318549, 0.15723152020986117, 0.11637028192106011, 0.007788900223059683, -0.22274731697570613, 0.08178093005971016, -0.1414321333433745, -0.17727186839404024, -0.09231625237929847, 0.01127495885229082, 0.013875019974415011, -0.3219414404688339, 0.12292271535748679, 0.06929028226920032, 0.06420682743653883, -0.07660588505602933, -0.1014970201178054, -0.07766041096375831, 0.08000247137405701, 0.08866427138511715, 0.06824710133011841, 0.16379416305291997, -0.12199744466460379, -0.03684169929194796, 0.39744615895361857, -0.016267107656565815, -0.27610182926926136, 0.21230813035693483, -0.1381359389394046, -0.11345991750483606, 0.14365228690414852, 0.11519751365870125, 0.13115098073383066, -0.12768227713065902, 0.037683235708965875, -0.056822042337662734, 0.13118041885812876, 0.10439133218613497, -0.01871731199919698, 0.2083365932444726, 0.0995319140815204, 0.0824813297425113, 0.1117725611542943, -0.09746725934002021, -0.09005396486591756, -0.3277846469499906, -0.11523810698942565, -0.15432610486977827, 0.0392421935056686, -0.08410368234147977, -0.19289697918944987, 0.33829025117842315, 0.17718535394741566, 0.1429165127045623, -0.020136747386330506, 0.31261160586013303, 0.09747747195806641, 0.09260208265608089, 0.14377815938302888, 0.25086425046415006, 0.1445035029906188, 0.1353142253910651, -0.20609489852030932, 0.05389755655004135, 0.055759940863998665]
|
1,803.0905
|
Learning to Reweight Examples for Robust Deep Learning
|
Deep neural networks have been shown to be very powerful modeling tools for
many supervised learning tasks involving complex input patterns. However, they
can also easily overfit to training set biases and label noises. In addition to
various regularizers, example reweighting algorithms are popular solutions to
these problems, but they require careful tuning of additional hyperparameters,
such as example mining schedules and regularization hyperparameters. In
contrast to past reweighting methods, which typically consist of functions of
the cost value of each example, in this work we propose a novel meta-learning
algorithm that learns to assign weights to training examples based on their
gradient directions. To determine the example weights, our method performs a
meta gradient descent step on the current mini-batch example weights (which are
initialized from zero) to minimize the loss on a clean unbiased validation set.
Our proposed method can be easily implemented on any type of deep network, does
not require any additional hyperparameter tuning, and achieves impressive
performance on class imbalance and corrupted label problems where only a small
amount of clean validation data is available.
|
cs.LG stat.ML
|
deep neural networks have been shown to be very powerful modeling tools for many supervised learning tasks involving complex input patterns however they can also easily overfit to training set biases and label noises in addition to various regularizers example reweighting algorithms are popular solutions to these problems but they require careful tuning of additional hyperparameters such as example mining schedules and regularization hyperparameters in contrast to past reweighting methods which typically consist of functions of the cost value of each example in this work we propose a novel metalearning algorithm that learns to assign weights to training examples based on their gradient directions to determine the example weights our method performs a meta gradient descent step on the current minibatch example weights which are initialized from zero to minimize the loss on a clean unbiased validation set our proposed method can be easily implemented on any type of deep network does not require any additional hyperparameter tuning and achieves impressive performance on class imbalance and corrupted label problems where only a small amount of clean validation data is available
|
[['deep', 'neural', 'networks', 'have', 'been', 'shown', 'to', 'be', 'very', 'powerful', 'modeling', 'tools', 'for', 'many', 'supervised', 'learning', 'tasks', 'involving', 'complex', 'input', 'patterns', 'however', 'they', 'can', 'also', 'easily', 'overfit', 'to', 'training', 'set', 'biases', 'and', 'label', 'noises', 'in', 'addition', 'to', 'various', 'regularizers', 'example', 'reweighting', 'algorithms', 'are', 'popular', 'solutions', 'to', 'these', 'problems', 'but', 'they', 'require', 'careful', 'tuning', 'of', 'additional', 'hyperparameters', 'such', 'as', 'example', 'mining', 'schedules', 'and', 'regularization', 'hyperparameters', 'in', 'contrast', 'to', 'past', 'reweighting', 'methods', 'which', 'typically', 'consist', 'of', 'functions', 'of', 'the', 'cost', 'value', 'of', 'each', 'example', 'in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'metalearning', 'algorithm', 'that', 'learns', 'to', 'assign', 'weights', 'to', 'training', 'examples', 'based', 'on', 'their', 'gradient', 'directions', 'to', 'determine', 'the', 'example', 'weights', 'our', 'method', 'performs', 'a', 'meta', 'gradient', 'descent', 'step', 'on', 'the', 'current', 'minibatch', 'example', 'weights', 'which', 'are', 'initialized', 'from', 'zero', 'to', 'minimize', 'the', 'loss', 'on', 'a', 'clean', 'unbiased', 'validation', 'set', 'our', 'proposed', 'method', 'can', 'be', 'easily', 'implemented', 'on', 'any', 'type', 'of', 'deep', 'network', 'does', 'not', 'require', 'any', 'additional', 'hyperparameter', 'tuning', 'and', 'achieves', 'impressive', 'performance', 'on', 'class', 'imbalance', 'and', 'corrupted', 'label', 'problems', 'where', 'only', 'a', 'small', 'amount', 'of', 'clean', 'validation', 'data', 'is', 'available']]
|
[-0.01827580098179169, 0.016319349325365492, -0.06392944530687399, 0.08733239869794084, -0.16782157461210673, -0.2161777395211781, 0.06864095729930947, 0.5009938651488887, -0.29199382866887996, -0.346118279091186, 0.10412761129943343, -0.2447085635115703, -0.1657171494469771, 0.21454986285146635, -0.1403181903141861, 0.12297153090023333, 0.17453243895433843, 0.01939919063200553, -0.06904132139930476, -0.34071536361524424, 0.28291165682603603, 0.033017087463587, 0.31090210589269796, -0.012397540477104485, 0.13264303922478576, -0.04218818497352509, -0.00800043882368805, 0.019288883946460878, -0.033483628027938216, 0.1371680585104817, 0.3270403095417552, 0.1699671392548933, 0.36686380693378545, -0.3973565543225656, -0.24362427079015309, 0.17759968057378298, 0.16778033120531796, 0.143268297576449, -0.03356404616044731, -0.2687593370779521, 0.09411217971032279, -0.13975443049680003, 0.013229353860434558, -0.21156893125088472, -0.06975268828941303, 0.030176452714820497, -0.357119207107462, 0.019151087313366587, 0.03967399667534563, 0.03952828100365069, -0.014623520863501148, -0.18175484204871786, 0.012737121760922794, 0.12107567392587144, 0.04258458259282634, 0.05333199611244102, 0.17003667881039697, -0.14975003484869376, -0.12900166373648164, 0.3008996011896266, -0.020843856825700238, -0.26876598399960333, 0.21171083048684522, 0.01852596432177557, -0.17110593563411386, 0.09099558626249847, 0.2595430765171639, 0.13788576763537194, -0.15941163487473708, 0.023816327120746588, -0.005309294674791292, 0.17610582743460934, 0.03482480132693632, -0.01466332329954538, 0.12549805453486948, 0.1991509308702209, 0.09027242897071927, 0.12013861176027503, -0.09317312645079154, -0.07009644652716815, -0.2700483376800548, -0.07559217666211124, -0.22946666840903668, -0.0003193964870459038, -0.11138679726379147, -0.1984209290400031, 0.38072585778103935, 0.22670189248294467, 0.2536032788714187, 0.08039320537225447, 0.3371057177842077, 0.06083454866845083, 0.15456931348760716, 0.1031608062201283, 0.17719219169553577, 0.01210921800488399, 0.09519459385418384, -0.15637386175415788, 0.1240824045949719, 0.04698814882431179]
|
1,803.09051
|
Unconventional scaling theory in disorder-driven quantum phase
transition
|
We clarify novel forms of scaling functions of conductance, critical
conductance distribution and localization length in a disorder-driven quantum
phase transition between band insulator and Weyl semimetal phases. Quantum
criticality of the phase transition is controlled by a clean-limit fixed point
with spatially anisotropic scale invariance. We argue that the anisotropic
scale invariance is reflected on unconventional scaling function forms in the
quantum phase transition. We verify the proposed scaling function forms in
terms of transfer-matrix calculations of conductance and localization length in
a tight-binding model.
|
cond-mat.mes-hall cond-mat.dis-nn
|
we clarify novel forms of scaling functions of conductance critical conductance distribution and localization length in a disorderdriven quantum phase transition between band insulator and weyl semimetal phases quantum criticality of the phase transition is controlled by a cleanlimit fixed point with spatially anisotropic scale invariance we argue that the anisotropic scale invariance is reflected on unconventional scaling function forms in the quantum phase transition we verify the proposed scaling function forms in terms of transfermatrix calculations of conductance and localization length in a tightbinding model
|
[['we', 'clarify', 'novel', 'forms', 'of', 'scaling', 'functions', 'of', 'conductance', 'critical', 'conductance', 'distribution', 'and', 'localization', 'length', 'in', 'a', 'disorderdriven', 'quantum', 'phase', 'transition', 'between', 'band', 'insulator', 'and', 'weyl', 'semimetal', 'phases', 'quantum', 'criticality', 'of', 'the', 'phase', 'transition', 'is', 'controlled', 'by', 'a', 'cleanlimit', 'fixed', 'point', 'with', 'spatially', 'anisotropic', 'scale', 'invariance', 'we', 'argue', 'that', 'the', 'anisotropic', 'scale', 'invariance', 'is', 'reflected', 'on', 'unconventional', 'scaling', 'function', 'forms', 'in', 'the', 'quantum', 'phase', 'transition', 'we', 'verify', 'the', 'proposed', 'scaling', 'function', 'forms', 'in', 'terms', 'of', 'transfermatrix', 'calculations', 'of', 'conductance', 'and', 'localization', 'length', 'in', 'a', 'tightbinding', 'model']]
|
[-0.24305140791287602, 0.22368059169804289, -0.11144518035702235, 0.04062262490705782, -0.0059171848589294525, -0.1930188751822814, 0.09175088970521249, 0.35196011262231097, -0.2744786849104648, -0.22843554379894984, -0.029508247191822806, -0.31903409975212677, -0.2577716794493067, 0.1141991022660202, 0.05436571051778142, 0.10854839213019193, -0.08219026553249636, -0.0590885060969307, -0.18134565526608723, -0.1346202152239722, 0.3435127782245535, 0.01807218588764108, 0.35641608058020124, 0.08315145547046911, 0.02812715430018427, -0.0042808668601304984, 0.12582003008465953, 0.02936537461463622, -0.17898876149910245, -0.0053672715263484525, 0.24136793884843977, -0.1096546150538204, 0.14313423031286898, -0.388229004085757, -0.21143194167809778, 0.020432522414836948, 0.13972543110681135, 0.11136057394621678, -0.060616656451561855, -0.34023303553721934, 0.041085070475589396, -0.12795390489749436, -0.1389083812002439, -0.09113079481649884, -0.002118065844961377, -0.05358390993070464, -0.21177856667308398, 0.15225969995290778, 0.022147282914713372, 0.11104564456907737, -0.053996250057744596, -0.01866517683794332, -0.005721462105379202, 0.08824040442380275, -0.001031513673762336, 0.02206472939876623, 0.14201831624323372, -0.14440224016475123, -0.13226121265527813, 0.35938923191928934, -0.05212272357108981, -0.12859717715899785, 0.13191905553820868, -0.19187064453987215, -0.1065845700565639, 0.12399712864439501, 0.0966215480679408, 0.05041183384817614, -0.08608987607971527, 0.13149078873454506, 0.005227759946137667, 0.18877241284170915, -0.0022231942014958235, 0.06555406754121704, 0.24798650448318832, 0.1705317425454945, 0.04707454758977821, 0.17933513390896624, -0.10393927116109448, -0.15607789149074708, -0.32798751250862385, -0.1984801843415859, -0.28012855966077294, 0.08626515728009995, -0.14800048705551172, -0.24426230533200122, 0.436567053545353, 0.19165298555365784, 0.2274847646070601, 0.036226433539373236, 0.18877094253616103, 0.2072820233960831, 0.0743221003172356, 0.03847902174497586, 0.18956756466176622, 0.14366951409110063, 0.08167043994289151, -0.2822794494175807, 0.04557343418060174, 0.13445328589702069]
|
1,803.09052
|
Design of a PCIe Interface Card Control Software Based on WDF
|
Based on a clear analysis of the latest Windows driver framework WDF, this
paper has implemented a driver of the PCIe-SpaceWire interface card device and
put forward a discussion about ensuring the stability of PCIe driver. At the
same time, Qt and OpenGL are used to design the upper application. Finally, a
functional verification of the control software is provided.
|
cs.CV
|
based on a clear analysis of the latest windows driver framework wdf this paper has implemented a driver of the pciespacewire interface card device and put forward a discussion about ensuring the stability of pcie driver at the same time qt and opengl are used to design the upper application finally a functional verification of the control software is provided
|
[['based', 'on', 'a', 'clear', 'analysis', 'of', 'the', 'latest', 'windows', 'driver', 'framework', 'wdf', 'this', 'paper', 'has', 'implemented', 'a', 'driver', 'of', 'the', 'pciespacewire', 'interface', 'card', 'device', 'and', 'put', 'forward', 'a', 'discussion', 'about', 'ensuring', 'the', 'stability', 'of', 'pcie', 'driver', 'at', 'the', 'same', 'time', 'qt', 'and', 'opengl', 'are', 'used', 'to', 'design', 'the', 'upper', 'application', 'finally', 'a', 'functional', 'verification', 'of', 'the', 'control', 'software', 'is', 'provided']]
|
[-0.15664251540171897, -0.021760250220738225, -0.15467571978599337, 0.048216479609452065, -0.0917963660716758, -0.1899441913622668, 0.0647088398987238, 0.3561466654636345, -0.2289243742258296, -0.3131365355546192, 0.17872160237471937, -0.21898572372619884, -0.09630076213881879, 0.2506600472863006, -0.034775168164356975, 0.11947406788940652, 0.0736497803117638, 0.02035353567167106, -0.015513000542680748, -0.1957868256653517, 0.25824883835137646, 0.10185088042043529, 0.3065003374496759, 0.09702152478650718, 0.12488352519980932, 0.028936444813290895, -0.03670070325892608, -0.04695824145386785, -0.11944593484039907, 0.13214608605445946, 0.231937484847287, 0.16205392874209051, 0.3498569651491056, -0.4548094707335961, -0.1430962237714932, -0.019982081567631812, 0.11366032110921787, 0.04723737483560029, -0.10157889362337794, -0.28722637749703256, 0.11607861738273148, -0.18961746294556533, -0.11538138918547054, 0.01821200808478614, -0.0030132021155145207, 0.0464451313748861, -0.24474762097174713, -0.06927170366111954, 0.05082325899373677, 0.10053273042125264, -0.03326493725022775, -0.06636112478119716, -0.03267464744937369, 0.1599962258301044, -0.000660696560201251, 0.06216712887951378, 0.1723593601767542, -0.07910064163901923, -0.11341037000608394, 0.34010911927069143, -0.026313583308365196, -0.15987791862907047, 0.17258052520406575, -0.06792219440942093, -0.13235736489138109, 0.03943666878503637, 0.20408898615672932, 0.03351386429710408, -0.17172433516421057, 0.07713737873699895, 0.017264962890895748, 0.23213206471528036, 0.036577639150259605, -0.0001482461752780413, 0.1569678712896687, 0.2505836819566913, 0.030424387241571635, 0.13369974391377074, -0.07667696537150039, -0.06619997802427259, -0.36334659326505864, -0.20723230353856492, -0.12117481319296916, -0.04441335033112347, -0.025284296769344926, -0.13241421169269893, 0.45090593094542875, 0.19240070768963483, 0.10664760466601889, 0.041076856503515675, 0.36039288897635574, 0.13808908515562446, 0.08173161456203562, 0.08852197265378751, 0.18065244590832016, 0.08827608738536552, 0.18932489729565333, -0.17868596832346867, 0.12207459565252066, 0.013926947205248525]
|
1,803.09053
|
Bounded strictly pseudoconvex domains in $\mathbb{C}^2$ with obstruction
flat boundary
|
On a bounded strictly pseudoconvex domain in $\mathbb{C}^n$, $n>1$, the
smoothness of the Cheng-Yau solution to Fefferman's complex Monge-Ampere
equation up to the boundary is obstructed by a local curvature invariant of the
boundary. For bounded strictly pseudoconvex domains in $\mathbb{C}^2$ which are
diffeomorphic to the ball, we motivate and consider the problem of determining
whether the global vanishing of this obstruction implies biholomorphic
equivalence to the unit ball. In particular we observe that, up to
biholomorphism, the unit ball in $\mathbb{C}^2$ is rigid with respect to
deformations in the class of strictly pseudoconvex domains with obstruction
flat boundary. We further show that for more general deformations of the unit
ball, the order of vanishing of the obstruction equals the order of vanishing
of the CR curvature. Finally, we give a generalization of the recent result of
the second author that for an abstract CR manifold with transverse symmetry,
obstruction flatness implies local equivalence to the CR $3$-sphere.
|
math.CV math.DG
|
on a bounded strictly pseudoconvex domain in mathbbcn n1 the smoothness of the chengyau solution to feffermans complex mongeampere equation up to the boundary is obstructed by a local curvature invariant of the boundary for bounded strictly pseudoconvex domains in mathbbc2 which are diffeomorphic to the ball we motivate and consider the problem of determining whether the global vanishing of this obstruction implies biholomorphic equivalence to the unit ball in particular we observe that up to biholomorphism the unit ball in mathbbc2 is rigid with respect to deformations in the class of strictly pseudoconvex domains with obstruction flat boundary we further show that for more general deformations of the unit ball the order of vanishing of the obstruction equals the order of vanishing of the cr curvature finally we give a generalization of the recent result of the second author that for an abstract cr manifold with transverse symmetry obstruction flatness implies local equivalence to the cr 3sphere
|
[['on', 'a', 'bounded', 'strictly', 'pseudoconvex', 'domain', 'in', 'mathbbcn', 'n1', 'the', 'smoothness', 'of', 'the', 'chengyau', 'solution', 'to', 'feffermans', 'complex', 'mongeampere', 'equation', 'up', 'to', 'the', 'boundary', 'is', 'obstructed', 'by', 'a', 'local', 'curvature', 'invariant', 'of', 'the', 'boundary', 'for', 'bounded', 'strictly', 'pseudoconvex', 'domains', 'in', 'mathbbc2', 'which', 'are', 'diffeomorphic', 'to', 'the', 'ball', 'we', 'motivate', 'and', 'consider', 'the', 'problem', 'of', 'determining', 'whether', 'the', 'global', 'vanishing', 'of', 'this', 'obstruction', 'implies', 'biholomorphic', 'equivalence', 'to', 'the', 'unit', 'ball', 'in', 'particular', 'we', 'observe', 'that', 'up', 'to', 'biholomorphism', 'the', 'unit', 'ball', 'in', 'mathbbc2', 'is', 'rigid', 'with', 'respect', 'to', 'deformations', 'in', 'the', 'class', 'of', 'strictly', 'pseudoconvex', 'domains', 'with', 'obstruction', 'flat', 'boundary', 'we', 'further', 'show', 'that', 'for', 'more', 'general', 'deformations', 'of', 'the', 'unit', 'ball', 'the', 'order', 'of', 'vanishing', 'of', 'the', 'obstruction', 'equals', 'the', 'order', 'of', 'vanishing', 'of', 'the', 'cr', 'curvature', 'finally', 'we', 'give', 'a', 'generalization', 'of', 'the', 'recent', 'result', 'of', 'the', 'second', 'author', 'that', 'for', 'an', 'abstract', 'cr', 'manifold', 'with', 'transverse', 'symmetry', 'obstruction', 'flatness', 'implies', 'local', 'equivalence', 'to', 'the', 'cr', '3sphere']]
|
[-0.19334678287850693, 0.04038617976794175, -0.02428726394531093, 0.04833675085793874, -0.11388025037307717, -0.12186665116821098, -0.042848397758082024, 0.33506360118972917, -0.3152764116331369, -0.17852757150960108, 0.12491614906532879, -0.2549931279772633, -0.13354923337980917, 0.1243042742857073, -0.15350551512003935, 0.05441851219563167, 0.02966688813501582, 0.0872906088663996, -0.12567072734973522, -0.2728951549278336, 0.47729884370383396, -0.057088182189890854, 0.2142883599794741, 0.15521943876578745, 0.10654522149375628, -0.0472879677515807, 0.053993774247149455, 0.03045522168726672, -0.20148164461011508, 0.16977973789480644, 0.2307966552657087, 0.060637966125519784, 0.23297392549229007, -0.39967889685914676, -0.20426474526801583, 0.19045427893406322, 0.12663839672562444, -0.018883242528985808, -0.005602531804562446, -0.286967315050903, 0.13598875300457725, -0.0530707491001798, -0.2331043311919357, -0.044713083314974617, 0.015391415379988619, -0.0074359466295241365, -0.24527378361436386, 0.07669746029909842, 0.17971956274395548, 0.057704765798064994, -0.14019830129404046, -0.017405160420568354, -0.06165969558060169, 0.06884130595039718, 0.05165898220693174, 0.15340875407468668, 0.09097946072188855, -0.06510115891055475, -0.06263917264281006, 0.3784823759305703, -0.0753708353440743, -0.3195679876039724, 0.14252052481486638, -0.20490731524975522, -0.12945923692240274, 0.14474773646149597, 0.13328156331436167, 0.16990109073894122, -0.04030566832899481, 0.19366801670373748, -0.07754085994033803, 0.09444611106963852, 0.11896534679351445, -0.048361568505024016, 0.1030844110889431, 0.09490039404570066, 0.22850256610685324, 0.15575747532604994, -0.010560468113701201, -0.07937632000263149, -0.3833952540696799, -0.22279508671239961, -0.1729436207649628, 0.13658350218335003, -0.11913432609988008, -0.18355387107976065, 0.3681797591167726, 0.034834008693364976, 0.2178512139104401, 0.12776208019158156, 0.216130530059373, 0.031162830031347236, 0.0381491033940965, 0.06857673503175567, 0.19076459500290266, 0.163631017437747, 0.061907349369500445, -0.17954303046244144, -0.03765750441868212, 0.1692393962888834]
|
1,803.09054
|
Weighted sums of some second-order sequences
|
We derive weighted summation identities involving the second order recurrence
sequence $\{w_n\} =\{ w_n(a,b; p, q)\}$ defined by $w_0 = a,\,w_1 = b;\,w_n =
pw_{n - 1} - qw_{n - 2}\, (n \ge 2)$, where $a$, $b$, $p$ and $q$ are arbitrary
complex numbers, with $p\ne 0$ and $q\ne 0$.
|
math.NT
|
we derive weighted summation identities involving the second order recurrence sequence w_n w_nab p q defined by w_0 aw_1 bw_n pw_n 1 qw_n 2 n ge 2 where a b p and q are arbitrary complex numbers with pne 0 and qne 0
|
[['we', 'derive', 'weighted', 'summation', 'identities', 'involving', 'the', 'second', 'order', 'recurrence', 'sequence', 'w_n', 'w_nab', 'p', 'q', 'defined', 'by', 'w_0', 'aw_1', 'bw_n', 'pw_n', '1', 'qw_n', '2', 'n', 'ge', '2', 'where', 'a', 'b', 'p', 'and', 'q', 'are', 'arbitrary', 'complex', 'numbers', 'with', 'pne', '0', 'and', 'qne', '0']]
|
[-0.23503311475118002, 0.19597722377437046, 0.02131820761431486, 0.04392217682340206, -0.010751255322247744, -0.24988582136873633, 0.028579240596184555, 0.29367727819734657, -0.30902125303729033, -0.30196590521014655, 0.01699715266481806, -0.2820209449109359, -0.0770240407019185, 0.08431500431078558, 0.049027793969099336, 0.007967467124287326, -0.03230638206243897, 0.09493128397764686, -0.06176596155796105, -0.3010498429051576, 0.31206448829899996, -0.18451196531980082, 0.05924443913719211, -0.09114735766958731, 0.025114734107867267, 0.04609971531690695, -0.002138273241237188, -0.07421839877198903, -0.2684171813993882, 0.06629796832417831, 0.23397756847911155, 0.10834985618025829, 0.26516508306257236, -0.2909970121362653, -0.06900775377662519, 0.1982969607298191, 0.22452484667062378, -0.07647792187829812, 0.06105575037117188, -0.20354105800820085, 0.20919348129954857, -0.16071785810905007, -0.15019093175681356, -0.03862476208581565, 0.20633273418897238, 0.12264818232506514, -0.4242227983016234, 0.08511690824077679, 0.11395633192016529, 0.09198412120055693, -0.00942265530092976, -0.28725512258899516, -0.013593617277458692, 0.08128755657862012, -0.05201578235779053, 0.11652043959698997, -0.0030336155920313336, -0.07037775512211598, -0.10240056852881725, 0.33540083503780455, -0.0042160569051376134, -0.19360321664657348, 0.04520384383459504, -0.2563854613675712, -0.1539064937701019, 0.10660235030958667, 0.06646059396175238, 0.19419477746272698, 0.03474015625528036, 0.20905136563874877, 0.0029562136683708583, 0.13027409554865116, 0.18231442242335433, -0.039788042386181846, 0.06053369444532272, -0.015377258881926537, 0.00692884588184265, 0.06689689733470097, -0.0683659324183678, 0.04705489579683695, -0.39219611052137154, -0.16170271154111013, -0.17732632114814642, 0.2230574458073347, -0.21365754614294602, -0.07373433275960195, 0.2141555296495939, -0.003641979350971106, 0.23033264685326663, 0.1494443650620106, 0.1586105386989239, 0.14727194036524266, -0.03407430289856469, 0.07088593097451405, -0.006622859169370853, 0.19775477697093707, 0.03823493447345801, -0.11956449995154682, -0.02824137017178612, 0.13918239655546272]
|
1,803.09055
|
Asymptotic Representations of Statistics in the Functional Empirical
process : A portal and some applications
|
In this research monograph, we deal with a very general asymptotic
representation for statistics named GRI expressed in the functional empirical
process, both one-dimensional and multidimensional, and another call residual
empirical process. Most of statistics in form of combination of L-statistics
are covered by the asymptotic theory dealt here. This treatise is conceived to
be a kind of \textbf{spaceship} on which modules are hanged. The spaceship is a
functional Gaussian process and each module is the asymptotic representation of
one statistic in terms of that Gaussian process. In that way, it is possible to
navigate from one module to another, that is, to find the joint distribution of
any pair of statistics, to compare them with respect to the areas and the
times. In order to be able to do so, we should have a broad conception at the
beginning. Within the constructed frame, the asymptotic joint law of any finite
number of other statistics is automatically given as well as the joint
distribution of its spatial variation or temporal variation, in absolute or
relative values. We also deal with the general problem of decomposability of
statistics by comparing statistical decomposability, a new view we introduce,
versus functional decomposability. A general result only based on the GRI is
provided. \noindent This monograph is also the portal of a handbook of GRI that
will cover the largest number possible of statistics. In prevision of that, we
treat three important examples as show cases. It is expected that this portal
and the handbook will attract the attention of researchers working in the
asymptotic area and will furnish useful tools to scientists who are interested
in application of asymptotic tests, completed by computer packages.
|
stat.ME
|
in this research monograph we deal with a very general asymptotic representation for statistics named gri expressed in the functional empirical process both onedimensional and multidimensional and another call residual empirical process most of statistics in form of combination of lstatistics are covered by the asymptotic theory dealt here this treatise is conceived to be a kind of textbfspaceship on which modules are hanged the spaceship is a functional gaussian process and each module is the asymptotic representation of one statistic in terms of that gaussian process in that way it is possible to navigate from one module to another that is to find the joint distribution of any pair of statistics to compare them with respect to the areas and the times in order to be able to do so we should have a broad conception at the beginning within the constructed frame the asymptotic joint law of any finite number of other statistics is automatically given as well as the joint distribution of its spatial variation or temporal variation in absolute or relative values we also deal with the general problem of decomposability of statistics by comparing statistical decomposability a new view we introduce versus functional decomposability a general result only based on the gri is provided noindent this monograph is also the portal of a handbook of gri that will cover the largest number possible of statistics in prevision of that we treat three important examples as show cases it is expected that this portal and the handbook will attract the attention of researchers working in the asymptotic area and will furnish useful tools to scientists who are interested in application of asymptotic tests completed by computer packages
|
[['in', 'this', 'research', 'monograph', 'we', 'deal', 'with', 'a', 'very', 'general', 'asymptotic', 'representation', 'for', 'statistics', 'named', 'gri', 'expressed', 'in', 'the', 'functional', 'empirical', 'process', 'both', 'onedimensional', 'and', 'multidimensional', 'and', 'another', 'call', 'residual', 'empirical', 'process', 'most', 'of', 'statistics', 'in', 'form', 'of', 'combination', 'of', 'lstatistics', 'are', 'covered', 'by', 'the', 'asymptotic', 'theory', 'dealt', 'here', 'this', 'treatise', 'is', 'conceived', 'to', 'be', 'a', 'kind', 'of', 'textbfspaceship', 'on', 'which', 'modules', 'are', 'hanged', 'the', 'spaceship', 'is', 'a', 'functional', 'gaussian', 'process', 'and', 'each', 'module', 'is', 'the', 'asymptotic', 'representation', 'of', 'one', 'statistic', 'in', 'terms', 'of', 'that', 'gaussian', 'process', 'in', 'that', 'way', 'it', 'is', 'possible', 'to', 'navigate', 'from', 'one', 'module', 'to', 'another', 'that', 'is', 'to', 'find', 'the', 'joint', 'distribution', 'of', 'any', 'pair', 'of', 'statistics', 'to', 'compare', 'them', 'with', 'respect', 'to', 'the', 'areas', 'and', 'the', 'times', 'in', 'order', 'to', 'be', 'able', 'to', 'do', 'so', 'we', 'should', 'have', 'a', 'broad', 'conception', 'at', 'the', 'beginning', 'within', 'the', 'constructed', 'frame', 'the', 'asymptotic', 'joint', 'law', 'of', 'any', 'finite', 'number', 'of', 'other', 'statistics', 'is', 'automatically', 'given', 'as', 'well', 'as', 'the', 'joint', 'distribution', 'of', 'its', 'spatial', 'variation', 'or', 'temporal', 'variation', 'in', 'absolute', 'or', 'relative', 'values', 'we', 'also', 'deal', 'with', 'the', 'general', 'problem', 'of', 'decomposability', 'of', 'statistics', 'by', 'comparing', 'statistical', 'decomposability', 'a', 'new', 'view', 'we', 'introduce', 'versus', 'functional', 'decomposability', 'a', 'general', 'result', 'only', 'based', 'on', 'the', 'gri', 'is', 'provided', 'noindent', 'this', 'monograph', 'is', 'also', 'the', 'portal', 'of', 'a', 'handbook', 'of', 'gri', 'that', 'will', 'cover', 'the', 'largest', 'number', 'possible', 'of', 'statistics', 'in', 'prevision', 'of', 'that', 'we', 'treat', 'three', 'important', 'examples', 'as', 'show', 'cases', 'it', 'is', 'expected', 'that', 'this', 'portal', 'and', 'the', 'handbook', 'will', 'attract', 'the', 'attention', 'of', 'researchers', 'working', 'in', 'the', 'asymptotic', 'area', 'and', 'will', 'furnish', 'useful', 'tools', 'to', 'scientists', 'who', 'are', 'interested', 'in', 'application', 'of', 'asymptotic', 'tests', 'completed', 'by', 'computer', 'packages']]
|
[-0.061430278054779464, 0.06560790857100593, -0.12526723256097674, 0.09438566092339898, -0.09997023263962806, -0.10688557662914329, 0.03631971474678721, 0.35846051112748684, -0.26683243091392794, -0.30350013781675705, 0.1150335833338821, -0.26960777537814073, -0.15260832783699568, 0.193166837510736, -0.11291240134949995, 0.02522953745948533, 0.05503880256645581, 0.07866899474091561, -0.04112611546089673, -0.27433465149037406, 0.3056972823005968, 0.06330722254933789, 0.2717042488869213, 0.008744895582744253, 0.08242361912271008, 0.017264644455696854, -0.07723266565008088, 0.03845591070010284, -0.12754851904459688, 0.15760635118889954, 0.2734524644404051, 0.152172009061074, 0.3066268108219707, -0.3815394564598267, -0.17286397880317445, 0.1182462036551442, 0.1411421630348611, 0.07363050239385172, -0.005787614918413705, -0.2488645455101505, 0.09971012652126124, -0.18343922107929497, -0.133818325217622, -0.05986520545791011, 0.01799089860204341, 0.04693451913792939, -0.2684530464383507, 0.03895079673363528, 0.045632634332754864, 0.07332757331065036, -0.006326489303111364, -0.1090665231496262, 0.021054959673866894, 0.14479417276868065, 0.053381662255768396, 0.013566852328533838, 0.07820433272240085, -0.13407866621356723, -0.0923723410823316, 0.3649604101665318, -0.05073755162780539, -0.20617305697544777, 0.17148123192767215, -0.1476608062445718, -0.17078328418512165, 0.07754518008524817, 0.1686144280106029, 0.09535928493187384, -0.1630136024190246, 0.09951028359927087, -0.04133174662144613, 0.12656952641711022, 0.0544592098058534, 0.0170389467739629, 0.1938963708409574, 0.13924890930731115, 0.05363150355447682, 0.1477295521698709, -0.06510829263809553, -0.08546615459365836, -0.3415607538140778, -0.18563036725453066, -0.202425376354118, 0.018063985955502307, -0.04354008324579419, -0.16113662111705968, 0.39599011476800244, 0.15017846633979517, 0.1713319909126897, 0.0660488681910335, 0.26074753493469743, 0.10930865129547393, 0.05139909133348348, 0.03546637428724872, 0.19696687464602292, 0.12905754927944924, 0.09849300977657549, -0.11110470453048557, 0.0737108175260281, 0.05362718543786157]
|
1,803.09056
|
A Note on Bootstrap Percolation Thresholds in Plane Tilings using
Regular Polygons
|
In \emph{$k$-bootstrap percolation}, we fix $p\in (0,1)$, an integer $k$, and
a plane graph $G$. Initially, we infect each face of $G$ independently with
probability $p$. Infected faces remain infected forever, and if a healthy
(uninfected) face has at least $k$ infected neighbors, then it becomes
infected. For fixed $G$ and $p$, the \emph{percolation threshold} is the
largest $k$ such that eventually all faces become infected, with probability at
least $1/2$. For a large class of infinite graphs, we show that this threshold
is independent of $p$.
We consider bootstrap percolation in tilings of the plane by regular
polygons. A \emph{vertex type} in such a tiling is the cyclic order of the
faces that meet a common vertex. First, we determine the percolation threshold
for each of the Archimedean lattices. More generally, let $\mathcal{T}$ denote
the set of plane tilings $T$ by regular polygons such that if $T$ contains one
instance of a vertex type, then $T$ contains infinitely many instances of that
type. We show that no tiling in $\mathcal{T}$ has threshold 4 or more. Further,
the only tilings in $\mathcal{T}$ with threshold 3 are four of the Archimedean
lattices. Finally, we describe a large subclass of $\mathcal{T}$ with threshold
2.
|
math.CO math.PR
|
in emphkbootstrap percolation we fix pin 01 an integer k and a plane graph g initially we infect each face of g independently with probability p infected faces remain infected forever and if a healthy uninfected face has at least k infected neighbors then it becomes infected for fixed g and p the emphpercolation threshold is the largest k such that eventually all faces become infected with probability at least 12 for a large class of infinite graphs we show that this threshold is independent of p we consider bootstrap percolation in tilings of the plane by regular polygons a emphvertex type in such a tiling is the cyclic order of the faces that meet a common vertex first we determine the percolation threshold for each of the archimedean lattices more generally let mathcalt denote the set of plane tilings t by regular polygons such that if t contains one instance of a vertex type then t contains infinitely many instances of that type we show that no tiling in mathcalt has threshold 4 or more further the only tilings in mathcalt with threshold 3 are four of the archimedean lattices finally we describe a large subclass of mathcalt with threshold 2
|
[['in', 'emphkbootstrap', 'percolation', 'we', 'fix', 'pin', '01', 'an', 'integer', 'k', 'and', 'a', 'plane', 'graph', 'g', 'initially', 'we', 'infect', 'each', 'face', 'of', 'g', 'independently', 'with', 'probability', 'p', 'infected', 'faces', 'remain', 'infected', 'forever', 'and', 'if', 'a', 'healthy', 'uninfected', 'face', 'has', 'at', 'least', 'k', 'infected', 'neighbors', 'then', 'it', 'becomes', 'infected', 'for', 'fixed', 'g', 'and', 'p', 'the', 'emphpercolation', 'threshold', 'is', 'the', 'largest', 'k', 'such', 'that', 'eventually', 'all', 'faces', 'become', 'infected', 'with', 'probability', 'at', 'least', '12', 'for', 'a', 'large', 'class', 'of', 'infinite', 'graphs', 'we', 'show', 'that', 'this', 'threshold', 'is', 'independent', 'of', 'p', 'we', 'consider', 'bootstrap', 'percolation', 'in', 'tilings', 'of', 'the', 'plane', 'by', 'regular', 'polygons', 'a', 'emphvertex', 'type', 'in', 'such', 'a', 'tiling', 'is', 'the', 'cyclic', 'order', 'of', 'the', 'faces', 'that', 'meet', 'a', 'common', 'vertex', 'first', 'we', 'determine', 'the', 'percolation', 'threshold', 'for', 'each', 'of', 'the', 'archimedean', 'lattices', 'more', 'generally', 'let', 'mathcalt', 'denote', 'the', 'set', 'of', 'plane', 'tilings', 't', 'by', 'regular', 'polygons', 'such', 'that', 'if', 't', 'contains', 'one', 'instance', 'of', 'a', 'vertex', 'type', 'then', 't', 'contains', 'infinitely', 'many', 'instances', 'of', 'that', 'type', 'we', 'show', 'that', 'no', 'tiling', 'in', 'mathcalt', 'has', 'threshold', '4', 'or', 'more', 'further', 'the', 'only', 'tilings', 'in', 'mathcalt', 'with', 'threshold', '3', 'are', 'four', 'of', 'the', 'archimedean', 'lattices', 'finally', 'we', 'describe', 'a', 'large', 'subclass', 'of', 'mathcalt', 'with', 'threshold', '2']]
|
[-0.15160598066984676, 0.17924852458301757, -0.017316291774623096, 0.024966124362545087, -0.061560994324972855, -0.20501512279734016, 0.09234354144195095, 0.3670085516944528, -0.2685565871791914, -0.21070994257519488, 0.11990699841466267, -0.3691098552313633, -0.1475278233841527, 0.07728121045976877, -0.05959697273443453, -0.01131285200615821, 0.049642696604132654, 0.14968518454348667, 0.024546191168483347, -0.31817478787110304, 0.30455811224645, -0.08321278662537225, 0.16794249972968828, 0.011457215093541891, 0.08540733184665442, 0.04552364082424901, 0.06151484646601602, 0.10740166270639748, -0.19616215183741587, 0.020053921941434964, 0.2605966421565972, 0.1299694086951422, 0.28498999804258346, -0.3791071938816458, -0.14283284310717137, 0.22228215713053942, 0.1283921101107262, 0.06476892001810483, -0.00211355143590481, -0.18973363771103322, 0.19573325663921423, -0.12241137549746782, -0.16902835560729726, 0.03795416031498462, 0.14754832793027162, 0.01052480204962194, -0.28866287033073607, -0.0017454442370217294, 0.10763630748027936, 0.07730045262724161, 0.016162652016500943, -0.15098156174994073, -0.08710907855886035, 0.10814865043503233, -0.051799140299553986, 0.06680279934429563, 0.06406792788999155, -0.1153325066328398, -0.13404822199139743, 0.3662287151941564, 0.020328127183311152, -0.16093105495674537, 0.14933095050044357, -0.21880713696358725, -0.18251340030925348, 0.1725470778066665, 0.12272380886177416, 0.1336421928368509, -0.09470844264142216, 0.13810027186671506, -0.10597904084715992, 0.12168108764570207, 0.14464830506709403, -0.056518681378220206, 0.1697491922834888, 0.15813330622040667, 0.1586820166153484, 0.18151100348914043, -0.06959048041375354, 0.010754941994673573, -0.32025748785352337, -0.09200570040848106, -0.21184632783406415, 0.09855357621214353, -0.167415013243226, -0.19908014874206856, 0.3632885430660099, 0.11278909448301419, 0.22463109099538997, 0.10910271611297503, 0.17588986333226786, 0.05258035616665438, 0.07294511537998914, 0.13006872910598757, 0.08257183877984062, 0.07615436766995116, -0.05797729634679854, -0.12276630410458893, 0.05463550721644424, 0.12848157949978486]
|
1,803.09057
|
Surface Pressure of Charged Colloids at the Air/Water Interface
|
Charged colloidal monolayers at the interface between water and air (or oil)
are used in a large number of chemical, physical and biological applications.
Although a considerable experimental and theoretical effort has been devoted in
the past few decades to investigate such monolayers, some of their fundamental
properties are not yet fully understood. In this paper, we model charged
colloidal monolayers as a continuum layer of finite thickness, with separate
charge distribution on the water and air sides. The electrostatic surface
free-energy and surface pressure are calculated via the charging method and
within the Debye-H{\"u}ckel approximation. We obtain the dependence of surface
pressure on several system parameters: the monolayer thickness, its distinct
dielectric permittivity, and the ionic strength of the aqueous subphase. The
surface pressure scaling with the area per particle, ${a}$, is found to be
between ${a}^{-2}$ in the close-packing limit, and ${a}^{-5/2}$ in the
loose-packing limit. In general, it is found that the surface-pressure is
strongly influenced by charges on the air-side of the colloids. However, when
the larger charge resides on the water-side, a more subtle dependence on salt
concentration emerges. This corrects a common assumption that the charges on
the water-side can \textit{always} be neglected due to screening. Finally,
using a single fit parameter, our theory is found to fit well the experimental
data for strong to intermediate strength electrolytes. We postulate that an
anomalous scaling of $a^{-3/2}$, recently observed in low ionic concentrations,
cannot be accounted for within a linear theory, and its explanation requires a
fully-nonlinear analysis.
|
cond-mat.soft cond-mat.mtrl-sci cond-mat.stat-mech physics.chem-ph
|
charged colloidal monolayers at the interface between water and air or oil are used in a large number of chemical physical and biological applications although a considerable experimental and theoretical effort has been devoted in the past few decades to investigate such monolayers some of their fundamental properties are not yet fully understood in this paper we model charged colloidal monolayers as a continuum layer of finite thickness with separate charge distribution on the water and air sides the electrostatic surface freeenergy and surface pressure are calculated via the charging method and within the debyehuckel approximation we obtain the dependence of surface pressure on several system parameters the monolayer thickness its distinct dielectric permittivity and the ionic strength of the aqueous subphase the surface pressure scaling with the area per particle a is found to be between a2 in the closepacking limit and a52 in the loosepacking limit in general it is found that the surfacepressure is strongly influenced by charges on the airside of the colloids however when the larger charge resides on the waterside a more subtle dependence on salt concentration emerges this corrects a common assumption that the charges on the waterside can textitalways be neglected due to screening finally using a single fit parameter our theory is found to fit well the experimental data for strong to intermediate strength electrolytes we postulate that an anomalous scaling of a32 recently observed in low ionic concentrations cannot be accounted for within a linear theory and its explanation requires a fullynonlinear analysis
|
[['charged', 'colloidal', 'monolayers', 'at', 'the', 'interface', 'between', 'water', 'and', 'air', 'or', 'oil', 'are', 'used', 'in', 'a', 'large', 'number', 'of', 'chemical', 'physical', 'and', 'biological', 'applications', 'although', 'a', 'considerable', 'experimental', 'and', 'theoretical', 'effort', 'has', 'been', 'devoted', 'in', 'the', 'past', 'few', 'decades', 'to', 'investigate', 'such', 'monolayers', 'some', 'of', 'their', 'fundamental', 'properties', 'are', 'not', 'yet', 'fully', 'understood', 'in', 'this', 'paper', 'we', 'model', 'charged', 'colloidal', 'monolayers', 'as', 'a', 'continuum', 'layer', 'of', 'finite', 'thickness', 'with', 'separate', 'charge', 'distribution', 'on', 'the', 'water', 'and', 'air', 'sides', 'the', 'electrostatic', 'surface', 'freeenergy', 'and', 'surface', 'pressure', 'are', 'calculated', 'via', 'the', 'charging', 'method', 'and', 'within', 'the', 'debyehuckel', 'approximation', 'we', 'obtain', 'the', 'dependence', 'of', 'surface', 'pressure', 'on', 'several', 'system', 'parameters', 'the', 'monolayer', 'thickness', 'its', 'distinct', 'dielectric', 'permittivity', 'and', 'the', 'ionic', 'strength', 'of', 'the', 'aqueous', 'subphase', 'the', 'surface', 'pressure', 'scaling', 'with', 'the', 'area', 'per', 'particle', 'a', 'is', 'found', 'to', 'be', 'between', 'a2', 'in', 'the', 'closepacking', 'limit', 'and', 'a52', 'in', 'the', 'loosepacking', 'limit', 'in', 'general', 'it', 'is', 'found', 'that', 'the', 'surfacepressure', 'is', 'strongly', 'influenced', 'by', 'charges', 'on', 'the', 'airside', 'of', 'the', 'colloids', 'however', 'when', 'the', 'larger', 'charge', 'resides', 'on', 'the', 'waterside', 'a', 'more', 'subtle', 'dependence', 'on', 'salt', 'concentration', 'emerges', 'this', 'corrects', 'a', 'common', 'assumption', 'that', 'the', 'charges', 'on', 'the', 'waterside', 'can', 'textitalways', 'be', 'neglected', 'due', 'to', 'screening', 'finally', 'using', 'a', 'single', 'fit', 'parameter', 'our', 'theory', 'is', 'found', 'to', 'fit', 'well', 'the', 'experimental', 'data', 'for', 'strong', 'to', 'intermediate', 'strength', 'electrolytes', 'we', 'postulate', 'that', 'an', 'anomalous', 'scaling', 'of', 'a32', 'recently', 'observed', 'in', 'low', 'ionic', 'concentrations', 'can', 'not', 'be', 'accounted', 'for', 'within', 'a', 'linear', 'theory', 'and', 'its', 'explanation', 'requires', 'a', 'fullynonlinear', 'analysis']]
|
[-0.0881511789967402, 0.1539955232426961, -0.0632576715514814, 0.028329927772690083, -0.0043618443989313195, -0.12454751137429701, 0.04838783182582582, 0.3752414134168436, -0.23817548073739522, -0.31842820736254374, 0.0514222092151324, -0.2834111262733738, -0.13291551090411044, 0.16884325543120096, -0.024194142756251886, 0.0320688255984957, -0.024093509226712207, -0.009580872055800957, -0.05426720988064531, -0.18416669776031216, 0.24115690980097354, 0.04299854322905756, 0.28214741782617886, 0.16306726294680543, 0.06846984834382533, -0.029601850364882026, 0.035654002277638826, 0.08129739894768194, -0.14548592112488035, 0.08600011161927666, 0.21971698549099355, -0.02238301521569993, 0.2377004730459746, -0.46485341440827127, -0.2439156653995197, 0.056219325195314244, 0.12116740661717597, 0.12601542254606823, -0.08346960609548934, -0.22845156428529806, 0.05927140466750614, -0.1412647836010105, -0.12851945786932778, -0.04872189675982568, 0.0319757376546188, 0.04283189784415761, -0.23241050177372047, 0.11748136593664568, 0.024088643961087137, 0.0661639332076505, -0.09598948970383461, -0.142868241797837, -0.06785986760801208, 0.11439929154781452, 0.10338392708818281, 0.015445322486653274, 0.20667786064690777, -0.12640814101605286, -0.014508590893080783, 0.39083149611935136, -0.062185956555324426, -0.19094672915802913, 0.22564482020993998, -0.17282761629700424, -0.08885191241556424, 0.16068657021045626, 0.1449087826435321, 0.11101944151238376, -0.16847351011904446, 0.08109812754276116, -0.052354303229736936, 0.2228169317037562, 0.06740893258543182, 0.0056517730092367395, 0.23870139508757607, 0.20818652851425762, 0.019620646446359358, 0.11913674006433529, -0.09312868285702453, -0.0692928232758912, -0.2560495307654261, -0.1631138471277645, -0.19231947284055104, 0.02698196209761562, -0.08954083935549577, -0.17880865158734932, 0.3511467746787867, 0.11024388621398618, 0.17038880044128746, 0.0011909643274968461, 0.2652478520906279, 0.10086156986619157, 0.08474374951176633, 0.025593934903135673, 0.2863556446387693, 0.1371032142409286, 0.10926825878217757, -0.24148757529046777, 0.11055279243922246, 0.03759000181323952]
|
1,803.09058
|
A Single-shot-per-pose Camera-Projector Calibration System For Imperfect
Planar Targets
|
Existing camera-projector calibration methods typically warp feature points
from a camera image to a projector image using estimated homographies, and
often suffer from errors in camera parameters and noise due to imperfect
planarity of the calibration target. In this paper we propose a simple yet
robust solution that explicitly deals with these challenges. Following the
structured light (SL) camera-project calibration framework, a carefully
designed correspondence algorithm is built on top of the De Bruijn patterns.
Such correspondence is then used for initial camera-projector calibration.
Then, to gain more robustness against noises, especially those from an
imperfect planar calibration board, a bundle adjustment algorithm is developed
to jointly optimize the estimated camera and projector models. Aside from the
robustness, our solution requires only one shot of SL pattern for each
calibration board pose, which is much more convenient than multi-shot solutions
in practice. Data validations are conducted on both synthetic and real
datasets, and our method shows clear advantages over existing methods in all
experiments.
|
cs.CV
|
existing cameraprojector calibration methods typically warp feature points from a camera image to a projector image using estimated homographies and often suffer from errors in camera parameters and noise due to imperfect planarity of the calibration target in this paper we propose a simple yet robust solution that explicitly deals with these challenges following the structured light sl cameraproject calibration framework a carefully designed correspondence algorithm is built on top of the de bruijn patterns such correspondence is then used for initial cameraprojector calibration then to gain more robustness against noises especially those from an imperfect planar calibration board a bundle adjustment algorithm is developed to jointly optimize the estimated camera and projector models aside from the robustness our solution requires only one shot of sl pattern for each calibration board pose which is much more convenient than multishot solutions in practice data validations are conducted on both synthetic and real datasets and our method shows clear advantages over existing methods in all experiments
|
[['existing', 'cameraprojector', 'calibration', 'methods', 'typically', 'warp', 'feature', 'points', 'from', 'a', 'camera', 'image', 'to', 'a', 'projector', 'image', 'using', 'estimated', 'homographies', 'and', 'often', 'suffer', 'from', 'errors', 'in', 'camera', 'parameters', 'and', 'noise', 'due', 'to', 'imperfect', 'planarity', 'of', 'the', 'calibration', 'target', 'in', 'this', 'paper', 'we', 'propose', 'a', 'simple', 'yet', 'robust', 'solution', 'that', 'explicitly', 'deals', 'with', 'these', 'challenges', 'following', 'the', 'structured', 'light', 'sl', 'cameraproject', 'calibration', 'framework', 'a', 'carefully', 'designed', 'correspondence', 'algorithm', 'is', 'built', 'on', 'top', 'of', 'the', 'de', 'bruijn', 'patterns', 'such', 'correspondence', 'is', 'then', 'used', 'for', 'initial', 'cameraprojector', 'calibration', 'then', 'to', 'gain', 'more', 'robustness', 'against', 'noises', 'especially', 'those', 'from', 'an', 'imperfect', 'planar', 'calibration', 'board', 'a', 'bundle', 'adjustment', 'algorithm', 'is', 'developed', 'to', 'jointly', 'optimize', 'the', 'estimated', 'camera', 'and', 'projector', 'models', 'aside', 'from', 'the', 'robustness', 'our', 'solution', 'requires', 'only', 'one', 'shot', 'of', 'sl', 'pattern', 'for', 'each', 'calibration', 'board', 'pose', 'which', 'is', 'much', 'more', 'convenient', 'than', 'multishot', 'solutions', 'in', 'practice', 'data', 'validations', 'are', 'conducted', 'on', 'both', 'synthetic', 'and', 'real', 'datasets', 'and', 'our', 'method', 'shows', 'clear', 'advantages', 'over', 'existing', 'methods', 'in', 'all', 'experiments']]
|
[-0.047385243936123686, -0.006110964754291937, -0.10948686764187972, 0.07331292211404938, -0.10601935149980304, -0.19876604777419513, 0.023344853673830213, 0.44336759518855107, -0.24376975368510972, -0.36143955639245345, 0.13833492363496505, -0.26568792832390586, -0.16931764978151884, 0.2328289432670944, -0.16887650022468303, 0.1090545934966262, 0.14259171649026944, -0.028534678988135564, -0.06661553937731284, -0.23950007870599557, 0.2891333968037311, 0.055075765964112344, 0.34612993958481353, -0.051708529743811356, 0.14447616835873897, 0.011801531413275031, -0.07453721694168143, 0.031848387095660714, -0.06317072467444072, 0.10847273186899097, 0.2719751097610474, 0.16673287358539907, 0.24414806951253865, -0.4239663379903165, -0.19157626709513229, 0.08278703737009016, 0.11476273778486153, 0.10052152479279668, -0.054633066949893005, -0.3197450255454512, 0.05985921253999753, -0.13135877361532694, -0.042586967913232895, -0.08557951698507767, -0.028797255977930397, -0.017599421183098547, -0.2916918167965892, 0.019185845345339698, 0.010325410786541814, 0.07295749851890047, -0.05375928528352369, -0.1270334517687374, 0.02631978481221273, 0.13997241558784745, 0.003974356254713135, 0.03755797818303108, 0.1164773684284239, -0.14451244663337234, -0.10270686033320134, 0.3671460358096252, -0.05867863960915913, -0.2451537671146093, 0.16484075909630852, -0.051406412396973335, -0.11053271416823456, 0.13949746075115219, 0.1583048040293134, 0.11950185383895631, -0.15696622265838317, 0.0552973909898638, 0.011334581219631693, 0.23344159918195156, 0.051549675476719965, -0.012999714495359648, 0.1614940257667801, 0.18084756876717997, 0.08102269097041882, 0.11419292617739635, -0.16023278698868912, -0.07124671927994546, -0.25129138647075394, -0.08700148703426308, -0.17517422254107637, -0.01666380786076651, -0.09590545679565146, -0.1533585637692154, 0.38973267732754996, 0.23876704611115573, 0.18125679068880515, 0.049801519121078094, 0.41252932262531716, 0.03608126692641642, 0.06731655253589107, 0.04238261364440879, 0.20637997632892513, 0.04646401948683103, 0.07389557341573563, -0.15600162092307063, 0.06022750240929934, 0.03213833184531016]
|
1,803.09059
|
MTGAN: Speaker Verification through Multitasking Triplet Generative
Adversarial Networks
|
In this paper, we propose an enhanced triplet method that improves the
encoding process of embeddings by jointly utilizing generative adversarial
mechanism and multitasking optimization. We extend our triplet encoder with
Generative Adversarial Networks (GANs) and softmax loss function. GAN is
introduced for increasing the generality and diversity of samples, while
softmax is for reinforcing features about speakers. For simplification, we term
our method Multitasking Triplet Generative Adversarial Networks (MTGAN).
Experiment on short utterances demonstrates that MTGAN reduces the verification
equal error rate (EER) by 67% (relatively) and 32% (relatively) over
conventional i-vector method and state-of-the-art triplet loss method
respectively. This effectively indicates that MTGAN outperforms triplet methods
in the aspect of expressing the high-level feature of speaker information.
|
cs.SD eess.AS
|
in this paper we propose an enhanced triplet method that improves the encoding process of embeddings by jointly utilizing generative adversarial mechanism and multitasking optimization we extend our triplet encoder with generative adversarial networks gans and softmax loss function gan is introduced for increasing the generality and diversity of samples while softmax is for reinforcing features about speakers for simplification we term our method multitasking triplet generative adversarial networks mtgan experiment on short utterances demonstrates that mtgan reduces the verification equal error rate eer by 67 relatively and 32 relatively over conventional ivector method and stateoftheart triplet loss method respectively this effectively indicates that mtgan outperforms triplet methods in the aspect of expressing the highlevel feature of speaker information
|
[['in', 'this', 'paper', 'we', 'propose', 'an', 'enhanced', 'triplet', 'method', 'that', 'improves', 'the', 'encoding', 'process', 'of', 'embeddings', 'by', 'jointly', 'utilizing', 'generative', 'adversarial', 'mechanism', 'and', 'multitasking', 'optimization', 'we', 'extend', 'our', 'triplet', 'encoder', 'with', 'generative', 'adversarial', 'networks', 'gans', 'and', 'softmax', 'loss', 'function', 'gan', 'is', 'introduced', 'for', 'increasing', 'the', 'generality', 'and', 'diversity', 'of', 'samples', 'while', 'softmax', 'is', 'for', 'reinforcing', 'features', 'about', 'speakers', 'for', 'simplification', 'we', 'term', 'our', 'method', 'multitasking', 'triplet', 'generative', 'adversarial', 'networks', 'mtgan', 'experiment', 'on', 'short', 'utterances', 'demonstrates', 'that', 'mtgan', 'reduces', 'the', 'verification', 'equal', 'error', 'rate', 'eer', 'by', '67', 'relatively', 'and', '32', 'relatively', 'over', 'conventional', 'ivector', 'method', 'and', 'stateoftheart', 'triplet', 'loss', 'method', 'respectively', 'this', 'effectively', 'indicates', 'that', 'mtgan', 'outperforms', 'triplet', 'methods', 'in', 'the', 'aspect', 'of', 'expressing', 'the', 'highlevel', 'feature', 'of', 'speaker', 'information']]
|
[-0.02706892408054917, -0.018206260842931487, -0.016270996407926584, 0.1120375952465997, -0.07974452483506889, -0.229011930724872, 0.06058106505988995, 0.4802626572987613, -0.24622728844650654, -0.32514683731651606, -0.031781070910691586, -0.2657198016492634, -0.20005118231750837, 0.13789814986100718, -0.17533258608534558, 0.07354482994297472, 0.12004715257848636, -0.012358023970927886, -0.0744139091092154, -0.32898743100026073, 0.3323952209012693, 0.054696381937305465, 0.37666561017047706, 0.024536379808638275, 0.17691643411653632, -0.01690683976019255, 0.011062277599331774, -0.10060394341673921, -0.0023666170744020922, 0.20953375739710672, 0.28528257362356707, 0.21480516461311144, 0.33607152474558905, -0.345329491867676, -0.25347596952425583, 0.07106209229462694, 0.14929629237187572, 0.12224913957262677, -0.030745663125451433, -0.3541518879913482, 0.1393682677455309, -0.21737243931646608, 0.0884433813068327, -0.12153574922161192, -0.06768188924927797, -0.03719129366457791, -0.3386026176725741, 0.08123176055373389, 0.18134742480616609, 0.0844530017514314, -0.07163168943072316, -0.15756018037962563, -0.006451209948374694, 0.0753674322754896, 0.06064605858434234, 0.09254185196321395, 0.10044561819948193, -0.18470687102604688, -0.14407962912834493, 0.25387987680733204, -0.14710964210636662, -0.19355295514790616, 0.1360418485524524, 0.033628084602914436, -0.09138261771001735, 0.11922017830040525, 0.19351248100337362, 0.14275528523413575, -0.1498966376696314, -0.01172270452918704, -0.0027886440384616495, 0.20251085473021038, 0.04912966276918139, 0.040715253994087965, 0.1204792742965696, 0.2733122817232829, 0.01607357578336441, 0.170257191784179, -0.1460539502299101, -0.0872629114246669, -0.2078201405688369, -0.10524094318814513, -0.2072269510039512, -0.031084433350586842, -0.09674968121183485, -0.07656143128308428, 0.40749575593704435, 0.24089075998645745, 0.21131130903881012, 0.17318027945501463, 0.34430551439124557, 0.03752300549521573, 0.14254552285586083, 0.08709865525177046, 0.19012661584742963, 0.046083822077484564, 0.0927597156289511, -0.19957536802541057, 0.1487138190330202, 0.055024294037872755]
|
1,803.0906
|
Terahertz Technologies to Deliver Optical Network Quality of Experience
in Wireless Systems Beyond 5G
|
This article discusses the basic system architecture for terahertz (THz)
wireless links with bandwidths of more than 50 GHz into optical networks. New
design principles and breakthrough technologies are required in order to
demonstrate Tbps data-rates at near zero-latency using the proposed system
concept. Specifically, we present the concept of designing the baseband signal
processing for both the optical and wireless link and using an end-to-end (E2E)
error correction approach for the combined link. We provide two possible
electro-optical baseband interface architectures, namely transparent
optical-link and digital-link architectures, which are currently under
investigation. THz wireless link requirements are given as well as the main
principles and research directions for the development of a new generation of
transceiver frontends, which will be capable of operating at ultra-high
spectral efficiency by employing higher-order modulation schemes. Moreover, we
discuss the need for developing a novel THz network information theory
framework, which will take into account the channel characteristics and the
nature of interference in the THz band. Finally, we highlight the role of
pencil-beamforming (PBF), which is required in order to overcome the
propagation losses, as well as the physical layer and medium access control
challenges.
|
cs.NI
|
this article discusses the basic system architecture for terahertz thz wireless links with bandwidths of more than 50 ghz into optical networks new design principles and breakthrough technologies are required in order to demonstrate tbps datarates at near zerolatency using the proposed system concept specifically we present the concept of designing the baseband signal processing for both the optical and wireless link and using an endtoend e2e error correction approach for the combined link we provide two possible electrooptical baseband interface architectures namely transparent opticallink and digitallink architectures which are currently under investigation thz wireless link requirements are given as well as the main principles and research directions for the development of a new generation of transceiver frontends which will be capable of operating at ultrahigh spectral efficiency by employing higherorder modulation schemes moreover we discuss the need for developing a novel thz network information theory framework which will take into account the channel characteristics and the nature of interference in the thz band finally we highlight the role of pencilbeamforming pbf which is required in order to overcome the propagation losses as well as the physical layer and medium access control challenges
|
[['this', 'article', 'discusses', 'the', 'basic', 'system', 'architecture', 'for', 'terahertz', 'thz', 'wireless', 'links', 'with', 'bandwidths', 'of', 'more', 'than', '50', 'ghz', 'into', 'optical', 'networks', 'new', 'design', 'principles', 'and', 'breakthrough', 'technologies', 'are', 'required', 'in', 'order', 'to', 'demonstrate', 'tbps', 'datarates', 'at', 'near', 'zerolatency', 'using', 'the', 'proposed', 'system', 'concept', 'specifically', 'we', 'present', 'the', 'concept', 'of', 'designing', 'the', 'baseband', 'signal', 'processing', 'for', 'both', 'the', 'optical', 'and', 'wireless', 'link', 'and', 'using', 'an', 'endtoend', 'e2e', 'error', 'correction', 'approach', 'for', 'the', 'combined', 'link', 'we', 'provide', 'two', 'possible', 'electrooptical', 'baseband', 'interface', 'architectures', 'namely', 'transparent', 'opticallink', 'and', 'digitallink', 'architectures', 'which', 'are', 'currently', 'under', 'investigation', 'thz', 'wireless', 'link', 'requirements', 'are', 'given', 'as', 'well', 'as', 'the', 'main', 'principles', 'and', 'research', 'directions', 'for', 'the', 'development', 'of', 'a', 'new', 'generation', 'of', 'transceiver', 'frontends', 'which', 'will', 'be', 'capable', 'of', 'operating', 'at', 'ultrahigh', 'spectral', 'efficiency', 'by', 'employing', 'higherorder', 'modulation', 'schemes', 'moreover', 'we', 'discuss', 'the', 'need', 'for', 'developing', 'a', 'novel', 'thz', 'network', 'information', 'theory', 'framework', 'which', 'will', 'take', 'into', 'account', 'the', 'channel', 'characteristics', 'and', 'the', 'nature', 'of', 'interference', 'in', 'the', 'thz', 'band', 'finally', 'we', 'highlight', 'the', 'role', 'of', 'pencilbeamforming', 'pbf', 'which', 'is', 'required', 'in', 'order', 'to', 'overcome', 'the', 'propagation', 'losses', 'as', 'well', 'as', 'the', 'physical', 'layer', 'and', 'medium', 'access', 'control', 'challenges']]
|
[-0.18056056373691382, 0.056275595828207625, -0.005244845488892967, 0.0031426823183305953, -0.0756971228304074, -0.16974208885803818, 0.05813440638226702, 0.43330614293288244, -0.2686781289938249, -0.3101027072480831, 0.11331650754620665, -0.21047467460096078, -0.20123952029910136, 0.2396670653705338, -0.05263200626880127, 0.08387560082329927, 0.03513671177635459, -0.05345336705994621, -0.02949457039940171, -0.1681829339824617, 0.2950803449254875, 0.10835623919081531, 0.36924669575926505, 0.0913066865750711, 0.09607872901190269, 0.004907371527760437, -0.022268838239343544, -0.06280168459664932, -0.09752137912621134, 0.15507803164839157, 0.3153526254120822, 0.120383106752936, 0.295903396498608, -0.4626429748035183, -0.2648247987080954, 0.03362064001052395, 0.13910995879712956, 0.0882756501048693, -0.05764732675444592, -0.27423582217705095, 0.11926261644908472, -0.19379435889422894, -0.06408463155997819, -0.052683152499804764, -0.0688673035664435, 0.03952360600233078, -0.2746345758683195, -0.028090894288432443, 0.024329135418673487, 0.04441840166324063, -0.045391793182046204, -0.10229424050960102, 0.05710151123471166, 0.15318934314541127, -0.04342974436861512, 0.004032701388074968, 0.10794837821036038, -0.12900911544964305, -0.13183599768855953, 0.3929094044614191, -0.018104758088578053, -0.14057510806198575, 0.1445648332074358, -0.06971340841831222, -0.08998354915774574, 0.11686455937788674, 0.24012971135150446, 0.026309165530102818, -0.1916572552027279, -6.776680330451774e-05, 0.08787690055507578, 0.16122788708460958, 0.06418192656465659, 0.1750280510340082, 0.2217967497601517, 0.24689284631688344, 0.0834334766014332, 0.1400440381319066, -0.13548893610407647, -0.047706681053999715, -0.28681095375336313, -0.1651705442131252, -0.17461882738862186, 0.007060428163477857, -0.05127305519027255, -0.0726281438880649, 0.414992816290377, 0.18889353680669477, 0.10109939351187724, 0.06698040994815528, 0.3868224751988524, 0.09981516356040773, 0.09632994355143686, 0.07953847128848889, 0.24547400567680597, 0.10746986186254377, 0.17293931825184508, -0.16762060026246073, 0.019827000742876216, -0.0035030190587828033]
|
1,803.09061
|
Simultaneous production of D and B mesons
|
We present results of our studies of double-parton scattering (DPS) effects
in simultaneous production of heavy flavour mesons (charm and bottom). We
discuss production of charm-bottom and bottom-bottom meson-meson pairs in
proton-proton collisions at the LHC. The calculation of DPS mechanism is
performed within factorized ansatz where each parton scattering is calculated
within $k_T$-factorization approach. The hadronization is done with the help of
fragmentation functions. For completeness we compare results for double- and
single-parton scattering (SPS). The SPS components are also calculated in the
$k_{T}$-factorization with the help of KaTie Monte Carlo generator. As in the
case of double charm production also here the DPS dominates over the SPS,
especially for small transverse momenta. We present several distributions and
integrated cross sections with realistic cuts for simultaneous production of
$D^0 B^+$ and $B^+ B^+$, suggesting future experimental studies at the LHC.
|
hep-ph
|
we present results of our studies of doubleparton scattering dps effects in simultaneous production of heavy flavour mesons charm and bottom we discuss production of charmbottom and bottombottom mesonmeson pairs in protonproton collisions at the lhc the calculation of dps mechanism is performed within factorized ansatz where each parton scattering is calculated within k_tfactorization approach the hadronization is done with the help of fragmentation functions for completeness we compare results for double and singleparton scattering sps the sps components are also calculated in the k_tfactorization with the help of katie monte carlo generator as in the case of double charm production also here the dps dominates over the sps especially for small transverse momenta we present several distributions and integrated cross sections with realistic cuts for simultaneous production of d0 b and b b suggesting future experimental studies at the lhc
|
[['we', 'present', 'results', 'of', 'our', 'studies', 'of', 'doubleparton', 'scattering', 'dps', 'effects', 'in', 'simultaneous', 'production', 'of', 'heavy', 'flavour', 'mesons', 'charm', 'and', 'bottom', 'we', 'discuss', 'production', 'of', 'charmbottom', 'and', 'bottombottom', 'mesonmeson', 'pairs', 'in', 'protonproton', 'collisions', 'at', 'the', 'lhc', 'the', 'calculation', 'of', 'dps', 'mechanism', 'is', 'performed', 'within', 'factorized', 'ansatz', 'where', 'each', 'parton', 'scattering', 'is', 'calculated', 'within', 'k_tfactorization', 'approach', 'the', 'hadronization', 'is', 'done', 'with', 'the', 'help', 'of', 'fragmentation', 'functions', 'for', 'completeness', 'we', 'compare', 'results', 'for', 'double', 'and', 'singleparton', 'scattering', 'sps', 'the', 'sps', 'components', 'are', 'also', 'calculated', 'in', 'the', 'k_tfactorization', 'with', 'the', 'help', 'of', 'katie', 'monte', 'carlo', 'generator', 'as', 'in', 'the', 'case', 'of', 'double', 'charm', 'production', 'also', 'here', 'the', 'dps', 'dominates', 'over', 'the', 'sps', 'especially', 'for', 'small', 'transverse', 'momenta', 'we', 'present', 'several', 'distributions', 'and', 'integrated', 'cross', 'sections', 'with', 'realistic', 'cuts', 'for', 'simultaneous', 'production', 'of', 'd0', 'b', 'and', 'b', 'b', 'suggesting', 'future', 'experimental', 'studies', 'at', 'the', 'lhc']]
|
[-0.04808301932477791, 0.20160791342412787, -0.12057544952258467, 0.1621985852643515, 0.01490835534308904, -0.08354220321801092, 0.022132804324584348, 0.3748824456174459, -0.19712638393310564, -0.21330514672944056, -0.06319815598960433, -0.351478021465508, 0.05304009482746811, 0.17114800743625633, 0.11611961407054748, 0.13244951464501875, 0.15465631381209408, -0.06301102411401059, -0.036174574055309806, -0.22560585053371532, 0.3453968186779613, 0.06914090150634625, 0.2160315864952281, 0.21534525975418675, 0.015552963574217366, 0.14435993523137378, -0.08204067463354607, -0.06807695440615394, -0.11180511318525532, 0.08785661270563391, 0.2840016295946303, 0.06404364859751825, 0.08984915251743847, -0.3747772237618587, -0.08689948632381857, 0.059051014762371776, 0.16899887060447197, 0.11132464200657394, -0.060224909228937966, -0.23438199348581423, 0.12796607852755448, -0.263689306804112, -0.13279865810867963, -0.04687162745810513, -0.015448983106138518, -0.002342437097935804, -0.3353596062066832, 0.06664036387935214, -0.08907322679754413, 0.03035716871464891, -0.008057406764211399, -0.2590505982981995, -0.061813310176200634, 0.013017602411231824, 0.08521924449347093, 0.05569626488411034, 0.16077175639303667, -0.15154402183585003, -0.2450446257234684, 0.3616692962324513, -0.02634900071924286, -0.16232335376885854, 0.15741768612642773, -0.22267785622804825, -0.17442875240230932, 0.1308317664445245, 0.27309254443638825, 0.12106555444853646, -0.21645394087037337, 0.10097358918407866, 0.004975621862935701, 0.10638897780528558, 0.06536399547143706, 0.05458909463070865, 0.13108875750830132, 0.2547731138100581, -0.10682670322260363, 0.103998842872014, -0.1381343701854348, -0.1255063606492643, -0.46275204240477513, -0.08929979051463306, -0.05400659780882831, 0.01072453865116196, -0.04639113252498126, -0.08241142411051051, 0.3342075477686844, 0.10160136376008658, 0.27574738199556514, 0.020953642171142355, 0.32971919261451277, 0.10972333544133497, 0.06818034752130708, 0.08332788951229304, 0.27978205139349616, 0.16333557534297663, 0.13200242627062836, -0.2774700983394203, 0.06474152698647231, 0.01991619278809854]
|
1,803.09062
|
A Tri-Mode Coupled Coil with Tunable Focal Point Adjustment for
Bio-Medical Applications
|
The paper proposes the design of a tri-mode coupled coil which enables three
modes of operation for inducing electromagnetic field, where the focal
adjustment of the E field can be optimized. Methods: The setup consists of two
identical figure-of-eight coils, namely coil 1 and coil 2, coupled to each
other by magnetic resonance coupling. Coil 1 is driven by active source, where
coil 2 is driven by the magnetic field coupled from coil 1. The frequency of
operation would affect the coupling between the coils and hence the current
ratios induced. Results: In the first and the second modes, the current
dominates at the first coil and the second coil, respectively. In the third
mode, both coils conduct similar amount of currents. Conclusion: The concept is
proven by measuring the current ratios of the coils and the voltage induced in
biological tissues. The current ratios in the first and the second modes are
measured as maximum 13.0 and minimal 0.258 at frequencies 487.7 kHz and 453.2
kHz, respectively, while the current ratio measured in the third mode is 1.03.
Significance: The tri-mode coil could potentially be applied for biological
applications such as pulsed electromagnetic energy treatment and thermoacoustic
imaging.
|
physics.med-ph physics.app-ph
|
the paper proposes the design of a trimode coupled coil which enables three modes of operation for inducing electromagnetic field where the focal adjustment of the e field can be optimized methods the setup consists of two identical figureofeight coils namely coil 1 and coil 2 coupled to each other by magnetic resonance coupling coil 1 is driven by active source where coil 2 is driven by the magnetic field coupled from coil 1 the frequency of operation would affect the coupling between the coils and hence the current ratios induced results in the first and the second modes the current dominates at the first coil and the second coil respectively in the third mode both coils conduct similar amount of currents conclusion the concept is proven by measuring the current ratios of the coils and the voltage induced in biological tissues the current ratios in the first and the second modes are measured as maximum 130 and minimal 0258 at frequencies 4877 khz and 4532 khz respectively while the current ratio measured in the third mode is 103 significance the trimode coil could potentially be applied for biological applications such as pulsed electromagnetic energy treatment and thermoacoustic imaging
|
[['the', 'paper', 'proposes', 'the', 'design', 'of', 'a', 'trimode', 'coupled', 'coil', 'which', 'enables', 'three', 'modes', 'of', 'operation', 'for', 'inducing', 'electromagnetic', 'field', 'where', 'the', 'focal', 'adjustment', 'of', 'the', 'e', 'field', 'can', 'be', 'optimized', 'methods', 'the', 'setup', 'consists', 'of', 'two', 'identical', 'figureofeight', 'coils', 'namely', 'coil', '1', 'and', 'coil', '2', 'coupled', 'to', 'each', 'other', 'by', 'magnetic', 'resonance', 'coupling', 'coil', '1', 'is', 'driven', 'by', 'active', 'source', 'where', 'coil', '2', 'is', 'driven', 'by', 'the', 'magnetic', 'field', 'coupled', 'from', 'coil', '1', 'the', 'frequency', 'of', 'operation', 'would', 'affect', 'the', 'coupling', 'between', 'the', 'coils', 'and', 'hence', 'the', 'current', 'ratios', 'induced', 'results', 'in', 'the', 'first', 'and', 'the', 'second', 'modes', 'the', 'current', 'dominates', 'at', 'the', 'first', 'coil', 'and', 'the', 'second', 'coil', 'respectively', 'in', 'the', 'third', 'mode', 'both', 'coils', 'conduct', 'similar', 'amount', 'of', 'currents', 'conclusion', 'the', 'concept', 'is', 'proven', 'by', 'measuring', 'the', 'current', 'ratios', 'of', 'the', 'coils', 'and', 'the', 'voltage', 'induced', 'in', 'biological', 'tissues', 'the', 'current', 'ratios', 'in', 'the', 'first', 'and', 'the', 'second', 'modes', 'are', 'measured', 'as', 'maximum', '130', 'and', 'minimal', '0258', 'at', 'frequencies', '4877', 'khz', 'and', '4532', 'khz', 'respectively', 'while', 'the', 'current', 'ratio', 'measured', 'in', 'the', 'third', 'mode', 'is', '103', 'significance', 'the', 'trimode', 'coil', 'could', 'potentially', 'be', 'applied', 'for', 'biological', 'applications', 'such', 'as', 'pulsed', 'electromagnetic', 'energy', 'treatment', 'and', 'thermoacoustic', 'imaging']]
|
[-0.16043615405009165, 0.2014204405196425, 0.0511307582891819, -0.030243542186464325, -0.033491233152083376, -0.14568319495983723, 0.008810612370114247, 0.33260076493730373, -0.21896670185114173, -0.33116415524008597, 0.07816077523683715, -0.24023864482237836, -0.07521535998746527, 0.25209029906575164, -0.002046082919049594, 0.018451863142539455, 0.013051074312769365, 0.058755497857363836, 0.005720697830177166, -0.10311284477203952, 0.2583189556361035, 0.07835448445808707, 0.33973431563230627, 0.03248119190561049, 0.11340775143947791, -0.038878222919219746, 0.010256077602712644, 0.028609825970811978, -0.10397905006421486, 0.07212856648997827, 0.23569812578139732, 0.05493144386429152, 0.22740282500256795, -0.44363058941683386, -0.13636881891976704, 0.0903909135612217, 0.1269441877398875, 0.06926817462160463, 0.008141475527387376, -0.24749909619320976, 0.09661774032965603, -0.12465600813786039, -0.09546559990731755, -0.019344038213015242, -0.009581677155860823, 0.05820334726924575, -0.3040936248837923, 0.067847672186679, 0.06446461995529726, 0.06440139282024418, -0.07076006816615435, -0.12311233237216418, 0.02511780612603432, 0.0917009467359296, 0.049660521211347196, 0.07857273539970394, 0.2207256111932561, -0.1382853367361193, -0.09387135230042416, 0.31648542148747827, -0.05932358618487011, -0.15639829154436788, 0.13230213655553985, -0.1582186765118615, -0.048399034158486606, 0.14859458877037118, 0.1316761035975445, 0.07330313758369573, -0.16497970437054815, 0.020604315554579682, 0.0990519616054665, 0.18484318246030146, 0.10810702378894532, -0.031763458685629596, 0.24267145504968035, 0.1784393012563632, 0.021024702929108487, 0.18172016354057835, -0.18450521283331467, -0.010023733829101078, -0.26921826736728727, -0.14108383793306226, -0.14804122886282975, 0.016609950227465368, -0.07536836065426339, -0.10224306846573723, 0.4361043857737454, 0.11612197550512249, 0.14553875747992837, -0.013953729235741187, 0.35934077185399904, 0.10199230915344687, 0.10818034196107865, 0.02139165804185199, 0.33428084251125145, 0.18905824382972874, 0.10905368103659853, -0.2502528128813602, 0.016067636648494036, -0.015664562558275506]
|
1,803.09063
|
On solutions of linear fractional differential equations and systems
thereof
|
It is well-known that one-dimensional time fractional diffusion-wave
equations with variable coefficients can be reduced to ordinary fractional
differential equations and systems of linear fractional differential equations
via scaling transformations. We then derive exact solutions to classes of
linear fractional differential equations and systems thereof expressed in terms
of Mittag-Leffler functions, generalized Wright functions and Fox H-functions.
These solutions are invariant solutions of diffusion-wave equations obtained
through certain transformations, which are briefly discussed. We show that the
solutions given in this work contain previously known results as particular
cases.
|
math.CA math-ph math.MP
|
it is wellknown that onedimensional time fractional diffusionwave equations with variable coefficients can be reduced to ordinary fractional differential equations and systems of linear fractional differential equations via scaling transformations we then derive exact solutions to classes of linear fractional differential equations and systems thereof expressed in terms of mittagleffler functions generalized wright functions and fox hfunctions these solutions are invariant solutions of diffusionwave equations obtained through certain transformations which are briefly discussed we show that the solutions given in this work contain previously known results as particular cases
|
[['it', 'is', 'wellknown', 'that', 'onedimensional', 'time', 'fractional', 'diffusionwave', 'equations', 'with', 'variable', 'coefficients', 'can', 'be', 'reduced', 'to', 'ordinary', 'fractional', 'differential', 'equations', 'and', 'systems', 'of', 'linear', 'fractional', 'differential', 'equations', 'via', 'scaling', 'transformations', 'we', 'then', 'derive', 'exact', 'solutions', 'to', 'classes', 'of', 'linear', 'fractional', 'differential', 'equations', 'and', 'systems', 'thereof', 'expressed', 'in', 'terms', 'of', 'mittagleffler', 'functions', 'generalized', 'wright', 'functions', 'and', 'fox', 'hfunctions', 'these', 'solutions', 'are', 'invariant', 'solutions', 'of', 'diffusionwave', 'equations', 'obtained', 'through', 'certain', 'transformations', 'which', 'are', 'briefly', 'discussed', 'we', 'show', 'that', 'the', 'solutions', 'given', 'in', 'this', 'work', 'contain', 'previously', 'known', 'results', 'as', 'particular', 'cases']]
|
[-0.14919419235058046, 0.050176922059251686, -0.0559364745832896, 0.09759066289479143, -0.10950485836672649, -0.14611107042959232, -0.05339691848651077, 0.27424944192171097, -0.32932210786613436, -0.2755054494868336, 0.15701186762902927, -0.2925935419422857, -0.23260529096018565, 0.22026389082004263, -0.06275182403558656, 0.16423510490613205, 0.01741274759654751, -0.02556974361284395, -0.1491196835622861, -0.28772836163891163, 0.34171830996703567, -0.09083631729544925, 0.16998389517114068, -0.05188404918868053, 0.18044390391396212, -0.04615952347122719, -0.09726318611313453, 0.04344279557255831, -0.204496350595394, 0.0650824001268222, 0.30207779184062283, 0.03508743735846509, 0.18598404043259914, -0.43176064440677087, -0.20292436526146498, 0.07750984446768219, 0.15688082285936963, 0.08224468501781773, -0.012145958759748702, -0.3116840512565013, 0.05172432541554229, -0.1572192500769213, -0.2010430617027738, -0.14608183378625786, 0.06603455623569951, 0.18340108599095198, -0.25806439176118107, 0.1650508726957474, 0.07430101858891464, -0.027623648948841884, -0.11418752735310621, -0.14882062160504167, -0.028361236127198076, 0.0016578289606932843, 0.04949534939225303, -0.06264575832952442, 0.027833202053280024, -0.1373877258777744, -0.16259100995016065, 0.3525230676626389, -0.11990328269142113, -0.36816381405662285, 0.13515723389939646, -0.14194048562327796, -0.15201482162653898, 0.09600061610382929, 0.1492410430454471, 0.19154975071465702, -0.22839733120054007, 0.11634043854036044, -0.0778519539424124, 0.11694611228572131, 0.12900476732155244, 0.05770356335750457, 0.048194249788445706, 0.017034278991579842, 0.041434676861233505, 0.15177481145509047, 0.07852224536826101, -0.19323554113664235, -0.3484370036487562, -0.17413485360337067, -0.08005054190943248, 0.06466855383948998, -0.10270972249017678, -0.16689468690016296, 0.3430919825737731, 0.07842632160741794, 0.10293029400446777, 0.08873660034327402, 0.18203079878363046, 0.3718649926739274, 0.021265541485856087, 0.036300954827515594, 0.13670005404463645, 0.1889321609410677, 0.13465657299436795, -0.19828590292357998, 0.02431651647464278, 0.18989398882965022]
|
1,803.09064
|
Center of mass tomography and Wigner function for multimode photon
states
|
Tomographic probability representation of multimode electromagnetic field
states in the scheme of center-of-mass tomography is reviewed. Both connection
of the field state Wigner function and observable Weyl symbols with the
center-of-mass tomograms as well as connection of Gr\"onewold kernel with the
center-of-mass tomographic kernel determining the noncommutative product of the
tomograms are obtained. The dual center-of-mass tomogram of the photon states
are constructed and the dual tomographic kernel is obtained. The models of
other generalised center-of-mass tomographies are discussed. Example of
two-mode Schr\"odinger cat states is presented in details
|
quant-ph
|
tomographic probability representation of multimode electromagnetic field states in the scheme of centerofmass tomography is reviewed both connection of the field state wigner function and observable weyl symbols with the centerofmass tomograms as well as connection of gronewold kernel with the centerofmass tomographic kernel determining the noncommutative product of the tomograms are obtained the dual centerofmass tomogram of the photon states are constructed and the dual tomographic kernel is obtained the models of other generalised centerofmass tomographies are discussed example of twomode schrodinger cat states is presented in details
|
[['tomographic', 'probability', 'representation', 'of', 'multimode', 'electromagnetic', 'field', 'states', 'in', 'the', 'scheme', 'of', 'centerofmass', 'tomography', 'is', 'reviewed', 'both', 'connection', 'of', 'the', 'field', 'state', 'wigner', 'function', 'and', 'observable', 'weyl', 'symbols', 'with', 'the', 'centerofmass', 'tomograms', 'as', 'well', 'as', 'connection', 'of', 'gronewold', 'kernel', 'with', 'the', 'centerofmass', 'tomographic', 'kernel', 'determining', 'the', 'noncommutative', 'product', 'of', 'the', 'tomograms', 'are', 'obtained', 'the', 'dual', 'centerofmass', 'tomogram', 'of', 'the', 'photon', 'states', 'are', 'constructed', 'and', 'the', 'dual', 'tomographic', 'kernel', 'is', 'obtained', 'the', 'models', 'of', 'other', 'generalised', 'centerofmass', 'tomographies', 'are', 'discussed', 'example', 'of', 'twomode', 'schrodinger', 'cat', 'states', 'is', 'presented', 'in', 'details']]
|
[-0.10170258405957032, 0.1752373915779489, -0.09173191252788952, 0.08668955942398911, -0.02009067467853046, -0.14937035273958993, -0.06505433821108784, 0.382843199736354, -0.23991604742001404, -0.2412185106659308, 0.048879394596125086, -0.2778557126346806, -0.07045831208498302, 0.18565230473706668, -0.007901762146502733, 0.14666183044160294, 0.12043940218654825, 0.0769723981608298, -0.13155148436569356, -0.1743475281506438, 0.3854068953607401, 0.0957580979659476, 0.3096534604979256, -0.013406591966155578, 0.16102001795397056, 0.0726597032255747, -0.048390672891400754, -0.04041534062178636, -0.06606022380715744, 0.07030094980952774, 0.26845741684903923, 0.150578759301094, 0.16590035285546698, -0.38062864184294914, -0.16578187100292946, 0.10762105114885014, 0.10663866954961453, 0.11761935089122165, -0.02905975614505058, -0.39580510408532893, -0.06061051753667099, -0.18185251264367253, -0.1482548795862716, -0.08877791147890755, 0.01510611615429463, 0.03461029061173287, -0.22031080422245644, 0.14064030649817802, -0.017826525045992723, 0.04980059483204968, -0.11237271103891544, -0.12502845245498148, -0.08023732308224267, 0.046423797283998945, -0.062401167961070314, 0.041232109535485506, 0.12072353482389273, -0.16098250161369584, -0.1726383272219788, 0.34333215532586275, -0.011693540833551775, -0.22629938075657596, 0.13515038389331577, -0.17848012714900754, -0.030768478971863675, 0.0934068178546361, 0.12734758231090382, 0.09346803155494854, -0.12106120169416747, 0.09270282346220814, -0.043197757405736906, 0.09662453407972035, 0.0849830542045476, 0.15861145933211612, 0.13901774266692388, 0.07507477619219571, -0.012278196698224003, 0.20074570717737183, -0.14484685312279247, -0.1313604039605707, -0.4186287492682988, -0.2047276305754415, -0.274787737659856, 0.05882519729096781, -0.07458213588771204, -0.11499558123085246, 0.40622776011096823, 0.0409760748360978, 0.19125558261293918, -0.023484580917283893, 0.2339105238630013, 0.22890731901597147, 0.027490828514353118, 0.028351685423827308, 0.24910241578155282, 0.25718810977890494, 0.0710934292821383, -0.25186563587538496, -0.06611838162908415, 0.1010664981467099]
|
1,803.09065
|
Near-lossless Binarization of Word Embeddings
|
Word embeddings are commonly used as a starting point in many NLP models to
achieve state-of-the-art performances. However, with a large vocabulary and
many dimensions, these floating-point representations are expensive both in
terms of memory and calculations which makes them unsuitable for use on
low-resource devices. The method proposed in this paper transforms real-valued
embeddings into binary embeddings while preserving semantic information,
requiring only 128 or 256 bits for each vector. This leads to a small memory
footprint and fast vector operations. The model is based on an autoencoder
architecture, which also allows to reconstruct original vectors from the binary
ones. Experimental results on semantic similarity, text classification and
sentiment analysis tasks show that the binarization of word embeddings only
leads to a loss of ~2% in accuracy while vector size is reduced by 97%.
Furthermore, a top-k benchmark demonstrates that using these binary vectors is
30 times faster than using real-valued vectors.
|
cs.CL
|
word embeddings are commonly used as a starting point in many nlp models to achieve stateoftheart performances however with a large vocabulary and many dimensions these floatingpoint representations are expensive both in terms of memory and calculations which makes them unsuitable for use on lowresource devices the method proposed in this paper transforms realvalued embeddings into binary embeddings while preserving semantic information requiring only 128 or 256 bits for each vector this leads to a small memory footprint and fast vector operations the model is based on an autoencoder architecture which also allows to reconstruct original vectors from the binary ones experimental results on semantic similarity text classification and sentiment analysis tasks show that the binarization of word embeddings only leads to a loss of 2 in accuracy while vector size is reduced by 97 furthermore a topk benchmark demonstrates that using these binary vectors is 30 times faster than using realvalued vectors
|
[['word', 'embeddings', 'are', 'commonly', 'used', 'as', 'a', 'starting', 'point', 'in', 'many', 'nlp', 'models', 'to', 'achieve', 'stateoftheart', 'performances', 'however', 'with', 'a', 'large', 'vocabulary', 'and', 'many', 'dimensions', 'these', 'floatingpoint', 'representations', 'are', 'expensive', 'both', 'in', 'terms', 'of', 'memory', 'and', 'calculations', 'which', 'makes', 'them', 'unsuitable', 'for', 'use', 'on', 'lowresource', 'devices', 'the', 'method', 'proposed', 'in', 'this', 'paper', 'transforms', 'realvalued', 'embeddings', 'into', 'binary', 'embeddings', 'while', 'preserving', 'semantic', 'information', 'requiring', 'only', '128', 'or', '256', 'bits', 'for', 'each', 'vector', 'this', 'leads', 'to', 'a', 'small', 'memory', 'footprint', 'and', 'fast', 'vector', 'operations', 'the', 'model', 'is', 'based', 'on', 'an', 'autoencoder', 'architecture', 'which', 'also', 'allows', 'to', 'reconstruct', 'original', 'vectors', 'from', 'the', 'binary', 'ones', 'experimental', 'results', 'on', 'semantic', 'similarity', 'text', 'classification', 'and', 'sentiment', 'analysis', 'tasks', 'show', 'that', 'the', 'binarization', 'of', 'word', 'embeddings', 'only', 'leads', 'to', 'a', 'loss', 'of', '2', 'in', 'accuracy', 'while', 'vector', 'size', 'is', 'reduced', 'by', '97', 'furthermore', 'a', 'topk', 'benchmark', 'demonstrates', 'that', 'using', 'these', 'binary', 'vectors', 'is', '30', 'times', 'faster', 'than', 'using', 'realvalued', 'vectors']]
|
[-0.05953388907368374, 0.04112773766108481, -0.008285054329819247, 0.07874117472499695, -0.10860132597526839, -0.1546546003117007, 0.07715997681724747, 0.4473368009503663, -0.27727172591303495, -0.3209834853248074, 0.09168962371882562, -0.3148224763040548, -0.14208920947215184, 0.2235023610893442, -0.10121902398265947, 0.10495528725456763, 0.15027103761783223, 0.10341550264312746, -0.12652363398361927, -0.31825702561954267, 0.2726569444251557, 0.015664392494858285, 0.33036906470611593, -0.030293798046734405, 0.14201471510531952, -0.012017299410479229, -0.04562571293406578, -0.03978416627254702, 0.011065273026283679, 0.18625606688384722, 0.31322773094426437, 0.17716702637780044, 0.2766738022218026, -0.3893090887025632, -0.204200674122309, 0.08046062873810335, 0.1485959950338416, 0.11511480265595263, -0.018742878552301015, -0.29773551313087854, 0.14906568311800072, -0.162522827949241, 0.0720361833495059, -0.18313044819408675, 0.031030064564368694, 0.005333879915388679, -0.2882808719098178, 0.040491075857407015, 0.11951516341004106, 0.03191056883291096, -0.06525570073697999, -0.1295696509487659, 0.029883835677763607, 0.10425422100952882, 0.020061495735194362, 0.12040903240524452, 0.10239263969090055, -0.14959833161978453, -0.1572880744492769, 0.40716005487404033, -0.06442204649528577, -0.28310948956508214, 0.21857544710384866, -0.03711630437778784, -0.1251150118871866, 0.1017932666867387, 0.22003094655053776, 0.09464501297661389, -0.1453693535763259, 0.03440582305132077, -0.023444180267260355, 0.2598115328086458, 0.09737065951248594, 0.050982470974155696, 0.1689518018887421, 0.20948887561117693, 0.010545122299459002, 0.13924830680670447, -0.11438709089941089, -0.06104164996817465, -0.1920575745764426, -0.14452552572166658, -0.1923865423601705, -0.009199445186870697, -0.165891809893842, -0.1485728985238881, 0.3930088174011972, 0.20399954077769436, 0.25588513059492884, 0.12948138159212771, 0.3325973668324402, 0.030214705199362358, 0.14776118570334565, 0.12544778598361386, 0.12763700695720567, 0.03642602270511679, 0.08600945250371629, -0.09831096792709253, 0.05970990649893198, 0.09199548728179698]
|
1,803.09066
|
Effects of counterrotating interaction on driven tunneling dynamics:
coherent destruction of tunneling and Bloch-Siegert shift
|
We investigate the dynamics of a driven two-level system (classical Rabi
model) using the counter-rotating-hybridized rotating wave method (CHRW), which
is a simple method based on a unitary transformation with a parameter $\xi$.
This approach is beyond the traditional rotating-wave approximation (Rabi-RWA)
and more importantly, remains the RWA form with a renormalized tunneling
strength and a modified driving strength. The reformulated rotating wave method
not only possesses the same mathematical simplicity as the Rabi-RWA but also
allows us to explore the effects of counter-rotating (CR) components. We focus
on the properties of off-resonance cases for which the Rabi-RWA method breaks
down. After comparing the results of different RWA schemes and those of the
numerically exact method in a wide range of parameter regime, we show that the
CHRW method gives the accurate driven dynamics which is in good agreement with
the numerical method. Moreover, the other RWA methods appear as various
limiting cases of the CHRW method. The CHRW method reveals the effects of the
CR terms clearly by means of coherent destruction of tunneling and
Bloch-Siegert shift. Our main results are as follows: (i) the dynamics of the
coherent destruction of tunneling is explicitly given and its dependence on
$\Delta$ is clarified, which is quantitatively in good agreement with the exact
results; (ii) the CR modulated Rabi frequency and the Bloch-Siegert shift are
analytically calculated, which is the same as the exact results up to fourth
order; (iii) the validity of parameter regions of different RWA methods are
given and the comparison of dynamics of these methods are shown. Since the CHRW
approach is mathematically simple as well as tractable and physically clear, it
may be extended to some complicated problems where it is difficult to do a
numerical study.
|
cond-mat.mes-hall physics.atom-ph physics.chem-ph quant-ph
|
we investigate the dynamics of a driven twolevel system classical rabi model using the counterrotatinghybridized rotating wave method chrw which is a simple method based on a unitary transformation with a parameter xi this approach is beyond the traditional rotatingwave approximation rabirwa and more importantly remains the rwa form with a renormalized tunneling strength and a modified driving strength the reformulated rotating wave method not only possesses the same mathematical simplicity as the rabirwa but also allows us to explore the effects of counterrotating cr components we focus on the properties of offresonance cases for which the rabirwa method breaks down after comparing the results of different rwa schemes and those of the numerically exact method in a wide range of parameter regime we show that the chrw method gives the accurate driven dynamics which is in good agreement with the numerical method moreover the other rwa methods appear as various limiting cases of the chrw method the chrw method reveals the effects of the cr terms clearly by means of coherent destruction of tunneling and blochsiegert shift our main results are as follows i the dynamics of the coherent destruction of tunneling is explicitly given and its dependence on delta is clarified which is quantitatively in good agreement with the exact results ii the cr modulated rabi frequency and the blochsiegert shift are analytically calculated which is the same as the exact results up to fourth order iii the validity of parameter regions of different rwa methods are given and the comparison of dynamics of these methods are shown since the chrw approach is mathematically simple as well as tractable and physically clear it may be extended to some complicated problems where it is difficult to do a numerical study
|
[['we', 'investigate', 'the', 'dynamics', 'of', 'a', 'driven', 'twolevel', 'system', 'classical', 'rabi', 'model', 'using', 'the', 'counterrotatinghybridized', 'rotating', 'wave', 'method', 'chrw', 'which', 'is', 'a', 'simple', 'method', 'based', 'on', 'a', 'unitary', 'transformation', 'with', 'a', 'parameter', 'xi', 'this', 'approach', 'is', 'beyond', 'the', 'traditional', 'rotatingwave', 'approximation', 'rabirwa', 'and', 'more', 'importantly', 'remains', 'the', 'rwa', 'form', 'with', 'a', 'renormalized', 'tunneling', 'strength', 'and', 'a', 'modified', 'driving', 'strength', 'the', 'reformulated', 'rotating', 'wave', 'method', 'not', 'only', 'possesses', 'the', 'same', 'mathematical', 'simplicity', 'as', 'the', 'rabirwa', 'but', 'also', 'allows', 'us', 'to', 'explore', 'the', 'effects', 'of', 'counterrotating', 'cr', 'components', 'we', 'focus', 'on', 'the', 'properties', 'of', 'offresonance', 'cases', 'for', 'which', 'the', 'rabirwa', 'method', 'breaks', 'down', 'after', 'comparing', 'the', 'results', 'of', 'different', 'rwa', 'schemes', 'and', 'those', 'of', 'the', 'numerically', 'exact', 'method', 'in', 'a', 'wide', 'range', 'of', 'parameter', 'regime', 'we', 'show', 'that', 'the', 'chrw', 'method', 'gives', 'the', 'accurate', 'driven', 'dynamics', 'which', 'is', 'in', 'good', 'agreement', 'with', 'the', 'numerical', 'method', 'moreover', 'the', 'other', 'rwa', 'methods', 'appear', 'as', 'various', 'limiting', 'cases', 'of', 'the', 'chrw', 'method', 'the', 'chrw', 'method', 'reveals', 'the', 'effects', 'of', 'the', 'cr', 'terms', 'clearly', 'by', 'means', 'of', 'coherent', 'destruction', 'of', 'tunneling', 'and', 'blochsiegert', 'shift', 'our', 'main', 'results', 'are', 'as', 'follows', 'i', 'the', 'dynamics', 'of', 'the', 'coherent', 'destruction', 'of', 'tunneling', 'is', 'explicitly', 'given', 'and', 'its', 'dependence', 'on', 'delta', 'is', 'clarified', 'which', 'is', 'quantitatively', 'in', 'good', 'agreement', 'with', 'the', 'exact', 'results', 'ii', 'the', 'cr', 'modulated', 'rabi', 'frequency', 'and', 'the', 'blochsiegert', 'shift', 'are', 'analytically', 'calculated', 'which', 'is', 'the', 'same', 'as', 'the', 'exact', 'results', 'up', 'to', 'fourth', 'order', 'iii', 'the', 'validity', 'of', 'parameter', 'regions', 'of', 'different', 'rwa', 'methods', 'are', 'given', 'and', 'the', 'comparison', 'of', 'dynamics', 'of', 'these', 'methods', 'are', 'shown', 'since', 'the', 'chrw', 'approach', 'is', 'mathematically', 'simple', 'as', 'well', 'as', 'tractable', 'and', 'physically', 'clear', 'it', 'may', 'be', 'extended', 'to', 'some', 'complicated', 'problems', 'where', 'it', 'is', 'difficult', 'to', 'do', 'a', 'numerical', 'study']]
|
[-0.10546994893821679, 0.07933437357785116, -0.08079979344078436, 0.10007257644681196, -0.05215096391962263, -0.14564671900669304, 0.049004849424617816, 0.37323980167636583, -0.23951251095648582, -0.27874498818198157, 0.044404055089047496, -0.2231383683517724, -0.16975001288288882, 0.24968565637526777, -0.003839545984399216, 0.032539589937318696, 0.04363466255238344, 0.02597202616502884, -0.09655257976967199, -0.20812556247772843, 0.29862373669487263, 0.04524056180380285, 0.2889027070551147, 0.046140813416448136, 0.07637977641043735, -0.026132844615896263, 0.02236662135973316, 0.034934702580721934, -0.11216520744243914, 0.06977052111459639, 0.19708075843317885, 0.06758084695400862, 0.2672492549722565, -0.40120196859512863, -0.21307642590254544, 0.052252645565774934, 0.16148935272378429, 0.17935220796960116, 0.0010166914886212907, -0.2925626881131581, 0.043860235653319875, -0.16825796426595027, -0.1582195584915161, -0.11667047519525835, -0.009227722250567429, 0.047987963774659, -0.2784529020435755, 0.11252725202812772, 0.08042513647092635, 0.0007912471123714129, -0.05384508941286436, -0.06656323025797911, 0.004580690385372346, 0.10632192558801637, 0.0538096347332361, 0.022204327642323513, 0.10793875509808804, -0.09627593247589238, -0.0725809734975036, 0.4097402203539065, -0.0843435048647546, -0.20468644701478328, 0.19589266436383257, -0.1467308203914556, -0.08039763696202687, 0.12826853974176378, 0.08063677580995035, 0.14752780097408286, -0.12847363795755945, 0.08754948850255459, -0.030450103148428626, 0.15052651760312888, 0.04484525308783712, 0.027977246909697363, 0.1473058586659167, 0.15873312518514435, 0.027149090127279812, 0.11984428231231066, -0.07926715246465957, -0.14608972034866696, -0.2896681080893453, -0.09003760252897587, -0.1691344484618608, 0.01133211575130378, -0.07436193372845522, -0.16440989826595137, 0.41459256373024705, 0.16177471787447978, 0.1740601249312147, 0.026369236198109415, 0.3309006438670873, 0.18021561976417835, 0.02499822976453037, 0.0432422244688496, 0.2692588864814627, 0.14881620135535648, 0.07350476553888413, -0.27761716023408645, 0.053423144709688196, 0.03972666298344346]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.