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,802.0046 | OSSOS: X. How to use a Survey Simulator: Statistical Testing of
Dynamical Models Against the Real Kuiper Belt | All surveys include observational biases, which makes it impossible to
directly compare properties of discovered trans-Neptunian Objects (TNOs) with
dynamical models. However, by carefully keeping track of survey pointings on
the sky, detection limits, tracking fractions, and rate cuts, the biases from a
survey can be modelled in Survey Simulator software. A Survey Simulator takes
an intrinsic orbital model (from, for example, the output of a dynamical Kuiper
belt emplacement simulation) and applies the survey biases, so that the biased
simulated objects can be directly compared with real discoveries. This
methodology has been used with great success in the Outer Solar System Origins
Survey (OSSOS) and its predecessor surveys. In this chapter, we give four
examples of ways to use the OSSOS Survey Simulator to gain knowledge about the
true structure of the Kuiper Belt. We demonstrate how to statistically compare
different dynamical model outputs with real TNO discoveries, how to quantify
detection biases within a TNO population, how to measure intrinsic population
sizes, and how to use upper limits from non-detections. We hope this will
provide a framework for dynamical modellers to statistically test the validity
of their models.
| astro-ph.EP | all surveys include observational biases which makes it impossible to directly compare properties of discovered transneptunian objects tnos with dynamical models however by carefully keeping track of survey pointings on the sky detection limits tracking fractions and rate cuts the biases from a survey can be modelled in survey simulator software a survey simulator takes an intrinsic orbital model from for example the output of a dynamical kuiper belt emplacement simulation and applies the survey biases so that the biased simulated objects can be directly compared with real discoveries this methodology has been used with great success in the outer solar system origins survey ossos and its predecessor surveys in this chapter we give four examples of ways to use the ossos survey simulator to gain knowledge about the true structure of the kuiper belt we demonstrate how to statistically compare different dynamical model outputs with real tno discoveries how to quantify detection biases within a tno population how to measure intrinsic population sizes and how to use upper limits from nondetections we hope this will provide a framework for dynamical modellers to statistically test the validity of their models | [['all', 'surveys', 'include', 'observational', 'biases', 'which', 'makes', 'it', 'impossible', 'to', 'directly', 'compare', 'properties', 'of', 'discovered', 'transneptunian', 'objects', 'tnos', 'with', 'dynamical', 'models', 'however', 'by', 'carefully', 'keeping', 'track', 'of', 'survey', 'pointings', 'on', 'the', 'sky', 'detection', 'limits', 'tracking', 'fractions', 'and', 'rate', 'cuts', 'the', 'biases', 'from', 'a', 'survey', 'can', 'be', 'modelled', 'in', 'survey', 'simulator', 'software', 'a', 'survey', 'simulator', 'takes', 'an', 'intrinsic', 'orbital', 'model', 'from', 'for', 'example', 'the', 'output', 'of', 'a', 'dynamical', 'kuiper', 'belt', 'emplacement', 'simulation', 'and', 'applies', 'the', 'survey', 'biases', 'so', 'that', 'the', 'biased', 'simulated', 'objects', 'can', 'be', 'directly', 'compared', 'with', 'real', 'discoveries', 'this', 'methodology', 'has', 'been', 'used', 'with', 'great', 'success', 'in', 'the', 'outer', 'solar', 'system', 'origins', 'survey', 'ossos', 'and', 'its', 'predecessor', 'surveys', 'in', 'this', 'chapter', 'we', 'give', 'four', 'examples', 'of', 'ways', 'to', 'use', 'the', 'ossos', 'survey', 'simulator', 'to', 'gain', 'knowledge', 'about', 'the', 'true', 'structure', 'of', 'the', 'kuiper', 'belt', 'we', 'demonstrate', 'how', 'to', 'statistically', 'compare', 'different', 'dynamical', 'model', 'outputs', 'with', 'real', 'tno', 'discoveries', 'how', 'to', 'quantify', 'detection', 'biases', 'within', 'a', 'tno', 'population', 'how', 'to', 'measure', 'intrinsic', 'population', 'sizes', 'and', 'how', 'to', 'use', 'upper', 'limits', 'from', 'nondetections', 'we', 'hope', 'this', 'will', 'provide', 'a', 'framework', 'for', 'dynamical', 'modellers', 'to', 'statistically', 'test', 'the', 'validity', 'of', 'their', 'models']] | [-0.039048890390212795, 0.048526742096797346, -0.1279518617390606, 0.10240940494818221, -0.13627651799225102, -0.05392918200722258, 0.06937845876979593, 0.372359868740712, -0.2159316489963155, -0.40060434582594195, 0.09965524275934226, -0.2793542497962909, -0.13952291759931923, 0.2381569045816401, -0.1095082861604169, 0.027837808172549366, 0.11593732425550882, -0.08816017541823001, 0.002939143526313465, -0.3121975260872492, 0.2577576701774409, 0.09400514256160118, 0.18383084387475576, -0.054137737193684046, 0.0906992794645607, -0.05485022386756579, -0.07684070919150192, 0.0020639409041522364, -0.1781592078888743, 0.10161418080035793, 0.26010528327579346, 0.20294901516509095, 0.23815507265420532, -0.3549705367633387, -0.18804066701988248, 0.09404827465937399, 0.15497209734871592, 0.11601675448534814, -0.019644007977024702, -0.33459856046461744, 0.06452216408460548, -0.2126843952279734, -0.1747049453398703, -0.04251726571176397, 0.03397476897623978, 0.04791224942554867, -0.18225095776847172, 0.03968620265736, 0.02377038068125809, 0.09951967510293655, -0.10697963985332631, -0.12507681611030805, -0.022931338057510162, 0.1720983249919587, 0.003289460896906492, -0.013853163963281795, 0.16385966614256367, -0.12739527662113112, -0.13019352459201688, 0.391838374439823, -0.05384181462056739, -0.13489605179669237, 0.22254615909738565, -0.1865640302960712, -0.15677854955919382, 0.10568013772748312, 0.24389557449735308, 0.07143989750674289, -0.20413572932133991, 0.04265579914943756, -0.01981515207965123, 0.2224625120258057, 0.0023782452537776215, 0.047946124244481324, 0.3168016329946879, 0.15568599662939578, 0.044092780283015026, 0.15344246653472318, -0.18856930617399292, -0.08481691626304956, -0.23276429280920544, -0.07949774422633805, -0.14052391677764, 0.05656142203308838, -0.037802910754199774, -0.10363003935811943, 0.36081971815346103, 0.28146055519678875, 0.200083373100987, 0.08252186384480936, 0.35308347970835474, 0.0063748267650800316, 0.10614058354342552, 0.025560781996893257, 0.2830029076553489, 0.10806097456278574, 0.06703889504271118, -0.16824425780581997, 0.09621180028434058, -0.04092056750883594] |
1,802.00461 | Collective power: Minimal model for thermodynamics of nonequilibrium
phase transitions | We propose a thermodynamically consistent minimal model to study
synchronization which is made of driven and interacting three-state units. This
system exhibits at the mean-field level two bifurcations separating three
dynamical phases: a single stable fixed point, a stable limit cycle indicative
of synchronization, and multiple stable fixed points. These complex emergent
dynamical behaviors are understood at the level of the underlying linear
Markovian dynamics in terms of metastability, i.e. the appearance of gaps in
the upper real part of the spectrum of the Markov generator. Stochastic
thermodynamics is used to study the dissipated work across dynamical phases as
well as across scales. This dissipated work is found to be reduced by the
attractive interactions between the units and to nontrivially depend on the
system size. When operating as a work-to-work converter, we find that the
maximum power output is achieved far-from-equilibrium in the synchronization
regime and that the efficiency at maximum power is surprisingly close to the
linear regime prediction. Our work shows the way towards building a
thermodynamics of nonequilibrium phase transitions in conjunction to
bifurcation theory.
| cond-mat.stat-mech | we propose a thermodynamically consistent minimal model to study synchronization which is made of driven and interacting threestate units this system exhibits at the meanfield level two bifurcations separating three dynamical phases a single stable fixed point a stable limit cycle indicative of synchronization and multiple stable fixed points these complex emergent dynamical behaviors are understood at the level of the underlying linear markovian dynamics in terms of metastability ie the appearance of gaps in the upper real part of the spectrum of the markov generator stochastic thermodynamics is used to study the dissipated work across dynamical phases as well as across scales this dissipated work is found to be reduced by the attractive interactions between the units and to nontrivially depend on the system size when operating as a worktowork converter we find that the maximum power output is achieved farfromequilibrium in the synchronization regime and that the efficiency at maximum power is surprisingly close to the linear regime prediction our work shows the way towards building a thermodynamics of nonequilibrium phase transitions in conjunction to bifurcation theory | [['we', 'propose', 'a', 'thermodynamically', 'consistent', 'minimal', 'model', 'to', 'study', 'synchronization', 'which', 'is', 'made', 'of', 'driven', 'and', 'interacting', 'threestate', 'units', 'this', 'system', 'exhibits', 'at', 'the', 'meanfield', 'level', 'two', 'bifurcations', 'separating', 'three', 'dynamical', 'phases', 'a', 'single', 'stable', 'fixed', 'point', 'a', 'stable', 'limit', 'cycle', 'indicative', 'of', 'synchronization', 'and', 'multiple', 'stable', 'fixed', 'points', 'these', 'complex', 'emergent', 'dynamical', 'behaviors', 'are', 'understood', 'at', 'the', 'level', 'of', 'the', 'underlying', 'linear', 'markovian', 'dynamics', 'in', 'terms', 'of', 'metastability', 'ie', 'the', 'appearance', 'of', 'gaps', 'in', 'the', 'upper', 'real', 'part', 'of', 'the', 'spectrum', 'of', 'the', 'markov', 'generator', 'stochastic', 'thermodynamics', 'is', 'used', 'to', 'study', 'the', 'dissipated', 'work', 'across', 'dynamical', 'phases', 'as', 'well', 'as', 'across', 'scales', 'this', 'dissipated', 'work', 'is', 'found', 'to', 'be', 'reduced', 'by', 'the', 'attractive', 'interactions', 'between', 'the', 'units', 'and', 'to', 'nontrivially', 'depend', 'on', 'the', 'system', 'size', 'when', 'operating', 'as', 'a', 'worktowork', 'converter', 'we', 'find', 'that', 'the', 'maximum', 'power', 'output', 'is', 'achieved', 'farfromequilibrium', 'in', 'the', 'synchronization', 'regime', 'and', 'that', 'the', 'efficiency', 'at', 'maximum', 'power', 'is', 'surprisingly', 'close', 'to', 'the', 'linear', 'regime', 'prediction', 'our', 'work', 'shows', 'the', 'way', 'towards', 'building', 'a', 'thermodynamics', 'of', 'nonequilibrium', 'phase', 'transitions', 'in', 'conjunction', 'to', 'bifurcation', 'theory']] | [-0.1854504510193189, 0.164380756430536, -0.07889764630527431, 0.036763004993505426, 0.0048498999244174475, -0.14035231683483898, 0.09018244210034922, 0.3059056052423015, -0.2987646202494354, -0.28597460232425337, 0.08079188856343067, -0.26362558590591617, -0.15349905650188636, 0.1683875500707752, -0.020180588917497903, 0.03630818987483752, 0.017008629955309728, 0.04411937380417682, -0.04701031537403941, -0.17414100619563677, 0.2920264565560176, 0.07344195655385792, 0.2948926484951094, 0.00757104488006434, 0.10127805595093682, -0.048896757266666306, 0.06426102183134862, 0.022962358814024225, -0.11465682002025404, 0.06362509832577, 0.2617491793105972, 0.029678454521901036, 0.2369996793073857, -0.4075011423315499, -0.23424838547069352, 0.1093864734076463, 0.144526394076129, 0.09961046092147163, 0.00418364310080404, -0.23275215386454662, 0.06607578586079388, -0.15322142968464164, -0.138652788430931, -0.059521062280098236, -0.003906608261324091, 0.01602142362194604, -0.2496905104470486, 0.08200969078770563, 0.08255631540717906, 0.07418446635223233, -0.03699599765371219, -0.036771655284315766, -0.05566756064124281, 0.13798339140172866, 0.01697848623360939, -0.004567363490311523, 0.15576527879817942, -0.11453325510175909, -0.10418624350509746, 0.357942594980103, -0.07474615290733679, -0.15344352702162745, 0.2294321726518553, -0.14696447840028745, -0.15240857428376817, 0.13342395127235845, 0.165547302541682, 0.09699496809216268, -0.14214867303662027, 0.0588936506140998, 0.016644576418749446, 0.19574475414122913, 0.03183592454915315, 0.028525371916134263, 0.2557820241648558, 0.2276963876812672, 0.05965668675372658, 0.1785181845823178, -0.04228049804122895, -0.20968331509287985, -0.2947710637662003, -0.08894497138063044, -0.16607467725862587, 0.04315275326891485, -0.08159218178301082, -0.17433890511994588, 0.4137091151797655, 0.14080737155014078, 0.213628476413262, 0.05796063783664423, 0.27659181007782424, 0.17114247343835925, 0.012096193749795788, 0.07568805338814855, 0.2605258965703487, 0.10673279480035702, 0.09812174184383127, -0.26243240405758583, 0.05430899123926569, 0.05072474608187402] |
1,802.00462 | In silico evolution of signaling networks using rule-based models:
bistable response dynamics | One of the ultimate goals in biology is to understand the design principles
of biological systems. Such principles, if they exist, can help us better
understand complex, natural biological systems and guide the engineering of de
novo ones. Towards deciphering design principles, in silico evolution of
biological systems with proper abstraction is a promising approach. Here, we
demonstrate the application of in silico evolution combined with rule-based
modelling for exploring design principles of cellular signaling networks. This
application is based on a computational platform, called BioJazz, which allows
in silico evolution of signaling networks with unbounded complexity. We provide
a detailed introduction to BioJazz architecture and implementation and describe
how it can be used to evolve and/or design signaling networks with defined
dynamics. For the latter, we evolve signaling networks with switch-like
response dynamics and demonstrate how BioJazz can result in new biological
insights on network structures that can endow bistable response dynamics. This
example also demonstrated both the power of BioJazz in evolving and designing
signaling networks and its limitations at the current stage of development.
| q-bio.MN q-bio.QM q-bio.SC | one of the ultimate goals in biology is to understand the design principles of biological systems such principles if they exist can help us better understand complex natural biological systems and guide the engineering of de novo ones towards deciphering design principles in silico evolution of biological systems with proper abstraction is a promising approach here we demonstrate the application of in silico evolution combined with rulebased modelling for exploring design principles of cellular signaling networks this application is based on a computational platform called biojazz which allows in silico evolution of signaling networks with unbounded complexity we provide a detailed introduction to biojazz architecture and implementation and describe how it can be used to evolve andor design signaling networks with defined dynamics for the latter we evolve signaling networks with switchlike response dynamics and demonstrate how biojazz can result in new biological insights on network structures that can endow bistable response dynamics this example also demonstrated both the power of biojazz in evolving and designing signaling networks and its limitations at the current stage of development | [['one', 'of', 'the', 'ultimate', 'goals', 'in', 'biology', 'is', 'to', 'understand', 'the', 'design', 'principles', 'of', 'biological', 'systems', 'such', 'principles', 'if', 'they', 'exist', 'can', 'help', 'us', 'better', 'understand', 'complex', 'natural', 'biological', 'systems', 'and', 'guide', 'the', 'engineering', 'of', 'de', 'novo', 'ones', 'towards', 'deciphering', 'design', 'principles', 'in', 'silico', 'evolution', 'of', 'biological', 'systems', 'with', 'proper', 'abstraction', 'is', 'a', 'promising', 'approach', 'here', 'we', 'demonstrate', 'the', 'application', 'of', 'in', 'silico', 'evolution', 'combined', 'with', 'rulebased', 'modelling', 'for', 'exploring', 'design', 'principles', 'of', 'cellular', 'signaling', 'networks', 'this', 'application', 'is', 'based', 'on', 'a', 'computational', 'platform', 'called', 'biojazz', 'which', 'allows', 'in', 'silico', 'evolution', 'of', 'signaling', 'networks', 'with', 'unbounded', 'complexity', 'we', 'provide', 'a', 'detailed', 'introduction', 'to', 'biojazz', 'architecture', 'and', 'implementation', 'and', 'describe', 'how', 'it', 'can', 'be', 'used', 'to', 'evolve', 'andor', 'design', 'signaling', 'networks', 'with', 'defined', 'dynamics', 'for', 'the', 'latter', 'we', 'evolve', 'signaling', 'networks', 'with', 'switchlike', 'response', 'dynamics', 'and', 'demonstrate', 'how', 'biojazz', 'can', 'result', 'in', 'new', 'biological', 'insights', 'on', 'network', 'structures', 'that', 'can', 'endow', 'bistable', 'response', 'dynamics', 'this', 'example', 'also', 'demonstrated', 'both', 'the', 'power', 'of', 'biojazz', 'in', 'evolving', 'and', 'designing', 'signaling', 'networks', 'and', 'its', 'limitations', 'at', 'the', 'current', 'stage', 'of', 'development']] | [-0.10412859635974812, 0.06822126735748965, -0.08005438003120786, 0.05201897701665517, -0.10461066055537785, -0.15192555554084858, 0.018999995158637983, 0.3864984990513257, -0.28736929966420943, -0.2961220041885551, 0.07035357850119682, -0.19413029273196142, -0.31424348685616826, 0.19495629697333033, -0.05979529632703544, 0.04030128242283544, 0.07130399886729186, -0.02787511272071124, 0.026060317201660892, -0.19194719471079483, 0.283187045721011, 0.100904360763455, 0.32741481586527815, 0.03525016681780502, 0.09604830062016845, -0.035940969646987266, 0.00868045212700963, -0.0024988079551438998, -0.12209368483341822, 0.17517861101176527, 0.3337974755861665, 0.21680875071508568, 0.3121886019210863, -0.5104088018106371, -0.2807461997904515, 0.08224076030665409, 0.15183068250469064, 0.1287416631722886, -0.05827288143731401, -0.2364434796822189, 0.06429565917847857, -0.1382109430371284, -0.14626073583665877, -0.1459796231024304, -0.032548335186168974, 0.053700422386028464, -0.23947095861500603, -0.012411027582589863, 0.035198167608366845, 0.06479630002615142, -0.0661935108024193, -0.08274389094657313, -0.006620282849223264, 0.1748689013430691, -0.05844135087122877, -0.007030518507153469, 0.17647148109775163, -0.11477620160275555, -0.18046763087333428, 0.381162314768486, -0.0023630774806195735, -0.20967780016388976, 0.249008382567978, -0.059571165871664375, -0.1911238141313174, 0.0794610073401903, 0.2313630046108527, 0.0648031657177555, -0.1767290036041437, 0.016561648749883185, 0.079988827144906, 0.1702182736552957, 0.025651961058578164, 0.06613350990570366, 0.19852151265262633, 0.31311729500112306, 0.01945219172617305, 0.11958599005139164, -0.0075977673033241835, -0.15279915761781362, -0.21996045262042413, -0.17397363901422438, -0.1241293971408369, 0.07667086363538553, -0.05224469389012057, -0.12696386424306316, 0.38496208488467637, 0.17557870338428871, 0.13110585576502112, 0.07300539764688788, 0.27624035096269545, 0.03899538663339586, 0.06726546374663953, 0.014043088736654507, 0.18750920345070166, 0.09753086667844636, 0.1588573380147165, -0.2363301380692013, 0.11528424438060193, -0.021756104772415876] |
1,802.00463 | The Helping Hand: An Assistive Manipulation Framework Using Augmented
Reality and a Tongue-Drive Interfaces | A human-in-the-loop system is proposed to enable collaborative manipulation
tasks for person with physical disabilities. Studies show that the cognitive
burden of subject reduces with increased autonomy of assistive system. Our
framework obtains high-level intent from the user to specify manipulation
tasks. The system processes sensor input to interpret the user's environment.
Augmented reality glasses provide ego-centric visual feedback of the
interpretation and summarize robot affordances on a menu. A tongue drive system
serves as the input modality for triggering a robotic arm to execute the tasks.
Assistance experiments compare the system to Cartesian control and to
state-of-the-art approaches. Our system achieves competitive results with
faster completion time by simplifying manipulation tasks.
| cs.RO | a humanintheloop system is proposed to enable collaborative manipulation tasks for person with physical disabilities studies show that the cognitive burden of subject reduces with increased autonomy of assistive system our framework obtains highlevel intent from the user to specify manipulation tasks the system processes sensor input to interpret the users environment augmented reality glasses provide egocentric visual feedback of the interpretation and summarize robot affordances on a menu a tongue drive system serves as the input modality for triggering a robotic arm to execute the tasks assistance experiments compare the system to cartesian control and to stateoftheart approaches our system achieves competitive results with faster completion time by simplifying manipulation tasks | [['a', 'humanintheloop', 'system', 'is', 'proposed', 'to', 'enable', 'collaborative', 'manipulation', 'tasks', 'for', 'person', 'with', 'physical', 'disabilities', 'studies', 'show', 'that', 'the', 'cognitive', 'burden', 'of', 'subject', 'reduces', 'with', 'increased', 'autonomy', 'of', 'assistive', 'system', 'our', 'framework', 'obtains', 'highlevel', 'intent', 'from', 'the', 'user', 'to', 'specify', 'manipulation', 'tasks', 'the', 'system', 'processes', 'sensor', 'input', 'to', 'interpret', 'the', 'users', 'environment', 'augmented', 'reality', 'glasses', 'provide', 'egocentric', 'visual', 'feedback', 'of', 'the', 'interpretation', 'and', 'summarize', 'robot', 'affordances', 'on', 'a', 'menu', 'a', 'tongue', 'drive', 'system', 'serves', 'as', 'the', 'input', 'modality', 'for', 'triggering', 'a', 'robotic', 'arm', 'to', 'execute', 'the', 'tasks', 'assistance', 'experiments', 'compare', 'the', 'system', 'to', 'cartesian', 'control', 'and', 'to', 'stateoftheart', 'approaches', 'our', 'system', 'achieves', 'competitive', 'results', 'with', 'faster', 'completion', 'time', 'by', 'simplifying', 'manipulation', 'tasks']] | [-0.12176207145343401, -0.02734759488625319, -0.05804109441981252, -0.01854502538169202, -0.17776029245162914, -0.24646276186519703, 0.049215244578330646, 0.43810689352851895, -0.22847762864382407, -0.3849338111956188, 0.03432840237344083, -0.25393202115914654, -0.18401960408248538, 0.2353161797842144, -0.17550892252308717, 0.0829496138529586, 0.18160541226721502, 0.07154552517152167, 0.000380643192329444, -0.24651357921356976, 0.237190917616577, 0.03839816986042673, 0.28672670022517976, 0.002665902861086319, 0.16864875237973007, 0.037049262231448665, 0.010169542338449642, -0.07886240291138945, -0.01809315823454329, 0.14066751741536013, 0.35473323575986015, 0.2531677966263877, 0.34159669787290375, -0.4503462482909007, -0.22541367075713684, -0.00048681490339471826, 0.11918096745752596, 0.06798245427697631, -0.01664166807001623, -0.4192816903980981, 0.05744674220165637, -0.2121668050947067, -0.05898246296731356, -0.12430043960817524, -0.006895940129262661, -0.011672002359302627, -0.330271957783095, -0.038179675368675295, 0.03747653059378665, 0.10920864597470167, -0.10097144685590008, -0.03920448691600801, 0.03933022210756982, 0.2755606669234112, 0.004446697118899985, 0.06052866962272674, 0.29483426530246754, -0.21761024350832617, -0.22157634804690524, 0.4106612254399806, 0.02669091665926057, -0.19715338656013565, 0.282671278016226, -0.038388652876684706, -0.1020145375971749, 0.0841337306898952, 0.240732052367613, 0.08322226548417737, -0.14542284269113484, -0.01913162274390093, -0.0022744126888158333, 0.2285086261357979, -0.005163735098903999, 0.012634459866343864, 0.17536518875359824, 0.28055935640648905, 0.09687360435990351, 0.14307535054519707, -0.0027524262945267503, -0.08760804675486204, -0.19747686823497393, -0.14434174935533, -0.13322168546229868, -0.047509688921439065, -0.06327948519460083, -0.05905367998223353, 0.36133613162590855, 0.28870214832048596, 0.15656598106891448, 0.09959258288810295, 0.41597848585141556, 0.027499700107520248, 0.09774701296451635, 0.03363693732119698, 0.1399787227201159, -0.01610992652838052, 0.22245848785730363, -0.24949106746394786, 0.11123470316150426, 0.031048193939828446] |
1,802.00464 | Fast and Slow Precession of Gaseous Debris Disks Around Planet-Accreting
White Dwarfs | Spectroscopic observations of some metal-rich white dwarfs (WDs), believed to
be polluted by planetary material, reveal the presence of compact gaseous
metallic disks orbiting them. The observed variability of asymmetric,
double-peaked emission line profiles in about half of such systems could be
interpreted as the signature of precession of an eccentric gaseous debris disk.
The variability timescales --- from decades down to $1.4$ yr (recently inferred
for the debris disk around HE 1349--2305) --- are in rough agreement with the
rate of general relativistic (GR) precession in the test particle limit.
However, it has not been demonstrated that this mechanism can drive such a
fast, coherent precession of a radially extended (out to $1 R_\odot$) gaseous
disk mediated by internal stresses (pressure). Here we use the linear theory of
eccentricity evolution in hydrodynamic disks to determine several key
properties of eccentric modes in gaseous debris disks around WDs. We find a
critical dependence of both the precession period and radial eccentricity
distribution of the modes on the inner disk radius, $r_\mathrm{in}$. For small
inner radii, $r_\mathrm{in} \lesssim (0.2 - 0.4) R_\odot$, the modes are
GR-driven, with periods of $\approx 1 - 10$ yr. For $r_\mathrm{in} \gtrsim (0.2
- 0.4) R_\odot$, the modes are pressure-dominated, with periods of $\approx 3 -
20$ yr. Correspondence between the variability periods and inferred inner radii
of the observed disks is in general agreement with this trend. In particular,
the short period of HE 1349--2305 is consistent with its small $r_\mathrm{in}$.
Circum-WD debris disks may thus serve as natural laboratories for studying the
evolution of eccentric gaseous disks.
| astro-ph.EP astro-ph.SR | spectroscopic observations of some metalrich white dwarfs wds believed to be polluted by planetary material reveal the presence of compact gaseous metallic disks orbiting them the observed variability of asymmetric doublepeaked emission line profiles in about half of such systems could be interpreted as the signature of precession of an eccentric gaseous debris disk the variability timescales from decades down to 14 yr recently inferred for the debris disk around he 13492305 are in rough agreement with the rate of general relativistic gr precession in the test particle limit however it has not been demonstrated that this mechanism can drive such a fast coherent precession of a radially extended out to 1 r_odot gaseous disk mediated by internal stresses pressure here we use the linear theory of eccentricity evolution in hydrodynamic disks to determine several key properties of eccentric modes in gaseous debris disks around wds we find a critical dependence of both the precession period and radial eccentricity distribution of the modes on the inner disk radius r_mathrmin for small inner radii r_mathrmin lesssim 02 04 r_odot the modes are grdriven with periods of approx 1 10 yr for r_mathrmin gtrsim 02 04 r_odot the modes are pressuredominated with periods of approx 3 20 yr correspondence between the variability periods and inferred inner radii of the observed disks is in general agreement with this trend in particular the short period of he 13492305 is consistent with its small r_mathrmin circumwd debris disks may thus serve as natural laboratories for studying the evolution of eccentric gaseous disks | [['spectroscopic', 'observations', 'of', 'some', 'metalrich', 'white', 'dwarfs', 'wds', 'believed', 'to', 'be', 'polluted', 'by', 'planetary', 'material', 'reveal', 'the', 'presence', 'of', 'compact', 'gaseous', 'metallic', 'disks', 'orbiting', 'them', 'the', 'observed', 'variability', 'of', 'asymmetric', 'doublepeaked', 'emission', 'line', 'profiles', 'in', 'about', 'half', 'of', 'such', 'systems', 'could', 'be', 'interpreted', 'as', 'the', 'signature', 'of', 'precession', 'of', 'an', 'eccentric', 'gaseous', 'debris', 'disk', 'the', 'variability', 'timescales', 'from', 'decades', 'down', 'to', '14', 'yr', 'recently', 'inferred', 'for', 'the', 'debris', 'disk', 'around', 'he', '13492305', 'are', 'in', 'rough', 'agreement', 'with', 'the', 'rate', 'of', 'general', 'relativistic', 'gr', 'precession', 'in', 'the', 'test', 'particle', 'limit', 'however', 'it', 'has', 'not', 'been', 'demonstrated', 'that', 'this', 'mechanism', 'can', 'drive', 'such', 'a', 'fast', 'coherent', 'precession', 'of', 'a', 'radially', 'extended', 'out', 'to', '1', 'r_odot', 'gaseous', 'disk', 'mediated', 'by', 'internal', 'stresses', 'pressure', 'here', 'we', 'use', 'the', 'linear', 'theory', 'of', 'eccentricity', 'evolution', 'in', 'hydrodynamic', 'disks', 'to', 'determine', 'several', 'key', 'properties', 'of', 'eccentric', 'modes', 'in', 'gaseous', 'debris', 'disks', 'around', 'wds', 'we', 'find', 'a', 'critical', 'dependence', 'of', 'both', 'the', 'precession', 'period', 'and', 'radial', 'eccentricity', 'distribution', 'of', 'the', 'modes', 'on', 'the', 'inner', 'disk', 'radius', 'r_mathrmin', 'for', 'small', 'inner', 'radii', 'r_mathrmin', 'lesssim', '02', '04', 'r_odot', 'the', 'modes', 'are', 'grdriven', 'with', 'periods', 'of', 'approx', '1', '10', 'yr', 'for', 'r_mathrmin', 'gtrsim', '02', '04', 'r_odot', 'the', 'modes', 'are', 'pressuredominated', 'with', 'periods', 'of', 'approx', '3', '20', 'yr', 'correspondence', 'between', 'the', 'variability', 'periods', 'and', 'inferred', 'inner', 'radii', 'of', 'the', 'observed', 'disks', 'is', 'in', 'general', 'agreement', 'with', 'this', 'trend', 'in', 'particular', 'the', 'short', 'period', 'of', 'he', '13492305', 'is', 'consistent', 'with', 'its', 'small', 'r_mathrmin', 'circumwd', 'debris', 'disks', 'may', 'thus', 'serve', 'as', 'natural', 'laboratories', 'for', 'studying', 'the', 'evolution', 'of', 'eccentric', 'gaseous', 'disks']] | [-0.1324297567372959, 0.18037255388169832, -0.05749518316485645, 0.07861110536454648, -0.07578951935101227, -0.07203189428603532, -0.009678048412680771, 0.3752264541774696, -0.1951366802257504, -0.33857586390393624, 0.06744882529281883, -0.2756789427559923, -0.018875710872531523, 0.23143028156585335, -0.06363935229532859, 0.0061491789503134876, 0.0779860047071113, -0.0799272907206186, -0.06536708540721413, -0.20343946204392363, 0.2677058344834722, 0.07087241232888225, 0.03819247548030141, -0.03830434884510788, 0.00642991757120791, -0.10444978949221252, -0.005203740813029821, -0.06742987912696075, -0.2060690699274453, 0.004558803393122028, 0.2406351048426301, 0.0586332312903787, 0.20864346049470353, -0.407704318512012, -0.209568916184499, 0.014003388761821221, 0.1947429610600047, 0.009225235168146445, -0.0457858930529077, -0.22817882870634396, 0.09245320144200735, -0.22964067247732745, -0.2113022019862946, 0.04592643330129338, 0.16139919373078965, 0.0008273403758329212, -0.2383884099047339, 0.15200545467874582, 0.11110303739368843, 0.12827858333430234, -0.13551084395434124, -0.10479911165311932, -0.07595628062354437, 0.04844005027895465, 0.09080555580200299, 0.064754128534639, 0.19935924680903555, -0.04906026003882289, -0.02041598964144713, 0.38368264672497066, -0.12243372754002099, -0.03352902747699808, 0.2364920243045644, -0.2513462667435627, -0.08955192424119542, 0.20007236330934308, 0.16682335323854988, 0.1508186268784544, -0.10969684081478501, -0.01688897937454064, -0.030073081952629283, 0.22118588810896173, 0.11392439937072935, 0.0635744652527672, 0.41845783575931017, 0.12585072186775506, 0.0015306468550846273, 0.04634007896826255, -0.22474027570238903, -0.08044276316490426, -0.19279054769990492, -0.09921278596499607, -0.10552218116125932, 0.078825424723019, -0.13194777076075528, -0.10726579076007885, 0.31038671278157365, 0.07639123794449237, 0.22464402761383384, 0.02098086137671535, 0.2673529827949025, 0.07883416505384387, 0.09852422676471463, 0.15311398359344286, 0.34368185946482743, 0.20495352486842403, 0.08754411672661994, -0.23617711862065263, 0.07948853847223754, -0.04356848048594068] |
1,802.00465 | Resolving the Disc-Halo Degeneracy I: A Look at NGC 628 | The decomposition of the rotation curve of galaxies into contribution from
the disc and dark halo remains uncertain and depends on the adopted mass to
light ratio (M/L) of the disc. Given the vertical velocity dispersion of stars
and disc scale height, the disc surface mass density and hence the M/L can be
estimated. We address a conceptual problem with previous measurements of the
scale height and dispersion. When using this method, the dispersion and scale
height must refer to the same population of stars. The scale height is obtained
from near-IR studies of edge-on galaxies and is weighted towards older
kinematically hotter stars, whereas the dispersion obtained from integrated
light in the optical bands includes stars of all ages. We aim to extract the
dispersion for the hotter stars, so that it can then be used with the correct
scale height to obtain the disc surface mass density. We use a sample of
planetary nebulae (PNe) as dynamical tracers in the face-on galaxy NGC 628. We
extract two different dispersions from its velocity histogram -- representing
the older and younger PNe. We also present complementary stellar absorption
spectra in the inner regions of this galaxy and use a direct pixel fitting
technique to extract the two components. Our analysis concludes that previous
studies, which do not take account of the young disc, underestimate the disc
surface mass density by a factor of ~ 2. This is sufficient to make a maximal
disc for NGC 628 appear like a submaximal disc.
| astro-ph.GA | the decomposition of the rotation curve of galaxies into contribution from the disc and dark halo remains uncertain and depends on the adopted mass to light ratio ml of the disc given the vertical velocity dispersion of stars and disc scale height the disc surface mass density and hence the ml can be estimated we address a conceptual problem with previous measurements of the scale height and dispersion when using this method the dispersion and scale height must refer to the same population of stars the scale height is obtained from nearir studies of edgeon galaxies and is weighted towards older kinematically hotter stars whereas the dispersion obtained from integrated light in the optical bands includes stars of all ages we aim to extract the dispersion for the hotter stars so that it can then be used with the correct scale height to obtain the disc surface mass density we use a sample of planetary nebulae pne as dynamical tracers in the faceon galaxy ngc 628 we extract two different dispersions from its velocity histogram representing the older and younger pne we also present complementary stellar absorption spectra in the inner regions of this galaxy and use a direct pixel fitting technique to extract the two components our analysis concludes that previous studies which do not take account of the young disc underestimate the disc surface mass density by a factor of 2 this is sufficient to make a maximal disc for ngc 628 appear like a submaximal disc | [['the', 'decomposition', 'of', 'the', 'rotation', 'curve', 'of', 'galaxies', 'into', 'contribution', 'from', 'the', 'disc', 'and', 'dark', 'halo', 'remains', 'uncertain', 'and', 'depends', 'on', 'the', 'adopted', 'mass', 'to', 'light', 'ratio', 'ml', 'of', 'the', 'disc', 'given', 'the', 'vertical', 'velocity', 'dispersion', 'of', 'stars', 'and', 'disc', 'scale', 'height', 'the', 'disc', 'surface', 'mass', 'density', 'and', 'hence', 'the', 'ml', 'can', 'be', 'estimated', 'we', 'address', 'a', 'conceptual', 'problem', 'with', 'previous', 'measurements', 'of', 'the', 'scale', 'height', 'and', 'dispersion', 'when', 'using', 'this', 'method', 'the', 'dispersion', 'and', 'scale', 'height', 'must', 'refer', 'to', 'the', 'same', 'population', 'of', 'stars', 'the', 'scale', 'height', 'is', 'obtained', 'from', 'nearir', 'studies', 'of', 'edgeon', 'galaxies', 'and', 'is', 'weighted', 'towards', 'older', 'kinematically', 'hotter', 'stars', 'whereas', 'the', 'dispersion', 'obtained', 'from', 'integrated', 'light', 'in', 'the', 'optical', 'bands', 'includes', 'stars', 'of', 'all', 'ages', 'we', 'aim', 'to', 'extract', 'the', 'dispersion', 'for', 'the', 'hotter', 'stars', 'so', 'that', 'it', 'can', 'then', 'be', 'used', 'with', 'the', 'correct', 'scale', 'height', 'to', 'obtain', 'the', 'disc', 'surface', 'mass', 'density', 'we', 'use', 'a', 'sample', 'of', 'planetary', 'nebulae', 'pne', 'as', 'dynamical', 'tracers', 'in', 'the', 'faceon', 'galaxy', 'ngc', '628', 'we', 'extract', 'two', 'different', 'dispersions', 'from', 'its', 'velocity', 'histogram', 'representing', 'the', 'older', 'and', 'younger', 'pne', 'we', 'also', 'present', 'complementary', 'stellar', 'absorption', 'spectra', 'in', 'the', 'inner', 'regions', 'of', 'this', 'galaxy', 'and', 'use', 'a', 'direct', 'pixel', 'fitting', 'technique', 'to', 'extract', 'the', 'two', 'components', 'our', 'analysis', 'concludes', 'that', 'previous', 'studies', 'which', 'do', 'not', 'take', 'account', 'of', 'the', 'young', 'disc', 'underestimate', 'the', 'disc', 'surface', 'mass', 'density', 'by', 'a', 'factor', 'of', '2', 'this', 'is', 'sufficient', 'to', 'make', 'a', 'maximal', 'disc', 'for', 'ngc', '628', 'appear', 'like', 'a', 'submaximal', 'disc']] | [-0.044258917830547834, 0.08565591408330647, -0.12034497891055293, 0.10322485272828714, -0.11975716086044669, -0.04384181120696601, 0.011198178159043073, 0.4179566003471972, -0.20650640268806353, -0.3417569955017971, 0.03577593607261373, -0.24296968265242097, -0.021606157290708108, 0.21444211906639402, -0.0546525229312107, 0.0038560724542658575, 0.04571817196853249, -0.07523238699673769, -0.04932058690560899, -0.2476046095152449, 0.3460338625750209, 0.02554350757006421, 0.1402859510115187, -0.030401210040676904, 0.0376508302676181, -0.06848892866143859, -0.07535149622802065, -0.008602747994748104, -0.1957411549784487, 0.09118289234309296, 0.21725808760529033, 0.11369180136049788, 0.21471684475721095, -0.35370201584176475, -0.1938745802507762, 0.04364870649848478, 0.2314259755167078, 0.0626581919596467, -0.03577352791929236, -0.23035042363417196, 0.07084473889941971, -0.16061970702630568, -0.20156839245698419, 0.07855056084357726, 0.03376309251801735, -0.0007392456960755898, -0.2186070097288693, 0.15501486334562148, 0.03453951586076679, 0.09894499599739132, -0.115660390408474, -0.14746455601547437, -0.0959147523937141, 0.10535806814457821, 0.028564904645098425, 0.04829719041924864, 0.213536184433526, -0.12271446210190086, 0.025049045631460036, 0.40852256529930847, -0.08771005837409476, -0.07251952291582243, 0.2005839272763161, -0.2032054852914948, -0.11118927720259038, 0.10704717419977977, 0.18701718365969922, 0.10487888863424295, -0.13700679906329044, 0.02583932536247422, -0.056052830668229865, 0.23692834826867026, 0.061467329800375795, 0.022692915676914373, 0.30444739450023595, 0.08396166503470556, 0.06823870858121323, 0.07517129812393353, -0.22378046415749953, -0.026287358732946426, -0.21872139225029444, -0.13122710780835295, -0.12776996110693128, 0.047822394809953546, -0.13924577676703503, -0.15253101828429533, 0.35892738778907135, 0.12028166054407635, 0.266602585196914, 0.07207320509974033, 0.3370542429410011, 0.10715329820237844, 0.14386299775023179, 0.14913170769937845, 0.28461248861872646, 0.19239999183984735, 0.05110441039252772, -0.25189581161821223, 0.06779384164183576, -0.0015030646730349007] |
1,802.00466 | Local dynamics of parabolic skew-products | The local dynamics around a fixed point has been extensively studied for
germs of one and several complex variables. In one dimension, there exist a
complete picture of the trajectory of the orbits on a whole neighborhood of the
fixed point. In dimensions larger or equal than two some partial results are
known. In this article we analyze a case that lies in the boundary between one
and several complex variables. We consider skew product maps of the form F (z,
w) = ({\lambda}(z), f (z, w)). We deal with the case of parabolic skew product
maps, that is when DF(0,0) = Id. Our goal is to describe the behavior of orbits
around a whole neighborhood of the origin. We establish formulas for conjugacy
maps in different regions of a neighborhood of the origin.
| math.CV math.DS | the local dynamics around a fixed point has been extensively studied for germs of one and several complex variables in one dimension there exist a complete picture of the trajectory of the orbits on a whole neighborhood of the fixed point in dimensions larger or equal than two some partial results are known in this article we analyze a case that lies in the boundary between one and several complex variables we consider skew product maps of the form f z w lambdaz f z w we deal with the case of parabolic skew product maps that is when df00 id our goal is to describe the behavior of orbits around a whole neighborhood of the origin we establish formulas for conjugacy maps in different regions of a neighborhood of the origin | [['the', 'local', 'dynamics', 'around', 'a', 'fixed', 'point', 'has', 'been', 'extensively', 'studied', 'for', 'germs', 'of', 'one', 'and', 'several', 'complex', 'variables', 'in', 'one', 'dimension', 'there', 'exist', 'a', 'complete', 'picture', 'of', 'the', 'trajectory', 'of', 'the', 'orbits', 'on', 'a', 'whole', 'neighborhood', 'of', 'the', 'fixed', 'point', 'in', 'dimensions', 'larger', 'or', 'equal', 'than', 'two', 'some', 'partial', 'results', 'are', 'known', 'in', 'this', 'article', 'we', 'analyze', 'a', 'case', 'that', 'lies', 'in', 'the', 'boundary', 'between', 'one', 'and', 'several', 'complex', 'variables', 'we', 'consider', 'skew', 'product', 'maps', 'of', 'the', 'form', 'f', 'z', 'w', 'lambdaz', 'f', 'z', 'w', 'we', 'deal', 'with', 'the', 'case', 'of', 'parabolic', 'skew', 'product', 'maps', 'that', 'is', 'when', 'df00', 'id', 'our', 'goal', 'is', 'to', 'describe', 'the', 'behavior', 'of', 'orbits', 'around', 'a', 'whole', 'neighborhood', 'of', 'the', 'origin', 'we', 'establish', 'formulas', 'for', 'conjugacy', 'maps', 'in', 'different', 'regions', 'of', 'a', 'neighborhood', 'of', 'the', 'origin']] | [-0.18310366174248793, 0.05991185119176525, -0.05831944937320099, 0.05820306384569844, -0.016342619881887017, -0.09852326902354719, 0.0472111068581558, 0.35165068495819585, -0.2692604578377409, -0.2005359184153321, 0.10845372595074267, -0.295974382263331, -0.13437137375443547, 0.19294700111646404, -0.0457552087644092, 0.006871412010536394, 0.02273475752524918, 0.09348521929923871, -0.10382220707833767, -0.2337555270935302, 0.38993556703661236, -0.05751020264392363, 0.17402360942356915, -0.0176289981837164, 0.09385858129404258, -0.006113390745737284, -0.029867361683597545, 0.02309284815635845, -0.16335257591081176, 0.10023667758600857, 0.2093665214266116, 0.10479255764921132, 0.2824519882831751, -0.3515808322388707, -0.19344468991350355, 0.1814066855786084, 0.1289456436750017, 0.04447412640851645, -0.02942138513148485, -0.23282748693155964, 0.12141772715964902, -0.1289459906148774, -0.18882754954104206, -0.006446426894732587, 0.07533108711399081, 0.013404882767145302, -0.23262402819796602, 0.03304250832320056, 0.09627050107330766, 0.08834386917603387, -0.058207639141136226, -0.10093670402020785, -0.03832942943216678, 0.15118946111605516, 0.03672066047869424, 0.05311687855149498, 0.09401747183732063, -0.11074924150318305, -0.0930056830953437, 0.3878652884212557, -0.049732692623782, -0.2345775890942549, 0.220544685851356, -0.23990218728275983, -0.1608237290065309, 0.1215062934037952, 0.1603053086117365, 0.14862718384798246, -0.12262669819434269, 0.16460279220953328, -0.0955362829356632, 0.11795374330796145, 0.08964886605465884, -0.0023290447407323897, 0.1787889182731111, 0.11785441462682802, 0.10233511509843, 0.14693738463448489, -0.06462361405511166, -0.10459590259626622, -0.31992684495244317, -0.17605076821961704, -0.12676199602908703, 0.061499820951059575, -0.09782278128163818, -0.16660156843202714, 0.4279113438474512, 0.10478392205350386, 0.2813911977160068, 0.015693900928981888, 0.23180404844612082, 0.10136653524059233, 0.03853009991305134, 0.07820435606528835, 0.16739564208346702, 0.130300672959451, 0.03097153067027169, -0.1279904176067838, 0.03801547281643134, 0.09538664171856095] |
1,802.00467 | Twists and Twistability | Metrically homogeneous graphs are connected graphs which, when endowed with
the path metric, are homogeneous as metric spaces. In this paper we introduce
the concept of twisted automorphisms, a notion of isomorphism up to a
permutation of the language. We find all permutations of the language which are
associated with twisted automorphisms of metrically homogeneous graphs. For
each non-trivial permutation of this type we also characterize the class of
metrically homogeneous graphs which allow a twisted isomorphism associated with
that permutation. The permutations we find are, remarkably, precisely those
found by Bannai and Bannai in an analogous result in the context of finite
association schemes.
| math.LO math.CO | metrically homogeneous graphs are connected graphs which when endowed with the path metric are homogeneous as metric spaces in this paper we introduce the concept of twisted automorphisms a notion of isomorphism up to a permutation of the language we find all permutations of the language which are associated with twisted automorphisms of metrically homogeneous graphs for each nontrivial permutation of this type we also characterize the class of metrically homogeneous graphs which allow a twisted isomorphism associated with that permutation the permutations we find are remarkably precisely those found by bannai and bannai in an analogous result in the context of finite association schemes | [['metrically', 'homogeneous', 'graphs', 'are', 'connected', 'graphs', 'which', 'when', 'endowed', 'with', 'the', 'path', 'metric', 'are', 'homogeneous', 'as', 'metric', 'spaces', 'in', 'this', 'paper', 'we', 'introduce', 'the', 'concept', 'of', 'twisted', 'automorphisms', 'a', 'notion', 'of', 'isomorphism', 'up', 'to', 'a', 'permutation', 'of', 'the', 'language', 'we', 'find', 'all', 'permutations', 'of', 'the', 'language', 'which', 'are', 'associated', 'with', 'twisted', 'automorphisms', 'of', 'metrically', 'homogeneous', 'graphs', 'for', 'each', 'nontrivial', 'permutation', 'of', 'this', 'type', 'we', 'also', 'characterize', 'the', 'class', 'of', 'metrically', 'homogeneous', 'graphs', 'which', 'allow', 'a', 'twisted', 'isomorphism', 'associated', 'with', 'that', 'permutation', 'the', 'permutations', 'we', 'find', 'are', 'remarkably', 'precisely', 'those', 'found', 'by', 'bannai', 'and', 'bannai', 'in', 'an', 'analogous', 'result', 'in', 'the', 'context', 'of', 'finite', 'association', 'schemes']] | [-0.17124783666360946, 0.16905032516182733, -0.03312822167007696, 0.06809342130796896, -0.10982494891310732, -0.10329371403814072, 0.0012120360164858755, 0.4203243142082578, -0.3381820318510845, -0.2649612924261462, 0.09780778923803675, -0.24932291974712695, -0.1666719621402167, 0.15936844571537914, -0.13673647708658662, 0.00613857637203875, 0.07975358686276844, 0.12428997690079822, -0.09477376791293778, -0.2677143362550331, 0.4491349994426682, -0.03478381448381004, 0.2465807182270856, -0.009974251181951591, 0.055307981637971744, -0.04055445459006088, -0.05607124081635404, 0.07049871337200914, -0.1694706090529854, 0.1285010404995687, 0.28074073829200297, 0.06598447331094316, 0.17212135339421886, -0.32255462725602446, -0.13410903973770993, 0.20428435149203453, 0.09958838664350056, 0.037048657097676324, -0.02479561267509347, -0.2768608894731317, 0.12477570059930994, -0.18560290869680188, -0.1161692601916868, -0.05430941958800845, 0.029730840169248127, 0.039595628920055574, -0.24255156656283708, -0.015305402744395126, 0.1329882683520693, 0.07831386949068733, -0.031983750961011366, -0.025005582555951106, -0.027820380176195786, 0.10163313029694282, -0.03736052949513708, 0.05467196437308476, 0.014004613122060186, -0.06517411616985641, -0.20285663189632552, 0.4009440558785129, -0.01287752571072252, -0.24011327480187727, 0.14288842215956676, -0.15039428833073804, -0.21900066893902562, 0.09242015073874167, 0.10411333512692224, 0.17870723240166192, -0.11149691116089733, 0.12637860189979186, -0.15001646026614165, 0.05735665676849229, 0.13279275919000308, 0.008905352552288345, 0.12211157891302026, 0.08843942543358675, 0.12627255449160224, 0.22425986893718974, 0.05159194696849833, -0.05821500747143069, -0.31282998640090226, -0.16414146282310996, -0.07904353392022175, 0.09979388121338117, -0.14665895981611574, -0.25611886388755273, 0.39306660735358795, 0.08397049194290525, 0.16202932338097265, 0.13768292944323982, 0.16274310202958683, 0.014386959293014591, 0.07731684655660674, 0.10759123653350841, 0.11048669387985553, 0.21628584656199173, -0.037519634577135245, -0.13176648414560727, 0.0037146137583823433, 0.16617306412774183] |
1,802.00468 | Precision Orbit of $\delta$ Delphini and Prospects for Astrometric
Detection of Exoplanets | Combining visual and spectroscopic orbits of binary stars leads to a
determination of the full 3D orbit, individual masses, and distance to the
system. We present a full analysis of the evolved binary system $\delta$
Delphini using astrometric data from the MIRC and PAVO instruments on the CHARA
long-baseline interferometer, 97 new spectra from the Fairborn Observatory, and
87 unpublished spectra from Lick Observatory. We determine the full set of
orbital elements for $\delta$ Del, along with masses of $1.78 \pm 0.07$
$M_{\odot}$ and $1.62 \pm 0.07$ $M_{\odot}$ for each component, and a distance
of $63.61 \pm 0.89$ pc. These results are important in two contexts: for
testing stellar evolution models and defining the detection capabilities for
future planet searches. We find that the evolutionary state of this system is
puzzling, as our measured flux ratios, radii, and masses imply a $\sim$ 200 Myr
age difference between the components using standard stellar evolution models.
Possible explanations for this age discrepancy include mass transfer scenarios
with a now ejected tertiary companion. For individual measurements taken over a
span of 2 years we achieve $<10$ $\mu$-arcsecond precision on differential
position with 10-minute observations. The high precision of our astrometric
orbit suggests that exoplanet detection capabilities are within reach of MIRC
at CHARA. We compute exoplanet detection limits around $\delta$ Del, and
conclude that if this precision is extended to wider systems we should be able
to detect most exoplanets $>2$ M$_{J}$ on orbits $>0.75$ AU around individual
components of hot binary stars via differential astrometry.
| astro-ph.SR | combining visual and spectroscopic orbits of binary stars leads to a determination of the full 3d orbit individual masses and distance to the system we present a full analysis of the evolved binary system delta delphini using astrometric data from the mirc and pavo instruments on the chara longbaseline interferometer 97 new spectra from the fairborn observatory and 87 unpublished spectra from lick observatory we determine the full set of orbital elements for delta del along with masses of 178 pm 007 m_odot and 162 pm 007 m_odot for each component and a distance of 6361 pm 089 pc these results are important in two contexts for testing stellar evolution models and defining the detection capabilities for future planet searches we find that the evolutionary state of this system is puzzling as our measured flux ratios radii and masses imply a sim 200 myr age difference between the components using standard stellar evolution models possible explanations for this age discrepancy include mass transfer scenarios with a now ejected tertiary companion for individual measurements taken over a span of 2 years we achieve 10 muarcsecond precision on differential position with 10minute observations the high precision of our astrometric orbit suggests that exoplanet detection capabilities are within reach of mirc at chara we compute exoplanet detection limits around delta del and conclude that if this precision is extended to wider systems we should be able to detect most exoplanets 2 m_j on orbits 075 au around individual components of hot binary stars via differential astrometry | [['combining', 'visual', 'and', 'spectroscopic', 'orbits', 'of', 'binary', 'stars', 'leads', 'to', 'a', 'determination', 'of', 'the', 'full', '3d', 'orbit', 'individual', 'masses', 'and', 'distance', 'to', 'the', 'system', 'we', 'present', 'a', 'full', 'analysis', 'of', 'the', 'evolved', 'binary', 'system', 'delta', 'delphini', 'using', 'astrometric', 'data', 'from', 'the', 'mirc', 'and', 'pavo', 'instruments', 'on', 'the', 'chara', 'longbaseline', 'interferometer', '97', 'new', 'spectra', 'from', 'the', 'fairborn', 'observatory', 'and', '87', 'unpublished', 'spectra', 'from', 'lick', 'observatory', 'we', 'determine', 'the', 'full', 'set', 'of', 'orbital', 'elements', 'for', 'delta', 'del', 'along', 'with', 'masses', 'of', '178', 'pm', '007', 'm_odot', 'and', '162', 'pm', '007', 'm_odot', 'for', 'each', 'component', 'and', 'a', 'distance', 'of', '6361', 'pm', '089', 'pc', 'these', 'results', 'are', 'important', 'in', 'two', 'contexts', 'for', 'testing', 'stellar', 'evolution', 'models', 'and', 'defining', 'the', 'detection', 'capabilities', 'for', 'future', 'planet', 'searches', 'we', 'find', 'that', 'the', 'evolutionary', 'state', 'of', 'this', 'system', 'is', 'puzzling', 'as', 'our', 'measured', 'flux', 'ratios', 'radii', 'and', 'masses', 'imply', 'a', 'sim', '200', 'myr', 'age', 'difference', 'between', 'the', 'components', 'using', 'standard', 'stellar', 'evolution', 'models', 'possible', 'explanations', 'for', 'this', 'age', 'discrepancy', 'include', 'mass', 'transfer', 'scenarios', 'with', 'a', 'now', 'ejected', 'tertiary', 'companion', 'for', 'individual', 'measurements', 'taken', 'over', 'a', 'span', 'of', '2', 'years', 'we', 'achieve', '10', 'muarcsecond', 'precision', 'on', 'differential', 'position', 'with', '10minute', 'observations', 'the', 'high', 'precision', 'of', 'our', 'astrometric', 'orbit', 'suggests', 'that', 'exoplanet', 'detection', 'capabilities', 'are', 'within', 'reach', 'of', 'mirc', 'at', 'chara', 'we', 'compute', 'exoplanet', 'detection', 'limits', 'around', 'delta', 'del', 'and', 'conclude', 'that', 'if', 'this', 'precision', 'is', 'extended', 'to', 'wider', 'systems', 'we', 'should', 'be', 'able', 'to', 'detect', 'most', 'exoplanets', '2', 'm_j', 'on', 'orbits', '075', 'au', 'around', 'individual', 'components', 'of', 'hot', 'binary', 'stars', 'via', 'differential', 'astrometry']] | [-0.10470700851120741, 0.10041141514647826, -0.07360810253850789, 0.04491503064801724, -0.07116511329429677, -0.10053811478335782, 0.06992370291637161, 0.3875233585616032, -0.16689987800156408, -0.4099058154655019, 0.09606653897961846, -0.32446890884063734, -0.008059697585603393, 0.23307824245908212, -0.053001409343655305, 0.024745988301966206, 0.18409050327393622, -0.033100135522371385, -0.09944860315700785, -0.21766922329237084, 0.2536155317420236, 0.0628939295944524, 0.08384329892427798, -0.028164716159175353, 0.10404183947322593, -0.03503982560519886, -0.05583258493770048, -0.05941324466394179, -0.17338360349894794, 0.06449421139738237, 0.23950055657099933, 0.16642254839773732, 0.18010807545684962, -0.28869833196123756, -0.14761521956657034, 0.05590488369561791, 0.1567417914096537, 0.0071115365847425754, -0.021483283834550455, -0.3083907240826407, 0.09854543192355719, -0.21088811499901502, -0.18259190772641523, 0.023284408742046184, 0.08264849251655647, 0.011637688792529572, -0.2560520774436246, 0.10078328414411986, -0.025615227703687796, 0.14135031891519212, -0.12411985268901692, -0.2006918553358493, -0.041752803800776006, 0.12836075640947694, -0.03744048423567913, 0.06849666136821113, 0.10689638192539078, -0.06000512559059636, -0.06369724098650509, 0.39315543568459344, -0.12505952480427207, -0.03610167555711362, 0.20863479954901104, -0.20817353438578576, -0.15596043411642313, 0.1255822032059272, 0.20423530693540715, 0.14311298522708632, -0.17562832483146118, -0.014280020820757975, 0.025355957016215264, 0.2580988743978801, 0.07083957798619461, 0.04868179107032924, 0.36849873994599536, 0.16623919749719673, 0.030783663605341217, -0.014382567153028417, -0.27010219836277344, -0.032205148939779805, -0.22020622331879114, -0.11358882834396485, -0.09523165052890244, 0.07118098199899972, -0.11615324762353695, -0.056863886351507915, 0.3495720704920976, 0.17614596622413492, 0.19871877180876218, 0.06440209747807854, 0.2948923477159991, 0.048081733677427255, 0.09623084397173944, 0.06705947080441561, 0.3232405757887727, 0.1701051210921974, 0.08416170884708529, -0.2268735975056304, 0.03462305256263891, -0.0038527209252356533] |
1,802.00469 | APPLE Picker: Automatic Particle Picking, a Low-Effort Cryo-EM Framework | Particle picking is a crucial first step in the computational pipeline of
single-particle cryo-electron microscopy (cryo-EM). Selecting particles from
the micrographs is difficult especially for small particles with low contrast.
As high-resolution reconstruction typically requires hundreds of thousands of
particles, manually picking that many particles is often too time-consuming.
While semi-automated particle picking is currently a popular approach, it may
suffer from introducing manual bias into the selection process. In addition,
semi-automated particle picking is still somewhat time-consuming. This paper
presents the APPLE (Automatic Particle Picking with Low user Effort) picker, a
simple and novel approach for fast, accurate, and fully automatic particle
picking. While our approach was inspired by template matching, it is completely
template-free. This approach is evaluated on publicly available datasets
containing micrographs of $\beta$-galactosidase and keyhole limpet hemocyanin
projections.
| cs.CV | particle picking is a crucial first step in the computational pipeline of singleparticle cryoelectron microscopy cryoem selecting particles from the micrographs is difficult especially for small particles with low contrast as highresolution reconstruction typically requires hundreds of thousands of particles manually picking that many particles is often too timeconsuming while semiautomated particle picking is currently a popular approach it may suffer from introducing manual bias into the selection process in addition semiautomated particle picking is still somewhat timeconsuming this paper presents the apple automatic particle picking with low user effort picker a simple and novel approach for fast accurate and fully automatic particle picking while our approach was inspired by template matching it is completely templatefree this approach is evaluated on publicly available datasets containing micrographs of betagalactosidase and keyhole limpet hemocyanin projections | [['particle', 'picking', 'is', 'a', 'crucial', 'first', 'step', 'in', 'the', 'computational', 'pipeline', 'of', 'singleparticle', 'cryoelectron', 'microscopy', 'cryoem', 'selecting', 'particles', 'from', 'the', 'micrographs', 'is', 'difficult', 'especially', 'for', 'small', 'particles', 'with', 'low', 'contrast', 'as', 'highresolution', 'reconstruction', 'typically', 'requires', 'hundreds', 'of', 'thousands', 'of', 'particles', 'manually', 'picking', 'that', 'many', 'particles', 'is', 'often', 'too', 'timeconsuming', 'while', 'semiautomated', 'particle', 'picking', 'is', 'currently', 'a', 'popular', 'approach', 'it', 'may', 'suffer', 'from', 'introducing', 'manual', 'bias', 'into', 'the', 'selection', 'process', 'in', 'addition', 'semiautomated', 'particle', 'picking', 'is', 'still', 'somewhat', 'timeconsuming', 'this', 'paper', 'presents', 'the', 'apple', 'automatic', 'particle', 'picking', 'with', 'low', 'user', 'effort', 'picker', 'a', 'simple', 'and', 'novel', 'approach', 'for', 'fast', 'accurate', 'and', 'fully', 'automatic', 'particle', 'picking', 'while', 'our', 'approach', 'was', 'inspired', 'by', 'template', 'matching', 'it', 'is', 'completely', 'templatefree', 'this', 'approach', 'is', 'evaluated', 'on', 'publicly', 'available', 'datasets', 'containing', 'micrographs', 'of', 'betagalactosidase', 'and', 'keyhole', 'limpet', 'hemocyanin', 'projections']] | [-0.015499450386304296, 0.11458009016474313, -0.07222909849334622, 0.03713795382167739, -0.10701542402349526, -0.212474522627114, 0.03109101573698519, 0.42104312043749925, -0.20523842232950934, -0.40903760148494533, 0.08823456842925004, -0.29941805948813754, -0.11242456369941603, 0.18656620739299493, -0.10417241758709266, 0.10627028321014774, 0.1804002137470172, -0.030621645859245098, 0.031161918399227558, -0.23087162887995047, 0.23661530439417358, 0.1085860167989846, 0.3025278655748645, -0.00010456598476704323, 0.1614048959436883, 0.05245247893529295, -0.10124444998412703, -0.016871706222776662, -0.02524006854996101, 0.11990028631275478, 0.27837740727982513, 0.13900961353316565, 0.3332040578119852, -0.39936241504708025, -0.1469066071140608, 0.0772675451607387, 0.21393495777826474, 0.1401469896973691, -0.14578264519999115, -0.25805200293226255, 0.07753059356896715, -0.13159928286900555, -0.05460753183565843, -0.13937333964691567, -0.005498304998389248, -0.04257440373079258, -0.2866424076249435, 0.0917167866066324, -0.0018898200871648662, 0.07503274790096012, 0.006956737241566632, -0.10516749402494029, 0.05223111185654433, 0.14864135024166017, 0.05730354742329589, 0.07741801691890667, 0.22109491590791466, -0.16222921757126282, -0.07597959973976355, 0.4405893172405547, 0.03956660543653098, -0.21009581298549715, 0.2281307710976707, -0.06381556873252107, -0.17489889264812297, 0.22539732126504974, 0.14239094777484285, 0.1867020482613677, -0.2379730293936463, 0.031430401614422655, -0.015061308749753869, 0.1932859286510696, 0.08996051420090777, -0.07970295561773871, 0.19286793361199228, 0.2880785300054192, 0.03498245506489184, 0.11147439062011527, -0.13048692084813604, -0.03398262939740424, -0.20329739079302686, -0.12850849027822595, -0.24535625093884653, -0.009921765187755227, -0.04885402995932964, -0.19835262579109633, 0.3481378519050354, 0.19536567050134623, 0.16941133488999735, 0.03703741137393412, 0.41172957280650735, 0.02665431170272782, 0.10255429622801868, 0.013352700907765238, 0.14749803787421886, -0.05687480816744606, 0.10515128600298229, -0.13559995085586596, 0.07617934004525578, 0.05566989643689753] |
1,802.0047 | Learning random-walk label propagation for weakly-supervised semantic
segmentation | Large-scale training for semantic segmentation is challenging due to the
expense of obtaining training data for this task relative to other vision
tasks. We propose a novel training approach to address this difficulty. Given
cheaply-obtained sparse image labelings, we propagate the sparse labels to
produce guessed dense labelings. A standard CNN-based segmentation network is
trained to mimic these labelings. The label-propagation process is defined via
random-walk hitting probabilities, which leads to a differentiable
parameterization with uncertainty estimates that are incorporated into our
loss. We show that by learning the label-propagator jointly with the
segmentation predictor, we are able to effectively learn semantic edges given
no direct edge supervision. Experiments also show that training a segmentation
network in this way outperforms the naive approach.
| cs.CV | largescale training for semantic segmentation is challenging due to the expense of obtaining training data for this task relative to other vision tasks we propose a novel training approach to address this difficulty given cheaplyobtained sparse image labelings we propagate the sparse labels to produce guessed dense labelings a standard cnnbased segmentation network is trained to mimic these labelings the labelpropagation process is defined via randomwalk hitting probabilities which leads to a differentiable parameterization with uncertainty estimates that are incorporated into our loss we show that by learning the labelpropagator jointly with the segmentation predictor we are able to effectively learn semantic edges given no direct edge supervision experiments also show that training a segmentation network in this way outperforms the naive approach | [['largescale', 'training', 'for', 'semantic', 'segmentation', 'is', 'challenging', 'due', 'to', 'the', 'expense', 'of', 'obtaining', 'training', 'data', 'for', 'this', 'task', 'relative', 'to', 'other', 'vision', 'tasks', 'we', 'propose', 'a', 'novel', 'training', 'approach', 'to', 'address', 'this', 'difficulty', 'given', 'cheaplyobtained', 'sparse', 'image', 'labelings', 'we', 'propagate', 'the', 'sparse', 'labels', 'to', 'produce', 'guessed', 'dense', 'labelings', 'a', 'standard', 'cnnbased', 'segmentation', 'network', 'is', 'trained', 'to', 'mimic', 'these', 'labelings', 'the', 'labelpropagation', 'process', 'is', 'defined', 'via', 'randomwalk', 'hitting', 'probabilities', 'which', 'leads', 'to', 'a', 'differentiable', 'parameterization', 'with', 'uncertainty', 'estimates', 'that', 'are', 'incorporated', 'into', 'our', 'loss', 'we', 'show', 'that', 'by', 'learning', 'the', 'labelpropagator', 'jointly', 'with', 'the', 'segmentation', 'predictor', 'we', 'are', 'able', 'to', 'effectively', 'learn', 'semantic', 'edges', 'given', 'no', 'direct', 'edge', 'supervision', 'experiments', 'also', 'show', 'that', 'training', 'a', 'segmentation', 'network', 'in', 'this', 'way', 'outperforms', 'the', 'naive', 'approach']] | [-0.027434747135035756, 0.02025659683676175, -0.05054914625457773, 0.08946443983594021, -0.17690976913864456, -0.16247962350564554, 0.04610372546094293, 0.5083938195747285, -0.2949415535458233, -0.343636662322135, 0.010287045242364927, -0.24714477201163662, -0.18778750792622936, 0.12264566492358576, -0.20046912623407734, 0.09210549647465718, 0.2219885525684265, 0.05410141301195114, -0.07233018843141531, -0.29685689159091716, 0.29052643162729447, 0.015272260083593735, 0.3190747290572598, -0.005350361189474006, 0.14847609993120395, -0.041865322523373216, -0.0266440192050847, -0.003543602766407546, -0.06559985349706926, 0.20268219854097722, 0.3682449298626012, 0.21569079318668785, 0.32750777179021234, -0.4107504076793913, -0.24637582057063306, 0.1326270522318842, 0.12549961196674295, 0.12633236417881683, -0.02709822898561304, -0.37656578606317853, 0.10638129922815344, -0.14231182650993923, 0.061708375322824915, -0.15170530434643145, -0.0551892820714919, -0.05604574414478107, -0.35327678767209947, 0.04372328321602434, 0.09891439647653597, -0.006872966462238269, -0.03137989321238677, -0.07177107272407979, 0.011555828336887985, 0.1676174097940757, 0.02240785586138733, 0.09892687548629263, 0.11471175493610915, -0.1976536069149998, -0.14429381940406094, 0.3409366505605376, -0.030942722038973955, -0.24497843163534383, 0.20031203969173933, -0.025002172924886067, -0.161216115097954, 0.13789851655452398, 0.21423497932293445, 0.10359039495906923, -0.17235268711320256, -0.02474297937159696, -0.07094383828172629, 0.15383325981684337, 0.07046995966787611, -0.04727887073704927, 0.14962479317453037, 0.26320882655741756, 0.0872681483314642, 0.18257677558788352, -0.16397320215921263, -0.022157859753755744, -0.22718920470946583, -0.07509305119304725, -0.2310111696316191, -0.036252034880020774, -0.10113978525888259, -0.1910008138026667, 0.3580056476755037, 0.28203461719445944, 0.2667351605539972, 0.1783996229415975, 0.3631516620054964, 0.044290117878074305, 0.13128891299394044, 0.11789766337659041, 0.15979398956353014, 0.0005396921899600709, 0.06175525508790223, -0.1447739756073464, 0.1071292207256914, 0.11331938226391708] |
1,802.00471 | Multipartite monogamous relations for Entanglement and Discord | The distribution of quantum correlations in multipartite systems play a
significant role in several aspects of the quantum information theory. While it
is well known that these quantum correlations can not be freely distributed,
the way that it is shared in multipartite system is an open problem even for
small set of qubits. Based on new monogamylike relations between entanglement
and discord for $n$-partite systems, we show how these correlations are
distributed in general, determining distinct equalities and inequalities to the
quantum discord and the entanglement of formation for arbitrary multipartite
pure states.
| quant-ph | the distribution of quantum correlations in multipartite systems play a significant role in several aspects of the quantum information theory while it is well known that these quantum correlations can not be freely distributed the way that it is shared in multipartite system is an open problem even for small set of qubits based on new monogamylike relations between entanglement and discord for npartite systems we show how these correlations are distributed in general determining distinct equalities and inequalities to the quantum discord and the entanglement of formation for arbitrary multipartite pure states | [['the', 'distribution', 'of', 'quantum', 'correlations', 'in', 'multipartite', 'systems', 'play', 'a', 'significant', 'role', 'in', 'several', 'aspects', 'of', 'the', 'quantum', 'information', 'theory', 'while', 'it', 'is', 'well', 'known', 'that', 'these', 'quantum', 'correlations', 'can', 'not', 'be', 'freely', 'distributed', 'the', 'way', 'that', 'it', 'is', 'shared', 'in', 'multipartite', 'system', 'is', 'an', 'open', 'problem', 'even', 'for', 'small', 'set', 'of', 'qubits', 'based', 'on', 'new', 'monogamylike', 'relations', 'between', 'entanglement', 'and', 'discord', 'for', 'npartite', 'systems', 'we', 'show', 'how', 'these', 'correlations', 'are', 'distributed', 'in', 'general', 'determining', 'distinct', 'equalities', 'and', 'inequalities', 'to', 'the', 'quantum', 'discord', 'and', 'the', 'entanglement', 'of', 'formation', 'for', 'arbitrary', 'multipartite', 'pure', 'states']] | [-0.17064381588590882, 0.20492772860793643, -0.10153823032454458, 0.11481659725103127, 0.0576589535421101, -0.21142594063133802, 0.002289365535171362, 0.3407548627746041, -0.2739722753163948, -0.29440676815487365, 0.05411942778355492, -0.310583094235069, -0.13887181094477094, 0.21808043532874635, -0.042320718918676656, 0.12882078185637472, 0.06601065080715388, 0.031022460998526666, -0.032423775535457396, -0.28376229499937383, 0.3606906735803932, -0.009151112934153887, 0.2737726148328073, 0.10343676068449534, 0.05086025355323669, 0.008961380071317157, 0.051215774920438564, 0.03737694988908467, -0.09397816776516421, 0.11820688087215286, 0.3156556077301502, 0.19012946677043713, 0.2381322012953861, -0.41196058502280586, -0.18900956392728835, 0.14407694423496123, 0.13065180885204944, 0.1871872424092945, -0.026581329099523526, -0.327449492028644, -0.0002729829540976914, -0.17242795557424587, -0.059974698144541955, -0.12923693829165991, 0.06601285710630397, -0.04786807627189324, -0.2259801684938852, 0.14573016696138888, 0.1110652406882715, 0.06875112822144142, 0.008718854046717127, -0.02108952734789621, 0.03221679470872366, 0.19639920299091645, -0.11654442878970776, -0.02694593488253773, 0.11108322454095688, -0.12350742902196142, -0.17996718892727487, 0.3437473930979288, 0.01473139908905792, -0.2376126869912109, 0.1791806327935148, -0.12061618767198055, -0.18277452928665025, -0.01984272182228104, 0.14550761287651395, 0.1007547474676563, -0.1698967266968021, 0.04495979060221123, -0.06752522792466865, 0.18293581511299575, 0.007399383947373398, 0.21430156209508597, 0.23145450383264532, 0.04390912917592833, 0.11273403135278533, 0.19434106468989124, 0.00552955777534554, -0.22241637621435426, -0.30963021595912277, -0.23940034653310494, -0.2482316036212949, 0.07340135052596765, -0.11621934650118478, -0.1314891758024372, 0.37586877186612416, 0.1273864580441006, 0.12688268983976975, -0.0005484309438015184, 0.22727412397983254, 0.08914698571137589, 0.06392153944840194, 0.12302435291630606, 0.23802174747951568, 0.182046585165525, 0.037234390692745326, -0.24246340366681257, 0.10277367205989937, -0.017964497957158314] |
1,802.00472 | Solubilization kinetics determines the pulsatory dynamics of lipid
vesicles exposed to surfactant | We establish a biophysical model for the dynamics of lipid vesicles exposed
to surfactants. The solubilization of the lipid membrane due to the insertion
of surfactant molecules induces a reduction of membrane surface area at almost
constant vesicle volume. This results in a rate-dependent increase of membrane
tension and leads to the opening of a micron-sized pore. We show that
solubilization kinetics due to surfactants can determine the regimes of pore
dynamics: either the pores open and reseal within a second (short-lived pore),
or the pore stays open up to a few minutes (long-lived pore). First, we
validate our model with previously published experimental measurements of pore
dynamics. Then, we investigate how the solubilization kinetics and membrane
properties affect the dynamics of the pore and construct a phase diagram for
short and long-lived pores. Finally, we examine the dynamics of sequential pore
openings and show that cyclic short-lived pores occur at a period inversely
proportional to the solubilization rate. By deriving a theoretical expression
for the cycle period, we provide an analytic tool to measure the solubilization
rate of lipid vesicles by surfactants. Our findings shed light on some
fundamental biophysical mechanisms that allow simple cell-like structures to
sustain their integrity against environmental stresses, and have the potential
to aid the design of vesicle-based drug delivery systems.
| physics.bio-ph cond-mat.soft q-bio.SC | we establish a biophysical model for the dynamics of lipid vesicles exposed to surfactants the solubilization of the lipid membrane due to the insertion of surfactant molecules induces a reduction of membrane surface area at almost constant vesicle volume this results in a ratedependent increase of membrane tension and leads to the opening of a micronsized pore we show that solubilization kinetics due to surfactants can determine the regimes of pore dynamics either the pores open and reseal within a second shortlived pore or the pore stays open up to a few minutes longlived pore first we validate our model with previously published experimental measurements of pore dynamics then we investigate how the solubilization kinetics and membrane properties affect the dynamics of the pore and construct a phase diagram for short and longlived pores finally we examine the dynamics of sequential pore openings and show that cyclic shortlived pores occur at a period inversely proportional to the solubilization rate by deriving a theoretical expression for the cycle period we provide an analytic tool to measure the solubilization rate of lipid vesicles by surfactants our findings shed light on some fundamental biophysical mechanisms that allow simple celllike structures to sustain their integrity against environmental stresses and have the potential to aid the design of vesiclebased drug delivery systems | [['we', 'establish', 'a', 'biophysical', 'model', 'for', 'the', 'dynamics', 'of', 'lipid', 'vesicles', 'exposed', 'to', 'surfactants', 'the', 'solubilization', 'of', 'the', 'lipid', 'membrane', 'due', 'to', 'the', 'insertion', 'of', 'surfactant', 'molecules', 'induces', 'a', 'reduction', 'of', 'membrane', 'surface', 'area', 'at', 'almost', 'constant', 'vesicle', 'volume', 'this', 'results', 'in', 'a', 'ratedependent', 'increase', 'of', 'membrane', 'tension', 'and', 'leads', 'to', 'the', 'opening', 'of', 'a', 'micronsized', 'pore', 'we', 'show', 'that', 'solubilization', 'kinetics', 'due', 'to', 'surfactants', 'can', 'determine', 'the', 'regimes', 'of', 'pore', 'dynamics', 'either', 'the', 'pores', 'open', 'and', 'reseal', 'within', 'a', 'second', 'shortlived', 'pore', 'or', 'the', 'pore', 'stays', 'open', 'up', 'to', 'a', 'few', 'minutes', 'longlived', 'pore', 'first', 'we', 'validate', 'our', 'model', 'with', 'previously', 'published', 'experimental', 'measurements', 'of', 'pore', 'dynamics', 'then', 'we', 'investigate', 'how', 'the', 'solubilization', 'kinetics', 'and', 'membrane', 'properties', 'affect', 'the', 'dynamics', 'of', 'the', 'pore', 'and', 'construct', 'a', 'phase', 'diagram', 'for', 'short', 'and', 'longlived', 'pores', 'finally', 'we', 'examine', 'the', 'dynamics', 'of', 'sequential', 'pore', 'openings', 'and', 'show', 'that', 'cyclic', 'shortlived', 'pores', 'occur', 'at', 'a', 'period', 'inversely', 'proportional', 'to', 'the', 'solubilization', 'rate', 'by', 'deriving', 'a', 'theoretical', 'expression', 'for', 'the', 'cycle', 'period', 'we', 'provide', 'an', 'analytic', 'tool', 'to', 'measure', 'the', 'solubilization', 'rate', 'of', 'lipid', 'vesicles', 'by', 'surfactants', 'our', 'findings', 'shed', 'light', 'on', 'some', 'fundamental', 'biophysical', 'mechanisms', 'that', 'allow', 'simple', 'celllike', 'structures', 'to', 'sustain', 'their', 'integrity', 'against', 'environmental', 'stresses', 'and', 'have', 'the', 'potential', 'to', 'aid', 'the', 'design', 'of', 'vesiclebased', 'drug', 'delivery', 'systems']] | [-0.12257554261663625, 0.18566641999512834, -0.06710625088362153, 0.014135555461114056, 0.0034826258089133474, -0.14424189351455763, 0.07896458294166815, 0.37496408450655466, -0.2821969139801208, -0.2752466449687301, 0.07436624533134015, -0.22826665695540088, -0.19061859360202973, 0.16146238870853774, -0.06963378949047522, 0.017381240765369215, 0.056364404756662455, -0.03912937523956887, 0.037122268057536593, -0.20558276405926187, 0.2068628166390713, 0.06360382779046547, 0.2636546496258572, 0.16856734936103918, 0.08605788450384902, -0.07847561170238741, 0.021387804997814168, 0.015831609126613584, -0.2733033896114902, 0.11314750062951515, 0.19479053521442205, 0.018180062699803087, 0.2295705890196354, -0.5230968329947182, -0.26424561876067243, 0.05227818893550267, 0.14535271157618873, 0.15246620264532434, -0.05234291809935902, -0.23875300418585538, 0.07341477685976167, -0.1313383146773937, -0.15701929725230088, -0.0406916429180392, 0.04676780461355351, 0.061540032345205976, -0.20593010867231115, 0.1224755758419633, 0.021070815941730384, 0.07608121602341186, -0.1345932714094213, -0.06808078085115656, -0.03808734807900565, 0.16204101915341304, 0.092088865790906, -0.019590366954460394, 0.2970604136586189, -0.11979234863484148, -0.05740876276869067, 0.36125385394579795, -0.04059515339241168, -0.18777317048570272, 0.20103927863718465, -0.1505440276549306, -0.06206576568832577, 0.2034271944725756, 0.18978111476875667, 0.08539399207937856, -0.14351237200113923, -0.008301919848972194, -0.0028472094774939292, 0.22948104969529046, 0.11475494239306035, -0.030319072236848432, 0.22675775807177603, 0.25233836805577886, 0.03236913799611462, 0.1882912777218058, -0.10624409107123177, -0.12493282026546293, -0.24455334017876276, -0.1962405192124289, -0.09714203931737778, 0.031389705691659865, -0.09550632524451641, -0.20627191073889303, 0.367778759666307, 0.06873139023867457, 0.18386085774143074, 0.06827110070843509, 0.21194251992165783, -0.02891538950971999, 0.07472718512533817, -0.009234094593760579, 0.2107718510581668, 0.14732159618613158, 0.12299362284802767, -0.3152359961977413, 0.11082776132754461, 0.024909619828902704] |
1,802.00473 | Personalized brain network models for assessing structure-function
relationships | Many recent efforts in computational modeling of macro-scale brain dynamics
have begun to take a data-driven approach by incorporating structural and/or
functional information derived from subject data. Here, we discuss recent work
using personalized brain network models to study structure-function
relationships in human brains. We describe the steps necessary to build such
models and show how this computational approach can provide previously
unobtainable information through the ability to perform virtual experiments.
Finally, we present examples of how personalized brain network models can be
used to gain insight into the effects of local stimulation and improve surgical
outcomes in epilepsy.
| q-bio.NC | many recent efforts in computational modeling of macroscale brain dynamics have begun to take a datadriven approach by incorporating structural andor functional information derived from subject data here we discuss recent work using personalized brain network models to study structurefunction relationships in human brains we describe the steps necessary to build such models and show how this computational approach can provide previously unobtainable information through the ability to perform virtual experiments finally we present examples of how personalized brain network models can be used to gain insight into the effects of local stimulation and improve surgical outcomes in epilepsy | [['many', 'recent', 'efforts', 'in', 'computational', 'modeling', 'of', 'macroscale', 'brain', 'dynamics', 'have', 'begun', 'to', 'take', 'a', 'datadriven', 'approach', 'by', 'incorporating', 'structural', 'andor', 'functional', 'information', 'derived', 'from', 'subject', 'data', 'here', 'we', 'discuss', 'recent', 'work', 'using', 'personalized', 'brain', 'network', 'models', 'to', 'study', 'structurefunction', 'relationships', 'in', 'human', 'brains', 'we', 'describe', 'the', 'steps', 'necessary', 'to', 'build', 'such', 'models', 'and', 'show', 'how', 'this', 'computational', 'approach', 'can', 'provide', 'previously', 'unobtainable', 'information', 'through', 'the', 'ability', 'to', 'perform', 'virtual', 'experiments', 'finally', 'we', 'present', 'examples', 'of', 'how', 'personalized', 'brain', 'network', 'models', 'can', 'be', 'used', 'to', 'gain', 'insight', 'into', 'the', 'effects', 'of', 'local', 'stimulation', 'and', 'improve', 'surgical', 'outcomes', 'in', 'epilepsy']] | [0.015992997402344087, 0.03641407828627512, -0.12027815588270173, 0.08486414428287646, -0.14359976217677498, -0.1281746277406887, 0.058068742608707966, 0.42747304776702266, -0.2641594803308823, -0.3410017342692373, 0.059745337184979534, -0.23909978037747093, -0.32813313379389886, 0.1818428175392175, -0.11480263927998492, 0.08556597907862842, 0.11042295702300364, 0.011380507773308159, -0.009516460694033991, -0.25452714933628084, 0.28783978765472923, 0.05638708963971397, 0.29625155549552856, 0.06360676338087128, 0.06962439474870799, -0.019106687074809364, -0.08000195979592249, 0.02769143131298173, -0.18334501274541548, 0.19444432925207145, 0.3477382436514855, 0.24364429439013505, 0.3541150376238305, -0.5984562842382325, -0.31992602800818704, 0.08272898258321514, 0.13470521601001648, 0.13763389132465376, -0.020600671835262516, -0.315962588734398, 0.06052725914527069, -0.16662678555256188, -0.047965069146205984, -0.2119036823172461, -0.05434167102882356, -0.011929422990898744, -0.24917767192190043, 0.05600716366028093, 0.025274420392257396, 0.0882949279762353, -0.061974738122462625, -0.06685514839112082, 0.019026600405329254, 0.25159335007063216, 0.030877843734366122, 0.023906156613557328, 0.1776907412909122, -0.1559474196666005, -0.17785372864454985, 0.3142829211146543, 0.014261147959247194, -0.21213448030939985, 0.22236941931439996, -0.09179522059011189, -0.17094097234840233, 0.07113172947382083, 0.28303361255111115, 0.03860729125168438, -0.21244871541340318, -0.002546274146733034, 0.0430396105623757, 0.16415594710799103, -0.01720564472112767, 0.012633163340841278, 0.16809512695974924, 0.259353818908108, -0.042123402262487536, 0.13459200356414336, -0.06863127448925316, -0.05899819330020686, -0.1999442172660069, -0.1161459842132348, -0.10731828048580674, 0.029643207218737876, -0.048584124430569565, -0.08199566609292018, 0.40745921355832104, 0.2603203705464951, 0.18844976994641727, 0.0612939747915876, 0.31060556595971, 0.01792485625341986, 0.08218316207028399, 0.008459217545360026, 0.1789987962128538, 0.08659140163835025, 0.1270101369038751, -0.2025228839325295, 0.10413483782633763, 0.014106001149900634] |
1,802.00474 | Bayesian Modeling via Goodness-of-fit | The two key issues of modern Bayesian statistics are: (i) establishing
principled approach for distilling statistical prior that is consistent with
the given data from an initial believable scientific prior; and (ii)
development of a Bayes-frequentist consolidated data analysis workflow that is
more effective than either of the two separately. In this paper, we propose the
idea of "Bayes via goodness of fit" as a framework for exploring these
fundamental questions, in a way that is general enough to embrace almost all of
the familiar probability models. Several illustrative examples show the benefit
of this new point of view as a practical data analysis tool. Relationship with
other Bayesian cultures is also discussed.
| stat.ME math.ST stat.ML stat.TH | the two key issues of modern bayesian statistics are i establishing principled approach for distilling statistical prior that is consistent with the given data from an initial believable scientific prior and ii development of a bayesfrequentist consolidated data analysis workflow that is more effective than either of the two separately in this paper we propose the idea of bayes via goodness of fit as a framework for exploring these fundamental questions in a way that is general enough to embrace almost all of the familiar probability models several illustrative examples show the benefit of this new point of view as a practical data analysis tool relationship with other bayesian cultures is also discussed | [['the', 'two', 'key', 'issues', 'of', 'modern', 'bayesian', 'statistics', 'are', 'i', 'establishing', 'principled', 'approach', 'for', 'distilling', 'statistical', 'prior', 'that', 'is', 'consistent', 'with', 'the', 'given', 'data', 'from', 'an', 'initial', 'believable', 'scientific', 'prior', 'and', 'ii', 'development', 'of', 'a', 'bayesfrequentist', 'consolidated', 'data', 'analysis', 'workflow', 'that', 'is', 'more', 'effective', 'than', 'either', 'of', 'the', 'two', 'separately', 'in', 'this', 'paper', 'we', 'propose', 'the', 'idea', 'of', 'bayes', 'via', 'goodness', 'of', 'fit', 'as', 'a', 'framework', 'for', 'exploring', 'these', 'fundamental', 'questions', 'in', 'a', 'way', 'that', 'is', 'general', 'enough', 'to', 'embrace', 'almost', 'all', 'of', 'the', 'familiar', 'probability', 'models', 'several', 'illustrative', 'examples', 'show', 'the', 'benefit', 'of', 'this', 'new', 'point', 'of', 'view', 'as', 'a', 'practical', 'data', 'analysis', 'tool', 'relationship', 'with', 'other', 'bayesian', 'cultures', 'is', 'also', 'discussed']] | [-0.03401223107253567, 0.029073273733047245, -0.11381170360670824, 0.10840586188507066, -0.1023553925208814, -0.15662271901133604, 0.057649254267744254, 0.3727908590808511, -0.2628238978379938, -0.33114139947740895, 0.11462639196335138, -0.25402397783597863, -0.17416849016444758, 0.22526560084744623, -0.07934343453962356, 0.05799306959878387, 0.09285357472669732, 0.018259171438070813, -0.05635875131909935, -0.2177218777006991, 0.3608755757772347, 0.06530043514378901, 0.3187949195271358, 0.008759900190593075, 0.062183330910037124, -0.01401150832784229, -0.08134544476550738, 0.014230366256794826, -0.1189867457131056, 0.19953701675071248, 0.29923074682863315, 0.25937497931798653, 0.36098995234351605, -0.39946152342599817, -0.2237008072219656, 0.0807217249779829, 0.14770753422219837, 0.10562743908875356, -0.07477407761390557, -0.2521367919731087, 0.06559559096889903, -0.17911391402594745, -0.11303721344198234, -0.12074372015194967, -0.013467173050490342, 0.0022347321916770723, -0.2732538102676959, 0.05270922947394346, 0.09217239733802021, 0.08976059124272849, -0.026239966221120476, -0.12758899145306454, 0.03516934042064739, 0.1470401722472161, 0.06783697147225862, 0.017827886352149238, 0.07890950561185102, -0.12518179892296238, -0.12838848501061356, 0.37256768217568087, -0.02280426563252799, -0.1762689371909281, 0.18142864838176007, -0.07665339188367527, -0.19517444690739336, 0.04755390942695418, 0.14964497469190974, 0.0874915940221399, -0.22235733257444476, 0.034037335742011364, -0.05414289293444848, 0.13128049983398732, -0.01357657288982799, -0.005256292839996084, 0.2162592478395839, 0.22347000022585103, 0.04313764939433895, 0.11532440939117805, -0.0724712878270241, -0.12350044962035359, -0.33273756279543576, -0.1517556332816769, -0.1676514255200995, 0.010822426442505926, -0.10143222985360419, -0.15416772907649698, 0.3921022408675136, 0.20590103921547, 0.19041366737760004, 0.06500854906127122, 0.33831012460203574, 0.04880231013833379, 0.016446683638995246, 0.053572028386822367, 0.20657773966169252, 0.07279932320151213, 0.08146616240680617, -0.0959933055653112, 0.08169794278884572, -0.02886341749815204] |
1,802.00475 | Thermocapillary-driven fluid flow within microchannels | Surface tension gradients induce Marangoni flow, which may be exploited for
fluid transport. At the micrometer scale, these surface-driven flows can be
more significant than those driven by pressure. By introducing fluid-fluid
interfaces on the walls of microfluidic channels, we use surface tension
gradients to drive bulk fluid flows. The gradients are specifically induced
through thermal energy, exploiting the temperature dependence of a fluid-fluid
interface to generate thermocapillary flow. In this report, we provide the
design concept for a biocompatible, thermocapillary microchannel capable of
being powered by solar irradiation. Using temperature gradients on the order of
degrees Celsius per centimeter, we achieve fluid velocities on the order of
millimeters per second. Following experimental observations, fluid dynamic
models, and numerical simulation, we find that the fluid velocity is linearly
proportional to the provided temperature gradient, enabling full control of the
fluid flow within the microchannels.
| physics.flu-dyn | surface tension gradients induce marangoni flow which may be exploited for fluid transport at the micrometer scale these surfacedriven flows can be more significant than those driven by pressure by introducing fluidfluid interfaces on the walls of microfluidic channels we use surface tension gradients to drive bulk fluid flows the gradients are specifically induced through thermal energy exploiting the temperature dependence of a fluidfluid interface to generate thermocapillary flow in this report we provide the design concept for a biocompatible thermocapillary microchannel capable of being powered by solar irradiation using temperature gradients on the order of degrees celsius per centimeter we achieve fluid velocities on the order of millimeters per second following experimental observations fluid dynamic models and numerical simulation we find that the fluid velocity is linearly proportional to the provided temperature gradient enabling full control of the fluid flow within the microchannels | [['surface', 'tension', 'gradients', 'induce', 'marangoni', 'flow', 'which', 'may', 'be', 'exploited', 'for', 'fluid', 'transport', 'at', 'the', 'micrometer', 'scale', 'these', 'surfacedriven', 'flows', 'can', 'be', 'more', 'significant', 'than', 'those', 'driven', 'by', 'pressure', 'by', 'introducing', 'fluidfluid', 'interfaces', 'on', 'the', 'walls', 'of', 'microfluidic', 'channels', 'we', 'use', 'surface', 'tension', 'gradients', 'to', 'drive', 'bulk', 'fluid', 'flows', 'the', 'gradients', 'are', 'specifically', 'induced', 'through', 'thermal', 'energy', 'exploiting', 'the', 'temperature', 'dependence', 'of', 'a', 'fluidfluid', 'interface', 'to', 'generate', 'thermocapillary', 'flow', 'in', 'this', 'report', 'we', 'provide', 'the', 'design', 'concept', 'for', 'a', 'biocompatible', 'thermocapillary', 'microchannel', 'capable', 'of', 'being', 'powered', 'by', 'solar', 'irradiation', 'using', 'temperature', 'gradients', 'on', 'the', 'order', 'of', 'degrees', 'celsius', 'per', 'centimeter', 'we', 'achieve', 'fluid', 'velocities', 'on', 'the', 'order', 'of', 'millimeters', 'per', 'second', 'following', 'experimental', 'observations', 'fluid', 'dynamic', 'models', 'and', 'numerical', 'simulation', 'we', 'find', 'that', 'the', 'fluid', 'velocity', 'is', 'linearly', 'proportional', 'to', 'the', 'provided', 'temperature', 'gradient', 'enabling', 'full', 'control', 'of', 'the', 'fluid', 'flow', 'within', 'the', 'microchannels']] | [-0.14678250572291696, 0.23662425343516386, -0.08572780740602563, -0.05037164305233293, -0.05322671173619003, -0.11715526876408451, -0.016425299754094642, 0.37701070921159247, -0.30017279219141024, -0.3413516533489908, 0.07031577292218572, -0.26676931896104683, -0.07372290351486299, 0.19587515980108744, -0.025408373002493236, 0.05662143446129954, 0.005695010182737153, -0.07671968929429972, -0.011990762411086407, -0.17743608187690066, 0.2440879216850994, 0.07857986072000737, 0.282666598181499, 0.1078007821795634, 0.13866179712284873, -0.10000149802363012, 0.007447152986666576, 0.11543437760620792, -0.21882808857021196, 0.08088385261362419, 0.20327800309509156, -0.05054007689533238, 0.22588377837867787, -0.5181919823258391, -0.30495617522521773, 0.03333983491271889, 0.11573759173107748, 0.12709423679350745, -0.09298459682162906, -0.21264437504578382, 0.06599496475084582, -0.13585228954131404, -0.1120939219925074, -0.05719240157486638, -0.038545783721524965, 0.05262766214137729, -0.22886300315925232, 0.16342392656952143, 0.003685265203886148, 0.1159145850849907, -0.08544140271017871, -0.0675940876664956, -0.08686378441699263, 0.09172192544792779, 0.030254082099418156, 0.034047162106920346, 0.27204949932153494, -0.14153515237841122, -0.02870631782166634, 0.37663302796944564, -0.07936761793472316, -0.21032117844636863, 0.22442919828851396, -0.1242808247237311, 0.004492639761237014, 0.18541342922900286, 0.2501270709374997, 0.11381288503697659, -0.14796797603028405, -0.0369836919291831, 0.015242622014031641, 0.19034190255155814, 0.1138189835797271, -0.07304610634714158, 0.26075654916995616, 0.20220448036626396, 0.07957341399095538, 0.15622032695197655, -0.1414791600966257, -0.08910658446580379, -0.2971367245966879, -0.1652659762185067, -0.1393215946769083, 0.002106697891880079, -0.11994780281212217, -0.12670787669614786, 0.34160771029640574, 0.1608078321320742, 0.13191285901120864, 0.026096759804608557, 0.30537380386764806, 0.06199221424241033, 0.09537085336827052, 0.1427608459408576, 0.2752817810137963, 0.14892597123010395, 0.17315313069977695, -0.2748955626902898, 0.07975561513901791, 0.05178026153023691] |
1,802.00476 | On a fractional version of Haemers' bound | In this note, we present a fractional version of Haemers' bound on the
Shannon capacity of a graph, which is originally due to Blasiak. This bound is
a common strengthening of both Haemers' bound and the fractional chromatic
number of a graph. We show that this fractional version outperforms any bound
on the Shannon capacity that could be attained through Haemers' bound. We show
also that this bound is multiplicative, unlike Haemers' bound.
| cs.IT math.CO math.IT | in this note we present a fractional version of haemers bound on the shannon capacity of a graph which is originally due to blasiak this bound is a common strengthening of both haemers bound and the fractional chromatic number of a graph we show that this fractional version outperforms any bound on the shannon capacity that could be attained through haemers bound we show also that this bound is multiplicative unlike haemers bound | [['in', 'this', 'note', 'we', 'present', 'a', 'fractional', 'version', 'of', 'haemers', 'bound', 'on', 'the', 'shannon', 'capacity', 'of', 'a', 'graph', 'which', 'is', 'originally', 'due', 'to', 'blasiak', 'this', 'bound', 'is', 'a', 'common', 'strengthening', 'of', 'both', 'haemers', 'bound', 'and', 'the', 'fractional', 'chromatic', 'number', 'of', 'a', 'graph', 'we', 'show', 'that', 'this', 'fractional', 'version', 'outperforms', 'any', 'bound', 'on', 'the', 'shannon', 'capacity', 'that', 'could', 'be', 'attained', 'through', 'haemers', 'bound', 'we', 'show', 'also', 'that', 'this', 'bound', 'is', 'multiplicative', 'unlike', 'haemers', 'bound']] | [-0.1654328670965074, 0.11395761223943675, -0.13795125064733502, 0.07119250661623346, -0.09200105979426267, -0.14238598922344103, 0.14449458867502846, 0.24854324135470063, -0.23178965861156378, -0.3226347970840049, 0.12588488691875532, -0.26274707520457163, -0.22862720684059065, 0.2143279758014091, -0.1961216254491512, 0.014284066090436831, 0.04485463491188082, 0.10772805280779323, -0.0009844893978730048, -0.2958675685493365, 0.2881676637414486, 0.04150540502869511, 0.22597426909647167, 0.16341896732784297, 0.027898310572833894, -0.013518474313545309, 0.041220990629956024, 0.01958816347975437, -0.21646241883080283, 0.16768868845466472, 0.16638221739702028, 0.13729938488351565, 0.26593103872178353, -0.3235328170687777, -0.20204947706414003, 0.18469774478102383, 0.1323118680029189, 0.10306230222340673, -0.025149197609894206, -0.25416301900189214, 0.11665282279814351, -0.1772575636381564, -0.04429888327236045, 0.0012348178672055676, 0.024481551389988154, 0.0015494682736796874, -0.28163475103114977, 0.09296772156623574, 0.18497892635657567, -0.030532497415089444, 0.0023523613759507873, -0.1704767673110513, 0.04337306355113444, 0.000945662371559094, -0.053501865395969926, 0.061113024986833846, 0.008656154629098226, -0.10935155104539573, -0.16672720481986053, 0.2749309781811213, -0.1304442307190995, -0.2040843604872488, 0.1233369342533055, -0.13872483757337276, -0.1739287679019856, 0.07436301407391487, 0.14025439723228958, 0.14085858147463773, -0.0994269174893629, 0.1231377083889515, -0.18181973614104807, 0.1852584144974459, 0.13405086977841102, 0.10110282073154638, 0.06223629807976827, 0.12724658885128695, 0.1764861259430851, 0.25238287416191085, -0.050782130960987444, -0.0739838722136433, -0.2759071260384501, -0.21145490852538623, -0.2935878366729474, 0.06128948693457123, -0.09217195550585006, -0.13239634554428112, 0.31590392236431986, 0.13801648243241113, 0.13912851805479765, 0.14257877991273235, 0.28652678143028937, 0.18081780477851145, 0.01597228784063091, 0.19380720054781805, 0.20226051010293503, 0.17108944599350837, -0.007349107586714911, -0.18986954942524228, 0.08709194754052602, 0.15169822568813823] |
1,802.00477 | Turbulent channel flow over an anisotropic porous wall - Drag increase
and reduction | The effect of the variations of the permeability tensor on the
close-to-the-wall behaviour of a turbulent channel flow bounded by porous walls
is explored using a set of direct numerical simulations. It is found that the
total drag can be either reduced or increased by more than $20\%$ by adjusting
the permeability directional properties. Drag reduction is achieved for the
case of materials with permeability in the vertical direction lower than the
one in the wall-parallel planes. This configuration limits the wall normal
velocity at the interface while promoting an increase of the tangential slip
velocity leading to an almost "one-component" turbulence where the low- and
high-speed streaks coherence is strongly enhanced. On the other hand, strong
drag increase is found when a high wall-normal and low wall-parallel
permeabilities are prescribed. In this condition, the enhancement of the
wall-normal fluctuations due to the reduced wall-blocking effect triggers the
onset of structures which are strongly correlated in the spanwise direction, a
phenomenon observed by other authors in flows over isotropic porous layers or
over ribletted walls with large protrusion heights. The use of anisotropic
porous walls for drag reduction is particularly attractive since equal gains
can be achieved at different Reynolds numbers by rescaling the magnitude of the
permeability only.
| physics.flu-dyn | the effect of the variations of the permeability tensor on the closetothewall behaviour of a turbulent channel flow bounded by porous walls is explored using a set of direct numerical simulations it is found that the total drag can be either reduced or increased by more than 20 by adjusting the permeability directional properties drag reduction is achieved for the case of materials with permeability in the vertical direction lower than the one in the wallparallel planes this configuration limits the wall normal velocity at the interface while promoting an increase of the tangential slip velocity leading to an almost onecomponent turbulence where the low and highspeed streaks coherence is strongly enhanced on the other hand strong drag increase is found when a high wallnormal and low wallparallel permeabilities are prescribed in this condition the enhancement of the wallnormal fluctuations due to the reduced wallblocking effect triggers the onset of structures which are strongly correlated in the spanwise direction a phenomenon observed by other authors in flows over isotropic porous layers or over ribletted walls with large protrusion heights the use of anisotropic porous walls for drag reduction is particularly attractive since equal gains can be achieved at different reynolds numbers by rescaling the magnitude of the permeability only | [['the', 'effect', 'of', 'the', 'variations', 'of', 'the', 'permeability', 'tensor', 'on', 'the', 'closetothewall', 'behaviour', 'of', 'a', 'turbulent', 'channel', 'flow', 'bounded', 'by', 'porous', 'walls', 'is', 'explored', 'using', 'a', 'set', 'of', 'direct', 'numerical', 'simulations', 'it', 'is', 'found', 'that', 'the', 'total', 'drag', 'can', 'be', 'either', 'reduced', 'or', 'increased', 'by', 'more', 'than', '20', 'by', 'adjusting', 'the', 'permeability', 'directional', 'properties', 'drag', 'reduction', 'is', 'achieved', 'for', 'the', 'case', 'of', 'materials', 'with', 'permeability', 'in', 'the', 'vertical', 'direction', 'lower', 'than', 'the', 'one', 'in', 'the', 'wallparallel', 'planes', 'this', 'configuration', 'limits', 'the', 'wall', 'normal', 'velocity', 'at', 'the', 'interface', 'while', 'promoting', 'an', 'increase', 'of', 'the', 'tangential', 'slip', 'velocity', 'leading', 'to', 'an', 'almost', 'onecomponent', 'turbulence', 'where', 'the', 'low', 'and', 'highspeed', 'streaks', 'coherence', 'is', 'strongly', 'enhanced', 'on', 'the', 'other', 'hand', 'strong', 'drag', 'increase', 'is', 'found', 'when', 'a', 'high', 'wallnormal', 'and', 'low', 'wallparallel', 'permeabilities', 'are', 'prescribed', 'in', 'this', 'condition', 'the', 'enhancement', 'of', 'the', 'wallnormal', 'fluctuations', 'due', 'to', 'the', 'reduced', 'wallblocking', 'effect', 'triggers', 'the', 'onset', 'of', 'structures', 'which', 'are', 'strongly', 'correlated', 'in', 'the', 'spanwise', 'direction', 'a', 'phenomenon', 'observed', 'by', 'other', 'authors', 'in', 'flows', 'over', 'isotropic', 'porous', 'layers', 'or', 'over', 'ribletted', 'walls', 'with', 'large', 'protrusion', 'heights', 'the', 'use', 'of', 'anisotropic', 'porous', 'walls', 'for', 'drag', 'reduction', 'is', 'particularly', 'attractive', 'since', 'equal', 'gains', 'can', 'be', 'achieved', 'at', 'different', 'reynolds', 'numbers', 'by', 'rescaling', 'the', 'magnitude', 'of', 'the', 'permeability', 'only']] | [-0.1660298281727874, 0.22381535917873724, -0.0343629312520684, -0.016004416271049565, -0.06272988484548495, -0.09304456902188656, -0.028222799613095314, 0.3467158792106417, -0.2943518815620902, -0.2927134325614796, 0.0936120232014501, -0.2542448557700817, -0.08984420544612538, 0.20551542369241926, -0.017898778792796204, 0.0034821555560942993, 0.020994234764586808, -0.009111383352293044, -0.04554079544054598, -0.22688166057245662, 0.27355034241353354, 0.056090650548372936, 0.3377422822946773, 0.08780207050041956, 0.0886398229128636, -0.05797025119406578, 0.0013540345628393216, 0.10254194045177145, -0.13134965735835333, 0.07929270914348874, 0.17972905619761645, -0.06332680788252829, 0.23935610838957783, -0.4518117158067892, -0.25184904207990877, 0.05102786273487563, 0.16326598790519445, 0.07801604656857501, -0.02023194063881817, -0.23959567252144182, 0.09193871778354627, -0.1370960432263001, -0.14197998327537648, 0.0042533052427404855, 0.050536094457182344, 0.03876317871109474, -0.2662927205357881, 0.16168049314891178, 0.05635380150876867, 0.10469748734302131, -0.058245398387882535, -0.10365277899483454, -0.07815718070210581, 0.07377209076988488, 0.09793686460662923, 0.024164124757042427, 0.1830159869202971, -0.2011051903845001, -0.02641786826103112, 0.3936912719865592, -0.08038447773746933, -0.24238561162095262, 0.20613085214094964, -0.1699926189341338, 0.0223058923351063, 0.22122382523166467, 0.18017482764349835, 0.09053074357818103, -0.08960432060735664, -0.0018417559141966796, -0.02439121418808885, 0.15266503431287243, 0.1203819988272831, -0.037484878956710974, 0.18563244546067367, 0.16151396444551105, 0.11308564228973197, 0.14128133281556782, -0.11421238034381531, -0.05472036628154314, -0.2527654575708422, -0.14293035514114732, -0.18041809212452578, 0.0006717240423172061, -0.14882569473369037, -0.14744929260420567, 0.3377915627653123, 0.11620481091650944, 0.20349563976542942, -0.00421321911011705, 0.31276304080395156, 0.1346885198586676, 0.10447479288536803, 0.08124109161384765, 0.2972313768402176, 0.14648690090844751, 0.13558541811342595, -0.2429197929727221, 0.12037473284295823, 0.03013771953923318] |
1,802.00478 | A van Benthem Theorem for Fuzzy Modal Logic | We present a fuzzy (or quantitative) version of the van Benthem theorem,
which characterizes propositional modal logic as the bisimulation-invariant
fragment of first-order logic. Specifically, we consider a first-order fuzzy
predicate logic along with its modal fragment, and show that the fuzzy
first-order formulas that are non-expansive w.r.t. the natural notion of
bisimulation distance are exactly those that can be approximated by fuzzy modal
formulas.
| cs.LO | we present a fuzzy or quantitative version of the van benthem theorem which characterizes propositional modal logic as the bisimulationinvariant fragment of firstorder logic specifically we consider a firstorder fuzzy predicate logic along with its modal fragment and show that the fuzzy firstorder formulas that are nonexpansive wrt the natural notion of bisimulation distance are exactly those that can be approximated by fuzzy modal formulas | [['we', 'present', 'a', 'fuzzy', 'or', 'quantitative', 'version', 'of', 'the', 'van', 'benthem', 'theorem', 'which', 'characterizes', 'propositional', 'modal', 'logic', 'as', 'the', 'bisimulationinvariant', 'fragment', 'of', 'firstorder', 'logic', 'specifically', 'we', 'consider', 'a', 'firstorder', 'fuzzy', 'predicate', 'logic', 'along', 'with', 'its', 'modal', 'fragment', 'and', 'show', 'that', 'the', 'fuzzy', 'firstorder', 'formulas', 'that', 'are', 'nonexpansive', 'wrt', 'the', 'natural', 'notion', 'of', 'bisimulation', 'distance', 'are', 'exactly', 'those', 'that', 'can', 'be', 'approximated', 'by', 'fuzzy', 'modal', 'formulas']] | [-0.08318273081945685, 0.07014563109439154, -0.10427920581916204, 0.17284280981581945, -0.15416330974549056, -0.12852343338756608, 0.06371071167791692, 0.3641439186838957, -0.3377533381948104, -0.2138557387659183, 0.0498460610755361, -0.27869766923384026, -0.1052582285022184, 0.1235807818826288, -0.14426488877551702, 0.09334690218271974, -0.04202027938758524, 0.11661274259050305, -0.0888675019180832, -0.1486156033244557, 0.32583256358137497, -0.08367795518671091, 0.16774077210933544, 0.014801287744194268, 0.11334557733856715, 0.061041800133310835, 0.04234991757055888, 0.17474934468762232, -0.14415917992401564, 0.13848352945194795, 0.3471223647777851, 0.28242313269382485, 0.3201677300609075, -0.4089535362731952, -0.06369769703596831, 0.07724050229701858, 0.04290247857839299, 0.06021256648684637, 0.06355143549780433, -0.35717149667728404, 0.11341312603953366, -0.23149616569280623, -0.04030781777289051, -0.15573469492105338, 0.04610155422527056, 0.10372964178140347, -0.20649465339688156, -0.00424300990998745, 0.3189400903808956, 0.11228737629448565, -0.021107929977230155, -0.040936686600056976, -0.006309907829675537, -0.0636702831225613, -0.1055149597563566, -0.008107449866544741, 0.11380379967248211, -0.002256881631910801, -0.22992955391975836, 0.31199599493008395, -0.03768996043274036, -0.2027949628348534, 0.09934961552230212, -0.06582240242367754, -0.17478161047284418, 0.061470609659758896, 0.024193093897058413, 0.16513662653473707, -0.1430845369871419, 0.1599224598424581, -0.10060642516383758, 0.27600854510584705, 0.21827706403743763, 0.09355175432820732, 0.20722201483037608, 0.14652604509431583, 0.024836832471191884, 0.25866327037712417, 0.04596630175096484, -0.21432376941666006, -0.31611363045298135, -0.1476098757667037, -0.029049802725561538, -0.1098528464575513, -0.1297704321688238, -0.27276700972937623, 0.28178125087601635, 0.1378882383641142, 0.12370766611913075, 0.2718027200997592, 0.3166834843524087, 0.24060608052397864, 0.07240493681568366, -0.037993942502026375, 0.18518748544156552, 0.18769499923532398, 0.07398981318737452, -0.1619781569792674, 0.11239813829843814, 0.22251341000127678] |
1,802.00479 | Exploring hyperon structure with electromagnetic transverse densities | We explore the structure of the spin-1/2 flavor-octet baryons (hyperons)
through their electromagnetic transverse densities. The transverse densities
describe the distribution of charge and magnetization at fixed light-front time
and enable a spatial representation of the baryons as relativistic systems. At
peripheral distances b~1/M_pi the transverse densities are computed using a new
method that combines chiral effective field theory and dispersion analysis. The
peripheral isovector densities arise from two-pion exchange, which includes the
rho-meson resonance through elastic unitarity. The isoscalar densities are
estimated from vector meson exchange (omega, phi). We find that the "pion
cloud" in the charged Sigma hyperons is comparable to the nucleon, while in the
Xi it is suppressed. The Lambda-Sigma^0 transition density is pure isovector
and represents a clear manifestiation of peripheral two-pion dynamics.
| hep-ph nucl-th | we explore the structure of the spin12 flavoroctet baryons hyperons through their electromagnetic transverse densities the transverse densities describe the distribution of charge and magnetization at fixed lightfront time and enable a spatial representation of the baryons as relativistic systems at peripheral distances b1m_pi the transverse densities are computed using a new method that combines chiral effective field theory and dispersion analysis the peripheral isovector densities arise from twopion exchange which includes the rhomeson resonance through elastic unitarity the isoscalar densities are estimated from vector meson exchange omega phi we find that the pion cloud in the charged sigma hyperons is comparable to the nucleon while in the xi it is suppressed the lambdasigma0 transition density is pure isovector and represents a clear manifestiation of peripheral twopion dynamics | [['we', 'explore', 'the', 'structure', 'of', 'the', 'spin12', 'flavoroctet', 'baryons', 'hyperons', 'through', 'their', 'electromagnetic', 'transverse', 'densities', 'the', 'transverse', 'densities', 'describe', 'the', 'distribution', 'of', 'charge', 'and', 'magnetization', 'at', 'fixed', 'lightfront', 'time', 'and', 'enable', 'a', 'spatial', 'representation', 'of', 'the', 'baryons', 'as', 'relativistic', 'systems', 'at', 'peripheral', 'distances', 'b1m_pi', 'the', 'transverse', 'densities', 'are', 'computed', 'using', 'a', 'new', 'method', 'that', 'combines', 'chiral', 'effective', 'field', 'theory', 'and', 'dispersion', 'analysis', 'the', 'peripheral', 'isovector', 'densities', 'arise', 'from', 'twopion', 'exchange', 'which', 'includes', 'the', 'rhomeson', 'resonance', 'through', 'elastic', 'unitarity', 'the', 'isoscalar', 'densities', 'are', 'estimated', 'from', 'vector', 'meson', 'exchange', 'omega', 'phi', 'we', 'find', 'that', 'the', 'pion', 'cloud', 'in', 'the', 'charged', 'sigma', 'hyperons', 'is', 'comparable', 'to', 'the', 'nucleon', 'while', 'in', 'the', 'xi', 'it', 'is', 'suppressed', 'the', 'lambdasigma0', 'transition', 'density', 'is', 'pure', 'isovector', 'and', 'represents', 'a', 'clear', 'manifestiation', 'of', 'peripheral', 'twopion', 'dynamics']] | [-0.14200972255119787, 0.267047953621913, -0.13348773124051236, 0.13882573398240355, -0.035788251114787444, -0.07999928031368034, -0.014241681209698851, 0.3558976465599641, -0.17310917923676908, -0.2168304309829153, -0.11154118839407429, -0.32825320885915843, -0.01962381219565277, 0.04942046868566808, 0.14982753255153222, 0.025873170332661607, 0.021714459106858288, 0.10132528211374486, -0.09395520808729566, -0.08730351229915248, 0.3576301734133195, -0.009809330519702699, 0.24710857712974152, 0.1568847506876207, 0.0636102398284637, 0.06502071924005, -0.012701853511056729, -0.02879690718171852, -0.10579361913724347, 0.08387764715515668, 0.2170388508303505, 0.009884790582851738, 0.14054208213189942, -0.3740817082691051, -0.15877396172829092, 0.0793518528974216, 0.16709123341189253, 0.15584266542490305, 0.001696395395796687, -0.30973682266526986, 0.064016152531766, -0.2106880953919793, -0.18024777347547194, -0.1342141803645987, 0.010705109468535595, 0.04501669486524493, -0.2886916758508296, 0.18493839668822365, -0.03570100249693034, 0.053961925016390896, -0.056980719948778784, -0.2333346377644274, -0.08406763612699236, 0.06292094454346668, 0.08178665818801771, 0.1295071261572755, 0.21819984204401927, -0.18809949084081584, -0.049950728743588406, 0.3884724438456552, -0.04763133375949803, -0.19602917972582554, 0.10523205912036318, -0.19653529907384562, -0.11214882185653088, 0.17115992088876072, 0.18933917831773647, 0.07015151057266704, -0.1655970825448758, 0.10277876197471328, -0.02823362286786534, 0.17034370412713745, 0.08594690743530731, 0.06366809877097636, 0.2327779207068185, 0.15261896512663317, -0.022262042905259433, 0.08122664089462468, -0.12657919624042632, -0.12026902895406007, -0.345425541246576, -0.0687642871094535, -0.13951393139238158, 0.04960728898027261, -0.10555066348324689, -0.08276762977789437, 0.3563731503081582, 0.06421986556360645, 0.2248463680494636, -0.006965904604710106, 0.3312506063227793, 0.12186238659630781, 0.09825270817178997, 0.12009052937354148, 0.26309922525459634, 0.2696163304933598, 0.15904319793399838, -0.3144847772468532, -0.022175616985704336, 0.03689610240944025] |
1,802.0048 | Manifestation of Superposition and Coherence in $\cal PT$-symmetry
through the $\eta$-inner Product | Through the $\eta$-inner product, we investigate $\cal PT$-symmetric quantum
mechanics from the viewpoint of superposition and coherence theory. It is
argued that $\cal PT$-symmetric quantum systems are endowed with stationary
superposition or superposition-free properties. A physical interpretation of
$\eta$-inner product in $\mathbb C^2$ is given through the Stokes parameters,
showing the difference between broken and unbroken $\cal PT$-symmetric quantum
systems.
| quant-ph math-ph math.MP | through the etainner product we investigate cal ptsymmetric quantum mechanics from the viewpoint of superposition and coherence theory it is argued that cal ptsymmetric quantum systems are endowed with stationary superposition or superpositionfree properties a physical interpretation of etainner product in mathbb c2 is given through the stokes parameters showing the difference between broken and unbroken cal ptsymmetric quantum systems | [['through', 'the', 'etainner', 'product', 'we', 'investigate', 'cal', 'ptsymmetric', 'quantum', 'mechanics', 'from', 'the', 'viewpoint', 'of', 'superposition', 'and', 'coherence', 'theory', 'it', 'is', 'argued', 'that', 'cal', 'ptsymmetric', 'quantum', 'systems', 'are', 'endowed', 'with', 'stationary', 'superposition', 'or', 'superpositionfree', 'properties', 'a', 'physical', 'interpretation', 'of', 'etainner', 'product', 'in', 'mathbb', 'c2', 'is', 'given', 'through', 'the', 'stokes', 'parameters', 'showing', 'the', 'difference', 'between', 'broken', 'and', 'unbroken', 'cal', 'ptsymmetric', 'quantum', 'systems']] | [-0.16050977433884614, 0.19037260682109677, -0.051412520039695916, 0.017443005391805058, 0.0023048240037863714, -0.20648623474367095, -0.05803217071214724, 0.36193469604640677, -0.2531556444928834, -0.2196392797244092, 0.054133675663666635, -0.2858489970431516, -0.2032031381641629, 0.1165942330722158, -0.07367646904956353, 0.12401924955478885, 0.005471647455634778, 0.05543695040570017, -0.1451381409679654, -0.13200329345438563, 0.31878701023136574, -0.06302124567191002, 0.2549866131882657, 0.007784960448349777, 0.07329581819858663, 0.011070365257757274, 0.08457181680530898, -0.012100458226836565, -0.11136562068879771, 0.07252888786688186, 0.21657858537346647, 0.14038411318732982, 0.16825671507078305, -0.42787926621212247, -0.22256679234928206, 0.13247884636777535, 0.12989355336972758, 0.06086288657235472, 0.00904131509984533, -0.3608453782569421, 0.011873082045400352, -0.1795184406239474, -0.16281126177739025, -0.06527769544341586, 0.09056196348708972, -0.06366290129198317, -0.2429124090428415, 0.07007669969543553, 0.03695852830066558, 0.08849937282502651, -0.0017301841769694236, 0.01034692986950017, -0.09619739373917119, 0.02221023147157802, -0.027311676114454474, -0.022207063688128664, 0.1096535095405814, -0.07323842255496665, -0.14664335466365805, 0.4642851382101837, -0.005050672169186567, -0.22979964711294884, 0.15456125803553222, -0.12737883573496028, -0.10271530917012378, 0.09294611642039136, 0.09369675078216874, 0.0855784397572279, -0.03951418811553403, 0.19600414637304647, -0.0475228711831988, 0.16466747971635573, 0.06197208178376681, 0.154049066099616, 0.2491875541184032, 0.06652042916730831, 0.0073220461296538515, 0.17079030874332315, 0.08110131911541286, -0.25969123938365984, -0.41035339863676773, -0.14664786536115826, -0.23076244224712514, 0.17671226785240465, -0.07582552268592592, -0.1474827722924059, 0.3397440458076042, 0.06577856464540227, 0.16778450202719683, -0.01246106225114904, 0.19919061010474698, 0.2025452356197332, 0.010157607675513677, 0.047532847469770594, 0.24853757144719885, 0.24300687333054252, 0.04865060029387997, -0.26349282057612744, -0.04455376496505842, 0.08900949049316216] |
1,802.00481 | Presqu'un immeuble pour le groupe des automorphismes mod\'er\'es | Inspired by the Bruhat-Tits building of SL$_n$($\mathbb Q_p$), we construct a
complete metric space X with an action of the tame automorphism group of the
affine space Tame($K^n$). The points in X are certain monomial valuations, and
X admits a natural structure of Euclidean CW-complex of dimension n-1. When n =
3, and for K of characteristic zero, we prove that X has non-positive curvature
and is simply connected, hence is a CAT(0) space. As an application we obtain
the linearizability of finite subgroups in Tame($K^3$).
| math.GR math.AG math.GT | inspired by the bruhattits building of sl_nmathbb q_p we construct a complete metric space x with an action of the tame automorphism group of the affine space tamekn the points in x are certain monomial valuations and x admits a natural structure of euclidean cwcomplex of dimension n1 when n 3 and for k of characteristic zero we prove that x has nonpositive curvature and is simply connected hence is a cat0 space as an application we obtain the linearizability of finite subgroups in tamek3 | [['inspired', 'by', 'the', 'bruhattits', 'building', 'of', 'sl_nmathbb', 'q_p', 'we', 'construct', 'a', 'complete', 'metric', 'space', 'x', 'with', 'an', 'action', 'of', 'the', 'tame', 'automorphism', 'group', 'of', 'the', 'affine', 'space', 'tamekn', 'the', 'points', 'in', 'x', 'are', 'certain', 'monomial', 'valuations', 'and', 'x', 'admits', 'a', 'natural', 'structure', 'of', 'euclidean', 'cwcomplex', 'of', 'dimension', 'n1', 'when', 'n', '3', 'and', 'for', 'k', 'of', 'characteristic', 'zero', 'we', 'prove', 'that', 'x', 'has', 'nonpositive', 'curvature', 'and', 'is', 'simply', 'connected', 'hence', 'is', 'a', 'cat0', 'space', 'as', 'an', 'application', 'we', 'obtain', 'the', 'linearizability', 'of', 'finite', 'subgroups', 'in', 'tamek3']] | [-0.22749825898019305, 0.12046238499537884, -0.10358101549188056, 0.025326970866488583, -0.11227658540795905, -0.12966748868418207, 0.006956912509827729, 0.37833319178008173, -0.324184712112309, -0.16313152354075966, 0.10713256405475717, -0.26744705780846884, -0.1416587022733482, 0.15406232825564556, -0.15420741305114274, -0.0458232844023999, -0.02691137869225209, 0.1679337900356356, -0.10706395902446504, -0.3403186399282057, 0.4244243815002671, -0.07284444038116608, 0.2178636417914945, 0.024186491921364545, 0.18014930528644696, 0.02270922866504056, 0.02014890999858638, 0.02199445935758672, -0.15247957505110765, 0.11447563391257391, 0.30322790457810983, 0.09133195275642786, 0.2173453553955643, -0.33594367823686944, -0.20171722721488003, 0.2489972415840231, 0.12306653412412404, -0.045373632202306426, -0.0096356725707336, -0.2594826580193567, 0.13788053604314127, -0.11327990934432271, -0.1899424509526825, -0.08234365635652499, 0.10860501004786915, -0.044745743196143446, -0.25918845752470127, -0.04435292385092162, 0.11735910424087422, 0.14996620556002999, -0.0504636941309345, -0.09312863822420497, -0.09928226257191904, 0.09147264018510357, -0.03476378715496106, 0.12267058265833072, 0.07897459702700915, -0.051693338777376224, -0.11009598485227809, 0.4015493961163314, -0.07996004896732159, -0.23854279367769338, 0.10309041339724538, -0.1845102748968246, -0.14112007106845098, 0.13910440181617637, 0.09840610846652682, 0.18219639562317227, 0.009180186530792559, 0.29614206105933516, -0.12884711678397942, 0.0729305366200047, 0.06977003345445516, -0.004947191024344998, 0.08745541569148471, 0.14145234235876566, 0.15508664333183003, 0.1287309215460197, 0.03049020917457809, 0.027990306626601392, -0.38405612604804784, -0.21509299955207362, -0.14428261030151182, 0.17800263306182101, -0.1880153129937994, -0.19373939320983657, 0.3266303988835628, 0.02746893832437604, 0.21823034939883523, 0.13213400537125677, 0.195633267355432, 0.022527293283885055, 0.023882525153906948, 0.08761051813202225, 0.048911889605448546, 0.17962843729800218, -0.10723262803112886, -0.11626817761774523, -0.041989034148359514, 0.21175819523183695] |
1,802.00482 | MALS-NOT: Identifying Radio-Bright Quasars for the MeerKAT Absorption
Line Survey | We present a preparatory spectroscopic survey to identify radio-bright,
high-redshift quasars for the MeerKAT Absorption Line Survey (MALS). The
candidates have been selected on the basis of a single flux density limit at
1.4 GHz (>200 mJy) together with mid-infrared color criteria from the
Wide-field Infrared Survey Explorer (WISE). Through spectroscopic observations
using the Nordic Optical Telescope, we identify 72 quasars out of 99 candidates
targeted. We measure the spectroscopic redshifts based on characteristic, broad
emission lines present in the spectra. Of these 72 quasars, 64 and 48 objects
are at sufficiently high redshift (z>0.6 and z>1.4) to be used for the L-band
and UHF-band spectroscopic follow-up with the Square Kilometre Array (SKA)
precursor in South Africa: the MeerKAT.
| astro-ph.GA | we present a preparatory spectroscopic survey to identify radiobright highredshift quasars for the meerkat absorption line survey mals the candidates have been selected on the basis of a single flux density limit at 14 ghz 200 mjy together with midinfrared color criteria from the widefield infrared survey explorer wise through spectroscopic observations using the nordic optical telescope we identify 72 quasars out of 99 candidates targeted we measure the spectroscopic redshifts based on characteristic broad emission lines present in the spectra of these 72 quasars 64 and 48 objects are at sufficiently high redshift z06 and z14 to be used for the lband and uhfband spectroscopic followup with the square kilometre array ska precursor in south africa the meerkat | [['we', 'present', 'a', 'preparatory', 'spectroscopic', 'survey', 'to', 'identify', 'radiobright', 'highredshift', 'quasars', 'for', 'the', 'meerkat', 'absorption', 'line', 'survey', 'mals', 'the', 'candidates', 'have', 'been', 'selected', 'on', 'the', 'basis', 'of', 'a', 'single', 'flux', 'density', 'limit', 'at', '14', 'ghz', '200', 'mjy', 'together', 'with', 'midinfrared', 'color', 'criteria', 'from', 'the', 'widefield', 'infrared', 'survey', 'explorer', 'wise', 'through', 'spectroscopic', 'observations', 'using', 'the', 'nordic', 'optical', 'telescope', 'we', 'identify', '72', 'quasars', 'out', 'of', '99', 'candidates', 'targeted', 'we', 'measure', 'the', 'spectroscopic', 'redshifts', 'based', 'on', 'characteristic', 'broad', 'emission', 'lines', 'present', 'in', 'the', 'spectra', 'of', 'these', '72', 'quasars', '64', 'and', '48', 'objects', 'are', 'at', 'sufficiently', 'high', 'redshift', 'z06', 'and', 'z14', 'to', 'be', 'used', 'for', 'the', 'lband', 'and', 'uhfband', 'spectroscopic', 'followup', 'with', 'the', 'square', 'kilometre', 'array', 'ska', 'precursor', 'in', 'south', 'africa', 'the', 'meerkat']] | [-0.03707255977127007, 0.06022019903333384, -0.019528945426503987, 0.05350008343299061, -0.1418717057538866, -0.0875072367252561, 0.10993661958392772, 0.5017714713526479, -0.068791724938773, -0.3480625037435379, 0.16250067310601618, -0.3769728056455063, -0.008136934648125859, 0.19017149611194697, 0.05105010216258529, -0.024613285115604306, 0.0493931204477183, -0.2113606453857432, 0.04284731474010988, -0.3183121951849405, 0.18919763941380938, 0.17029920918077734, 0.23429064155098492, -0.08228473855139119, 0.11835617400011268, -0.10728292722823256, -0.17592862268152126, -0.024893567565891703, -0.17554016519037974, -0.00023992348193996034, 0.35071542070412975, 0.15916592433409354, 0.23400137997607273, -0.25323425448831105, -0.14445400966520786, 0.0686878742002961, 0.1596450589526192, 0.033043532766464906, -0.00691211259513462, -0.34449610367843536, 0.05688179654100815, -0.1514768222962522, -0.20854864615189322, 0.053576761635683354, -0.0012296315487789905, 0.11886763231734097, -0.15975196010105597, 0.07977431503684908, -0.1381975235664128, 0.20130869754100755, -0.16494751729118495, -0.1615310175959968, -0.03212252063420207, 0.06877987162146906, -0.1403957273992631, 0.08902936185990318, 0.11958575016282247, -0.14755100741098492, -0.046444038813144475, 0.34590173672521646, -0.098052121623877, 0.12867142293223385, 0.17187436002353995, -0.23908758210215592, -0.25344257134060233, 0.19637392877139373, 0.1820691333436486, 0.10819136405016407, -0.1797225223696333, -0.019024203390117844, -0.013162207652585802, 0.2812348983380786, 0.02749930287048347, 0.1429873515784709, 0.38864269458010037, 0.08645894131238446, 0.062098014276964056, 0.13853577279852766, -0.39080724681696016, 0.08834208465591704, -0.2793074829397344, -0.05503824613031426, -0.15028147207636197, 0.1585072474021433, -0.08000614675182664, -0.08684479946791494, 0.36387977249509956, 0.1310672470984065, 0.16530535739878097, 0.07079994213625283, 0.26487501573322686, 0.0017873959899958917, 0.1762779862676356, 0.01196900854218688, 0.36774409655481577, 0.1281245434696202, 0.12533857802844653, -0.15449650722390074, -0.08574360850961658, -0.0036689297461850665] |
1,802.00483 | Completing the Structural Analysis of the 2x4 Permutation Classes | We study the structure and enumeration of the final two 2x4 permutation
classes, completing a research program that has spanned almost two decades. For
both classes, careful structural analysis produces a complicated functional
equation. One of these equations is solved with the guess-and-check paradigm,
while the other is solved with kernel method-like techniques and Gr\"obner
basis calculations.
| math.CO | we study the structure and enumeration of the final two 2x4 permutation classes completing a research program that has spanned almost two decades for both classes careful structural analysis produces a complicated functional equation one of these equations is solved with the guessandcheck paradigm while the other is solved with kernel methodlike techniques and grobner basis calculations | [['we', 'study', 'the', 'structure', 'and', 'enumeration', 'of', 'the', 'final', 'two', '2x4', 'permutation', 'classes', 'completing', 'a', 'research', 'program', 'that', 'has', 'spanned', 'almost', 'two', 'decades', 'for', 'both', 'classes', 'careful', 'structural', 'analysis', 'produces', 'a', 'complicated', 'functional', 'equation', 'one', 'of', 'these', 'equations', 'is', 'solved', 'with', 'the', 'guessandcheck', 'paradigm', 'while', 'the', 'other', 'is', 'solved', 'with', 'kernel', 'methodlike', 'techniques', 'and', 'grobner', 'basis', 'calculations']] | [-0.14044760091097228, 0.051975076336280575, -0.09582878788933158, 0.04264075103232504, -0.0923329604556784, -0.150438874660592, -0.002821514819515869, 0.35787375717024716, -0.29299290840780096, -0.310605571405696, 0.12931019013714312, -0.2694599204031484, -0.15619443100877106, 0.22362692632097086, 0.05162071058501689, 0.07782293114412044, 0.13232679650952509, -0.029115311186095432, -0.16275752312087985, -0.2827045259805995, 0.3281399247436119, 0.0011342789844742843, 0.2593764114426449, -0.014764510207377108, 0.0896135508498576, 0.02990802235269387, -0.08350790641270578, 0.04389468585473618, -0.11695356936940828, 0.15137458835462375, 0.27780246471853126, 0.18307700909541122, 0.29788473824321826, -0.42242274851638023, -0.18537335252871603, 0.10349213721929118, 0.11411811308270055, 0.11035468811418728, -0.030561597369212126, -0.20526871486799791, 0.05536069837398827, -0.12284490496053227, -0.1223924614938109, -0.11491365790633219, -0.010836025749865388, -0.031096410078004868, -0.21573984694155765, 0.010541513129802687, 0.08421197465421366, 0.07639151580730998, -0.0775513151976546, -0.17093347217555024, -0.002677288925042376, 0.08817561344143801, 0.03289897326197076, 0.044401167875288854, 0.06032714275144307, -0.10685682135850325, -0.14316520122312276, 0.3622680749478085, 0.019853135870237435, -0.1959723381857787, 0.17307916562172718, -0.10559697718625623, -0.1942493993556127, 0.12183047009498946, 0.09585177915037743, 0.14237263478610526, -0.161006496272291, 0.1296014890852218, -0.07179666538390198, 0.1394434130218412, 0.0686751828928079, -0.03631114594671609, 0.12967036548902147, 0.18674820363854192, 0.04133061449309545, 0.12531273986782512, -0.007647846983413079, -0.1371297379290419, -0.2458037650877876, -0.13835737566530174, -0.13932449528614857, 0.022518475700053386, -0.07156021560357269, -0.17293263499491981, 0.4532197001390159, 0.055501966446172446, 0.1352791675599292, 0.03844928696552025, 0.2796546905945953, 0.1305759421915614, 0.08562481160541731, 0.07493755189768438, 0.16242808222679223, 0.16227782364668591, 0.026508664816252088, -0.1954856745412274, 0.06807576413432669, 0.1566817941410201] |
1,802.00484 | Alternative Spreadsheet Model Designs for an Operations Management Model
Embedded in a Periodic Business Process | We present a widely-used operations management model used in supply and
distribution planning, that is typically embedded in a periodic business
process that necessitates model modification and reuse. We consider three
alternative spreadsheet implementations, a data-driven design, a canonical
(textbook) design, and a novel (table-driven) technical design. We evaluate
each regarding suitability for accuracy, modification, analysis, and transfer.
We consider the degree of training and technical sophistication required to
utilize each design. The data-driven design provides insight into poor
spreadsheet practices by na\"ive modelers. The technical design can be modified
for new data and new structural elements without manual writing or editing of
cell formulas, thus speeding modification and reducing risk of error. The
technical design has potential for use with other classes of models. We
identify opportunities for future research.
| cs.SE | we present a widelyused operations management model used in supply and distribution planning that is typically embedded in a periodic business process that necessitates model modification and reuse we consider three alternative spreadsheet implementations a datadriven design a canonical textbook design and a novel tabledriven technical design we evaluate each regarding suitability for accuracy modification analysis and transfer we consider the degree of training and technical sophistication required to utilize each design the datadriven design provides insight into poor spreadsheet practices by naive modelers the technical design can be modified for new data and new structural elements without manual writing or editing of cell formulas thus speeding modification and reducing risk of error the technical design has potential for use with other classes of models we identify opportunities for future research | [['we', 'present', 'a', 'widelyused', 'operations', 'management', 'model', 'used', 'in', 'supply', 'and', 'distribution', 'planning', 'that', 'is', 'typically', 'embedded', 'in', 'a', 'periodic', 'business', 'process', 'that', 'necessitates', 'model', 'modification', 'and', 'reuse', 'we', 'consider', 'three', 'alternative', 'spreadsheet', 'implementations', 'a', 'datadriven', 'design', 'a', 'canonical', 'textbook', 'design', 'and', 'a', 'novel', 'tabledriven', 'technical', 'design', 'we', 'evaluate', 'each', 'regarding', 'suitability', 'for', 'accuracy', 'modification', 'analysis', 'and', 'transfer', 'we', 'consider', 'the', 'degree', 'of', 'training', 'and', 'technical', 'sophistication', 'required', 'to', 'utilize', 'each', 'design', 'the', 'datadriven', 'design', 'provides', 'insight', 'into', 'poor', 'spreadsheet', 'practices', 'by', 'naive', 'modelers', 'the', 'technical', 'design', 'can', 'be', 'modified', 'for', 'new', 'data', 'and', 'new', 'structural', 'elements', 'without', 'manual', 'writing', 'or', 'editing', 'of', 'cell', 'formulas', 'thus', 'speeding', 'modification', 'and', 'reducing', 'risk', 'of', 'error', 'the', 'technical', 'design', 'has', 'potential', 'for', 'use', 'with', 'other', 'classes', 'of', 'models', 'we', 'identify', 'opportunities', 'for', 'future', 'research']] | [-0.06604070696227539, 0.010724216162298735, -0.06457441303735742, 0.06025510975659227, -0.15983110341744927, -0.1831491947138252, 0.09319653892173217, 0.409193090048547, -0.245158912284443, -0.33797150927309233, 0.10001420207733575, -0.21841542952908918, -0.16822653194495404, 0.2090407421722865, -0.14043335663456954, 0.08116630241274833, 0.0994925463769155, -0.05368163896581302, -0.08057474661618472, -0.22270619260827795, 0.2919052723884726, 0.08073688338582333, 0.3278088654104907, 0.05220817747490051, 0.05643443227835143, 0.027605323353782296, -0.06379477126308931, -0.042604130658750926, -0.1211318580669915, 0.19494278313359245, 0.2975465962532606, 0.2530554649348442, 0.37265843850954505, -0.45130198394718507, -0.20635656122691357, 0.05586930010825969, 0.11769836469768331, 0.09371947614977566, -0.10272501829939966, -0.21044627995445178, 0.06247104007264939, -0.21758074663823487, -0.12628697456720356, -0.1707391024638827, -0.04602227185924466, -0.00772255640835143, -0.2944680680449192, -0.03666535080052339, 0.062152478092600806, 0.09692135573579715, -0.013161627661723357, -0.17652821500714008, 0.05587438069140682, 0.18903408132027835, -0.0016153734090039507, -0.01130472061295922, 0.15197915264691872, -0.13003419626704552, -0.16448282349783067, 0.4007867492448825, -0.010851610562979029, -0.22560361366396628, 0.1540316580938032, -0.0035688797728373454, -0.18248546175801983, 0.08594788368791342, 0.24449864564141116, 0.026586080915652788, -0.21197812234123165, 0.04076085063458707, 0.08836596616310999, 0.17891354295783318, 0.05217984505893233, 0.00459665974172262, 0.17615861353607706, 0.2775514503224538, 0.05979051139169874, 0.1569278955741678, -0.040835303519494257, -0.08815719049173193, -0.2923740588271847, -0.17674743980527496, -0.09535626143288727, 0.03128578796749935, -0.08759922794202933, -0.1599246112486491, 0.4091788282376141, 0.22759771761484443, 0.11550638117970756, 0.044850813421922237, 0.36316780996276066, 0.04082645464401979, 0.1023678132189581, 0.06839462771223714, 0.14061281556585947, -0.010116247239504725, 0.11125119410168666, -0.1687270450978898, 0.10922833977696987, 0.015319697390525387] |
1,802.00485 | Investigation of the Electronical and Optical Properties of Quantum Well
Lasers with Slightly Doped Tunnel Junction | We experimentally investigate and analyze the electrical and optical
characteristics of GaAs-based conventional quantum well laser diodes and the
quantum well laser diodes with slightly-doped tunnel junction. It was found
that TJ LD show a nonlinear S-shape I-V characteristic.It was also found that
the internal quantum efficiency measured by 21% and 87.3% for the TJ LD and the
conventional LD, respectively. Furthermore, compared with the conventional LD,
it was found that we could achieve 15 nm broadband spectrum from the TJ LD due
to lasing dynamics reflects the current dynamics. The results may also lead to
the realization of more applications.
| physics.app-ph physics.optics | we experimentally investigate and analyze the electrical and optical characteristics of gaasbased conventional quantum well laser diodes and the quantum well laser diodes with slightlydoped tunnel junction it was found that tj ld show a nonlinear sshape iv characteristicit was also found that the internal quantum efficiency measured by 21 and 873 for the tj ld and the conventional ld respectively furthermore compared with the conventional ld it was found that we could achieve 15 nm broadband spectrum from the tj ld due to lasing dynamics reflects the current dynamics the results may also lead to the realization of more applications | [['we', 'experimentally', 'investigate', 'and', 'analyze', 'the', 'electrical', 'and', 'optical', 'characteristics', 'of', 'gaasbased', 'conventional', 'quantum', 'well', 'laser', 'diodes', 'and', 'the', 'quantum', 'well', 'laser', 'diodes', 'with', 'slightlydoped', 'tunnel', 'junction', 'it', 'was', 'found', 'that', 'tj', 'ld', 'show', 'a', 'nonlinear', 'sshape', 'iv', 'characteristicit', 'was', 'also', 'found', 'that', 'the', 'internal', 'quantum', 'efficiency', 'measured', 'by', '21', 'and', '873', 'for', 'the', 'tj', 'ld', 'and', 'the', 'conventional', 'ld', 'respectively', 'furthermore', 'compared', 'with', 'the', 'conventional', 'ld', 'it', 'was', 'found', 'that', 'we', 'could', 'achieve', '15', 'nm', 'broadband', 'spectrum', 'from', 'the', 'tj', 'ld', 'due', 'to', 'lasing', 'dynamics', 'reflects', 'the', 'current', 'dynamics', 'the', 'results', 'may', 'also', 'lead', 'to', 'the', 'realization', 'of', 'more', 'applications']] | [-0.07775783218326979, 0.14317909775767476, -0.04389433473814279, 0.057643225744832306, 0.016342101488262414, -0.20111927940975874, 0.06265954298665748, 0.4170339188911021, -0.2199388540815562, -0.2933295530453324, 0.03970690639689565, -0.2935078670270741, -0.16280475687235593, 0.24027192290872335, -0.035858269408345224, 0.053929541506804526, -0.008652479172451422, -0.059163140883902086, -0.040284699217882004, -0.17459674726240337, 0.19361934211105108, 0.07632844394538552, 0.3654451591148973, 0.07905083539895713, 0.06945888242218644, -0.016310606073820965, 0.04545484303496778, 0.0308117844350636, -0.1321394462731405, 0.060608234629034995, 0.21355839915573596, -0.008037848779931665, 0.13935015950351953, -0.38052678652107713, -0.23986667760647834, 0.00986693893559277, 0.1251102628465742, 0.13716533774510026, -0.0019249360293906647, -0.2574962807819247, 0.09844204908935353, -0.1686437789630145, -0.09699645329965279, -0.029821837283670903, 0.006490599140524864, 0.038391140261664986, -0.24332273430423812, 0.02884859666635748, 0.03691715496825054, 0.052576822228729725, -0.013165918458253146, -0.12823404464579652, -0.050505089801736174, 0.03628397109452635, -0.04831728411372751, 0.028860452133230866, 0.16146231605671346, -0.11350510430987924, -0.1515502211637795, 0.38141591850668194, -0.0778751511219889, -0.07580081982538105, 0.19641839593998156, -0.17139089500997215, 0.00557730162050575, 0.12017092683818191, 0.05370724918670021, 0.05721550607588142, -0.15252028224989772, 0.06655823395296466, 0.022579761007800698, 0.22997313526459037, 0.06923762599006295, 0.09634485098998993, 0.1890520265698433, 0.18089923277380876, -0.007804831508547067, 0.15745717702549883, -0.1638270396599546, -0.0999918587366119, -0.19720290603116156, -0.14593673928175122, -0.1474370709946379, 0.1104626650060527, -0.0535861551684502, -0.11332777817733586, 0.39538921090774237, 0.16533448691130614, 0.1600607439223677, 0.012108321795240044, 0.2660197675973177, 0.16839849061332643, 0.08053104570135475, 0.035069853332825, 0.31513800017535687, 0.14874322390416636, 0.14864457791671157, -0.31016846270067616, 0.03256660042679869, -0.039400243032723666] |
1,802.00486 | ALMA [CI] observations toward the central region of a Seyfert galaxy NGC
613 | We report ALMA observations of [CI]($^3P_1-^3P_0$), C$^{13}$O, and CO$^{18}$
($J=1-0$) toward the central region of a nearby Seyfert galaxy NGC 613. The
very high resolutions of $0.26"\times0.23"(=22\times20$ pc) for [CI] and
$0.42"\times0.35"(=36\times30$ pc) for C$^{13}$O, and CO$^{18}$ resolve the
circum-nuclear disk (CND) and star-forming ring. The distribution of [CI] in
the ring resembles that of the CO emission, although [CI] is prominent in the
CND. This can be caused by the low intensities of the CO isotopes due to the
low optical depths under the high temperature in the CND. We found that the
intensity ratios of [CI] to C$^{12}$O(3-2) ($R_{\rm CI/CO}$) and to
C$^{13}$O(1-0) ($R_{\rm CI/C^{13}O}$) are high at several positions around the
edge of the ring. The spectral profiles of CO lines mostly correspond each
other in the spots of the ring and high $R_{\rm CI/CO}$, but those of [CI] at
spots of high $R_{\rm CI/CO}$ are different from CO. These results indicate
that [CI] at the high $R_{\rm CI/CO}$ traces different gas from that traced by
the CO lines. The [CI] kinematics along the minor axis of NGC 613 could be
interpreted as a bubbly molecular outflow. The outflow rate of molecular gas is
higher than star formation rate in the CND. The flow could be mainly boosted by
the AGN through its radio jets.
| astro-ph.GA | we report alma observations of ci3p_13p_0 c13o and co18 j10 toward the central region of a nearby seyfert galaxy ngc 613 the very high resolutions of 026times02322times20 pc for ci and 042times03536times30 pc for c13o and co18 resolve the circumnuclear disk cnd and starforming ring the distribution of ci in the ring resembles that of the co emission although ci is prominent in the cnd this can be caused by the low intensities of the co isotopes due to the low optical depths under the high temperature in the cnd we found that the intensity ratios of ci to c12o32 r_rm cico and to c13o10 r_rm cic13o are high at several positions around the edge of the ring the spectral profiles of co lines mostly correspond each other in the spots of the ring and high r_rm cico but those of ci at spots of high r_rm cico are different from co these results indicate that ci at the high r_rm cico traces different gas from that traced by the co lines the ci kinematics along the minor axis of ngc 613 could be interpreted as a bubbly molecular outflow the outflow rate of molecular gas is higher than star formation rate in the cnd the flow could be mainly boosted by the agn through its radio jets | [['we', 'report', 'alma', 'observations', 'of', 'ci3p_13p_0', 'c13o', 'and', 'co18', 'j10', 'toward', 'the', 'central', 'region', 'of', 'a', 'nearby', 'seyfert', 'galaxy', 'ngc', '613', 'the', 'very', 'high', 'resolutions', 'of', '026times02322times20', 'pc', 'for', 'ci', 'and', '042times03536times30', 'pc', 'for', 'c13o', 'and', 'co18', 'resolve', 'the', 'circumnuclear', 'disk', 'cnd', 'and', 'starforming', 'ring', 'the', 'distribution', 'of', 'ci', 'in', 'the', 'ring', 'resembles', 'that', 'of', 'the', 'co', 'emission', 'although', 'ci', 'is', 'prominent', 'in', 'the', 'cnd', 'this', 'can', 'be', 'caused', 'by', 'the', 'low', 'intensities', 'of', 'the', 'co', 'isotopes', 'due', 'to', 'the', 'low', 'optical', 'depths', 'under', 'the', 'high', 'temperature', 'in', 'the', 'cnd', 'we', 'found', 'that', 'the', 'intensity', 'ratios', 'of', 'ci', 'to', 'c12o32', 'r_rm', 'cico', 'and', 'to', 'c13o10', 'r_rm', 'cic13o', 'are', 'high', 'at', 'several', 'positions', 'around', 'the', 'edge', 'of', 'the', 'ring', 'the', 'spectral', 'profiles', 'of', 'co', 'lines', 'mostly', 'correspond', 'each', 'other', 'in', 'the', 'spots', 'of', 'the', 'ring', 'and', 'high', 'r_rm', 'cico', 'but', 'those', 'of', 'ci', 'at', 'spots', 'of', 'high', 'r_rm', 'cico', 'are', 'different', 'from', 'co', 'these', 'results', 'indicate', 'that', 'ci', 'at', 'the', 'high', 'r_rm', 'cico', 'traces', 'different', 'gas', 'from', 'that', 'traced', 'by', 'the', 'co', 'lines', 'the', 'ci', 'kinematics', 'along', 'the', 'minor', 'axis', 'of', 'ngc', '613', 'could', 'be', 'interpreted', 'as', 'a', 'bubbly', 'molecular', 'outflow', 'the', 'outflow', 'rate', 'of', 'molecular', 'gas', 'is', 'higher', 'than', 'star', 'formation', 'rate', 'in', 'the', 'cnd', 'the', 'flow', 'could', 'be', 'mainly', 'boosted', 'by', 'the', 'agn', 'through', 'its', 'radio', 'jets']] | [-0.08722894680831118, 0.028933464783426534, -0.005586477132451734, 0.036545721905943206, 0.02451222045257973, -0.08495044441220827, 0.02608323114830555, 0.4515828805391868, -0.18152207645756677, -0.27342843118181637, 0.06436770964295795, -0.26899326931346546, 0.033042527138117395, 0.15819969649301868, 0.013974778686007307, -0.0775641570111144, 0.005939787265991694, -0.10212712216248923, -0.061047496377717725, -0.16736437261559106, 0.29828775387578177, 0.1583389593823033, 0.16142629284264617, 0.0738184053757736, 0.018433166625486178, -0.16028110083174762, -0.032738787503066386, -0.005086742849512534, -0.10315496641454626, 0.0919324926336844, 0.2575133119478073, 0.09784520045145634, 0.1938705776405769, -0.3846465007170286, -0.1743901224815817, 0.01644756996326826, 0.19516112579647718, 0.02098142157050304, 0.03031063275456286, -0.27319031173996094, 0.10239527695344396, -0.18983403517993871, -0.1737983047975557, 0.0924474695300835, 0.06914322129918628, 0.0776900485576839, -0.2056531951624597, 0.15082666068894868, 0.007983479057839719, 0.1411143327867122, -0.07727706574714568, -0.13757352516696783, -0.11652434109732437, 0.05105120601950204, 0.005703127530791115, 0.09127421075094973, 0.26827229087967336, -0.11604250890523658, -0.005885649338792385, 0.4323127633684792, -0.09582726581783299, 0.008115219651904117, 0.2810993485339877, -0.27318289948841246, -0.19183554290459628, 0.21982708854966188, 0.11602904562477433, 0.11397191612985716, -0.062359193859008615, -0.030580056217692917, -0.05784332504580644, 0.20420231041052872, 0.07811943665325072, 0.06237621408277002, 0.33986984460021963, 0.026403781896653145, 0.024260362748916676, 0.09505110319049886, -0.2736535904590379, -0.05806720635127365, -0.20821419339092298, -0.1252394561125545, -0.12680829898788457, 0.0584679049176262, -0.17399791694142072, -0.040912230828978595, 0.32203968205716477, 0.07803387232177722, 0.29589394877473135, -0.03264172380103877, 0.29815886953943654, 0.09081488441281538, 0.11311030476331782, 0.1404370905020448, 0.29886625202274636, 0.16223953115201276, 0.09977167444838363, -0.2810031943308394, 0.0851384785536534, -0.009153530866121562] |
1,802.00487 | Krasovskii-Subbotin approach to mean field type differential games | A mean field type differential game is a mathematical model of a large system
of identical agents under mean-field interaction controlled by two players with
opposite purposes. We study the case when the dynamics of each agent is given
by ODE and the players can observe the distribution of the agents. We construct
suboptimal strategies and prove the existence of the value function.
| math.OC | a mean field type differential game is a mathematical model of a large system of identical agents under meanfield interaction controlled by two players with opposite purposes we study the case when the dynamics of each agent is given by ode and the players can observe the distribution of the agents we construct suboptimal strategies and prove the existence of the value function | [['a', 'mean', 'field', 'type', 'differential', 'game', 'is', 'a', 'mathematical', 'model', 'of', 'a', 'large', 'system', 'of', 'identical', 'agents', 'under', 'meanfield', 'interaction', 'controlled', 'by', 'two', 'players', 'with', 'opposite', 'purposes', 'we', 'study', 'the', 'case', 'when', 'the', 'dynamics', 'of', 'each', 'agent', 'is', 'given', 'by', 'ode', 'and', 'the', 'players', 'can', 'observe', 'the', 'distribution', 'of', 'the', 'agents', 'we', 'construct', 'suboptimal', 'strategies', 'and', 'prove', 'the', 'existence', 'of', 'the', 'value', 'function']] | [-0.1587815530420769, 0.07962723661007153, -0.11967711841007547, 0.06703146646494075, -0.027191204706295616, -0.201697379890238, 0.056221162785761176, 0.3545873095798824, -0.27844989530387376, -0.28864653866797213, 0.06217476762535553, -0.26119343947530504, -0.16727842306274743, 0.07983913786694526, -0.08632176873525457, -0.006432306110149338, 0.06882382725321111, 0.08153997271114753, 0.030979038378785528, -0.264364188625699, 0.37633461931291673, -0.04112303125420733, 0.23762843209422296, -0.04146463467484517, 0.16614035487411513, 0.04730924789143342, 0.04329418328901132, 0.0645206378447631, -0.15466161347216084, 0.0629601481274539, 0.23058571091516772, 0.10340182575958944, 0.38505636616831734, -0.4196962624906547, -0.1362243996903537, 0.15111816417248475, 0.09538672774261425, 0.139363832062199, -0.0011746316819289137, -0.2918967113512317, 0.058979513086674235, -0.16849270807800903, -0.14802384341046923, -0.02010778481111167, -0.010666855956457319, 0.10630856980643576, -0.3377968963117354, -0.006709928683463543, 0.022543997851215185, 0.0912949750052085, -0.08662008386593134, -0.10243586948074933, -0.011994098268804095, 0.1706430899290671, 0.0547101597194486, -0.027920121419435694, 0.14700448957996237, -0.18289914881137925, -0.15652725165562023, 0.3509878072118948, -0.0963775423348009, -0.2218308885773969, 0.15798495230930193, -0.13682306538675987, -0.05893973901217419, 0.09297159056194008, 0.1642856298546706, 0.14179827248500215, -0.16624253961402694, 0.06904807432355094, -0.09034775419249422, 0.17842876213410544, -0.0009276355646314129, -0.03383410921586411, 0.16202157899914754, 0.17615239527298227, 0.15064960491237422, 0.14361024888912363, 0.009691602276963375, -0.192984099972934, -0.2964209817527306, -0.13072909648338008, -0.1523951812395974, 0.04958127457500687, -0.11676040701226272, -0.1193933970560985, 0.38768886044503204, 0.120294241545101, 0.151508718610756, 0.08981144429731464, 0.27082104419195463, 0.16938166002491636, -0.017450329138054735, 0.0661260721879819, 0.2234572781663802, 0.0802633472577861, 0.08244512194678896, -0.24183173777742517, 0.13063954175745565, 0.06620268364407358] |
1,802.00488 | Prime spectra of abelian 2-categories and categorifications of
Richardson varieties | We describe a general framework for prime, completely prime, semiprime, and
primitive ideals of an abelian 2-category. This provides a noncommutative
version of Balmer's prime spectrum of a tensor triangulated category. These
notions are based on containment conditions in terms of thick subcategories of
an abelian category and thick ideals of an abelian 2-category. We prove
categorical analogs of the main properties of noncommutative prime spectra.
Similar notions, starting with Serre subcategories of an abelian category and
Serre ideals of an abelian 2-category, are developed. They are linked to Serre
prime spectra of $\mathbb{Z}_+$-rings. As an application, we construct a
categorification of the quantized coordinate rings of open Richardson varieties
for symmetric Kac-Moody groups, by constructing Serre completely prime ideals
of monoidal categories of modules of the KLR algebras, and by taking Serre
quotients with respect to them.
| math.CT math.RA math.RT | we describe a general framework for prime completely prime semiprime and primitive ideals of an abelian 2category this provides a noncommutative version of balmers prime spectrum of a tensor triangulated category these notions are based on containment conditions in terms of thick subcategories of an abelian category and thick ideals of an abelian 2category we prove categorical analogs of the main properties of noncommutative prime spectra similar notions starting with serre subcategories of an abelian category and serre ideals of an abelian 2category are developed they are linked to serre prime spectra of mathbbz_rings as an application we construct a categorification of the quantized coordinate rings of open richardson varieties for symmetric kacmoody groups by constructing serre completely prime ideals of monoidal categories of modules of the klr algebras and by taking serre quotients with respect to them | [['we', 'describe', 'a', 'general', 'framework', 'for', 'prime', 'completely', 'prime', 'semiprime', 'and', 'primitive', 'ideals', 'of', 'an', 'abelian', '2category', 'this', 'provides', 'a', 'noncommutative', 'version', 'of', 'balmers', 'prime', 'spectrum', 'of', 'a', 'tensor', 'triangulated', 'category', 'these', 'notions', 'are', 'based', 'on', 'containment', 'conditions', 'in', 'terms', 'of', 'thick', 'subcategories', 'of', 'an', 'abelian', 'category', 'and', 'thick', 'ideals', 'of', 'an', 'abelian', '2category', 'we', 'prove', 'categorical', 'analogs', 'of', 'the', 'main', 'properties', 'of', 'noncommutative', 'prime', 'spectra', 'similar', 'notions', 'starting', 'with', 'serre', 'subcategories', 'of', 'an', 'abelian', 'category', 'and', 'serre', 'ideals', 'of', 'an', 'abelian', '2category', 'are', 'developed', 'they', 'are', 'linked', 'to', 'serre', 'prime', 'spectra', 'of', 'mathbbz_rings', 'as', 'an', 'application', 'we', 'construct', 'a', 'categorification', 'of', 'the', 'quantized', 'coordinate', 'rings', 'of', 'open', 'richardson', 'varieties', 'for', 'symmetric', 'kacmoody', 'groups', 'by', 'constructing', 'serre', 'completely', 'prime', 'ideals', 'of', 'monoidal', 'categories', 'of', 'modules', 'of', 'the', 'klr', 'algebras', 'and', 'by', 'taking', 'serre', 'quotients', 'with', 'respect', 'to', 'them']] | [-0.18127229333223, 0.02678943010634253, -0.0864837274539971, 0.11548176977739255, -0.10610024493534363, -0.14932419261113353, -0.11065278491889038, 0.3318130605629761, -0.4221388502930203, -0.1700777528985118, 0.0545985181467526, -0.19590604449841142, -0.03165041147493315, 0.1693918625926123, -0.28565487059608213, -0.09577651059146236, 0.03505805263254982, 0.08184821965907069, -0.03304720293801876, -0.33141911456048706, 0.5266642694898548, 0.01597048183410245, 0.23487904722917907, -0.003096042200922966, 0.08691681081592276, -0.003114395140989745, -0.02980415602928422, -0.009672715151886436, -0.1644888639077884, 0.1581441096512832, 0.4041109881975627, 0.02225596234746223, 0.18305031061308444, -0.3870262987401853, 0.0028108106314265816, 0.19505581622059545, 0.12256454186255697, -0.009466873594036284, -0.03611951125836693, -0.3081358856297214, 0.14291149859119506, -0.3102783577509877, -0.1451068522347423, -0.11924131850909142, 0.1250547333790438, 0.025116093667482374, -0.26350908075207774, -0.08789638015203667, 0.12850255541415057, 0.25685029319168007, -0.13665551405032947, -0.10452564376029085, -0.05768593763048849, 0.06139474596325172, -0.08886151144240242, -0.07017192100752553, 0.09730626159367987, -0.14925823411496397, -0.19952521174058427, 0.3633972743566889, -0.018905155571435926, -0.1889562833116111, 0.10875671198013762, -0.13300603759359486, -0.14863131657229178, 0.13636394858489453, -0.03365506411931158, 0.16379225023607485, 0.011291450521752348, 0.19359615555774068, -0.24104450528686663, 0.014618542028359906, 0.12551434976252707, 0.05705821759409074, 0.2017361675915954, 0.08883767362248941, -0.03349510772683977, 0.17607631037745924, 0.06337241094748924, 0.021836460802540945, -0.38457493644452445, -0.18542863201200419, -0.026523652704038322, 0.18658680215913015, -0.07934125511096382, -0.20066979759454345, 0.4040932071252461, 0.093321545090336, 0.10703082383061371, 0.1767343943666694, 0.19690348902618662, -0.018140239172859837, 0.08078947815921729, 0.029545619319036712, 0.07529985949655835, 0.3731288906683071, -0.09638273086140517, -0.037303969666810474, -0.0992395785861533, 0.2851579095420502] |
1,802.00489 | Optimizing the signal-to-noise ratio of biphoton distribution
measurements | Single-photon-sensitive cameras can now be used as massively parallel
coincidence counters for entangled photon pairs. This enables measurement of
biphoton joint probability distributions with orders-of-magnitude greater
dimensionality and faster acquisition speeds than traditional raster scanning
of point detectors; to date, however, there has been no general formula
available to optimize data collection. Here we analyze the dependence of such
measurements on count rate, detector noise properties, and threshold levels. We
derive expressions for the biphoton joint probability distribution and its
signal-to-noise ratio (SNR), valid beyond the low-count regime up to detector
saturation. The analysis gives operating parameters for global optimum SNR that
may be specified prior to measurement. We find excellent agreement with
experimental measurements within the range of validity, and discuss
discrepancies with the theoretical model for high thresholds. This work enables
optimized measurement of the biphoton joint probability distribution in
high-dimensional joint Hilbert spaces.
| physics.ins-det physics.optics quant-ph | singlephotonsensitive cameras can now be used as massively parallel coincidence counters for entangled photon pairs this enables measurement of biphoton joint probability distributions with ordersofmagnitude greater dimensionality and faster acquisition speeds than traditional raster scanning of point detectors to date however there has been no general formula available to optimize data collection here we analyze the dependence of such measurements on count rate detector noise properties and threshold levels we derive expressions for the biphoton joint probability distribution and its signaltonoise ratio snr valid beyond the lowcount regime up to detector saturation the analysis gives operating parameters for global optimum snr that may be specified prior to measurement we find excellent agreement with experimental measurements within the range of validity and discuss discrepancies with the theoretical model for high thresholds this work enables optimized measurement of the biphoton joint probability distribution in highdimensional joint hilbert spaces | [['singlephotonsensitive', 'cameras', 'can', 'now', 'be', 'used', 'as', 'massively', 'parallel', 'coincidence', 'counters', 'for', 'entangled', 'photon', 'pairs', 'this', 'enables', 'measurement', 'of', 'biphoton', 'joint', 'probability', 'distributions', 'with', 'ordersofmagnitude', 'greater', 'dimensionality', 'and', 'faster', 'acquisition', 'speeds', 'than', 'traditional', 'raster', 'scanning', 'of', 'point', 'detectors', 'to', 'date', 'however', 'there', 'has', 'been', 'no', 'general', 'formula', 'available', 'to', 'optimize', 'data', 'collection', 'here', 'we', 'analyze', 'the', 'dependence', 'of', 'such', 'measurements', 'on', 'count', 'rate', 'detector', 'noise', 'properties', 'and', 'threshold', 'levels', 'we', 'derive', 'expressions', 'for', 'the', 'biphoton', 'joint', 'probability', 'distribution', 'and', 'its', 'signaltonoise', 'ratio', 'snr', 'valid', 'beyond', 'the', 'lowcount', 'regime', 'up', 'to', 'detector', 'saturation', 'the', 'analysis', 'gives', 'operating', 'parameters', 'for', 'global', 'optimum', 'snr', 'that', 'may', 'be', 'specified', 'prior', 'to', 'measurement', 'we', 'find', 'excellent', 'agreement', 'with', 'experimental', 'measurements', 'within', 'the', 'range', 'of', 'validity', 'and', 'discuss', 'discrepancies', 'with', 'the', 'theoretical', 'model', 'for', 'high', 'thresholds', 'this', 'work', 'enables', 'optimized', 'measurement', 'of', 'the', 'biphoton', 'joint', 'probability', 'distribution', 'in', 'highdimensional', 'joint', 'hilbert', 'spaces']] | [-0.08786450020972103, 0.08450066366500847, -0.0835587122311739, 0.07393483858163252, -0.03351014877401599, -0.168215977496863, 0.09653188513068814, 0.4109310262504812, -0.19323108576984488, -0.34812419653283305, 0.03964877188802148, -0.27426245122867293, -0.03554021942505792, 0.21527319994582858, -0.0674983791429677, 0.1567389936699079, 0.0995841998342195, -0.008023695503552891, -0.11269048723704755, -0.20123701527306478, 0.24810376730492364, 0.15558885383796048, 0.38248228667501666, 0.0061444283673565275, 0.14422484855518408, 0.04725035755537858, -0.04001828703761407, -0.01974579981171003, -0.15682278776547134, 0.07334022090948913, 0.3084824864388992, 0.1851573853884275, 0.19632156424492292, -0.38884000995591894, -0.2017136023902934, 0.12541717391027368, 0.1764228516449667, 0.08905140857837379, -0.015022416327791352, -0.25717221459290907, 0.053028953459420027, -0.17511000443403035, -0.09558410156432105, -0.08897009757283615, -0.0016147381122134728, 0.037695682830056046, -0.30773889692500234, 0.09571760506943276, -0.02458240564478791, 0.037294536803479064, -0.013507640736388068, -0.12511787844793107, 0.061228228924311186, 0.10513380435869506, 0.004311989706204183, 0.014142936688835083, 0.13231746821460147, -0.11867010386737242, -0.10597650576159613, 0.30042643066852875, -0.04883953104641253, -0.17944320821608353, 0.16825750868844047, -0.20186507758337205, -0.10834024320611704, 0.17421681129003633, 0.17647555285158936, 0.07096749827686748, -0.14397011562378134, 0.021946200408035098, 0.006609227674158468, 0.21549079752601333, 0.10531773696787503, 0.12430718938945848, 0.15955552856249683, 0.16985650264262542, 0.06863092625041632, 0.13548396947898914, -0.19602091401083432, -0.06964747358571215, -0.2871827849104031, -0.11448722278495153, -0.19067711178161528, 0.04253108228065635, -0.11462656270723777, -0.0899212837653005, 0.36773988678541086, 0.18239554501224742, 0.19221905273806356, 0.092117636276358, 0.33463456736852043, 0.13455505493776362, 0.039027925666855416, 0.03558073908230928, 0.25676634139062404, 0.11661904654465616, 0.07063927798059909, -0.18228721791680597, 0.09440891771921761, -0.04704837260244746] |
1,802.0049 | Realization problems for diffeomorphism groups | We discuss recent results and open questions on the broad theme of (Nielsen)
realization problems. Beyond realizing subgroups of mapping class groups, there
are many other natural instances where one can ask if a surjection from a group
of diffeomorphisms of a manifold to another group admits a section over
particular subgroups. This survey includes many open problems, and some short
proofs of new results that are illustrative of key techniques; drawing
attention to parallels between problems arising in different areas.
| math.GT | we discuss recent results and open questions on the broad theme of nielsen realization problems beyond realizing subgroups of mapping class groups there are many other natural instances where one can ask if a surjection from a group of diffeomorphisms of a manifold to another group admits a section over particular subgroups this survey includes many open problems and some short proofs of new results that are illustrative of key techniques drawing attention to parallels between problems arising in different areas | [['we', 'discuss', 'recent', 'results', 'and', 'open', 'questions', 'on', 'the', 'broad', 'theme', 'of', 'nielsen', 'realization', 'problems', 'beyond', 'realizing', 'subgroups', 'of', 'mapping', 'class', 'groups', 'there', 'are', 'many', 'other', 'natural', 'instances', 'where', 'one', 'can', 'ask', 'if', 'a', 'surjection', 'from', 'a', 'group', 'of', 'diffeomorphisms', 'of', 'a', 'manifold', 'to', 'another', 'group', 'admits', 'a', 'section', 'over', 'particular', 'subgroups', 'this', 'survey', 'includes', 'many', 'open', 'problems', 'and', 'some', 'short', 'proofs', 'of', 'new', 'results', 'that', 'are', 'illustrative', 'of', 'key', 'techniques', 'drawing', 'attention', 'to', 'parallels', 'between', 'problems', 'arising', 'in', 'different', 'areas']] | [-0.13974705027677925, 0.06616062369703511, -0.05693764552290057, 0.07340464042355939, -0.1288259742770022, -0.16366432345023862, 0.0374695601194729, 0.38718484429481587, -0.3222884450590721, -0.2858667263508211, 0.13774305632205702, -0.2981741087005278, -0.16481197964584018, 0.3251738547129028, -0.17412977385116213, -0.006190153919620279, 0.08343278918484295, 0.02277821739330704, -0.08867143870354342, -0.24786566790009354, 0.37199127998341014, -0.0817881910889237, 0.21529952919593565, 0.08399963443293984, 0.10638759396740316, -0.026021527977269372, -0.04559505662455419, 0.015732734958514755, -0.1392490388053925, 0.15486616981043308, 0.3492298826092371, 0.16040631065743022, 0.3256899707317015, -0.37163876512168365, -0.22375294382189526, 0.15952042422981727, 0.121060029718519, 0.09303656507881335, -0.10759751770766107, -0.2790967496916836, 0.056838093118535146, -0.11847167664471968, -0.11690419269610702, -0.041326632964666245, 0.06022164078406346, 0.012742410574890213, -0.1747746384806103, -0.027971155337851356, 0.07608879434611694, 0.09345763857349937, -0.010577447166275462, -0.11232566045680555, 0.05095060759534439, 0.16197085566243824, 0.08842457354249847, 0.03182142512458894, 0.11260459832502184, -0.14488667063127605, -0.19205485638460995, 0.43887880757267095, 0.010690683429991757, -0.15883976824719598, 0.23058624992744975, -0.10813650231877411, -0.27894393476531093, 0.07589103002244905, 0.14497250619769833, 0.10533672146625633, -0.09023479659133303, 0.1538485359777064, -0.1445125889286031, 0.10709782234209095, 0.06419018344424757, 0.01204774320056593, 0.16529017112528285, 0.14169793632628833, 0.09980207183082117, 0.14362889538119536, 0.04924002355309548, -0.09810417600803906, -0.3337475543404803, -0.12619260656015005, -0.08229859229637149, 0.06273207827011285, -0.054248565761588034, -0.16332847352806526, 0.4213941505431761, 0.1309268420194218, 0.18934364758581382, 0.029286268121206466, 0.19615316653141268, 0.0011319012760564132, 0.04465155826628576, 0.06013482187035275, 0.0923085417055933, 0.1824298315210107, -0.02386199606059372, -0.06837239137844953, -0.05229794906084368, 0.08552970359515813] |
1,802.00491 | A New Registration Approach for Dynamic Analysis of Calcium Signals in
Organs | Wing disc pouches of fruit flies are a powerful genetic model for studying
physiological intercellular calcium ($Ca^{2+}$) signals for dynamic analysis of
cell signaling in organ development and disease studies. A key to analyzing
spatial-temporal patterns of $Ca^{2+}$ signal waves is to accurately align the
pouches across image sequences. However, pouches in different image frames may
exhibit extensive intensity oscillations due to $Ca^{2+}$ signaling dynamics,
and commonly used multimodal non-rigid registration methods may fail to achieve
satisfactory results. In this paper, we develop a new two-phase non-rigid
registration approach to register pouches in image sequences. First, we conduct
segmentation of the region of interest. (i.e., pouches) using a deep neural
network model. Second, we obtain an optimal transformation and align pouches
across the image sequences. Evaluated using both synthetic data and real pouch
data, our method considerably outperforms the state-of-the-art non-rigid
registration methods.
| cs.CV | wing disc pouches of fruit flies are a powerful genetic model for studying physiological intercellular calcium ca2 signals for dynamic analysis of cell signaling in organ development and disease studies a key to analyzing spatialtemporal patterns of ca2 signal waves is to accurately align the pouches across image sequences however pouches in different image frames may exhibit extensive intensity oscillations due to ca2 signaling dynamics and commonly used multimodal nonrigid registration methods may fail to achieve satisfactory results in this paper we develop a new twophase nonrigid registration approach to register pouches in image sequences first we conduct segmentation of the region of interest ie pouches using a deep neural network model second we obtain an optimal transformation and align pouches across the image sequences evaluated using both synthetic data and real pouch data our method considerably outperforms the stateoftheart nonrigid registration methods | [['wing', 'disc', 'pouches', 'of', 'fruit', 'flies', 'are', 'a', 'powerful', 'genetic', 'model', 'for', 'studying', 'physiological', 'intercellular', 'calcium', 'ca2', 'signals', 'for', 'dynamic', 'analysis', 'of', 'cell', 'signaling', 'in', 'organ', 'development', 'and', 'disease', 'studies', 'a', 'key', 'to', 'analyzing', 'spatialtemporal', 'patterns', 'of', 'ca2', 'signal', 'waves', 'is', 'to', 'accurately', 'align', 'the', 'pouches', 'across', 'image', 'sequences', 'however', 'pouches', 'in', 'different', 'image', 'frames', 'may', 'exhibit', 'extensive', 'intensity', 'oscillations', 'due', 'to', 'ca2', 'signaling', 'dynamics', 'and', 'commonly', 'used', 'multimodal', 'nonrigid', 'registration', 'methods', 'may', 'fail', 'to', 'achieve', 'satisfactory', 'results', 'in', 'this', 'paper', 'we', 'develop', 'a', 'new', 'twophase', 'nonrigid', 'registration', 'approach', 'to', 'register', 'pouches', 'in', 'image', 'sequences', 'first', 'we', 'conduct', 'segmentation', 'of', 'the', 'region', 'of', 'interest', 'ie', 'pouches', 'using', 'a', 'deep', 'neural', 'network', 'model', 'second', 'we', 'obtain', 'an', 'optimal', 'transformation', 'and', 'align', 'pouches', 'across', 'the', 'image', 'sequences', 'evaluated', 'using', 'both', 'synthetic', 'data', 'and', 'real', 'pouch', 'data', 'our', 'method', 'considerably', 'outperforms', 'the', 'stateoftheart', 'nonrigid', 'registration', 'methods']] | [-0.06607570121116885, 0.0036335300347463298, -0.04948967957048566, 0.09231606879030595, -0.05226804249613852, -0.16292768052837753, 0.0037809053177040044, 0.4703026277345273, -0.27639601843014777, -0.28248562102069286, 0.06324444107476856, -0.2501409473353541, -0.24763770598488358, 0.188218243000052, -0.17026977263772827, 0.06548782047926338, 0.13642936841408898, -0.010010250143127165, -0.01749313788136819, -0.18172643059812538, 0.20472434313375165, 0.03498888340549889, 0.3532179082528903, -0.02345204638427944, 0.13426187732973352, -0.025709479352804487, -0.04923554412756845, -0.024787294125620772, -0.08496324578473113, 0.15721974480845086, 0.35503819169658984, 0.20820033601061863, 0.2534804166770065, -0.4771907532496469, -0.2574777864375627, 0.11079098979073049, 0.18308032092384316, 0.15395984179959013, -0.06185736692790593, -0.3305593414714078, 0.07482963593976273, -0.07903716726866844, -0.010029566046045898, -0.1546759294065927, -0.02843735491127505, 0.038148991231988935, -0.31741651413486816, 0.1267364728607193, 0.039892210143168905, 0.10793710935053293, -0.11852530431380118, -0.05907504938679611, 0.004020567770096493, 0.21213803800812864, 0.041101645788998456, 0.06668943928723986, 0.20510917813093824, -0.1270103927520983, -0.1206980794016923, 0.34182797391228115, -0.04423527072437785, -0.19200684203460186, 0.20710175063695524, -0.08778093282419902, -0.14189226017170747, 0.1886185613376173, 0.2250337129641142, 0.1217940013963156, -0.17059277649968863, -0.07282431985551192, -0.011784072554266485, 0.20594053628196665, 0.08884743624529638, -0.050551486673758375, 0.1664239972491156, 0.2402297993666017, 0.0012384637342798491, 0.12614590430899256, -0.20411887501815815, -0.06763857859675285, -0.15896012545506294, -0.09674204851442075, -0.13257393143074653, -0.07994610088685254, -0.09463023477017397, -0.15583270986180206, 0.4065822960509287, 0.18118316353415953, 0.19864116506846427, 0.06046221928851731, 0.3393633293469886, -0.03523398525736106, 0.10035202714005628, -0.0020327261369024125, 0.1420329836770319, 0.04141792839240784, 0.15238543986049774, -0.23324291844924722, 0.09402085885965636, 0.04748165622431707] |
1,802.00492 | Nonmetricity formulation of general relativity and its scalar-tensor
extension | Einstein's celebrated theory of gravitation can be presented in three forms:
general relativity, teleparallel gravity, and the rarely considered before
symmetric teleparallel gravity. Extending the latter, we introduce a new class
of theories where a scalar field is coupled nonminimally to nonmetricity $Q$,
which here encodes the gravitational effects like curvature $R$ in general
relativity or torsion $T$ in teleparallel gravity. We point out the
similarities and differences with analogous scalar-curvature and scalar-torsion
theories by discussing the field equations, role of connection, conformal
transformations, relation to $f(Q)$ theory, and cosmology. The equations for
spatially flat universe coincide with those of teleparallel dark energy, thus
allowing to explain accelerating expansion.
| gr-qc hep-ph hep-th | einsteins celebrated theory of gravitation can be presented in three forms general relativity teleparallel gravity and the rarely considered before symmetric teleparallel gravity extending the latter we introduce a new class of theories where a scalar field is coupled nonminimally to nonmetricity q which here encodes the gravitational effects like curvature r in general relativity or torsion t in teleparallel gravity we point out the similarities and differences with analogous scalarcurvature and scalartorsion theories by discussing the field equations role of connection conformal transformations relation to fq theory and cosmology the equations for spatially flat universe coincide with those of teleparallel dark energy thus allowing to explain accelerating expansion | [['einsteins', 'celebrated', 'theory', 'of', 'gravitation', 'can', 'be', 'presented', 'in', 'three', 'forms', 'general', 'relativity', 'teleparallel', 'gravity', 'and', 'the', 'rarely', 'considered', 'before', 'symmetric', 'teleparallel', 'gravity', 'extending', 'the', 'latter', 'we', 'introduce', 'a', 'new', 'class', 'of', 'theories', 'where', 'a', 'scalar', 'field', 'is', 'coupled', 'nonminimally', 'to', 'nonmetricity', 'q', 'which', 'here', 'encodes', 'the', 'gravitational', 'effects', 'like', 'curvature', 'r', 'in', 'general', 'relativity', 'or', 'torsion', 't', 'in', 'teleparallel', 'gravity', 'we', 'point', 'out', 'the', 'similarities', 'and', 'differences', 'with', 'analogous', 'scalarcurvature', 'and', 'scalartorsion', 'theories', 'by', 'discussing', 'the', 'field', 'equations', 'role', 'of', 'connection', 'conformal', 'transformations', 'relation', 'to', 'fq', 'theory', 'and', 'cosmology', 'the', 'equations', 'for', 'spatially', 'flat', 'universe', 'coincide', 'with', 'those', 'of', 'teleparallel', 'dark', 'energy', 'thus', 'allowing', 'to', 'explain', 'accelerating', 'expansion']] | [-0.193872757290208, 0.13159167780241834, -0.11924828948248006, 0.13846126131375894, -0.1838988220327696, -0.2306235860435104, -0.13317928423276257, 0.26448714507555743, -0.22689879977853472, -0.282343655639892, -0.019604352829388317, -0.22676994373547682, -0.15375917459786828, 0.10511408796973971, -0.049777370830570614, -0.03524630142529623, -0.07711285910138715, 0.0715331072329518, -0.10704016728527468, -0.2593488169635364, 0.3783606705982067, 0.10338003254162335, 0.20235943159840386, -0.027119450019074415, 0.09071228605558361, -0.042990580651857846, -0.02169180610174433, 0.08809031914372784, -0.17736151480594428, 0.03925105369726726, 0.24121716091785272, 0.08935325881444908, 0.22418256694613314, -0.4275012576542453, -0.29369664322072214, 0.10321200621920988, 0.07076121505708732, 0.15080061374945616, -0.04964098355886654, -0.31311405591940117, -0.0003065767680901453, -0.1728640672816989, -0.15710521592553534, -0.05707575386355913, 0.03013102699353129, -0.0984261809429581, -0.18551854550872648, 0.12069281205799806, 0.025213677205418776, -0.007903834886062857, -0.08952292019432974, -0.04157976750198991, 0.007812289777425451, -0.017457127081948, 0.13565166306323073, 0.06544222432368119, 0.11743153793173372, -0.14314828398680196, -0.08679349675300368, 0.444582252036951, -0.1564407652466122, -0.24869997430285182, 0.11872496109652342, -0.1818842879291453, -0.17195978126736408, 0.02874052018533811, 0.07388312681877149, 0.1633851813908598, -0.14562906358826802, 0.22944715041282732, 0.02693486539219771, 0.0757553423971147, 0.1492377974332199, 0.04189604624717095, 0.35077920125438533, 0.022217803886758352, -0.025657392059956943, 0.08549375820866521, 0.03749459984481608, -0.18475121836639394, -0.44247601870789166, -0.19230279158971725, -0.06704508420507159, 0.09718480885216813, -0.1720017728885986, -0.14436741371493822, 0.35115400221574744, 0.12055223997094382, 0.03430476167811713, 0.08722935258859443, 0.20085836380908112, 0.06117750565337718, 0.05086989389997352, 0.07304156170474417, 0.32726695009191104, 0.27321559549821967, 0.10620243319869896, -0.21840174344299926, -0.12597175632868338, 0.11108487472365346] |
1,802.00493 | 2MASS J13243553+6358281 is an Early T-Type Planetary-Mass Object in the
AB Doradus Moving Group | We present new radial velocity and trigonometric parallax measurements
indicating that the unusually red and photometrically variable T2 dwarf 2MASS
J13243553+6358281 is a member of the young (~150 Myr) AB Doradus moving group
based on its space velocity. We estimate its model-dependent mass in the range
11-12 $M_{\rm Jup}$ at the age of the AB Doradus moving group, and its
trigonometric parallax distance of 12.7 $\pm$ 1.5 pc makes it one of the
nearest known isolated planetary-mass objects. The unusually red continuum of
2MASS J13243553+6358281 in the near-infrared was previously suspected to be
caused by an unresolved L+T brown dwarf binary, although it was never observed
with high-spatial resolution imaging. This new evidence of youth suggests that
a low surface gravity may be sufficient to explain this peculiar feature. Using
the new parallax we find that its absolute $J$-band magnitude is ~0.4 mag
fainter than equivalent-type field brown dwarfs, suggesting that the binary
hypothesis is unlikely. The fundamental properties of 2MASS J13243553+6358281
follow the spectral type sequence of other known high-likelihood members of the
AB Doradus moving group. The effective temperature of 2MASS J13243553+6358281
provides the first precise constraint on the L/T transition at a known young
age, and indicates that it happens at a temperature of ~1150 K at ~150 Myr,
compared to ~1250 K for field brown dwarfs.
| astro-ph.SR astro-ph.EP | we present new radial velocity and trigonometric parallax measurements indicating that the unusually red and photometrically variable t2 dwarf 2mass j132435536358281 is a member of the young 150 myr ab doradus moving group based on its space velocity we estimate its modeldependent mass in the range 1112 m_rm jup at the age of the ab doradus moving group and its trigonometric parallax distance of 127 pm 15 pc makes it one of the nearest known isolated planetarymass objects the unusually red continuum of 2mass j132435536358281 in the nearinfrared was previously suspected to be caused by an unresolved lt brown dwarf binary although it was never observed with highspatial resolution imaging this new evidence of youth suggests that a low surface gravity may be sufficient to explain this peculiar feature using the new parallax we find that its absolute jband magnitude is 04 mag fainter than equivalenttype field brown dwarfs suggesting that the binary hypothesis is unlikely the fundamental properties of 2mass j132435536358281 follow the spectral type sequence of other known highlikelihood members of the ab doradus moving group the effective temperature of 2mass j132435536358281 provides the first precise constraint on the lt transition at a known young age and indicates that it happens at a temperature of 1150 k at 150 myr compared to 1250 k for field brown dwarfs | [['we', 'present', 'new', 'radial', 'velocity', 'and', 'trigonometric', 'parallax', 'measurements', 'indicating', 'that', 'the', 'unusually', 'red', 'and', 'photometrically', 'variable', 't2', 'dwarf', '2mass', 'j132435536358281', 'is', 'a', 'member', 'of', 'the', 'young', '150', 'myr', 'ab', 'doradus', 'moving', 'group', 'based', 'on', 'its', 'space', 'velocity', 'we', 'estimate', 'its', 'modeldependent', 'mass', 'in', 'the', 'range', '1112', 'm_rm', 'jup', 'at', 'the', 'age', 'of', 'the', 'ab', 'doradus', 'moving', 'group', 'and', 'its', 'trigonometric', 'parallax', 'distance', 'of', '127', 'pm', '15', 'pc', 'makes', 'it', 'one', 'of', 'the', 'nearest', 'known', 'isolated', 'planetarymass', 'objects', 'the', 'unusually', 'red', 'continuum', 'of', '2mass', 'j132435536358281', 'in', 'the', 'nearinfrared', 'was', 'previously', 'suspected', 'to', 'be', 'caused', 'by', 'an', 'unresolved', 'lt', 'brown', 'dwarf', 'binary', 'although', 'it', 'was', 'never', 'observed', 'with', 'highspatial', 'resolution', 'imaging', 'this', 'new', 'evidence', 'of', 'youth', 'suggests', 'that', 'a', 'low', 'surface', 'gravity', 'may', 'be', 'sufficient', 'to', 'explain', 'this', 'peculiar', 'feature', 'using', 'the', 'new', 'parallax', 'we', 'find', 'that', 'its', 'absolute', 'jband', 'magnitude', 'is', '04', 'mag', 'fainter', 'than', 'equivalenttype', 'field', 'brown', 'dwarfs', 'suggesting', 'that', 'the', 'binary', 'hypothesis', 'is', 'unlikely', 'the', 'fundamental', 'properties', 'of', '2mass', 'j132435536358281', 'follow', 'the', 'spectral', 'type', 'sequence', 'of', 'other', 'known', 'highlikelihood', 'members', 'of', 'the', 'ab', 'doradus', 'moving', 'group', 'the', 'effective', 'temperature', 'of', '2mass', 'j132435536358281', 'provides', 'the', 'first', 'precise', 'constraint', 'on', 'the', 'lt', 'transition', 'at', 'a', 'known', 'young', 'age', 'and', 'indicates', 'that', 'it', 'happens', 'at', 'a', 'temperature', 'of', '1150', 'k', 'at', '150', 'myr', 'compared', 'to', '1250', 'k', 'for', 'field', 'brown', 'dwarfs']] | [-0.07028153238681965, 0.13038172599170877, -0.13394076056931525, 0.07740642132235427, -0.176517875292062, -0.10978095440489567, 0.13589237504343707, 0.43070073275120935, -0.18459061507059082, -0.34936924697406013, 0.04375498540503862, -0.2858887597340155, -0.03615108614701876, 0.19805671213796472, -0.10426101067048162, -0.059601687811863646, 0.08905240016900105, 0.015239189251338782, -0.06218914300858226, -0.24796261307921635, 0.24148048293781063, 0.030897153048142452, 0.07676767574019355, -0.07669024908974699, 0.04606974030420669, -0.08944050949938663, -0.09752454546909592, -0.050512855328310104, -0.1833194685527711, -0.017350688920096925, 0.19972835950748505, 0.047868034032654, 0.22680713256319227, -0.2117267203778794, -0.1764494505302649, 0.042187771747701004, 0.1800489767845805, -0.01818923811219871, -0.04047107970933154, -0.30478827060055685, 0.11876627624664268, -0.1533295653869938, -0.21525391930773785, 0.06948715483702796, 0.14520431973665238, -0.007465702230663605, -0.21919240034982715, 0.1721446914315281, 0.020013762442352565, 0.18489521026789937, -0.15340348989724023, -0.20352123500396535, -0.01862007850296285, 0.07390942073907686, -0.016905768182273257, 0.15712871347855964, 0.11890566227617397, -0.09161742783223861, -0.016402311098430152, 0.4101722617654904, -0.10665376771531933, 0.050436913432366295, 0.25974273269243336, -0.1997776563432425, -0.16022988897429347, 0.1474560480628622, 0.07359418133486352, 0.16196195663008245, -0.206999240779067, 0.006650556825748836, -0.013138022898913247, 0.23093254718776435, 0.063815035440504, 0.06408493863376172, 0.3280303348025911, 0.13128179526416325, 0.04524066012573841, 0.046732453556282694, -0.3138186055210049, -0.015301375070184928, -0.21186046291899668, -0.1255219555013392, -0.1596674894739674, 0.08955570839804737, -0.15273370512747356, -0.14008341473420938, 0.2899454394716888, 0.12790923934753082, 0.16519626978461602, 0.055378651981067645, 0.2587329427090784, 0.0740949532873482, 0.17242254147765368, 0.12578802516888063, 0.3138726606548309, 0.21478957631019238, 0.05856769727691838, -0.2518201891389212, 0.04055978982288339, 0.010345953004222074] |
1,802.00494 | A Strange Vertex Condition Coming From Nowhere | We prove norm-resolvent and spectral convergence in $L^2$ of solutions to the
Neumann Poisson problem $-\Delta u_\varepsilon = f$ on a domain
$\Omega_\varepsilon$ perforated by Dirichlet-holes and shrinking to a
1-dimensional interval. The limit $u$ satisfies an equation of the type
$-u''+\mu u = f$ on the interval $(0,1)$, where $\mu$ is a positive constant.
As an application we study the convergence of solutions in perforated
graph-like domains. We show that if the scaling between the edge neighbourhood
and the vertex neighbourhood is chosen correctly, the constant $\mu$ will
appear in the vertex condition of the limit problem. In particular, this
implies that the spectrum of the resulting quantum graph is altered in a
controlled way by the perforation.
| math.AP | we prove normresolvent and spectral convergence in l2 of solutions to the neumann poisson problem delta u_varepsilon f on a domain omega_varepsilon perforated by dirichletholes and shrinking to a 1dimensional interval the limit u satisfies an equation of the type umu u f on the interval 01 where mu is a positive constant as an application we study the convergence of solutions in perforated graphlike domains we show that if the scaling between the edge neighbourhood and the vertex neighbourhood is chosen correctly the constant mu will appear in the vertex condition of the limit problem in particular this implies that the spectrum of the resulting quantum graph is altered in a controlled way by the perforation | [['we', 'prove', 'normresolvent', 'and', 'spectral', 'convergence', 'in', 'l2', 'of', 'solutions', 'to', 'the', 'neumann', 'poisson', 'problem', 'delta', 'u_varepsilon', 'f', 'on', 'a', 'domain', 'omega_varepsilon', 'perforated', 'by', 'dirichletholes', 'and', 'shrinking', 'to', 'a', '1dimensional', 'interval', 'the', 'limit', 'u', 'satisfies', 'an', 'equation', 'of', 'the', 'type', 'umu', 'u', 'f', 'on', 'the', 'interval', '01', 'where', 'mu', 'is', 'a', 'positive', 'constant', 'as', 'an', 'application', 'we', 'study', 'the', 'convergence', 'of', 'solutions', 'in', 'perforated', 'graphlike', 'domains', 'we', 'show', 'that', 'if', 'the', 'scaling', 'between', 'the', 'edge', 'neighbourhood', 'and', 'the', 'vertex', 'neighbourhood', 'is', 'chosen', 'correctly', 'the', 'constant', 'mu', 'will', 'appear', 'in', 'the', 'vertex', 'condition', 'of', 'the', 'limit', 'problem', 'in', 'particular', 'this', 'implies', 'that', 'the', 'spectrum', 'of', 'the', 'resulting', 'quantum', 'graph', 'is', 'altered', 'in', 'a', 'controlled', 'way', 'by', 'the', 'perforation']] | [-0.1744426073313787, 0.07465275445102978, -0.036512815582933275, 0.017550187982249492, -0.05683572408502344, -0.093540802341083, 0.05279899425282753, 0.34448697267437417, -0.32989288654563753, -0.20518903373258895, 0.11590120731551874, -0.313697487902667, -0.11437438214840047, 0.14512410832986491, -0.0913136920927831, 0.05131793318412684, 0.08278103734784086, 0.08902004167260923, -0.050001089791451174, -0.18865663786785042, 0.36810408294971647, -0.060473554951323456, 0.21082755614971294, 0.07666544975905583, 0.09126613457719314, -0.02722714743416371, 0.05855484650839634, 0.04969420292061465, -0.22115110361144238, 0.0577948527442741, 0.1940802945504527, 0.05886069746037688, 0.313942086866832, -0.38781306284062306, -0.17167419802341288, 0.15873452062429538, 0.16242839058395475, -0.0017025892317680449, -0.013461830918396148, -0.2658836843510126, 0.15448999957679288, -0.08365207488231104, -0.18788909916123697, 0.024145007960434103, 0.06916808287195604, 0.05349214428610265, -0.32902464568454387, 0.07167499758913343, 0.1261290280361146, -0.02960304601985062, -0.05822559028406274, -0.06806547210375168, -0.031433415615224634, 0.09199054211635015, 0.024520541848373954, 0.08749834342221409, 0.0701293273194661, -0.10643089874567271, -0.033970184134447884, 0.3587023874680544, -0.13024927879952633, -0.26777479451567193, 0.11581985784517922, -0.18501048165790993, -0.10169198239575429, 0.054941701987790394, 0.1105204117371488, 0.14293257508362675, -0.11966355866752565, 0.2394267901169048, -0.058435339368237506, 0.14125883153736077, 0.12079359590204368, -0.012440872406747577, 0.11343554017768273, 0.13761331075160155, 0.1894416949422709, 0.13174211339029515, -0.05371751977082599, -0.03676181087864499, -0.3597813693100008, -0.12441587226529574, -0.21638837337879271, 0.10531671999568312, -0.14193049053110057, -0.22318481867490658, 0.36653856510810295, 0.0716609039548624, 0.22098656038047168, 0.045397768224637695, 0.1956301752351433, 0.18787648301503365, -0.008774923269058866, 0.09863126981031985, 0.16184953336828742, 0.12458699202999987, 0.11209613075961583, -0.2235121585605345, 0.008617565438757522, 0.13619526835351153] |
1,802.00495 | Practical Bayesian Modeling and Inference for Massive Spatial Datasets
On Modest Computing Environments | With continued advances in Geographic Information Systems and related
computational technologies, statisticians are often required to analyze very
large spatial datasets. This has generated substantial interest over the last
decade, already too vast to be summarized here, in scalable methodologies for
analyzing large spatial datasets. Scalable spatial process models have been
found especially attractive due to their richness and flexibility and,
particularly so in the Bayesian paradigm, due to their presence in hierarchical
model settings. However, the vast majority of research articles present in this
domain have been geared toward innovative theory or more complex model
development. Very limited attention has been accorded to approaches for easily
implementable scalable hierarchical models for the practicing scientist or
spatial analyst. This article is submitted to the Practice section of the
journal with the aim of developing massively scalable Bayesian approaches that
can rapidly deliver Bayesian inference on spatial process that are practically
indistinguishable from inference obtained using more expensive alternatives. A
key emphasis is on implementation within very standard (modest) computing
environments (e.g., a standard desktop or laptop) using easily available
statistical software packages without requiring message-parsing interfaces or
parallel programming paradigms. Key insights are offered regarding assumptions
and approximations concerning practical efficiency.
| stat.ME | with continued advances in geographic information systems and related computational technologies statisticians are often required to analyze very large spatial datasets this has generated substantial interest over the last decade already too vast to be summarized here in scalable methodologies for analyzing large spatial datasets scalable spatial process models have been found especially attractive due to their richness and flexibility and particularly so in the bayesian paradigm due to their presence in hierarchical model settings however the vast majority of research articles present in this domain have been geared toward innovative theory or more complex model development very limited attention has been accorded to approaches for easily implementable scalable hierarchical models for the practicing scientist or spatial analyst this article is submitted to the practice section of the journal with the aim of developing massively scalable bayesian approaches that can rapidly deliver bayesian inference on spatial process that are practically indistinguishable from inference obtained using more expensive alternatives a key emphasis is on implementation within very standard modest computing environments eg a standard desktop or laptop using easily available statistical software packages without requiring messageparsing interfaces or parallel programming paradigms key insights are offered regarding assumptions and approximations concerning practical efficiency | [['with', 'continued', 'advances', 'in', 'geographic', 'information', 'systems', 'and', 'related', 'computational', 'technologies', 'statisticians', 'are', 'often', 'required', 'to', 'analyze', 'very', 'large', 'spatial', 'datasets', 'this', 'has', 'generated', 'substantial', 'interest', 'over', 'the', 'last', 'decade', 'already', 'too', 'vast', 'to', 'be', 'summarized', 'here', 'in', 'scalable', 'methodologies', 'for', 'analyzing', 'large', 'spatial', 'datasets', 'scalable', 'spatial', 'process', 'models', 'have', 'been', 'found', 'especially', 'attractive', 'due', 'to', 'their', 'richness', 'and', 'flexibility', 'and', 'particularly', 'so', 'in', 'the', 'bayesian', 'paradigm', 'due', 'to', 'their', 'presence', 'in', 'hierarchical', 'model', 'settings', 'however', 'the', 'vast', 'majority', 'of', 'research', 'articles', 'present', 'in', 'this', 'domain', 'have', 'been', 'geared', 'toward', 'innovative', 'theory', 'or', 'more', 'complex', 'model', 'development', 'very', 'limited', 'attention', 'has', 'been', 'accorded', 'to', 'approaches', 'for', 'easily', 'implementable', 'scalable', 'hierarchical', 'models', 'for', 'the', 'practicing', 'scientist', 'or', 'spatial', 'analyst', 'this', 'article', 'is', 'submitted', 'to', 'the', 'practice', 'section', 'of', 'the', 'journal', 'with', 'the', 'aim', 'of', 'developing', 'massively', 'scalable', 'bayesian', 'approaches', 'that', 'can', 'rapidly', 'deliver', 'bayesian', 'inference', 'on', 'spatial', 'process', 'that', 'are', 'practically', 'indistinguishable', 'from', 'inference', 'obtained', 'using', 'more', 'expensive', 'alternatives', 'a', 'key', 'emphasis', 'is', 'on', 'implementation', 'within', 'very', 'standard', 'modest', 'computing', 'environments', 'eg', 'a', 'standard', 'desktop', 'or', 'laptop', 'using', 'easily', 'available', 'statistical', 'software', 'packages', 'without', 'requiring', 'messageparsing', 'interfaces', 'or', 'parallel', 'programming', 'paradigms', 'key', 'insights', 'are', 'offered', 'regarding', 'assumptions', 'and', 'approximations', 'concerning', 'practical', 'efficiency']] | [-0.04721399677800946, 0.02181628068210557, -0.06142731379834004, 0.080829347372146, -0.1389850601053331, -0.21325991039630027, 0.03557960764563177, 0.44234768245834855, -0.24080209822393953, -0.36602225446142256, 0.14289840307203122, -0.21582998247351498, -0.11827457090606913, 0.24121234436213854, -0.1070619197387714, 0.08290920095314505, 0.11906894240994007, -0.04040239352558274, -0.04578842008137144, -0.27728262987104246, 0.2447527312056627, 0.11264997547958046, 0.35217596373986454, 0.03568539954401786, 0.05559151656460017, -0.03836518726195209, -0.1024039518670179, 0.022587945822160692, -0.07707086509595683, 0.20907894261647017, 0.34659335745895076, 0.19314609920122167, 0.3763047298137099, -0.48412287028506396, -0.2211592328408733, 0.09434044928435469, 0.1928470305250812, 0.11482602826450602, -0.07998262799359508, -0.28290861547226087, 0.06020933494379278, -0.20984640408772975, -0.07987110641799518, -0.15363872927602643, 0.03199480831157416, -0.005351849541184493, -0.20928021025785712, 0.04354399153846316, 0.006986834243871271, 0.10560785646317526, 0.05078173005254939, -0.15119024134124628, 0.05887509717373177, 0.11747698734805453, 0.050210833092278334, 0.007705995750729926, 0.1234588645095937, -0.16489457464544102, -0.13237295228638687, 0.39558162598870694, 0.018810067098820583, -0.20512985945912077, 0.25812730447156357, -0.07768467932248313, -0.19460730707272889, 0.10904381123371422, 0.22348676592548145, 0.09188618634798332, -0.20846229882270564, 0.11540558735490776, 0.05111294729227666, 0.18165096993092447, 0.03298587660188787, 0.028525472461478785, 0.2377563477307558, 0.23868210788583383, 0.008911659207660705, 0.08031085473194252, -0.039111018495168536, -0.16668305372819303, -0.165940468525514, -0.11538433554698713, -0.18272042870055885, -0.00653800736181438, -0.06460874998680083, -0.15825413044309244, 0.31872572596534154, 0.22959386829403228, 0.11059898589504882, 0.03607643466326408, 0.3534369197115302, 0.04119222902183537, 0.13451709258704794, 0.08608252492384054, 0.1797118554613553, 0.05809036072692834, 0.1778585977217881, -0.06799061260302551, 0.12958681180563872, -0.06392664366168901] |
1,802.00496 | Edu-Edition Spreadsheet Competency Framework | Based on the Spreadsheet Competency Framework for finance professionals, in
the present paper we introduce the Edu-Edition of the Spreadsheet Competency
Framework (E2SCF). We claim that building spreadsheet competences should start
in education, as early as possible, and this process is a lot more effective if
support arrives from expert teachers. The main feature of E2SCF is high
mathability computer-supported real world problem solving. This approach is
based on - from the very beginning of training - a two-directional knowledge
transfer, data and error analysis and handling, and the programming aspect of
spreadsheets. Based on these features, E2SCF is set up for basic and general
users to build up firm spreadsheet knowledge and to develop transferable
problem solving skills and competences.
| cs.CY | based on the spreadsheet competency framework for finance professionals in the present paper we introduce the eduedition of the spreadsheet competency framework e2scf we claim that building spreadsheet competences should start in education as early as possible and this process is a lot more effective if support arrives from expert teachers the main feature of e2scf is high mathability computersupported real world problem solving this approach is based on from the very beginning of training a twodirectional knowledge transfer data and error analysis and handling and the programming aspect of spreadsheets based on these features e2scf is set up for basic and general users to build up firm spreadsheet knowledge and to develop transferable problem solving skills and competences | [['based', 'on', 'the', 'spreadsheet', 'competency', 'framework', 'for', 'finance', 'professionals', 'in', 'the', 'present', 'paper', 'we', 'introduce', 'the', 'eduedition', 'of', 'the', 'spreadsheet', 'competency', 'framework', 'e2scf', 'we', 'claim', 'that', 'building', 'spreadsheet', 'competences', 'should', 'start', 'in', 'education', 'as', 'early', 'as', 'possible', 'and', 'this', 'process', 'is', 'a', 'lot', 'more', 'effective', 'if', 'support', 'arrives', 'from', 'expert', 'teachers', 'the', 'main', 'feature', 'of', 'e2scf', 'is', 'high', 'mathability', 'computersupported', 'real', 'world', 'problem', 'solving', 'this', 'approach', 'is', 'based', 'on', 'from', 'the', 'very', 'beginning', 'of', 'training', 'a', 'twodirectional', 'knowledge', 'transfer', 'data', 'and', 'error', 'analysis', 'and', 'handling', 'and', 'the', 'programming', 'aspect', 'of', 'spreadsheets', 'based', 'on', 'these', 'features', 'e2scf', 'is', 'set', 'up', 'for', 'basic', 'and', 'general', 'users', 'to', 'build', 'up', 'firm', 'spreadsheet', 'knowledge', 'and', 'to', 'develop', 'transferable', 'problem', 'solving', 'skills', 'and', 'competences']] | [0.006664613424004334, 0.002109830116486957, -0.08622096697839661, 0.08189992335658636, -0.19625699440510863, -0.1483463993948749, 0.10465941599144353, 0.3791109934035275, -0.21836169545626283, -0.3640201985119627, 0.12219046382631502, -0.26648395677280223, -0.1899559769588403, 0.20209862950106716, -0.14239618878286237, 0.0625879523373193, 0.10190704441032349, 0.02035949169857125, 0.003120577760323341, -0.27579521998150164, 0.36115901751650703, 0.05228858165001162, 0.3112142339794554, 0.07474309114866659, 0.08894491239558332, -0.006565577000315882, -0.051836689710258864, -0.05567660761408062, -0.05623798762602606, 0.2222340953731352, 0.3982070344540044, 0.2701658525138011, 0.40392960752877927, -0.4270742988277577, -0.13288140064901394, 0.01826583791890333, 0.10099568891410644, 0.10514301822085977, -0.038620925342895955, -0.2999955669332009, 0.08461145838746467, -0.20655564271295682, -0.05566036479316779, -0.1120603577607972, 0.013871397465889335, -0.04925455137466391, -0.2648994120506522, -0.01209188809377501, 0.058366218159914524, 0.1320078109597994, -0.06535008653966534, -0.1492732251729641, 0.044002975948139005, 0.20079239992759165, 0.0612362901335403, 0.031023955422366023, 0.13821254541667607, -0.13184402995687136, -0.13863697808044842, 0.40982039264825165, 0.016106407094396587, -0.17633189400658011, 0.17884886468378589, -0.04631744023078145, -0.1523193213611077, 0.04014418905194944, 0.2580688577065738, 0.09467277166425672, -0.19593583869660258, 0.055729770293144874, 0.0068296845007337565, 0.17896835712922943, 0.02731556772517088, -0.06886093563382299, 0.21100775091948673, 0.24643015931957427, 0.037254185463564515, 0.09943567500171116, 0.015280409411598857, -0.10548147846174498, -0.2748371730526237, -0.16059443701663587, -0.17151211098266336, 0.006518286866788617, -0.0527399666747924, -0.1619856621329792, 0.36674667407686895, 0.23131355334423545, 0.10547264833719684, 0.10485199563061962, 0.3165713744158419, 0.07109518387092727, 0.06451041340573221, 0.11032826968659766, 0.13703884769820124, 0.009701130688827261, 0.17311225222168952, -0.11107302553012458, 0.12069357045265472, 0.02638740561808993] |
1,802.00497 | Approximating power by weights | Determining the power distribution of the members of a shareholder meeting or
a legislative committee is a well-known problem for many applications. In some
cases it turns out that power is nearly proportional to relative voting
weights, which is very beneficial for both theoretical considerations and
practical computations with many members. We present quantitative approximation
results with precise error bounds for several power indices as well as
impossibility results for such approximations between power and weights.
| cs.GT | determining the power distribution of the members of a shareholder meeting or a legislative committee is a wellknown problem for many applications in some cases it turns out that power is nearly proportional to relative voting weights which is very beneficial for both theoretical considerations and practical computations with many members we present quantitative approximation results with precise error bounds for several power indices as well as impossibility results for such approximations between power and weights | [['determining', 'the', 'power', 'distribution', 'of', 'the', 'members', 'of', 'a', 'shareholder', 'meeting', 'or', 'a', 'legislative', 'committee', 'is', 'a', 'wellknown', 'problem', 'for', 'many', 'applications', 'in', 'some', 'cases', 'it', 'turns', 'out', 'that', 'power', 'is', 'nearly', 'proportional', 'to', 'relative', 'voting', 'weights', 'which', 'is', 'very', 'beneficial', 'for', 'both', 'theoretical', 'considerations', 'and', 'practical', 'computations', 'with', 'many', 'members', 'we', 'present', 'quantitative', 'approximation', 'results', 'with', 'precise', 'error', 'bounds', 'for', 'several', 'power', 'indices', 'as', 'well', 'as', 'impossibility', 'results', 'for', 'such', 'approximations', 'between', 'power', 'and', 'weights']] | [-0.09876484252316386, 0.03698448964247578, -0.07591002772709257, 0.07803204274387099, -0.08062246755549782, -0.17523198461429657, 0.11688395715502434, 0.3659453012637402, -0.24334646751613995, -0.32721410216273444, 0.14224739926468924, -0.30965419363622604, -0.14816851318679064, 0.2765867302866689, -0.09824193299037258, 0.089321678614636, 0.06582174946336301, 0.03705061381486686, -0.030023390497693692, -0.2712109042821746, 0.2578928659817106, 0.10477684689440618, 0.27652496822472467, 0.0587907616986501, 0.04765014461238599, -0.013405384514235744, -0.01893604483675996, 0.05888790829509928, -0.11319612156416713, 0.11361462967378382, 0.303036768108493, 0.13888483470011698, 0.3494341658599871, -0.32911551553805013, -0.16182880537388356, 0.13088963581570792, 0.092117742368014, 0.07283184864086491, -0.04859872853787812, -0.18321122392080724, 0.09433505875916269, -0.18510024424483018, -0.10728948239825274, -0.1330576295670318, 0.04184638712506153, 0.07970640548553906, -0.3265673572222065, 0.04111663553952607, 0.05470067038904266, 0.05351369378254994, -0.05006815046439633, -0.18941080713595607, 0.05164741568794278, 0.1727504167785427, 0.07848211552472524, -0.043818073518770304, 0.0740097083126832, -0.17935042116349856, -0.1344845697749406, 0.4350310415274611, 0.008611705521807858, -0.19506148164356618, 0.15215466969560734, -0.07230819128208647, -0.1702032696553751, 0.03965632070934302, 0.142405711837407, 0.08388929058013386, -0.09734804217097055, 0.013574715647049934, -0.06422928985404341, 0.15280774970980068, 0.07672608962380573, 0.06007092686271981, 0.1901153200551083, 0.1127321358868166, 0.11093313601419427, 0.10392203415425397, -0.0320392628139081, -0.13610649010852763, -0.3037706548148938, -0.11124996915398362, -0.167968238225991, 0.025257811501720233, -0.11367674499687334, -0.14405263723701386, 0.3872175049526911, 0.08319252092195184, 0.18901237993697195, 0.11283018876412443, 0.30677198640708075, 0.12112315417892348, 0.043657364372752215, 0.11385933897384491, 0.22641190107319026, 0.13380355186956494, 0.058099374196516645, -0.1388667005445122, 0.0936866432526394, 0.01066350968750684] |
1,802.00498 | Asymptotically safe f(R)-gravity coupled to matter I: the polynomial
case | We use the functional renormalization group equation for the effective
average action to study the non-Gaussian renormalization group fixed points
(NGFPs) arising within the framework of f(R)-gravity minimally coupled to an
arbitrary number of scalar, Dirac, and vector fields. Based on this setting we
provide comprehensible estimates which gravity-matter systems give rise to
NGFPs suitable for rendering the theory asymptotically safe. The analysis
employs an exponential split of the metric fluctuations and retains a
7-parameter family of coarse-graining operators allowing the inclusion of
non-trivial endomorphisms in the regularization procedure. For vanishing
endomorphisms, it is established that gravity coupled to the matter content of
the standard model of particle physics and many beyond the standard model
extensions exhibit NGFPs whose properties are strikingly similar to the case of
pure gravity: there are two UV-relevant directions and the position and
critical exponents converge rapidly when higher powers of the scalar curvature
are included. Conversely, none of the phenomenologically interesting
gravity-matter systems exhibits a stable NGFP when a Type II coarse graining
operator is employed. Our analysis resolves this tension by demonstrating that
the NGFPs seen in the two settings belong to different universality classes.
| hep-th gr-qc | we use the functional renormalization group equation for the effective average action to study the nongaussian renormalization group fixed points ngfps arising within the framework of frgravity minimally coupled to an arbitrary number of scalar dirac and vector fields based on this setting we provide comprehensible estimates which gravitymatter systems give rise to ngfps suitable for rendering the theory asymptotically safe the analysis employs an exponential split of the metric fluctuations and retains a 7parameter family of coarsegraining operators allowing the inclusion of nontrivial endomorphisms in the regularization procedure for vanishing endomorphisms it is established that gravity coupled to the matter content of the standard model of particle physics and many beyond the standard model extensions exhibit ngfps whose properties are strikingly similar to the case of pure gravity there are two uvrelevant directions and the position and critical exponents converge rapidly when higher powers of the scalar curvature are included conversely none of the phenomenologically interesting gravitymatter systems exhibits a stable ngfp when a type ii coarse graining operator is employed our analysis resolves this tension by demonstrating that the ngfps seen in the two settings belong to different universality classes | [['we', 'use', 'the', 'functional', 'renormalization', 'group', 'equation', 'for', 'the', 'effective', 'average', 'action', 'to', 'study', 'the', 'nongaussian', 'renormalization', 'group', 'fixed', 'points', 'ngfps', 'arising', 'within', 'the', 'framework', 'of', 'frgravity', 'minimally', 'coupled', 'to', 'an', 'arbitrary', 'number', 'of', 'scalar', 'dirac', 'and', 'vector', 'fields', 'based', 'on', 'this', 'setting', 'we', 'provide', 'comprehensible', 'estimates', 'which', 'gravitymatter', 'systems', 'give', 'rise', 'to', 'ngfps', 'suitable', 'for', 'rendering', 'the', 'theory', 'asymptotically', 'safe', 'the', 'analysis', 'employs', 'an', 'exponential', 'split', 'of', 'the', 'metric', 'fluctuations', 'and', 'retains', 'a', '7parameter', 'family', 'of', 'coarsegraining', 'operators', 'allowing', 'the', 'inclusion', 'of', 'nontrivial', 'endomorphisms', 'in', 'the', 'regularization', 'procedure', 'for', 'vanishing', 'endomorphisms', 'it', 'is', 'established', 'that', 'gravity', 'coupled', 'to', 'the', 'matter', 'content', 'of', 'the', 'standard', 'model', 'of', 'particle', 'physics', 'and', 'many', 'beyond', 'the', 'standard', 'model', 'extensions', 'exhibit', 'ngfps', 'whose', 'properties', 'are', 'strikingly', 'similar', 'to', 'the', 'case', 'of', 'pure', 'gravity', 'there', 'are', 'two', 'uvrelevant', 'directions', 'and', 'the', 'position', 'and', 'critical', 'exponents', 'converge', 'rapidly', 'when', 'higher', 'powers', 'of', 'the', 'scalar', 'curvature', 'are', 'included', 'conversely', 'none', 'of', 'the', 'phenomenologically', 'interesting', 'gravitymatter', 'systems', 'exhibits', 'a', 'stable', 'ngfp', 'when', 'a', 'type', 'ii', 'coarse', 'graining', 'operator', 'is', 'employed', 'our', 'analysis', 'resolves', 'this', 'tension', 'by', 'demonstrating', 'that', 'the', 'ngfps', 'seen', 'in', 'the', 'two', 'settings', 'belong', 'to', 'different', 'universality', 'classes']] | [-0.13851070069800575, 0.1369897044016626, -0.10925052280437825, 0.08966489738714029, -0.0697258076940161, -0.1835738588587737, -0.01093106838894023, 0.30056063111942183, -0.234998998256566, -0.2698206049414517, 0.06877615473584238, -0.272573369794101, -0.14315850361182075, 0.16937106778584324, -0.03799065515272202, 0.035415465704589616, 0.004788268495263308, 0.05269513774376133, -0.09533740242843208, -0.23527257217104056, 0.3690370425108957, 0.01797411483785635, 0.2760127029718139, 0.010493691310930158, 0.09371626220828809, -0.00043226736085733193, -0.02471953384573352, 0.04845471761106509, -0.12493829282906689, 0.10406941673669633, 0.21775932653431648, 0.06654712590705895, 0.2356889660713456, -0.37403358059267255, -0.23407508677824923, 0.13313793234956203, 0.1257904345384209, 0.10677028345663335, -0.04335221009882391, -0.275163100138843, 0.07298830617950615, -0.15563748712549036, -0.16636312379945478, -0.118244945405646, -0.013579062190448075, -0.03663350241039319, -0.2661445636889795, 0.08274134802824028, 0.052866713400486445, 0.04063485219772339, -0.05965992692840914, -0.08618028315408302, -0.026487807215420597, 0.09394630314739597, 0.08104336220150599, 0.005957092185314569, 0.12662560096088582, -0.13334044787535415, -0.07444179111101826, 0.39709506968995656, -0.09014194998987682, -0.23781656733280077, 0.20355603633404598, -0.10966509212227782, -0.14865424572270733, 0.10458435859599428, 0.12492761353313611, 0.12885418291696157, -0.1202522026679993, 0.15550320983482818, -0.031498659480148586, 0.12301674389575379, 0.03163678188081733, 0.0436575397293215, 0.1857970991654624, 0.10512783874986761, 0.08294429634155276, 0.10995757982807712, -0.0016183397898460246, -0.16548924444667526, -0.3607036650646478, -0.12647629513146832, -0.10174528543876377, 0.048710315162803566, -0.1515296942889489, -0.20772929381364616, 0.4069211552826522, 0.14847326457636986, 0.16358368266349493, 0.0718703520958463, 0.21928540150103457, 0.1197171063955961, 0.06939260783868584, 0.07781846317564257, 0.2317232303394502, 0.16097827706759044, 0.05003248776080019, -0.2121895591957563, -0.018089115227138654, 0.1125406436646523] |
1,802.00499 | High-Speed Photometry of Gaia14aae: An Eclipsing AM CVn That Challenges
Formation Models | AM CVn-type systems are ultra-compact, hydrogen-deficient accreting binaries
with degenerate or semi-degenerate donors. The evolutionary history of these
systems can be explored by constraining the properties of their donor stars. We
present high-speed photometry of Gaia14aae, an AM CVn with a binary period of
49.7 minutes and the first AM CVn in which the central white dwarf is fully
eclipsed by the donor star. Modelling of the lightcurves of this system allows
for the most precise measurement to date of the donor mass of an AM CVn, and
relies only on geometric and well-tested physical assumptions. We find a mass
ratio $q = M_2/M_1 = 0.0287 \pm 0.0020$ and masses $M_1 = 0.87 \pm 0.02
M_\odot$ and $M_2 = 0.0250 \pm 0.0013 M_\odot$. We compare these properties to
the three proposed channels for AM CVn formation. Our measured donor mass and
radius do not fit with the contraction that is predicted for AM CVn donors
descended from white dwarfs or helium stars at long orbital periods. The donor
properties we measure fall in a region of parameter space in which systems
evolved from hydrogen-dominated cataclysmic variables are expected, but such
systems should show spectroscopic hydrogen, which is not seen in Gaia14aae. The
evolutionary history of this system is therefore not clear. We consider a
helium-burning star or an evolved cataclysmic variable to be the most likely
progenitors, but both models require additional processes and/or fine-tuning to
fit the data. Additionally, we calculate an updated ephemeris which corrects
for an anomalous time measurement in the previously published ephemeris.
| astro-ph.SR | am cvntype systems are ultracompact hydrogendeficient accreting binaries with degenerate or semidegenerate donors the evolutionary history of these systems can be explored by constraining the properties of their donor stars we present highspeed photometry of gaia14aae an am cvn with a binary period of 497 minutes and the first am cvn in which the central white dwarf is fully eclipsed by the donor star modelling of the lightcurves of this system allows for the most precise measurement to date of the donor mass of an am cvn and relies only on geometric and welltested physical assumptions we find a mass ratio q m_2m_1 00287 pm 00020 and masses m_1 087 pm 002 m_odot and m_2 00250 pm 00013 m_odot we compare these properties to the three proposed channels for am cvn formation our measured donor mass and radius do not fit with the contraction that is predicted for am cvn donors descended from white dwarfs or helium stars at long orbital periods the donor properties we measure fall in a region of parameter space in which systems evolved from hydrogendominated cataclysmic variables are expected but such systems should show spectroscopic hydrogen which is not seen in gaia14aae the evolutionary history of this system is therefore not clear we consider a heliumburning star or an evolved cataclysmic variable to be the most likely progenitors but both models require additional processes andor finetuning to fit the data additionally we calculate an updated ephemeris which corrects for an anomalous time measurement in the previously published ephemeris | [['am', 'cvntype', 'systems', 'are', 'ultracompact', 'hydrogendeficient', 'accreting', 'binaries', 'with', 'degenerate', 'or', 'semidegenerate', 'donors', 'the', 'evolutionary', 'history', 'of', 'these', 'systems', 'can', 'be', 'explored', 'by', 'constraining', 'the', 'properties', 'of', 'their', 'donor', 'stars', 'we', 'present', 'highspeed', 'photometry', 'of', 'gaia14aae', 'an', 'am', 'cvn', 'with', 'a', 'binary', 'period', 'of', '497', 'minutes', 'and', 'the', 'first', 'am', 'cvn', 'in', 'which', 'the', 'central', 'white', 'dwarf', 'is', 'fully', 'eclipsed', 'by', 'the', 'donor', 'star', 'modelling', 'of', 'the', 'lightcurves', 'of', 'this', 'system', 'allows', 'for', 'the', 'most', 'precise', 'measurement', 'to', 'date', 'of', 'the', 'donor', 'mass', 'of', 'an', 'am', 'cvn', 'and', 'relies', 'only', 'on', 'geometric', 'and', 'welltested', 'physical', 'assumptions', 'we', 'find', 'a', 'mass', 'ratio', 'q', 'm_2m_1', '00287', 'pm', '00020', 'and', 'masses', 'm_1', '087', 'pm', '002', 'm_odot', 'and', 'm_2', '00250', 'pm', '00013', 'm_odot', 'we', 'compare', 'these', 'properties', 'to', 'the', 'three', 'proposed', 'channels', 'for', 'am', 'cvn', 'formation', 'our', 'measured', 'donor', 'mass', 'and', 'radius', 'do', 'not', 'fit', 'with', 'the', 'contraction', 'that', 'is', 'predicted', 'for', 'am', 'cvn', 'donors', 'descended', 'from', 'white', 'dwarfs', 'or', 'helium', 'stars', 'at', 'long', 'orbital', 'periods', 'the', 'donor', 'properties', 'we', 'measure', 'fall', 'in', 'a', 'region', 'of', 'parameter', 'space', 'in', 'which', 'systems', 'evolved', 'from', 'hydrogendominated', 'cataclysmic', 'variables', 'are', 'expected', 'but', 'such', 'systems', 'should', 'show', 'spectroscopic', 'hydrogen', 'which', 'is', 'not', 'seen', 'in', 'gaia14aae', 'the', 'evolutionary', 'history', 'of', 'this', 'system', 'is', 'therefore', 'not', 'clear', 'we', 'consider', 'a', 'heliumburning', 'star', 'or', 'an', 'evolved', 'cataclysmic', 'variable', 'to', 'be', 'the', 'most', 'likely', 'progenitors', 'but', 'both', 'models', 'require', 'additional', 'processes', 'andor', 'finetuning', 'to', 'fit', 'the', 'data', 'additionally', 'we', 'calculate', 'an', 'updated', 'ephemeris', 'which', 'corrects', 'for', 'an', 'anomalous', 'time', 'measurement', 'in', 'the', 'previously', 'published', 'ephemeris']] | [-0.0963206870514502, 0.15683279837567493, -0.050472556493749376, 0.08219591655635934, -0.10151923662870607, -0.16410805906165435, 0.10074566234282324, 0.3807122625351659, -0.17983522660040532, -0.35896998259198404, 0.08446368393386998, -0.2873151565442601, -0.049271555561314635, 0.2062491869379991, -0.1253425689026936, -0.018097299794397746, 0.13350410650856057, -0.016891941112068595, -0.10765212666120917, -0.2729165824903212, 0.2858056711367048, 0.02478791999984017, 0.07428161051536619, -0.1067269147413308, 0.041175151669204955, -0.044755412807702843, -0.031445440402914304, -0.11465648040665487, -0.1756782582106601, 0.012689930865386494, 0.21998240963402935, 0.129701929558952, 0.1563255483553314, -0.3210329146210929, -0.19925715176852443, 0.0510323721963338, 0.18711846217645606, 0.03887853696353351, -0.057061982316723305, -0.22128469249364283, 0.08391085068010559, -0.24826235258988594, -0.1313296578715927, 0.018137939292716652, 0.12506611589636846, 0.036547245462829975, -0.2760363928347885, 0.12279726246513588, 0.08976761812506162, 0.05972388479490525, -0.17410921012677194, -0.17739567588260138, -0.07619188929514098, 0.07304185387869863, 0.009232330413465295, 0.06999766001875399, 0.10569296262536212, -0.07474961518512471, -0.038683165087025954, 0.375117174731181, -0.08693387400793287, -0.04727230636642697, 0.21696810867166214, -0.1645503759001319, -0.17223662915667187, 0.09472267360982334, 0.141674947091139, 0.18313836474468556, -0.21295380124844346, -0.022473779219394117, 0.046961669995552555, 0.2538228087355438, -0.008464214668090164, 0.07406685931659616, 0.36030888595211547, 0.14334837872518424, -0.02223782921890938, 0.002948161642059772, -0.22033920306473118, -0.05542693746537559, -0.18648282689660817, -0.11806246234111399, -0.1294616240977674, 0.12780013533414705, -0.08506916850133939, -0.12002397528131724, 0.31577545109944855, 0.10639419470220737, 0.20799834238137063, -0.0011615128635535598, 0.2751850411240674, 0.1306097139305299, 0.09017775139409963, 0.11982636391544133, 0.3214536669145047, 0.19884838753383563, 0.1039283552184966, -0.24188853330678295, 0.10177662595554361, 0.01101827537162384] |
1,802.005 | Goal-Oriented Chatbot Dialog Management Bootstrapping with Transfer
Learning | Goal-Oriented (GO) Dialogue Systems, colloquially known as goal oriented
chatbots, help users achieve a predefined goal (e.g. book a movie ticket)
within a closed domain. A first step is to understand the user's goal by using
natural language understanding techniques. Once the goal is known, the bot must
manage a dialogue to achieve that goal, which is conducted with respect to a
learnt policy. The success of the dialogue system depends on the quality of the
policy, which is in turn reliant on the availability of high-quality training
data for the policy learning method, for instance Deep Reinforcement Learning.
Due to the domain specificity, the amount of available data is typically too
low to allow the training of good dialogue policies. In this paper we introduce
a transfer learning method to mitigate the effects of the low in-domain data
availability. Our transfer learning based approach improves the bot's success
rate by 20% in relative terms for distant domains and we more than double it
for close domains, compared to the model without transfer learning. Moreover,
the transfer learning chatbots learn the policy up to 5 to 10 times faster.
Finally, as the transfer learning approach is complementary to additional
processing such as warm-starting, we show that their joint application gives
the best outcomes.
| cs.CL | goaloriented go dialogue systems colloquially known as goal oriented chatbots help users achieve a predefined goal eg book a movie ticket within a closed domain a first step is to understand the users goal by using natural language understanding techniques once the goal is known the bot must manage a dialogue to achieve that goal which is conducted with respect to a learnt policy the success of the dialogue system depends on the quality of the policy which is in turn reliant on the availability of highquality training data for the policy learning method for instance deep reinforcement learning due to the domain specificity the amount of available data is typically too low to allow the training of good dialogue policies in this paper we introduce a transfer learning method to mitigate the effects of the low indomain data availability our transfer learning based approach improves the bots success rate by 20 in relative terms for distant domains and we more than double it for close domains compared to the model without transfer learning moreover the transfer learning chatbots learn the policy up to 5 to 10 times faster finally as the transfer learning approach is complementary to additional processing such as warmstarting we show that their joint application gives the best outcomes | [['goaloriented', 'go', 'dialogue', 'systems', 'colloquially', 'known', 'as', 'goal', 'oriented', 'chatbots', 'help', 'users', 'achieve', 'a', 'predefined', 'goal', 'eg', 'book', 'a', 'movie', 'ticket', 'within', 'a', 'closed', 'domain', 'a', 'first', 'step', 'is', 'to', 'understand', 'the', 'users', 'goal', 'by', 'using', 'natural', 'language', 'understanding', 'techniques', 'once', 'the', 'goal', 'is', 'known', 'the', 'bot', 'must', 'manage', 'a', 'dialogue', 'to', 'achieve', 'that', 'goal', 'which', 'is', 'conducted', 'with', 'respect', 'to', 'a', 'learnt', 'policy', 'the', 'success', 'of', 'the', 'dialogue', 'system', 'depends', 'on', 'the', 'quality', 'of', 'the', 'policy', 'which', 'is', 'in', 'turn', 'reliant', 'on', 'the', 'availability', 'of', 'highquality', 'training', 'data', 'for', 'the', 'policy', 'learning', 'method', 'for', 'instance', 'deep', 'reinforcement', 'learning', 'due', 'to', 'the', 'domain', 'specificity', 'the', 'amount', 'of', 'available', 'data', 'is', 'typically', 'too', 'low', 'to', 'allow', 'the', 'training', 'of', 'good', 'dialogue', 'policies', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'transfer', 'learning', 'method', 'to', 'mitigate', 'the', 'effects', 'of', 'the', 'low', 'indomain', 'data', 'availability', 'our', 'transfer', 'learning', 'based', 'approach', 'improves', 'the', 'bots', 'success', 'rate', 'by', '20', 'in', 'relative', 'terms', 'for', 'distant', 'domains', 'and', 'we', 'more', 'than', 'double', 'it', 'for', 'close', 'domains', 'compared', 'to', 'the', 'model', 'without', 'transfer', 'learning', 'moreover', 'the', 'transfer', 'learning', 'chatbots', 'learn', 'the', 'policy', 'up', 'to', '5', 'to', '10', 'times', 'faster', 'finally', 'as', 'the', 'transfer', 'learning', 'approach', 'is', 'complementary', 'to', 'additional', 'processing', 'such', 'as', 'warmstarting', 'we', 'show', 'that', 'their', 'joint', 'application', 'gives', 'the', 'best', 'outcomes']] | [-0.039701044042441694, 0.00853269358336086, -0.055269076657249755, 0.08972930376573156, -0.15676803089144853, -0.1535368189893383, 0.10798410892960979, 0.4313867775102456, -0.2721614370245799, -0.36006199110199877, 0.09214193963810818, -0.2652071808080053, -0.13872217456810176, 0.2073311475335135, -0.15003503764161902, 0.07109982760824228, 0.10799638760612815, 0.08624178332608945, -0.03778906626093416, -0.2901611916366702, 0.33130558898908574, 0.0702584310741647, 0.3585678255841346, 0.016955311130295057, 0.12408051847245494, -0.025053015196293663, -0.00441215593507732, -0.058096284643875895, -0.08060637673729552, 0.19273925884386323, 0.36463601105330523, 0.21367025853707478, 0.3755017661144126, -0.38579862103076046, -0.17483590222335477, 0.07692898650426296, 0.1400969555136773, 0.11328785488067168, -0.02843269339726829, -0.29405031616891353, 0.10483208729351538, -0.2033100655136254, -0.013547618773945131, -0.11766121774352213, -0.033019109836783904, -0.008870615265354024, -0.3013489453964801, -0.028938477631535887, 0.08795107440371093, 0.0533950132811923, -0.05515276535497235, -0.07941070363907135, 0.03948245284217519, 0.2213745958044985, 0.052823903980804825, 0.11222413180509644, 0.15414344490518872, -0.1723861939923077, -0.14452860768099574, 0.38069246331570855, -0.07070330330210316, -0.2030819094479696, 0.2066728764207063, -0.045169190577987774, -0.10838950343239842, 0.10704077341065833, 0.2536429220765715, 0.12657892788069525, -0.16659557004568512, 0.00033397552450165644, 0.0087359953942783, 0.2054243312236971, 0.031976081694349505, -0.01864326996029193, 0.15835944364096602, 0.25832446463441067, 0.0816413715608558, 0.11329217529046773, -0.05172611681849394, -0.09802177155438478, -0.21066404828810495, -0.13505816033455442, -0.19718669444877882, 0.01892774778816132, -0.07044170989031617, -0.10091903855011114, 0.3408547080397396, 0.219456416952638, 0.19470236935333607, 0.09684682209831728, 0.3288469773240632, 0.038020764101797305, 0.11029387152963646, 0.09230747599069448, 0.1808418567700119, 0.011606480626765411, 0.17834960590575782, -0.20765678521121103, 0.13268914082887726, -0.004655580658316962] |
1,802.00501 | Evolutionary branching via replicator-mutator equations | We consider a class of non-local reaction-diffusion problems, referred to as
replicator-mutator equations in evolutionary genetics. For a confining fitness
function, we prove well-posedness and write the solution explicitly, via some
underlying Schr\"odinger spectral elements (for which we provide new and
non-standard estimates). As a consequence, the long time behaviour is
determined by the principal eigenfunction or ground state. Based on this, we
discuss (rigorously and via numerical explorations) the conditions on the
fitness function and the mutation rate for evolutionary branching to occur.
| math.AP | we consider a class of nonlocal reactiondiffusion problems referred to as replicatormutator equations in evolutionary genetics for a confining fitness function we prove wellposedness and write the solution explicitly via some underlying schrodinger spectral elements for which we provide new and nonstandard estimates as a consequence the long time behaviour is determined by the principal eigenfunction or ground state based on this we discuss rigorously and via numerical explorations the conditions on the fitness function and the mutation rate for evolutionary branching to occur | [['we', 'consider', 'a', 'class', 'of', 'nonlocal', 'reactiondiffusion', 'problems', 'referred', 'to', 'as', 'replicatormutator', 'equations', 'in', 'evolutionary', 'genetics', 'for', 'a', 'confining', 'fitness', 'function', 'we', 'prove', 'wellposedness', 'and', 'write', 'the', 'solution', 'explicitly', 'via', 'some', 'underlying', 'schrodinger', 'spectral', 'elements', 'for', 'which', 'we', 'provide', 'new', 'and', 'nonstandard', 'estimates', 'as', 'a', 'consequence', 'the', 'long', 'time', 'behaviour', 'is', 'determined', 'by', 'the', 'principal', 'eigenfunction', 'or', 'ground', 'state', 'based', 'on', 'this', 'we', 'discuss', 'rigorously', 'and', 'via', 'numerical', 'explorations', 'the', 'conditions', 'on', 'the', 'fitness', 'function', 'and', 'the', 'mutation', 'rate', 'for', 'evolutionary', 'branching', 'to', 'occur']] | [-0.07763725502341653, 0.07219787123834803, -0.07780963122024245, 0.12624442321248353, -0.06896110405380439, -0.12424906951353132, 0.05646527085142831, 0.33618927319462055, -0.2960326686568026, -0.22544977874938577, 0.1510167956765231, -0.1969125950431806, -0.19567416781570673, 0.14754658021376513, -0.03007012295226256, 0.06787921286498506, 0.07454854359162882, 0.012752646428236317, -0.03173440035122136, -0.2005948755984372, 0.3474226295726285, -0.02775683261764546, 0.2046197328710973, 0.0308834970762421, 0.12399125175683626, 0.017901739811003653, -0.001664081513549068, -0.007604988142182785, -0.22080221342011577, 0.06936337398448293, 0.22956608513015367, 0.15379971359756642, 0.3099652124967958, -0.43326146902871276, -0.20823399751887856, 0.13921073580249435, 0.1450908427082357, 0.15388138294413997, -0.056186643129746826, -0.30367729346090483, 0.06074685433469269, -0.12850007221900991, -0.17750983825507796, -0.08050103138555728, 0.01732624304436502, 0.08126328763596359, -0.30763523413666655, 0.10978468968061775, 0.01382127042493916, 0.05340188737249091, -0.11028607535713707, -0.13348809288193783, -0.0134775336953767, 0.10696555658276859, 0.06440970473340712, -0.026305671121614676, 0.07876333141965526, -0.11856938447038244, -0.12945130654857384, 0.3505679608954649, -0.11493651968027864, -0.26497236817314324, 0.20804754616082868, -0.08789854144699694, -0.1288653745570974, 0.05765514458263559, 0.18324220037486935, 0.13950232432467774, -0.16606985303085475, 0.09703465174451205, 0.0007327345222057332, 0.12618533844527388, 0.04481863423383662, 0.03574637989957063, 0.12016687626462608, 0.18045413323921994, 0.10739228532405659, 0.13125010625143269, -0.018404822353096234, -0.1604939824125419, -0.3206996486960201, -0.17064989987938178, -0.16779601284014506, 0.121352444785381, -0.08801330780053311, -0.20521280360186384, 0.41319798512960826, 0.12330984238845606, 0.20772433209986912, 0.10889822606778969, 0.19804130572343379, 0.19601590510934502, 0.008664006666679467, 0.03462243772948915, 0.16914090186730305, 0.13930853492846446, 0.10485756688839978, -0.2738290458995228, 0.09580382144139592, 0.15444327992320592] |
1,802.00502 | Unfair and Anomalous Evolutionary Dynamics from Fluctuating Payoffs | Evolution occurs in populations of reproducing individuals. Reproduction
depends on the payoff a strategy receives. The payoff depends on the
environment that may change over time, on intrinsic uncertainties, and on other
sources of randomness. These temporal variations in the payoffs can affect
which traits evolve. Understanding evolutionary game dynamics that are affected
by varying payoffs remains difficult. Here we study the impact of arbitrary
amplitudes and covariances of temporally varying payoffs on the dynamics. The
evolutionary dynamics may be "unfair", meaning that, on average, two coexisting
strategies may persistently receive different payoffs. This mechanism can
induce an anomalous coexistence of cooperators and defectors in the Prisoner's
Dilemma, and an unexpected selection reversal in the Hawk-Dove game.
| q-bio.PE physics.bio-ph | evolution occurs in populations of reproducing individuals reproduction depends on the payoff a strategy receives the payoff depends on the environment that may change over time on intrinsic uncertainties and on other sources of randomness these temporal variations in the payoffs can affect which traits evolve understanding evolutionary game dynamics that are affected by varying payoffs remains difficult here we study the impact of arbitrary amplitudes and covariances of temporally varying payoffs on the dynamics the evolutionary dynamics may be unfair meaning that on average two coexisting strategies may persistently receive different payoffs this mechanism can induce an anomalous coexistence of cooperators and defectors in the prisoners dilemma and an unexpected selection reversal in the hawkdove game | [['evolution', 'occurs', 'in', 'populations', 'of', 'reproducing', 'individuals', 'reproduction', 'depends', 'on', 'the', 'payoff', 'a', 'strategy', 'receives', 'the', 'payoff', 'depends', 'on', 'the', 'environment', 'that', 'may', 'change', 'over', 'time', 'on', 'intrinsic', 'uncertainties', 'and', 'on', 'other', 'sources', 'of', 'randomness', 'these', 'temporal', 'variations', 'in', 'the', 'payoffs', 'can', 'affect', 'which', 'traits', 'evolve', 'understanding', 'evolutionary', 'game', 'dynamics', 'that', 'are', 'affected', 'by', 'varying', 'payoffs', 'remains', 'difficult', 'here', 'we', 'study', 'the', 'impact', 'of', 'arbitrary', 'amplitudes', 'and', 'covariances', 'of', 'temporally', 'varying', 'payoffs', 'on', 'the', 'dynamics', 'the', 'evolutionary', 'dynamics', 'may', 'be', 'unfair', 'meaning', 'that', 'on', 'average', 'two', 'coexisting', 'strategies', 'may', 'persistently', 'receive', 'different', 'payoffs', 'this', 'mechanism', 'can', 'induce', 'an', 'anomalous', 'coexistence', 'of', 'cooperators', 'and', 'defectors', 'in', 'the', 'prisoners', 'dilemma', 'and', 'an', 'unexpected', 'selection', 'reversal', 'in', 'the', 'hawkdove', 'game']] | [-0.1726398914724063, 0.18778606141448762, -0.15815192283903304, 0.12055326177754527, -0.0619560356817057, -0.17314428263383672, 0.12236948285856818, 0.450266128549209, -0.2681129399496011, -0.27681149308307046, 0.06215104710660938, -0.2558115727873121, -0.18692699179021466, 0.06402512993185948, -0.1546086780448309, -0.1184954332947954, 0.03703919185413063, -0.0032672582544450066, 0.033663857399891965, -0.3082610269785564, 0.35363755627877563, 0.02824976105784249, 0.26379508199966234, -0.0011389591595810703, 0.09821527562120086, -0.0009355277587205935, -0.04090874130702299, 0.04076583650954163, -0.09207267115089364, 0.022382951592310116, 0.2388402616414122, 0.15587612636323667, 0.3604536854829162, -0.44581972126267916, -0.19356370877283505, 0.15476378071734792, 0.1745004707461812, 0.1286937631218909, 0.00653191533488914, -0.28490399602705085, -0.027017487628926706, -0.13937659561260937, -0.07651891103949653, -0.027031764674645204, 0.027595953689490117, 0.05349947315736268, -0.2789776343812481, 0.052028766284004234, -0.008247496472655708, 0.06377835134760691, -0.09838440418084207, -0.12862304794705576, -0.0829165879613123, 0.21801196249265575, 0.058037670848604575, -0.062495654844877936, 0.19991209474497953, -0.17033229013467127, -0.19641837390123779, 0.3428975406210296, -0.05524925736742269, -0.17813265349110988, 0.2003743823649537, -0.17193980883154222, -0.10643154666480473, 0.11903974963909286, 0.23084383282679108, 0.11577776850909631, -0.11414354511051096, 0.005292470803739041, -0.008114440207425347, 0.20088533088405672, 0.05411489133953921, 0.11232474562513013, 0.21998867671140748, 0.17715239848018202, 0.10490109589006592, 0.036669693862856165, 0.005465987604111433, -0.2530269827852901, -0.21554429077296558, -0.03473026630205986, -0.11031573786376378, 0.06800570718048073, -0.13685863249304378, -0.13376812877425273, 0.3876573429423042, 0.16057517605487448, 0.131044876224433, 0.06521150254162872, 0.25105679237371326, 0.09962592641703594, -0.0007619609196598714, 0.019934879424862374, 0.2001240002663018, 0.03007982717627962, 0.10344321283702858, -0.3308154507759067, 0.29255435714084244, -0.029071217462515984] |
1,802.00503 | The bipolar jet of the symbiotic star R Aquarii: A study of its
morphology using the high-resolution HST WFC3/UVIS camera | R Aqr is a symbiotic binary system consisting of a Mira variable with a
pulsation period of 387 days and a hot companion which is presumably a white
dwarf with an accretion disk. This binary system is the source of a prominent
bipolar gaseous outflow. We use high spatial resolution and sensitive images
from the Hubble Space Telescope to identify and investigate the different
structural components that form the complex morphology of the R Aqr jet .
Methods. We present new high-resolution HST WFC3/UVIS narrow-band images of the
R Aqr jet obtained in 2013/14 in the light of the [OIII] 5007, [OI] 6300, [NII]
6583, and Ha emission lines. These images also allow us to produce detailed
maps of the jet flow in several line ratios such as [OIII]/[OI] and [NII]/[OI]
which are sensitive to the outflow temperature and its hydrogen ionisation
fraction. The new emission maps together with archival HST data are used to
derive and analyse the proper motion of prominent emitting features which can
be traced over 20 years with the HST observations. The images reveal the fine
gas structure of the jet out to distances of a few ten arcseconds from the
central region, as well as in the innermost region, within a few arcseconds
around the stellar source. They reveal for the first time the straight
highly-collimated jet component which can be traced to up to 900 AU in the NE
direction. Images in [OIII], [OI], and [NII] clearly show a helical pattern in
the jet beams which may derive from the small-scale precession of the jet. The
highly-collimated jet is accompanied by a wide opening angle outflow which is
filled by low excitation gas. The position angles of the jet structures as well
as their opening angles are calculated. Our measurements of the proper motions
of some prominent emission knots confirm the scenario of gas acceleration
during the propagation of the outflow.
| astro-ph.SR astro-ph.GA | r aqr is a symbiotic binary system consisting of a mira variable with a pulsation period of 387 days and a hot companion which is presumably a white dwarf with an accretion disk this binary system is the source of a prominent bipolar gaseous outflow we use high spatial resolution and sensitive images from the hubble space telescope to identify and investigate the different structural components that form the complex morphology of the r aqr jet methods we present new highresolution hst wfc3uvis narrowband images of the r aqr jet obtained in 201314 in the light of the oiii 5007 oi 6300 nii 6583 and ha emission lines these images also allow us to produce detailed maps of the jet flow in several line ratios such as oiiioi and niioi which are sensitive to the outflow temperature and its hydrogen ionisation fraction the new emission maps together with archival hst data are used to derive and analyse the proper motion of prominent emitting features which can be traced over 20 years with the hst observations the images reveal the fine gas structure of the jet out to distances of a few ten arcseconds from the central region as well as in the innermost region within a few arcseconds around the stellar source they reveal for the first time the straight highlycollimated jet component which can be traced to up to 900 au in the ne direction images in oiii oi and nii clearly show a helical pattern in the jet beams which may derive from the smallscale precession of the jet the highlycollimated jet is accompanied by a wide opening angle outflow which is filled by low excitation gas the position angles of the jet structures as well as their opening angles are calculated our measurements of the proper motions of some prominent emission knots confirm the scenario of gas acceleration during the propagation of the outflow | [['r', 'aqr', 'is', 'a', 'symbiotic', 'binary', 'system', 'consisting', 'of', 'a', 'mira', 'variable', 'with', 'a', 'pulsation', 'period', 'of', '387', 'days', 'and', 'a', 'hot', 'companion', 'which', 'is', 'presumably', 'a', 'white', 'dwarf', 'with', 'an', 'accretion', 'disk', 'this', 'binary', 'system', 'is', 'the', 'source', 'of', 'a', 'prominent', 'bipolar', 'gaseous', 'outflow', 'we', 'use', 'high', 'spatial', 'resolution', 'and', 'sensitive', 'images', 'from', 'the', 'hubble', 'space', 'telescope', 'to', 'identify', 'and', 'investigate', 'the', 'different', 'structural', 'components', 'that', 'form', 'the', 'complex', 'morphology', 'of', 'the', 'r', 'aqr', 'jet', 'methods', 'we', 'present', 'new', 'highresolution', 'hst', 'wfc3uvis', 'narrowband', 'images', 'of', 'the', 'r', 'aqr', 'jet', 'obtained', 'in', '201314', 'in', 'the', 'light', 'of', 'the', 'oiii', '5007', 'oi', '6300', 'nii', '6583', 'and', 'ha', 'emission', 'lines', 'these', 'images', 'also', 'allow', 'us', 'to', 'produce', 'detailed', 'maps', 'of', 'the', 'jet', 'flow', 'in', 'several', 'line', 'ratios', 'such', 'as', 'oiiioi', 'and', 'niioi', 'which', 'are', 'sensitive', 'to', 'the', 'outflow', 'temperature', 'and', 'its', 'hydrogen', 'ionisation', 'fraction', 'the', 'new', 'emission', 'maps', 'together', 'with', 'archival', 'hst', 'data', 'are', 'used', 'to', 'derive', 'and', 'analyse', 'the', 'proper', 'motion', 'of', 'prominent', 'emitting', 'features', 'which', 'can', 'be', 'traced', 'over', '20', 'years', 'with', 'the', 'hst', 'observations', 'the', 'images', 'reveal', 'the', 'fine', 'gas', 'structure', 'of', 'the', 'jet', 'out', 'to', 'distances', 'of', 'a', 'few', 'ten', 'arcseconds', 'from', 'the', 'central', 'region', 'as', 'well', 'as', 'in', 'the', 'innermost', 'region', 'within', 'a', 'few', 'arcseconds', 'around', 'the', 'stellar', 'source', 'they', 'reveal', 'for', 'the', 'first', 'time', 'the', 'straight', 'highlycollimated', 'jet', 'component', 'which', 'can', 'be', 'traced', 'to', 'up', 'to', '900', 'au', 'in', 'the', 'ne', 'direction', 'images', 'in', 'oiii', 'oi', 'and', 'nii', 'clearly', 'show', 'a', 'helical', 'pattern', 'in', 'the', 'jet', 'beams', 'which', 'may', 'derive', 'from', 'the', 'smallscale', 'precession', 'of', 'the', 'jet', 'the', 'highlycollimated', 'jet', 'is', 'accompanied', 'by', 'a', 'wide', 'opening', 'angle', 'outflow', 'which', 'is', 'filled', 'by', 'low', 'excitation', 'gas', 'the', 'position', 'angles', 'of', 'the', 'jet', 'structures', 'as', 'well', 'as', 'their', 'opening', 'angles', 'are', 'calculated', 'our', 'measurements', 'of', 'the', 'proper', 'motions', 'of', 'some', 'prominent', 'emission', 'knots', 'confirm', 'the', 'scenario', 'of', 'gas', 'acceleration', 'during', 'the', 'propagation', 'of', 'the', 'outflow']] | [-0.08206657778697148, 0.06921770124190804, -0.04932006107133237, 0.05388594726617965, -0.09172799425598765, -0.10714308551941362, 0.0016855079614158189, 0.4722265340387821, -0.24432255988940596, -0.319929733690584, 0.07816741891345748, -0.259726964159026, 0.012377891939369933, 0.1876891930166277, -0.013170704015878044, -0.02314275642487383, 0.07073674128789986, -0.10306034353432349, -0.04248334394087867, -0.16874821328364925, 0.2923816735250136, 0.09453519652523691, 0.13111060175616, 0.01354480345275194, 0.09280233830398334, -0.10243414109129281, -0.07263497997949359, -0.01142491067783715, -0.10857823574187933, 0.06874039682711194, 0.21775035623254047, 0.11379131374488925, 0.18577615048011972, -0.33785208793992677, -0.21374773129761693, -0.012942934407305623, 0.18815525516660678, 0.018119526134863024, 0.0054508779456632, -0.3005610231997534, 0.03284699247026491, -0.1790399767134139, -0.15349340712474216, 0.04139732555523219, 0.04766571853302478, 0.04267462159817417, -0.22778408188790467, 0.09097273266303264, 0.005904472856560633, 0.11285752067490229, -0.0684025763500748, -0.0587810712371258, -0.07823549927330561, 0.07447324844432018, 0.037440395344137435, 0.10444727102775009, 0.1879291499210965, -0.1377706482836474, -0.05214904667846563, 0.41545480134220614, -0.0869409571560691, -0.028249185476526027, 0.23127268922130859, -0.2325793658190089, -0.14244186566322156, 0.23844398393901803, 0.15700521490403585, 0.14221967457080378, -0.1146433696403013, -0.03274510966397689, -0.06831140043583536, 0.21096101797570194, 0.06313891384440164, 0.07776597230103872, 0.31639393212214584, 0.07117070027050518, 0.008006025913022716, 0.13768254781662975, -0.31174631769074096, -0.03192678828989821, -0.2770811749001344, -0.14180939403613882, -0.09494434939401727, 0.06507197023842425, -0.13823271335900894, -0.12812438130023934, 0.38559801014332423, 0.08270637179172362, 0.26881168879095524, -0.023937705802982524, 0.31234922279078986, 0.05466761941400667, 0.10256445499137967, 0.12551504054156665, 0.30576936355025125, 0.18085781091321557, 0.14720760498801985, -0.21909645996056498, 0.06694572400745182, 0.0054961740216683775] |
1,802.00504 | Three dimensional spectrometer | We present a novel design of 3D spectrometer that can retrieve 3D spectral
profile in a single measurement. The 3D spectrometer design is built upon the
concept of compressed sensing to make it possible to retrieve 3D information
from 2D data from a screen/camera. In contrast to common spectrometers, the 3D
spectrometer uses a wide slit instead of a narrow slit and retrieve the 3D
datacube that consists of 2D spatial and 1D spectral information. Numerical
tests were performed to simulate the retrieval of spectral profiles. The
results show that the retrieved profiles match well the original profiles. It
is also shown that the retrieved signal from the 3D spectrometer is robust
enough for a further post-processing analysis.
| physics.ins-det physics.optics | we present a novel design of 3d spectrometer that can retrieve 3d spectral profile in a single measurement the 3d spectrometer design is built upon the concept of compressed sensing to make it possible to retrieve 3d information from 2d data from a screencamera in contrast to common spectrometers the 3d spectrometer uses a wide slit instead of a narrow slit and retrieve the 3d datacube that consists of 2d spatial and 1d spectral information numerical tests were performed to simulate the retrieval of spectral profiles the results show that the retrieved profiles match well the original profiles it is also shown that the retrieved signal from the 3d spectrometer is robust enough for a further postprocessing analysis | [['we', 'present', 'a', 'novel', 'design', 'of', '3d', 'spectrometer', 'that', 'can', 'retrieve', '3d', 'spectral', 'profile', 'in', 'a', 'single', 'measurement', 'the', '3d', 'spectrometer', 'design', 'is', 'built', 'upon', 'the', 'concept', 'of', 'compressed', 'sensing', 'to', 'make', 'it', 'possible', 'to', 'retrieve', '3d', 'information', 'from', '2d', 'data', 'from', 'a', 'screencamera', 'in', 'contrast', 'to', 'common', 'spectrometers', 'the', '3d', 'spectrometer', 'uses', 'a', 'wide', 'slit', 'instead', 'of', 'a', 'narrow', 'slit', 'and', 'retrieve', 'the', '3d', 'datacube', 'that', 'consists', 'of', '2d', 'spatial', 'and', '1d', 'spectral', 'information', 'numerical', 'tests', 'were', 'performed', 'to', 'simulate', 'the', 'retrieval', 'of', 'spectral', 'profiles', 'the', 'results', 'show', 'that', 'the', 'retrieved', 'profiles', 'match', 'well', 'the', 'original', 'profiles', 'it', 'is', 'also', 'shown', 'that', 'the', 'retrieved', 'signal', 'from', 'the', '3d', 'spectrometer', 'is', 'robust', 'enough', 'for', 'a', 'further', 'postprocessing', 'analysis']] | [0.004273041574340154, 0.027743789864879135, -0.11903602403835353, 0.015884889272821702, -0.07396878795718186, -0.17797980440828282, -0.014735652509933481, 0.42063334724332535, -0.25004851737688494, -0.35641635081961626, 0.1052057917894493, -0.2882954066651117, -0.11771547653250651, 0.21225646051426983, -0.05494680426393946, 0.11811164413274337, 0.11288669710166943, -0.014753031962288495, -0.1198437865719032, -0.12430830623528673, 0.285715716617365, 0.09994126657326506, 0.33940037181521326, -0.021381114697099753, 0.0870540424888858, 0.022064508127971973, -0.09774262602958414, 0.015317983909422515, -0.11562699373362736, 0.13277685335781583, 0.22599392239020294, 0.1679013997831772, 0.17656632700664365, -0.42050137194112325, -0.2577395773707674, -0.007353053635193242, 0.16020432746626884, 0.09549045873184998, -0.0978414239282282, -0.29576798782556546, 0.0804957212625533, -0.09411435513000967, -0.09912579258282979, -0.07504611905031384, -0.03621986309567896, 0.0028881020843982697, -0.3209279044571086, 0.0021296990177152343, 0.009463524886677599, 0.044995469900851064, -0.08803279342480068, -0.02909864656230172, -0.02454941870811849, 0.1785260595691701, -0.07992114101807213, 0.01550546968773676, 0.13019955619516918, -0.12044724919602838, -0.045822486847551525, 0.4130504401639486, -0.07354585949130532, -0.1659088211500237, 0.16932041064883846, -0.1771089296397936, -0.08027263831856668, 0.2005087403485026, 0.1632794813873867, 0.12727440039539695, -0.13484735772586787, 0.012954639464927217, -0.10262325366274413, 0.2850184655214986, 0.02896643119951726, 0.00940839533940849, 0.21643118469967929, 0.12841575497385257, 0.01756059934791082, 0.18114080954876402, -0.2595666452892061, -0.029163014088482715, -0.22882119711074564, -0.17892668861298797, -0.23138615334183615, -0.035678430567853726, -0.047723292392772086, -0.1604906534703954, 0.41249455974047256, 0.21354506554432276, 0.22547391169648776, 0.006875369041107404, 0.3745899536511582, 0.05986302494843546, 0.11682123166228382, -0.003384795959274738, 0.21227547354423082, 0.10529451528524296, 0.19756687709536308, -0.1692059534446647, -0.0158491177428673, 0.022779262473440576] |
1,802.00505 | The spectrum of non-centrosymmetrically layered spherical cavity
resonator. I.The mode decomposition method | We develop a theoretical method for solving Maxwell's equations to obtain the
frequency spectra of inhomogeneous and asymmetric cavity resonators using a
couple of effective Debye-type potentials. The structure we study specifically
is the layered spherical cavity resonator with symmetrically or asymmetrically
inserted inner dielectric sphere. The comparison of the exact numerical results
obtained for the frequency spectrum of layered cavity resonator with
centrosymmetrically inserted sphere and the spectrum found from the suggested
theory reveals good agreement at the initial part of the frequency axis. The
coincidence accuracy depends on the number of trial resonant modes that we use
while approving our method numerically.
| physics.comp-ph cond-mat.mes-hall | we develop a theoretical method for solving maxwells equations to obtain the frequency spectra of inhomogeneous and asymmetric cavity resonators using a couple of effective debyetype potentials the structure we study specifically is the layered spherical cavity resonator with symmetrically or asymmetrically inserted inner dielectric sphere the comparison of the exact numerical results obtained for the frequency spectrum of layered cavity resonator with centrosymmetrically inserted sphere and the spectrum found from the suggested theory reveals good agreement at the initial part of the frequency axis the coincidence accuracy depends on the number of trial resonant modes that we use while approving our method numerically | [['we', 'develop', 'a', 'theoretical', 'method', 'for', 'solving', 'maxwells', 'equations', 'to', 'obtain', 'the', 'frequency', 'spectra', 'of', 'inhomogeneous', 'and', 'asymmetric', 'cavity', 'resonators', 'using', 'a', 'couple', 'of', 'effective', 'debyetype', 'potentials', 'the', 'structure', 'we', 'study', 'specifically', 'is', 'the', 'layered', 'spherical', 'cavity', 'resonator', 'with', 'symmetrically', 'or', 'asymmetrically', 'inserted', 'inner', 'dielectric', 'sphere', 'the', 'comparison', 'of', 'the', 'exact', 'numerical', 'results', 'obtained', 'for', 'the', 'frequency', 'spectrum', 'of', 'layered', 'cavity', 'resonator', 'with', 'centrosymmetrically', 'inserted', 'sphere', 'and', 'the', 'spectrum', 'found', 'from', 'the', 'suggested', 'theory', 'reveals', 'good', 'agreement', 'at', 'the', 'initial', 'part', 'of', 'the', 'frequency', 'axis', 'the', 'coincidence', 'accuracy', 'depends', 'on', 'the', 'number', 'of', 'trial', 'resonant', 'modes', 'that', 'we', 'use', 'while', 'approving', 'our', 'method', 'numerically']] | [-0.1560783910890589, 0.06753904479148898, -0.06599082752555899, -0.027067248758100407, -0.05834703315591928, -0.15009845515884893, 0.0351725462078144, 0.4192672519881314, -0.18736293549351032, -0.28070808667463515, 0.04565247338156677, -0.2895836192861344, -0.1254949361217, 0.22307892534113263, 0.044793203556164195, 0.061462250994789656, 0.07597183412420157, 0.02075738051354668, -0.06229045698464423, -0.1405230513073106, 0.30544356063677414, 0.06774549420416645, 0.30387641463736165, 0.005681220030647169, 0.08315879403550214, 0.002635721721374475, 0.03439674230780706, 0.007266216002657865, -0.15033444474956748, 0.12810007172627647, 0.19683288591823458, -0.017010530190162576, 0.2302925525961028, -0.4529589817687435, -0.18119584948945683, 0.01846542962130557, 0.16038506032528302, 0.1261927147093003, -0.07626465906149446, -0.26032929337646776, 0.023905175368446243, -0.13439011377580826, -0.19990942511454368, -0.02932936394388236, -0.05033614407338708, 0.009845990199625076, -0.27208831638506914, 0.09387275974127211, 0.013071214463742613, 0.026376253916221917, -0.09812197196229533, -0.0947932728647607, 0.005030546796245917, 0.07400998965728557, 0.0055954574100962546, -0.017691574785044614, 0.15631920611937938, -0.053412623147398815, -0.0502508656919744, 0.3556617971982138, -0.08402500873729948, -0.18648650497198105, 0.1415337620515521, -0.1621104996940754, -0.008201312630898456, 0.15373837434261747, 0.1428996338825492, 0.09790014690104691, -0.07386736198525098, 0.06436246492361958, -0.041441710869266284, 0.23717634721650083, 0.13540367342676352, 0.0218887306761547, 0.21503032883629203, 0.12910147470724995, -0.00915962972144768, 0.20558967592547314, -0.07903696111068853, -0.0783520646176292, -0.2759506234772576, -0.09058809652359415, -0.1971880467382522, 0.006581538379445528, -0.10779442817613583, -0.18905029230235706, 0.41960208326831316, 0.08832319550107694, 0.1653037156177305, 0.023685361692699993, 0.3201047059474061, 0.14756099691329685, 0.05162062169531885, 0.04332804715134276, 0.31069147304713146, 0.19187566087337085, 0.0916439693814451, -0.31040005046123803, -0.06395140231487531, 0.034434475865920335] |
1,802.00506 | Dual terahertz comb spectroscopy with a single free-running fibre laser | Dual THz comb spectroscopy has the potential to be used as universal THz
spectroscopy with high spectral resolution, high spectral accuracy, and broad
spectral coverage; however, the requirement for dual stabilized femtosecond
lasers hampers its versatility due to the bulky size, high complexity, and high
cost. We here report the first demonstration of dual THz comb spectroscopy
using a single free-running fibre laser. By tuning the cavity-loss-dependent
gain profile with an intracavity Lyot filter together with precise management
of the cavity length and dispersion, dual-wavelength pulsed light beams with
slightly detuned repetition frequencies are generated in a single laser cavity.
Due to sharing of the same cavity, such pulsed light beams suffer from
common-mode fluctuation of the repetition frequency, and hence the
corresponding frequency difference between them is passively stable around a
few hundred hertz within millihertz fluctuation. This considerably stable
frequency difference enables dual THz comb spectroscopy with a single
free-running fibre laser. While greatly reducing the size, complexity, and cost
of the laser source by use of a single free-running fibre laser, the dual THz
comb spectroscopy system maintains a spectral bandwidth and dynamic range of
spectral power comparable to a system equipped with dual stabilized fibre
lasers, and can be effectively applied to high-precision spectroscopy of
acetonitrile gas at atmospheric pressure. The demonstrated results indicate
that this system is an attractive solution for practical applications of not
only THz spectroscopy but also THz-pulse-based measurements.
| physics.ins-det physics.optics | dual thz comb spectroscopy has the potential to be used as universal thz spectroscopy with high spectral resolution high spectral accuracy and broad spectral coverage however the requirement for dual stabilized femtosecond lasers hampers its versatility due to the bulky size high complexity and high cost we here report the first demonstration of dual thz comb spectroscopy using a single freerunning fibre laser by tuning the cavitylossdependent gain profile with an intracavity lyot filter together with precise management of the cavity length and dispersion dualwavelength pulsed light beams with slightly detuned repetition frequencies are generated in a single laser cavity due to sharing of the same cavity such pulsed light beams suffer from commonmode fluctuation of the repetition frequency and hence the corresponding frequency difference between them is passively stable around a few hundred hertz within millihertz fluctuation this considerably stable frequency difference enables dual thz comb spectroscopy with a single freerunning fibre laser while greatly reducing the size complexity and cost of the laser source by use of a single freerunning fibre laser the dual thz comb spectroscopy system maintains a spectral bandwidth and dynamic range of spectral power comparable to a system equipped with dual stabilized fibre lasers and can be effectively applied to highprecision spectroscopy of acetonitrile gas at atmospheric pressure the demonstrated results indicate that this system is an attractive solution for practical applications of not only thz spectroscopy but also thzpulsebased measurements | [['dual', 'thz', 'comb', 'spectroscopy', 'has', 'the', 'potential', 'to', 'be', 'used', 'as', 'universal', 'thz', 'spectroscopy', 'with', 'high', 'spectral', 'resolution', 'high', 'spectral', 'accuracy', 'and', 'broad', 'spectral', 'coverage', 'however', 'the', 'requirement', 'for', 'dual', 'stabilized', 'femtosecond', 'lasers', 'hampers', 'its', 'versatility', 'due', 'to', 'the', 'bulky', 'size', 'high', 'complexity', 'and', 'high', 'cost', 'we', 'here', 'report', 'the', 'first', 'demonstration', 'of', 'dual', 'thz', 'comb', 'spectroscopy', 'using', 'a', 'single', 'freerunning', 'fibre', 'laser', 'by', 'tuning', 'the', 'cavitylossdependent', 'gain', 'profile', 'with', 'an', 'intracavity', 'lyot', 'filter', 'together', 'with', 'precise', 'management', 'of', 'the', 'cavity', 'length', 'and', 'dispersion', 'dualwavelength', 'pulsed', 'light', 'beams', 'with', 'slightly', 'detuned', 'repetition', 'frequencies', 'are', 'generated', 'in', 'a', 'single', 'laser', 'cavity', 'due', 'to', 'sharing', 'of', 'the', 'same', 'cavity', 'such', 'pulsed', 'light', 'beams', 'suffer', 'from', 'commonmode', 'fluctuation', 'of', 'the', 'repetition', 'frequency', 'and', 'hence', 'the', 'corresponding', 'frequency', 'difference', 'between', 'them', 'is', 'passively', 'stable', 'around', 'a', 'few', 'hundred', 'hertz', 'within', 'millihertz', 'fluctuation', 'this', 'considerably', 'stable', 'frequency', 'difference', 'enables', 'dual', 'thz', 'comb', 'spectroscopy', 'with', 'a', 'single', 'freerunning', 'fibre', 'laser', 'while', 'greatly', 'reducing', 'the', 'size', 'complexity', 'and', 'cost', 'of', 'the', 'laser', 'source', 'by', 'use', 'of', 'a', 'single', 'freerunning', 'fibre', 'laser', 'the', 'dual', 'thz', 'comb', 'spectroscopy', 'system', 'maintains', 'a', 'spectral', 'bandwidth', 'and', 'dynamic', 'range', 'of', 'spectral', 'power', 'comparable', 'to', 'a', 'system', 'equipped', 'with', 'dual', 'stabilized', 'fibre', 'lasers', 'and', 'can', 'be', 'effectively', 'applied', 'to', 'highprecision', 'spectroscopy', 'of', 'acetonitrile', 'gas', 'at', 'atmospheric', 'pressure', 'the', 'demonstrated', 'results', 'indicate', 'that', 'this', 'system', 'is', 'an', 'attractive', 'solution', 'for', 'practical', 'applications', 'of', 'not', 'only', 'thz', 'spectroscopy', 'but', 'also', 'thzpulsebased', 'measurements']] | [-0.11235501759591453, 0.17320623136920596, -0.047949790825789915, -0.058676201013967075, -0.06791027984086503, -0.21694371122074255, 0.08324241980642794, 0.5010445926120465, -0.26897083456093007, -0.29398312175131225, 0.08976301502267969, -0.23128339873943873, -0.030207492375468954, 0.29274408867226004, -0.07915502305122767, 0.07665484738982024, 0.051867160312038786, -0.06723334525236266, -0.006599074908274602, -0.11620019438894505, 0.22633411495530226, 0.13444769353150055, 0.34493315048178935, 0.031028232006157966, 0.15696322563639348, -0.002710711374442945, 0.02058064854868559, -0.06936506953962306, -0.08667821612799208, 0.11802190744932345, 0.2671571991880712, 0.022070632577735057, 0.29047690969990925, -0.36001814255847575, -0.24855753291953117, 0.053563064400433624, 0.13690864152393917, 0.10763625086735974, -0.08648210730591908, -0.2510587620073335, 0.06573568303534325, -0.14632609977208552, -0.14368894240482055, -0.04964961250451334, -0.05514427124265026, 0.08825163678092723, -0.25434084629350184, -0.008078350143710231, -0.03495625796073929, 0.10458265262398314, -0.0304301486127673, -0.018463520114706394, -0.03946799066195145, 0.0352231354313962, -0.06080098888896247, 0.03843133759070584, 0.17096343966042424, -0.11468301613002699, -0.08896445464144678, 0.3580012452887728, -0.1293874997179955, -0.05904943338654777, 0.17728187091291903, -0.19805786144830526, -0.0020406245273795532, 0.24358422748467073, 0.11656216407452334, 0.12666637291141014, -0.08741370276151661, 0.0078007848133293395, 0.07639273645930943, 0.33375482512043514, 0.20185409145419822, 0.18967627273436558, 0.2203891576517948, 0.19805852105008795, 0.06618715772365635, 0.1561623876755859, -0.1420291975330056, 0.007694933456963205, -0.21732995347615253, -0.1018380165119913, -0.21330529163254702, 0.053959847757892504, -0.08959345196360137, -0.10535184740822048, 0.4231642539355349, 0.10590846174535282, 0.09253411391710348, 0.008011841997900542, 0.3627871935949364, 0.1662424461034305, 0.09549223848598752, -0.018829031914789626, 0.2912100435967775, 0.1710345802021193, 0.14971297691536553, -0.2929903614037532, -0.08896100757683212, -0.03890781566064726] |
1,802.00507 | The effects of anger on automated long-term-spectra based
speaker-identification | Forensic speaker identification has traditionally considered approaches based
on long term spectra analysis as especially robust, given that they work well
for short recordings, are not sensitive to changes in the intensity of the
sample, and continue to function in the presence of noise and limited passband.
We find, however, that anger induces a significant distortion of the acoustic
signal for long term spectra analysis purposes. Even moderate anger offsets
speaker identification results by 33% in the direction of a different speaker
altogether. Thus, caution should be exercised when applying this tool.
| cs.HC | forensic speaker identification has traditionally considered approaches based on long term spectra analysis as especially robust given that they work well for short recordings are not sensitive to changes in the intensity of the sample and continue to function in the presence of noise and limited passband we find however that anger induces a significant distortion of the acoustic signal for long term spectra analysis purposes even moderate anger offsets speaker identification results by 33 in the direction of a different speaker altogether thus caution should be exercised when applying this tool | [['forensic', 'speaker', 'identification', 'has', 'traditionally', 'considered', 'approaches', 'based', 'on', 'long', 'term', 'spectra', 'analysis', 'as', 'especially', 'robust', 'given', 'that', 'they', 'work', 'well', 'for', 'short', 'recordings', 'are', 'not', 'sensitive', 'to', 'changes', 'in', 'the', 'intensity', 'of', 'the', 'sample', 'and', 'continue', 'to', 'function', 'in', 'the', 'presence', 'of', 'noise', 'and', 'limited', 'passband', 'we', 'find', 'however', 'that', 'anger', 'induces', 'a', 'significant', 'distortion', 'of', 'the', 'acoustic', 'signal', 'for', 'long', 'term', 'spectra', 'analysis', 'purposes', 'even', 'moderate', 'anger', 'offsets', 'speaker', 'identification', 'results', 'by', '33', 'in', 'the', 'direction', 'of', 'a', 'different', 'speaker', 'altogether', 'thus', 'caution', 'should', 'be', 'exercised', 'when', 'applying', 'this', 'tool']] | [-0.078437312323924, 0.07453242394789729, -0.06489829406769865, 0.10349392089056378, -0.0942108027166282, -0.18073993333129454, 0.03390022057473012, 0.4388901646775396, -0.22643076659321948, -0.3234004338231424, 0.13327248666420297, -0.2643522549643303, -0.13906391899091314, 0.2301953602987139, -0.10523736395913622, 0.02748764457140604, 0.10187764408107361, 0.014711174911454968, -0.029080064581332565, -0.20885355017431403, 0.25342911865774786, 0.09677200298250208, 0.3422188012374808, 0.05077243138752554, 0.05087837205104259, 0.03016326385398355, -0.08633720732051069, 0.03216824452924218, -0.03383431523489771, 0.036343723958887734, 0.33504884547311004, 0.1255794107387571, 0.30629394806759513, -0.3852339174452778, -0.22676864070007982, 0.10565968751198733, 0.1595020181570283, 0.1323782587626382, -0.04575225975207539, -0.32154517016201484, 0.10911762961895084, -0.13618275214685127, -0.06595640586538534, -0.0668831784784308, 0.062211860368615424, 0.016160902844326894, -0.24165835905232994, 0.12107692920835689, 0.11003304172798221, 0.12984615836530397, -0.06625810654773175, -0.12056797503939141, 0.01642612853522777, 0.18707440823788563, 0.1319771712423181, 0.04624063430009815, 0.13152760760757423, -0.13998038540644894, -0.05221869237214813, 0.37196714814711845, -0.13072382138267605, -0.20032937703249248, 0.181228199520695, -0.09716940891382325, -0.1480434659625525, 0.10841827748505317, 0.18359588510192343, 0.08253239654004574, -0.16879853934037586, -0.02504070137713469, 0.034098199943242515, 0.2580884803015658, 0.0656275536331004, 0.07457737100270131, 0.22074269343410496, 0.11874557816696799, 0.014237383415963015, 0.11121624008797959, -0.16570359260937118, 0.02461214486317223, -0.24860570074625962, -0.08236216519372133, -0.1548057383219914, 0.01769623913534578, -0.06542801616033893, -0.14126634039997082, 0.3880955559687446, 0.17222287744769585, 0.16383251338265836, 0.033901678707005216, 0.32579244999215007, 0.11703794588127335, 0.10982954620545649, -0.002339050695097641, 0.25258425809442997, 0.03471447068327309, 0.1259890494554344, -0.17904614293903529, 0.13261385598857683, -0.047475981834830476] |
1,802.00508 | Snort Intrusion Detection System with Intel Software Guard Extension
(Intel SGX) | Network Function Virtualization (NFV) promises the benefits of reduced
infrastructure, personnel, and management costs by outsourcing network
middleboxes to the public or private cloud. Unfortunately, running network
functions in the cloud entails security challenges, especially for complex
stateful services. In this paper, we describe our experiences with hardening
the king of middleboxes - Intrusion Detection Systems (IDS) - using Intel
Software Guard Extensions (Intel SGX) technology. Our IDS secured using Intel
SGX, called SEC-IDS, is an unmodified Snort 3 with a DPDK network layer that
achieves 10Gbps line rate. SEC-IDS guarantees computational integrity by
running all Snort code inside an Intel SGX enclave. At the same time, SEC-IDS
achieves near-native performance, with throughput close to 100 percent of
vanilla Snort 3, by retaining network I/O outside of the enclave. Our
experiments indicate that performance is only constrained by the modest Enclave
Page Cache size available on current Intel SGX Skylake based E3 Xeon platforms.
Finally, we kept the porting effort minimal by using the Graphene-SGX library
OS. Only 27 Lines of Code (LoC) were modified in Snort and 178 LoC in
Graphene-SGX itself.
| cs.NI cs.CR | network function virtualization nfv promises the benefits of reduced infrastructure personnel and management costs by outsourcing network middleboxes to the public or private cloud unfortunately running network functions in the cloud entails security challenges especially for complex stateful services in this paper we describe our experiences with hardening the king of middleboxes intrusion detection systems ids using intel software guard extensions intel sgx technology our ids secured using intel sgx called secids is an unmodified snort 3 with a dpdk network layer that achieves 10gbps line rate secids guarantees computational integrity by running all snort code inside an intel sgx enclave at the same time secids achieves nearnative performance with throughput close to 100 percent of vanilla snort 3 by retaining network io outside of the enclave our experiments indicate that performance is only constrained by the modest enclave page cache size available on current intel sgx skylake based e3 xeon platforms finally we kept the porting effort minimal by using the graphenesgx library os only 27 lines of code loc were modified in snort and 178 loc in graphenesgx itself | [['network', 'function', 'virtualization', 'nfv', 'promises', 'the', 'benefits', 'of', 'reduced', 'infrastructure', 'personnel', 'and', 'management', 'costs', 'by', 'outsourcing', 'network', 'middleboxes', 'to', 'the', 'public', 'or', 'private', 'cloud', 'unfortunately', 'running', 'network', 'functions', 'in', 'the', 'cloud', 'entails', 'security', 'challenges', 'especially', 'for', 'complex', 'stateful', 'services', 'in', 'this', 'paper', 'we', 'describe', 'our', 'experiences', 'with', 'hardening', 'the', 'king', 'of', 'middleboxes', 'intrusion', 'detection', 'systems', 'ids', 'using', 'intel', 'software', 'guard', 'extensions', 'intel', 'sgx', 'technology', 'our', 'ids', 'secured', 'using', 'intel', 'sgx', 'called', 'secids', 'is', 'an', 'unmodified', 'snort', '3', 'with', 'a', 'dpdk', 'network', 'layer', 'that', 'achieves', '10gbps', 'line', 'rate', 'secids', 'guarantees', 'computational', 'integrity', 'by', 'running', 'all', 'snort', 'code', 'inside', 'an', 'intel', 'sgx', 'enclave', 'at', 'the', 'same', 'time', 'secids', 'achieves', 'nearnative', 'performance', 'with', 'throughput', 'close', 'to', '100', 'percent', 'of', 'vanilla', 'snort', '3', 'by', 'retaining', 'network', 'io', 'outside', 'of', 'the', 'enclave', 'our', 'experiments', 'indicate', 'that', 'performance', 'is', 'only', 'constrained', 'by', 'the', 'modest', 'enclave', 'page', 'cache', 'size', 'available', 'on', 'current', 'intel', 'sgx', 'skylake', 'based', 'e3', 'xeon', 'platforms', 'finally', 'we', 'kept', 'the', 'porting', 'effort', 'minimal', 'by', 'using', 'the', 'graphenesgx', 'library', 'os', 'only', '27', 'lines', 'of', 'code', 'loc', 'were', 'modified', 'in', 'snort', 'and', '178', 'loc', 'in', 'graphenesgx', 'itself']] | [-0.21480806835911634, -0.06116541599560894, 0.0044914981792809556, -0.015512055917437194, -0.06486302959341658, -0.27411834167275395, 0.09868821968100656, 0.39932061785585066, -0.21716913754552686, -0.3519898683902967, 0.13768076774334917, -0.2842484246965148, -0.061447687137702184, 0.2091772527927893, -0.12233325832224971, 0.11947159151140169, 0.09469891688161358, -0.015524465714205694, -0.00494596345262674, -0.3616874720721161, 0.23078008282682677, 0.11880243381547088, 0.3034968182048374, 0.1399462407175709, 0.019963928452018876, -0.0449780300233863, 0.007472372119886111, -0.10576744784423515, -0.017445681240484866, 0.12322685465690016, 0.2784346630517007, 0.28383256029594917, 0.32696156660146314, -0.45996008212395134, -0.1003860379974435, 0.010984570959207308, 0.1131768721716674, -0.029698442945575845, -0.027210784818107542, -0.31606086587548793, 0.15753850994827173, -0.31505752647635193, -0.08123277974696393, -0.04945933038126986, -0.037701812658320025, 0.024555262703016317, -0.20323145725167466, -0.06271130147194541, -0.0191168775453968, 0.09207285605936996, 0.008089968998973046, -0.12254850754581227, -0.0467085531354465, 0.08828335059472252, -0.04273121227775263, 0.09540923139420003, 0.2804753910319221, -0.11913737495177688, -0.17227121333537612, 0.353738136905971, -0.061978362660819034, -0.12220996212296559, 0.14811750225052597, 0.04662859551505654, -0.14581000336152578, 0.08133438864378104, 0.21891738534570562, -0.005492057756762643, -0.13776065239512994, 0.11393723855353377, -0.004164887527878607, 0.2639835537157217, 0.08434803551062942, 0.037885907153696725, 0.13772270366040096, 0.22381539160684163, 0.06054615003998438, 0.1536114050814424, -0.08260640729661228, -0.12156965171832088, -0.20781890824385688, -0.1754830081944575, -0.15571611007940517, -0.036064292326085885, -0.11255449521916826, -0.12239269796309951, 0.3438263808824739, 0.18053157050780005, 0.06129488138930913, 0.13125067608281765, 0.46421104708161637, -0.02470870459007192, 0.24513190070897833, 0.2982505778499071, 0.13591153574824458, -0.08312547212281363, 0.20609867884918986, -0.1818951528927167, 0.11161644601659304, -0.022270391993636254] |
1,802.00509 | Learning Semantic Segmentation with Diverse Supervision | Models based on deep convolutional neural networks (CNN) have significantly
improved the performance of semantic segmentation. However, learning these
models requires a large amount of training images with pixel-level labels,
which are very costly and time-consuming to collect. In this paper, we propose
a method for learning CNN-based semantic segmentation models from images with
several types of annotations that are available for various computer vision
tasks, including image-level labels for classification, box-level labels for
object detection and pixel-level labels for semantic segmentation. The proposed
method is flexible and can be used together with any existing CNN-based
semantic segmentation networks. Experimental evaluation on the challenging
PASCAL VOC 2012 and SIFT-flow benchmarks demonstrate that the proposed method
can effectively make use of diverse training data to improve the performance of
the learned models.
| cs.CV | models based on deep convolutional neural networks cnn have significantly improved the performance of semantic segmentation however learning these models requires a large amount of training images with pixellevel labels which are very costly and timeconsuming to collect in this paper we propose a method for learning cnnbased semantic segmentation models from images with several types of annotations that are available for various computer vision tasks including imagelevel labels for classification boxlevel labels for object detection and pixellevel labels for semantic segmentation the proposed method is flexible and can be used together with any existing cnnbased semantic segmentation networks experimental evaluation on the challenging pascal voc 2012 and siftflow benchmarks demonstrate that the proposed method can effectively make use of diverse training data to improve the performance of the learned models | [['models', 'based', 'on', 'deep', 'convolutional', 'neural', 'networks', 'cnn', 'have', 'significantly', 'improved', 'the', 'performance', 'of', 'semantic', 'segmentation', 'however', 'learning', 'these', 'models', 'requires', 'a', 'large', 'amount', 'of', 'training', 'images', 'with', 'pixellevel', 'labels', 'which', 'are', 'very', 'costly', 'and', 'timeconsuming', 'to', 'collect', 'in', 'this', 'paper', 'we', 'propose', 'a', 'method', 'for', 'learning', 'cnnbased', 'semantic', 'segmentation', 'models', 'from', 'images', 'with', 'several', 'types', 'of', 'annotations', 'that', 'are', 'available', 'for', 'various', 'computer', 'vision', 'tasks', 'including', 'imagelevel', 'labels', 'for', 'classification', 'boxlevel', 'labels', 'for', 'object', 'detection', 'and', 'pixellevel', 'labels', 'for', 'semantic', 'segmentation', 'the', 'proposed', 'method', 'is', 'flexible', 'and', 'can', 'be', 'used', 'together', 'with', 'any', 'existing', 'cnnbased', 'semantic', 'segmentation', 'networks', 'experimental', 'evaluation', 'on', 'the', 'challenging', 'pascal', 'voc', '2012', 'and', 'siftflow', 'benchmarks', 'demonstrate', 'that', 'the', 'proposed', 'method', 'can', 'effectively', 'make', 'use', 'of', 'diverse', 'training', 'data', 'to', 'improve', 'the', 'performance', 'of', 'the', 'learned', 'models']] | [0.03331851233010187, -0.06298602070127976, -0.017136748695305286, 0.05791866250481911, -0.14929928375365398, -0.20685419973469418, -0.0021838018988820772, 0.5235048170478744, -0.2053422512635873, -0.4195956853964857, 0.05718156900736752, -0.2601324695603254, -0.17412334479229838, 0.22948820401295905, -0.21669207465344373, 0.1488925917713924, 0.3014154097044002, 0.05239597528120716, -0.0891916521732475, -0.33467920455914557, 0.2902128189217427, 0.0071467464442723895, 0.3803166775459438, 0.05319786571207961, 0.15216088621390145, -0.09994619565781292, -0.051677104622438436, -0.013799829685790393, -0.013945690282102397, 0.24827669600010602, 0.37681488553917425, 0.2362835769868591, 0.30260111696534714, -0.42323666764067785, -0.2605550723036623, 0.0879147813463484, 0.12628849556150612, 0.10631620869634119, -0.02122310988022057, -0.4608726934849761, 0.09981788473847172, -0.1703573555778001, 0.17374532751539964, -0.22262619588993318, -0.025727742523992903, -0.022566194906439775, -0.3154370465266113, 0.04869238065399287, 0.06993618014069516, 0.07928212480228536, -0.06434364094690398, -0.12134729735979824, 0.020896006367553226, 0.2223504059290414, -0.0033036540511227745, 0.070800956562588, 0.12930948860971755, -0.3162097957692614, -0.16002523675134392, 0.3392882470205584, -0.024138989868993294, -0.24138125362004, 0.26100818814446736, 0.04085797572664859, -0.1956386434177349, 0.1165608478788258, 0.2562996255294313, 0.1532136428041938, -0.16131401568907136, -0.027346132843904483, -0.05913437366172785, 0.20045473551704684, 0.04167259701453007, -0.05435921887703638, 0.176495770794048, 0.3215520680377274, -0.013820247372740325, 0.13989063235309032, -0.24220759768166955, 0.02514207986261667, -0.17645241464808128, -0.06925270401780273, -0.2243712283493169, -0.07392757595694474, -0.12785198139906542, -0.1747197323258369, 0.3858092849192615, 0.3344512562239045, 0.22374003593994746, 0.15846489312372505, 0.3877843287382417, -0.04923881571171165, 0.1923432683373112, 0.08821452749921506, 0.1633966298514394, -0.04880611292079432, 0.14683133719545852, -0.1208555362603222, 0.10330359629028342, 0.11684948526223311] |
1,802.0051 | Adaptive Memory Networks | We present Adaptive Memory Networks (AMN) that processes input-question pairs
to dynamically construct a network architecture optimized for lower inference
times for Question Answering (QA) tasks. AMN processes the input story to
extract entities and stores them in memory banks. Starting from a single bank,
as the number of input entities increases, AMN learns to create new banks as
the entropy in a single bank becomes too high. Hence, after processing an
input-question(s) pair, the resulting network represents a hierarchical
structure where entities are stored in different banks, distanced by question
relevance. At inference, one or few banks are used, creating a tradeoff between
accuracy and performance. AMN is enabled by dynamic networks that allow input
dependent network creation and efficiency in dynamic mini-batching as well as
our novel bank controller that allows learning discrete decision making with
high accuracy. In our results, we demonstrate that AMN learns to create
variable depth networks depending on task complexity and reduces inference
times for QA tasks.
| cs.AI cs.CL | we present adaptive memory networks amn that processes inputquestion pairs to dynamically construct a network architecture optimized for lower inference times for question answering qa tasks amn processes the input story to extract entities and stores them in memory banks starting from a single bank as the number of input entities increases amn learns to create new banks as the entropy in a single bank becomes too high hence after processing an inputquestions pair the resulting network represents a hierarchical structure where entities are stored in different banks distanced by question relevance at inference one or few banks are used creating a tradeoff between accuracy and performance amn is enabled by dynamic networks that allow input dependent network creation and efficiency in dynamic minibatching as well as our novel bank controller that allows learning discrete decision making with high accuracy in our results we demonstrate that amn learns to create variable depth networks depending on task complexity and reduces inference times for qa tasks | [['we', 'present', 'adaptive', 'memory', 'networks', 'amn', 'that', 'processes', 'inputquestion', 'pairs', 'to', 'dynamically', 'construct', 'a', 'network', 'architecture', 'optimized', 'for', 'lower', 'inference', 'times', 'for', 'question', 'answering', 'qa', 'tasks', 'amn', 'processes', 'the', 'input', 'story', 'to', 'extract', 'entities', 'and', 'stores', 'them', 'in', 'memory', 'banks', 'starting', 'from', 'a', 'single', 'bank', 'as', 'the', 'number', 'of', 'input', 'entities', 'increases', 'amn', 'learns', 'to', 'create', 'new', 'banks', 'as', 'the', 'entropy', 'in', 'a', 'single', 'bank', 'becomes', 'too', 'high', 'hence', 'after', 'processing', 'an', 'inputquestions', 'pair', 'the', 'resulting', 'network', 'represents', 'a', 'hierarchical', 'structure', 'where', 'entities', 'are', 'stored', 'in', 'different', 'banks', 'distanced', 'by', 'question', 'relevance', 'at', 'inference', 'one', 'or', 'few', 'banks', 'are', 'used', 'creating', 'a', 'tradeoff', 'between', 'accuracy', 'and', 'performance', 'amn', 'is', 'enabled', 'by', 'dynamic', 'networks', 'that', 'allow', 'input', 'dependent', 'network', 'creation', 'and', 'efficiency', 'in', 'dynamic', 'minibatching', 'as', 'well', 'as', 'our', 'novel', 'bank', 'controller', 'that', 'allows', 'learning', 'discrete', 'decision', 'making', 'with', 'high', 'accuracy', 'in', 'our', 'results', 'we', 'demonstrate', 'that', 'amn', 'learns', 'to', 'create', 'variable', 'depth', 'networks', 'depending', 'on', 'task', 'complexity', 'and', 'reduces', 'inference', 'times', 'for', 'qa', 'tasks']] | [-0.09320779056230813, 0.03803064929471239, -0.00451967606815383, 0.06679901165994068, -0.11346141445410242, -0.19557731685711555, 0.09193895189637709, 0.4505591593843735, -0.298374651827746, -0.35273537282360556, 0.07020352993744, -0.25840942758391683, -0.1550798424028067, 0.18744188154627925, -0.10119306338364603, 0.048082841008349704, 0.11136445769034815, 0.02907397180226528, -0.010272583516061674, -0.2549759462737352, 0.2831210535031134, 0.0744759247948726, 0.3338321218824727, -0.0204979735110415, 0.1568887503242787, 0.02252823734127077, -0.015229034829700802, -0.04411113613075289, -0.024199807304453484, 0.15004221044400315, 0.3437914710066477, 0.19917189723950018, 0.3510630162832339, -0.42166851816934614, -0.18818840263181447, 0.07777166610402572, 0.12666209472377818, 0.10251194962593554, 0.009528826478793988, -0.2900850647704009, 0.08870313583979567, -0.1978630943476786, 0.02227763213608184, -0.14170092373172305, 0.045029409413720356, -0.0033933211543401816, -0.32846309346927294, 0.016166220125914725, 0.06028398403245381, -0.007157856052350483, -0.005919037788120432, -0.07129303994301109, -0.02920361427894943, 0.1982985938921496, -0.04712912443318163, 0.03918626099928386, 0.1847439284298431, -0.1402493711175788, -0.17899739588783295, 0.330606161231566, -0.041902842337874995, -0.2071782915255078, 0.17953912081645318, -0.005686676191499479, -0.16861101219025987, 0.10549007054205616, 0.2274762676011219, 0.05260973079431871, -0.14363207034860093, 0.004652453641073756, -0.00484922009140805, 0.24028597694511214, 0.08800846472796467, 0.04045429317004703, 0.18413664590435125, 0.25807673352005905, 0.0379535823824735, 0.1834745781889967, -0.07908733294688217, -0.08797885461733389, -0.17868802634953165, -0.11556502583114729, -0.18588917969760518, 0.01538195267871574, -0.12537113241642933, -0.13935717536901113, 0.35627056157538367, 0.21159987531481655, 0.25208909818500186, 0.11913172919189997, 0.28392144596135177, 0.03505903133622336, 0.1145734122586379, 0.12831947668908267, 0.08813002880340741, 0.012322648112190726, 0.15468810343925185, -0.13782453803233458, 0.09919956886158526, 0.04486201098763648] |
1,802.00511 | Quantum energy exchange and refrigeration: A full-counting statistics
approach | We formulate a full-counting statistics description to study energy exchange
in multi-terminal junctions. Our approach applies to quantum systems that are
coupled either additively or non-additively (cooperatively) to multiple
reservoirs. We derive a Markovian Redfield-type equation for the counting-field
dependent reduced density operator. Under the secular approximation, we confirm
that the cumulant generating function satisfies the heat exchange fluctuation
theorem. Our treatment thus respects the second law of thermodynamics. We
exemplify our formalism on a multi-terminal two-level quantum system, and apply
it to realize the smallest quantum absorption refrigerator, operating through
engineered reservoirs, and achievable only through a cooperative bath
interaction model.
| cond-mat.mes-hall cond-mat.stat-mech | we formulate a fullcounting statistics description to study energy exchange in multiterminal junctions our approach applies to quantum systems that are coupled either additively or nonadditively cooperatively to multiple reservoirs we derive a markovian redfieldtype equation for the countingfield dependent reduced density operator under the secular approximation we confirm that the cumulant generating function satisfies the heat exchange fluctuation theorem our treatment thus respects the second law of thermodynamics we exemplify our formalism on a multiterminal twolevel quantum system and apply it to realize the smallest quantum absorption refrigerator operating through engineered reservoirs and achievable only through a cooperative bath interaction model | [['we', 'formulate', 'a', 'fullcounting', 'statistics', 'description', 'to', 'study', 'energy', 'exchange', 'in', 'multiterminal', 'junctions', 'our', 'approach', 'applies', 'to', 'quantum', 'systems', 'that', 'are', 'coupled', 'either', 'additively', 'or', 'nonadditively', 'cooperatively', 'to', 'multiple', 'reservoirs', 'we', 'derive', 'a', 'markovian', 'redfieldtype', 'equation', 'for', 'the', 'countingfield', 'dependent', 'reduced', 'density', 'operator', 'under', 'the', 'secular', 'approximation', 'we', 'confirm', 'that', 'the', 'cumulant', 'generating', 'function', 'satisfies', 'the', 'heat', 'exchange', 'fluctuation', 'theorem', 'our', 'treatment', 'thus', 'respects', 'the', 'second', 'law', 'of', 'thermodynamics', 'we', 'exemplify', 'our', 'formalism', 'on', 'a', 'multiterminal', 'twolevel', 'quantum', 'system', 'and', 'apply', 'it', 'to', 'realize', 'the', 'smallest', 'quantum', 'absorption', 'refrigerator', 'operating', 'through', 'engineered', 'reservoirs', 'and', 'achievable', 'only', 'through', 'a', 'cooperative', 'bath', 'interaction', 'model']] | [-0.18448824138380587, 0.10839093461632729, -0.09439855271484703, 0.07082346020382829, -0.01905341771431267, -0.21257798152975738, 0.10542874038452282, 0.3172303222003393, -0.2733336671371944, -0.2478799168439582, -0.012345128637971357, -0.31218015470542015, -0.14097643985180183, 0.20105975614627825, 0.0014854987058788539, 0.020530076222494243, 0.027843920199666174, 0.003049464493524283, -0.016830923431552947, -0.1955168061470613, 0.29680256356019524, 0.047246624735416846, 0.3146405422315002, 0.0708371669211192, 0.11488582131918519, 0.06160589475184679, 0.04505789655260742, -0.014075193059397861, -0.13770493348667515, 0.06988668873440475, 0.26535619389323983, -0.008603587560355664, 0.21816575522068887, -0.4598161744326353, -0.24014883395284414, 0.06950700346380473, 0.09589445514138788, 0.1363308014906943, -0.020228294004919007, -0.24021671590395272, 0.019296948933042585, -0.22720879208063707, -0.13121930931694806, -0.11658324196469039, -0.08156164417508989, 0.012252241873648017, -0.29475188760552556, 0.1146467386558652, 0.07413079893834947, -0.007493118429556489, -0.0438805145281367, -0.029320446633500977, 0.0346787342033349, 0.0968683016410796, -0.07271183775825193, -0.06442210356937722, 0.21202876595780254, -0.08554888707119972, -0.10398026454960928, 0.32673717092722654, -0.1007283058273606, -0.2132722327671945, 0.1713844655873254, -0.11242979259230196, -0.12233601202722638, 0.05204198089428246, 0.15858816254884003, 0.12571640709567874, -0.24719693183666094, 0.09975677069975063, -0.011475576922530309, 0.17340636746492236, 0.035617035408504305, 0.038201677026227114, 0.2018961220199708, 0.12028486160561443, 0.0795860801776871, 0.2180150385433808, -0.017186958941165356, -0.21224733722861855, -0.31506328187475446, -0.147020248594672, -0.22361667102202773, 0.12992224705871194, -0.0669550827841158, -0.1521789043210447, 0.346032183021307, 0.2048664136743173, 0.09113895926624536, 0.06318950086599216, 0.318012024234049, 0.2196227539877873, 0.044219935671426354, 0.06883359630592167, 0.17667421041755005, 0.2082111777481623, 0.07219173133838921, -0.32570450918079585, 0.024312431709840893, 0.06173610874684528] |
1,802.00512 | Bulk-boundary quantum oscillations in inhomogeneous Weyl semimetals | Weyl fermions in an external magnetic field exhibit the chiral anomaly, a
non-conservation of chiral fermions. In a Weyl semimetal, a spatially
inhomogeneous Weyl node separation causes similar effect by creating an
intrinsic pseudo-magnetic field with an opposite sign for nodes of opposite
chirality. In the present work we study the interplay of external and intrinsic
fields. In particular, we focus on quantum oscillations due to bulk-boundary
trajectories. When caused by an external field, such oscillations are a proven
experimental technique to detect Weyl semimetals. We show that the intrinsic
field leaves hallmarks on such oscillations by decreasing the period of the
oscillations in an analytically traceable manner. The oscillations can thus be
used to test the effect of an intrinsic field and to extract its strength.
| cond-mat.mes-hall cond-mat.mtrl-sci | weyl fermions in an external magnetic field exhibit the chiral anomaly a nonconservation of chiral fermions in a weyl semimetal a spatially inhomogeneous weyl node separation causes similar effect by creating an intrinsic pseudomagnetic field with an opposite sign for nodes of opposite chirality in the present work we study the interplay of external and intrinsic fields in particular we focus on quantum oscillations due to bulkboundary trajectories when caused by an external field such oscillations are a proven experimental technique to detect weyl semimetals we show that the intrinsic field leaves hallmarks on such oscillations by decreasing the period of the oscillations in an analytically traceable manner the oscillations can thus be used to test the effect of an intrinsic field and to extract its strength | [['weyl', 'fermions', 'in', 'an', 'external', 'magnetic', 'field', 'exhibit', 'the', 'chiral', 'anomaly', 'a', 'nonconservation', 'of', 'chiral', 'fermions', 'in', 'a', 'weyl', 'semimetal', 'a', 'spatially', 'inhomogeneous', 'weyl', 'node', 'separation', 'causes', 'similar', 'effect', 'by', 'creating', 'an', 'intrinsic', 'pseudomagnetic', 'field', 'with', 'an', 'opposite', 'sign', 'for', 'nodes', 'of', 'opposite', 'chirality', 'in', 'the', 'present', 'work', 'we', 'study', 'the', 'interplay', 'of', 'external', 'and', 'intrinsic', 'fields', 'in', 'particular', 'we', 'focus', 'on', 'quantum', 'oscillations', 'due', 'to', 'bulkboundary', 'trajectories', 'when', 'caused', 'by', 'an', 'external', 'field', 'such', 'oscillations', 'are', 'a', 'proven', 'experimental', 'technique', 'to', 'detect', 'weyl', 'semimetals', 'we', 'show', 'that', 'the', 'intrinsic', 'field', 'leaves', 'hallmarks', 'on', 'such', 'oscillations', 'by', 'decreasing', 'the', 'period', 'of', 'the', 'oscillations', 'in', 'an', 'analytically', 'traceable', 'manner', 'the', 'oscillations', 'can', 'thus', 'be', 'used', 'to', 'test', 'the', 'effect', 'of', 'an', 'intrinsic', 'field', 'and', 'to', 'extract', 'its', 'strength']] | [-0.24741628980396982, 0.2330078729746889, -0.053900666710440304, 0.03537251104556728, -0.107523888760195, -0.13087234463850697, 0.0370736715244496, 0.3587435381707009, -0.27340054552723453, -0.31539547210192587, -0.0061592299273002925, -0.2670515021263424, -0.19236790571053783, 0.1482879176706545, -0.028987406089344598, -0.02229667420170864, -0.033376862111640725, 0.05035687015047224, -0.0585701516664433, -0.19051077523393425, 0.3389863655865779, 0.042319762933903965, 0.33843748218115915, 0.05668690661335085, 0.05344765421963759, -0.0030861006111883296, 0.04063926552977838, 0.08034264521057329, -0.0577019498129279, 0.015740575745525794, 0.1782816256447805, -0.06868063894606481, 0.20296709037085217, -0.47522625303643895, -0.19705534191787477, 0.08477035177299591, 0.17884876228150304, 0.17439708402600346, -0.10969510876415957, -0.3587605262424533, 0.04137716524478957, -0.12785843802124672, -0.17977476678422, -0.09328570190494455, 0.025704886988868688, -0.05382624929624162, -0.22897870667777429, 0.0879945589126799, 0.062026458114979595, 0.119363442664658, -0.07806730092279467, -0.03400835941919661, -0.013284319322409593, 0.11177954881742604, 0.11563798625811758, 0.04783049735284638, 0.10992562752877047, -0.16991544113765786, -0.1705636889417106, 0.3618024049077447, -0.10054794684653794, -0.17828194604174594, 0.14835443521673813, -0.1300765072494217, -0.07369497967847279, 0.10047790616398722, 0.15943397823574507, 0.07538101456667054, -0.11848222657794767, 0.06654096114922198, -0.011854963773113536, 0.11610182601038191, 0.03545726584930589, 0.051699561004592914, 0.31907640884476385, 0.08219068181081345, 0.07334565611255509, 0.1450744699054273, -0.1257127218395765, -0.008874197096351212, -0.27903450799621937, -0.15268284045929809, -0.20489777571807696, 0.08300484498361434, -0.04988912186804448, -0.21567515825383424, 0.4402089263825846, 0.18892212485249235, 0.22297188630840908, -0.07179643355899373, 0.2544254768551804, 0.1358566037159208, 0.10180797660963951, 0.040519271023923484, 0.27461935982830443, 0.19289663345112987, 0.08635742373133856, -0.31162046334581583, 0.01747549307994603, 0.003649427980829881] |
1,802.00513 | Note: Distance-Based Network Partitioning | A new method for identifying soft communities in networks is proposed.
Reference nodes, either selected using a priori information about the network
or according to relevant node measurements, are obtained. Distance vectors
between each network node and the reference nodes are then used for defining a
multidimensional coordinate system representing the community structure of the
network at many different scales. For modular networks, the distribution of
nodes in this space often results in a well-separated clustered structure, with
each cluster corresponding to a community. The potential of the method is
illustrated with respect to a spatial network model and the Zachary's karate
club network.
| physics.soc-ph cs.SI | a new method for identifying soft communities in networks is proposed reference nodes either selected using a priori information about the network or according to relevant node measurements are obtained distance vectors between each network node and the reference nodes are then used for defining a multidimensional coordinate system representing the community structure of the network at many different scales for modular networks the distribution of nodes in this space often results in a wellseparated clustered structure with each cluster corresponding to a community the potential of the method is illustrated with respect to a spatial network model and the zacharys karate club network | [['a', 'new', 'method', 'for', 'identifying', 'soft', 'communities', 'in', 'networks', 'is', 'proposed', 'reference', 'nodes', 'either', 'selected', 'using', 'a', 'priori', 'information', 'about', 'the', 'network', 'or', 'according', 'to', 'relevant', 'node', 'measurements', 'are', 'obtained', 'distance', 'vectors', 'between', 'each', 'network', 'node', 'and', 'the', 'reference', 'nodes', 'are', 'then', 'used', 'for', 'defining', 'a', 'multidimensional', 'coordinate', 'system', 'representing', 'the', 'community', 'structure', 'of', 'the', 'network', 'at', 'many', 'different', 'scales', 'for', 'modular', 'networks', 'the', 'distribution', 'of', 'nodes', 'in', 'this', 'space', 'often', 'results', 'in', 'a', 'wellseparated', 'clustered', 'structure', 'with', 'each', 'cluster', 'corresponding', 'to', 'a', 'community', 'the', 'potential', 'of', 'the', 'method', 'is', 'illustrated', 'with', 'respect', 'to', 'a', 'spatial', 'network', 'model', 'and', 'the', 'zacharys', 'karate', 'club', 'network']] | [-0.13542459992459044, 0.020564403289776798, -0.056256364713100575, 0.05544933684219499, -0.07549328909058553, -0.16464308610109304, 0.06920020169435212, 0.40564964367793155, -0.312809922069741, -0.30434951586301817, 0.06572391739889728, -0.2879717481465867, -0.1660612239256107, 0.12297599823124564, -0.012598349596373737, 0.04602915579464305, 0.10017633096476157, 0.12555106433529334, -0.013905197059592376, -0.20018086014673686, 0.36990249234860617, 0.08939314196602656, 0.30857605946501, -0.05171699786576657, 0.12101124339880279, -0.006538617198552506, -0.052840688722566344, 0.06504318461541586, -0.0551798110962129, 0.16860357378251278, 0.2599467864649621, 0.1516273441946116, 0.3058089871505777, -0.40206224281484115, -0.22533449402544647, 0.12051184819294856, 0.12038204383749801, 0.11655908386008097, 0.04408116008674439, -0.35075523235942596, 0.11553971120939913, -0.16261541131489837, -0.08592576516541438, -0.04049009812745051, -0.014703140522424992, 0.0725956535539948, -0.2711748989139988, 0.030590888762022726, -0.03827980153101425, 0.037324211246763855, -0.050844049685670495, -0.09859820586391904, -0.06418170533232534, 0.19775667862044288, -0.02385839238391222, 0.05849853348515283, 0.12636970624757501, -0.11863004863306952, -0.12218596656412746, 0.36981808442550784, 0.020333687275594387, -0.21467193126535186, 0.18073652994980177, -0.06926655262045991, -0.18029755500342268, 0.09633136913180351, 0.22251047630561516, 0.06907480501104146, -0.18781405145665092, -0.01575306765488886, -0.0436708927870943, 0.15931374234899592, 0.056302237476652056, 0.022379682005311433, 0.1783044075127691, 0.2268220836368318, 0.07943799569609557, 0.11616050266401054, -0.10490214239017895, -0.09458818472026345, -0.24936161182883482, -0.10706346264431396, -0.2520725191123067, -0.06922529799899516, -0.1740663212837647, -0.1567038789104957, 0.4466002811364328, 0.1021921390022796, 0.24313744226954162, 0.06343036378697994, 0.2662649510334282, 0.02185782390230228, 0.09826143066255519, 0.13688966166228056, 0.14948387470212765, 0.09802677437591438, 0.10456980859789138, -0.1102426267775277, 0.10058206678905453, 0.03170526528489203] |
1,802.00514 | Accuracy of Shack-Hartmann wavefront sensor using a coherent wound fibre
image bundle | Shack-Hartmann wavefront sensors using wound fibre bundles are desired for
multi-object adaptive optical systems to provide large multiplex positioned by
Starbugs. The use of the large-sized wound fibre bundle provides the exibility
to use more sub-apertures wavefront sensor for ELTs. These compact wavefront
sensors take advantage of large focal surfaces such as the Giant Magellan
Telescope. The focus of this paper is to study the wound fibre image bundle
structure defects effect on the centroid measurement accuracy of a
Shack-Hartmann wavefront sensor. We use the first moment centroid method to
estimate the centroid of a focused Gaussian beam sampled by a simulated bundle.
Spot estimation accuracy with wound fibre image bundle and its structure impact
on wavefront measurement accuracy statistics are addressed. Our results show
that when the measurement signal to noise ratio is high, the centroid
measurement accuracy is dominated by the wound fibre image bundle structure,
e.g. tile angle and gap spacing. For the measurement with low signal to noise
ratio, its accuracy is influenced by the read noise of the detector instead of
the wound fibre image bundle structure defects. We demonstrate this both with
simulation and experimentally. We provide a statistical model of the centroid
and wavefront error of a wound fibre image bundle found through experiment.
| astro-ph.IM | shackhartmann wavefront sensors using wound fibre bundles are desired for multiobject adaptive optical systems to provide large multiplex positioned by starbugs the use of the largesized wound fibre bundle provides the exibility to use more subapertures wavefront sensor for elts these compact wavefront sensors take advantage of large focal surfaces such as the giant magellan telescope the focus of this paper is to study the wound fibre image bundle structure defects effect on the centroid measurement accuracy of a shackhartmann wavefront sensor we use the first moment centroid method to estimate the centroid of a focused gaussian beam sampled by a simulated bundle spot estimation accuracy with wound fibre image bundle and its structure impact on wavefront measurement accuracy statistics are addressed our results show that when the measurement signal to noise ratio is high the centroid measurement accuracy is dominated by the wound fibre image bundle structure eg tile angle and gap spacing for the measurement with low signal to noise ratio its accuracy is influenced by the read noise of the detector instead of the wound fibre image bundle structure defects we demonstrate this both with simulation and experimentally we provide a statistical model of the centroid and wavefront error of a wound fibre image bundle found through experiment | [['shackhartmann', 'wavefront', 'sensors', 'using', 'wound', 'fibre', 'bundles', 'are', 'desired', 'for', 'multiobject', 'adaptive', 'optical', 'systems', 'to', 'provide', 'large', 'multiplex', 'positioned', 'by', 'starbugs', 'the', 'use', 'of', 'the', 'largesized', 'wound', 'fibre', 'bundle', 'provides', 'the', 'exibility', 'to', 'use', 'more', 'subapertures', 'wavefront', 'sensor', 'for', 'elts', 'these', 'compact', 'wavefront', 'sensors', 'take', 'advantage', 'of', 'large', 'focal', 'surfaces', 'such', 'as', 'the', 'giant', 'magellan', 'telescope', 'the', 'focus', 'of', 'this', 'paper', 'is', 'to', 'study', 'the', 'wound', 'fibre', 'image', 'bundle', 'structure', 'defects', 'effect', 'on', 'the', 'centroid', 'measurement', 'accuracy', 'of', 'a', 'shackhartmann', 'wavefront', 'sensor', 'we', 'use', 'the', 'first', 'moment', 'centroid', 'method', 'to', 'estimate', 'the', 'centroid', 'of', 'a', 'focused', 'gaussian', 'beam', 'sampled', 'by', 'a', 'simulated', 'bundle', 'spot', 'estimation', 'accuracy', 'with', 'wound', 'fibre', 'image', 'bundle', 'and', 'its', 'structure', 'impact', 'on', 'wavefront', 'measurement', 'accuracy', 'statistics', 'are', 'addressed', 'our', 'results', 'show', 'that', 'when', 'the', 'measurement', 'signal', 'to', 'noise', 'ratio', 'is', 'high', 'the', 'centroid', 'measurement', 'accuracy', 'is', 'dominated', 'by', 'the', 'wound', 'fibre', 'image', 'bundle', 'structure', 'eg', 'tile', 'angle', 'and', 'gap', 'spacing', 'for', 'the', 'measurement', 'with', 'low', 'signal', 'to', 'noise', 'ratio', 'its', 'accuracy', 'is', 'influenced', 'by', 'the', 'read', 'noise', 'of', 'the', 'detector', 'instead', 'of', 'the', 'wound', 'fibre', 'image', 'bundle', 'structure', 'defects', 'we', 'demonstrate', 'this', 'both', 'with', 'simulation', 'and', 'experimentally', 'we', 'provide', 'a', 'statistical', 'model', 'of', 'the', 'centroid', 'and', 'wavefront', 'error', 'of', 'a', 'wound', 'fibre', 'image', 'bundle', 'found', 'through', 'experiment']] | [-0.1532618339538742, 0.058091337383466536, -0.0471502448061384, -0.009848111604287408, -0.07558657786967807, -0.15613687950102567, -0.013806252906118824, 0.4830504557320857, -0.23150228155044159, -0.2828181956925593, 0.13280042637938466, -0.2594201244376335, -0.15128871957772583, 0.19909939986446176, -0.15595767839030492, 0.09476002216531114, 0.12835470974220237, 0.001462222860686887, -0.03665028052554594, -0.21256229570036161, 0.3074806092739529, 0.13056715699994134, 0.33988317559910186, -0.014790109835423847, 0.1820747975714646, 0.031366628405659555, -0.01836601927240878, -0.009526585122257012, -0.09809099494770497, 0.14049891905276485, 0.2509251869718381, 0.09364358482714655, 0.22067160604044936, -0.4129277489223116, -0.16853271515254303, 0.07369127921689461, 0.13009595131341278, 0.035552716752187616, -0.04049476302898946, -0.3136856541019904, 0.06093074207721605, -0.09973469476027401, -0.1524760812847606, -0.033135256050286985, -0.026588000544739702, 0.041556888532502605, -0.2278138333103968, -0.00026447078548548345, -0.007733306181021212, 0.11843892214245988, -0.036512369728068955, -0.061300362718525514, -0.015083869565521053, 0.11422445152522621, -0.03105087915128671, 0.06325797603898174, 0.26812848387290483, -0.15263129230279704, -0.04592714486290564, 0.3682049464399075, -0.06383321846016546, -0.19373244028185357, 0.03427607399716055, -0.16205460633817725, -0.06475233610816547, 0.20362306804665456, 0.20560391181726803, 0.09140841657697484, -0.08028531060213392, -0.026063510797056037, 0.03754052965817929, 0.22611158056144925, 0.08858207051456857, 0.02159237698100119, 0.17991717548166972, 0.24227261283629137, 0.08630192334657773, 0.11298368101243274, -0.2508468898769106, -0.008292742362643164, -0.267910000039717, -0.15125949978740152, -0.16576562097221084, 0.022939322194111007, -0.09912772245070085, -0.14030145664072607, 0.3767783550227776, 0.13118048024615406, 0.2159678396676177, 0.05992552903215997, 0.37748046002187435, 0.019469926695414416, 0.12797504251655104, -0.03773936702013545, 0.3117715008777535, 0.15004404361337154, 0.06333894610087171, -0.1786161587216066, 0.007843199683688757, 0.02554698468636174] |
1,802.00515 | Dimension Reduction via Gaussian Ridge Functions | Ridge functions have recently emerged as a powerful set of ideas for
subspace-based dimension reduction. In this paper we begin by drawing parallels
between ridge subspaces, sufficient dimension reduction and active subspaces,
contrasting between techniques rooted in statistical regression and those
rooted in approximation theory. This sets the stage for our new algorithm that
approximates what we call a Gaussian ridge function---the posterior mean of a
Gaussian process on a dimension-reducing subspace---suitable for both
regression and approximation problems. To compute this subspace we develop an
iterative algorithm that optimizes over the Stiefel manifold to compute the
subspace, followed by an optimization of the hyperparameters of the Gaussian
process. We demonstrate the utility of the algorithm on two analytical
functions, where we obtain near exact ridge recovery, and a turbomachinery case
study, where we compare the efficacy of our approach with three well-known
sufficient dimension reduction methods: SIR, SAVE, CR. The comparisons motivate
the use of the posterior variance as a heuristic for identifying the
suitability of a dimension-reducing subspace.
| stat.ME math.FA | ridge functions have recently emerged as a powerful set of ideas for subspacebased dimension reduction in this paper we begin by drawing parallels between ridge subspaces sufficient dimension reduction and active subspaces contrasting between techniques rooted in statistical regression and those rooted in approximation theory this sets the stage for our new algorithm that approximates what we call a gaussian ridge functionthe posterior mean of a gaussian process on a dimensionreducing subspacesuitable for both regression and approximation problems to compute this subspace we develop an iterative algorithm that optimizes over the stiefel manifold to compute the subspace followed by an optimization of the hyperparameters of the gaussian process we demonstrate the utility of the algorithm on two analytical functions where we obtain near exact ridge recovery and a turbomachinery case study where we compare the efficacy of our approach with three wellknown sufficient dimension reduction methods sir save cr the comparisons motivate the use of the posterior variance as a heuristic for identifying the suitability of a dimensionreducing subspace | [['ridge', 'functions', 'have', 'recently', 'emerged', 'as', 'a', 'powerful', 'set', 'of', 'ideas', 'for', 'subspacebased', 'dimension', 'reduction', 'in', 'this', 'paper', 'we', 'begin', 'by', 'drawing', 'parallels', 'between', 'ridge', 'subspaces', 'sufficient', 'dimension', 'reduction', 'and', 'active', 'subspaces', 'contrasting', 'between', 'techniques', 'rooted', 'in', 'statistical', 'regression', 'and', 'those', 'rooted', 'in', 'approximation', 'theory', 'this', 'sets', 'the', 'stage', 'for', 'our', 'new', 'algorithm', 'that', 'approximates', 'what', 'we', 'call', 'a', 'gaussian', 'ridge', 'functionthe', 'posterior', 'mean', 'of', 'a', 'gaussian', 'process', 'on', 'a', 'dimensionreducing', 'subspacesuitable', 'for', 'both', 'regression', 'and', 'approximation', 'problems', 'to', 'compute', 'this', 'subspace', 'we', 'develop', 'an', 'iterative', 'algorithm', 'that', 'optimizes', 'over', 'the', 'stiefel', 'manifold', 'to', 'compute', 'the', 'subspace', 'followed', 'by', 'an', 'optimization', 'of', 'the', 'hyperparameters', 'of', 'the', 'gaussian', 'process', 'we', 'demonstrate', 'the', 'utility', 'of', 'the', 'algorithm', 'on', 'two', 'analytical', 'functions', 'where', 'we', 'obtain', 'near', 'exact', 'ridge', 'recovery', 'and', 'a', 'turbomachinery', 'case', 'study', 'where', 'we', 'compare', 'the', 'efficacy', 'of', 'our', 'approach', 'with', 'three', 'wellknown', 'sufficient', 'dimension', 'reduction', 'methods', 'sir', 'save', 'cr', 'the', 'comparisons', 'motivate', 'the', 'use', 'of', 'the', 'posterior', 'variance', 'as', 'a', 'heuristic', 'for', 'identifying', 'the', 'suitability', 'of', 'a', 'dimensionreducing', 'subspace']] | [-0.04101278257855613, -0.009325909857753209, -0.10749023470063028, 0.1037562305477444, -0.06011962951327275, -0.12292967892495826, 0.06273866856160264, 0.39489715465433184, -0.27597912692553583, -0.235455154549397, 0.10703551048382429, -0.23709834453793951, -0.21760757587340085, 0.19018171460179256, -0.07020513600825022, 0.08564859829355209, 0.05920484124882413, 0.007676169019175306, -0.1050079150410879, -0.256656532443317, 0.33237851715169936, 0.08137819260757949, 0.28392279447455493, -0.02485344095579681, 0.14933510415998863, 0.04710811361603971, -0.036867584595234974, 0.011132629258402934, -0.12446182889150459, 0.16641241459209205, 0.27212887315129464, 0.19960921229600595, 0.3418360275349447, -0.37435053823338377, -0.22175032619963445, 0.13246746314966695, 0.17075469114241146, 0.09043154871878437, -0.025177003997322617, -0.22512458292407073, 0.06636277368150852, -0.14583595035946928, -0.10487462340998241, -0.11631596695432174, -0.0491510993510712, -0.007793691565027638, -0.3202532316208817, 0.048906613972836306, 0.06308175213884429, 0.0660316588584378, -0.04444034074965332, -0.17565497503632546, 0.05954672594452859, 0.06611527691365197, 0.017872791082828327, 0.047069243292623596, 0.10031490330029988, -0.0896909741609956, -0.1723534047833666, 0.30753340974305976, -0.05385320379199194, -0.2392330524245543, 0.17882583053627363, -0.06516353886330589, -0.1467556074009432, 0.10467485159227051, 0.23848757204333587, 0.11413023523276761, -0.11607815398712687, 0.08621108605820198, -0.062107530081578134, 0.09150970508787959, 0.04453643384234359, -0.030588990304663423, 0.10258411861252084, 0.1783874507250619, 0.12339050096592732, 0.1723554606280578, -0.12364373489981517, -0.10194351568463303, -0.28633436670601703, -0.15350864690359836, -0.20822341494550484, -0.009684083900148315, -0.14886740954846442, -0.19202309979646953, 0.3980701229135905, 0.1519685158384077, 0.24923750895929211, 0.11695514402041833, 0.32404982342822697, 0.09435220264112147, -0.012698185497096606, 0.13170231441507071, 0.17741963159711477, 0.15601392396049396, 0.009091550590320756, -0.1925527870182469, 0.05875889410630667, 0.11689445122777085] |
1,802.00516 | Existence of solitary waves in one dimensional peridynamics | We give a rigorous proof of existence for solitary waves of a peridynamics
model in one space dimension recently investigated by Silling (J. Mech. Phys.
Solids 96:121--132, 2016). We adapt the variational framework developed by
Friesecke and Wattis (Comm. Math Phys. 161:391--418, 1994) for the
Fermi-Pasta-Ulam-Tsingou lattice equations to treat a truncated problem which
cuts off short-range interactions, then pass to the limit.
| math.AP | we give a rigorous proof of existence for solitary waves of a peridynamics model in one space dimension recently investigated by silling j mech phys solids 96121132 2016 we adapt the variational framework developed by friesecke and wattis comm math phys 161391418 1994 for the fermipastaulamtsingou lattice equations to treat a truncated problem which cuts off shortrange interactions then pass to the limit | [['we', 'give', 'a', 'rigorous', 'proof', 'of', 'existence', 'for', 'solitary', 'waves', 'of', 'a', 'peridynamics', 'model', 'in', 'one', 'space', 'dimension', 'recently', 'investigated', 'by', 'silling', 'j', 'mech', 'phys', 'solids', '96121132', '2016', 'we', 'adapt', 'the', 'variational', 'framework', 'developed', 'by', 'friesecke', 'and', 'wattis', 'comm', 'math', 'phys', '161391418', '1994', 'for', 'the', 'fermipastaulamtsingou', 'lattice', 'equations', 'to', 'treat', 'a', 'truncated', 'problem', 'which', 'cuts', 'off', 'shortrange', 'interactions', 'then', 'pass', 'to', 'the', 'limit']] | [-0.05646122007046716, 0.04858598735783312, -0.11352005088405873, -0.004360569153628233, -0.1027924918759046, -0.11762426093504844, 0.06585667980834842, 0.2626473494505478, -0.21831468776878665, -0.28356737862893583, 0.026181991294941913, -0.25442909094173527, -0.1726726416056439, 0.12391641628297077, -0.06796850178043469, 0.04671118222966285, 0.05221777676083779, -0.12531435947423264, -0.026673374883041293, -0.26931486746012157, 0.21034608138883013, 0.0406011802191704, 0.24293422436793494, 0.0651425923678582, 0.13649156092966008, 0.13907092324284426, -0.01581833508433932, -0.010741176723474952, -0.257969731366325, 0.0887120489990023, 0.25378552702417345, -0.00012488714892859175, 0.283755953873555, -0.4354583375408488, -0.2826044763343693, 0.056019854353014695, 0.05282968900687361, 0.14348368787096213, 0.06457423915991843, -0.37181963197002976, 0.04158229430667835, -0.20789531536274036, -0.19882867698384038, -0.14338534505311715, 0.15698923175302099, -0.0034101247724335074, -0.3019290214436034, 0.16356273731058937, 0.14870014917342214, 0.05431605668706914, -0.045079010854459416, -0.08951277030095206, -0.029565181064230027, -0.050064234072894995, -0.02561649189812084, 0.05663477491303268, 0.00935862218897979, -0.03894007366182188, -0.16104711705011757, 0.33523809160816215, -0.02827969754817185, -0.2085569460108734, 0.25122254524948234, -0.013999782534221471, -0.12747591451181384, 0.12137101353856466, 0.22247109660026382, 0.15720093250274658, -0.16650680785651428, 0.17873549904828195, -0.11219719050736246, 0.10527966878676819, 0.1933726331818912, -0.09011249687775212, 0.09691350248847473, 0.1049162844448524, 0.015113079436991554, 0.10579888001321104, -0.03517822794995065, -0.14425862314558383, -0.287575228739593, -0.16614791503476012, -0.1936495831962359, 0.05463901573350116, 0.07510816123582209, -0.13657356765105436, 0.35139017772339914, 0.12818108260694702, 0.15882940588013852, 0.035158878288989476, 0.14489722830417046, 0.13372222716146606, -0.0685782638473152, 0.1928890206361726, 0.28488109773814174, 0.24060055192449462, 0.14535256633061475, -0.14762442160823966, -0.11575840142066196, 0.22610693025576362] |
1,802.00517 | Zero-adjusted Birnbaum-Saunders regression model | In this paper we introduce the zero-adjusted Birnbaum-Saunders regression
model. This new model generalizes at least seven Birnbaum-Saunders regression
models. The idea of this modeling is mixing a degenerate distribution at zero
with a Birnbaum-Saunders distribution. Besides the capacity to account for
excess zeros, the zero-adjusted Birnbaum-Saunders distribution additionally
produces an attractive modeling structure to right-skewed data. In this model,
the mean and precision parameter of the Birnbaum-Saunders distribution and the
probability of zeros can be related to linear and/or non-linear predictors
through link functions. We derive a type of residual to perform diagnostic
analysis and a perturbation scheme for identifying those observations that
exert unusual influence on the estimation process. Finally, two applications to
real data show the potential of the model.
| stat.ME stat.AP | in this paper we introduce the zeroadjusted birnbaumsaunders regression model this new model generalizes at least seven birnbaumsaunders regression models the idea of this modeling is mixing a degenerate distribution at zero with a birnbaumsaunders distribution besides the capacity to account for excess zeros the zeroadjusted birnbaumsaunders distribution additionally produces an attractive modeling structure to rightskewed data in this model the mean and precision parameter of the birnbaumsaunders distribution and the probability of zeros can be related to linear andor nonlinear predictors through link functions we derive a type of residual to perform diagnostic analysis and a perturbation scheme for identifying those observations that exert unusual influence on the estimation process finally two applications to real data show the potential of the model | [['in', 'this', 'paper', 'we', 'introduce', 'the', 'zeroadjusted', 'birnbaumsaunders', 'regression', 'model', 'this', 'new', 'model', 'generalizes', 'at', 'least', 'seven', 'birnbaumsaunders', 'regression', 'models', 'the', 'idea', 'of', 'this', 'modeling', 'is', 'mixing', 'a', 'degenerate', 'distribution', 'at', 'zero', 'with', 'a', 'birnbaumsaunders', 'distribution', 'besides', 'the', 'capacity', 'to', 'account', 'for', 'excess', 'zeros', 'the', 'zeroadjusted', 'birnbaumsaunders', 'distribution', 'additionally', 'produces', 'an', 'attractive', 'modeling', 'structure', 'to', 'rightskewed', 'data', 'in', 'this', 'model', 'the', 'mean', 'and', 'precision', 'parameter', 'of', 'the', 'birnbaumsaunders', 'distribution', 'and', 'the', 'probability', 'of', 'zeros', 'can', 'be', 'related', 'to', 'linear', 'andor', 'nonlinear', 'predictors', 'through', 'link', 'functions', 'we', 'derive', 'a', 'type', 'of', 'residual', 'to', 'perform', 'diagnostic', 'analysis', 'and', 'a', 'perturbation', 'scheme', 'for', 'identifying', 'those', 'observations', 'that', 'exert', 'unusual', 'influence', 'on', 'the', 'estimation', 'process', 'finally', 'two', 'applications', 'to', 'real', 'data', 'show', 'the', 'potential', 'of', 'the', 'model']] | [-0.07248751450068325, 0.03266121621528921, -0.12894105116167098, 0.09091159007914014, -0.07000686582331815, -0.1570112241416677, 0.06462299683004279, 0.3602674282656228, -0.2701425117436673, -0.28911570341841986, 0.09586487004479533, -0.28539156752892514, -0.16968622991684362, 0.14490386684933168, -0.04717081836578706, 0.07644246703337047, 0.03838808990991867, 0.011128826488255838, -0.051333686254133495, -0.22381044724140287, 0.31866678985005076, 0.07879596683850959, 0.29084320552647114, 0.0068237893735558905, 0.1055079812226309, 0.013708692698254565, -0.05676745513669592, -0.01867342044114451, -0.12669376201365068, 0.12988162865719857, 0.20449060202549882, 0.11399311950614999, 0.28487900717853576, -0.3462367085886692, -0.2779687735067357, 0.1599054175375168, 0.12774001071922297, 0.048590485408732835, -0.020911994968417818, -0.22978643872120902, 0.04470500727145633, -0.19275745324605753, -0.16279529816517221, -0.07567633994016026, -0.022518486735095416, 0.03208165257122399, -0.3578921717784968, 0.10913198064504699, 0.05446744967282804, 0.05605570455120245, -0.05813687564112431, -0.1382037173891209, 0.008175958898534213, 0.07958649491798903, 0.057420268086937815, -0.010889728836453528, 0.07403298805868022, -0.15564421124656277, -0.07724433188078432, 0.3209633201837909, -0.0968850995938309, -0.23866146619716458, 0.15245294782587074, -0.14469918078735225, -0.16831542306564257, 0.08719530373750146, 0.25124962136826734, 0.08067182340651505, -0.17181914777366045, 0.040809532626020176, -0.04472599588411529, 0.14308516634820598, -0.005734426954622604, -0.02648380365076452, 0.2012318818683713, 0.16811061153488527, 0.03655859590161684, 0.15189388244555233, -0.15638897892988232, -0.11296061534927157, -0.2919064732576328, -0.13326143865157997, -0.16796797816449208, -0.006329786143080939, -0.1185011124034645, -0.1958377810872414, 0.4413280996816242, 0.19142692451834803, 0.24871329396716818, 0.1085139125400831, 0.295570809322925, 0.14964383837289738, 0.048387143962000584, 0.04042901915848286, 0.17780401782432864, 0.136650560215916, 0.03315567259853783, -0.18527571501764506, 0.12153059022870562, 0.0072778259836472105] |
1,802.00518 | Analysis of Fast Alternating Minimization for Structured Dictionary
Learning | Methods exploiting sparsity have been popular in imaging and signal
processing applications including compression, denoising, and imaging inverse
problems. Data-driven approaches such as dictionary learning and transform
learning enable one to discover complex image features from datasets and
provide promising performance over analytical models. Alternating minimization
algorithms have been particularly popular in dictionary or transform learning.
In this work, we study the properties of alternating minimization for
structured (unitary) sparsifying operator learning. While the algorithm
converges to the stationary points of the non-convex problem in general, we
prove rapid local linear convergence to the underlying generative model under
mild assumptions. Our experiments show that the unitary operator learning
algorithm is robust to initialization.
| cs.LG | methods exploiting sparsity have been popular in imaging and signal processing applications including compression denoising and imaging inverse problems datadriven approaches such as dictionary learning and transform learning enable one to discover complex image features from datasets and provide promising performance over analytical models alternating minimization algorithms have been particularly popular in dictionary or transform learning in this work we study the properties of alternating minimization for structured unitary sparsifying operator learning while the algorithm converges to the stationary points of the nonconvex problem in general we prove rapid local linear convergence to the underlying generative model under mild assumptions our experiments show that the unitary operator learning algorithm is robust to initialization | [['methods', 'exploiting', 'sparsity', 'have', 'been', 'popular', 'in', 'imaging', 'and', 'signal', 'processing', 'applications', 'including', 'compression', 'denoising', 'and', 'imaging', 'inverse', 'problems', 'datadriven', 'approaches', 'such', 'as', 'dictionary', 'learning', 'and', 'transform', 'learning', 'enable', 'one', 'to', 'discover', 'complex', 'image', 'features', 'from', 'datasets', 'and', 'provide', 'promising', 'performance', 'over', 'analytical', 'models', 'alternating', 'minimization', 'algorithms', 'have', 'been', 'particularly', 'popular', 'in', 'dictionary', 'or', 'transform', 'learning', 'in', 'this', 'work', 'we', 'study', 'the', 'properties', 'of', 'alternating', 'minimization', 'for', 'structured', 'unitary', 'sparsifying', 'operator', 'learning', 'while', 'the', 'algorithm', 'converges', 'to', 'the', 'stationary', 'points', 'of', 'the', 'nonconvex', 'problem', 'in', 'general', 'we', 'prove', 'rapid', 'local', 'linear', 'convergence', 'to', 'the', 'underlying', 'generative', 'model', 'under', 'mild', 'assumptions', 'our', 'experiments', 'show', 'that', 'the', 'unitary', 'operator', 'learning', 'algorithm', 'is', 'robust', 'to', 'initialization']] | [0.006440622913362706, -0.03475130922202252, -0.11436786331582517, 0.07644071221605059, -0.12309222799041762, -0.20987388039980315, -0.030626095600624, 0.4880627686471011, -0.3560866099633936, -0.26530838525334816, 0.13696103938237097, -0.24857879390907103, -0.24075206526785892, 0.18585717560624523, -0.10689354211141446, 0.17451194836139944, 0.12218034234458366, 0.019722410125618768, -0.15600371596700124, -0.27697965070972036, 0.25932407261292756, 0.03220379852022218, 0.3735610983062503, -0.012976752716194905, 0.13710925327119441, 0.014947852731756537, -0.019596291307269274, -0.04308845763778792, -0.045159235761814596, 0.15989133474866207, 0.35491118342884165, 0.23256823320180772, 0.3598399936979785, -0.4392536026878958, -0.24497921796169428, 0.16415627198953148, 0.15768327175246025, 0.07988093899621163, -0.10945401300338253, -0.30743412170724005, 0.09496685913228224, -0.08292893096557365, -0.003138599999710522, -0.19678314039236414, -0.04766799812411181, 0.007275325507317068, -0.3552338637543463, 0.07034345012801015, 0.0851973939472727, 0.0625210078350738, -0.07732802557561184, -0.12992881350857988, 0.13442396240069868, 0.06349176698595088, 0.07802933483874937, 0.027629919714846574, 0.138842503913159, -0.15623854136762036, -0.1472173132027079, 0.3278950826487446, -0.04978980147897934, -0.20813857154319046, 0.2081049141202089, 0.0048062568097746216, -0.18624468428181665, 0.10136066205321556, 0.2589762650215916, 0.14789404748502163, -0.14368767683616782, 0.12198074088448378, -0.06667573671722044, 0.11897301626498852, 0.052942422921233606, 0.020409583631775186, 0.08783604189613423, 0.21919514227914005, 0.1420525494114026, 0.1515811150728733, -0.08896939561133628, -0.08873287848798575, -0.16708441380312486, -0.09281700892596448, -0.21167601949527068, -0.015526704745680358, -0.13375151826149118, -0.16218242511581793, 0.40238603269598916, 0.20426444728257118, 0.18700237979337705, 0.0824085293807485, 0.3678034854212166, 0.09949452072728128, 0.09156403248816465, 0.11180538299650086, 0.18064191692665352, 0.12800865937683698, 0.09197464236579846, -0.20517109322312196, 0.052637422397584385, 0.09081934894892527] |
1,802.00519 | Numerical solution of variable order fractional differential equations | A method for the numerical solution of variable order (VO) fractional
differential equations (FDE) is presented. The method applies to linear as well
as to nonlinear VO-FDEs. The Caputo type VO fractional derivative is employed.
First, an simple expression, which approximates the VO fractional derivative,
is established and then a procedure based on this approximation is developed to
solve VO-FDEs linear and nonlinear, both explicit and implicit. VO-FDEs with
variable coefficients are also treated. The method is illustrated by solving
the second order VO-FDE describing the response of the VO fractional
oscillator, linear and nonlinear (Duffing). However, it can be
straightforwardly extended to higher order VO-FDEs. The presented method, in
addition to its effectiveness, is simple to implement and program on a
computer. The obtained results validate the efficiency and accuracy of the
developed method
| math.NA | a method for the numerical solution of variable order vo fractional differential equations fde is presented the method applies to linear as well as to nonlinear vofdes the caputo type vo fractional derivative is employed first an simple expression which approximates the vo fractional derivative is established and then a procedure based on this approximation is developed to solve vofdes linear and nonlinear both explicit and implicit vofdes with variable coefficients are also treated the method is illustrated by solving the second order vofde describing the response of the vo fractional oscillator linear and nonlinear duffing however it can be straightforwardly extended to higher order vofdes the presented method in addition to its effectiveness is simple to implement and program on a computer the obtained results validate the efficiency and accuracy of the developed method | [['a', 'method', 'for', 'the', 'numerical', 'solution', 'of', 'variable', 'order', 'vo', 'fractional', 'differential', 'equations', 'fde', 'is', 'presented', 'the', 'method', 'applies', 'to', 'linear', 'as', 'well', 'as', 'to', 'nonlinear', 'vofdes', 'the', 'caputo', 'type', 'vo', 'fractional', 'derivative', 'is', 'employed', 'first', 'an', 'simple', 'expression', 'which', 'approximates', 'the', 'vo', 'fractional', 'derivative', 'is', 'established', 'and', 'then', 'a', 'procedure', 'based', 'on', 'this', 'approximation', 'is', 'developed', 'to', 'solve', 'vofdes', 'linear', 'and', 'nonlinear', 'both', 'explicit', 'and', 'implicit', 'vofdes', 'with', 'variable', 'coefficients', 'are', 'also', 'treated', 'the', 'method', 'is', 'illustrated', 'by', 'solving', 'the', 'second', 'order', 'vofde', 'describing', 'the', 'response', 'of', 'the', 'vo', 'fractional', 'oscillator', 'linear', 'and', 'nonlinear', 'duffing', 'however', 'it', 'can', 'be', 'straightforwardly', 'extended', 'to', 'higher', 'order', 'vofdes', 'the', 'presented', 'method', 'in', 'addition', 'to', 'its', 'effectiveness', 'is', 'simple', 'to', 'implement', 'and', 'program', 'on', 'a', 'computer', 'the', 'obtained', 'results', 'validate', 'the', 'efficiency', 'and', 'accuracy', 'of', 'the', 'developed', 'method']] | [-0.048000762120945686, -0.028485241345083862, -0.06238831772031123, 0.06280324429381333, -0.13847340418046702, -0.15063333062719164, -0.004718003036982533, 0.36085626744289895, -0.2826324178795539, -0.2947190565807717, 0.15287589094055984, -0.2323371388136284, -0.19224748485235135, 0.23036675236132273, -0.05529866798488951, 0.11804459911533076, -0.004425756584630528, 0.020668992232322804, -0.048485372837549494, -0.2594630486651588, 0.2623507652341374, 0.031616168534522184, 0.22235088058184388, 0.022462050044742315, 0.16078730447759934, -0.03861661727971105, -0.06684503921849737, 0.032933901234377005, -0.08853967982664038, 0.14894973603598496, 0.26985029931138477, 0.030294109691879643, 0.2875445518575769, -0.395719020213904, -0.19154887322558842, 0.008106681973492699, 0.10759645011345509, 0.11434474434102398, -0.026805638879495882, -0.3012772647789054, 0.07659509355105015, -0.18191438820908096, -0.16933153329570014, -0.1476801810369118, -0.007817486089084353, 0.04169852922778271, -0.3247904277948746, 0.09307154535412364, 0.03783230921131934, 0.0007984872076420614, -0.07987894852899376, -0.11122555251983898, -0.014429285081534354, 0.07318507920978452, -0.009341391687865243, 0.013425432798911386, 0.05278423635650482, -0.06811322835482546, -0.12475119573898169, 0.4013346281917349, -0.12573591141471527, -0.26173325664183095, 0.1669209095312338, -0.07869257111060642, -0.08071485430926585, 0.12581352512282123, 0.1661982446380738, 0.18447529047783187, -0.1830716564445131, 0.09694560613820273, 0.02574076980991817, 0.19474224353542746, 0.028151351562353658, -0.04317784002537269, 0.05246435648261277, 0.1708222851713202, 0.07841772935005711, 0.12962287059835673, -0.04601733238825491, -0.1372639092950345, -0.3018850881342234, -0.18082688666737654, -0.19423309226395258, -0.04800045692167287, -0.06798749395108386, -0.14630093992646062, 0.3833255860685204, 0.1519536557989612, 0.10541307235331233, 0.05683337794981702, 0.3174155854825069, 0.27985157210678696, 0.02966794341241371, 0.028275112882117506, 0.2000703284127721, 0.16158112440147063, 0.13812591685955203, -0.2691289858265742, 0.05663964378564104, 0.15837603485026683] |
1,802.0052 | Real-world Multi-object, Multi-grasp Detection | A deep learning architecture is proposed to predict graspable locations for
robotic manipulation. It considers situations where no, one, or multiple
object(s) are seen. By defining the learning problem to be classification with
null hypothesis competition instead of regression, the deep neural network with
RGB-D image input predicts multiple grasp candidates for a single object or
multiple objects, in a single shot. The method outperforms state-of-the-art
approaches on the Cornell dataset with 96.0% and 96.1% accuracy on image-wise
and object- wise splits, respectively. Evaluation on a multi-object dataset
illustrates the generalization capability of the architecture. Grasping
experiments achieve 96.0% grasp localization and 88.0% grasping success rates
on a test set of household objects. The real-time process takes less than .25 s
from image to plan.
| cs.RO | a deep learning architecture is proposed to predict graspable locations for robotic manipulation it considers situations where no one or multiple objects are seen by defining the learning problem to be classification with null hypothesis competition instead of regression the deep neural network with rgbd image input predicts multiple grasp candidates for a single object or multiple objects in a single shot the method outperforms stateoftheart approaches on the cornell dataset with 960 and 961 accuracy on imagewise and object wise splits respectively evaluation on a multiobject dataset illustrates the generalization capability of the architecture grasping experiments achieve 960 grasp localization and 880 grasping success rates on a test set of household objects the realtime process takes less than 25 s from image to plan | [['a', 'deep', 'learning', 'architecture', 'is', 'proposed', 'to', 'predict', 'graspable', 'locations', 'for', 'robotic', 'manipulation', 'it', 'considers', 'situations', 'where', 'no', 'one', 'or', 'multiple', 'objects', 'are', 'seen', 'by', 'defining', 'the', 'learning', 'problem', 'to', 'be', 'classification', 'with', 'null', 'hypothesis', 'competition', 'instead', 'of', 'regression', 'the', 'deep', 'neural', 'network', 'with', 'rgbd', 'image', 'input', 'predicts', 'multiple', 'grasp', 'candidates', 'for', 'a', 'single', 'object', 'or', 'multiple', 'objects', 'in', 'a', 'single', 'shot', 'the', 'method', 'outperforms', 'stateoftheart', 'approaches', 'on', 'the', 'cornell', 'dataset', 'with', '960', 'and', '961', 'accuracy', 'on', 'imagewise', 'and', 'object', 'wise', 'splits', 'respectively', 'evaluation', 'on', 'a', 'multiobject', 'dataset', 'illustrates', 'the', 'generalization', 'capability', 'of', 'the', 'architecture', 'grasping', 'experiments', 'achieve', '960', 'grasp', 'localization', 'and', '880', 'grasping', 'success', 'rates', 'on', 'a', 'test', 'set', 'of', 'household', 'objects', 'the', 'realtime', 'process', 'takes', 'less', 'than', '25', 's', 'from', 'image', 'to', 'plan']] | [-0.04866145239397884, -0.053345990624278784, -0.061816371694207194, 0.033768749801049124, -0.0876836997102946, -0.2260530321262777, 0.051668379485607145, 0.4598907574415207, -0.18750829833745958, -0.39950894229114053, 0.060779319698922335, -0.29079452047497034, -0.11880287434533239, 0.23009176610782742, -0.16638729078322648, 0.07162255027145148, 0.18016826579719783, 0.07137577525898814, -0.01974815807293635, -0.29739475742913785, 0.2555624840147793, 0.019408987884875387, 0.3292411452010274, -0.028840661384165286, 0.1984206355251372, 0.018470727272331715, -0.012450499157421292, -0.03612304213736206, 0.008535624818876385, 0.14214469099324198, 0.27973213396221397, 0.18697744273394346, 0.3083195599243045, -0.34810351449996235, -0.21347400736063718, 0.061438248798251154, 0.10034685850515962, 0.06754634018987417, 0.008185008750297129, -0.39109219481237234, 0.101401190740522, -0.17519843570142984, 0.0001770758256316185, -0.08939183417707681, 0.00813129498809576, -0.058504630286246535, -0.31162022856622934, 0.010062389446422458, 0.030306204129010438, 0.09665497074706945, -0.10609203914180398, -0.11747761112544686, 0.04927431359700859, 0.1474084077551961, -0.04796346119628288, 0.10269759126380086, 0.20010702978074552, -0.24683586926013232, -0.15814224022999407, 0.38047429370135066, -0.031301798177533785, -0.17796431275084615, 0.22530019310489297, -0.05787450298317708, -0.11797898016124964, 0.13753053635265677, 0.22522140435874463, 0.16805219376832248, -0.1510607337206602, -0.021792268411722035, -0.05173076730594039, 0.19247654129564762, 0.08080839850194753, -0.04404017810616642, 0.23717244135215879, 0.30008683416247367, 0.026847129434347153, 0.12116248658951372, -0.24341516268625857, -0.05883370374515653, -0.2015324403825216, -0.074239306114614, -0.1828973770365119, -0.023928981252014637, -0.08709801447356585, -0.11802866167575121, 0.3785914961770177, 0.21529940887959673, 0.23286182735860347, 0.11418005325645209, 0.348112134501338, -0.01722887627396267, 0.12029078351706267, 0.06074117838963866, 0.1902539359778166, -0.04451658502593637, 0.10108577806537505, -0.15675370571296662, 0.061124718833714724, 0.0641799647435546] |
1,802.00521 | Multipath Communication with Finite Sliding Window Network Coding for
Ultra-Reliability and Low Latency | We use random linear network coding (RLNC) based scheme for multipath
communication in the presence of lossy links with different delay
characteristics to obtain ultra-reliability and low latency. A sliding window
version of RLNC is proposed where the coded packets are generated using packets
in a window size and are inserted among systematic packets in different paths.
The packets are scheduled in the paths in a round robin fashion proportional to
the data rates. We use finite encoding and decoding window size and do not rely
on feedback for closing the sliding window, unlike the previous work. Our
implementation of two paths with LTE and WiFi characteristics shows that the
proposed sliding window scheme achieves better latency compared to the block
RLNC code. It is also shown that the proposed scheme achieves low latency
communication through multiple paths compared to the individual paths for
bursty traffic by translating the throughput on both the paths into latency
gain.
| cs.NI | we use random linear network coding rlnc based scheme for multipath communication in the presence of lossy links with different delay characteristics to obtain ultrareliability and low latency a sliding window version of rlnc is proposed where the coded packets are generated using packets in a window size and are inserted among systematic packets in different paths the packets are scheduled in the paths in a round robin fashion proportional to the data rates we use finite encoding and decoding window size and do not rely on feedback for closing the sliding window unlike the previous work our implementation of two paths with lte and wifi characteristics shows that the proposed sliding window scheme achieves better latency compared to the block rlnc code it is also shown that the proposed scheme achieves low latency communication through multiple paths compared to the individual paths for bursty traffic by translating the throughput on both the paths into latency gain | [['we', 'use', 'random', 'linear', 'network', 'coding', 'rlnc', 'based', 'scheme', 'for', 'multipath', 'communication', 'in', 'the', 'presence', 'of', 'lossy', 'links', 'with', 'different', 'delay', 'characteristics', 'to', 'obtain', 'ultrareliability', 'and', 'low', 'latency', 'a', 'sliding', 'window', 'version', 'of', 'rlnc', 'is', 'proposed', 'where', 'the', 'coded', 'packets', 'are', 'generated', 'using', 'packets', 'in', 'a', 'window', 'size', 'and', 'are', 'inserted', 'among', 'systematic', 'packets', 'in', 'different', 'paths', 'the', 'packets', 'are', 'scheduled', 'in', 'the', 'paths', 'in', 'a', 'round', 'robin', 'fashion', 'proportional', 'to', 'the', 'data', 'rates', 'we', 'use', 'finite', 'encoding', 'and', 'decoding', 'window', 'size', 'and', 'do', 'not', 'rely', 'on', 'feedback', 'for', 'closing', 'the', 'sliding', 'window', 'unlike', 'the', 'previous', 'work', 'our', 'implementation', 'of', 'two', 'paths', 'with', 'lte', 'and', 'wifi', 'characteristics', 'shows', 'that', 'the', 'proposed', 'sliding', 'window', 'scheme', 'achieves', 'better', 'latency', 'compared', 'to', 'the', 'block', 'rlnc', 'code', 'it', 'is', 'also', 'shown', 'that', 'the', 'proposed', 'scheme', 'achieves', 'low', 'latency', 'communication', 'through', 'multiple', 'paths', 'compared', 'to', 'the', 'individual', 'paths', 'for', 'bursty', 'traffic', 'by', 'translating', 'the', 'throughput', 'on', 'both', 'the', 'paths', 'into', 'latency', 'gain']] | [-0.24777013437665263, 0.07474355088772287, -0.06636148712829135, 0.006034442793079622, -0.06376094556900014, -0.22815960274629626, 0.16507186990966843, 0.4440205246210098, -0.2822592345623976, -0.2698235322193355, 0.08820543115421726, -0.26529818700009566, -0.13890048841483132, 0.19120106591092673, -0.11857783913636094, 0.10785619217522774, 0.08984382373168115, 0.02092152266395367, -0.0245422986602992, -0.3250862411846211, 0.2363444860882065, 0.10911854975233981, 0.3804375755891299, 0.015617565076893113, 0.07812773270360461, 0.0498885580792335, -0.06117989267014964, -0.012742340145039426, -0.08750978460474974, 0.05224842068762963, 0.26016663955554226, 0.13737597675388977, 0.2628825702674829, -0.4580886130974551, -0.29257190512837306, 0.03612151816724592, 0.15014244577251257, 0.09231896344335026, -0.03201077843328143, -0.2548728291298245, 0.15068407058508201, -0.17786420357360203, 0.01465023667581237, 0.027631951232031462, -0.04877325898380416, 0.05925254118206377, -0.28626639304599566, 0.002760346381069357, -0.00956522162475736, -0.025158899557438625, -0.014176960046859872, -0.05924398207645507, 0.02759606281301351, 0.16994052357188646, 0.007465054010408842, 0.020145263884714833, 0.08530191911953934, -0.052811960957404584, -0.14136542058342202, 0.39002177715420155, -0.04841066143812114, -0.2081030119020658, 0.1567001332807693, -0.03338764634303701, -0.06251014632196611, 0.17980858215255438, 0.22803799014324974, 0.048559988553006986, -0.14739193772054782, -0.011934649326785165, -0.0020655847872328606, 0.19647390594569503, 0.14233569024059517, 0.1407314759477451, 0.0950928079379592, 0.20671381788316426, 0.1216675272436848, 0.1401152451801452, -0.12203550409929008, -0.15557250337805717, -0.23399717452421273, -0.10275170036182282, -0.16903755322075004, -0.05422223443867992, -0.13137897022710268, -0.10300449359992217, 0.3953851309116156, 0.1491031521029628, 0.17600140626880395, 0.19254093504493025, 0.37322103554845615, 0.07331945997837835, 0.10557589852577372, 0.19764505699276924, 0.14194965036289328, 0.0485776745207062, 0.12072129244248792, -0.21923062571318477, 0.08080331694815236, 0.038825401027870785] |
1,802.00522 | Nanomechanical characterization of the Kondo charge dynamics in a carbon
nanotube | Using the transversal vibration resonance of a suspended carbon nanotube as
charge detector for its embedded quantum dot, we investigate the case of strong
Kondo correlations between a quantum dot and its leads. We demonstrate that
even when large Kondo conductance is carried at odd electron number, the
charging behaviour remains similar between odd and even quantum dot occupation.
While the Kondo conductance is caused by higher order processes, a sequential
tunneling only model can describe the time-averaged charge. The gate potentials
of maximum current and fastest charge increase display a characteristic
relative shift, which is suppressed at increased temperature. These
observations agree very well with models for Kondo-correlated quantum dots.
| cond-mat.mes-hall | using the transversal vibration resonance of a suspended carbon nanotube as charge detector for its embedded quantum dot we investigate the case of strong kondo correlations between a quantum dot and its leads we demonstrate that even when large kondo conductance is carried at odd electron number the charging behaviour remains similar between odd and even quantum dot occupation while the kondo conductance is caused by higher order processes a sequential tunneling only model can describe the timeaveraged charge the gate potentials of maximum current and fastest charge increase display a characteristic relative shift which is suppressed at increased temperature these observations agree very well with models for kondocorrelated quantum dots | [['using', 'the', 'transversal', 'vibration', 'resonance', 'of', 'a', 'suspended', 'carbon', 'nanotube', 'as', 'charge', 'detector', 'for', 'its', 'embedded', 'quantum', 'dot', 'we', 'investigate', 'the', 'case', 'of', 'strong', 'kondo', 'correlations', 'between', 'a', 'quantum', 'dot', 'and', 'its', 'leads', 'we', 'demonstrate', 'that', 'even', 'when', 'large', 'kondo', 'conductance', 'is', 'carried', 'at', 'odd', 'electron', 'number', 'the', 'charging', 'behaviour', 'remains', 'similar', 'between', 'odd', 'and', 'even', 'quantum', 'dot', 'occupation', 'while', 'the', 'kondo', 'conductance', 'is', 'caused', 'by', 'higher', 'order', 'processes', 'a', 'sequential', 'tunneling', 'only', 'model', 'can', 'describe', 'the', 'timeaveraged', 'charge', 'the', 'gate', 'potentials', 'of', 'maximum', 'current', 'and', 'fastest', 'charge', 'increase', 'display', 'a', 'characteristic', 'relative', 'shift', 'which', 'is', 'suppressed', 'at', 'increased', 'temperature', 'these', 'observations', 'agree', 'very', 'well', 'with', 'models', 'for', 'kondocorrelated', 'quantum', 'dots']] | [-0.181923731192443, 0.21968353547256542, -0.005475173083444436, 0.07003298472940318, 0.05555372128078529, -0.2594380263524415, 0.054071355553402624, 0.37080475328666335, -0.24432788436932423, -0.31634899445280834, -0.0039206418787708155, -0.3257930595763363, -0.09442223020753748, 0.20437412943506428, -0.0012089893577656046, 0.013270690901884558, 0.04236240064104398, 0.014374153898307332, -0.06927600248532186, -0.1921755887026823, 0.24452087713556514, 0.046247980918164726, 0.28556758972086216, 0.12366571454415182, 0.06934861900905769, 0.010684800069980524, 0.10744678232449668, 0.06541238741756224, -0.09792447718404923, 0.02946100017341139, 0.2254620744412629, -0.09293270537310892, 0.20883740168190687, -0.45565604101363066, -0.13950766207281132, 0.06552934131337548, 0.15146330902080243, 0.15944568094113623, -0.030383241019916494, -0.2501539779294215, 0.07228024315659527, -0.1790637477040962, -0.08822474727272853, -0.06678367636862907, 0.019251950764776888, 0.003510883996191829, -0.24864985618681587, 0.12347198228209137, 0.05337664126640087, 0.06946197400280686, 0.003438177722011198, -0.07719175911902844, -0.03393536108663423, 0.095947391524762, 0.0076335747191380405, 0.016730561026011233, 0.2339711885370717, -0.12460400970015037, -0.1255487860222389, 0.3302824090964891, -0.07589418554011532, -0.09832821760603504, 0.161259806572317, -0.22633790813369659, -0.031095386134578032, 0.12971394405456949, 0.07655683497117984, 0.09924682020839001, -0.08620834562925911, 0.10906126545920448, 0.021377161572066445, 0.1726355370100554, 0.06822865809364295, 0.10820352797121699, 0.2878454473826128, 0.1731424861868659, 0.08715934260026761, 0.13741671934153313, -0.1487111721590564, -0.11839348670548282, -0.24949042094653254, -0.15582451035545483, -0.23055532431808878, 0.13306437322853115, -0.065566423629764, -0.17155730889623497, 0.4126048749564467, 0.12204836591709035, 0.20770434591382206, -0.01242354533924545, 0.2791484565062969, 0.19746790180163173, 0.07392174871386709, 0.021521644160226994, 0.19590360623247385, 0.20016701208419158, 0.08092784612473133, -0.3638837719923473, 0.04585931287776377, -0.035155615137957105] |
1,802.00523 | The Satisfiability of Extended Word Equations: The Boundary Between
Decidability and Undecidability | The study of word equations (or the existential theory of equations over free
monoids) is a central topic in mathematics and theoretical computer science.
The problem of deciding whether a given word equation has a solution was shown
to be decidable by Makanin in the late 1970s, and since then considerable work
has been done on this topic. In recent years, this decidability question has
gained critical importance in the context of string SMT solvers for security
analysis. Further, many extensions (e.g., quantifier-free word equations with
linear arithmetic over the length function) and fragments (e.g., restrictions
on the number of variables) of this theory are important from a theoretical
point of view, as well as for program analysis applications. Motivated by these
considerations, we prove several new results and thus shed light on the
boundary between decidability and undecidability for many fragments and
extensions of the first order theory of word equations.
| cs.LO cs.FL | the study of word equations or the existential theory of equations over free monoids is a central topic in mathematics and theoretical computer science the problem of deciding whether a given word equation has a solution was shown to be decidable by makanin in the late 1970s and since then considerable work has been done on this topic in recent years this decidability question has gained critical importance in the context of string smt solvers for security analysis further many extensions eg quantifierfree word equations with linear arithmetic over the length function and fragments eg restrictions on the number of variables of this theory are important from a theoretical point of view as well as for program analysis applications motivated by these considerations we prove several new results and thus shed light on the boundary between decidability and undecidability for many fragments and extensions of the first order theory of word equations | [['the', 'study', 'of', 'word', 'equations', 'or', 'the', 'existential', 'theory', 'of', 'equations', 'over', 'free', 'monoids', 'is', 'a', 'central', 'topic', 'in', 'mathematics', 'and', 'theoretical', 'computer', 'science', 'the', 'problem', 'of', 'deciding', 'whether', 'a', 'given', 'word', 'equation', 'has', 'a', 'solution', 'was', 'shown', 'to', 'be', 'decidable', 'by', 'makanin', 'in', 'the', 'late', '1970s', 'and', 'since', 'then', 'considerable', 'work', 'has', 'been', 'done', 'on', 'this', 'topic', 'in', 'recent', 'years', 'this', 'decidability', 'question', 'has', 'gained', 'critical', 'importance', 'in', 'the', 'context', 'of', 'string', 'smt', 'solvers', 'for', 'security', 'analysis', 'further', 'many', 'extensions', 'eg', 'quantifierfree', 'word', 'equations', 'with', 'linear', 'arithmetic', 'over', 'the', 'length', 'function', 'and', 'fragments', 'eg', 'restrictions', 'on', 'the', 'number', 'of', 'variables', 'of', 'this', 'theory', 'are', 'important', 'from', 'a', 'theoretical', 'point', 'of', 'view', 'as', 'well', 'as', 'for', 'program', 'analysis', 'applications', 'motivated', 'by', 'these', 'considerations', 'we', 'prove', 'several', 'new', 'results', 'and', 'thus', 'shed', 'light', 'on', 'the', 'boundary', 'between', 'decidability', 'and', 'undecidability', 'for', 'many', 'fragments', 'and', 'extensions', 'of', 'the', 'first', 'order', 'theory', 'of', 'word', 'equations']] | [-0.06474068002784562, 0.05953099424734909, -0.10003348238864876, 0.08104593899033175, -0.10205347914347387, -0.10294298793880009, 0.04952211520828874, 0.3130017204691243, -0.3336356174145264, -0.3172817126545586, 0.13960551088120762, -0.28155357407911724, -0.1369873429694836, 0.2463610144069924, -0.09968906010667615, 0.12267960635451786, 0.07286211003592571, 0.0697365692255414, -0.06384317863066465, -0.2929358872159427, 0.31667326448796723, 0.006900045968320788, 0.2320366261021191, 0.09469954602864404, 0.0785697874557597, 0.017569225000846664, -0.056097532776708633, 0.029917239572310093, -0.1248965463739826, 0.1266539328452508, 0.3362611924970387, 0.1962241975972984, 0.34550290493084895, -0.449362020581862, -0.23845800828953453, 0.08405828969059698, 0.13524518186432335, 0.11760008193256445, -0.055204213056435796, -0.2767050305492436, 0.0971726868795046, -0.16991427525514058, -0.05030895775763799, -0.04526727945183015, 0.08751951474603882, 0.024127238706087337, -0.16640755919653255, -0.007909234193776617, 0.134339508497995, 0.1256215049891381, -0.06438148730520825, -0.1285192366251537, 0.0477632068310377, 0.08766247769848548, 0.11473742685749486, 0.032945422631447875, 0.045247431788963594, -0.1624411119052536, -0.1648093731765518, 0.39312229513973984, -0.021934971081506188, -0.1827713494876782, 0.16640473111218076, -0.0916394433546318, -0.20530442445575944, 0.07413951815445198, 0.16046238180083403, 0.11813126304896165, -0.1092229435399224, 0.1711711580317702, -0.11221220480225709, 0.19585439089908488, 0.12706329387039045, 0.017926353662095915, 0.21423712807602638, 0.19372508943771685, 0.02315955315115214, 0.13224795803702158, 0.04397395339529246, -0.12457371925756286, -0.27830730939888404, -0.15224963820705942, -0.11331972777103351, 0.012824003612437587, -0.061040836839130246, -0.14896921473088834, 0.3879663109507979, 0.16970765662983997, 0.11027944001634389, 0.07434091606294575, 0.2588812903753969, 0.12877851676670773, 0.04889813005702188, 0.040798974269692666, 0.1562332912773782, 0.187625142657013, 0.09299925172436267, -0.16411692019866544, 0.08159892410980475, 0.1305941696932527] |
1,802.00524 | Simulations of relativistic-quantum plasmas using real-time lattice
scalar QED | Real-time lattice quantum electrodynamics (QED) provides a unique tool for
simulating plasmas in the strong-field regime, where collective plasma scales
are not well-separated from relativistic-quantum scales. As a toy model, we
study scalar QED, which describes self-consistent interactions between charged
bosons and electromagnetic fields. To solve this model on a computer, we first
discretize the scalar-QED action on a lattice, in a way that respects geometric
structures of exterior calculus and U(1)-gauge symmetry. The lattice scalar QED
can then be solved, in the classical-statistics regime, by advancing an
ensemble of statistically equivalent initial conditions in time, using
classical field equations obtained by extremizing the discrete action. To
demonstrate the capability of our numerical scheme, we apply it to two example
problems. The first example is the propagation of linear waves, where we
recover analytic wave dispersion relations using numerical spectrum. The second
example is an intense laser interacting with a 1D plasma slab, where we
demonstrate natural transition from wakefield acceleration to pair production
when the wave amplitude exceeds the Schwinger threshold. Our real-time lattice
scheme is fully explicit and respects local conservation laws, making it
reliable for long-time dynamics. The algorithm is readily parallelized using
domain decomposition, and the ensemble may be computed using quantum
parallelism in the future.
| physics.plasm-ph | realtime lattice quantum electrodynamics qed provides a unique tool for simulating plasmas in the strongfield regime where collective plasma scales are not wellseparated from relativisticquantum scales as a toy model we study scalar qed which describes selfconsistent interactions between charged bosons and electromagnetic fields to solve this model on a computer we first discretize the scalarqed action on a lattice in a way that respects geometric structures of exterior calculus and u1gauge symmetry the lattice scalar qed can then be solved in the classicalstatistics regime by advancing an ensemble of statistically equivalent initial conditions in time using classical field equations obtained by extremizing the discrete action to demonstrate the capability of our numerical scheme we apply it to two example problems the first example is the propagation of linear waves where we recover analytic wave dispersion relations using numerical spectrum the second example is an intense laser interacting with a 1d plasma slab where we demonstrate natural transition from wakefield acceleration to pair production when the wave amplitude exceeds the schwinger threshold our realtime lattice scheme is fully explicit and respects local conservation laws making it reliable for longtime dynamics the algorithm is readily parallelized using domain decomposition and the ensemble may be computed using quantum parallelism in the future | [['realtime', 'lattice', 'quantum', 'electrodynamics', 'qed', 'provides', 'a', 'unique', 'tool', 'for', 'simulating', 'plasmas', 'in', 'the', 'strongfield', 'regime', 'where', 'collective', 'plasma', 'scales', 'are', 'not', 'wellseparated', 'from', 'relativisticquantum', 'scales', 'as', 'a', 'toy', 'model', 'we', 'study', 'scalar', 'qed', 'which', 'describes', 'selfconsistent', 'interactions', 'between', 'charged', 'bosons', 'and', 'electromagnetic', 'fields', 'to', 'solve', 'this', 'model', 'on', 'a', 'computer', 'we', 'first', 'discretize', 'the', 'scalarqed', 'action', 'on', 'a', 'lattice', 'in', 'a', 'way', 'that', 'respects', 'geometric', 'structures', 'of', 'exterior', 'calculus', 'and', 'u1gauge', 'symmetry', 'the', 'lattice', 'scalar', 'qed', 'can', 'then', 'be', 'solved', 'in', 'the', 'classicalstatistics', 'regime', 'by', 'advancing', 'an', 'ensemble', 'of', 'statistically', 'equivalent', 'initial', 'conditions', 'in', 'time', 'using', 'classical', 'field', 'equations', 'obtained', 'by', 'extremizing', 'the', 'discrete', 'action', 'to', 'demonstrate', 'the', 'capability', 'of', 'our', 'numerical', 'scheme', 'we', 'apply', 'it', 'to', 'two', 'example', 'problems', 'the', 'first', 'example', 'is', 'the', 'propagation', 'of', 'linear', 'waves', 'where', 'we', 'recover', 'analytic', 'wave', 'dispersion', 'relations', 'using', 'numerical', 'spectrum', 'the', 'second', 'example', 'is', 'an', 'intense', 'laser', 'interacting', 'with', 'a', '1d', 'plasma', 'slab', 'where', 'we', 'demonstrate', 'natural', 'transition', 'from', 'wakefield', 'acceleration', 'to', 'pair', 'production', 'when', 'the', 'wave', 'amplitude', 'exceeds', 'the', 'schwinger', 'threshold', 'our', 'realtime', 'lattice', 'scheme', 'is', 'fully', 'explicit', 'and', 'respects', 'local', 'conservation', 'laws', 'making', 'it', 'reliable', 'for', 'longtime', 'dynamics', 'the', 'algorithm', 'is', 'readily', 'parallelized', 'using', 'domain', 'decomposition', 'and', 'the', 'ensemble', 'may', 'be', 'computed', 'using', 'quantum', 'parallelism', 'in', 'the', 'future']] | [-0.117165665272086, 0.15998401794296604, -0.10158182644478914, 0.07380444060310345, -0.06857904141473298, -0.1349751415702765, -0.020943187340610445, 0.37987202199516246, -0.26729646171980465, -0.2625038102235591, 0.0502385255550997, -0.23815654308194867, -0.14268905814746036, 0.2145353586417444, 0.031717472904487155, 0.08247963246293903, 0.05466122912968366, 0.005586504513093342, -0.03717522168657384, -0.18862924890037483, 0.2883395907058282, 0.051766943272713646, 0.2730413084366144, 0.03926346101406335, 0.1282992840413219, 0.005170199364119281, 0.023382038124579525, 0.01700083897202813, -0.09063086953046177, 0.061054781979272284, 0.20608462195041982, 0.06393089467075277, 0.23062183656013355, -0.46028491741834354, -0.24844788351149943, 0.04283283531017682, 0.16724469465295372, 0.1724832542067116, -0.06296023071683102, -0.2930810284473969, 0.03670314231035613, -0.16263282781493707, -0.14688554189678354, -0.10165952466643201, -0.008048767568162965, -0.00936729545691588, -0.31033109477049525, 0.0724956426935163, 0.0010210873090097895, 0.03373899716993597, -0.059158181175007485, -0.013197661267790513, 0.01760421146844657, 0.08267495078731511, 0.006715636393682172, 0.039403244054903135, 0.12700064601925148, -0.13467872732704003, -0.13421646064895099, 0.43535615738409644, -0.08856394356497241, -0.22366538255300839, 0.16091048644291453, -0.14795520967989154, -0.10255115530330491, 0.11898134357257871, 0.17151152867546232, 0.1303712427280306, -0.1494840095282108, 0.12273802712017921, -0.0451310528105051, 0.17038539095441452, 0.055977186696299426, 0.006771032897701774, 0.19440801553159523, 0.1690814248890652, 0.021823822115458406, 0.1498005904515874, -0.028412932208224308, -0.14996905435915464, -0.34704651966099986, -0.1341702180619065, -0.17793359798647893, 0.052235826302491586, -0.07195304749697803, -0.15604735065314274, 0.37855249025775406, 0.17872355650587662, 0.12027690780870706, 0.025811275317839596, 0.31024078116976084, 0.1674190131973144, 0.0183039100321856, 0.0964251434981214, 0.24117582792846057, 0.15280254448477465, 0.0848781623711917, -0.25374758513232964, -0.055720801242457055, 0.11441418557996468] |
1,802.00525 | Diophantine approximation on the parabola with non-monotonic
approximation functions | We show that the parabola is of strong Khintchine type for convergence, which
is the first result of its kind for curves. Moreover, Jarnik type theorems are
established in both the simultaneous and the dual settings, without
monotonicity on the approximation function. To achieve the above, we prove a
new counting result for the number of rational points with fixed denominators
lying close to the parabola, which uses Burgess's bound on short character
sums.
| math.NT | we show that the parabola is of strong khintchine type for convergence which is the first result of its kind for curves moreover jarnik type theorems are established in both the simultaneous and the dual settings without monotonicity on the approximation function to achieve the above we prove a new counting result for the number of rational points with fixed denominators lying close to the parabola which uses burgesss bound on short character sums | [['we', 'show', 'that', 'the', 'parabola', 'is', 'of', 'strong', 'khintchine', 'type', 'for', 'convergence', 'which', 'is', 'the', 'first', 'result', 'of', 'its', 'kind', 'for', 'curves', 'moreover', 'jarnik', 'type', 'theorems', 'are', 'established', 'in', 'both', 'the', 'simultaneous', 'and', 'the', 'dual', 'settings', 'without', 'monotonicity', 'on', 'the', 'approximation', 'function', 'to', 'achieve', 'the', 'above', 'we', 'prove', 'a', 'new', 'counting', 'result', 'for', 'the', 'number', 'of', 'rational', 'points', 'with', 'fixed', 'denominators', 'lying', 'close', 'to', 'the', 'parabola', 'which', 'uses', 'burgesss', 'bound', 'on', 'short', 'character', 'sums']] | [-0.14103428766483794, 0.01816762743417073, -0.09453231773364383, 0.09187656587832985, -0.06932107072537513, -0.13081329337296052, 0.12553712108952775, 0.3172148491784528, -0.287954292020987, -0.25095885078347213, 0.117143311806816, -0.2592266919468907, -0.13011351408361382, 0.26033562884942907, -0.11655871948932071, 0.03740594192404879, 0.03695368540246744, 0.07135099300963653, -0.0779115862080928, -0.2897079094514452, 0.33784831023296796, -0.04761322999272395, 0.24245392794506876, 0.07823682103205372, 0.09213742046818338, 0.06223981520412741, 0.03502299147028778, -0.04163468007401035, -0.1463282417441676, 0.1284689781369289, 0.19230832446467233, 0.08483103540335857, 0.25791525570172313, -0.3528634647247256, -0.13431260788913918, 0.14987427668293585, 0.10778516773260324, 0.05204838386271149, -0.030507211667812756, -0.22845145749129556, 0.1279131898993148, -0.07334931730922009, -0.2029157950907845, -0.09065132323853872, -0.021145256922102056, 0.1278880458274806, -0.29501378485882607, 0.05653407403922363, 0.13732599283252353, 0.05683432514401707, -0.056611874614326235, -0.12187959860406213, 0.04945712431445655, 0.09713658419865612, 0.06149756788855066, 0.024356352190512257, 0.0037525586557348033, -0.10679872042021236, -0.11053651769494487, 0.3102062510678897, -0.08240894654394455, -0.1878443188285707, 0.17026953050564672, -0.1704637498242428, -0.16230949396393388, 0.12887172504151995, 0.12498312274849899, 0.15701447389516476, -0.050653523501210114, 0.10639608230967251, -0.08667496206691942, 0.1185419400996604, 0.1385499740686469, 0.034658282724637036, 0.12461410575810619, 0.0833553232856699, 0.12663003941997886, 0.14675393058899538, -0.08910955699487917, -0.10301720256275321, -0.36891315434430094, -0.15479818799271802, -0.21567845571081382, 0.05962076290145617, -0.12264383319947032, -0.21528184975220546, 0.34693707166415816, 0.053448366208908124, 0.19742179249186773, 0.14899758937000926, 0.25431991861881437, 0.16425194866904938, -0.0010270403031058409, 0.0702525742754743, 0.2434223266192586, 0.1513899987267733, 0.044749853704628105, -0.1469553794988708, 0.05019843073662471, 0.2053384127133098] |
1,802.00526 | Toward Optimal Coupon Allocation in Social Networks: An Approximate
Submodular Optimization Approach | CMO Council reports that 71\% of internet users in the U.S. were influenced
by coupons and discounts when making their purchase decisions. It has also been
shown that offering coupons to a small fraction of users (called seed users)
may affect the purchase decisions of many other users in a social network. This
motivates us to study the optimal coupon allocation problem, and our objective
is to allocate coupons to a set of users so as to maximize the expected
cascade. Different from existing studies on influence maximizaton (IM), our
framework allows a general utility function and a more complex set of
constraints. In particular, we formulate our problem as an approximate
submodular maximization problem subject to matroid and knapsack constraints.
Existing techniques relying on the submodularity of the utility function, such
as greedy algorithm, can not work directly on a non-submodular function. We use
$\epsilon$ to measure the difference between our function and its closest
submodular function and propose a novel approximate algorithm with
approximation ratio $\beta(\epsilon)$ with $\lim_{\epsilon\rightarrow
0}\beta(\epsilon)=1-1/e$. This is the best approximation guarantee for
approximate submodular maximization subject to a partition matroid and knapsack
constraints, our results apply to a broad range of optimization problems that
can be formulated as an approximate submodular maximization problem.
| cs.SI cs.GT | cmo council reports that 71 of internet users in the us were influenced by coupons and discounts when making their purchase decisions it has also been shown that offering coupons to a small fraction of users called seed users may affect the purchase decisions of many other users in a social network this motivates us to study the optimal coupon allocation problem and our objective is to allocate coupons to a set of users so as to maximize the expected cascade different from existing studies on influence maximizaton im our framework allows a general utility function and a more complex set of constraints in particular we formulate our problem as an approximate submodular maximization problem subject to matroid and knapsack constraints existing techniques relying on the submodularity of the utility function such as greedy algorithm can not work directly on a nonsubmodular function we use epsilon to measure the difference between our function and its closest submodular function and propose a novel approximate algorithm with approximation ratio betaepsilon with lim_epsilonrightarrow 0betaepsilon11e this is the best approximation guarantee for approximate submodular maximization subject to a partition matroid and knapsack constraints our results apply to a broad range of optimization problems that can be formulated as an approximate submodular maximization problem | [['cmo', 'council', 'reports', 'that', '71', 'of', 'internet', 'users', 'in', 'the', 'us', 'were', 'influenced', 'by', 'coupons', 'and', 'discounts', 'when', 'making', 'their', 'purchase', 'decisions', 'it', 'has', 'also', 'been', 'shown', 'that', 'offering', 'coupons', 'to', 'a', 'small', 'fraction', 'of', 'users', 'called', 'seed', 'users', 'may', 'affect', 'the', 'purchase', 'decisions', 'of', 'many', 'other', 'users', 'in', 'a', 'social', 'network', 'this', 'motivates', 'us', 'to', 'study', 'the', 'optimal', 'coupon', 'allocation', 'problem', 'and', 'our', 'objective', 'is', 'to', 'allocate', 'coupons', 'to', 'a', 'set', 'of', 'users', 'so', 'as', 'to', 'maximize', 'the', 'expected', 'cascade', 'different', 'from', 'existing', 'studies', 'on', 'influence', 'maximizaton', 'im', 'our', 'framework', 'allows', 'a', 'general', 'utility', 'function', 'and', 'a', 'more', 'complex', 'set', 'of', 'constraints', 'in', 'particular', 'we', 'formulate', 'our', 'problem', 'as', 'an', 'approximate', 'submodular', 'maximization', 'problem', 'subject', 'to', 'matroid', 'and', 'knapsack', 'constraints', 'existing', 'techniques', 'relying', 'on', 'the', 'submodularity', 'of', 'the', 'utility', 'function', 'such', 'as', 'greedy', 'algorithm', 'can', 'not', 'work', 'directly', 'on', 'a', 'nonsubmodular', 'function', 'we', 'use', 'epsilon', 'to', 'measure', 'the', 'difference', 'between', 'our', 'function', 'and', 'its', 'closest', 'submodular', 'function', 'and', 'propose', 'a', 'novel', 'approximate', 'algorithm', 'with', 'approximation', 'ratio', 'betaepsilon', 'with', 'lim_epsilonrightarrow', '0betaepsilon11e', 'this', 'is', 'the', 'best', 'approximation', 'guarantee', 'for', 'approximate', 'submodular', 'maximization', 'subject', 'to', 'a', 'partition', 'matroid', 'and', 'knapsack', 'constraints', 'our', 'results', 'apply', 'to', 'a', 'broad', 'range', 'of', 'optimization', 'problems', 'that', 'can', 'be', 'formulated', 'as', 'an', 'approximate', 'submodular', 'maximization', 'problem']] | [-0.09606254090514324, -0.04396548409688002, -0.07133994023858127, 0.08156128111069352, -0.18747319925341357, -0.15204454267971687, 0.15475512028545213, 0.41106334598328087, -0.3048383855120758, -0.33279209940929366, 0.07279525562477732, -0.2893565238908513, -0.18152925287129232, 0.14603651833530623, -0.10887164279628654, 0.0854883389711353, 0.037118558306246996, 0.021047474798357602, -0.033274098255364135, -0.31311894004296476, 0.28713978437969045, 0.08722865972690537, 0.2937703951074317, 0.09587270570172955, 0.08785202224610048, 0.059777104963200364, 0.01366029274695128, 0.044198293278719415, -0.14340950969492341, 0.12062990701603658, 0.3163624431630506, 0.26457174521649385, 0.3895296337607416, -0.4054142175676319, -0.163731383984271, 0.15276265208263548, 0.1223641211286784, 0.03255917694989267, -0.00386584782612666, -0.21738433882648361, 0.089345721683908, -0.19533410328621206, -0.023815301484292718, -0.03515927751946435, -0.024574036527994694, 0.05642324570369753, -0.38733085100900705, -0.03497108167788416, -0.01328251094249918, -0.03511259874817237, -0.08132675000397462, -0.13546046181028093, 0.04473206412060711, 0.1252526853893922, 0.10069179336666989, 0.06944045433842405, 0.1502257520123837, -0.11794901447307354, -0.15589251944306984, 0.41250999504474256, -0.010522365459304267, -0.23597175328996828, 0.1537459494989112, -0.04314316150244072, -0.1428952176085429, 0.12143083683947481, 0.25576056279603715, 0.16412298506446799, -0.1678617205711684, 0.03940929228170293, -0.13870675248790135, 0.1519211456236131, 0.04951269598225656, 0.030138042756837784, 0.16504623571035534, 0.14450550819812139, 0.18947379570426104, 0.16587211796335732, 0.029459085557338536, -0.0954545679529315, -0.19774352254129005, -0.10482841272142182, -0.21469962556147948, 0.05616171956091986, -0.09877331551675542, -0.15403047332795025, 0.3729272744916741, 0.15890820541484643, 0.16750372635670802, 0.14877065183432067, 0.303228476182535, 0.12104317255996877, 0.0334261221092339, 0.0814277565793939, 0.1856133324954234, 0.05160793725223715, 0.09443833687042058, -0.1783066017680928, 0.1320188557683915, 0.018893921661905004] |
1,802.00527 | Predicting outcomes for games of skill by redefining what it means to
win | The Elo rating system is a highly successful ranking algorithm for games of
skill where, by construction, one team wins and the other loses. A primary
limitation of the original Elo algorithm is its inability to predict
information beyond a match's win-loss probability. Specifically, the victor is
awarded the same point bounty if he beats a team by 1 point or 10 points; only
the rating difference between the team and its opponent affects the match
bounty. In this work, we explain that Elo ratings and predictions can be
naturally extended to include margin-of-victory information by simply
redefining "what it means to win." We create ratings for each value of the
margin-of-victory and use these ratings to predict the full distribution of
point spread outcomes for matches which have not yet been played.
| stat.ME | the elo rating system is a highly successful ranking algorithm for games of skill where by construction one team wins and the other loses a primary limitation of the original elo algorithm is its inability to predict information beyond a matchs winloss probability specifically the victor is awarded the same point bounty if he beats a team by 1 point or 10 points only the rating difference between the team and its opponent affects the match bounty in this work we explain that elo ratings and predictions can be naturally extended to include marginofvictory information by simply redefining what it means to win we create ratings for each value of the marginofvictory and use these ratings to predict the full distribution of point spread outcomes for matches which have not yet been played | [['the', 'elo', 'rating', 'system', 'is', 'a', 'highly', 'successful', 'ranking', 'algorithm', 'for', 'games', 'of', 'skill', 'where', 'by', 'construction', 'one', 'team', 'wins', 'and', 'the', 'other', 'loses', 'a', 'primary', 'limitation', 'of', 'the', 'original', 'elo', 'algorithm', 'is', 'its', 'inability', 'to', 'predict', 'information', 'beyond', 'a', 'matchs', 'winloss', 'probability', 'specifically', 'the', 'victor', 'is', 'awarded', 'the', 'same', 'point', 'bounty', 'if', 'he', 'beats', 'a', 'team', 'by', '1', 'point', 'or', '10', 'points', 'only', 'the', 'rating', 'difference', 'between', 'the', 'team', 'and', 'its', 'opponent', 'affects', 'the', 'match', 'bounty', 'in', 'this', 'work', 'we', 'explain', 'that', 'elo', 'ratings', 'and', 'predictions', 'can', 'be', 'naturally', 'extended', 'to', 'include', 'marginofvictory', 'information', 'by', 'simply', 'redefining', 'what', 'it', 'means', 'to', 'win', 'we', 'create', 'ratings', 'for', 'each', 'value', 'of', 'the', 'marginofvictory', 'and', 'use', 'these', 'ratings', 'to', 'predict', 'the', 'full', 'distribution', 'of', 'point', 'spread', 'outcomes', 'for', 'matches', 'which', 'have', 'not', 'yet', 'been', 'played']] | [-0.021207292448917333, 0.046502779903284344, -0.1292400252002363, 0.09853057608259125, -0.12704426207436392, -0.1976869738410012, 0.11967139444672144, 0.38095159764365794, -0.23999776361295236, -0.3667038824604018, 0.09410701034715972, -0.33977675313273303, -0.14549162947895147, 0.10188684355861578, -0.1220380854076491, -0.021058651097477055, 0.07512600482441485, 0.0992415783694014, 0.0046109093371062325, -0.3171203341944, 0.3217923394153611, 0.07681949997607332, 0.25114884422017403, 0.02725751570139367, 0.10443701547248145, 0.012810969981364906, -0.03287949115396119, 0.04330845514240746, -0.08044937447708575, 0.08381637453029935, 0.2604732010800105, 0.2084337484718372, 0.38080035383598165, -0.3550523312045978, -0.1443798529232691, 0.1190105497980347, 0.08030887989488501, 0.08710107217238357, 0.010472630992388496, -0.2870186692211204, 0.08576347754748825, -0.21566338431842338, -0.08407173301809683, -0.048404869283191286, 0.015055689917734037, 0.009948782325507357, -0.2772845714460485, -0.01408875934027422, 0.05577979242214216, 0.0145529120730666, -0.009577687875403522, -0.1237816871065521, -0.022848125432546322, 0.23856102615379943, 0.021766177487398425, 0.03538238214006504, 0.13287818779398758, -0.1606591923842923, -0.15184722025610076, 0.40009429562263765, -0.04286958629157967, -0.1412799906809456, 0.12241007366146033, -0.12975183366797866, -0.09793422839049107, 0.10648354344034137, 0.12465001152685055, 0.07754537226954618, -0.129362200666219, -0.005192212128223708, -0.05958879314936125, 0.20505736137073163, 0.06907214833280215, -0.03638947700293591, 0.21780749439405134, 0.1535421442970311, 0.07879080951679499, 0.03600468694975671, -0.032912578655836675, -0.12126254132733895, -0.20179401978563805, -0.1534964558988577, -0.19480765723408414, 0.013163244393049703, -0.029870368941919877, -0.11655772399300567, 0.4003940941336063, 0.20513584172138227, 0.18808141768050307, 0.03971858416558602, 0.2934391543484078, 0.08618225847872404, 0.05998456863946138, 0.0686661399112871, 0.2334869800780255, 0.019465388534948804, 0.0904132798874903, -0.18721315297298133, 0.17160922665363895, 0.05194637313520966] |
1,802.00528 | Implicative algebras: a new foundation for realizability and forcing | We introduce the notion of implicative algebra, a simple algebraic structure
intended to factorize the model constructions underlying forcing and
realizability (both in intuitionistic and classical logic). The salient feature
of this structure is that its elements can be seen both as truth values and as
(generalized) realizers, thus blurring the frontier between proofs and types.
We show that each implicative algebra induces a (Set-based) tripos, using a
construction that is reminiscent from the construction of a realizability
tripos from a partial combinatory algebra. Relating this construction with the
corresponding constructions in forcing and realizability, we conclude that the
class of implicative triposes encompass all forcing triposes (both
intuitionistic and classical), all classical realizability triposes (in the
sense of Krivine) and all intuitionistic realizability triposes built from
partial combinatory algebras.
| math.LO | we introduce the notion of implicative algebra a simple algebraic structure intended to factorize the model constructions underlying forcing and realizability both in intuitionistic and classical logic the salient feature of this structure is that its elements can be seen both as truth values and as generalized realizers thus blurring the frontier between proofs and types we show that each implicative algebra induces a setbased tripos using a construction that is reminiscent from the construction of a realizability tripos from a partial combinatory algebra relating this construction with the corresponding constructions in forcing and realizability we conclude that the class of implicative triposes encompass all forcing triposes both intuitionistic and classical all classical realizability triposes in the sense of krivine and all intuitionistic realizability triposes built from partial combinatory algebras | [['we', 'introduce', 'the', 'notion', 'of', 'implicative', 'algebra', 'a', 'simple', 'algebraic', 'structure', 'intended', 'to', 'factorize', 'the', 'model', 'constructions', 'underlying', 'forcing', 'and', 'realizability', 'both', 'in', 'intuitionistic', 'and', 'classical', 'logic', 'the', 'salient', 'feature', 'of', 'this', 'structure', 'is', 'that', 'its', 'elements', 'can', 'be', 'seen', 'both', 'as', 'truth', 'values', 'and', 'as', 'generalized', 'realizers', 'thus', 'blurring', 'the', 'frontier', 'between', 'proofs', 'and', 'types', 'we', 'show', 'that', 'each', 'implicative', 'algebra', 'induces', 'a', 'setbased', 'tripos', 'using', 'a', 'construction', 'that', 'is', 'reminiscent', 'from', 'the', 'construction', 'of', 'a', 'realizability', 'tripos', 'from', 'a', 'partial', 'combinatory', 'algebra', 'relating', 'this', 'construction', 'with', 'the', 'corresponding', 'constructions', 'in', 'forcing', 'and', 'realizability', 'we', 'conclude', 'that', 'the', 'class', 'of', 'implicative', 'triposes', 'encompass', 'all', 'forcing', 'triposes', 'both', 'intuitionistic', 'and', 'classical', 'all', 'classical', 'realizability', 'triposes', 'in', 'the', 'sense', 'of', 'krivine', 'and', 'all', 'intuitionistic', 'realizability', 'triposes', 'built', 'from', 'partial', 'combinatory', 'algebras']] | [-0.08885144624778499, 0.06140492921247362, -0.09390388894288872, 0.12910791381548803, -0.18287976998835803, -0.1386218754717937, -0.016611423096709096, 0.2938846321346668, -0.4044282836982837, -0.23215749748409367, 0.08880094789156619, -0.20709247360937297, -0.18064490778085132, 0.146347065246664, -0.17563958855059283, -0.009896635999701595, 0.021771587829033916, 0.044112986342784447, -0.08186141066253186, -0.19777069380685974, 0.364417889707077, -0.02404992575309454, 0.21783703852337427, -0.01757226690936547, 0.14137160514051525, 0.04020522326732484, -0.0254749926738441, 0.07754536957050172, -0.1374033866353924, 0.13521536046262975, 0.3090163902576583, 0.205419517820701, 0.23800490479558134, -0.38295221177574534, -0.10747936447621144, 0.08908169730924644, 0.0504795955422406, 0.0808604224352166, 0.04364493482504398, -0.2983561277676087, 0.0773518324471437, -0.21441025120886759, -0.04028197170700878, -0.10770094009617773, 0.04865060377722749, 0.03027205585430448, -0.23488887556058427, -0.03133771174515669, 0.24968969605576533, 0.12586150150387906, -0.09286309075810445, -0.11238972297421872, -0.06110064866415297, 0.04255336994090332, -0.1034269400845425, -0.005938406184745523, 0.07495422972222933, -0.10065569579243087, -0.20743402626741533, 0.37214546193583653, -0.009217087344194835, -0.20561890464562635, 0.18657009622368675, -0.08740157975922697, -0.15360367150905613, 0.06174727387439746, 0.029692202928261115, 0.08636877692949313, -0.07729123327970648, 0.1701279875862663, -0.12916520989249244, 0.14976918486018592, 0.15420515092376333, 0.08915683155780874, 0.15983616664575842, 0.10702689165750948, 0.02383776943987379, 0.17434032225282864, 0.04397533486077849, -0.13760811418760568, -0.369426405392229, -0.1329792612113614, -0.03529352550663484, 0.032599387054618165, -0.06933345047615988, -0.23593447389654243, 0.37548416633732046, 0.2106493207487242, 0.14465707816326848, 0.16854817117206178, 0.2650006014065674, 0.07401837664835442, 0.11688644786795171, 0.03286071011008551, 0.12338726267648431, 0.2246911360595662, 0.058200434172669284, -0.11621119359400696, 0.052112635382666035, 0.1948180088558449] |
1,802.00529 | Microwave-assisted Rydberg Electromagnetically induced transparency | We demonstrate electromagnetically induced transparency (EIT) in a four-level
cascade-like system, where the two upper levels are Rydberg states coupled by a
microwave field. A two-photon transition consisting of an off-resonant
microwave field and an off-resonant optical field forms an effective coupling
field to induce transparency of the probe light. We characterize the Rabi
frequency of the effective coupling field, as well as the EIT microwave
spectra. The results show that microwave assisted EIT allows us to efficiently
access Rydberg states with relatively high orbital angular momentum $\ell=3$,
which is promising for the study of exotic Rydberg molecular states.
| physics.atom-ph | we demonstrate electromagnetically induced transparency eit in a fourlevel cascadelike system where the two upper levels are rydberg states coupled by a microwave field a twophoton transition consisting of an offresonant microwave field and an offresonant optical field forms an effective coupling field to induce transparency of the probe light we characterize the rabi frequency of the effective coupling field as well as the eit microwave spectra the results show that microwave assisted eit allows us to efficiently access rydberg states with relatively high orbital angular momentum ell3 which is promising for the study of exotic rydberg molecular states | [['we', 'demonstrate', 'electromagnetically', 'induced', 'transparency', 'eit', 'in', 'a', 'fourlevel', 'cascadelike', 'system', 'where', 'the', 'two', 'upper', 'levels', 'are', 'rydberg', 'states', 'coupled', 'by', 'a', 'microwave', 'field', 'a', 'twophoton', 'transition', 'consisting', 'of', 'an', 'offresonant', 'microwave', 'field', 'and', 'an', 'offresonant', 'optical', 'field', 'forms', 'an', 'effective', 'coupling', 'field', 'to', 'induce', 'transparency', 'of', 'the', 'probe', 'light', 'we', 'characterize', 'the', 'rabi', 'frequency', 'of', 'the', 'effective', 'coupling', 'field', 'as', 'well', 'as', 'the', 'eit', 'microwave', 'spectra', 'the', 'results', 'show', 'that', 'microwave', 'assisted', 'eit', 'allows', 'us', 'to', 'efficiently', 'access', 'rydberg', 'states', 'with', 'relatively', 'high', 'orbital', 'angular', 'momentum', 'ell3', 'which', 'is', 'promising', 'for', 'the', 'study', 'of', 'exotic', 'rydberg', 'molecular', 'states']] | [-0.2081435992608242, 0.2722921799766923, -0.008821206802332943, 0.042730643802599964, -0.021534043209594345, -0.1550393797918176, 0.04870510951738165, 0.4180218791683214, -0.23122462286905507, -0.2914206815902332, -0.05615413418119641, -0.2409739245337521, -0.0913810565070522, 0.23968786898661743, 0.06557889622306884, 0.020603800088995032, 0.01879582984956226, 0.0022680460442459642, 0.06178159993188926, -0.10587059393656825, 0.31618022748899427, 0.06888718390837312, 0.32084994193053606, 0.06947481689146823, 0.11573810786987195, -0.010831801952192128, 0.12661821028509299, -0.05134230835193938, -0.08742574909315362, 0.09955673652637581, 0.24076055500167187, 0.01635566942577222, 0.2113908633514486, -0.4353077635733467, -0.19466628362848, 0.06345835742728803, 0.16619549566795203, 0.22681482490316748, -0.08398314942417648, -0.37550522054009366, -0.08936026682983143, -0.1392785654393862, -0.11802690293207163, -0.13620612612511548, -0.03975244951457952, 0.0047959159151886145, -0.3338873108585525, -0.01383492441652719, 0.004027462076405157, 0.0905695189178023, -0.06618151039113243, 0.006385988646393849, 0.027155248577603035, 0.040833769965860425, -0.08430625257938347, 0.01573944635773924, 0.17464574277306896, -0.1466836217682658, -0.14268523668917366, 0.3385954728688706, -0.1973660731537625, -0.05486970345461459, 0.18037673659302822, -0.16515584276387035, 0.004888432810666284, 0.15828821609605742, 0.13954818656084814, 0.08709380049916982, -0.13947815450279963, 0.09926390359025317, -0.024764629585358005, 0.20536613052315783, 0.14746273054524955, 0.19856996417064407, 0.21807062746298433, 0.11385189724916761, 0.06494730117382726, 0.1869154592736088, -0.10974779614068643, -0.04200584225290728, -0.2171375058412627, -0.12480842926059708, -0.16655005405967435, 0.12450268812876811, -0.056892626015604665, -0.1640899188609587, 0.44028818739032505, 0.1407265284550235, 0.2078026452412208, -0.12314344412821222, 0.37150542461078123, 0.16299630817957222, 0.045134438916739794, 0.023893433608904932, 0.3300162608349564, 0.24224458604985188, 0.05898668686624127, -0.35345074899889756, -0.06844932419915843, -0.04872471052739355] |
1,802.0053 | Scalable L\'evy Process Priors for Spectral Kernel Learning | Gaussian processes are rich distributions over functions, with generalization
properties determined by a kernel function. When used for long-range
extrapolation, predictions are particularly sensitive to the choice of kernel
parameters. It is therefore critical to account for kernel uncertainty in our
predictive distributions. We propose a distribution over kernels formed by
modelling a spectral mixture density with a L\'evy process. The resulting
distribution has support for all stationary covariances--including the popular
RBF, periodic, and Mat\'ern kernels--combined with inductive biases which
enable automatic and data efficient learning, long-range extrapolation, and
state of the art predictive performance. The proposed model also presents an
approach to spectral regularization, as the L\'evy process introduces a
sparsity-inducing prior over mixture components, allowing automatic selection
over model order and pruning of extraneous components. We exploit the algebraic
structure of the proposed process for $\mathcal{O}(n)$ training and
$\mathcal{O}(1)$ predictions. We perform extrapolations having reasonable
uncertainty estimates on several benchmarks, show that the proposed model can
recover flexible ground truth covariances and that it is robust to errors in
initialization.
| stat.ML cs.AI cs.LG | gaussian processes are rich distributions over functions with generalization properties determined by a kernel function when used for longrange extrapolation predictions are particularly sensitive to the choice of kernel parameters it is therefore critical to account for kernel uncertainty in our predictive distributions we propose a distribution over kernels formed by modelling a spectral mixture density with a levy process the resulting distribution has support for all stationary covariancesincluding the popular rbf periodic and matern kernelscombined with inductive biases which enable automatic and data efficient learning longrange extrapolation and state of the art predictive performance the proposed model also presents an approach to spectral regularization as the levy process introduces a sparsityinducing prior over mixture components allowing automatic selection over model order and pruning of extraneous components we exploit the algebraic structure of the proposed process for mathcalon training and mathcalo1 predictions we perform extrapolations having reasonable uncertainty estimates on several benchmarks show that the proposed model can recover flexible ground truth covariances and that it is robust to errors in initialization | [['gaussian', 'processes', 'are', 'rich', 'distributions', 'over', 'functions', 'with', 'generalization', 'properties', 'determined', 'by', 'a', 'kernel', 'function', 'when', 'used', 'for', 'longrange', 'extrapolation', 'predictions', 'are', 'particularly', 'sensitive', 'to', 'the', 'choice', 'of', 'kernel', 'parameters', 'it', 'is', 'therefore', 'critical', 'to', 'account', 'for', 'kernel', 'uncertainty', 'in', 'our', 'predictive', 'distributions', 'we', 'propose', 'a', 'distribution', 'over', 'kernels', 'formed', 'by', 'modelling', 'a', 'spectral', 'mixture', 'density', 'with', 'a', 'levy', 'process', 'the', 'resulting', 'distribution', 'has', 'support', 'for', 'all', 'stationary', 'covariancesincluding', 'the', 'popular', 'rbf', 'periodic', 'and', 'matern', 'kernelscombined', 'with', 'inductive', 'biases', 'which', 'enable', 'automatic', 'and', 'data', 'efficient', 'learning', 'longrange', 'extrapolation', 'and', 'state', 'of', 'the', 'art', 'predictive', 'performance', 'the', 'proposed', 'model', 'also', 'presents', 'an', 'approach', 'to', 'spectral', 'regularization', 'as', 'the', 'levy', 'process', 'introduces', 'a', 'sparsityinducing', 'prior', 'over', 'mixture', 'components', 'allowing', 'automatic', 'selection', 'over', 'model', 'order', 'and', 'pruning', 'of', 'extraneous', 'components', 'we', 'exploit', 'the', 'algebraic', 'structure', 'of', 'the', 'proposed', 'process', 'for', 'mathcalon', 'training', 'and', 'mathcalo1', 'predictions', 'we', 'perform', 'extrapolations', 'having', 'reasonable', 'uncertainty', 'estimates', 'on', 'several', 'benchmarks', 'show', 'that', 'the', 'proposed', 'model', 'can', 'recover', 'flexible', 'ground', 'truth', 'covariances', 'and', 'that', 'it', 'is', 'robust', 'to', 'errors', 'in', 'initialization']] | [-0.021308804882745093, 0.047871012676948925, -0.11992408657336937, 0.10972708944514392, -0.0971643232877421, -0.1463891500963227, 0.057209366468219634, 0.4542654645136174, -0.24347228836816023, -0.2997126853531774, 0.09278928786738748, -0.2327309095821179, -0.12076187469390467, 0.1715283696060343, -0.058534379136365125, 0.1336112482829348, 0.0900287183234468, -0.015181761706138358, -0.08127478624913184, -0.23220496034003138, 0.3133623848148786, 0.07474924723124679, 0.31983263687066293, -0.013750412830096833, 0.1258468473379788, 0.030357513975297266, -0.04769647944074891, -0.032980881973772365, -0.09100329271450927, 0.135391524818945, 0.2553376428947291, 0.11953802271746099, 0.2890336102217107, -0.35863559242228377, -0.2802615529528874, 0.13375839958898722, 0.1372276086086298, 0.06249419499996721, 0.002488900755997747, -0.2865997535340926, 0.07685316458125324, -0.20302455321464496, -0.08926290276131647, -0.1981863120351644, -0.0029494114137966843, 0.030617673892308683, -0.37830970448832135, 0.07798555223117172, 0.07828476590186577, 0.02461264377557467, -0.06612844790386803, -0.16620171391336686, 0.02906895559965907, 0.0981227111285347, 0.02003656209408826, 0.016052500227027956, 0.13074311113604756, -0.12858804644030683, -0.09902095174800385, 0.3111089618164389, -0.08664369601550896, -0.26728119964639463, 0.17595237364773364, -0.07172865167479305, -0.12833460390786913, 0.12933788768508855, 0.19042525366496513, 0.07354109297533903, -0.15641394315556253, 0.061249540801680484, 0.01766873837195282, 0.17032631918349686, -0.0007051868775092504, 0.01045452659326496, 0.14426575820646523, 0.20036672445233253, 0.06335701845125774, 0.13257304463973818, -0.11492313224127215, -0.13173672537155012, -0.28191870655864476, -0.07963649887618993, -0.18866114374318654, -0.011868249010020758, -0.15106163815927337, -0.20920405474984471, 0.40765166986898027, 0.2106082941967008, 0.2244823999922065, 0.10886694277732578, 0.3173398236552363, 0.12010358180302907, 0.07499198970549247, 0.09299906702534132, 0.1435226917390109, 0.11768654415055232, 0.047323726933887776, -0.16047299211803714, 0.13836530371404746, 0.023290817955378715] |
1,802.00531 | A generalization of Menon's identity with Dirichlet characters | The classical Menon's identity [7] states that
\begin{equation*}\label{oldbegin1} \sum_{\substack{a\in\Bbb Z_n^\ast }}\gcd(a
-1,n)=\varphi(n) \sigma_{0} (n), \end{equation*} where for a positive integer
$n$, $\Bbb Z_n^\ast$ is the group of units of the ring $\Bbb Z_n=\Bbb Z/n\Bbb
Z$, $\gcd(\ ,\ )$ represents the greatest common divisor, $\varphi(n)$ is the
Euler's totient function and $\sigma_{k} (n) =\sum_{d|n } d^{k}$ is the divisor
function.
In this paper, we generalize Menon's identity with Dirichlet characters in
the following way: \begin{equation*}
\sum_{\substack{a\in\Bbb Z_n^\ast b_1, ..., b_k\in\Bbb Z_n}}
\gcd(a-1,b_1, ..., b_k, n)\chi(a)=\varphi(n)\sigma_k\left(\frac{n}{d}\right),
\end{equation*} where $k$ is a non-negative integer and $\chi$ is a Dirichlet
character modulo $n$ whose conductor is $d$.
Our result can be viewed as an extension of Zhao and Cao's result [16] to
$k>0$.
It can also be viewed as an extension of Sury's result [12] to Dirichlet
characters.
| math.NT | the classical menons identity 7 states that beginequationlabeloldbegin1 sum_substackainbbb z_nast gcda 1nvarphin sigma_0 n endequation where for a positive integer n bbb z_nast is the group of units of the ring bbb z_nbbb znbbb z gcd represents the greatest common divisor varphin is the eulers totient function and sigma_k n sum_dn dk is the divisor function in this paper we generalize menons identity with dirichlet characters in the following way beginequation sum_substackainbbb z_nast b_1 b_kinbbb z_n gcda1b_1 b_k nchiavarphinsigma_kleftfracndright endequation where k is a nonnegative integer and chi is a dirichlet character modulo n whose conductor is d our result can be viewed as an extension of zhao and caos result 16 to k0 it can also be viewed as an extension of surys result 12 to dirichlet characters | [['the', 'classical', 'menons', 'identity', '7', 'states', 'that', 'beginequationlabeloldbegin1', 'sum_substackainbbb', 'z_nast', 'gcda', '1nvarphin', 'sigma_0', 'n', 'endequation', 'where', 'for', 'a', 'positive', 'integer', 'n', 'bbb', 'z_nast', 'is', 'the', 'group', 'of', 'units', 'of', 'the', 'ring', 'bbb', 'z_nbbb', 'znbbb', 'z', 'gcd', 'represents', 'the', 'greatest', 'common', 'divisor', 'varphin', 'is', 'the', 'eulers', 'totient', 'function', 'and', 'sigma_k', 'n', 'sum_dn', 'dk', 'is', 'the', 'divisor', 'function', 'in', 'this', 'paper', 'we', 'generalize', 'menons', 'identity', 'with', 'dirichlet', 'characters', 'in', 'the', 'following', 'way', 'beginequation', 'sum_substackainbbb', 'z_nast', 'b_1', 'b_kinbbb', 'z_n', 'gcda1b_1', 'b_k', 'nchiavarphinsigma_kleftfracndright', 'endequation', 'where', 'k', 'is', 'a', 'nonnegative', 'integer', 'and', 'chi', 'is', 'a', 'dirichlet', 'character', 'modulo', 'n', 'whose', 'conductor', 'is', 'd', 'our', 'result', 'can', 'be', 'viewed', 'as', 'an', 'extension', 'of', 'zhao', 'and', 'caos', 'result', '16', 'to', 'k0', 'it', 'can', 'also', 'be', 'viewed', 'as', 'an', 'extension', 'of', 'surys', 'result', '12', 'to', 'dirichlet', 'characters']] | [-0.24269171979853776, 0.09055404057934487, -0.07341708228128349, 0.00901079460755142, -0.07721124513725924, -0.2077810257499114, -0.03687801846772493, 0.2443397886505941, -0.3422654992711496, -0.18617542370835818, 0.06968695069076418, -0.3456422218946907, -0.1141689279593709, 0.14236851231899203, -0.07858024472825048, 0.01271787108720954, -0.016491051842799274, 0.11278067991455518, 0.004576454823079511, -0.27259010000521605, 0.30966001875462895, -0.09726481472815925, 0.10587318567937709, 0.03265248386121196, 0.007892720831929123, -0.01576809454860726, 0.0707075471068899, -0.09080975340694432, -0.16948963280198612, 0.03008675436267811, 0.29168219531212397, 0.08399771827432077, 0.2468715711398338, -0.33085781340373727, -0.07901009183558749, 0.21114598880559812, 0.19710128092608317, -0.07725593577918967, 0.04695035495636303, -0.23773174106741582, 0.16597746486010834, -0.1378687811765547, -0.17392990376224848, 0.002243033716288524, 0.12610086096011527, -0.0009429525655913886, -0.39648749443846265, 0.07905022465085376, 0.12501718646399979, 0.07564059883446955, -0.0050265147555165176, -0.2775176342887183, 0.02350541006781282, 0.040412159329961714, 0.02158125134457539, 0.19472142083218275, 0.020001957028331917, -0.07536618451955085, -0.05988794464686113, 0.3680520709679742, -0.08668484687956611, -0.2575845340403115, 0.026256325215525258, -0.14911237947606837, -0.15784146202864444, 0.05654100023543205, 0.05780315046895265, 0.175135324023876, -0.027289657200482195, 0.21603752705845905, -0.18944224627779388, 0.1538714262282067, 0.1397336467426664, -0.05663071954963592, 0.10817714700876636, 0.03775938378071519, 0.02168818902353495, 0.12692859004971802, -0.009860563682528531, 0.01834758327198707, -0.3532381072276976, -0.23576010751530407, -0.216011317583119, 0.21363388402463218, -0.11585621133683784, -0.12456456778525579, 0.2851130704933066, 0.026037901232484728, 0.2154541000519402, 0.13198902735834925, 0.1740220616859331, 0.1334158761594331, 0.03541801458251155, 0.054074600535800786, -0.016032079986213307, 0.18840625765922714, -0.003992797405557419, -0.1750311422411625, -0.0027472179882773538, 0.16801146910775724] |
1,802.00532 | Stability for Representations of Hecke Algebras of type $A$ | In this paper we introduce the notion of the stability of a sequence of
modules over Hecke algebras. We prove that a finitely generated consistent
sequence associated with Hecke algebras is representation stable.
| math.RT math.QA math.RA | in this paper we introduce the notion of the stability of a sequence of modules over hecke algebras we prove that a finitely generated consistent sequence associated with hecke algebras is representation stable | [['in', 'this', 'paper', 'we', 'introduce', 'the', 'notion', 'of', 'the', 'stability', 'of', 'a', 'sequence', 'of', 'modules', 'over', 'hecke', 'algebras', 'we', 'prove', 'that', 'a', 'finitely', 'generated', 'consistent', 'sequence', 'associated', 'with', 'hecke', 'algebras', 'is', 'representation', 'stable']] | [-0.20447993157149263, 0.0952125901751446, -0.11614549357556936, 0.028172684494744648, -0.048859560467077026, -0.09016438330890554, -0.06492266540457918, 0.38813862475481903, -0.43013314722162305, -0.1348347103392536, 0.09674553334303765, -0.211071996977835, -0.18819395997420404, 0.18704559936216383, -0.23632960732687602, -0.05287218812824876, 0.17153543132272633, 0.1633914630916534, -0.11017758378787249, -0.2526762970003553, 0.4989346631548621, -0.01898802657414115, 0.20986140908842738, -0.04804876263281613, 0.12375572710439112, 0.015323272567581047, -0.02444154162411437, -0.05681898365869666, -0.16175211803166542, 0.2187429124376539, 0.3087654175575484, 0.06046624116910001, 0.3069076498010845, -0.29979835298251023, -0.046140294804266006, 0.2411454018544067, 0.21938882912085814, 0.01258604072570575, -0.09615658063469737, -0.25827005917601514, 0.18362647149655403, -0.28610949014369963, -0.10762010868215426, -0.059668550324259384, 0.015507592678521618, 0.01874127464764046, -0.2995488847126112, 0.010381999990027962, 0.12237467012847915, 0.19998107873129123, -0.178203633026869, -0.03975746700201522, -0.054879949322309, 0.04694814599034461, -0.06651472478794555, -0.03497685444061503, 0.09151085254482248, -0.07013835943529778, -0.18631324702591606, 0.29584571482105687, -0.047978242351250214, -0.19576431291572977, 0.12726847189619686, -0.19181408532754038, -0.20503117753700775, 0.09366020492532036, 0.04174349047808033, 0.1512073648698402, -0.022659966552799397, 0.1742030569267544, -0.1626301042622689, 0.03699766325228142, 0.11047085608835473, -0.000685440870284131, 0.17733511531894858, 0.15309039757333018, 0.07922956104757208, 0.1759962962206566, 0.0614563548976245, -0.002544870995210879, -0.38634141331369226, -0.20502983595272808, -0.07841793690441233, 0.06940295694000793, -0.05226300241933628, -0.2338883557328672, 0.49428892022732535, 0.19229344919211033, 0.1858187433840199, 0.23339384833745885, 0.1669340351540031, 0.09035617242934126, 0.1341172628330462, 0.0024642832436119065, 0.058346609556765267, 0.26785163750702684, -0.044080177001006, -0.11730988356143687, -0.014660223577679559, 0.21576940615407444] |
1,802.00533 | Persistent Homology and the Upper Box Dimension | We introduce a fractal dimension for a metric space defined in terms of the
persistent homology of extremal subsets of that space. We exhibit hypotheses
under which this dimension is comparable to the upper box dimension; in
particular, the dimensions coincide for subsets of $\mathbb{R}^2$ whose upper
box dimension exceeds $1.5.$ These results are related to extremal questions
about the number of persistent homology intervals of a set of $n$ points in a
metric space.
| math.MG cs.CG math.AT math.CO | we introduce a fractal dimension for a metric space defined in terms of the persistent homology of extremal subsets of that space we exhibit hypotheses under which this dimension is comparable to the upper box dimension in particular the dimensions coincide for subsets of mathbbr2 whose upper box dimension exceeds 15 these results are related to extremal questions about the number of persistent homology intervals of a set of n points in a metric space | [['we', 'introduce', 'a', 'fractal', 'dimension', 'for', 'a', 'metric', 'space', 'defined', 'in', 'terms', 'of', 'the', 'persistent', 'homology', 'of', 'extremal', 'subsets', 'of', 'that', 'space', 'we', 'exhibit', 'hypotheses', 'under', 'which', 'this', 'dimension', 'is', 'comparable', 'to', 'the', 'upper', 'box', 'dimension', 'in', 'particular', 'the', 'dimensions', 'coincide', 'for', 'subsets', 'of', 'mathbbr2', 'whose', 'upper', 'box', 'dimension', 'exceeds', '15', 'these', 'results', 'are', 'related', 'to', 'extremal', 'questions', 'about', 'the', 'number', 'of', 'persistent', 'homology', 'intervals', 'of', 'a', 'set', 'of', 'n', 'points', 'in', 'a', 'metric', 'space']] | [-0.17637358638768394, 0.12839546325306098, -0.01762900033344825, 0.10646118558943271, -0.0226963284984231, -0.0912325786675016, 0.06272941252371918, 0.29928312165041765, -0.23533992821971575, -0.2575494716564814, 0.13169816199224443, -0.3008844362323483, -0.12514001806887487, 0.21323095987240473, -0.11525610968470573, 0.045789795132974785, 0.02417812166425089, 0.1290056679956615, -0.06444572316793104, -0.3222792001549775, 0.4179208323607842, -0.036165738565226396, 0.21545159122596183, 0.02594532224892949, 0.11296629663556815, -0.047326758615672586, -0.005228699402262767, 0.10960768563556485, -0.20258437700928578, 0.1882866478090485, 0.2383813279432555, 0.10557593138267597, 0.20511789318174123, -0.33523948324223357, -0.19072454216579596, 0.1876189916829268, 0.1462055131404971, -0.003071167740660409, 0.06848669389883677, -0.2625324527174234, 0.14621167247494063, -0.10475824328760307, -0.16501546535330514, -0.06958712277313074, 0.10095376105979086, -0.019121279294292134, -0.23468149919062853, 0.013197644868244728, 0.10157653282086054, 0.07558373800711707, -0.08121923568968971, -0.08593569571773212, 0.005218542525544763, 0.12066618900746107, 0.03797596496529877, 0.07496877258022626, 0.08556449853504698, -0.09791506847677131, -0.1535288855805993, 0.31277011312544345, -0.02518615229676167, -0.2807006135582924, 0.18809123296290636, -0.21812073767806092, -0.1513595042563975, 0.12965184333423774, 0.17018278484387944, 0.1323902137329181, -0.035939419070879615, 0.1918763273085157, -0.1294419233997663, 0.152932478711009, 0.1457421124043564, 0.09078874207722644, 0.15506538348893326, 0.1313479109077404, 0.15315358907605212, 0.18472714415751398, -0.07561831360061963, -0.0910190150141716, -0.3413545002539953, -0.17715375404804945, -0.1852275836467743, 0.11044717407474915, -0.18554279925922554, -0.24530255388468503, 0.3822881325148046, 0.116989119425416, 0.25606261941293873, 0.09964943810210873, 0.20158524796366692, 0.06344606685005905, 0.027675455361604692, 0.11632337107012669, 0.13305943998197714, 0.10397648602724076, -0.022218347589174906, -0.10331834395105641, 0.020989714742948612, 0.19700485981690388] |
1,802.00534 | How light absorption modifies the radiative force on a microparticle in
optical tweezers | Reflection and refraction of light can be used to trap small dielectric
particles in the geometrical optics regime. Absorption of light is usually
neglected in theoretical calculations, but it is known that it occurs in the
optical trapping of metallic particles. Also, recent experiments with
semi-transparent microparticles have shown that absorption of light is
important to explain their optically induced oscillations. Here, we propose a
generalization of Ashkin's model for the radiative force exerted on a spherical
bead, including the contribution due to attenuation/absorption of light in the
bulk of the particle. We discuss in detail the balance between refraction,
reflection and absorption for different optical parameters and particle sizes.
A detailed example is provided in order to clarify how the model can be
applied, and it is obtained that the radiative force can either increase or
decrease with absorption, depending on the particle size. Our findings
contribute to the understanding of optical trapping of light-absorbing
particles, and may be used to predict whenever absorption is important in real
experiments.
| cond-mat.mes-hall physics.app-ph physics.bio-ph physics.optics | reflection and refraction of light can be used to trap small dielectric particles in the geometrical optics regime absorption of light is usually neglected in theoretical calculations but it is known that it occurs in the optical trapping of metallic particles also recent experiments with semitransparent microparticles have shown that absorption of light is important to explain their optically induced oscillations here we propose a generalization of ashkins model for the radiative force exerted on a spherical bead including the contribution due to attenuationabsorption of light in the bulk of the particle we discuss in detail the balance between refraction reflection and absorption for different optical parameters and particle sizes a detailed example is provided in order to clarify how the model can be applied and it is obtained that the radiative force can either increase or decrease with absorption depending on the particle size our findings contribute to the understanding of optical trapping of lightabsorbing particles and may be used to predict whenever absorption is important in real experiments | [['reflection', 'and', 'refraction', 'of', 'light', 'can', 'be', 'used', 'to', 'trap', 'small', 'dielectric', 'particles', 'in', 'the', 'geometrical', 'optics', 'regime', 'absorption', 'of', 'light', 'is', 'usually', 'neglected', 'in', 'theoretical', 'calculations', 'but', 'it', 'is', 'known', 'that', 'it', 'occurs', 'in', 'the', 'optical', 'trapping', 'of', 'metallic', 'particles', 'also', 'recent', 'experiments', 'with', 'semitransparent', 'microparticles', 'have', 'shown', 'that', 'absorption', 'of', 'light', 'is', 'important', 'to', 'explain', 'their', 'optically', 'induced', 'oscillations', 'here', 'we', 'propose', 'a', 'generalization', 'of', 'ashkins', 'model', 'for', 'the', 'radiative', 'force', 'exerted', 'on', 'a', 'spherical', 'bead', 'including', 'the', 'contribution', 'due', 'to', 'attenuationabsorption', 'of', 'light', 'in', 'the', 'bulk', 'of', 'the', 'particle', 'we', 'discuss', 'in', 'detail', 'the', 'balance', 'between', 'refraction', 'reflection', 'and', 'absorption', 'for', 'different', 'optical', 'parameters', 'and', 'particle', 'sizes', 'a', 'detailed', 'example', 'is', 'provided', 'in', 'order', 'to', 'clarify', 'how', 'the', 'model', 'can', 'be', 'applied', 'and', 'it', 'is', 'obtained', 'that', 'the', 'radiative', 'force', 'can', 'either', 'increase', 'or', 'decrease', 'with', 'absorption', 'depending', 'on', 'the', 'particle', 'size', 'our', 'findings', 'contribute', 'to', 'the', 'understanding', 'of', 'optical', 'trapping', 'of', 'lightabsorbing', 'particles', 'and', 'may', 'be', 'used', 'to', 'predict', 'whenever', 'absorption', 'is', 'important', 'in', 'real', 'experiments']] | [-0.051180379449284545, 0.1908404556369143, -0.08151150809689647, 0.02967293948140217, -0.06566309971025303, -0.1420128015230321, 0.012137074419851637, 0.43374975713058594, -0.2446207411509628, -0.33371511978718144, 0.05582050981146971, -0.29406181730917613, -0.14966941464393, 0.21079343658181773, -0.03679836182778845, 0.02499460389719302, 0.011327582219521338, -0.022807415437585275, 0.015572783613433352, -0.18714057724338046, 0.2835117719798637, 0.0777597389283723, 0.22806845552432128, 0.14485136468041068, 0.058531203700806056, 0.00547734175121323, -0.01127746474646431, 0.038099894471954374, -0.11234951021093106, 0.08493384039944171, 0.20008583309217579, 0.015235077032619821, 0.18330879204274556, -0.4594094281838763, -0.24338954379449465, 0.10126545820232769, 0.1737338634314559, 0.14085657353834471, -0.09613176076492805, -0.22686782445608905, -0.00612101881900647, -0.10642708517566678, -0.17088208866993054, -0.05986456710213263, 0.026743554316150647, 0.03533820528848862, -0.26559088948748205, 0.04991513692584704, 0.04673067353931921, 0.023421080717915693, -0.0731547805723191, -0.0572116425589359, -0.03225866308674172, 0.09412007240739297, 0.05522508095600642, -0.022634664001608535, 0.19910639263356902, -0.11697352332772598, -0.07536058563051656, 0.4541075357757065, -0.07780243163177233, -0.17319292957074053, 0.20570263657247692, -0.18161585458022142, -0.031176233664155006, 0.17067916019281948, 0.20356925486426225, 0.09072270883812703, -0.09953305504972204, 0.016667558554867616, -0.03859787120295334, 0.17934923743762607, 0.07337322089144782, 0.050156507192046514, 0.23159451345314405, 0.17821362246537492, -0.024877461983123794, 0.13669209626927373, -0.13422384282984284, -0.041303062484422254, -0.26486617725597517, -0.16001619588738927, -0.1852204570535659, 0.046546658140695876, -0.06869155745854576, -0.13901011286621465, 0.3582719658207636, 0.18044513414151014, 0.1754049816046886, -0.045567970090944855, 0.31973913403150317, 0.1409506849307772, 0.08207540119959351, 0.019636142842327467, 0.3555488253422525, 0.1398228697667253, 0.09341863563583631, -0.2665013672272575, 0.05787270871708946, -0.01067742011842451] |
1,802.00535 | Scalable Preprocessing of High Volume Bird Acoustic Data | In this work, we examine the problem of efficiently preprocessing high volume
bird acoustic data. We combine several existing preprocessing steps including
noise reduction approaches into a single efficient pipeline by examining each
process individually. We then utilise a distributed computing architecture to
improve execution time. Using a master-slave model with data parallelisation,
we developed a near-linear automated scalable system, capable of preprocessing
bird acoustic recordings 21.76 times faster with 32 cores over 8 virtual
machines, compared to a serial process. This work contributes to the research
area of bioacoustic analysis, which is currently very active because of its
potential to monitor animals quickly at low cost. Overcoming noise interference
is a significant challenge in many bioacoustic studies, and the volume of data
in these studies is increasing. Our work makes large scale bird acoustic
analyses more feasible by parallelising important bird acoustic processing
tasks to significantly reduce execution times.
| cs.DC cs.SD eess.AS | in this work we examine the problem of efficiently preprocessing high volume bird acoustic data we combine several existing preprocessing steps including noise reduction approaches into a single efficient pipeline by examining each process individually we then utilise a distributed computing architecture to improve execution time using a masterslave model with data parallelisation we developed a nearlinear automated scalable system capable of preprocessing bird acoustic recordings 2176 times faster with 32 cores over 8 virtual machines compared to a serial process this work contributes to the research area of bioacoustic analysis which is currently very active because of its potential to monitor animals quickly at low cost overcoming noise interference is a significant challenge in many bioacoustic studies and the volume of data in these studies is increasing our work makes large scale bird acoustic analyses more feasible by parallelising important bird acoustic processing tasks to significantly reduce execution times | [['in', 'this', 'work', 'we', 'examine', 'the', 'problem', 'of', 'efficiently', 'preprocessing', 'high', 'volume', 'bird', 'acoustic', 'data', 'we', 'combine', 'several', 'existing', 'preprocessing', 'steps', 'including', 'noise', 'reduction', 'approaches', 'into', 'a', 'single', 'efficient', 'pipeline', 'by', 'examining', 'each', 'process', 'individually', 'we', 'then', 'utilise', 'a', 'distributed', 'computing', 'architecture', 'to', 'improve', 'execution', 'time', 'using', 'a', 'masterslave', 'model', 'with', 'data', 'parallelisation', 'we', 'developed', 'a', 'nearlinear', 'automated', 'scalable', 'system', 'capable', 'of', 'preprocessing', 'bird', 'acoustic', 'recordings', '2176', 'times', 'faster', 'with', '32', 'cores', 'over', '8', 'virtual', 'machines', 'compared', 'to', 'a', 'serial', 'process', 'this', 'work', 'contributes', 'to', 'the', 'research', 'area', 'of', 'bioacoustic', 'analysis', 'which', 'is', 'currently', 'very', 'active', 'because', 'of', 'its', 'potential', 'to', 'monitor', 'animals', 'quickly', 'at', 'low', 'cost', 'overcoming', 'noise', 'interference', 'is', 'a', 'significant', 'challenge', 'in', 'many', 'bioacoustic', 'studies', 'and', 'the', 'volume', 'of', 'data', 'in', 'these', 'studies', 'is', 'increasing', 'our', 'work', 'makes', 'large', 'scale', 'bird', 'acoustic', 'analyses', 'more', 'feasible', 'by', 'parallelising', 'important', 'bird', 'acoustic', 'processing', 'tasks', 'to', 'significantly', 'reduce', 'execution', 'times']] | [-0.1008977489445048, 0.06490421126286189, -0.050019640638493, 0.03257531269931254, -0.08976691741651545, -0.16287418061091255, 0.07408755520048241, 0.4004664058734973, -0.24716257692935567, -0.35531323598697784, 0.11772616361035033, -0.26621019082143904, -0.13531478929993077, 0.2369281901155288, -0.10733011836806933, 0.0956558119742355, 0.1355395119668295, -0.029135324937912325, -0.0003570676063342641, -0.2799308465708358, 0.2015320744784549, 0.08889835534927745, 0.3441030865116045, -0.019845617829511563, 0.12817678425073004, -0.006761590166327854, -0.11029968627418081, -0.012004455422672132, -0.04945787154526139, 0.14116551517120873, 0.31600317392343036, 0.1951891202107072, 0.3283934323862195, -0.45560384704420964, -0.22329045829984048, 0.11322809576367339, 0.19814132996524372, 0.15073397084372117, -0.03527111328565904, -0.2557241525687277, 0.08672810945970316, -0.15153275998386864, -0.0576614919770509, -0.110670420313254, 0.04858481622611483, -0.026066413559795668, -0.21967032201277714, 0.05801061082320909, 0.026609385516494513, 0.07095311208628118, -0.025186739673372358, -0.09178526250257467, 0.06546011970844119, 0.13506330128138264, 0.018587852969843274, 0.0618742771136264, 0.18183143442807098, -0.12458558800087, -0.13481121353184183, 0.36229689919700225, -0.04821367210553338, -0.1569241942698136, 0.23245199516415596, -0.05310894523281604, -0.1807704474963248, 0.15970336524148782, 0.2560096181393601, 0.07914837354173263, -0.18323063431773334, 0.011488554691701817, 0.04386984149304529, 0.20834680226941904, 0.06326160078247388, -0.02460046998690814, 0.13673538038972766, 0.30650551076357563, 0.05007198595558293, 0.13896597209153697, -0.12274580642580986, -0.05064811111738284, -0.18077375176362692, -0.14973248941979062, -0.1665069353953004, -0.02948884069841976, -0.08931359033401047, -0.12158272894875456, 0.3643075467770298, 0.2225563370032857, 0.20535544210268805, 0.08384901376518732, 0.4178806311512987, 0.02588068911107257, 0.15381044721851747, 0.10462780526218315, 0.13572285391700764, -0.002917939828087886, 0.16420062868778285, -0.22170791012545427, 0.028007219777597736, -0.022503871532777945] |
1,802.00536 | A Kernel Based High Order "Explicit" Unconditionally Stable Scheme for
Time Dependent Hamilton-Jacobi Equations | In this paper, a class of high order numerical schemes is proposed for
solving Hamilton-Jacobi (H-J) equations. This work is regarded as an extension
of our previous work for nonlinear degenerate parabolic equations, see
Christlieb et al. \emph{arXiv preprint arXiv:1707.09294},, which relies on a
special kernel-based formulation of the solutions and successive convolution.
When applied to the H-J equations, the newly proposed scheme attains genuinely
high order accuracy in both space and time, and more importantly, it is
unconditionally stable, hence allowing for much larger time step evolution
compared with other explicit schemes and saving computational cost. A high
order weighted essentially non-oscillatory methodology and a novel nonlinear
filter are further incorporated to capture the correct viscosity solution.
Furthermore, by coupling the recently proposed inverse Lax-Wendroff boundary
treatment technique, this method is very flexible in handing complex geometry
as well as general boundary conditions. We perform numerical experiments on a
collection of numerical examples, including H-J equations with linear,
nonlinear, convex or non-convex Hamiltonians. The efficacy and efficiency of
the proposed scheme in approximating the viscosity solution of general H-J
equations is verified.
| math.NA | in this paper a class of high order numerical schemes is proposed for solving hamiltonjacobi hj equations this work is regarded as an extension of our previous work for nonlinear degenerate parabolic equations see christlieb et al empharxiv preprint arxiv170709294 which relies on a special kernelbased formulation of the solutions and successive convolution when applied to the hj equations the newly proposed scheme attains genuinely high order accuracy in both space and time and more importantly it is unconditionally stable hence allowing for much larger time step evolution compared with other explicit schemes and saving computational cost a high order weighted essentially nonoscillatory methodology and a novel nonlinear filter are further incorporated to capture the correct viscosity solution furthermore by coupling the recently proposed inverse laxwendroff boundary treatment technique this method is very flexible in handing complex geometry as well as general boundary conditions we perform numerical experiments on a collection of numerical examples including hj equations with linear nonlinear convex or nonconvex hamiltonians the efficacy and efficiency of the proposed scheme in approximating the viscosity solution of general hj equations is verified | [['in', 'this', 'paper', 'a', 'class', 'of', 'high', 'order', 'numerical', 'schemes', 'is', 'proposed', 'for', 'solving', 'hamiltonjacobi', 'hj', 'equations', 'this', 'work', 'is', 'regarded', 'as', 'an', 'extension', 'of', 'our', 'previous', 'work', 'for', 'nonlinear', 'degenerate', 'parabolic', 'equations', 'see', 'christlieb', 'et', 'al', 'empharxiv', 'preprint', 'arxiv170709294', 'which', 'relies', 'on', 'a', 'special', 'kernelbased', 'formulation', 'of', 'the', 'solutions', 'and', 'successive', 'convolution', 'when', 'applied', 'to', 'the', 'hj', 'equations', 'the', 'newly', 'proposed', 'scheme', 'attains', 'genuinely', 'high', 'order', 'accuracy', 'in', 'both', 'space', 'and', 'time', 'and', 'more', 'importantly', 'it', 'is', 'unconditionally', 'stable', 'hence', 'allowing', 'for', 'much', 'larger', 'time', 'step', 'evolution', 'compared', 'with', 'other', 'explicit', 'schemes', 'and', 'saving', 'computational', 'cost', 'a', 'high', 'order', 'weighted', 'essentially', 'nonoscillatory', 'methodology', 'and', 'a', 'novel', 'nonlinear', 'filter', 'are', 'further', 'incorporated', 'to', 'capture', 'the', 'correct', 'viscosity', 'solution', 'furthermore', 'by', 'coupling', 'the', 'recently', 'proposed', 'inverse', 'laxwendroff', 'boundary', 'treatment', 'technique', 'this', 'method', 'is', 'very', 'flexible', 'in', 'handing', 'complex', 'geometry', 'as', 'well', 'as', 'general', 'boundary', 'conditions', 'we', 'perform', 'numerical', 'experiments', 'on', 'a', 'collection', 'of', 'numerical', 'examples', 'including', 'hj', 'equations', 'with', 'linear', 'nonlinear', 'convex', 'or', 'nonconvex', 'hamiltonians', 'the', 'efficacy', 'and', 'efficiency', 'of', 'the', 'proposed', 'scheme', 'in', 'approximating', 'the', 'viscosity', 'solution', 'of', 'general', 'hj', 'equations', 'is', 'verified']] | [-0.09355462439406848, -0.008097795055009255, -0.07314326413101159, 0.03578218019946099, -0.11458356390262002, -0.1649263627023774, 0.015483593829820485, 0.31151483619872194, -0.25516566684086434, -0.30000677155228433, 0.12003604535161835, -0.2279466824429519, -0.17553888899971384, 0.2314850118735314, -0.09516224678309, 0.1564263209526601, 0.08960386858434304, -0.041968172564488516, -0.08222509448699254, -0.29040739123752995, 0.3033647940213956, 0.06105132430924901, 0.27867173486399455, 0.0281080398222452, 0.14647363149816847, -0.02671911232019928, -0.0374041505792475, 0.0649576898237913, -0.11675779527861747, 0.08635656847516177, 0.2773949853144586, 0.06595095615977278, 0.3176477910070629, -0.40866894899754896, -0.24781650672494024, 0.048382370899032266, 0.13228940904130237, 0.12068170930161704, -0.05565584156507752, -0.26547077327332164, 0.095811317229623, -0.18381052687098937, -0.13187631917605688, -0.13831010240815825, 0.007916466089907093, 0.012003675415334139, -0.335170820897834, 0.10304239423879023, 0.07957319356820924, -0.001705384333515642, -0.0775162139344592, -0.08932597331247283, -0.006193108503594176, 0.025744835816222694, 0.016855364107618946, 0.006479226625882662, 0.03502965001849928, -0.07664086067010291, -0.10457345256377217, 0.37907593434287623, -0.06475349532499151, -0.27688912211170236, 0.2135944321117067, -0.06082078206972066, -0.10136698819006087, 0.14902259505182444, 0.19911824648043366, 0.23231492055948455, -0.13928415409232053, 0.10347627685725136, -0.013600732210082012, 0.12921599633505587, 0.0640963049628516, -0.010627399691876925, 0.05967315174332195, 0.18961653315620805, 0.11921228396777923, 0.0994690423936885, -0.016197982225004216, -0.15642864971804166, -0.2910713220122628, -0.1790190683728964, -0.17064434791413638, 0.008487585427976408, -0.09016863720259337, -0.14797457762492391, 0.35904751030630194, 0.143808147440163, 0.1423898244476212, 0.07868167872164541, 0.32670190588028714, 0.20093779652609725, 0.018431013381584538, 0.08541307774366642, 0.21010035283193196, 0.1419604993873061, 0.11502290766297298, -0.25159803377259726, 0.04766074393026449, 0.14472959479086797] |
1,802.00537 | The UV Emission of Stars in LAMOST Survey I. Catalogs | We present the ultraviolet magnitudes for over three million stars in the
LAMOST survey, in which 2,202,116 stars are detected by $GALEX$. For 889,235
undetected stars, we develop a method to estimate their upper limit magnitudes.
The distribution of (FUV $-$ NUV) shows that the color declines with increasing
effective temperature for stars hotter than 7000 K in our sample, while the
trend disappears for the cooler stars due to upper atmosphere emission from the
regions higher than their photospheres. For stars with valid stellar
parameters, we calculate the UV excesses with synthetic model spectra, and find
that the (FUV $-$ NUV) vs. $R'_{\mathrm{FUV}}$ can be fitted with a linear
relation and late-type dwarfs tend to have high UV excesses. There are 87,178
and 1,498,103 stars detected more than once in the visit exposures of $GALEX$
in the FUV and NUV, respectively. We make use of the quantified photometric
errors to determine statistical properties of the UV variation, including
intrinsic variability and the structure function on the timescale of days. The
overall occurrence of possible false positives is below 1.3\% in our sample. UV
absolute magnitudes are calculated for stars with valid parallaxes, which could
serve as a possible reference frame in the NUV. We conclude that the colors
related to UV provide good criteria to distinguish between M giants and M
dwarfs, and the variability of RR Lyrae stars in our sample is stronger than
that of other A and F stars.
| astro-ph.SR | we present the ultraviolet magnitudes for over three million stars in the lamost survey in which 2202116 stars are detected by galex for 889235 undetected stars we develop a method to estimate their upper limit magnitudes the distribution of fuv nuv shows that the color declines with increasing effective temperature for stars hotter than 7000 k in our sample while the trend disappears for the cooler stars due to upper atmosphere emission from the regions higher than their photospheres for stars with valid stellar parameters we calculate the uv excesses with synthetic model spectra and find that the fuv nuv vs r_mathrmfuv can be fitted with a linear relation and latetype dwarfs tend to have high uv excesses there are 87178 and 1498103 stars detected more than once in the visit exposures of galex in the fuv and nuv respectively we make use of the quantified photometric errors to determine statistical properties of the uv variation including intrinsic variability and the structure function on the timescale of days the overall occurrence of possible false positives is below 13 in our sample uv absolute magnitudes are calculated for stars with valid parallaxes which could serve as a possible reference frame in the nuv we conclude that the colors related to uv provide good criteria to distinguish between m giants and m dwarfs and the variability of rr lyrae stars in our sample is stronger than that of other a and f stars | [['we', 'present', 'the', 'ultraviolet', 'magnitudes', 'for', 'over', 'three', 'million', 'stars', 'in', 'the', 'lamost', 'survey', 'in', 'which', '2202116', 'stars', 'are', 'detected', 'by', 'galex', 'for', '889235', 'undetected', 'stars', 'we', 'develop', 'a', 'method', 'to', 'estimate', 'their', 'upper', 'limit', 'magnitudes', 'the', 'distribution', 'of', 'fuv', 'nuv', 'shows', 'that', 'the', 'color', 'declines', 'with', 'increasing', 'effective', 'temperature', 'for', 'stars', 'hotter', 'than', '7000', 'k', 'in', 'our', 'sample', 'while', 'the', 'trend', 'disappears', 'for', 'the', 'cooler', 'stars', 'due', 'to', 'upper', 'atmosphere', 'emission', 'from', 'the', 'regions', 'higher', 'than', 'their', 'photospheres', 'for', 'stars', 'with', 'valid', 'stellar', 'parameters', 'we', 'calculate', 'the', 'uv', 'excesses', 'with', 'synthetic', 'model', 'spectra', 'and', 'find', 'that', 'the', 'fuv', 'nuv', 'vs', 'r_mathrmfuv', 'can', 'be', 'fitted', 'with', 'a', 'linear', 'relation', 'and', 'latetype', 'dwarfs', 'tend', 'to', 'have', 'high', 'uv', 'excesses', 'there', 'are', '87178', 'and', '1498103', 'stars', 'detected', 'more', 'than', 'once', 'in', 'the', 'visit', 'exposures', 'of', 'galex', 'in', 'the', 'fuv', 'and', 'nuv', 'respectively', 'we', 'make', 'use', 'of', 'the', 'quantified', 'photometric', 'errors', 'to', 'determine', 'statistical', 'properties', 'of', 'the', 'uv', 'variation', 'including', 'intrinsic', 'variability', 'and', 'the', 'structure', 'function', 'on', 'the', 'timescale', 'of', 'days', 'the', 'overall', 'occurrence', 'of', 'possible', 'false', 'positives', 'is', 'below', '13', 'in', 'our', 'sample', 'uv', 'absolute', 'magnitudes', 'are', 'calculated', 'for', 'stars', 'with', 'valid', 'parallaxes', 'which', 'could', 'serve', 'as', 'a', 'possible', 'reference', 'frame', 'in', 'the', 'nuv', 'we', 'conclude', 'that', 'the', 'colors', 'related', 'to', 'uv', 'provide', 'good', 'criteria', 'to', 'distinguish', 'between', 'm', 'giants', 'and', 'm', 'dwarfs', 'and', 'the', 'variability', 'of', 'rr', 'lyrae', 'stars', 'in', 'our', 'sample', 'is', 'stronger', 'than', 'that', 'of', 'other', 'a', 'and', 'f', 'stars']] | [0.019227308618256, 0.14456413754743477, -0.06249124340202967, 0.12563673319725194, -0.09602535016325665, -0.06630586236281226, 0.12372253716714143, 0.4645874845732193, -0.11926186369668881, -0.38296426801105676, 0.013220677569102085, -0.362512068726296, -0.026128731217379367, 0.227415095964423, -0.10430428169280985, -0.03860066882758875, 0.07598775922334595, -0.046867045478069545, -0.04925365730482785, -0.31503257699955994, 0.25532761636245366, -0.001700516991411983, 0.13750126022229886, -0.06489470186722228, 0.0002405347190456962, -0.10187346781446141, -0.1159860310894516, -0.013519672795309353, -0.16788557305563562, 0.04049245047718938, 0.24037137474880507, 0.13403142616152763, 0.2131332556482294, -0.3200624979341166, -0.2139064512625968, 0.0986827417588556, 0.18359710267247728, 0.002700085924362164, -0.01585382271650044, -0.22394526176059903, 0.1121144604452854, -0.11717359807689563, -0.14389137451816153, 0.020185413389068128, 0.10146181371903552, 0.02360933970130183, -0.2693271911222097, 0.10145164549119388, 0.021087742998102933, 0.16729041064326786, -0.14631624256607967, -0.16063664488739066, -0.1028259407247464, 0.110445408602403, 0.028549694895677238, 0.08058095805275933, 0.11686303360798096, -0.16036558834149234, 0.005935999919991877, 0.37839654222193914, -0.1553851127374416, 0.005081682576466415, 0.2182191618327525, -0.18630700858933377, -0.11008385079123585, 0.13328426867630727, 0.1398702128790319, 0.15604399202561195, -0.19113536456612656, -0.004608127324036875, 0.017109702637229683, 0.19305436249913144, 0.07427051808029982, 0.14493034847950861, 0.29012470992214945, 0.08497102696338069, 0.06220041627707591, 0.10248384601017263, -0.2669178906076398, -7.569508171261493e-05, -0.26527423294403163, -0.08651646270053619, -0.09504479547800748, 0.06263013753716408, -0.13648146595085686, -0.14001878228835699, 0.346216748829786, 0.17870400838111922, 0.2065135850925028, 0.09880507681360942, 0.2960823582469533, 0.11768962979470617, 0.13925514942745348, 0.1341181298277846, 0.33748723348302734, 0.1557775264042548, 0.06512336605830292, -0.22889988672015874, 0.05130034766773599, -0.02206466414460565] |
1,802.00538 | Decentralized Control of Stochastically Switched Linear System with
Unreliable Communication | We consider a networked control system (NCS) consisting of two plants, a
global plant and a local plant, and two controllers, a global controller and a
local controller. The global (resp. local) plant follows discrete-time
stochastically switched linear dynamics with a continuous global (resp. local)
state and a discrete global (resp. local) mode. We assume that the state and
mode of the global plant are observed by both controllers while the state and
mode of the local plant are only observed by the local controller. The local
controller can inform the global controller of the local plant's state and mode
through an unreliable TCP-like communication channel where successful
transmissions are acknowledged. The objective of the controllers is to
cooperatively minimize a modes-dependent quadratic cost over a finite time
horizon. Following the method developed in [1] and [2], we construct a dynamic
program based on common information and a decomposition of strategies, and use
it to obtain explicit optimal strategies for the controllers. In the optimal
strategies, both controllers compute a common estimate of the local plant's
state. The global controller's action is linear in the state of the global
plant and the common estimated state, and the local controller's action is
linear in the actual states of both plants and the common estimated state.
Furthermore, the gain matrices for the global controller depend on the global
mode and its observation about the local mode, while the gain matrices for the
local controller depend on the actual modes of both plants and the global
controller's observation about the local mode.
| cs.SY math.OC | we consider a networked control system ncs consisting of two plants a global plant and a local plant and two controllers a global controller and a local controller the global resp local plant follows discretetime stochastically switched linear dynamics with a continuous global resp local state and a discrete global resp local mode we assume that the state and mode of the global plant are observed by both controllers while the state and mode of the local plant are only observed by the local controller the local controller can inform the global controller of the local plants state and mode through an unreliable tcplike communication channel where successful transmissions are acknowledged the objective of the controllers is to cooperatively minimize a modesdependent quadratic cost over a finite time horizon following the method developed in 1 and 2 we construct a dynamic program based on common information and a decomposition of strategies and use it to obtain explicit optimal strategies for the controllers in the optimal strategies both controllers compute a common estimate of the local plants state the global controllers action is linear in the state of the global plant and the common estimated state and the local controllers action is linear in the actual states of both plants and the common estimated state furthermore the gain matrices for the global controller depend on the global mode and its observation about the local mode while the gain matrices for the local controller depend on the actual modes of both plants and the global controllers observation about the local mode | [['we', 'consider', 'a', 'networked', 'control', 'system', 'ncs', 'consisting', 'of', 'two', 'plants', 'a', 'global', 'plant', 'and', 'a', 'local', 'plant', 'and', 'two', 'controllers', 'a', 'global', 'controller', 'and', 'a', 'local', 'controller', 'the', 'global', 'resp', 'local', 'plant', 'follows', 'discretetime', 'stochastically', 'switched', 'linear', 'dynamics', 'with', 'a', 'continuous', 'global', 'resp', 'local', 'state', 'and', 'a', 'discrete', 'global', 'resp', 'local', 'mode', 'we', 'assume', 'that', 'the', 'state', 'and', 'mode', 'of', 'the', 'global', 'plant', 'are', 'observed', 'by', 'both', 'controllers', 'while', 'the', 'state', 'and', 'mode', 'of', 'the', 'local', 'plant', 'are', 'only', 'observed', 'by', 'the', 'local', 'controller', 'the', 'local', 'controller', 'can', 'inform', 'the', 'global', 'controller', 'of', 'the', 'local', 'plants', 'state', 'and', 'mode', 'through', 'an', 'unreliable', 'tcplike', 'communication', 'channel', 'where', 'successful', 'transmissions', 'are', 'acknowledged', 'the', 'objective', 'of', 'the', 'controllers', 'is', 'to', 'cooperatively', 'minimize', 'a', 'modesdependent', 'quadratic', 'cost', 'over', 'a', 'finite', 'time', 'horizon', 'following', 'the', 'method', 'developed', 'in', '1', 'and', '2', 'we', 'construct', 'a', 'dynamic', 'program', 'based', 'on', 'common', 'information', 'and', 'a', 'decomposition', 'of', 'strategies', 'and', 'use', 'it', 'to', 'obtain', 'explicit', 'optimal', 'strategies', 'for', 'the', 'controllers', 'in', 'the', 'optimal', 'strategies', 'both', 'controllers', 'compute', 'a', 'common', 'estimate', 'of', 'the', 'local', 'plants', 'state', 'the', 'global', 'controllers', 'action', 'is', 'linear', 'in', 'the', 'state', 'of', 'the', 'global', 'plant', 'and', 'the', 'common', 'estimated', 'state', 'and', 'the', 'local', 'controllers', 'action', 'is', 'linear', 'in', 'the', 'actual', 'states', 'of', 'both', 'plants', 'and', 'the', 'common', 'estimated', 'state', 'furthermore', 'the', 'gain', 'matrices', 'for', 'the', 'global', 'controller', 'depend', 'on', 'the', 'global', 'mode', 'and', 'its', 'observation', 'about', 'the', 'local', 'mode', 'while', 'the', 'gain', 'matrices', 'for', 'the', 'local', 'controller', 'depend', 'on', 'the', 'actual', 'modes', 'of', 'both', 'plants', 'and', 'the', 'global', 'controllers', 'observation', 'about', 'the', 'local', 'mode']] | [-0.17267484740938904, 0.055917922051882014, -0.10045631635796944, 0.014842106621042269, -0.029909623229998895, -0.1592610958483532, 0.07360046795865362, 0.31821015452273016, -0.3213661611007974, -0.26281116467787996, 0.19910596432922364, -0.22871664555223528, -0.14144635632523161, 0.15033720591008057, -0.07204700342574438, 0.11253202456214768, 1.9725024079283077e-05, 0.09062176790943932, -0.007837537604126026, -0.20652168361170492, 0.29038643623231153, 0.035143069332725436, 0.29814023061298095, -0.08137798570493568, 0.20205639272363307, 0.005756827079431089, -0.007687005032099379, -0.010581790000315784, -0.0790618484355692, 0.10436986026948845, 0.25034175358366134, 0.1534764341704995, 0.31173166189371615, -0.4890238072419929, -0.17709954698793878, 0.15773117830327085, 0.07730982280625102, 0.10999684093331434, -0.006536437411045352, -0.2645776707032883, 0.1174147785600643, -0.1569209941662848, -0.06877168728753405, -0.05045580896079656, -0.022739930461023666, 0.04154825318097534, -0.335405758040589, 0.04605089788065227, 0.044046241375834266, 0.06805209856292652, -0.14323784469025816, -0.08402159176324675, -0.11377589146077792, 0.18396350166168382, -0.024208308434449568, -0.019653342350642377, 0.21719283499762185, -0.12439074362953041, -0.12458032299944943, 0.3067142211492787, -0.01508597134930161, -0.2023122704663682, 0.17527293851134337, -0.09829948441118233, -0.0595796158629318, 0.09977630015765858, 0.20510168809555615, 0.10025083879369867, -0.15776521698463447, 0.049935499584083914, -0.02788805586192035, 0.21067758694800093, -0.02603579454607684, 0.04743434645798664, 0.15522960174734912, 0.1621694564963727, 0.2193459453821081, 0.10462021941225254, -0.028748394192698187, -0.1387457066583772, -0.282839385063438, -0.0935377068073099, -0.12482961791609468, -0.03863327384632182, -0.08294220360961803, -0.11001673985503671, 0.46531228529101654, 0.05598541901649026, 0.1619465817830908, 0.09439534913972308, 0.32436103844480924, 0.10896257770630394, 0.04462523514209965, 0.12101016261311638, 0.26574679469426216, 0.09770470044517875, 0.11171530913372069, -0.3287986787288746, 0.10601270652571043, 0.02508126749556021] |
1,802.00539 | Complex Network Classification with Convolutional Neural Network | Classifying large scale networks into several categories and distinguishing
them according to their fine structures is of great importance with several
applications in real life. However, most studies of complex networks focus on
properties of a single network but seldom on classification, clustering, and
comparison between different networks, in which the network is treated as a
whole. Due to the non-Euclidean properties of the data, conventional methods
can hardly be applied on networks directly. In this paper, we propose a novel
framework of complex network classifier (CNC) by integrating network embedding
and convolutional neural network to tackle the problem of network
classification. By training the classifiers on synthetic complex network data
and real international trade network data, we show CNC can not only classify
networks in a high accuracy and robustness, it can also extract the features of
the networks automatically.
| cs.CV | classifying large scale networks into several categories and distinguishing them according to their fine structures is of great importance with several applications in real life however most studies of complex networks focus on properties of a single network but seldom on classification clustering and comparison between different networks in which the network is treated as a whole due to the noneuclidean properties of the data conventional methods can hardly be applied on networks directly in this paper we propose a novel framework of complex network classifier cnc by integrating network embedding and convolutional neural network to tackle the problem of network classification by training the classifiers on synthetic complex network data and real international trade network data we show cnc can not only classify networks in a high accuracy and robustness it can also extract the features of the networks automatically | [['classifying', 'large', 'scale', 'networks', 'into', 'several', 'categories', 'and', 'distinguishing', 'them', 'according', 'to', 'their', 'fine', 'structures', 'is', 'of', 'great', 'importance', 'with', 'several', 'applications', 'in', 'real', 'life', 'however', 'most', 'studies', 'of', 'complex', 'networks', 'focus', 'on', 'properties', 'of', 'a', 'single', 'network', 'but', 'seldom', 'on', 'classification', 'clustering', 'and', 'comparison', 'between', 'different', 'networks', 'in', 'which', 'the', 'network', 'is', 'treated', 'as', 'a', 'whole', 'due', 'to', 'the', 'noneuclidean', 'properties', 'of', 'the', 'data', 'conventional', 'methods', 'can', 'hardly', 'be', 'applied', 'on', 'networks', 'directly', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'framework', 'of', 'complex', 'network', 'classifier', 'cnc', 'by', 'integrating', 'network', 'embedding', 'and', 'convolutional', 'neural', 'network', 'to', 'tackle', 'the', 'problem', 'of', 'network', 'classification', 'by', 'training', 'the', 'classifiers', 'on', 'synthetic', 'complex', 'network', 'data', 'and', 'real', 'international', 'trade', 'network', 'data', 'we', 'show', 'cnc', 'can', 'not', 'only', 'classify', 'networks', 'in', 'a', 'high', 'accuracy', 'and', 'robustness', 'it', 'can', 'also', 'extract', 'the', 'features', 'of', 'the', 'networks', 'automatically']] | [-0.0764678925166818, -0.021948617506534495, -0.027540761027947492, 0.0762400562975701, -0.08511079726938872, -0.15818820912423973, 0.0312864286238856, 0.4529733941460966, -0.31243584711675976, -0.3286321268397126, 0.11171475841733132, -0.24824443719752715, -0.2565467013904812, 0.1910586271129329, -0.11017276181885642, 0.06251087340655083, 0.1362773698146937, 0.05099713562571622, -0.03400697049863161, -0.27948917392046846, 0.37435196962286815, 0.04470704028924517, 0.3677566056899356, 0.041914008846770684, 0.08280245793227053, -0.046519326382557735, -0.037258620413535455, 0.05207182780185389, -0.0033998235218814766, 0.18815931644379855, 0.2897727486036771, 0.1859983400580414, 0.3052242798004167, -0.4385399873375047, -0.2919620740167955, 0.15705332678498318, 0.13700525480461248, 0.09093860549941421, 0.044559498036821896, -0.336114103767149, 0.1204277106720941, -0.15946131081696838, 0.020014527034186196, -0.16945331132845254, -0.005927677547017522, 0.022408521950495898, -0.21143425245775926, -0.012675104467718407, 0.02256470441765396, 0.05752932475648609, -0.06276276068603422, -0.07443770607404993, -0.034239483052692934, 0.18040388428559856, -0.0014614468764064582, 0.01610237981542839, 0.11751558293145917, -0.18286116972585467, -0.14303443415077233, 0.39981479502897316, -0.03689118323959938, -0.21377017147548444, 0.22316623657796505, -0.04332063799552249, -0.1745042256442896, 0.07690700306061735, 0.296822687036338, 0.10696177487509285, -0.18696950709592577, 0.008748037596513906, -0.026921510887959747, 0.16500699986432885, 0.02037246720138805, -0.013708010804674304, 0.18099224290658608, 0.2939003129879422, 0.012243591367881348, 0.11952858405015993, -0.13419029281614184, -0.056194714217691136, -0.17959632805766576, -0.10279164563844655, -0.2166391202506233, -0.0037629113528268175, -0.1352269412244378, -0.1475133198653579, 0.4457702200252114, 0.16968594907604634, 0.26891300835190934, 0.07941201111344713, 0.32130281571695146, 0.007455560932735126, 0.15334507398446032, 0.06803479786724487, 0.19584515966815175, 0.08199686060679402, 0.13737683585706226, -0.1224216026293629, 0.0866156722508133, 0.008643052184042778] |
1,802.0054 | Dense Instanton-Dyon Liquid Model: Diagrammatics | We revisit the instanton-dyon liquid model in the confined phase by using a
non-linear Debye-Huckel (DH) resummation for the Coulomb interactions induced
by the moduli, followed by a cluster expansion. The organization is shown to
rapidly converge and yields center symmetry at high density. The dependence of
these results on a finite vacuum angle are also discussed. We also formulate
the hypernetted chain (HCN) resummation for the dense instanton-dyon liquid and
use it to estimate the liquid pair correlation functions in the DH limit. At
very low temperature, the dense limit interpolates between chains and rings of
instanton-anti-instanton-dyons and a bcc crystal, with strong topological and
magnetic correlations.
| hep-ph hep-lat hep-th | we revisit the instantondyon liquid model in the confined phase by using a nonlinear debyehuckel dh resummation for the coulomb interactions induced by the moduli followed by a cluster expansion the organization is shown to rapidly converge and yields center symmetry at high density the dependence of these results on a finite vacuum angle are also discussed we also formulate the hypernetted chain hcn resummation for the dense instantondyon liquid and use it to estimate the liquid pair correlation functions in the dh limit at very low temperature the dense limit interpolates between chains and rings of instantonantiinstantondyons and a bcc crystal with strong topological and magnetic correlations | [['we', 'revisit', 'the', 'instantondyon', 'liquid', 'model', 'in', 'the', 'confined', 'phase', 'by', 'using', 'a', 'nonlinear', 'debyehuckel', 'dh', 'resummation', 'for', 'the', 'coulomb', 'interactions', 'induced', 'by', 'the', 'moduli', 'followed', 'by', 'a', 'cluster', 'expansion', 'the', 'organization', 'is', 'shown', 'to', 'rapidly', 'converge', 'and', 'yields', 'center', 'symmetry', 'at', 'high', 'density', 'the', 'dependence', 'of', 'these', 'results', 'on', 'a', 'finite', 'vacuum', 'angle', 'are', 'also', 'discussed', 'we', 'also', 'formulate', 'the', 'hypernetted', 'chain', 'hcn', 'resummation', 'for', 'the', 'dense', 'instantondyon', 'liquid', 'and', 'use', 'it', 'to', 'estimate', 'the', 'liquid', 'pair', 'correlation', 'functions', 'in', 'the', 'dh', 'limit', 'at', 'very', 'low', 'temperature', 'the', 'dense', 'limit', 'interpolates', 'between', 'chains', 'and', 'rings', 'of', 'instantonantiinstantondyons', 'and', 'a', 'bcc', 'crystal', 'with', 'strong', 'topological', 'and', 'magnetic', 'correlations']] | [-0.12458454185953172, 0.1987847405263858, -0.08237666084276617, 0.0757431878532048, 0.04099019253452387, -0.09263747027927191, 0.04962219736564939, 0.36903292442036567, -0.24950598554563858, -0.24430424253517222, 0.05570822602320706, -0.29787623014509956, -0.09005669554070979, 0.10131376845736022, 0.06418908388292957, 0.04036527558308199, 0.0078540493551398, -0.01429825701759519, -0.12395968494031613, -0.1851900850670743, 0.2947125652735339, 0.07326725038273313, 0.29153476208100254, 0.10900695601948232, 0.1001292943571494, 0.0275253675525538, 0.03897981589799312, 0.03804832223419831, -0.16250421579004587, 0.07151633145931725, 0.233079561178146, -0.040332145384016714, 0.15828564157274283, -0.426352637445676, -0.18610313930766326, 0.060790346500193965, 0.1252695550733011, 0.1049039877981609, -0.04293664785376184, -0.2665216489651493, 0.050258702833518805, -0.2199255339039716, -0.16906929173110766, -0.10368724408881547, 0.006175439443578509, 0.050331063341473394, -0.2555383717223445, 0.1037182406099104, 0.03099087288899121, 0.04982904123716822, -0.04377532268604525, -0.09005645351162372, -0.03361968331421926, 0.066175627443835, 0.032337371413334856, 0.048193247240280436, 0.1519431710062618, -0.1662506961125541, -0.029280601644879816, 0.3750793679277891, -0.12021274899489412, -0.14828796714335402, 0.22833259217441082, -0.1792535550552899, -0.13971631280712296, 0.17707920401731383, 0.10631613841521875, 0.0886840326450417, -0.1044286594586882, 0.11323186120635255, -0.02092397933777979, 0.15280051163841632, 0.07369468379852788, 0.010139090400711398, 0.23846078154012978, 0.16429331027423946, 0.04931462516955962, 0.16124535979981594, -0.12034417571996069, -0.13660802655183127, -0.2841718070661632, -0.1405962939835458, -0.1575329480431626, 0.008901414291706876, -0.11991935379073682, -0.15794605468524942, 0.32902090366256304, 0.08735922979116724, 0.21088189079217334, 0.042595795312217466, 0.23795049371215227, 0.12054867415784676, 0.05562115137717713, 0.04064294011288575, 0.25668837718456705, 0.202153324321452, 0.07203119997997011, -0.2746357658669074, 0.028865128020085742, 0.1296170665295011] |
1,802.00541 | Causal Learning and Explanation of Deep Neural Networks via Autoencoded
Activations | Deep neural networks are complex and opaque. As they enter application in a
variety of important and safety critical domains, users seek methods to explain
their output predictions. We develop an approach to explaining deep neural
networks by constructing causal models on salient concepts contained in a CNN.
We develop methods to extract salient concepts throughout a target network by
using autoencoders trained to extract human-understandable representations of
network activations. We then build a bayesian causal model using these
extracted concepts as variables in order to explain image classification.
Finally, we use this causal model to identify and visualize features with
significant causal influence on final classification.
| cs.AI cs.LG stat.ML | deep neural networks are complex and opaque as they enter application in a variety of important and safety critical domains users seek methods to explain their output predictions we develop an approach to explaining deep neural networks by constructing causal models on salient concepts contained in a cnn we develop methods to extract salient concepts throughout a target network by using autoencoders trained to extract humanunderstandable representations of network activations we then build a bayesian causal model using these extracted concepts as variables in order to explain image classification finally we use this causal model to identify and visualize features with significant causal influence on final classification | [['deep', 'neural', 'networks', 'are', 'complex', 'and', 'opaque', 'as', 'they', 'enter', 'application', 'in', 'a', 'variety', 'of', 'important', 'and', 'safety', 'critical', 'domains', 'users', 'seek', 'methods', 'to', 'explain', 'their', 'output', 'predictions', 'we', 'develop', 'an', 'approach', 'to', 'explaining', 'deep', 'neural', 'networks', 'by', 'constructing', 'causal', 'models', 'on', 'salient', 'concepts', 'contained', 'in', 'a', 'cnn', 'we', 'develop', 'methods', 'to', 'extract', 'salient', 'concepts', 'throughout', 'a', 'target', 'network', 'by', 'using', 'autoencoders', 'trained', 'to', 'extract', 'humanunderstandable', 'representations', 'of', 'network', 'activations', 'we', 'then', 'build', 'a', 'bayesian', 'causal', 'model', 'using', 'these', 'extracted', 'concepts', 'as', 'variables', 'in', 'order', 'to', 'explain', 'image', 'classification', 'finally', 'we', 'use', 'this', 'causal', 'model', 'to', 'identify', 'and', 'visualize', 'features', 'with', 'significant', 'causal', 'influence', 'on', 'final', 'classification']] | [0.0001158365962382789, -0.022863550882902928, -0.08314620932372653, 0.14982739553860797, -0.14116936094327787, -0.18225747422602412, 0.04232805178317929, 0.4584074244947634, -0.29647328727225836, -0.3148303083709885, 0.05131304682837364, -0.2609439402923127, -0.2725020671289449, 0.13373548701997393, -0.11745645788445999, 0.0729152817185533, 0.08016704715501134, 0.06604489453015065, -0.0675426010906296, -0.2545177486429217, 0.34436945841760835, 0.03169378567275931, 0.3099569821399506, -0.01782080149887321, 0.14058849762115522, -0.02353036491565894, -0.07299006436994979, 0.010401455826935507, -0.13701724763263332, 0.21936523614921302, 0.36974385403093, 0.22174846823544841, 0.3091886889159018, -0.4723263756137028, -0.28170139111021414, 0.09964763712155346, 0.1276722997731625, 0.13100158301765255, 0.04002124164906269, -0.3450334595046311, 0.10908955547123034, -0.15776370997131567, -0.016735112007324384, -0.22915177009825674, -0.04587376081149712, -0.03790957620367408, -0.2399981258715564, 0.0019895506665876537, 0.0538794351503673, 0.05375283429938778, -0.057865390210264475, -0.06648301190661841, 0.01164658583491762, 0.1851454605740086, 0.010230296672208705, 0.04455615340723334, 0.15014647499214265, -0.2049457298256631, -0.1707390767226222, 0.29240128340495525, -0.038313425293466444, -0.22487116195957793, 0.2063362640372225, -0.016774206626812154, -0.17531802414516073, 0.0609021845543496, 0.3257544900107885, 0.0697137143342673, -0.18687565199090778, -0.045754050237026556, -0.026611379528348553, 0.15640006659587272, 0.02990079165009834, -0.0038851720659567094, 0.2425890672401412, 0.2714218401358785, -0.056792864306159666, 0.1280719015016177, -0.13064845376098572, -0.06900958185384451, -0.24213140859991034, -0.07012926472490218, -0.14136353013906452, -0.010301747481190712, -0.09645595718743649, -0.173721621180754, 0.4203184857207272, 0.2703663032832686, 0.2704611107115155, 0.08980544867150694, 0.30529775493995887, 0.01632947642921914, 0.13852408292233317, 0.09661802704768063, 0.1729323471957278, 0.11276016010963749, 0.11196482720323533, -0.09122131859326613, 0.10459324417670614, 0.07713572840450035] |
1,802.00542 | ExpNet: Landmark-Free, Deep, 3D Facial Expressions | We describe a deep learning based method for estimating 3D facial expression
coefficients. Unlike previous work, our process does not relay on facial
landmark detection methods as a proxy step. Recent methods have shown that a
CNN can be trained to regress accurate and discriminative 3D morphable model
(3DMM) representations, directly from image intensities. By foregoing facial
landmark detection, these methods were able to estimate shapes for occluded
faces appearing in unprecedented in-the-wild viewing conditions. We build on
those methods by showing that facial expressions can also be estimated by a
robust, deep, landmark-free approach. Our ExpNet CNN is applied directly to the
intensities of a face image and regresses a 29D vector of 3D expression
coefficients. We propose a unique method for collecting data to train this
network, leveraging on the robustness of deep networks to training label noise.
We further offer a novel means of evaluating the accuracy of estimated
expression coefficients: by measuring how well they capture facial emotions on
the CK+ and EmotiW-17 emotion recognition benchmarks. We show that our ExpNet
produces expression coefficients which better discriminate between facial
emotions than those obtained using state of the art, facial landmark detection
techniques. Moreover, this advantage grows as image scales drop, demonstrating
that our ExpNet is more robust to scale changes than landmark detection
methods. Finally, at the same level of accuracy, our ExpNet is orders of
magnitude faster than its alternatives.
| cs.CV | we describe a deep learning based method for estimating 3d facial expression coefficients unlike previous work our process does not relay on facial landmark detection methods as a proxy step recent methods have shown that a cnn can be trained to regress accurate and discriminative 3d morphable model 3dmm representations directly from image intensities by foregoing facial landmark detection these methods were able to estimate shapes for occluded faces appearing in unprecedented inthewild viewing conditions we build on those methods by showing that facial expressions can also be estimated by a robust deep landmarkfree approach our expnet cnn is applied directly to the intensities of a face image and regresses a 29d vector of 3d expression coefficients we propose a unique method for collecting data to train this network leveraging on the robustness of deep networks to training label noise we further offer a novel means of evaluating the accuracy of estimated expression coefficients by measuring how well they capture facial emotions on the ck and emotiw17 emotion recognition benchmarks we show that our expnet produces expression coefficients which better discriminate between facial emotions than those obtained using state of the art facial landmark detection techniques moreover this advantage grows as image scales drop demonstrating that our expnet is more robust to scale changes than landmark detection methods finally at the same level of accuracy our expnet is orders of magnitude faster than its alternatives | [['we', 'describe', 'a', 'deep', 'learning', 'based', 'method', 'for', 'estimating', '3d', 'facial', 'expression', 'coefficients', 'unlike', 'previous', 'work', 'our', 'process', 'does', 'not', 'relay', 'on', 'facial', 'landmark', 'detection', 'methods', 'as', 'a', 'proxy', 'step', 'recent', 'methods', 'have', 'shown', 'that', 'a', 'cnn', 'can', 'be', 'trained', 'to', 'regress', 'accurate', 'and', 'discriminative', '3d', 'morphable', 'model', '3dmm', 'representations', 'directly', 'from', 'image', 'intensities', 'by', 'foregoing', 'facial', 'landmark', 'detection', 'these', 'methods', 'were', 'able', 'to', 'estimate', 'shapes', 'for', 'occluded', 'faces', 'appearing', 'in', 'unprecedented', 'inthewild', 'viewing', 'conditions', 'we', 'build', 'on', 'those', 'methods', 'by', 'showing', 'that', 'facial', 'expressions', 'can', 'also', 'be', 'estimated', 'by', 'a', 'robust', 'deep', 'landmarkfree', 'approach', 'our', 'expnet', 'cnn', 'is', 'applied', 'directly', 'to', 'the', 'intensities', 'of', 'a', 'face', 'image', 'and', 'regresses', 'a', '29d', 'vector', 'of', '3d', 'expression', 'coefficients', 'we', 'propose', 'a', 'unique', 'method', 'for', 'collecting', 'data', 'to', 'train', 'this', 'network', 'leveraging', 'on', 'the', 'robustness', 'of', 'deep', 'networks', 'to', 'training', 'label', 'noise', 'we', 'further', 'offer', 'a', 'novel', 'means', 'of', 'evaluating', 'the', 'accuracy', 'of', 'estimated', 'expression', 'coefficients', 'by', 'measuring', 'how', 'well', 'they', 'capture', 'facial', 'emotions', 'on', 'the', 'ck', 'and', 'emotiw17', 'emotion', 'recognition', 'benchmarks', 'we', 'show', 'that', 'our', 'expnet', 'produces', 'expression', 'coefficients', 'which', 'better', 'discriminate', 'between', 'facial', 'emotions', 'than', 'those', 'obtained', 'using', 'state', 'of', 'the', 'art', 'facial', 'landmark', 'detection', 'techniques', 'moreover', 'this', 'advantage', 'grows', 'as', 'image', 'scales', 'drop', 'demonstrating', 'that', 'our', 'expnet', 'is', 'more', 'robust', 'to', 'scale', 'changes', 'than', 'landmark', 'detection', 'methods', 'finally', 'at', 'the', 'same', 'level', 'of', 'accuracy', 'our', 'expnet', 'is', 'orders', 'of', 'magnitude', 'faster', 'than', 'its', 'alternatives']] | [0.0020698850624445153, -0.04099510960648628, -0.0739013457854674, 0.06100054769985516, -0.08775669185928361, -0.18984558898131182, -0.00719204136218412, 0.46665438172675255, -0.212496995156463, -0.3196977273972761, 0.06558335085560332, -0.27971629987874513, -0.2291348449180858, 0.21321230770844182, -0.154983209389114, 0.09283735205358407, 0.12960457659472388, 0.06143334332969471, -0.09590534896896093, -0.26883227860379183, 0.2655865167279612, 0.03686070907323885, 0.33370422459679133, 0.03212796864119786, 0.1518372706494338, -0.05201038202148954, -0.0491975673780149, 0.007584725175844306, -0.0599714125584773, 0.2203767334284721, 0.31536087502681454, 0.18846836701123434, 0.24335341456360204, -0.4128025684070018, -0.23540235379580388, 0.05157665353240405, 0.16139820162526655, 0.14699696220783318, -0.012125497855070694, -0.38608057479985664, 0.09414606703777074, -0.14253743332031266, 0.008768710359739132, -0.18778754402823394, -0.0038521438197516578, -0.053623324823206045, -0.3156500490234421, 0.07081759319820066, 0.06537630566138007, 0.10107479015537119, -0.07498649051942555, -0.13554363130679745, 0.016586120492207135, 0.19789907867048942, 0.037292336154096585, 0.06813541000727424, 0.1729394255381861, -0.22243441111865841, -0.12451437532166298, 0.3442745986814279, -0.08904093835129884, -0.23618883968135063, 0.18445085072310347, -0.08142158631115448, -0.11724992458560692, 0.1500003234685155, 0.229061036558558, 0.15688557019697047, -0.14017055575763845, -0.044274976405828725, -0.05300776707008481, 0.1909510071140558, 0.07976459387326093, -0.035155182902185576, 0.1717879655096448, 0.1993763462156697, 0.024613476331373715, 0.1169063441751149, -0.19934853359001645, 0.0027389964827010606, -0.18228320876544127, -0.07686031815068059, -0.21200198129562925, -0.022751038184510883, -0.1255183017789811, -0.12941523409254205, 0.4386641394282999, 0.256620628675326, 0.24379958631270945, 0.14037438575628058, 0.37092547240175405, 0.06697619528071995, 0.12272558089289734, 0.0508335165083888, 0.20163432095207817, -0.009486301255496338, 0.06715306033312379, -0.17266862868988894, 0.12300818592415874, 0.11525657098970672] |
1,802.00543 | Modeling polypharmacy side effects with graph convolutional networks | The use of drug combinations, termed polypharmacy, is common to treat
patients with complex diseases and co-existing conditions. However, a major
consequence of polypharmacy is a much higher risk of adverse side effects for
the patient. Polypharmacy side effects emerge because of drug-drug
interactions, in which activity of one drug may change if taken with another
drug. The knowledge of drug interactions is limited because these complex
relationships are rare, and are usually not observed in relatively small
clinical testing. Discovering polypharmacy side effects thus remains an
important challenge with significant implications for patient mortality. Here,
we present Decagon, an approach for modeling polypharmacy side effects. The
approach constructs a multimodal graph of protein-protein interactions,
drug-protein target interactions, and the polypharmacy side effects, which are
represented as drug-drug interactions, where each side effect is an edge of a
different type. Decagon is developed specifically to handle such multimodal
graphs with a large number of edge types. Our approach develops a new graph
convolutional neural network for multirelational link prediction in multimodal
networks. Decagon predicts the exact side effect, if any, through which a given
drug combination manifests clinically. Decagon accurately predicts polypharmacy
side effects, outperforming baselines by up to 69%. We find that it
automatically learns representations of side effects indicative of
co-occurrence of polypharmacy in patients. Furthermore, Decagon models
particularly well side effects with a strong molecular basis, while on
predominantly non-molecular side effects, it achieves good performance because
of effective sharing of model parameters across edge types. Decagon creates
opportunities to use large pharmacogenomic and patient data to flag and
prioritize side effects for follow-up analysis.
| cs.LG q-bio.MN stat.ML | the use of drug combinations termed polypharmacy is common to treat patients with complex diseases and coexisting conditions however a major consequence of polypharmacy is a much higher risk of adverse side effects for the patient polypharmacy side effects emerge because of drugdrug interactions in which activity of one drug may change if taken with another drug the knowledge of drug interactions is limited because these complex relationships are rare and are usually not observed in relatively small clinical testing discovering polypharmacy side effects thus remains an important challenge with significant implications for patient mortality here we present decagon an approach for modeling polypharmacy side effects the approach constructs a multimodal graph of proteinprotein interactions drugprotein target interactions and the polypharmacy side effects which are represented as drugdrug interactions where each side effect is an edge of a different type decagon is developed specifically to handle such multimodal graphs with a large number of edge types our approach develops a new graph convolutional neural network for multirelational link prediction in multimodal networks decagon predicts the exact side effect if any through which a given drug combination manifests clinically decagon accurately predicts polypharmacy side effects outperforming baselines by up to 69 we find that it automatically learns representations of side effects indicative of cooccurrence of polypharmacy in patients furthermore decagon models particularly well side effects with a strong molecular basis while on predominantly nonmolecular side effects it achieves good performance because of effective sharing of model parameters across edge types decagon creates opportunities to use large pharmacogenomic and patient data to flag and prioritize side effects for followup analysis | [['the', 'use', 'of', 'drug', 'combinations', 'termed', 'polypharmacy', 'is', 'common', 'to', 'treat', 'patients', 'with', 'complex', 'diseases', 'and', 'coexisting', 'conditions', 'however', 'a', 'major', 'consequence', 'of', 'polypharmacy', 'is', 'a', 'much', 'higher', 'risk', 'of', 'adverse', 'side', 'effects', 'for', 'the', 'patient', 'polypharmacy', 'side', 'effects', 'emerge', 'because', 'of', 'drugdrug', 'interactions', 'in', 'which', 'activity', 'of', 'one', 'drug', 'may', 'change', 'if', 'taken', 'with', 'another', 'drug', 'the', 'knowledge', 'of', 'drug', 'interactions', 'is', 'limited', 'because', 'these', 'complex', 'relationships', 'are', 'rare', 'and', 'are', 'usually', 'not', 'observed', 'in', 'relatively', 'small', 'clinical', 'testing', 'discovering', 'polypharmacy', 'side', 'effects', 'thus', 'remains', 'an', 'important', 'challenge', 'with', 'significant', 'implications', 'for', 'patient', 'mortality', 'here', 'we', 'present', 'decagon', 'an', 'approach', 'for', 'modeling', 'polypharmacy', 'side', 'effects', 'the', 'approach', 'constructs', 'a', 'multimodal', 'graph', 'of', 'proteinprotein', 'interactions', 'drugprotein', 'target', 'interactions', 'and', 'the', 'polypharmacy', 'side', 'effects', 'which', 'are', 'represented', 'as', 'drugdrug', 'interactions', 'where', 'each', 'side', 'effect', 'is', 'an', 'edge', 'of', 'a', 'different', 'type', 'decagon', 'is', 'developed', 'specifically', 'to', 'handle', 'such', 'multimodal', 'graphs', 'with', 'a', 'large', 'number', 'of', 'edge', 'types', 'our', 'approach', 'develops', 'a', 'new', 'graph', 'convolutional', 'neural', 'network', 'for', 'multirelational', 'link', 'prediction', 'in', 'multimodal', 'networks', 'decagon', 'predicts', 'the', 'exact', 'side', 'effect', 'if', 'any', 'through', 'which', 'a', 'given', 'drug', 'combination', 'manifests', 'clinically', 'decagon', 'accurately', 'predicts', 'polypharmacy', 'side', 'effects', 'outperforming', 'baselines', 'by', 'up', 'to', '69', 'we', 'find', 'that', 'it', 'automatically', 'learns', 'representations', 'of', 'side', 'effects', 'indicative', 'of', 'cooccurrence', 'of', 'polypharmacy', 'in', 'patients', 'furthermore', 'decagon', 'models', 'particularly', 'well', 'side', 'effects', 'with', 'a', 'strong', 'molecular', 'basis', 'while', 'on', 'predominantly', 'nonmolecular', 'side', 'effects', 'it', 'achieves', 'good', 'performance', 'because', 'of', 'effective', 'sharing', 'of', 'model', 'parameters', 'across', 'edge', 'types', 'decagon', 'creates', 'opportunities', 'to', 'use', 'large', 'pharmacogenomic', 'and', 'patient', 'data', 'to', 'flag', 'and', 'prioritize', 'side', 'effects', 'for', 'followup', 'analysis']] | [-0.09325259021303527, 0.08746146125632726, -0.05936932747201028, 0.10867164849560819, -0.14519748928758608, -0.2046305466922862, 0.05315996360541113, 0.3714999325309338, -0.2580749929722732, -0.28917265462397196, 0.08627615281299918, -0.31557132976664815, -0.2126411131101855, 0.15870934774414566, -0.08503652384605453, -0.023753142326639325, 0.10719578811871026, 0.03941083144493846, 0.0069084514285187556, -0.2115277043257496, 0.29321626124385775, 0.03810420201625675, 0.29206215242903905, 0.12075479609810108, 0.08885616794056538, 0.02869946330893479, -0.031625775772376234, 0.03298668496687757, -0.05087716597512581, 0.11706922631519638, 0.3248707967409856, 0.12191578292343487, 0.33020654671961, -0.44447610691648476, -0.2542504739196999, 0.10055725728752397, 0.11162130660012559, 0.14546759961018296, -0.044922407930664744, -0.30225237298221674, 0.052269567382772136, -0.17209261647032909, -0.0627313672639638, -0.06457608445015833, 0.022587224377194112, -0.0073720470907899845, -0.3180107660087715, 0.09918461435719014, 0.003353289189077775, 0.09400818547591873, -0.044845314441446855, -0.15303920407661362, -0.026910347902257718, 0.19996325997831196, 0.0730081005043649, 0.033324503015775456, 0.14837775276817464, -0.17533062845329517, -0.11010655938559073, 0.36751452971201165, -0.008958033980183137, -0.187888021212516, 0.20752472180087786, -0.09617202115460619, -0.1461980757572855, 0.12377001260191814, 0.20893331051481812, 0.08475637799233142, -0.15605661750826708, -0.03915742332912432, 0.009009967604999556, 0.18232411148118674, 0.03938840778454193, 0.04631531466429127, 0.21484382523296736, 0.2284259858589842, 0.02430190730391682, 0.11581209379269171, -0.12020989886829074, -0.06326371808831732, -0.2066519882655077, -0.08949958124943425, -0.10249378721302708, 0.0004487452527821766, -0.09124113978732702, -0.1920092440429213, 0.3684111162377243, 0.15295712016357818, 0.18061816538058556, 0.031205981838974734, 0.2934205340840089, 0.004200291573139492, 0.12780056353449934, 0.03993146008518247, 0.1389714082641746, 0.0417563484628935, 0.031653763474192846, -0.20580941138601402, 0.1799470369839596, -0.016916828728697972] |
1,802.00544 | Neutrino-mass differences studied in a model with one basic neutrino | In this paper, we propose and study a model, in which there exists only one
basic neutrino. Basically, the Lagrangian of the model is obtained from the
Lagrangian in the Glashow-Weinberg-Salam electroweak theory by reducing the
three flavor neutrinos there to one basic neutrino. In this model, neutrino
states with a fixed flavor are interpreted as certain superpositions of states
of the basic neutrino and states of the related charged lepton. Neutrino mass
states are associated with low-lying eigenstates of the total Hamiltonian. We
derive an approximate expression for a ratio of neutrino-mass differences,
which gives a value $17$ for the ratio, about half of the experimental result
of $33$.
| hep-ph | in this paper we propose and study a model in which there exists only one basic neutrino basically the lagrangian of the model is obtained from the lagrangian in the glashowweinbergsalam electroweak theory by reducing the three flavor neutrinos there to one basic neutrino in this model neutrino states with a fixed flavor are interpreted as certain superpositions of states of the basic neutrino and states of the related charged lepton neutrino mass states are associated with lowlying eigenstates of the total hamiltonian we derive an approximate expression for a ratio of neutrinomass differences which gives a value 17 for the ratio about half of the experimental result of 33 | [['in', 'this', 'paper', 'we', 'propose', 'and', 'study', 'a', 'model', 'in', 'which', 'there', 'exists', 'only', 'one', 'basic', 'neutrino', 'basically', 'the', 'lagrangian', 'of', 'the', 'model', 'is', 'obtained', 'from', 'the', 'lagrangian', 'in', 'the', 'glashowweinbergsalam', 'electroweak', 'theory', 'by', 'reducing', 'the', 'three', 'flavor', 'neutrinos', 'there', 'to', 'one', 'basic', 'neutrino', 'in', 'this', 'model', 'neutrino', 'states', 'with', 'a', 'fixed', 'flavor', 'are', 'interpreted', 'as', 'certain', 'superpositions', 'of', 'states', 'of', 'the', 'basic', 'neutrino', 'and', 'states', 'of', 'the', 'related', 'charged', 'lepton', 'neutrino', 'mass', 'states', 'are', 'associated', 'with', 'lowlying', 'eigenstates', 'of', 'the', 'total', 'hamiltonian', 'we', 'derive', 'an', 'approximate', 'expression', 'for', 'a', 'ratio', 'of', 'neutrinomass', 'differences', 'which', 'gives', 'a', 'value', '17', 'for', 'the', 'ratio', 'about', 'half', 'of', 'the', 'experimental', 'result', 'of', '33']] | [-0.11490388765550134, 0.23195228473910406, -0.012099865544587373, 0.14088119252648373, 0.02397819606544958, -0.12332829170521688, 0.06893421385691247, 0.27462745544246653, -0.20557428304825656, -0.31371957210993223, 0.03828392789529806, -0.28400123408910904, -0.09075974492794062, 0.13334991249086506, 0.020484491590071808, 0.047462004334242504, 0.05274332423525101, 0.05248126758431847, -0.098353837413544, -0.1853416280228306, 0.3481235627889295, 0.03864803232929923, 0.21518653582104227, 0.07151233688504859, 0.1263091907487251, -0.035401233116334134, -0.03761135021393949, -0.06114933356134729, -0.09243145270527087, 0.11247188194697215, 0.20287523441524669, 0.1417600422928279, 0.14786268959922547, -0.3924819550222971, -0.1499042892489921, 0.14684817912480372, 0.12681655838069592, 0.13180100651992357, -0.05918949750167402, -0.27231369472362776, 0.0690146002876149, -0.1983400532033887, -0.15371641606007788, -0.03719065324826674, -0.03427586016372185, -0.046260986259122464, -0.2659856930205768, 0.09453813686374236, -0.0006735034286975861, 0.01254124337468635, -0.05905667161568999, -0.18190972449003973, -0.018473628023639322, 0.09017879996787417, 0.13875414687949655, -0.002331787354143506, 0.06735148524907841, -0.16156356491317803, -0.12671413211659951, 0.4400233648040078, -0.05620467802086337, -0.19905765938826583, 0.12114375862292945, -0.1314698085612194, -0.13900330522605642, 0.11212607305496931, 0.13443628895011814, 0.08557919983921403, -0.1563608038747175, 0.0981856890689497, -0.15467061230658807, 0.1547175612131303, 0.04301892391152003, 0.039307974964718925, 0.2386537639085542, 0.16461259466595948, 0.10797703779217872, 0.05116003475744616, -0.07939346847600642, -0.0943265407896516, -0.3980391255495223, -0.13234438627577302, -0.12095249652312222, 0.10167481851002032, -0.06873710392101202, -0.1524231855080209, 0.4826713577082211, 0.11641581661533565, 0.23985783058133991, 0.021958975042004815, 0.2498701406420547, 0.147922610625921, 0.04530708448199386, 0.04589998785999011, 0.28326581592078914, 0.17428629975130952, 0.08809139735319398, -0.24422842233484102, 0.0036064388484440065, 0.11305959457108243] |
1,802.00545 | Effective model with strong Kitaev interactions for $\alpha$-${\rm
RuCl_3}$ | We use an exact numerical diagonalization method to calculate the dynamical
spin structure factors (DSFs) of three ab-initio models and one
ab-initio-guided model for a honeycomb-lattice magnet $\alpha$-RuCl$_3$. We
also use thermal pure quantum states to calculate the temperature dependence of
the heat capacity, the nearest-neighbor (NN) spin-spin correlation function,
and the static spin structure factor. From the results obtained from these four
effective models, we find that, even when the magnetic order is stabilized at
low temperature, the intensity at the $\Gamma$ point in the DSFs increases with
increasing NN spin correlation. In addition, we find that the four models fail
to explain heat-capacity measurements whereas two of the four models succeed in
explaining inelastic-neutron-scattering (INS) experiments. In the four models,
when temperature decreases, the heat capacity shows a prominent peak at a high
temperature where the NN spin-spin correlation function increases. However, the
peak temperature in heat capacity is too low in comparison with that observed
experimentally. To address these discrepancies, we propose an effective model
that includes strong ferromagnetic Kitaev coupling, and we show that this model
quantitatively reproduces both INS experiments and heat-capacity measurements.
To further examine the adequacy of the proposed model, we calculate the field
dependence of the polarized terahertz spectra, which reproduces the
experimental results: the spin-gapped excitation survives up to an onset field
where the magnetic order disappears and the response in the high-field region
is almost linear. Based on these numerical results, we argue that the
low-energy magnetic excitation in $\alpha$-RuCl$_3$ is mainly characterized by
interactions such as off-diagonal interactions and weak Heisenberg interactions
between NN pairs, rather than by the strong Kitaev interactions.
| cond-mat.str-el | we use an exact numerical diagonalization method to calculate the dynamical spin structure factors dsfs of three abinitio models and one abinitioguided model for a honeycomblattice magnet alpharucl_3 we also use thermal pure quantum states to calculate the temperature dependence of the heat capacity the nearestneighbor nn spinspin correlation function and the static spin structure factor from the results obtained from these four effective models we find that even when the magnetic order is stabilized at low temperature the intensity at the gamma point in the dsfs increases with increasing nn spin correlation in addition we find that the four models fail to explain heatcapacity measurements whereas two of the four models succeed in explaining inelasticneutronscattering ins experiments in the four models when temperature decreases the heat capacity shows a prominent peak at a high temperature where the nn spinspin correlation function increases however the peak temperature in heat capacity is too low in comparison with that observed experimentally to address these discrepancies we propose an effective model that includes strong ferromagnetic kitaev coupling and we show that this model quantitatively reproduces both ins experiments and heatcapacity measurements to further examine the adequacy of the proposed model we calculate the field dependence of the polarized terahertz spectra which reproduces the experimental results the spingapped excitation survives up to an onset field where the magnetic order disappears and the response in the highfield region is almost linear based on these numerical results we argue that the lowenergy magnetic excitation in alpharucl_3 is mainly characterized by interactions such as offdiagonal interactions and weak heisenberg interactions between nn pairs rather than by the strong kitaev interactions | [['we', 'use', 'an', 'exact', 'numerical', 'diagonalization', 'method', 'to', 'calculate', 'the', 'dynamical', 'spin', 'structure', 'factors', 'dsfs', 'of', 'three', 'abinitio', 'models', 'and', 'one', 'abinitioguided', 'model', 'for', 'a', 'honeycomblattice', 'magnet', 'alpharucl_3', 'we', 'also', 'use', 'thermal', 'pure', 'quantum', 'states', 'to', 'calculate', 'the', 'temperature', 'dependence', 'of', 'the', 'heat', 'capacity', 'the', 'nearestneighbor', 'nn', 'spinspin', 'correlation', 'function', 'and', 'the', 'static', 'spin', 'structure', 'factor', 'from', 'the', 'results', 'obtained', 'from', 'these', 'four', 'effective', 'models', 'we', 'find', 'that', 'even', 'when', 'the', 'magnetic', 'order', 'is', 'stabilized', 'at', 'low', 'temperature', 'the', 'intensity', 'at', 'the', 'gamma', 'point', 'in', 'the', 'dsfs', 'increases', 'with', 'increasing', 'nn', 'spin', 'correlation', 'in', 'addition', 'we', 'find', 'that', 'the', 'four', 'models', 'fail', 'to', 'explain', 'heatcapacity', 'measurements', 'whereas', 'two', 'of', 'the', 'four', 'models', 'succeed', 'in', 'explaining', 'inelasticneutronscattering', 'ins', 'experiments', 'in', 'the', 'four', 'models', 'when', 'temperature', 'decreases', 'the', 'heat', 'capacity', 'shows', 'a', 'prominent', 'peak', 'at', 'a', 'high', 'temperature', 'where', 'the', 'nn', 'spinspin', 'correlation', 'function', 'increases', 'however', 'the', 'peak', 'temperature', 'in', 'heat', 'capacity', 'is', 'too', 'low', 'in', 'comparison', 'with', 'that', 'observed', 'experimentally', 'to', 'address', 'these', 'discrepancies', 'we', 'propose', 'an', 'effective', 'model', 'that', 'includes', 'strong', 'ferromagnetic', 'kitaev', 'coupling', 'and', 'we', 'show', 'that', 'this', 'model', 'quantitatively', 'reproduces', 'both', 'ins', 'experiments', 'and', 'heatcapacity', 'measurements', 'to', 'further', 'examine', 'the', 'adequacy', 'of', 'the', 'proposed', 'model', 'we', 'calculate', 'the', 'field', 'dependence', 'of', 'the', 'polarized', 'terahertz', 'spectra', 'which', 'reproduces', 'the', 'experimental', 'results', 'the', 'spingapped', 'excitation', 'survives', 'up', 'to', 'an', 'onset', 'field', 'where', 'the', 'magnetic', 'order', 'disappears', 'and', 'the', 'response', 'in', 'the', 'highfield', 'region', 'is', 'almost', 'linear', 'based', 'on', 'these', 'numerical', 'results', 'we', 'argue', 'that', 'the', 'lowenergy', 'magnetic', 'excitation', 'in', 'alpharucl_3', 'is', 'mainly', 'characterized', 'by', 'interactions', 'such', 'as', 'offdiagonal', 'interactions', 'and', 'weak', 'heisenberg', 'interactions', 'between', 'nn', 'pairs', 'rather', 'than', 'by', 'the', 'strong', 'kitaev', 'interactions']] | [-0.13879070073188118, 0.16691767184254466, -0.030749556859304635, 0.09143754232782693, -0.01296972545712967, -0.12855724919705502, 0.03892796220572885, 0.39064247829510884, -0.2486463311840506, -0.292471589619869, 0.015804598254737144, -0.3594283383914872, -0.12807889274742645, 0.1816866402480039, 0.10996090896803841, 0.006368212214404005, -0.011835567192653851, 0.037511110406793544, -0.11721530949066886, -0.20503342037965708, 0.2977901489186265, 0.0694394012384959, 0.3008479816798011, 0.12229603112620466, 0.05526178894626141, 0.009372794476161395, 0.06991914573111846, 0.028427154490012017, -0.1338915988427449, 0.03528141993271728, 0.22744391208322454, -0.03378701358793906, 0.1656082582707955, -0.4172217954850673, -0.21653180290783947, 0.06428250210849322, 0.11779115695646718, 0.1436706956142991, -0.038048142982541534, -0.2352656274486114, 0.04645277652247494, -0.18074700632474988, -0.11120719478661639, -0.1363690250162857, -0.018706036210299797, 0.006091155770477866, -0.2864049329332642, 0.11199627725288926, 0.06954484560596672, 0.07257483269495424, -0.10836819650927175, -0.1272009481788914, -0.024841752109590314, 0.09642537316818454, 0.06101662765585763, 0.05670574766768636, 0.11181745081044295, -0.16043003288744812, -0.11683720412260942, 0.318158451721127, -0.1213297482153768, -0.11087024438379825, 0.19017972008527173, -0.1943041387395865, -0.1259297005164947, 0.12561913553936926, 0.1229508591701126, 0.08209276932586149, -0.13069090832579924, 0.06980090491325587, -0.011277992605327573, 0.19835697490046134, -0.010325100168462513, 0.023827295950682396, 0.20655141416115358, 0.16847020936342338, -0.0010595945521559129, 0.15734196848814677, -0.14847346576810677, -0.10149922997259316, -0.24746303582522908, -0.08853499041930156, -0.2005703958463581, 0.030062921333249986, -0.10542239614230364, -0.11680963331052814, 0.3921283383285353, 0.2116131269301738, 0.22277563979493126, 0.02664422512316378, 0.2751032389881884, 0.1267269543283927, 0.07477440303260022, 0.07835795139897742, 0.28877641150029376, 0.16091160519264283, 0.1006684735424214, -0.3154751275142189, 0.052733419649645355, -0.0013308004897279555] |
1,802.00546 | Real Time Collision Detection and Identification for Robotic
Manipulators | The majority of everyday tasks involve interacting with unstructured
environments. This implies that, in order for robots to be truly useful they
must be able to handle contacts. This paper explores how a particle filter can
be used to localize a contact point and estimate the external force. We
demonstrate the capability of the particle filter on a simulated 4DoF planar
robotic arm, and compare it to a well-established analytical approach.
| cs.RO | the majority of everyday tasks involve interacting with unstructured environments this implies that in order for robots to be truly useful they must be able to handle contacts this paper explores how a particle filter can be used to localize a contact point and estimate the external force we demonstrate the capability of the particle filter on a simulated 4dof planar robotic arm and compare it to a wellestablished analytical approach | [['the', 'majority', 'of', 'everyday', 'tasks', 'involve', 'interacting', 'with', 'unstructured', 'environments', 'this', 'implies', 'that', 'in', 'order', 'for', 'robots', 'to', 'be', 'truly', 'useful', 'they', 'must', 'be', 'able', 'to', 'handle', 'contacts', 'this', 'paper', 'explores', 'how', 'a', 'particle', 'filter', 'can', 'be', 'used', 'to', 'localize', 'a', 'contact', 'point', 'and', 'estimate', 'the', 'external', 'force', 'we', 'demonstrate', 'the', 'capability', 'of', 'the', 'particle', 'filter', 'on', 'a', 'simulated', '4dof', 'planar', 'robotic', 'arm', 'and', 'compare', 'it', 'to', 'a', 'wellestablished', 'analytical', 'approach']] | [-0.08230632030352636, 0.07077444155871028, -0.13485847017399863, 0.06683499614288374, -0.12136595231861295, -0.16693880044343606, 0.03254995860887403, 0.44497638038346465, -0.22942515479689332, -0.3625235197619653, 0.07049807824660093, -0.23773180024409798, -0.20199705965072573, 0.19908399124708498, -0.10445369065175174, 0.05626189952689997, 0.09386531063388298, 0.03606808626971824, 0.01620301139429474, -0.2261287319329633, 0.2536843041627025, 0.027920109229687025, 0.22483077840748386, 0.02189692191805848, 0.13486818699035005, 0.024369685707325246, 0.005623954328590296, 0.06490549397930293, -0.07436332339800085, 0.12136484432676939, 0.30712194987375974, 0.06720763007441247, 0.2543632205260891, -0.46183893771868356, -0.18683819180275774, 0.12096243993129949, 0.16938550629928498, 0.10674695112467023, -0.03791890291556139, -0.33295041049869967, 0.08584003423301267, -0.15439124487366684, -0.1647704181090837, -0.09942231235474767, -0.027185646016937747, 0.044954124287190575, -0.2919562689658307, -8.631215601319998e-05, 0.03041626168595312, 0.003999195822422773, -0.015643097106105005, -0.024617582303799793, 0.056681447583709806, 0.19938194349696728, -0.013013613285680473, 0.039673156754284254, 0.23038601822180438, -0.13588209496811032, -0.11884833252529653, 0.4203480038739426, -0.012278833500319488, -0.25887485516165765, 0.28945694592269794, -0.09615095273729309, -0.11219119272050514, 0.1115718125693605, 0.25423889573742176, 0.11996764794621669, -0.19269061358776732, 0.021393412153538263, -0.008240652287011626, 0.1864668722744067, 0.023708389976888265, -0.04486104994573676, 0.2203181933047591, 0.18140446315978614, 0.08427933653370595, 0.15315060744645784, -0.09436337171371659, -0.10155689219524427, -0.2402934044415892, -0.17610511493960945, -0.18674361823835003, 0.011267008574705728, -0.05210313504573259, -0.13473113478017104, 0.3342342599636127, 0.27912809639434577, 0.17764167460075148, 0.05175367905922287, 0.324172025572666, 0.06815868947969776, 0.10848930538435217, 0.06548243439034887, 0.23346310329269354, 0.04199124712654403, 0.10359268240683095, -0.1963028057452134, 0.054829530273629745, -0.006168294448772787] |
1,802.00547 | Double phase transition of the Ising model in core-periphery networks | We study the phase transition of the Ising model in networks with
core-periphery structures. By Monte Carlo simulations, we show that prior to
the order-disorder phase transition the system organizes into an inhomogeneous
intermediate phase in which core nodes are much more ordered than peripheral
nodes. Interestingly, the susceptibility shows double peaks at two distinct
temperatures. We find that, if the connections between core and periphery
increase linearly with network size, the first peak does not exhibit any
size-dependent effect, and the second one diverges in the limit of infinite
network size. Otherwise, if the connections between core and periphery scale
sub-linearly with the network size, both peaks of the susceptibility diverge as
power laws in the thermodynamic limit. This suggests the appearance of a double
transition phenomenon in the Ising model for the latter case. Moreover, we
develop a mean-field theory that agrees well with the simulations.
| cond-mat.stat-mech physics.soc-ph | we study the phase transition of the ising model in networks with coreperiphery structures by monte carlo simulations we show that prior to the orderdisorder phase transition the system organizes into an inhomogeneous intermediate phase in which core nodes are much more ordered than peripheral nodes interestingly the susceptibility shows double peaks at two distinct temperatures we find that if the connections between core and periphery increase linearly with network size the first peak does not exhibit any sizedependent effect and the second one diverges in the limit of infinite network size otherwise if the connections between core and periphery scale sublinearly with the network size both peaks of the susceptibility diverge as power laws in the thermodynamic limit this suggests the appearance of a double transition phenomenon in the ising model for the latter case moreover we develop a meanfield theory that agrees well with the simulations | [['we', 'study', 'the', 'phase', 'transition', 'of', 'the', 'ising', 'model', 'in', 'networks', 'with', 'coreperiphery', 'structures', 'by', 'monte', 'carlo', 'simulations', 'we', 'show', 'that', 'prior', 'to', 'the', 'orderdisorder', 'phase', 'transition', 'the', 'system', 'organizes', 'into', 'an', 'inhomogeneous', 'intermediate', 'phase', 'in', 'which', 'core', 'nodes', 'are', 'much', 'more', 'ordered', 'than', 'peripheral', 'nodes', 'interestingly', 'the', 'susceptibility', 'shows', 'double', 'peaks', 'at', 'two', 'distinct', 'temperatures', 'we', 'find', 'that', 'if', 'the', 'connections', 'between', 'core', 'and', 'periphery', 'increase', 'linearly', 'with', 'network', 'size', 'the', 'first', 'peak', 'does', 'not', 'exhibit', 'any', 'sizedependent', 'effect', 'and', 'the', 'second', 'one', 'diverges', 'in', 'the', 'limit', 'of', 'infinite', 'network', 'size', 'otherwise', 'if', 'the', 'connections', 'between', 'core', 'and', 'periphery', 'scale', 'sublinearly', 'with', 'the', 'network', 'size', 'both', 'peaks', 'of', 'the', 'susceptibility', 'diverge', 'as', 'power', 'laws', 'in', 'the', 'thermodynamic', 'limit', 'this', 'suggests', 'the', 'appearance', 'of', 'a', 'double', 'transition', 'phenomenon', 'in', 'the', 'ising', 'model', 'for', 'the', 'latter', 'case', 'moreover', 'we', 'develop', 'a', 'meanfield', 'theory', 'that', 'agrees', 'well', 'with', 'the', 'simulations']] | [-0.13378859253999828, 0.18879905137804895, -0.0754899485027175, 0.05134383973750487, -0.022460684913361596, -0.12839009952133623, 0.07184146922569394, 0.36755024404516695, -0.2576924417344098, -0.2753798118005884, 0.053618213664457154, -0.31889124472650726, -0.19261880486895255, 0.10785018179779621, 0.05182055624931849, -0.02605383882827654, 0.029220957038420682, 0.05936679075278556, -0.09966220763493078, -0.17561574005270125, 0.32371408989294304, 0.052029112205452074, 0.32279287047709365, 0.04442456411187949, 0.038890772928622225, -0.025621297689016304, 0.07388667081721832, 0.07267818378828894, -0.11606754160188634, 0.02034905755804298, 0.21043754681454016, 0.02853439356811184, 0.2327736814339595, -0.4412738473683193, -0.22476877936718961, 0.12964286031421726, 0.1700474263076054, 0.11540791784598795, 0.0013708486531450526, -0.23862606516057575, 0.07667014475697903, -0.17318333366986466, -0.1315876225196769, -0.030389109802608553, 0.004267667514599256, 0.04034599516307935, -0.2312939648636038, 0.1293176160684812, 0.07478749247447185, 0.041986476576484334, -0.044143071070917556, -0.08902510440817128, -0.05925303917359309, 0.13309609720867277, 0.023472785160757247, 0.027124739027066105, 0.1348022852325812, -0.1339244709894489, -0.11075045696673663, 0.3349925089828871, -0.04034676167823302, -0.10102083506973104, 0.189159377188598, -0.212508356378011, -0.14472782440527618, 0.15825571933434018, 0.13168542898524352, 0.07968091825967201, -0.0654523465467768, 0.025863548657759344, -0.0091329669749767, 0.212080100519784, 0.002144079815873222, 0.008453004669423241, 0.2011460721794818, 0.20412170569918975, 0.05799440897346751, 0.20936932762757549, -0.11086280747769854, -0.1824883405131766, -0.28333802249383283, -0.10760768394401246, -0.1891139762655429, 0.005985478842351743, -0.1500085454975527, -0.21126457955058967, 0.36262199338336754, 0.15967036566576712, 0.26087230095337777, 0.09296572258195689, 0.2571269796399802, 0.1097578115130435, 0.10711306405593515, 0.11814703927312449, 0.23479437999855224, 0.14550320884823245, 0.11464210132426406, -0.23801740723511838, 0.07737594150711556, 0.03683449040997673] |
1,802.00548 | Asymptotic behavior of lifetime sums for random simplicial complex
processes | We study the homological properties of random simplicial complexes. In
particular, we obtain the asymptotic behavior of lifetime sums for a class of
increasing random simplicial complexes; this result is a higher-dimensional
counterpart of Frieze's $\zeta(3)$-limit theorem for the Erd\H{o}s-R\'{e}nyi
graph process. The main results include solutions to questions posed in an
earlier study by Hiraoka and Shirai about the Linial-Meshulam complex process
and the random clique complex process. One of the key elements of the arguments
is a new upper bound on the Betti numbers of general simplicial complexes in
terms of the number of small eigenvalues of Laplacians on links. This bound can
be regarded as a quantitative version of the cohomology vanishing theorem.
| math.PR math.AT math.CO | we study the homological properties of random simplicial complexes in particular we obtain the asymptotic behavior of lifetime sums for a class of increasing random simplicial complexes this result is a higherdimensional counterpart of friezes zeta3limit theorem for the erdhosrenyi graph process the main results include solutions to questions posed in an earlier study by hiraoka and shirai about the linialmeshulam complex process and the random clique complex process one of the key elements of the arguments is a new upper bound on the betti numbers of general simplicial complexes in terms of the number of small eigenvalues of laplacians on links this bound can be regarded as a quantitative version of the cohomology vanishing theorem | [['we', 'study', 'the', 'homological', 'properties', 'of', 'random', 'simplicial', 'complexes', 'in', 'particular', 'we', 'obtain', 'the', 'asymptotic', 'behavior', 'of', 'lifetime', 'sums', 'for', 'a', 'class', 'of', 'increasing', 'random', 'simplicial', 'complexes', 'this', 'result', 'is', 'a', 'higherdimensional', 'counterpart', 'of', 'friezes', 'zeta3limit', 'theorem', 'for', 'the', 'erdhosrenyi', 'graph', 'process', 'the', 'main', 'results', 'include', 'solutions', 'to', 'questions', 'posed', 'in', 'an', 'earlier', 'study', 'by', 'hiraoka', 'and', 'shirai', 'about', 'the', 'linialmeshulam', 'complex', 'process', 'and', 'the', 'random', 'clique', 'complex', 'process', 'one', 'of', 'the', 'key', 'elements', 'of', 'the', 'arguments', 'is', 'a', 'new', 'upper', 'bound', 'on', 'the', 'betti', 'numbers', 'of', 'general', 'simplicial', 'complexes', 'in', 'terms', 'of', 'the', 'number', 'of', 'small', 'eigenvalues', 'of', 'laplacians', 'on', 'links', 'this', 'bound', 'can', 'be', 'regarded', 'as', 'a', 'quantitative', 'version', 'of', 'the', 'cohomology', 'vanishing', 'theorem']] | [-0.16799545776422906, 0.08879949133147222, -0.06976246073761064, 0.10143239091164065, -0.05120174319928755, -0.0715973154520211, 0.05410839370654329, 0.27622959342501735, -0.28410822532909075, -0.2579329410243941, 0.1128825039876139, -0.24864548661786576, -0.186379743286449, 0.17137721932452657, -0.14474506817110208, 0.0005353528115412463, 0.07080249585332754, 0.06776398821005031, 0.025144089090273433, -0.26474110752713625, 0.3836161612492541, 0.005027325848198455, 0.21249631252747192, 0.10842084454615479, 0.04267575656590254, 0.01378444934911702, -0.014920153428354989, 0.005377825786886008, -0.18836372672458707, 0.17448543315834325, 0.2380094231956679, 0.08367703843699849, 0.22557313720817151, -0.39192313704153764, -0.16276550007093213, 0.17674292740614517, 0.11961280995038459, 0.08791094899946905, 0.003162371073647038, -0.28279804394620917, 0.13057076362690523, -0.12858389956147775, -0.19426318442287005, -0.033248494265843996, 0.014978895852666187, 0.06706509729847313, -0.2553519659473196, 0.039821913583285136, 0.14008727758393988, 0.07329401648173149, -0.021673284152664406, -0.12320869882773285, -0.007338844527206991, 0.10459934511505391, -0.011974188050447518, -0.021030723627494727, 0.07588231495743536, -0.13121088044717907, -0.19052523730889612, 0.3512820150703192, -0.0507461771743534, -0.19872655274103518, 0.1303456805565435, -0.14247773667473507, -0.1982958009061606, 0.1225551074380865, 0.13338939373017006, 0.20090745690724124, -0.06516763554157122, 0.1392779744665503, -0.1279922699312801, 0.08236304924863835, 0.09292498963034672, 0.06672833773317625, 0.12008832207597468, 0.14678148426641913, 0.1007249801784106, 0.1976471030689857, 0.014982049321026905, -0.12005941783401954, -0.2756638509342852, -0.21255861173849552, -0.22411836477441957, 0.14665707501420833, -0.20168997411307393, -0.22034717775557353, 0.3843761443605889, 0.08486423398084615, 0.22109755074666085, 0.12313350448789803, 0.2491320355106955, 0.09808030434550069, 0.004203378854562407, 0.0007693574520880761, 0.1079124714774282, 0.28185703500335957, 0.057079034327002974, -0.09334830618260995, 0.05976514008260615, 0.21377558993661533] |
1,802.00549 | Ultra-high Q terahertz whispering-gallery modes in a silicon resonator | We report on the first experimental demonstration of terahertz (THz)
whispering-gallery modes (WGMs) with an ultra high quality (Q) factor of $1.5
\times {10}^{4}$ at 0.62THz. The WGMs are observed in a high resistivity float
zone silicon (HRFZ-Si) spherical resonator coupled to a sub-wavelength silica
waveguide. A detailed analysis of the coherent continuous wave (CW) THz
spectroscopy measurements combined with a numerical model based on
Mie-Debye-Aden-Kerker (MDAK) theory allows to unambiguously identify the
observed higher order radial THz WGMs.
| physics.app-ph physics.optics | we report on the first experimental demonstration of terahertz thz whisperinggallery modes wgms with an ultra high quality q factor of 15 times 104 at 062thz the wgms are observed in a high resistivity float zone silicon hrfzsi spherical resonator coupled to a subwavelength silica waveguide a detailed analysis of the coherent continuous wave cw thz spectroscopy measurements combined with a numerical model based on miedebyeadenkerker mdak theory allows to unambiguously identify the observed higher order radial thz wgms | [['we', 'report', 'on', 'the', 'first', 'experimental', 'demonstration', 'of', 'terahertz', 'thz', 'whisperinggallery', 'modes', 'wgms', 'with', 'an', 'ultra', 'high', 'quality', 'q', 'factor', 'of', '15', 'times', '104', 'at', '062thz', 'the', 'wgms', 'are', 'observed', 'in', 'a', 'high', 'resistivity', 'float', 'zone', 'silicon', 'hrfzsi', 'spherical', 'resonator', 'coupled', 'to', 'a', 'subwavelength', 'silica', 'waveguide', 'a', 'detailed', 'analysis', 'of', 'the', 'coherent', 'continuous', 'wave', 'cw', 'thz', 'spectroscopy', 'measurements', 'combined', 'with', 'a', 'numerical', 'model', 'based', 'on', 'miedebyeadenkerker', 'mdak', 'theory', 'allows', 'to', 'unambiguously', 'identify', 'the', 'observed', 'higher', 'order', 'radial', 'thz', 'wgms']] | [-0.155997126288712, 0.18245388982992153, -0.03412945446868738, -0.11555270989735922, -0.07631398388495048, -0.13705610203867158, 0.0668672554489846, 0.4826476236556967, -0.15493309961011012, -0.2890789360553026, 0.012987269012567897, -0.2948578663451675, -0.0776335600639383, 0.25768341213154294, 0.03515658787684515, 0.11322740474094947, 0.03226398462119202, -0.08617834752115111, -0.024479049394528073, -0.09985260595877965, 0.1955304710380733, 0.07622152154954771, 0.36205200120806696, 0.04169735143582026, 0.11911560758948327, -0.0730607146358428, 0.019448198632647594, -0.08736180946230888, -0.17526486756900947, 0.10473768009493749, 0.27336555647353333, -0.07723565795769294, 0.2668225379660726, -0.4495520273844401, -0.22196880464131633, -0.028714163030187288, 0.12374788707781893, 0.10838395806029438, -0.053158156036709744, -0.28460060358047484, 0.08535517611851295, -0.10872247729760905, -0.14582624187072118, -0.056182485986500975, -0.04734095975756645, -0.028265445853273074, -0.2507242799705515, 0.0553156513782839, -0.02241137863447269, 0.10128660711149375, -0.08320920997687305, -0.041788871921598914, -0.004044238530720274, -0.03018599867199858, -0.05999738899525255, 0.036020450654129184, 0.17622876975219698, -0.07306001256530484, -0.09805420315514009, 0.3668164158115784, -0.1347099466389045, -0.0630450363146762, 0.19391063719056548, -0.2788245032231013, 0.01760920320327083, 0.22535249213377634, 0.20844997063279153, 0.15760712049901485, -0.05878444122771422, -0.022800903882210455, 0.0065280071772091715, 0.3014888750513395, 0.17237328914925457, 0.11202283116678396, 0.22836547420049708, 0.23407100229213634, -0.02397417201815794, 0.13609853616605203, -0.15573504022633036, 0.08657852449143927, -0.28950623917082946, -0.12343468228975932, -0.19246735960245132, 0.0784472147024159, -0.11445658454671502, -0.1511542335152626, 0.4076390529423952, 0.09376032759745916, 0.12823153025160233, -0.03435423557336132, 0.34018534983197846, 0.1281835036088402, 0.08232239405935009, -0.03017855408291022, 0.3541849501306812, 0.20419117155174416, 0.13230102360927656, -0.2586317869275808, -0.10966393283878763, -0.05664899525543054] |
1,802.0055 | The morphological evolution, AGN fractions, dust content, environments,
and downsizing of massive green valley galaxies at 0.5<z<2.5 in
3D-HST/CANDELS | To explore the evolutionary connection among red, green, and blue galaxy
populations, based on a sample of massive ($M_* > 10^{10} M_{\odot} $) galaxies
at 0.5<z<2.5 in five 3D-HST/CANDELS fields, we investigate the dust content,
morphologies, structures, AGN fractions, and environments of these three galaxy
populations. Green valley galaxies are found to have intermediate dust
attenuation, and reside in the middle of the regions occupied by quiescent and
star-forming galaxies in the UVJ diagram. Compared with blue and red galaxy
populations at z<2, green galaxies have intermediate compactness and
morphological parameters such as Sersic index, concentration, Gini coefficient,
and the second order moment of the 20% brightest pixels of a galaxy. Above
findings seem to favor the scenario that green galaxies are at transitional
phase when star-forming galaxies are being quenched into quiescent status. The
green galaxies at z<2 show the highest AGN fraction, suggesting that AGN
feedback may have played an important role in star formation quenching. For the
massive galaxies at 2<z<2.5, both red and green galaxies are found to have a
similarly higher AGN fraction than the blue ones, which implies that AGN
feedback may help to keep quiescence of red galaxies at z>2. A significant
environmental difference is found between green and red galaxies at z<1.5.
Green and blue galaxies at z>0.5 seem to have similar local density
distributions, suggesting that environment quenching is not the major mechanism
to cease star formation at z>0.5. The fractions of three populations as
functions of mass support a "downsizing" quenching picture that the bulk of
star formation in more massive galaxies is completed earlier than that of lower
mass galaxies.
| astro-ph.GA | to explore the evolutionary connection among red green and blue galaxy populations based on a sample of massive m_ 1010 m_odot galaxies at 05z25 in five 3dhstcandels fields we investigate the dust content morphologies structures agn fractions and environments of these three galaxy populations green valley galaxies are found to have intermediate dust attenuation and reside in the middle of the regions occupied by quiescent and starforming galaxies in the uvj diagram compared with blue and red galaxy populations at z2 green galaxies have intermediate compactness and morphological parameters such as sersic index concentration gini coefficient and the second order moment of the 20 brightest pixels of a galaxy above findings seem to favor the scenario that green galaxies are at transitional phase when starforming galaxies are being quenched into quiescent status the green galaxies at z2 show the highest agn fraction suggesting that agn feedback may have played an important role in star formation quenching for the massive galaxies at 2z25 both red and green galaxies are found to have a similarly higher agn fraction than the blue ones which implies that agn feedback may help to keep quiescence of red galaxies at z2 a significant environmental difference is found between green and red galaxies at z15 green and blue galaxies at z05 seem to have similar local density distributions suggesting that environment quenching is not the major mechanism to cease star formation at z05 the fractions of three populations as functions of mass support a downsizing quenching picture that the bulk of star formation in more massive galaxies is completed earlier than that of lower mass galaxies | [['to', 'explore', 'the', 'evolutionary', 'connection', 'among', 'red', 'green', 'and', 'blue', 'galaxy', 'populations', 'based', 'on', 'a', 'sample', 'of', 'massive', 'm_', '1010', 'm_odot', 'galaxies', 'at', '05z25', 'in', 'five', '3dhstcandels', 'fields', 'we', 'investigate', 'the', 'dust', 'content', 'morphologies', 'structures', 'agn', 'fractions', 'and', 'environments', 'of', 'these', 'three', 'galaxy', 'populations', 'green', 'valley', 'galaxies', 'are', 'found', 'to', 'have', 'intermediate', 'dust', 'attenuation', 'and', 'reside', 'in', 'the', 'middle', 'of', 'the', 'regions', 'occupied', 'by', 'quiescent', 'and', 'starforming', 'galaxies', 'in', 'the', 'uvj', 'diagram', 'compared', 'with', 'blue', 'and', 'red', 'galaxy', 'populations', 'at', 'z2', 'green', 'galaxies', 'have', 'intermediate', 'compactness', 'and', 'morphological', 'parameters', 'such', 'as', 'sersic', 'index', 'concentration', 'gini', 'coefficient', 'and', 'the', 'second', 'order', 'moment', 'of', 'the', '20', 'brightest', 'pixels', 'of', 'a', 'galaxy', 'above', 'findings', 'seem', 'to', 'favor', 'the', 'scenario', 'that', 'green', 'galaxies', 'are', 'at', 'transitional', 'phase', 'when', 'starforming', 'galaxies', 'are', 'being', 'quenched', 'into', 'quiescent', 'status', 'the', 'green', 'galaxies', 'at', 'z2', 'show', 'the', 'highest', 'agn', 'fraction', 'suggesting', 'that', 'agn', 'feedback', 'may', 'have', 'played', 'an', 'important', 'role', 'in', 'star', 'formation', 'quenching', 'for', 'the', 'massive', 'galaxies', 'at', '2z25', 'both', 'red', 'and', 'green', 'galaxies', 'are', 'found', 'to', 'have', 'a', 'similarly', 'higher', 'agn', 'fraction', 'than', 'the', 'blue', 'ones', 'which', 'implies', 'that', 'agn', 'feedback', 'may', 'help', 'to', 'keep', 'quiescence', 'of', 'red', 'galaxies', 'at', 'z2', 'a', 'significant', 'environmental', 'difference', 'is', 'found', 'between', 'green', 'and', 'red', 'galaxies', 'at', 'z15', 'green', 'and', 'blue', 'galaxies', 'at', 'z05', 'seem', 'to', 'have', 'similar', 'local', 'density', 'distributions', 'suggesting', 'that', 'environment', 'quenching', 'is', 'not', 'the', 'major', 'mechanism', 'to', 'cease', 'star', 'formation', 'at', 'z05', 'the', 'fractions', 'of', 'three', 'populations', 'as', 'functions', 'of', 'mass', 'support', 'a', 'downsizing', 'quenching', 'picture', 'that', 'the', 'bulk', 'of', 'star', 'formation', 'in', 'more', 'massive', 'galaxies', 'is', 'completed', 'earlier', 'than', 'that', 'of', 'lower', 'mass', 'galaxies']] | [-0.0573806604904769, 0.13484953920954862, -0.09155567431059639, 0.1497990237018997, -0.06928537792957096, -0.02670160586139493, 0.050345128499416275, 0.49628823119521476, -0.0077454026878825315, -0.32608677367262767, 0.01974227785179739, -0.2998378554136673, -0.04460465083413048, 0.14537697285239987, -0.01505426134142691, -0.1169135678653369, -0.019227851306456628, -0.13502514303171895, -0.0024480077580534922, -0.34354604732022803, 0.3274226709427103, 0.02264099637977779, 0.189114293472758, -0.09730470655034226, 0.03465053126904002, -0.14330540687964757, -0.09381833589143196, -0.04595811748199526, -0.13720268388481857, -0.03162856204365728, 0.28280359346926937, 0.08638072475346166, 0.2925973421661183, -0.32787154529772244, -0.18238713517967514, 0.10920337011990722, 0.2577084124048324, 0.029198671252824673, -0.14727764448860994, -0.22094076965699222, 0.09213550532333997, -0.16847463894232328, -0.16979137739375558, 0.11647147158379736, 0.03777264794308706, 0.03202065205590119, -0.18848638708612866, 0.21506910270024368, -0.00039008239748081496, 0.07448447712544184, -0.08706352579817454, -0.11322448477183761, -0.17490374501586073, 0.10461568499886198, -0.014316788755979306, 0.10392708227354616, 0.2639649792134748, -0.20155367966734372, 0.000891454895322364, 0.39859930616664463, 0.0012047509044893572, 0.06463181513879421, 0.29084973314120227, -0.2651010811947453, -0.22352495243939668, 0.11401133032501745, 0.15824708611480265, 0.07939034486779163, -0.14206888152351785, -0.049102440105017915, 0.02010934061758262, 0.20490905323887676, 0.03423528134155629, 0.10847446072300194, 0.35684401525441667, 0.07108387975248077, 0.06073880866569564, 0.08476679917657748, -0.13155410014728863, -0.03792378860317282, -0.177318048638243, -0.07928794741095391, -0.12413013910739196, 0.11443842069769092, -0.17019401009682367, -0.06966240691114912, 0.32933120249158965, 0.02753855942213324, 0.25546513708419544, 0.14015864234099706, 0.2849214588041737, 0.08418364414194626, 0.18450792515155193, 0.10815475163494807, 0.28995756458477184, 0.19049975449486928, 0.06036205773690104, -0.26917497299356585, 0.06481665714883676, 0.01684645679225509] |
1,802.00551 | Analysis of stationary points and their bifurcations in the ABC flow | Analytical expressions for coordinates of stationary points and conditions
for their existence in the ABC flow are received. The type of the stationary
points is shown analytically to be saddle-node. Exact expressions for
eigenvalues and eigenvectors of the stability matrix are given. Behavior of the
stationary points along the bifurcation lines is described.
| physics.flu-dyn | analytical expressions for coordinates of stationary points and conditions for their existence in the abc flow are received the type of the stationary points is shown analytically to be saddlenode exact expressions for eigenvalues and eigenvectors of the stability matrix are given behavior of the stationary points along the bifurcation lines is described | [['analytical', 'expressions', 'for', 'coordinates', 'of', 'stationary', 'points', 'and', 'conditions', 'for', 'their', 'existence', 'in', 'the', 'abc', 'flow', 'are', 'received', 'the', 'type', 'of', 'the', 'stationary', 'points', 'is', 'shown', 'analytically', 'to', 'be', 'saddlenode', 'exact', 'expressions', 'for', 'eigenvalues', 'and', 'eigenvectors', 'of', 'the', 'stability', 'matrix', 'are', 'given', 'behavior', 'of', 'the', 'stationary', 'points', 'along', 'the', 'bifurcation', 'lines', 'is', 'described']] | [-0.22532286266313056, 0.04827161715805249, -0.08135386078425173, 0.06067033065043671, -0.02711501787416637, -0.13596664887483953, 0.05701233499314425, 0.3292902510191472, -0.22266132451312723, -0.16879594528098713, 0.14087815664242953, -0.3056758849262172, -0.18125497367022173, 0.1782754877547048, -0.013310881683005477, 0.11877720195026893, 0.05767828027963779, 0.08547047657435233, -0.07944653869413261, -0.1808881988169028, 0.30455472854510796, -0.005082524223428852, 0.2891557714594352, -0.002171637859406336, 0.06555741584315053, -0.05596358645355926, 0.03750762661242471, 0.013595534066827793, -0.15568826219312987, 0.05170286586508155, 0.2611340751502452, 0.1171934207668528, 0.18316069710999727, -0.4027245926828879, -0.15871221512415498, 0.12387956100744459, 0.21835978968806988, 0.1270453253198626, 0.003578313187045871, -0.30809786223437424, 0.15232605708516994, -0.05982474266894092, -0.254363468303433, -0.095351641861511, 0.07863305172584248, 0.127420949951728, -0.3131972272300495, 0.09702326546264987, 0.03353752327626044, 0.11593394571880125, -0.10999202476990111, -0.1010302565640436, -0.08893133930088777, 0.17548653341056603, 0.08064016618320821, -0.11610076674875223, 0.07433908618986607, -0.10344591174485548, -0.07036744367401555, 0.3359239281172741, 0.02562857621331822, -0.30324137721755456, 0.13181215044954475, -0.12095635419465461, -0.06300681181041137, 0.1985165149957504, 0.14344964773868615, 0.12907553745328254, -0.1524591777772414, 0.11384788911829742, -0.01446347029985122, 0.03148583881556988, 0.12635723914388777, -0.03285319857598054, 0.20111369675482219, 0.025207102017582587, 0.0971158289456002, 0.1445347363302783, -0.05000891462671307, -0.20589552677394646, -0.34229338105838253, -0.11395796930268055, -0.21568794541482655, 0.04514792257972624, -0.14665616118241506, -0.2441866692382939, 0.455007422363983, 0.07358416486180054, 0.23483172623124324, 0.05322030081220393, 0.2319709560921732, 0.2548792302467913, -0.0813148564369119, 0.1277539658729198, 0.23777620731589366, 0.1700255759236104, 0.07615736149743481, -0.19919570025829775, 0.06992055512613284, 0.16354020979290582] |
1,802.00552 | Best Practices for a Future Open Code Policy: Experiences and Vision of
the Astrophysics Source Code Library | We are members of the Astrophysics Source Code Library's Advisory Committee
and its editor-in-chief. The Astrophysics Source Code Library (ASCL, ascl.net)
is a successful initiative that advocates for open research software and
provides an infrastructure for registering, discovering, sharing, and citing
this software. Started in 1999, the ASCL has been expanding in recent years,
with an average of over 200 codes added each year, and now houses over 1,600
code entries.
| astro-ph.IM cs.DL | we are members of the astrophysics source code librarys advisory committee and its editorinchief the astrophysics source code library ascl asclnet is a successful initiative that advocates for open research software and provides an infrastructure for registering discovering sharing and citing this software started in 1999 the ascl has been expanding in recent years with an average of over 200 codes added each year and now houses over 1600 code entries | [['we', 'are', 'members', 'of', 'the', 'astrophysics', 'source', 'code', 'librarys', 'advisory', 'committee', 'and', 'its', 'editorinchief', 'the', 'astrophysics', 'source', 'code', 'library', 'ascl', 'asclnet', 'is', 'a', 'successful', 'initiative', 'that', 'advocates', 'for', 'open', 'research', 'software', 'and', 'provides', 'an', 'infrastructure', 'for', 'registering', 'discovering', 'sharing', 'and', 'citing', 'this', 'software', 'started', 'in', '1999', 'the', 'ascl', 'has', 'been', 'expanding', 'in', 'recent', 'years', 'with', 'an', 'average', 'of', 'over', '200', 'codes', 'added', 'each', 'year', 'and', 'now', 'houses', 'over', '1600', 'code', 'entries']] | [-0.07957478025665796, 0.052124299484872405, -0.05420317981493804, 0.025639839708136106, -0.09768700178607669, -0.1765855064248325, 0.0010574248907956438, 0.418603598074594, -0.22307547745885145, -0.3709725635650922, 0.13899897445898346, -0.3268884497130631, -0.018904754767378032, 0.25609658800170454, -0.09607754515247866, 0.044356191621824415, 0.14808999625047747, 0.006279107996485602, -0.0035697196505334178, -0.3591528116974612, 0.23851382317887226, 0.23390792269574504, 0.23325403414102613, 0.06610049788748294, 0.07680744768290872, -0.002865858264529789, -0.17357953531588888, -0.10176486031375301, -0.10096705812867812, 0.1362266084703971, 0.3409153613406168, 0.3431128780783849, 0.38780958530768544, -0.32788684931386947, -0.18828364042565227, 0.014002215248490782, 0.10945499113196848, 0.07978598029343706, -0.10226067917054178, -0.2724763464812242, 0.04825031743581656, -0.31513447277772594, -0.12226189430278371, 0.04189272893717329, 0.10118392978886694, -0.01182927599202999, -0.16378658752835973, -0.09077117875428267, -0.06027654439053485, 0.19737332042726413, -0.050189515321620436, -0.1710668622948964, 0.02746141063128139, 0.2119123931698711, 0.019540996562925652, 0.13856290263110693, 0.06522737465746387, -0.0955725438846931, -0.12022428126664648, 0.36069539147363583, -0.005472646862215979, -0.02681487751468806, 0.15335394145632295, -0.04701408346406591, -0.17287146678509216, 0.09840509943454198, 0.22361904381393966, 0.03041266517477556, -0.21943021334812673, 0.13161678360709528, -0.05752699587389197, 0.2014971824910518, 0.060876826185103455, -0.023731889908241346, 0.24834595237609366, 0.17226465708169508, -0.025060697681677173, 0.1150953856642804, -0.06389570967491034, -0.07527613626714323, -0.22438852452922245, -0.15173058333137715, -0.10779915186970061, 0.010186053359959747, 0.010830722723818633, -0.16127187756060715, 0.4401624217157213, 0.13982093852799563, -0.0018900669061801803, -0.044427554614999344, 0.27141170702140094, -0.08861387510534743, 0.1687571862384572, 0.25200262861851025, 0.13178440630698288, 0.042700674332363506, 0.17905803880995322, -0.07073443920128572, 0.07633291256555001, -0.004504591961142043] |
1,802.00553 | Correlated Insulator Behaviour at Half-Filling in Magic Angle Graphene
Superlattices | Van der Waals (vdW) heterostructures are an emergent class of metamaterials
comprised of vertically stacked two-dimensional (2D) building blocks, which
provide us with a vast tool set to engineer their properties on top of the
already rich tunability of 2D materials. One of the knobs, the twist angle
between different layers, plays a crucial role in the ultimate electronic
properties of a vdW heterostructure and does not have a direct analog in other
systems such as MBE-grown semiconductor heterostructures. For small twist
angles, the moir\'e pattern produced by the lattice misorientation creates a
long-range modulation. So far, the study of the effect of twist angles in vdW
heterostructures has been mostly concentrated in graphene/hexagonal boron
nitride (h-BN) twisted structures, which exhibit relatively weak interlayer
interaction due to the presence of a large bandgap in h-BN. Here we show that
when two graphene sheets are twisted by an angle close to the theoretically
predicted 'magic angle', the resulting flat band structure near charge
neutrality gives rise to a strongly-correlated electronic system. These flat
bands exhibit half-filling insulating phases at zero magnetic field, which we
show to be a Mott-like insulator arising from electrons localized in the
moir\'e superlattice. These unique properties of magic-angle twisted bilayer
graphene (TwBLG) open up a new playground for exotic many-body quantum phases
in a 2D platform made of pure carbon and without magnetic field. The easy
accessibility of the flat bands, the electrical tunability, and the bandwidth
tunability though twist angle may pave the way towards more exotic correlated
systems, such as unconventional superconductors or quantum spin liquids.
| cond-mat.mes-hall cond-mat.str-el | van der waals vdw heterostructures are an emergent class of metamaterials comprised of vertically stacked twodimensional 2d building blocks which provide us with a vast tool set to engineer their properties on top of the already rich tunability of 2d materials one of the knobs the twist angle between different layers plays a crucial role in the ultimate electronic properties of a vdw heterostructure and does not have a direct analog in other systems such as mbegrown semiconductor heterostructures for small twist angles the moire pattern produced by the lattice misorientation creates a longrange modulation so far the study of the effect of twist angles in vdw heterostructures has been mostly concentrated in graphenehexagonal boron nitride hbn twisted structures which exhibit relatively weak interlayer interaction due to the presence of a large bandgap in hbn here we show that when two graphene sheets are twisted by an angle close to the theoretically predicted magic angle the resulting flat band structure near charge neutrality gives rise to a stronglycorrelated electronic system these flat bands exhibit halffilling insulating phases at zero magnetic field which we show to be a mottlike insulator arising from electrons localized in the moire superlattice these unique properties of magicangle twisted bilayer graphene twblg open up a new playground for exotic manybody quantum phases in a 2d platform made of pure carbon and without magnetic field the easy accessibility of the flat bands the electrical tunability and the bandwidth tunability though twist angle may pave the way towards more exotic correlated systems such as unconventional superconductors or quantum spin liquids | [['van', 'der', 'waals', 'vdw', 'heterostructures', 'are', 'an', 'emergent', 'class', 'of', 'metamaterials', 'comprised', 'of', 'vertically', 'stacked', 'twodimensional', '2d', 'building', 'blocks', 'which', 'provide', 'us', 'with', 'a', 'vast', 'tool', 'set', 'to', 'engineer', 'their', 'properties', 'on', 'top', 'of', 'the', 'already', 'rich', 'tunability', 'of', '2d', 'materials', 'one', 'of', 'the', 'knobs', 'the', 'twist', 'angle', 'between', 'different', 'layers', 'plays', 'a', 'crucial', 'role', 'in', 'the', 'ultimate', 'electronic', 'properties', 'of', 'a', 'vdw', 'heterostructure', 'and', 'does', 'not', 'have', 'a', 'direct', 'analog', 'in', 'other', 'systems', 'such', 'as', 'mbegrown', 'semiconductor', 'heterostructures', 'for', 'small', 'twist', 'angles', 'the', 'moire', 'pattern', 'produced', 'by', 'the', 'lattice', 'misorientation', 'creates', 'a', 'longrange', 'modulation', 'so', 'far', 'the', 'study', 'of', 'the', 'effect', 'of', 'twist', 'angles', 'in', 'vdw', 'heterostructures', 'has', 'been', 'mostly', 'concentrated', 'in', 'graphenehexagonal', 'boron', 'nitride', 'hbn', 'twisted', 'structures', 'which', 'exhibit', 'relatively', 'weak', 'interlayer', 'interaction', 'due', 'to', 'the', 'presence', 'of', 'a', 'large', 'bandgap', 'in', 'hbn', 'here', 'we', 'show', 'that', 'when', 'two', 'graphene', 'sheets', 'are', 'twisted', 'by', 'an', 'angle', 'close', 'to', 'the', 'theoretically', 'predicted', 'magic', 'angle', 'the', 'resulting', 'flat', 'band', 'structure', 'near', 'charge', 'neutrality', 'gives', 'rise', 'to', 'a', 'stronglycorrelated', 'electronic', 'system', 'these', 'flat', 'bands', 'exhibit', 'halffilling', 'insulating', 'phases', 'at', 'zero', 'magnetic', 'field', 'which', 'we', 'show', 'to', 'be', 'a', 'mottlike', 'insulator', 'arising', 'from', 'electrons', 'localized', 'in', 'the', 'moire', 'superlattice', 'these', 'unique', 'properties', 'of', 'magicangle', 'twisted', 'bilayer', 'graphene', 'twblg', 'open', 'up', 'a', 'new', 'playground', 'for', 'exotic', 'manybody', 'quantum', 'phases', 'in', 'a', '2d', 'platform', 'made', 'of', 'pure', 'carbon', 'and', 'without', 'magnetic', 'field', 'the', 'easy', 'accessibility', 'of', 'the', 'flat', 'bands', 'the', 'electrical', 'tunability', 'and', 'the', 'bandwidth', 'tunability', 'though', 'twist', 'angle', 'may', 'pave', 'the', 'way', 'towards', 'more', 'exotic', 'correlated', 'systems', 'such', 'as', 'unconventional', 'superconductors', 'or', 'quantum', 'spin', 'liquids']] | [-0.20764002839648982, 0.19273464866828988, -0.03421237044354531, 0.021782732329852096, -0.04129207443858262, -0.1974211176572979, 0.06410118745806989, 0.4351110081446094, -0.2877288416991337, -0.30328087914665763, -0.04774270879654818, -0.2889945934338225, -0.19094622454460256, 0.21066881028334575, 0.04327793196085719, 0.046535542918163, -0.006307449454854008, -0.14180914717466475, -0.09724754288007029, -0.1702575343269997, 0.2890529008546688, 0.015658139697283167, 0.3346428986343747, 0.10100442251787727, 0.01187042725620834, 0.0005982746379023403, 0.15029548330388906, 0.02666538310919725, -0.15834564146935565, 0.11356505288436781, 0.23861037759320947, -0.19506493503755365, 0.20167746961322627, -0.48307699300633133, -0.1897775487910302, -0.013463484756079794, 0.13018046153215193, 0.1571452648095424, -0.09616510007817712, -0.28640503804234946, 0.05544207823811142, -0.17315041055753544, -0.1575576150363297, -0.09221428300996973, -0.0050702453333216204, -0.013012447673471943, -0.18548899402669525, 0.05345238608535635, 0.048448929114610254, 0.08436959335235665, -0.051664527627383536, -0.11974350735322992, -0.10812705404832533, 0.10170377927127149, 0.013285794936987848, 0.030028682003928105, 0.17437851273468943, -0.1703931210653231, -0.10996437874508894, 0.39798461389550155, -0.005264318073817124, -0.1140781349043952, 0.19644501938960934, -0.16053310403245313, -0.06690104328316303, 0.1513691811594856, 0.12066054018747545, 0.04987539844729632, -0.10738542289074328, 0.10309015083564836, -0.049968094758703625, 0.17193637647841994, 0.08980790150657524, 0.1463660950264147, 0.3548743423849401, 0.17396789128920562, 0.08475941520753914, 0.13781639306520765, -0.09478575035242963, -0.029792240769282437, -0.18246714139840645, -0.20186334411357706, -0.2074641071140894, 0.11731115976782411, -0.060277015357516006, -0.2961238673390494, 0.4238655164087803, 0.10336570632830618, 0.1611270079719611, -0.0920192679476512, 0.21448536590541506, 0.04583200955864989, 0.12519050320034547, -0.013979107317450733, 0.2898111044836252, 0.16206233347108487, 0.09888056623758322, -0.1913671622822374, 0.032045495745686825, 0.011279357239404713] |
1,802.00554 | Generating Redundant Features with Unsupervised Multi-Tree Genetic
Programming | Recently, feature selection has become an increasingly important area of
research due to the surge in high-dimensional datasets in all areas of modern
life. A plethora of feature selection algorithms have been proposed, but it is
difficult to truly analyse the quality of a given algorithm. Ideally, an
algorithm would be evaluated by measuring how well it removes known bad
features. Acquiring datasets with such features is inherently difficult, and so
a common technique is to add synthetic bad features to an existing dataset.
While adding noisy features is an easy task, it is very difficult to
automatically add complex, redundant features. This work proposes one of the
first approaches to generating redundant features, using a novel genetic
programming approach. Initial experiments show that our proposed method can
automatically create difficult, redundant features which have the potential to
be used for creating high-quality feature selection benchmark datasets.
| cs.NE cs.AI | recently feature selection has become an increasingly important area of research due to the surge in highdimensional datasets in all areas of modern life a plethora of feature selection algorithms have been proposed but it is difficult to truly analyse the quality of a given algorithm ideally an algorithm would be evaluated by measuring how well it removes known bad features acquiring datasets with such features is inherently difficult and so a common technique is to add synthetic bad features to an existing dataset while adding noisy features is an easy task it is very difficult to automatically add complex redundant features this work proposes one of the first approaches to generating redundant features using a novel genetic programming approach initial experiments show that our proposed method can automatically create difficult redundant features which have the potential to be used for creating highquality feature selection benchmark datasets | [['recently', 'feature', 'selection', 'has', 'become', 'an', 'increasingly', 'important', 'area', 'of', 'research', 'due', 'to', 'the', 'surge', 'in', 'highdimensional', 'datasets', 'in', 'all', 'areas', 'of', 'modern', 'life', 'a', 'plethora', 'of', 'feature', 'selection', 'algorithms', 'have', 'been', 'proposed', 'but', 'it', 'is', 'difficult', 'to', 'truly', 'analyse', 'the', 'quality', 'of', 'a', 'given', 'algorithm', 'ideally', 'an', 'algorithm', 'would', 'be', 'evaluated', 'by', 'measuring', 'how', 'well', 'it', 'removes', 'known', 'bad', 'features', 'acquiring', 'datasets', 'with', 'such', 'features', 'is', 'inherently', 'difficult', 'and', 'so', 'a', 'common', 'technique', 'is', 'to', 'add', 'synthetic', 'bad', 'features', 'to', 'an', 'existing', 'dataset', 'while', 'adding', 'noisy', 'features', 'is', 'an', 'easy', 'task', 'it', 'is', 'very', 'difficult', 'to', 'automatically', 'add', 'complex', 'redundant', 'features', 'this', 'work', 'proposes', 'one', 'of', 'the', 'first', 'approaches', 'to', 'generating', 'redundant', 'features', 'using', 'a', 'novel', 'genetic', 'programming', 'approach', 'initial', 'experiments', 'show', 'that', 'our', 'proposed', 'method', 'can', 'automatically', 'create', 'difficult', 'redundant', 'features', 'which', 'have', 'the', 'potential', 'to', 'be', 'used', 'for', 'creating', 'highquality', 'feature', 'selection', 'benchmark', 'datasets']] | [-0.0396202557330609, 0.005908040886152485, -0.12083959322403737, 0.0769544588021782, -0.1666840681185325, -0.2138042805881119, 0.007613143712586286, 0.4259968837152939, -0.29023293914197357, -0.3709623386012707, 0.11426518728392718, -0.2732775466244186, -0.2208766818084583, 0.21815633870262122, -0.1212102353579181, 0.10693902128255692, 0.11492065721520914, 0.006242126897991109, 0.014017781516739807, -0.3042250859462434, 0.27463181269969666, 0.09239511561839758, 0.3435202401739602, 0.020520657711174516, 0.10580904514676905, -0.05842148602566346, -0.06674762343873783, 0.031072716279348142, 0.002345707080377263, 0.15920405080193514, 0.34512099308646, 0.2202078979034737, 0.3436219806554822, -0.38922806658154846, -0.21929163400869386, 0.1115770860500697, 0.15060070300867565, 0.16448252384131537, -0.0675065275693477, -0.29697381018274494, 0.08226031449553715, -0.11197809132230215, -0.05699842399125602, -0.2162450654305467, 0.02984387233384511, -0.06733663785342621, -0.2995075277008471, 0.0012423329128167864, 0.023928432422056542, 0.03568716385864279, 0.0033081658770564666, -0.10623568244797944, 0.026198865828376744, 0.16591631957538883, 0.061866486620088264, 0.057877876450542085, 0.11152882871477782, -0.14176820400551113, -0.11765105257342968, 0.3955928768303727, -0.015006504908558867, -0.21449750516132837, 0.25340183440367786, 0.0015482699156415705, -0.1661477246492797, 0.1566349583215454, 0.1804389853195167, 0.13693790300590855, -0.19318591535636256, 0.01054674643527425, -0.02479992825601275, 0.20278461057325306, 0.025874065385725932, 0.026391791392016372, 0.21653449448573142, 0.22732957596985662, 0.04693013777145419, 0.15393543798242043, -0.12080198664021786, -0.03416824609129911, -0.17920903277070244, -0.10287915271561161, -0.20337452220359856, -0.029921413036570154, -0.04741869880142701, -0.1955104202196813, 0.3812966535887903, 0.26011970904053877, 0.23374474967582798, -0.011083469164659123, 0.3631925006792247, 0.0502173831345051, 0.18308744069226845, 0.07411267786709667, 0.1722027858525996, 0.0020791993549309014, 0.10097727328253796, -0.1541751104210611, 0.11057620670893514, -0.0016892546768851426] |
1,802.00555 | On the Predictive Risk in Misspecified Quantile Regression | In the present paper we investigate the predictive risk of possibly
misspecified quantile regression functions. The in-sample risk is well-known to
be an overly optimistic estimate of the predictive risk and we provide two
relatively simple (asymptotic) characterizations of the associated bias, also
called expected optimism. We propose estimates for the expected optimism and
the predictive risk, and establish their uniform consistency under mild
conditions. Our results hold for models of moderately growing size and allow
the quantile function to be incorrectly specified. Empirical evidence from our
estimates is encouraging as it compares favorably with cross-validation.
| math.ST stat.TH | in the present paper we investigate the predictive risk of possibly misspecified quantile regression functions the insample risk is wellknown to be an overly optimistic estimate of the predictive risk and we provide two relatively simple asymptotic characterizations of the associated bias also called expected optimism we propose estimates for the expected optimism and the predictive risk and establish their uniform consistency under mild conditions our results hold for models of moderately growing size and allow the quantile function to be incorrectly specified empirical evidence from our estimates is encouraging as it compares favorably with crossvalidation | [['in', 'the', 'present', 'paper', 'we', 'investigate', 'the', 'predictive', 'risk', 'of', 'possibly', 'misspecified', 'quantile', 'regression', 'functions', 'the', 'insample', 'risk', 'is', 'wellknown', 'to', 'be', 'an', 'overly', 'optimistic', 'estimate', 'of', 'the', 'predictive', 'risk', 'and', 'we', 'provide', 'two', 'relatively', 'simple', 'asymptotic', 'characterizations', 'of', 'the', 'associated', 'bias', 'also', 'called', 'expected', 'optimism', 'we', 'propose', 'estimates', 'for', 'the', 'expected', 'optimism', 'and', 'the', 'predictive', 'risk', 'and', 'establish', 'their', 'uniform', 'consistency', 'under', 'mild', 'conditions', 'our', 'results', 'hold', 'for', 'models', 'of', 'moderately', 'growing', 'size', 'and', 'allow', 'the', 'quantile', 'function', 'to', 'be', 'incorrectly', 'specified', 'empirical', 'evidence', 'from', 'our', 'estimates', 'is', 'encouraging', 'as', 'it', 'compares', 'favorably', 'with', 'crossvalidation']] | [-0.007239773656086375, -0.005866524597119375, -0.11766584809326257, 0.2031052225623474, -0.08581384379795054, -0.1547629473886142, 0.10357152821840525, 0.4294106630377428, -0.20812566457122253, -0.2751501333865842, 0.17303661362878606, -0.24850846935805748, -0.145096793274206, 0.20982086151101006, -0.21005759855809933, 0.08968917425590917, 0.05165888015320282, 0.010342434741384446, -0.0508249542908743, -0.30204649091077346, 0.28206178829956724, 0.10227413501706906, 0.2988210416806396, 0.031205169159875368, 0.07426953278384947, -0.00869068546823352, -0.025858501355590608, 0.028028363100020215, -0.1687755566284371, 0.16639611619757488, 0.25853532922508293, 0.16804399404888196, 0.3886837190075312, -0.3794882803146417, -0.16029146497991556, 0.14239684785328185, 0.058594492700649425, 0.041829583167176075, -0.04635399592613491, -0.2611959136290049, 0.06547206644124041, -0.19624713680968853, -0.13680251408853414, -0.1376082912805335, -0.09294685088389087, 0.060036991480349876, -0.3944874446024187, 0.1430108006337226, 0.057158448680638685, 0.06759915343718603, -0.08896729463594966, -0.1844736647569031, 0.008775991227594204, 0.0934945007126468, 0.1590253076137742, -0.0005332254998696347, 0.1137116603931645, -0.12039758323650555, -0.10769943405951683, 0.299305375481102, -0.07539848556674163, -0.20333908746639887, 0.19317557030020302, -0.10442008785321377, -0.15392577826181272, 0.05916550478044277, 0.2049493448666908, 0.0837521658395417, -0.15972866788797546, 0.028871643310897827, -0.039173367307133354, 0.13130417883318538, -0.004748524782674697, 0.01097684184787795, 0.14882146179540237, 0.18141405953792855, 0.11678704201767687, 0.14416068268474191, -0.09853216819525794, -0.057789005683540985, -0.32466682371038286, -0.10112218049471267, -0.12091806464498707, -0.00888629189770048, -0.19142259142184534, -0.20887024965001424, 0.36770754247360554, 0.2336852322332561, 0.18005120933715565, 0.21871978174870796, 0.2818461953429505, 0.15970419027265356, 0.008760289275718, 0.09054708603798645, 0.2322622565261554, 0.07565492961293785, -0.029127996599224087, -0.17629745333639826, 0.22699905149056576, -0.023610446320769068] |
1,802.00556 | Goethals--Seidel difference families with symmetric or skew base blocks | We single out a class of difference families which is widely used in some
constructions of Hadamard matrices and which we call Goethals--Seidel (GS)
difference families. They consist of four subsets (base blocks) of a finite
abelian group of order $v$, which can be used to construct Hadamard matrices
via the well-known Goethals--Seidel array. We consider the special class of
these families in cyclic groups, where each base block is either symmetric or
skew. We omit the well-known case where all four blocks are symmetric. By
extending previous computations by several authors, we complete the
classification of GS-difference families of this type for odd $v<50$. In
particular, we have constructed the first examples of so called good matrices,
G-matrices and best matrices of order 43, and good matrices and G-matrices of
order 45. We also point out some errors in one of the cited references.
| math.CO | we single out a class of difference families which is widely used in some constructions of hadamard matrices and which we call goethalsseidel gs difference families they consist of four subsets base blocks of a finite abelian group of order v which can be used to construct hadamard matrices via the wellknown goethalsseidel array we consider the special class of these families in cyclic groups where each base block is either symmetric or skew we omit the wellknown case where all four blocks are symmetric by extending previous computations by several authors we complete the classification of gsdifference families of this type for odd v50 in particular we have constructed the first examples of so called good matrices gmatrices and best matrices of order 43 and good matrices and gmatrices of order 45 we also point out some errors in one of the cited references | [['we', 'single', 'out', 'a', 'class', 'of', 'difference', 'families', 'which', 'is', 'widely', 'used', 'in', 'some', 'constructions', 'of', 'hadamard', 'matrices', 'and', 'which', 'we', 'call', 'goethalsseidel', 'gs', 'difference', 'families', 'they', 'consist', 'of', 'four', 'subsets', 'base', 'blocks', 'of', 'a', 'finite', 'abelian', 'group', 'of', 'order', 'v', 'which', 'can', 'be', 'used', 'to', 'construct', 'hadamard', 'matrices', 'via', 'the', 'wellknown', 'goethalsseidel', 'array', 'we', 'consider', 'the', 'special', 'class', 'of', 'these', 'families', 'in', 'cyclic', 'groups', 'where', 'each', 'base', 'block', 'is', 'either', 'symmetric', 'or', 'skew', 'we', 'omit', 'the', 'wellknown', 'case', 'where', 'all', 'four', 'blocks', 'are', 'symmetric', 'by', 'extending', 'previous', 'computations', 'by', 'several', 'authors', 'we', 'complete', 'the', 'classification', 'of', 'gsdifference', 'families', 'of', 'this', 'type', 'for', 'odd', 'v50', 'in', 'particular', 'we', 'have', 'constructed', 'the', 'first', 'examples', 'of', 'so', 'called', 'good', 'matrices', 'gmatrices', 'and', 'best', 'matrices', 'of', 'order', '43', 'and', 'good', 'matrices', 'and', 'gmatrices', 'of', 'order', '45', 'we', 'also', 'point', 'out', 'some', 'errors', 'in', 'one', 'of', 'the', 'cited', 'references']] | [-0.14408886179121005, 0.09661926731415507, 6.96608977806237e-05, 0.06536434440527551, -0.058354659347161136, -0.12105982217730747, 0.03560576767227354, 0.37404819361917263, -0.24607668372724825, -0.2572462949675456, 0.15855086419873665, -0.27718411318912534, -0.1717950675018882, 0.1817314446824538, -0.0590695824745732, 0.03329108562967223, 0.01632740429583161, 0.07036060596712762, -0.1300596357929559, -0.3082009807969573, 0.3694510559014614, -0.033615186435377434, 0.21741563555487017, -0.03139426295820158, 0.06633253303395274, -0.005657799629261717, -0.05800369145193448, 0.02365332848664063, -0.10571594294419305, 0.1118327172540982, 0.2887437707848019, 0.08138976506112765, 0.2149138253621964, -0.3738964659213606, -0.15261494527415684, 0.19400980769811818, 0.12199569515845117, 0.10449445470860358, -0.02540076833489972, -0.2317189668909931, 0.1265293690521503, -0.21157311621108318, -0.10876141848146087, -0.05746105399480762, 0.01980302537817301, 0.06085982022341341, -0.27696697506406864, 0.00189803624602468, 0.08818094043009397, 0.041471185571733966, 0.017061447174556734, -0.19997124882380982, 0.031734943127958104, 0.1318590017957225, -0.01033089139435914, -0.04238618922600937, 0.040397257485892624, -0.013696207812043011, -0.12569650024266188, 0.35596604512021357, -0.04228877408786502, -0.22645489297671398, 0.16146057678108466, -0.12087328058745091, -0.1750047214607346, 0.10500280363663074, 0.13321361665536338, 0.1529596370851828, -0.11422004011304428, 0.08381618874166936, -0.1169410681597785, 0.13618820723240788, 0.12932625577539308, 0.021296810863229137, 0.14433918298972356, 0.061427213628323644, 0.0497942514662605, 0.16679272652820348, -0.023721900089488674, -0.09058564930455759, -0.32200754933647757, -0.145596442205715, -0.1340159240135108, 0.0618262740641108, -0.09823909068129272, -0.17595844735397906, 0.43814543210383916, 0.08219257847587061, 0.17887739826498242, 0.021931401892895035, 0.1850452912654469, 0.04480046159975851, 0.1043675543656314, 0.09341440259312447, 0.14513688954442236, 0.17937198251860942, -0.016911370836573444, -0.10241586268117923, -0.006773379079984604, 0.1273460832178696] |
1,802.00557 | Nonlinear resonances in the $ABC$-flow | In this paper we study resonances of the $ABC$-flow in the near integrable
case ($C\ll 1$). This is an interesting example of a Hamiltonian system with
3/2 degrees of freedom in which simultaneous existence of two resonances of the
same order is possible. Analytical conditions of the resonance existence are
received. It is shown numerically that the largest $n:1$ ($n=1,2,3$) resonances
exist, and their energies are equal to theoretical energies in the near
integrable case. We provide analytical and numerical evidences for existence of
two branches of the two largest $n:1$ ($n=1,2$) resonances in the region of
finite motion.
| physics.flu-dyn | in this paper we study resonances of the abcflow in the near integrable case cll 1 this is an interesting example of a hamiltonian system with 32 degrees of freedom in which simultaneous existence of two resonances of the same order is possible analytical conditions of the resonance existence are received it is shown numerically that the largest n1 n123 resonances exist and their energies are equal to theoretical energies in the near integrable case we provide analytical and numerical evidences for existence of two branches of the two largest n1 n12 resonances in the region of finite motion | [['in', 'this', 'paper', 'we', 'study', 'resonances', 'of', 'the', 'abcflow', 'in', 'the', 'near', 'integrable', 'case', 'cll', '1', 'this', 'is', 'an', 'interesting', 'example', 'of', 'a', 'hamiltonian', 'system', 'with', '32', 'degrees', 'of', 'freedom', 'in', 'which', 'simultaneous', 'existence', 'of', 'two', 'resonances', 'of', 'the', 'same', 'order', 'is', 'possible', 'analytical', 'conditions', 'of', 'the', 'resonance', 'existence', 'are', 'received', 'it', 'is', 'shown', 'numerically', 'that', 'the', 'largest', 'n1', 'n123', 'resonances', 'exist', 'and', 'their', 'energies', 'are', 'equal', 'to', 'theoretical', 'energies', 'in', 'the', 'near', 'integrable', 'case', 'we', 'provide', 'analytical', 'and', 'numerical', 'evidences', 'for', 'existence', 'of', 'two', 'branches', 'of', 'the', 'two', 'largest', 'n1', 'n12', 'resonances', 'in', 'the', 'region', 'of', 'finite', 'motion']] | [-0.20100485254902242, 0.1394242619299812, -0.035056527666371275, 0.07005233090544928, -0.01428029375536499, -0.11380547188655143, -0.02329915360843932, 0.329137991116655, -0.17159540918326438, -0.2631729074631526, 0.10151787163252293, -0.3257977103419376, -0.15125305353278162, 0.14834889769554138, 0.03450418472251234, 0.05111869188370136, 0.04959231923861109, 0.0899058371136139, -0.023957062609648954, -0.2102692485834011, 0.30968941110327386, -0.017690583320353368, 0.19673014800957958, 0.08428810452666095, 0.05264633655962017, -0.032224633813261835, 0.0806549477456796, -0.04136655990485892, -0.19494317226722482, 0.10601985270176272, 0.2600511672031699, 0.05238282422751489, 0.23829581213625844, -0.37279860866303094, -0.1352941689993998, 0.11114121249152555, 0.20864915348250757, 0.13181165416579166, -0.034463201019198, -0.23525960330446863, 0.08652340902975111, -0.1148053928809899, -0.2265518114459936, -0.037434247256529454, 0.04401506181110186, 0.0072268477730415386, -0.28326058783803626, 0.09019147649858937, 0.09194406748936286, 0.07519610897835458, -0.0937060039735051, -0.14804852110300815, -0.02163133326202932, 0.11167793673218576, 0.059412586928411115, -0.05390682168577732, 0.023103921575415316, -0.10261837997934734, -0.13424380296709562, 0.340450757606463, -0.03347606031633349, -0.22055669572919306, 0.21072120280616513, -0.20004191977028368, -0.12503791713823725, 0.18421207340857523, 0.1431873847890382, 0.13364893033385578, -0.13126046604693237, 0.10774667529892552, -0.05414509856038623, 0.10353862535622385, 0.09183538276137727, 0.06568739148364826, 0.18076202976564415, 0.14377125145660508, 0.048748276478639156, 0.14560853673916574, -0.06711936332379477, -0.13385087811456278, -0.3598882017864121, -0.11923291156482366, -0.1734437702806911, 0.036620007832581646, -0.05991422419284583, -0.12035140602683621, 0.42824260872609987, 0.12973327378653027, 0.20199796723465274, 0.006264255420925717, 0.23611692475117366, 0.1380241902244061, 0.0007272981309491877, 0.05304046736729115, 0.3024543313817544, 0.15117740286796383, 0.02436531720814681, -0.2563203148011146, -0.05795495397872245, 0.0217038128534426] |
1,802.00558 | Biot's parameters estimation in ultrasound propagation through
cancellous bone | Of interest is the characterization of a cancellous bone immersed in an
acoustic fluid. The bone is placed between an ultrasonic point source and a
receiver. Cancellous bone is regarded as a porous medium saturated with fluid
according to Biot's theory. This model is coupled with the fluid in an open
pore configuration and solved by means of the Finite Volume Method.
Characterization is posed as a Bayesian parameter estimation problem in Biot's
model given pressure data collected at the receiver. As a first step we present
numerical results in 2D for signal recovery. It is shown that as point
estimators, the Conditional Mean outperforms the classical PDE-constrained
minimization solution.
| math.NA | of interest is the characterization of a cancellous bone immersed in an acoustic fluid the bone is placed between an ultrasonic point source and a receiver cancellous bone is regarded as a porous medium saturated with fluid according to biots theory this model is coupled with the fluid in an open pore configuration and solved by means of the finite volume method characterization is posed as a bayesian parameter estimation problem in biots model given pressure data collected at the receiver as a first step we present numerical results in 2d for signal recovery it is shown that as point estimators the conditional mean outperforms the classical pdeconstrained minimization solution | [['of', 'interest', 'is', 'the', 'characterization', 'of', 'a', 'cancellous', 'bone', 'immersed', 'in', 'an', 'acoustic', 'fluid', 'the', 'bone', 'is', 'placed', 'between', 'an', 'ultrasonic', 'point', 'source', 'and', 'a', 'receiver', 'cancellous', 'bone', 'is', 'regarded', 'as', 'a', 'porous', 'medium', 'saturated', 'with', 'fluid', 'according', 'to', 'biots', 'theory', 'this', 'model', 'is', 'coupled', 'with', 'the', 'fluid', 'in', 'an', 'open', 'pore', 'configuration', 'and', 'solved', 'by', 'means', 'of', 'the', 'finite', 'volume', 'method', 'characterization', 'is', 'posed', 'as', 'a', 'bayesian', 'parameter', 'estimation', 'problem', 'in', 'biots', 'model', 'given', 'pressure', 'data', 'collected', 'at', 'the', 'receiver', 'as', 'a', 'first', 'step', 'we', 'present', 'numerical', 'results', 'in', '2d', 'for', 'signal', 'recovery', 'it', 'is', 'shown', 'that', 'as', 'point', 'estimators', 'the', 'conditional', 'mean', 'outperforms', 'the', 'classical', 'pdeconstrained', 'minimization', 'solution']] | [-0.07663021559472492, 0.06279001265105431, -0.07938020458360287, -0.03015838722613725, -0.04111199775414372, -0.15062237320552496, -0.010632798605894838, 0.36211581578139557, -0.27369796623983844, -0.27199500260705295, 0.13668996790445156, -0.286399843306704, -0.1624571813333949, 0.1796408473789184, -0.10060521046715704, 0.09452259650623257, 0.046115546675652944, 0.024498983150856062, -0.012595538186459717, -0.18395214741732077, 0.23038351417688482, 0.07504988059570844, 0.30888546198945155, 0.044738336638759146, 0.1739036828967404, -0.00020126241513273934, 0.003772691035092893, 0.07495376854038278, -0.1562251180244361, 0.07163849293402481, 0.30896882616745475, 0.10375159416263076, 0.29794282063164496, -0.42328346534208816, -0.27900106783278966, 0.05625490283127874, 0.13255530103025112, 0.10192662590945309, -0.07062757160853256, -0.2775222229178656, 0.03522996728054502, -0.13234638156453996, -0.12315560627982698, 0.012315746223215353, -0.03412273868241093, -0.0071007358883765515, -0.3012696204844608, 0.12252735110338439, 0.019849871547723358, 0.0630041333000091, -0.13628674723546613, -0.08400463719259608, 0.009759166498075832, 0.09204415891065516, 0.03356904012193395, 0.05270531440831044, 0.15402335265905343, -0.12763542447620155, -0.04430200883864679, 0.398468760096214, -0.06280922795730558, -0.27057692149484697, 0.1493513417176225, -0.051497413205321536, -0.03282038232692602, 0.15280221875079653, 0.19328985545276242, 0.10219206667335873, -0.19167316886173053, 0.05429966402218931, -0.08807579401711171, 0.1831826017381073, 0.051172882500527934, -0.08017765472812409, 0.15758670473640615, 0.2960941118272868, 0.08220034187913618, 0.18074545583169147, -0.11221373910931023, -0.05773186819119887, -0.3062560723925179, -0.17384470115331085, -0.24875231999903918, -0.002396608716596595, -0.12419333944642197, -0.22909975261083507, 0.3142962158742276, 0.09877944065585986, 0.14657298926772042, 0.03278364694507962, 0.2957167956851084, 0.10104629478248006, -0.013638471566479314, 0.06991078609769995, 0.20709009383043106, 0.18290212021674962, 0.10539836217225952, -0.2069571767849001, 0.06764687738719989, 0.1026925319488245] |
1,802.00559 | Unlabelled Sensing: A Sparse Bayesian Learning Approach | We address the recovery of sparse vectors in an overcomplete, linear and
noisy multiple measurement framework, where the measurement matrix is known
upto a permutation of its rows. We derive sparse Bayesian learning (SBL) based
updates for joint recovery of the unknown sparse vector and the sensing order,
represented using a permutation matrix. We model the sparse matrix using
multiple uncorrelated and correlated vectors, and in particular, we use the
first order AR model for the correlated sparse vectors. We propose the
Permutation-MSBL and a Kalman filtering based Permutation-KSBL algorithm for
low-complex joint recovery of the uncorrelated and correlated sparse vectors,
jointly with the permutation matrix. The novelty of this work emerges in
providing a simple update step for the permutation matrix using the
rearrangement inequality. We demonstrate the mean square error and the
permutation recovery performance of the proposed algorithms using Monte Carlo
simulations.
| cs.IT math.IT | we address the recovery of sparse vectors in an overcomplete linear and noisy multiple measurement framework where the measurement matrix is known upto a permutation of its rows we derive sparse bayesian learning sbl based updates for joint recovery of the unknown sparse vector and the sensing order represented using a permutation matrix we model the sparse matrix using multiple uncorrelated and correlated vectors and in particular we use the first order ar model for the correlated sparse vectors we propose the permutationmsbl and a kalman filtering based permutationksbl algorithm for lowcomplex joint recovery of the uncorrelated and correlated sparse vectors jointly with the permutation matrix the novelty of this work emerges in providing a simple update step for the permutation matrix using the rearrangement inequality we demonstrate the mean square error and the permutation recovery performance of the proposed algorithms using monte carlo simulations | [['we', 'address', 'the', 'recovery', 'of', 'sparse', 'vectors', 'in', 'an', 'overcomplete', 'linear', 'and', 'noisy', 'multiple', 'measurement', 'framework', 'where', 'the', 'measurement', 'matrix', 'is', 'known', 'upto', 'a', 'permutation', 'of', 'its', 'rows', 'we', 'derive', 'sparse', 'bayesian', 'learning', 'sbl', 'based', 'updates', 'for', 'joint', 'recovery', 'of', 'the', 'unknown', 'sparse', 'vector', 'and', 'the', 'sensing', 'order', 'represented', 'using', 'a', 'permutation', 'matrix', 'we', 'model', 'the', 'sparse', 'matrix', 'using', 'multiple', 'uncorrelated', 'and', 'correlated', 'vectors', 'and', 'in', 'particular', 'we', 'use', 'the', 'first', 'order', 'ar', 'model', 'for', 'the', 'correlated', 'sparse', 'vectors', 'we', 'propose', 'the', 'permutationmsbl', 'and', 'a', 'kalman', 'filtering', 'based', 'permutationksbl', 'algorithm', 'for', 'lowcomplex', 'joint', 'recovery', 'of', 'the', 'uncorrelated', 'and', 'correlated', 'sparse', 'vectors', 'jointly', 'with', 'the', 'permutation', 'matrix', 'the', 'novelty', 'of', 'this', 'work', 'emerges', 'in', 'providing', 'a', 'simple', 'update', 'step', 'for', 'the', 'permutation', 'matrix', 'using', 'the', 'rearrangement', 'inequality', 'we', 'demonstrate', 'the', 'mean', 'square', 'error', 'and', 'the', 'permutation', 'recovery', 'performance', 'of', 'the', 'proposed', 'algorithms', 'using', 'monte', 'carlo', 'simulations']] | [-0.07487296354077705, 0.07590691627817753, -0.02636668436763274, 0.02053400473604044, -0.033172876017259344, -0.15434033095257005, 0.059469309096530705, 0.4183093977089112, -0.35267233576501844, -0.24547004983662726, 0.14084573785393414, -0.244196938624332, -0.22537959807786856, 0.07616380378571372, -0.06783077161485603, 0.15189147719721005, 0.06376622345011967, 0.06627439489991932, -0.17636302870151202, -0.2616010977613082, 0.2547954364901187, 0.08738693179419407, 0.2868839144345269, -0.08992551875681701, 0.16450653171127702, 0.12339694069867785, -0.1136609966202372, -0.02672167723490433, -0.038894350757705164, 0.1645799012239241, 0.2564978193804309, 0.201513467858044, 0.2789063731377775, -0.4189779644675709, -0.16567864444211022, 0.1460689355178013, 0.13519542691643005, 0.12000657645562156, -0.06996876663704227, -0.3074524635253669, 0.07922481100394071, -0.16581862714545398, -0.015416702542167444, -0.09234971433089903, -0.06808689478915055, -0.012817303444929682, -0.4180059800562742, 0.11923713535330929, 0.03931130486755417, 0.03325908860009346, -0.040170507682194295, -0.17429178856741442, 0.12101971246041618, 0.10748490380608457, -0.0006441203397014862, 0.004949230254608226, 0.10091003540160877, -0.06141978487782701, -0.1388216515534095, 0.3290576883176524, -0.06088014644687878, -0.23573714230939016, 0.11038218260176115, -0.08912795384694745, -0.1710258620885572, 0.1252749768847769, 0.2260901347532139, 0.09225884990414956, -0.1274082998621401, 0.04937928903667204, -0.11041742657031213, 0.16065156099979172, -0.004153788734513979, 0.010390312759322928, 0.09819690175061407, 0.17748856690217304, 0.07529265140150707, 0.1323880949741477, -0.15769338006010422, -0.06857960344246634, -0.26645739173917166, -0.1040695583141715, -0.28546030174654263, -0.032769152868565146, -0.18308307070879776, -0.18602474942116287, 0.4338776246494763, 0.17814663661663402, 0.20785365657477112, 0.11849741875991825, 0.3028606087803007, 0.1040316570380872, -0.006523811841266347, 0.1253439171363476, 0.14980591339436913, 0.20345456924263414, 0.02905877529793269, -0.2005407106215981, 0.09798188432660344, 0.08322402248745198] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.