id
float64 706
1.8k
| title
stringlengths 1
343
| abstract
stringlengths 6
6.09k
| categories
stringlengths 5
125
| processed_abstract
stringlengths 2
5.96k
| tokenized_abstract
stringlengths 8
8.74k
| centroid
stringlengths 2.1k
2.17k
|
|---|---|---|---|---|---|---|
1,803.06067
|
Dynamic-structured Semantic Propagation Network
|
Semantic concept hierarchy is still under-explored for semantic segmentation
due to the inefficiency and complicated optimization of incorporating
structural inference into dense prediction. This lack of modeling semantic
correlations also makes prior works must tune highly-specified models for each
task due to the label discrepancy across datasets. It severely limits the
generalization capability of segmentation models for open set concept
vocabulary and annotation utilization. In this paper, we propose a
Dynamic-Structured Semantic Propagation Network (DSSPN) that builds a semantic
neuron graph by explicitly incorporating the semantic concept hierarchy into
network construction. Each neuron represents the instantiated module for
recognizing a specific type of entity such as a super-class (e.g. food) or a
specific concept (e.g. pizza). During training, DSSPN performs the
dynamic-structured neuron computation graph by only activating a sub-graph of
neurons for each image in a principled way. A dense semantic-enhanced neural
block is proposed to propagate the learned knowledge of all ancestor neurons
into each fine-grained child neuron for feature evolving. Another merit of such
semantic explainable structure is the ability of learning a unified model
concurrently on diverse datasets by selectively activating different neuron
sub-graphs for each annotation at each step. Extensive experiments on four
public semantic segmentation datasets (i.e. ADE20K, COCO-Stuff, Cityscape and
Mapillary) demonstrate the superiority of our DSSPN over state-of-the-art
segmentation models. Moreoever, we demonstrate a universal segmentation model
that is jointly trained on diverse datasets can surpass the performance of the
common fine-tuning scheme for exploiting multiple domain knowledge.
|
cs.CV
|
semantic concept hierarchy is still underexplored for semantic segmentation due to the inefficiency and complicated optimization of incorporating structural inference into dense prediction this lack of modeling semantic correlations also makes prior works must tune highlyspecified models for each task due to the label discrepancy across datasets it severely limits the generalization capability of segmentation models for open set concept vocabulary and annotation utilization in this paper we propose a dynamicstructured semantic propagation network dsspn that builds a semantic neuron graph by explicitly incorporating the semantic concept hierarchy into network construction each neuron represents the instantiated module for recognizing a specific type of entity such as a superclass eg food or a specific concept eg pizza during training dsspn performs the dynamicstructured neuron computation graph by only activating a subgraph of neurons for each image in a principled way a dense semanticenhanced neural block is proposed to propagate the learned knowledge of all ancestor neurons into each finegrained child neuron for feature evolving another merit of such semantic explainable structure is the ability of learning a unified model concurrently on diverse datasets by selectively activating different neuron subgraphs for each annotation at each step extensive experiments on four public semantic segmentation datasets ie ade20k cocostuff cityscape and mapillary demonstrate the superiority of our dsspn over stateoftheart segmentation models moreoever we demonstrate a universal segmentation model that is jointly trained on diverse datasets can surpass the performance of the common finetuning scheme for exploiting multiple domain knowledge
|
[['semantic', 'concept', 'hierarchy', 'is', 'still', 'underexplored', 'for', 'semantic', 'segmentation', 'due', 'to', 'the', 'inefficiency', 'and', 'complicated', 'optimization', 'of', 'incorporating', 'structural', 'inference', 'into', 'dense', 'prediction', 'this', 'lack', 'of', 'modeling', 'semantic', 'correlations', 'also', 'makes', 'prior', 'works', 'must', 'tune', 'highlyspecified', 'models', 'for', 'each', 'task', 'due', 'to', 'the', 'label', 'discrepancy', 'across', 'datasets', 'it', 'severely', 'limits', 'the', 'generalization', 'capability', 'of', 'segmentation', 'models', 'for', 'open', 'set', 'concept', 'vocabulary', 'and', 'annotation', 'utilization', 'in', 'this', 'paper', 'we', 'propose', 'a', 'dynamicstructured', 'semantic', 'propagation', 'network', 'dsspn', 'that', 'builds', 'a', 'semantic', 'neuron', 'graph', 'by', 'explicitly', 'incorporating', 'the', 'semantic', 'concept', 'hierarchy', 'into', 'network', 'construction', 'each', 'neuron', 'represents', 'the', 'instantiated', 'module', 'for', 'recognizing', 'a', 'specific', 'type', 'of', 'entity', 'such', 'as', 'a', 'superclass', 'eg', 'food', 'or', 'a', 'specific', 'concept', 'eg', 'pizza', 'during', 'training', 'dsspn', 'performs', 'the', 'dynamicstructured', 'neuron', 'computation', 'graph', 'by', 'only', 'activating', 'a', 'subgraph', 'of', 'neurons', 'for', 'each', 'image', 'in', 'a', 'principled', 'way', 'a', 'dense', 'semanticenhanced', 'neural', 'block', 'is', 'proposed', 'to', 'propagate', 'the', 'learned', 'knowledge', 'of', 'all', 'ancestor', 'neurons', 'into', 'each', 'finegrained', 'child', 'neuron', 'for', 'feature', 'evolving', 'another', 'merit', 'of', 'such', 'semantic', 'explainable', 'structure', 'is', 'the', 'ability', 'of', 'learning', 'a', 'unified', 'model', 'concurrently', 'on', 'diverse', 'datasets', 'by', 'selectively', 'activating', 'different', 'neuron', 'subgraphs', 'for', 'each', 'annotation', 'at', 'each', 'step', 'extensive', 'experiments', 'on', 'four', 'public', 'semantic', 'segmentation', 'datasets', 'ie', 'ade20k', 'cocostuff', 'cityscape', 'and', 'mapillary', 'demonstrate', 'the', 'superiority', 'of', 'our', 'dsspn', 'over', 'stateoftheart', 'segmentation', 'models', 'moreoever', 'we', 'demonstrate', 'a', 'universal', 'segmentation', 'model', 'that', 'is', 'jointly', 'trained', 'on', 'diverse', 'datasets', 'can', 'surpass', 'the', 'performance', 'of', 'the', 'common', 'finetuning', 'scheme', 'for', 'exploiting', 'multiple', 'domain', 'knowledge']]
|
[-0.053199994353258076, 0.004818007396149241, -0.006941626016661517, 0.06653682163373899, -0.16244345682015074, -0.17590695458333477, 0.08022367220404673, 0.4513716743720218, -0.28430923019451176, -0.3391693530234793, 0.02986436891408006, -0.24948733981240787, -0.17411608014194188, 0.1509485198386891, -0.13988749184470128, 0.05463308519645294, 0.17884388847338142, 0.07312842875128335, -0.0125989472158715, -0.25097462155857153, 0.29849059560647895, 0.023913606914714718, 0.3506961817043056, 0.028756946115562124, 0.18601511637988108, -0.03894824910406716, -0.04817066384741098, -0.01842320253706945, -0.03850620955235781, 0.1746030806401198, 0.3394303983165049, 0.2401762623214817, 0.3524748551657362, -0.4016896447490069, -0.2738225946484532, 0.0931097265286756, 0.15259957289953874, 0.0976521290729519, -0.002799463667497924, -0.35824762719869996, 0.07946165722952617, -0.174787023460708, 0.06986365383606373, -0.12887938023921996, -0.0056460485331837305, -0.03178299426424417, -0.2693732064421777, 0.03349734324957571, 0.1141747346673207, 0.043135848563380465, -0.04800770389327918, -0.08948274775435147, -0.018435022157755457, 0.18441538290363113, -0.03741651873512209, 0.05807737106157174, 0.1680221723037587, -0.2209022878332464, -0.1523822808086445, 0.33412003969342624, -0.015971191008074963, -0.22925518123153502, 0.19189760579404322, -0.009947444045649696, -0.18656525795140172, 0.08453862039056753, 0.18775663985043364, 0.0741603449833664, -0.18808643749846754, 0.014326519099754966, -0.055848778594931786, 0.19976931667553785, 0.09030879760826822, -0.008376218697964406, 0.20530109179700717, 0.32948483307201276, 0.03522742896178191, 0.16285422773577643, -0.11462956209655481, -0.060884539190677864, -0.21863061005142825, -0.10848882798144444, -0.19463499518994565, -0.042691723663890964, -0.1584835868896575, -0.15208593998315997, 0.45398538356818813, 0.2176258595823166, 0.20916769644322475, 0.11038652865477348, 0.3323612510864546, -0.03195646551695281, 0.1497098240305762, 0.07961790643854659, 0.09131564715615481, 0.0024040436693505683, 0.09630078510506355, -0.16219942404528742, 0.13897169539743404, 0.09062809657357433]
|
1,803.06068
|
Memory Slices: A Modular Building Block for Scalable, Intelligent Memory
Systems
|
While reduction in feature size makes computation cheaper in terms of
latency, area, and power consumption, performance of emerging data-intensive
applications is determined by data movement. These trends have introduced the
concept of scalability as reaching a desirable performance per unit cost by
using as few number of units as possible. Many proposals have moved compute
closer to the memory. However, these efforts ignored maintaining a balance
between bandwidth and compute rate of an architecture, with those of
applications, which is a key principle in designing scalable large systems.
This paper proposes the use of memory slices, a modular building block for
scalable memory systems integrated with compute, in which performance scales
with memory size (and volume of data). The slice architecture utilizes a
programmable memory interface feeding a systolic compute engine with high reuse
rate. The modularity feature of slice-based systems is exploited with a
partitioning and data mapping strategy across allocated memory slices where
training performance scales with the data size. These features enable shifting
the most pressure to cheap compute units rather than expensive memory accesses
or transfers via interconnection network. An application of the memory slices
to a scale-out memory system is accelerating the training of recurrent,
convolutional, and hybrid neural networks (RNNs and RNNs+CNN) that are forming
cloud workloads. The results of our cycle-level simulations show that memory
slices exhibits a superlinear speedup when the number of slices increases.
Furthermore, memory slices improve power efficiency to 747 GFLOPs/J for
training LSTMs. While our current evaluation uses memory slices with 3D
packaging, a major value is that slices can also be constructed with a variety
of packaging options, for example with DDR-based memory units.
|
cs.AR cs.PF
|
while reduction in feature size makes computation cheaper in terms of latency area and power consumption performance of emerging dataintensive applications is determined by data movement these trends have introduced the concept of scalability as reaching a desirable performance per unit cost by using as few number of units as possible many proposals have moved compute closer to the memory however these efforts ignored maintaining a balance between bandwidth and compute rate of an architecture with those of applications which is a key principle in designing scalable large systems this paper proposes the use of memory slices a modular building block for scalable memory systems integrated with compute in which performance scales with memory size and volume of data the slice architecture utilizes a programmable memory interface feeding a systolic compute engine with high reuse rate the modularity feature of slicebased systems is exploited with a partitioning and data mapping strategy across allocated memory slices where training performance scales with the data size these features enable shifting the most pressure to cheap compute units rather than expensive memory accesses or transfers via interconnection network an application of the memory slices to a scaleout memory system is accelerating the training of recurrent convolutional and hybrid neural networks rnns and rnnscnn that are forming cloud workloads the results of our cyclelevel simulations show that memory slices exhibits a superlinear speedup when the number of slices increases furthermore memory slices improve power efficiency to 747 gflopsj for training lstms while our current evaluation uses memory slices with 3d packaging a major value is that slices can also be constructed with a variety of packaging options for example with ddrbased memory units
|
[['while', 'reduction', 'in', 'feature', 'size', 'makes', 'computation', 'cheaper', 'in', 'terms', 'of', 'latency', 'area', 'and', 'power', 'consumption', 'performance', 'of', 'emerging', 'dataintensive', 'applications', 'is', 'determined', 'by', 'data', 'movement', 'these', 'trends', 'have', 'introduced', 'the', 'concept', 'of', 'scalability', 'as', 'reaching', 'a', 'desirable', 'performance', 'per', 'unit', 'cost', 'by', 'using', 'as', 'few', 'number', 'of', 'units', 'as', 'possible', 'many', 'proposals', 'have', 'moved', 'compute', 'closer', 'to', 'the', 'memory', 'however', 'these', 'efforts', 'ignored', 'maintaining', 'a', 'balance', 'between', 'bandwidth', 'and', 'compute', 'rate', 'of', 'an', 'architecture', 'with', 'those', 'of', 'applications', 'which', 'is', 'a', 'key', 'principle', 'in', 'designing', 'scalable', 'large', 'systems', 'this', 'paper', 'proposes', 'the', 'use', 'of', 'memory', 'slices', 'a', 'modular', 'building', 'block', 'for', 'scalable', 'memory', 'systems', 'integrated', 'with', 'compute', 'in', 'which', 'performance', 'scales', 'with', 'memory', 'size', 'and', 'volume', 'of', 'data', 'the', 'slice', 'architecture', 'utilizes', 'a', 'programmable', 'memory', 'interface', 'feeding', 'a', 'systolic', 'compute', 'engine', 'with', 'high', 'reuse', 'rate', 'the', 'modularity', 'feature', 'of', 'slicebased', 'systems', 'is', 'exploited', 'with', 'a', 'partitioning', 'and', 'data', 'mapping', 'strategy', 'across', 'allocated', 'memory', 'slices', 'where', 'training', 'performance', 'scales', 'with', 'the', 'data', 'size', 'these', 'features', 'enable', 'shifting', 'the', 'most', 'pressure', 'to', 'cheap', 'compute', 'units', 'rather', 'than', 'expensive', 'memory', 'accesses', 'or', 'transfers', 'via', 'interconnection', 'network', 'an', 'application', 'of', 'the', 'memory', 'slices', 'to', 'a', 'scaleout', 'memory', 'system', 'is', 'accelerating', 'the', 'training', 'of', 'recurrent', 'convolutional', 'and', 'hybrid', 'neural', 'networks', 'rnns', 'and', 'rnnscnn', 'that', 'are', 'forming', 'cloud', 'workloads', 'the', 'results', 'of', 'our', 'cyclelevel', 'simulations', 'show', 'that', 'memory', 'slices', 'exhibits', 'a', 'superlinear', 'speedup', 'when', 'the', 'number', 'of', 'slices', 'increases', 'furthermore', 'memory', 'slices', 'improve', 'power', 'efficiency', 'to', '747', 'gflopsj', 'for', 'training', 'lstms', 'while', 'our', 'current', 'evaluation', 'uses', 'memory', 'slices', 'with', '3d', 'packaging', 'a', 'major', 'value', 'is', 'that', 'slices', 'can', 'also', 'be', 'constructed', 'with', 'a', 'variety', 'of', 'packaging', 'options', 'for', 'example', 'with', 'ddrbased', 'memory', 'units']]
|
[-0.15168501208112997, 0.04199046290659515, -0.013196220784024758, 0.008781602991935374, -0.07339637256142768, -0.17390905103053558, 0.05334499254691764, 0.4160032144324346, -0.288668459628878, -0.35715397048402914, 0.12522425773976878, -0.2323200019499795, -0.11636503917630762, 0.22830633328296243, -0.10697742368676699, 0.07478745957201516, 0.10328963509252803, 0.004934639804573222, -0.06778083102481271, -0.28985429521988737, 0.24080900943711062, 0.12447052484039556, 0.35296427074819803, 0.0014137531842359087, 0.12182415811852976, -0.049323765712536195, -0.013221954884515568, 0.005883136331103742, -0.030321309465719176, 0.18088930241678927, 0.27400419759056105, 0.15095499380332925, 0.3355708855051886, -0.47581472601847385, -0.20000338595021855, 0.07169869873498101, 0.1471388341503387, 0.05361646849746731, -0.047224939854138274, -0.21429461144503545, 0.11426975179463625, -0.2005528727410869, -0.034720602594316, -0.13919259672603485, 0.033932700214738196, 0.027485036689957436, -0.2659497081954032, 0.02284251630210995, 0.017257168581709267, 0.030953510265628044, -0.017748151765395462, -0.0831978797485036, 0.0017109929973428899, 0.1649046644916631, -0.005031681413846937, 0.03191139190669425, 0.17605359837836163, -0.15759902964346112, -0.1465622712527825, 0.3609904030371796, -0.006469152415097183, -0.19719808854279108, 0.17295095930891957, -0.03554728451438925, -0.11522780948964118, 0.11261860225180333, 0.22448209239000624, 0.050251920748163356, -0.13472960077506618, 0.05447925495364788, 0.04113296462392265, 0.21979861420917918, 0.07465010659853843, 0.0978704312232069, 0.17904237798415124, 0.2899651847500354, 0.06430194479984824, 0.17696345588202927, -0.10863892350176518, -0.0921990424870852, -0.21820559321521696, -0.18294828481802886, -0.21088725738142702, 0.021856022811156103, -0.1314284394523764, -0.15531123311343517, 0.376616155735471, 0.15955142079767856, 0.21509676753119988, 0.1774861016724555, 0.36020263672975655, 0.05650610674130307, 0.23355476663532582, 0.1577065471889959, 0.10581853285770525, 0.025680749779567122, 0.17096993278712033, -0.19043789640428838, 0.07146196273917502, 0.005784080580554225]
|
1,803.06069
|
A Preliminary Analysis of the Shangri-La Bolide on 2017 Oct 4
|
At 12:07 UT (8:07 pm China Standard Time) on 2017 Oct 4, a bright bolide was
widely observed in the Shangri-La region in the Province of Yunnan, China
(Figure 1). The event was well observed by the general public as it took place
on the night of the Mid Autumn Festival which associates with moon gazing.
Sonic booms and ground shaking were reported in an area about a thousand square
kilometers wide to the northwest of the Shangri-La City. Data from the U.S.
government sensor suggested that the impact energy of the event is
approximately 0.54 kt TNT equivalent, with the terminus of the bolide
positioned at $28.1^\circ$ N, $99.4^\circ$ E. This is the largest observed
bolide event overland since the bolide event took place in Mauritania on 2016
Jun 27 (1.2 kt). In this Research Note we present a preliminary analysis of
this event.
|
astro-ph.EP
|
at 1207 ut 807 pm china standard time on 2017 oct 4 a bright bolide was widely observed in the shangrila region in the province of yunnan china figure 1 the event was well observed by the general public as it took place on the night of the mid autumn festival which associates with moon gazing sonic booms and ground shaking were reported in an area about a thousand square kilometers wide to the northwest of the shangrila city data from the us government sensor suggested that the impact energy of the event is approximately 054 kt tnt equivalent with the terminus of the bolide positioned at 281circ n 994circ e this is the largest observed bolide event overland since the bolide event took place in mauritania on 2016 jun 27 12 kt in this research note we present a preliminary analysis of this event
|
[['at', '1207', 'ut', '807', 'pm', 'china', 'standard', 'time', 'on', '2017', 'oct', '4', 'a', 'bright', 'bolide', 'was', 'widely', 'observed', 'in', 'the', 'shangrila', 'region', 'in', 'the', 'province', 'of', 'yunnan', 'china', 'figure', '1', 'the', 'event', 'was', 'well', 'observed', 'by', 'the', 'general', 'public', 'as', 'it', 'took', 'place', 'on', 'the', 'night', 'of', 'the', 'mid', 'autumn', 'festival', 'which', 'associates', 'with', 'moon', 'gazing', 'sonic', 'booms', 'and', 'ground', 'shaking', 'were', 'reported', 'in', 'an', 'area', 'about', 'a', 'thousand', 'square', 'kilometers', 'wide', 'to', 'the', 'northwest', 'of', 'the', 'shangrila', 'city', 'data', 'from', 'the', 'us', 'government', 'sensor', 'suggested', 'that', 'the', 'impact', 'energy', 'of', 'the', 'event', 'is', 'approximately', '054', 'kt', 'tnt', 'equivalent', 'with', 'the', 'terminus', 'of', 'the', 'bolide', 'positioned', 'at', '281circ', 'n', '994circ', 'e', 'this', 'is', 'the', 'largest', 'observed', 'bolide', 'event', 'overland', 'since', 'the', 'bolide', 'event', 'took', 'place', 'in', 'mauritania', 'on', '2016', 'jun', '27', '12', 'kt', 'in', 'this', 'research', 'note', 'we', 'present', 'a', 'preliminary', 'analysis', 'of', 'this', 'event']]
|
[-0.07088892202428705, 0.11199325925299745, -0.08965311205613759, 0.06395660548135508, -0.028446295233508508, -0.06029732791394308, 0.029811168478645542, 0.3234341869560572, -0.15811275147631035, -0.39663649272577434, 0.14605304840675365, -0.36502373262823046, -0.061178955889365574, 0.20376092737045634, -0.10422234988948037, -0.029015962207356916, 0.09367187030961854, 0.069583611658097, 0.0014238961723183731, -0.2693251048839957, 0.1623088002100691, 0.13024022130269583, 0.25351662904437683, 0.034007690117492544, 0.13037268252403417, -0.012749943590781593, -0.04862129178966259, -0.06965057531020025, -0.1486103943151921, 0.03179749101237557, 0.26979552358519154, 0.10715965460985899, 0.23517095764538834, -0.3565347121338119, -0.1331026129930531, 0.05283543976818348, 0.051028796597025715, -0.02923386638607159, 0.022690167807700386, -0.32779111002304856, 0.029409362175794956, -0.19269679869009, -0.11709905123839584, 0.14970075666344354, 0.10852684996944, -0.017076288786280404, -0.19265581832195705, 0.07663219521584158, 0.002954580392069802, 0.13963053278442655, -0.04189743187768593, -0.14829851600253577, -0.027129115603564607, 0.12381264921994163, 0.03131506353343179, 0.10084662691061548, 0.10958857996832136, -0.009229026684355173, -0.07294831813681037, 0.3680615462493021, -0.034979455889417574, 0.06307893348988015, 0.14433971629478037, -0.2304910912986037, -0.14267181764662892, 0.19339845470198386, 0.19135564208108855, 0.08612211723934038, -0.1519561026544942, 0.022107589155862147, -0.07442422525552622, 0.19147058307369064, 0.1296434940907036, -0.09615492613430923, 0.2311685584303174, 0.19443827491071258, 0.03981562861456321, 0.07851178750234585, -0.2739201908755292, -0.06815183343743528, -0.2703456007061409, -0.11970854078588838, -0.14302881111527657, 0.05534081313827472, -0.036499630584820315, -0.08713071482334207, 0.38728637763435814, 0.12939351831621432, 0.1695328847589818, -0.048472264883355924, 0.20927512278402602, 0.030397386829876763, 0.07729235551339554, 0.11212061620008044, 0.29219826282216954, 0.014925494659822304, 0.2393608085023096, -0.13318836191258804, 0.06919180047112172, 0.034469193660278015]
|
1,803.0607
|
Modelling sparsity, heterogeneity, reciprocity and community structure
in temporal interaction data
|
We propose a novel class of network models for temporal dyadic interaction
data. Our goal is to capture a number of important features often observed in
social interactions: sparsity, degree heterogeneity, community structure and
reciprocity. We propose a family of models based on self-exciting Hawkes point
processes in which events depend on the history of the process. The key
component is the conditional intensity function of the Hawkes Process, which
captures the fact that interactions may arise as a response to past
interactions (reciprocity), or due to shared interests between individuals
(community structure). In order to capture the sparsity and degree
heterogeneity, the base (non time dependent) part of the intensity function
builds on compound random measures following Todeschini et al. (2016). We
conduct experiments on a variety of real-world temporal interaction data and
show that the proposed model outperforms many competing approaches for link
prediction, and leads to interpretable parameters.
|
stat.ML
|
we propose a novel class of network models for temporal dyadic interaction data our goal is to capture a number of important features often observed in social interactions sparsity degree heterogeneity community structure and reciprocity we propose a family of models based on selfexciting hawkes point processes in which events depend on the history of the process the key component is the conditional intensity function of the hawkes process which captures the fact that interactions may arise as a response to past interactions reciprocity or due to shared interests between individuals community structure in order to capture the sparsity and degree heterogeneity the base non time dependent part of the intensity function builds on compound random measures following todeschini et al 2016 we conduct experiments on a variety of realworld temporal interaction data and show that the proposed model outperforms many competing approaches for link prediction and leads to interpretable parameters
|
[['we', 'propose', 'a', 'novel', 'class', 'of', 'network', 'models', 'for', 'temporal', 'dyadic', 'interaction', 'data', 'our', 'goal', 'is', 'to', 'capture', 'a', 'number', 'of', 'important', 'features', 'often', 'observed', 'in', 'social', 'interactions', 'sparsity', 'degree', 'heterogeneity', 'community', 'structure', 'and', 'reciprocity', 'we', 'propose', 'a', 'family', 'of', 'models', 'based', 'on', 'selfexciting', 'hawkes', 'point', 'processes', 'in', 'which', 'events', 'depend', 'on', 'the', 'history', 'of', 'the', 'process', 'the', 'key', 'component', 'is', 'the', 'conditional', 'intensity', 'function', 'of', 'the', 'hawkes', 'process', 'which', 'captures', 'the', 'fact', 'that', 'interactions', 'may', 'arise', 'as', 'a', 'response', 'to', 'past', 'interactions', 'reciprocity', 'or', 'due', 'to', 'shared', 'interests', 'between', 'individuals', 'community', 'structure', 'in', 'order', 'to', 'capture', 'the', 'sparsity', 'and', 'degree', 'heterogeneity', 'the', 'base', 'non', 'time', 'dependent', 'part', 'of', 'the', 'intensity', 'function', 'builds', 'on', 'compound', 'random', 'measures', 'following', 'todeschini', 'et', 'al', '2016', 'we', 'conduct', 'experiments', 'on', 'a', 'variety', 'of', 'realworld', 'temporal', 'interaction', 'data', 'and', 'show', 'that', 'the', 'proposed', 'model', 'outperforms', 'many', 'competing', 'approaches', 'for', 'link', 'prediction', 'and', 'leads', 'to', 'interpretable', 'parameters']]
|
[-0.11810412133733432, 0.05114306835845734, -0.08013028007737982, 0.08496210953155242, -0.126744634360075, -0.09768462838915487, 0.050837031861301514, 0.39561310450236004, -0.3090028742918124, -0.3041784204507712, 0.022315753663424403, -0.2828436443209648, -0.2360264033032581, 0.1344765319977887, -0.05472492710997661, 0.031815860029309986, 0.044640253611141816, 0.039964065135767064, 0.012956388133267561, -0.24313243951648475, 0.3570203364081681, 0.08440089121344499, 0.3476473547983915, 0.04736673673304419, 0.12344768569959949, 0.053229430907716355, -0.056785652425605807, -0.0019899780101453263, -0.08371708323296237, 0.12520844374472898, 0.2588862932627186, 0.15865094952906172, 0.30863679267155625, -0.42113945769766964, -0.27613279786581796, 0.12230664044929047, 0.08436777155147865, 0.06326926568134998, -0.007430393068740765, -0.29529560706267755, 0.01064160697783033, -0.17438002538731476, -0.05492709685117006, -0.09370270542024324, 0.0030720747634768487, 0.058395108891030154, -0.34056101795673993, 0.08882655162209024, 0.09156569868326186, 0.0547117967158556, -0.015444170388703545, -0.08291346200431386, 0.005971956465703746, 0.14755993752546298, 0.06619735777261666, -0.014264005000392595, 0.12619541781644025, -0.1418314097635448, -0.1593410154618323, 0.3489342876318066, -0.061205430047120896, -0.16363957594304035, 0.2366953505637745, -0.11576018864909808, -0.17723281322047113, 0.10428136583417653, 0.28043091380503027, 0.07357143357240906, -0.1479123403915825, 0.04427029498387128, -0.05183930051202575, 0.1949973972896502, 0.015250786175020039, 0.024717251447339852, 0.17078154686838387, 0.22534611069597305, 0.03379656160909993, 0.08157531265169382, -0.1012481099444752, -0.13971759764982078, -0.226471357550472, -0.08723020661622286, -0.18580625519156457, -0.005369692520859341, -0.10475288701980996, -0.16441133540744582, 0.43239304604319234, 0.20633755766243364, 0.24016374515369535, 0.06852974713003884, 0.25125396640971304, 0.0690513832308352, 0.07250322167451183, 0.03735155861203869, 0.15355895354412497, 0.09614897004328668, 0.08929313209528725, -0.1698314674322804, 0.20381214172113687, 0.04284055835567415]
|
1,803.06071
|
Impacts of Dirty Data: and Experimental Evaluation
|
Data quality issues have attracted widespread attention due to the negative
impacts of dirty data on data mining and machine learning results. The
relationship between data quality and the accuracy of results could be applied
on the selection of the appropriate algorithm with the consideration of data
quality and the determination of the data share to clean. However, rare
research has focused on exploring such relationship. Motivated by this, this
paper conducts an experimental comparison for the effects of missing,
inconsistent and conflicting data on classification and clustering algorithms.
Based on the experimental findings, we provide guidelines for algorithm
selection and data cleaning.
|
cs.DB cs.LG stat.ML
|
data quality issues have attracted widespread attention due to the negative impacts of dirty data on data mining and machine learning results the relationship between data quality and the accuracy of results could be applied on the selection of the appropriate algorithm with the consideration of data quality and the determination of the data share to clean however rare research has focused on exploring such relationship motivated by this this paper conducts an experimental comparison for the effects of missing inconsistent and conflicting data on classification and clustering algorithms based on the experimental findings we provide guidelines for algorithm selection and data cleaning
|
[['data', 'quality', 'issues', 'have', 'attracted', 'widespread', 'attention', 'due', 'to', 'the', 'negative', 'impacts', 'of', 'dirty', 'data', 'on', 'data', 'mining', 'and', 'machine', 'learning', 'results', 'the', 'relationship', 'between', 'data', 'quality', 'and', 'the', 'accuracy', 'of', 'results', 'could', 'be', 'applied', 'on', 'the', 'selection', 'of', 'the', 'appropriate', 'algorithm', 'with', 'the', 'consideration', 'of', 'data', 'quality', 'and', 'the', 'determination', 'of', 'the', 'data', 'share', 'to', 'clean', 'however', 'rare', 'research', 'has', 'focused', 'on', 'exploring', 'such', 'relationship', 'motivated', 'by', 'this', 'this', 'paper', 'conducts', 'an', 'experimental', 'comparison', 'for', 'the', 'effects', 'of', 'missing', 'inconsistent', 'and', 'conflicting', 'data', 'on', 'classification', 'and', 'clustering', 'algorithms', 'based', 'on', 'the', 'experimental', 'findings', 'we', 'provide', 'guidelines', 'for', 'algorithm', 'selection', 'and', 'data', 'cleaning']]
|
[-0.0555805882483662, -0.01646733171975091, -0.08284976757900084, 0.06383078646375934, -0.15055385472488056, -0.12214272198023148, 0.11974562715526525, 0.41389977541363354, -0.20881139080139619, -0.36791914815390575, 0.14509890709542533, -0.31697701075700907, -0.10290678927801478, 0.24099659500191511, -0.10985182002819713, 0.10293303332427173, 0.12790955096207451, 0.007938821459001436, -0.05703911089532764, -0.2871682097077442, 0.3403056510769337, 0.10840773224396613, 0.4368075216189027, 0.08367212686362197, 0.05754109665986548, 0.02120518516489187, -0.13004849690890835, 0.011424928361061707, -0.12906389827393583, 0.1990457315685101, 0.279461102433575, 0.2077236960334613, 0.31436328463328694, -0.4175929080297067, -0.19311979150363398, 0.07683986386519323, 0.11753571817585837, 0.09667975715026983, -0.138168741904823, -0.3029128371294841, 0.0625701055317231, -0.09953055601822465, -0.0166567060779961, -0.1254408926368483, -0.010143682686159911, 0.0030882827642608832, -0.2851223150195861, 0.05287216939947577, 0.044965160911161345, 0.10738183740634942, -0.06565330792399286, -0.1446283130716641, 0.026208710938113406, 0.15438739318418707, 0.12156674958589188, 0.02337862386648516, 0.08494591769463952, -0.1476856075426184, -0.14387117908562272, 0.39593620210641867, -0.019969328734978527, -0.18407664146021152, 0.20833784825783402, -0.0550503403906828, -0.19688316598281408, 0.08359466462387043, 0.2616769415462046, 0.045772089980072476, -0.1421002876149147, 0.020225391900664177, -0.004649355871946487, 0.1310496237716701, 0.00219095199938538, 0.019259589489151553, 0.17959021813082462, 0.2628292235753779, -0.0033405582370797117, 0.10889675046398657, -0.10536239258899778, -0.03377307795476422, -0.2066011411675876, -0.08380457999419819, -0.19184590053735573, -0.032734186890381343, -0.0795840414377151, -0.12521751877824658, 0.3742706538404076, 0.22598306458551906, 0.2601673791582868, -0.0034217602727048607, 0.3320495330375954, 0.03184730270809666, 0.07271645097423671, 0.03058921654247543, 0.22590181670260154, 0.045303561153948235, 0.12213781332705641, -0.21156829669709923, 0.13808742344596434, -0.05918800989979679]
|
1,803.06072
|
Computing Special $L$-Values of Certain Modular Forms with Complex
Multiplication
|
In this expository paper, we illustrate two explicit methods which lead to
special $L$-values of certain modular forms admitting complex multiplication
(CM), motivated in part by properties of $L$-functions obtained from Calabi-Yau
manifolds defined over $\mathbb Q$.
|
math.NT
|
in this expository paper we illustrate two explicit methods which lead to special lvalues of certain modular forms admitting complex multiplication cm motivated in part by properties of lfunctions obtained from calabiyau manifolds defined over mathbb q
|
[['in', 'this', 'expository', 'paper', 'we', 'illustrate', 'two', 'explicit', 'methods', 'which', 'lead', 'to', 'special', 'lvalues', 'of', 'certain', 'modular', 'forms', 'admitting', 'complex', 'multiplication', 'cm', 'motivated', 'in', 'part', 'by', 'properties', 'of', 'lfunctions', 'obtained', 'from', 'calabiyau', 'manifolds', 'defined', 'over', 'mathbb', 'q']]
|
[-0.2315459344284357, -0.02833885889550721, -0.06412263499019114, 0.06351482169388013, -0.09823967612071617, -0.14592540067796772, -0.06776665496274929, 0.3106602294420874, -0.27468974586274175, -0.21280350354877678, 0.06934788390817875, -0.180025230979506, -0.2335016145496755, 0.29718738814463486, -0.17152372249276251, 0.020289750971101427, -0.0057476518449147, 0.04630256188731339, -0.1782210242959696, -0.38139709870557525, 0.48829908731922106, -0.04273547279975704, 0.18044978205265627, 0.06625885131290636, 0.10121719914211615, -0.01118054986000061, -0.03719724362363686, -0.07946247825197675, -0.15825185683127996, 0.21834302917626258, 0.39756271092070117, 0.004407552045744819, 0.17860107063441663, -0.44004286100735535, -0.1319938959251787, 0.22017121294865738, 0.166571756623484, -0.054388734527762876, -0.006231419188348022, -0.27877290647577596, 0.04795251599185773, -0.20445888504587315, -0.19701318569934448, -0.11327344525253048, 0.0022008660677317027, 0.05997471243294107, -0.24557123245746904, 0.002977961372282054, 0.09397332367764132, 0.21657931021842602, -0.07491330983670982, -0.1764410024231954, 0.01996548134028106, 0.013210528605693096, 0.060685054172535204, 0.028694288301709538, 0.07677136817191904, -0.09916207967703608, -0.09039008095105355, 0.32194614893681295, -0.018977744303442335, -0.22440317331032977, 0.04105944591700225, -0.13223437321800235, -0.23052859254735145, 0.1703449197874933, 0.15230813129125415, 0.17471694598930912, -0.0131977043441824, 0.20174583890223624, -0.0814506483163584, 0.02234293142887386, 0.1758599355816841, -0.013438637494235425, 0.1531574911362416, 0.029428993024536082, 0.0071856805022705245, 0.17548716735296152, 0.08208215167443897, -0.10665734935350515, -0.37841066959741954, -0.143459840803533, -0.10577258112764842, 0.2033117992451062, -0.0888101780233351, -0.14731387260395126, 0.41899574769509806, 0.062002815910287806, 0.2405659596788118, 0.1306699227724174, 0.20359438335573352, 0.061674266424332116, 0.08213236968259553, 0.02606369912422992, 0.07720619928393815, 0.2124643012994548, 0.012041900542917082, -0.06798497747906761, -0.05778939604155115, 0.17608769742042027]
|
1,803.06073
|
Lyapunov Functions for First-Order Methods: Tight Automated Convergence
Guarantees
|
We present a novel way of generating Lyapunov functions for proving linear
convergence rates of first-order optimization methods. Our approach provably
obtains the fastest linear convergence rate that can be verified by a quadratic
Lyapunov function (with given states), and only relies on solving a small-sized
semidefinite program. Our approach combines the advantages of performance
estimation problems (PEP, due to Drori & Teboulle (2014)) and integral
quadratic constraints (IQC, due to Lessard et al. (2016)), and relies on convex
interpolation (due to Taylor et al. (2017c;b)).
|
math.OC
|
we present a novel way of generating lyapunov functions for proving linear convergence rates of firstorder optimization methods our approach provably obtains the fastest linear convergence rate that can be verified by a quadratic lyapunov function with given states and only relies on solving a smallsized semidefinite program our approach combines the advantages of performance estimation problems pep due to drori teboulle 2014 and integral quadratic constraints iqc due to lessard et al 2016 and relies on convex interpolation due to taylor et al 2017cb
|
[['we', 'present', 'a', 'novel', 'way', 'of', 'generating', 'lyapunov', 'functions', 'for', 'proving', 'linear', 'convergence', 'rates', 'of', 'firstorder', 'optimization', 'methods', 'our', 'approach', 'provably', 'obtains', 'the', 'fastest', 'linear', 'convergence', 'rate', 'that', 'can', 'be', 'verified', 'by', 'a', 'quadratic', 'lyapunov', 'function', 'with', 'given', 'states', 'and', 'only', 'relies', 'on', 'solving', 'a', 'smallsized', 'semidefinite', 'program', 'our', 'approach', 'combines', 'the', 'advantages', 'of', 'performance', 'estimation', 'problems', 'pep', 'due', 'to', 'drori', 'teboulle', '2014', 'and', 'integral', 'quadratic', 'constraints', 'iqc', 'due', 'to', 'lessard', 'et', 'al', '2016', 'and', 'relies', 'on', 'convex', 'interpolation', 'due', 'to', 'taylor', 'et', 'al', '2017cb']]
|
[-0.08501566593934383, -0.05193955685189437, -0.12316556080865364, 0.020785497516737365, -0.13536591853369914, -0.13893873602085346, 0.07536055991104582, 0.2824820926124674, -0.29324043654127135, -0.3301658890143569, 0.11050153039728425, -0.20913104629809304, -0.22011922146858914, 0.27429942241204636, -0.13450399931475876, 0.18522646468842313, 0.06629306544727158, -0.12974008565236414, -0.09712610328071085, -0.3626194647125279, 0.24817495810843648, 0.09745263993473989, 0.25859741112660795, 0.053243898575948106, 0.18583410809792222, 0.052597364998378214, -0.035349477925116106, 0.017165944534575657, -0.11294787381008237, 0.1534358975553741, 0.2679994662425348, 0.1815668215110366, 0.3433070285606109, -0.3600549208488138, -0.14280253836131168, 0.0789421609758089, 0.08771634252653235, 0.09819417193925585, -0.058483523552283825, -0.29502780556157676, 0.07465053419859725, -0.1139496539031998, -0.06397064022963778, -0.1598687916107121, -0.008643159251992725, 0.05437621658867491, -0.39069503312930465, 0.10397489175998739, 0.0786861460302524, 0.022712643136314693, -0.04057394126097539, -0.15983319056353398, 0.02597229478747717, -0.026399983819352373, 0.004193480348303204, 0.0645717813167721, 0.07520577074804653, -0.011493824042623774, -0.18921518575267068, 0.31295229365960475, -0.04977261086571075, -0.1844742236481536, 0.216143275350554, -0.03748358134734666, -0.11986490913910702, 0.14062743615137324, 0.2073312641739557, 0.20973387713612673, -0.13121566204132423, 0.18747202596707557, -0.03572651362490086, 0.15605128385747472, 0.06669508612581662, -0.02259003451382298, 0.0925335227123772, 0.10762603294348255, 0.15579313959460706, 0.12459609269128469, -0.021751710967648597, -0.1494252440932628, -0.24013309594288113, -0.11247857173051064, -0.23485254877734751, -0.023534288391515258, -0.05309535824043061, -0.12936747871294973, 0.38449822097928044, 0.11183334315483946, 0.16761709279602482, 0.17822281035062457, 0.3008460114443941, 0.190412071602796, 0.01575009265382375, 0.1622718260069156, 0.2511926845292605, 0.1533744527038098, 0.06922438657022126, -0.2485876276900637, 0.10381877115772416, 0.19936135739720026]
|
1,803.06074
|
Reconfiguring spanning and induced subgraphs
|
Subgraph reconfiguration is a family of problems focusing on the reachability
of the solution space in which feasible solutions are subgraphs, represented
either as sets of vertices or sets of edges, satisfying a prescribed graph
structure property. Although there has been previous work that can be
categorized as subgraph reconfiguration, most of the related results appear
under the name of the property under consideration; for example, independent
set, clique, and matching. In this paper, we systematically clarify the
complexity status of subgraph reconfiguration with respect to graph structure
properties.
|
cs.DS cs.CC cs.DM
|
subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs represented either as sets of vertices or sets of edges satisfying a prescribed graph structure property although there has been previous work that can be categorized as subgraph reconfiguration most of the related results appear under the name of the property under consideration for example independent set clique and matching in this paper we systematically clarify the complexity status of subgraph reconfiguration with respect to graph structure properties
|
[['subgraph', 'reconfiguration', 'is', 'a', 'family', 'of', 'problems', 'focusing', 'on', 'the', 'reachability', 'of', 'the', 'solution', 'space', 'in', 'which', 'feasible', 'solutions', 'are', 'subgraphs', 'represented', 'either', 'as', 'sets', 'of', 'vertices', 'or', 'sets', 'of', 'edges', 'satisfying', 'a', 'prescribed', 'graph', 'structure', 'property', 'although', 'there', 'has', 'been', 'previous', 'work', 'that', 'can', 'be', 'categorized', 'as', 'subgraph', 'reconfiguration', 'most', 'of', 'the', 'related', 'results', 'appear', 'under', 'the', 'name', 'of', 'the', 'property', 'under', 'consideration', 'for', 'example', 'independent', 'set', 'clique', 'and', 'matching', 'in', 'this', 'paper', 'we', 'systematically', 'clarify', 'the', 'complexity', 'status', 'of', 'subgraph', 'reconfiguration', 'with', 'respect', 'to', 'graph', 'structure', 'properties']]
|
[-0.18349805979706932, 0.06391356246587768, -0.023431378092323797, 0.007396796383382229, -0.13552384965875175, -0.08137961375275941, 0.062342094384353564, 0.40723067706220606, -0.3097541090218727, -0.3243313860651786, 0.15397000630658245, -0.29567063988802506, -0.14967381332875387, 0.10433842567988577, -0.11423796340509244, 0.09086434968637323, 0.1338532593760514, 0.08670380101486873, 0.01861906963337757, -0.2208471086767, 0.353848656158099, -0.025086450673053772, 0.23924692384270804, 0.05314171725355633, 0.045126879383715686, -0.016461024877060665, 0.014195444533245618, 0.16372280497217728, -0.1473838490558418, 0.071254179645539, 0.26620554635719806, 0.20761763196223706, 0.24314300252878096, -0.43216209534262673, -0.18246688257400576, 0.19132013391870795, 0.14133501978685264, 0.04453917928013867, -0.015498727833423136, -0.23174155020060833, 0.14354686022035024, -0.11245483939609166, -0.0718005439004955, -0.04700823949932466, 0.03961894006123034, 0.035331947524937686, -0.2579431848540337, -0.03147370179884889, 0.09587599456393986, 0.03575927993345462, -0.012718784107481328, -0.1365351142319903, -0.007002438625237078, 0.07857105539708785, 0.02364637253000244, 0.07106075797941577, 0.07214563803517082, -0.14186735087325483, -0.19457912332838756, 0.406230314552988, 0.02556800281398752, -0.17676277561741097, 0.15696550099953507, -0.08530853145619792, -0.22959597713805818, 0.0972262752619101, 0.1418876379016745, 0.141249590542879, -0.16270428727605915, 0.11998866690947999, -0.10211459849699495, 0.1187427445325289, 0.1342288142101567, 0.08374611347693992, 0.12952103328713205, 0.1954272233624681, 0.17479086653695683, 0.19363665746216233, 0.0481695783758808, -0.04253649563015847, -0.2782883775535594, -0.08620838813609287, -0.20600240644109383, 0.011171553357179915, -0.10984986982543121, -0.2288863645929299, 0.47003054069982986, 0.11512687491001876, 0.20034431682878664, 0.0535929397002302, 0.2129442331203249, 0.08210118629938917, 0.06463805485642359, 0.1261517843310041, 0.14486228216313915, 0.12005248581441225, -0.01661055013432764, -0.1709117904054315, 0.1588164347562719, 0.10272900780055964]
|
1,803.06075
|
Formal Analysis of Non-functional Properties for a Cooperative
Automotive System
|
Modeling and analysis of nonfunctional requirements is crucial in automotive
systems. EAST-ADL is an architectural language dedicated to safety-critical
automotive system design. We have previously modified EAST-ADL to include
energy constraints and transformed energy-aware timed (ET) behaviors modeled in
SIMULINK/STATEFLOW into UPPAAL models amenable to formal verification. Previous
work is extended in this paper by including support for SIMULINK DESIGN
VERIFIER (SDV), i.e., the ET constraints are translated into proof objective
models that can be verified using SDV. Furthermore, probabilistic extension of
EAST-ADL constraints is defined and the semantics of the extended constraints
is translated into verifiable UPPAAL models with stochastic semantics for
formal verification. A set of mapping rules are proposed to facilitate the
guarantee of translation. Verification & Validation are performed on the
extended timing and energy constraints using SDV and UPPAAL-SMC. Our approach
is demonstrated on a cooperative automotive system case study.
|
cs.SE
|
modeling and analysis of nonfunctional requirements is crucial in automotive systems eastadl is an architectural language dedicated to safetycritical automotive system design we have previously modified eastadl to include energy constraints and transformed energyaware timed et behaviors modeled in simulinkstateflow into uppaal models amenable to formal verification previous work is extended in this paper by including support for simulink design verifier sdv ie the et constraints are translated into proof objective models that can be verified using sdv furthermore probabilistic extension of eastadl constraints is defined and the semantics of the extended constraints is translated into verifiable uppaal models with stochastic semantics for formal verification a set of mapping rules are proposed to facilitate the guarantee of translation verification validation are performed on the extended timing and energy constraints using sdv and uppaalsmc our approach is demonstrated on a cooperative automotive system case study
|
[['modeling', 'and', 'analysis', 'of', 'nonfunctional', 'requirements', 'is', 'crucial', 'in', 'automotive', 'systems', 'eastadl', 'is', 'an', 'architectural', 'language', 'dedicated', 'to', 'safetycritical', 'automotive', 'system', 'design', 'we', 'have', 'previously', 'modified', 'eastadl', 'to', 'include', 'energy', 'constraints', 'and', 'transformed', 'energyaware', 'timed', 'et', 'behaviors', 'modeled', 'in', 'simulinkstateflow', 'into', 'uppaal', 'models', 'amenable', 'to', 'formal', 'verification', 'previous', 'work', 'is', 'extended', 'in', 'this', 'paper', 'by', 'including', 'support', 'for', 'simulink', 'design', 'verifier', 'sdv', 'ie', 'the', 'et', 'constraints', 'are', 'translated', 'into', 'proof', 'objective', 'models', 'that', 'can', 'be', 'verified', 'using', 'sdv', 'furthermore', 'probabilistic', 'extension', 'of', 'eastadl', 'constraints', 'is', 'defined', 'and', 'the', 'semantics', 'of', 'the', 'extended', 'constraints', 'is', 'translated', 'into', 'verifiable', 'uppaal', 'models', 'with', 'stochastic', 'semantics', 'for', 'formal', 'verification', 'a', 'set', 'of', 'mapping', 'rules', 'are', 'proposed', 'to', 'facilitate', 'the', 'guarantee', 'of', 'translation', 'verification', 'validation', 'are', 'performed', 'on', 'the', 'extended', 'timing', 'and', 'energy', 'constraints', 'using', 'sdv', 'and', 'uppaalsmc', 'our', 'approach', 'is', 'demonstrated', 'on', 'a', 'cooperative', 'automotive', 'system', 'case', 'study']]
|
[-0.11861733953830683, -0.05324109581195242, -0.09095827135024592, 0.06245467217215466, -0.13621781981136236, -0.195518016983341, 0.030445634326800548, 0.3548204065947276, -0.2369745508735327, -0.34755577264715815, 0.14896847094334792, -0.2009067675551503, -0.10716550059927006, 0.2413074106071791, -0.11903959374709909, 0.1361474326824666, 0.06428067405229537, -0.035702656462995544, 0.004081541379693792, -0.20873446751647862, 0.25734792846843546, 0.032256813402960285, 0.2721326822130423, 0.043993196534251586, 0.059121980020588834, 0.01645107115877585, -0.035479484851950675, 0.027079250239492265, -0.09413192155246482, 0.13079207525192438, 0.3038043903913048, 0.25880416842927745, 0.25624276735147256, -0.46000901360659757, -0.21162221559400982, 0.06637838468870744, 0.1009460212579951, 0.030576633755117655, 0.007661074631161884, -0.36888690595353385, 0.10295339709975654, -0.23977745137461978, -0.03491636735917483, -0.11958708111261432, -0.017836181238332454, 0.04860334062606045, -0.2851357569577683, -0.06572680327291083, 0.12629726397184035, 0.09533879762360205, -0.09033456865775709, -0.0784578877323333, -0.03654382226361324, 0.09047286685866614, -0.024598640030793224, 0.0025454704187318888, 0.13524757001141552, -0.04129239580328835, -0.16554923457766157, 0.4115250718896277, -0.022529988751961758, -0.22194369163157213, 0.18021903832656486, 0.0368561623909045, -0.23897798365538214, 0.054964856534045085, 0.21392641452580896, 0.056195543804076604, -0.22650326403608131, 0.13921452887128302, -0.004376038543543675, 0.23532583643746977, 0.015855367407412915, 0.0021193280440962147, 0.20358089005539012, 0.2594094890777746, 0.0024282771191792563, 0.17026739119238402, 0.036448351232845906, -0.13579945643262667, -0.2746680561524247, -0.13317843505663202, -0.10032678488156914, -0.05831764969479991, -0.005634772121892537, -0.10102385984888922, 0.35338824861941653, 0.1990796387544833, 0.09328175392086753, 0.12336948330792236, 0.3609458172674446, 0.14034368318657975, 0.0759689461022693, 0.0413770744150194, 0.18588402504691556, 0.05973186774902691, 0.10786283309183393, -0.1675711446991449, 0.11772958761300995, 0.07017809501040675]
|
1,803.06076
|
Renewable Energy Integration in Distribution System -- Synchrophasor
Sensor based Big Data Analysis, Visualization, and System Operation
|
Due to the large volume of heterogeneous data provided by both the customer
and the grid side, a big data visualization platform is built to discover the
hidden useful knowledge for smart grid (SG) operation, control and situation
awareness. An open source cluster computing framework based on Apache Spark is
considering to discover the hidden knowledge of the bag-data. And the data is
transmitted with a Open System Interconnection (OSI) model to the data
visualization platform in a high-speed communication architecture. Google Earth
and global geographic information system (GIS) are used to design the
visualization platform and realize the result with the test bench.
The alternating direction method of multipliers (ADMM) is used to compute the
optimal power flow in distributed manner. The proposed network reconfiguration
is solved in parallel manner with the limited switches and the strong computing
capability.
Further more, a multi-timescale operation approach is modeled with a
three-phase distributed system, which consists the hourly scheduling at
substation level and the minutes power flow operation at feeder level. The
system cost with renewable generation is minimized at the substation level. The
given error distribution model of renewable generation is simulated with a
chance constraint, and the derived deterministic form is modeled with Gaussian
mixture model (GMM) with genetic algorithm-based expectationmaximization
(GAEM). The system cost is further reduced with the OPF in real-time (RT)
scheduling. The semidefinite programming (SDP) is used to relax the
nonconvexity of the three-phase unbalanced distribution system into a convex
problem, which make sure to achieve the global optimal result. In the parallel
manner, the ADMM is realizing getting the results in a short time.
|
cs.SY
|
due to the large volume of heterogeneous data provided by both the customer and the grid side a big data visualization platform is built to discover the hidden useful knowledge for smart grid sg operation control and situation awareness an open source cluster computing framework based on apache spark is considering to discover the hidden knowledge of the bagdata and the data is transmitted with a open system interconnection osi model to the data visualization platform in a highspeed communication architecture google earth and global geographic information system gis are used to design the visualization platform and realize the result with the test bench the alternating direction method of multipliers admm is used to compute the optimal power flow in distributed manner the proposed network reconfiguration is solved in parallel manner with the limited switches and the strong computing capability further more a multitimescale operation approach is modeled with a threephase distributed system which consists the hourly scheduling at substation level and the minutes power flow operation at feeder level the system cost with renewable generation is minimized at the substation level the given error distribution model of renewable generation is simulated with a chance constraint and the derived deterministic form is modeled with gaussian mixture model gmm with genetic algorithmbased expectationmaximization gaem the system cost is further reduced with the opf in realtime rt scheduling the semidefinite programming sdp is used to relax the nonconvexity of the threephase unbalanced distribution system into a convex problem which make sure to achieve the global optimal result in the parallel manner the admm is realizing getting the results in a short time
|
[['due', 'to', 'the', 'large', 'volume', 'of', 'heterogeneous', 'data', 'provided', 'by', 'both', 'the', 'customer', 'and', 'the', 'grid', 'side', 'a', 'big', 'data', 'visualization', 'platform', 'is', 'built', 'to', 'discover', 'the', 'hidden', 'useful', 'knowledge', 'for', 'smart', 'grid', 'sg', 'operation', 'control', 'and', 'situation', 'awareness', 'an', 'open', 'source', 'cluster', 'computing', 'framework', 'based', 'on', 'apache', 'spark', 'is', 'considering', 'to', 'discover', 'the', 'hidden', 'knowledge', 'of', 'the', 'bagdata', 'and', 'the', 'data', 'is', 'transmitted', 'with', 'a', 'open', 'system', 'interconnection', 'osi', 'model', 'to', 'the', 'data', 'visualization', 'platform', 'in', 'a', 'highspeed', 'communication', 'architecture', 'google', 'earth', 'and', 'global', 'geographic', 'information', 'system', 'gis', 'are', 'used', 'to', 'design', 'the', 'visualization', 'platform', 'and', 'realize', 'the', 'result', 'with', 'the', 'test', 'bench', 'the', 'alternating', 'direction', 'method', 'of', 'multipliers', 'admm', 'is', 'used', 'to', 'compute', 'the', 'optimal', 'power', 'flow', 'in', 'distributed', 'manner', 'the', 'proposed', 'network', 'reconfiguration', 'is', 'solved', 'in', 'parallel', 'manner', 'with', 'the', 'limited', 'switches', 'and', 'the', 'strong', 'computing', 'capability', 'further', 'more', 'a', 'multitimescale', 'operation', 'approach', 'is', 'modeled', 'with', 'a', 'threephase', 'distributed', 'system', 'which', 'consists', 'the', 'hourly', 'scheduling', 'at', 'substation', 'level', 'and', 'the', 'minutes', 'power', 'flow', 'operation', 'at', 'feeder', 'level', 'the', 'system', 'cost', 'with', 'renewable', 'generation', 'is', 'minimized', 'at', 'the', 'substation', 'level', 'the', 'given', 'error', 'distribution', 'model', 'of', 'renewable', 'generation', 'is', 'simulated', 'with', 'a', 'chance', 'constraint', 'and', 'the', 'derived', 'deterministic', 'form', 'is', 'modeled', 'with', 'gaussian', 'mixture', 'model', 'gmm', 'with', 'genetic', 'algorithmbased', 'expectationmaximization', 'gaem', 'the', 'system', 'cost', 'is', 'further', 'reduced', 'with', 'the', 'opf', 'in', 'realtime', 'rt', 'scheduling', 'the', 'semidefinite', 'programming', 'sdp', 'is', 'used', 'to', 'relax', 'the', 'nonconvexity', 'of', 'the', 'threephase', 'unbalanced', 'distribution', 'system', 'into', 'a', 'convex', 'problem', 'which', 'make', 'sure', 'to', 'achieve', 'the', 'global', 'optimal', 'result', 'in', 'the', 'parallel', 'manner', 'the', 'admm', 'is', 'realizing', 'getting', 'the', 'results', 'in', 'a', 'short', 'time']]
|
[-0.16004281680911098, 0.026814187772247554, -0.06079201286818499, 0.018206023305320916, -0.07974254380244372, -0.1966540027060546, 0.06835944806099897, 0.38098337420665507, -0.3334985021328025, -0.3483147132523191, 0.12599624449703425, -0.25591019031751566, -0.10365559540709841, 0.19292718982419568, -0.07479187401025486, 0.10093881660349556, 0.07591540895145275, 0.0021904909378612663, -0.00873496948390393, -0.24691856541425866, 0.237955070535979, 0.10096364548263043, 0.357027313460026, 0.010959341478752974, 0.11630120435243112, -0.004704304748395486, -0.018548857992225668, -0.010256771805762215, -0.035971189133211304, 0.1588146063949176, 0.2849970848730473, 0.1809216667029228, 0.3018789955400931, -0.44688093639673915, -0.18451813027460767, 0.07187248155459025, 0.08246964287297773, 0.04558283372420762, -0.04754280109192399, -0.272677160064523, 0.10680862051198509, -0.18454079392866524, -0.10355466964034322, -0.051328131902976824, -0.0503660653416841, 0.025525435603765856, -0.31500969583224225, 0.001139905585632868, 0.019587769501263955, 0.05268127010412403, -0.05630948372470187, -0.06691264897565802, -0.010513934687322089, 0.13595913998685333, 0.00039456524658572877, 0.04063162338733586, 0.15741657669814094, -0.08116282866190452, -0.11821772027656492, 0.38887028896020476, -0.015782838355864522, -0.20217370441350252, 0.13917230193350297, -0.049703164597792525, -0.11387830613000291, 0.10922847793840651, 0.23780343055819794, 0.0686867105684012, -0.21162482745486744, 0.04606198322865417, -0.013128194572237222, 0.18408779846678086, -0.0014166038599796593, -0.029149267593148485, 0.1846042024988139, 0.2644789351381487, 0.15857037200400026, 0.16786568431351367, -0.09813803160100926, -0.13341698019483836, -0.22378266218149645, -0.11924009061759032, -0.20527355600002486, -0.013357696098226832, -0.10188355846043828, -0.14274019830331985, 0.3922370738087486, 0.15935230052568908, 0.13180630185481496, 0.0780162255100753, 0.3888541981160863, 0.12816697093414894, 0.07932610500346758, 0.15923464986662478, 0.14417540869126513, 0.06014207697911327, 0.1891369845886687, -0.2236843571664571, 0.08719619113687815, 0.03658318574064231]
|
1,803.06077
|
Real-time Detection, Tracking, and Classification of Moving and
Stationary Objects using Multiple Fisheye Images
|
The ability to detect pedestrians and other moving objects is crucial for an
autonomous vehicle. This must be done in real-time with minimum system
overhead. This paper discusses the implementation of a surround view system to
identify moving as well as static objects that are close to the ego vehicle.
The algorithm works on 4 views captured by fisheye cameras which are merged
into a single frame. The moving object detection and tracking solution uses
minimal system overhead to isolate regions of interest (ROIs) containing moving
objects. These ROIs are then analyzed using a deep neural network (DNN) to
categorize the moving object. With deployment and testing on a real car in
urban environments, we have demonstrated the practical feasibility of the
solution. The video demos of our algorithm have been uploaded to Youtube:
https://youtu.be/vpoCfC724iA, https://youtu.be/2X4aqH2bMBs
|
cs.CV
|
the ability to detect pedestrians and other moving objects is crucial for an autonomous vehicle this must be done in realtime with minimum system overhead this paper discusses the implementation of a surround view system to identify moving as well as static objects that are close to the ego vehicle the algorithm works on 4 views captured by fisheye cameras which are merged into a single frame the moving object detection and tracking solution uses minimal system overhead to isolate regions of interest rois containing moving objects these rois are then analyzed using a deep neural network dnn to categorize the moving object with deployment and testing on a real car in urban environments we have demonstrated the practical feasibility of the solution the video demos of our algorithm have been uploaded to youtube httpsyoutubevpocfc724ia httpsyoutube2x4aqh2bmbs
|
[['the', 'ability', 'to', 'detect', 'pedestrians', 'and', 'other', 'moving', 'objects', 'is', 'crucial', 'for', 'an', 'autonomous', 'vehicle', 'this', 'must', 'be', 'done', 'in', 'realtime', 'with', 'minimum', 'system', 'overhead', 'this', 'paper', 'discusses', 'the', 'implementation', 'of', 'a', 'surround', 'view', 'system', 'to', 'identify', 'moving', 'as', 'well', 'as', 'static', 'objects', 'that', 'are', 'close', 'to', 'the', 'ego', 'vehicle', 'the', 'algorithm', 'works', 'on', '4', 'views', 'captured', 'by', 'fisheye', 'cameras', 'which', 'are', 'merged', 'into', 'a', 'single', 'frame', 'the', 'moving', 'object', 'detection', 'and', 'tracking', 'solution', 'uses', 'minimal', 'system', 'overhead', 'to', 'isolate', 'regions', 'of', 'interest', 'rois', 'containing', 'moving', 'objects', 'these', 'rois', 'are', 'then', 'analyzed', 'using', 'a', 'deep', 'neural', 'network', 'dnn', 'to', 'categorize', 'the', 'moving', 'object', 'with', 'deployment', 'and', 'testing', 'on', 'a', 'real', 'car', 'in', 'urban', 'environments', 'we', 'have', 'demonstrated', 'the', 'practical', 'feasibility', 'of', 'the', 'solution', 'the', 'video', 'demos', 'of', 'our', 'algorithm', 'have', 'been', 'uploaded', 'to', 'youtube', 'httpsyoutubevpocfc724ia', 'httpsyoutube2x4aqh2bmbs']]
|
[-0.11924836341375937, -0.0006094067191328061, -0.06285633149673231, -6.292582013463574e-05, -0.08287737850940773, -0.1838791482915073, 0.02185425034844935, 0.4553748444921629, -0.2184814911634564, -0.370025689512102, 0.11163754738978486, -0.28787490198694504, -0.14272030948577866, 0.17726476653305284, -0.18419193252990607, 0.08843940260486483, 0.10577249140548173, 0.07652912792270142, 0.004866243758822666, -0.260031817077812, 0.2705245795783453, 0.020881537387778273, 0.26247902099067455, -0.025605163578666858, 0.15180935758277217, -0.013704656823121233, -0.03926849851051151, 0.05006449749092085, -0.00708529366548008, 0.13323491251568742, 0.2870161313643512, 0.19646896519037937, 0.276767785393341, -0.4224303644011492, -0.22822422981818222, 0.06531405264386601, 0.1762835102419911, 0.07476139084328272, -0.058363483779118465, -0.4324985570343795, 0.14305119679657263, -0.18500966716161582, -0.08980116392346794, -0.061998728078915114, 0.03206987565716923, 0.03019960869604082, -0.22048575044722546, -0.03591692350707503, -0.020233282651717484, 0.06116736734828064, -0.07393018517351306, -0.0334288780030155, 0.02901490276971304, 0.23518724714009676, 0.032485858725562845, 0.051285700938567075, 0.21199953787501402, -0.17020930492305267, -0.11274313199014138, 0.41389250666347904, 0.02522133349496593, -0.21714042975747985, 0.23789164523329975, -0.04139414517410489, -0.10789067042407705, 0.13310590865083538, 0.27168484533782494, 0.15254557804802238, -0.19120745703233963, -0.02294955648431457, -0.06680017072401608, 0.1590877083467264, 0.06692223731470086, 0.004651482053684877, 0.23740045223802106, 0.23877783106473177, 0.07503699870960814, 0.15146753418132483, -0.1839969537200045, -0.08113035869284241, -0.23775993343164672, -0.14530721539805241, -0.16977656948894485, -0.0472764988332542, -0.061498366379367585, -0.13293897645520186, 0.364705206652575, 0.21197378703518144, 0.18546673368989253, 0.057937007982096174, 0.37072593955072897, 0.0266527398028967, 0.1071516834546937, 0.10514366535692295, 0.1964955080609852, -0.007649299176062332, 0.16010184960662208, -0.1458198715682461, 0.046385750410828125, 0.06728887967695829]
|
1,803.06078
|
Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust
Algorithm
|
We study the problem of decomposing a volume bounded by a smooth surface into
a collection of Voronoi cells. Unlike the dual problem of conforming Delaunay
meshing, a principled solution to this problem for generic smooth surfaces
remained elusive. VoroCrust leverages ideas from $\alpha$-shapes and the power
crust algorithm to produce unweighted Voronoi cells conforming to the surface,
yielding the first provably-correct algorithm for this problem. Given an
$\epsilon$-sample on the bounding surface, with a weak $\sigma$-sparsity
condition, we work with the balls of radius $\delta$ times the local feature
size centered at each sample. The corners of this union of balls are the
Voronoi sites, on both sides of the surface. The facets common to cells on
opposite sides reconstruct the surface. For appropriate values of $\epsilon$,
$\sigma$ and $\delta$, we prove that the surface reconstruction is isotopic to
the bounding surface. With the surface protected, the enclosed volume can be
further decomposed into an isotopic volume mesh of fat Voronoi cells by
generating a bounded number of sites in its interior. Compared to
state-of-the-art methods based on clipping, VoroCrust cells are full Voronoi
cells, with convexity and fatness guarantees. Compared to the power crust
algorithm, VoroCrust cells are not filtered, are unweighted, and offer greater
flexibility in meshing the enclosed volume by either structured grids or random
samples.
|
cs.CG
|
we study the problem of decomposing a volume bounded by a smooth surface into a collection of voronoi cells unlike the dual problem of conforming delaunay meshing a principled solution to this problem for generic smooth surfaces remained elusive vorocrust leverages ideas from alphashapes and the power crust algorithm to produce unweighted voronoi cells conforming to the surface yielding the first provablycorrect algorithm for this problem given an epsilonsample on the bounding surface with a weak sigmasparsity condition we work with the balls of radius delta times the local feature size centered at each sample the corners of this union of balls are the voronoi sites on both sides of the surface the facets common to cells on opposite sides reconstruct the surface for appropriate values of epsilon sigma and delta we prove that the surface reconstruction is isotopic to the bounding surface with the surface protected the enclosed volume can be further decomposed into an isotopic volume mesh of fat voronoi cells by generating a bounded number of sites in its interior compared to stateoftheart methods based on clipping vorocrust cells are full voronoi cells with convexity and fatness guarantees compared to the power crust algorithm vorocrust cells are not filtered are unweighted and offer greater flexibility in meshing the enclosed volume by either structured grids or random samples
|
[['we', 'study', 'the', 'problem', 'of', 'decomposing', 'a', 'volume', 'bounded', 'by', 'a', 'smooth', 'surface', 'into', 'a', 'collection', 'of', 'voronoi', 'cells', 'unlike', 'the', 'dual', 'problem', 'of', 'conforming', 'delaunay', 'meshing', 'a', 'principled', 'solution', 'to', 'this', 'problem', 'for', 'generic', 'smooth', 'surfaces', 'remained', 'elusive', 'vorocrust', 'leverages', 'ideas', 'from', 'alphashapes', 'and', 'the', 'power', 'crust', 'algorithm', 'to', 'produce', 'unweighted', 'voronoi', 'cells', 'conforming', 'to', 'the', 'surface', 'yielding', 'the', 'first', 'provablycorrect', 'algorithm', 'for', 'this', 'problem', 'given', 'an', 'epsilonsample', 'on', 'the', 'bounding', 'surface', 'with', 'a', 'weak', 'sigmasparsity', 'condition', 'we', 'work', 'with', 'the', 'balls', 'of', 'radius', 'delta', 'times', 'the', 'local', 'feature', 'size', 'centered', 'at', 'each', 'sample', 'the', 'corners', 'of', 'this', 'union', 'of', 'balls', 'are', 'the', 'voronoi', 'sites', 'on', 'both', 'sides', 'of', 'the', 'surface', 'the', 'facets', 'common', 'to', 'cells', 'on', 'opposite', 'sides', 'reconstruct', 'the', 'surface', 'for', 'appropriate', 'values', 'of', 'epsilon', 'sigma', 'and', 'delta', 'we', 'prove', 'that', 'the', 'surface', 'reconstruction', 'is', 'isotopic', 'to', 'the', 'bounding', 'surface', 'with', 'the', 'surface', 'protected', 'the', 'enclosed', 'volume', 'can', 'be', 'further', 'decomposed', 'into', 'an', 'isotopic', 'volume', 'mesh', 'of', 'fat', 'voronoi', 'cells', 'by', 'generating', 'a', 'bounded', 'number', 'of', 'sites', 'in', 'its', 'interior', 'compared', 'to', 'stateoftheart', 'methods', 'based', 'on', 'clipping', 'vorocrust', 'cells', 'are', 'full', 'voronoi', 'cells', 'with', 'convexity', 'and', 'fatness', 'guarantees', 'compared', 'to', 'the', 'power', 'crust', 'algorithm', 'vorocrust', 'cells', 'are', 'not', 'filtered', 'are', 'unweighted', 'and', 'offer', 'greater', 'flexibility', 'in', 'meshing', 'the', 'enclosed', 'volume', 'by', 'either', 'structured', 'grids', 'or', 'random', 'samples']]
|
[-0.0784118785026244, 0.07888700115190575, -0.05073728148159016, 0.021311084704618868, -0.057474789803488815, -0.11200065225781446, 0.07976801938232068, 0.3763953157478448, -0.2774186542518266, -0.26298245673341286, 0.08963794359155512, -0.28530346552538044, -0.10945724326008589, 0.16733615347205602, -0.16452707589492885, 0.021653215309357755, 0.044910776806961095, 0.008761425494054042, -0.0650410956581371, -0.2626570816089852, 0.28260538314358086, -0.005427576815111375, 0.2724592946758152, 0.04247313883762226, 0.08923797246812065, -0.03936351114379909, -0.01142989511712702, 0.11348683424635765, -0.15805922000933414, 0.1771851062523404, 0.18861757880803026, 0.10428259742271087, 0.23065505854554746, -0.48201533766668864, -0.2013521619779784, 0.13540805755140378, 0.1341667936107148, 0.057140332644531895, -0.039122468187396814, -0.2368589542782652, 0.13390751296457826, -0.06355901180826333, -0.13826798585696368, -0.013090602446928484, -0.009989375022128908, 0.04538438737807889, -0.2589171540372313, 0.05187056768886369, 0.05819952261736702, 0.043405116487661835, -0.06863029455870749, -0.1548903073491785, -0.05136594852035301, 0.13461228027414326, -0.01236785431883785, 0.05696160237223696, 0.13296996139485492, -0.0795268663472214, -0.04711445974540649, 0.3656340420028246, 0.01432549548463537, -0.26443470258440893, 0.16110656951840352, -0.15035877818051607, -0.056556221586865706, 0.19516931655560407, 0.20415476052338308, 0.13102765841470443, -0.10974020921462856, 0.10496906739971472, -0.04371698784861936, 0.14790217401518554, 0.12313784171886948, -0.028221030922504057, 0.19194480302581274, 0.1964153788744583, 0.1464146061617787, 0.12957441611343637, -0.11712168715039797, -0.056576245462248494, -0.285027369491568, -0.15615215721975909, -0.21562095301721348, -0.014892225851101368, -0.15858552881934115, -0.25307411032754484, 0.3595726808416657, 0.02950062147991031, 0.2107529933073071, 0.09040051886230843, 0.3252764916081631, 0.04133240118571514, 0.08239367053792769, 0.09579537170426493, 0.14111711712524191, 0.11870697420731255, 0.022359418166361306, -0.20650099420390272, 0.041670850920277315, 0.1652680628535438]
|
1,803.06079
|
Electron hole instability in linearly sub-critical plasmas
|
Electron holes (EH) are highly stable non-linear structures met omnipresently
in driven collision-less hot plasmas. A mechanism destabilizing small
perturbations into holes is essential for an often witnessed but less
understood sub-critically driven intermittent plasma turbulence. In this paper
we show how a tiny, eddy-like, non-topological seed fluctuation can trigger an
unstable evolution deep in the linearly damped region, a process being
controlled by the trapping non-linearity and hence being beyond the realm of
the Landau scenario. After a (transient) transition phase modes of the
privileged spectrum of cnoidal EH are excited which in the present case consist
of a solitary electron hole (SEH), two counter-propagating "Langmuir" modes
(plasma oscillation), and an ion acoustic mode. A quantitative explanation
involves employing non-linear eigen-modes, yielding a non-linear dispersion
relation with a forbidden regime and the negative energy character of the SEH,
properties being inherent in Schamel's model of undamped Vlasov-Poisson
structures identified here as lowest order trapped particle equilibria. An
important role in the final adaption of nonlinear plasma eigenmodes is played
by a deterministic response of trapped electrons which facilitates transfer of
energy from electron thermal energy to an ion acoustic non-uniformity,
accelerating the SEH and positioning it into the right place assigned by the
theory.
|
physics.plasm-ph
|
electron holes eh are highly stable nonlinear structures met omnipresently in driven collisionless hot plasmas a mechanism destabilizing small perturbations into holes is essential for an often witnessed but less understood subcritically driven intermittent plasma turbulence in this paper we show how a tiny eddylike nontopological seed fluctuation can trigger an unstable evolution deep in the linearly damped region a process being controlled by the trapping nonlinearity and hence being beyond the realm of the landau scenario after a transient transition phase modes of the privileged spectrum of cnoidal eh are excited which in the present case consist of a solitary electron hole seh two counterpropagating langmuir modes plasma oscillation and an ion acoustic mode a quantitative explanation involves employing nonlinear eigenmodes yielding a nonlinear dispersion relation with a forbidden regime and the negative energy character of the seh properties being inherent in schamels model of undamped vlasovpoisson structures identified here as lowest order trapped particle equilibria an important role in the final adaption of nonlinear plasma eigenmodes is played by a deterministic response of trapped electrons which facilitates transfer of energy from electron thermal energy to an ion acoustic nonuniformity accelerating the seh and positioning it into the right place assigned by the theory
|
[['electron', 'holes', 'eh', 'are', 'highly', 'stable', 'nonlinear', 'structures', 'met', 'omnipresently', 'in', 'driven', 'collisionless', 'hot', 'plasmas', 'a', 'mechanism', 'destabilizing', 'small', 'perturbations', 'into', 'holes', 'is', 'essential', 'for', 'an', 'often', 'witnessed', 'but', 'less', 'understood', 'subcritically', 'driven', 'intermittent', 'plasma', 'turbulence', 'in', 'this', 'paper', 'we', 'show', 'how', 'a', 'tiny', 'eddylike', 'nontopological', 'seed', 'fluctuation', 'can', 'trigger', 'an', 'unstable', 'evolution', 'deep', 'in', 'the', 'linearly', 'damped', 'region', 'a', 'process', 'being', 'controlled', 'by', 'the', 'trapping', 'nonlinearity', 'and', 'hence', 'being', 'beyond', 'the', 'realm', 'of', 'the', 'landau', 'scenario', 'after', 'a', 'transient', 'transition', 'phase', 'modes', 'of', 'the', 'privileged', 'spectrum', 'of', 'cnoidal', 'eh', 'are', 'excited', 'which', 'in', 'the', 'present', 'case', 'consist', 'of', 'a', 'solitary', 'electron', 'hole', 'seh', 'two', 'counterpropagating', 'langmuir', 'modes', 'plasma', 'oscillation', 'and', 'an', 'ion', 'acoustic', 'mode', 'a', 'quantitative', 'explanation', 'involves', 'employing', 'nonlinear', 'eigenmodes', 'yielding', 'a', 'nonlinear', 'dispersion', 'relation', 'with', 'a', 'forbidden', 'regime', 'and', 'the', 'negative', 'energy', 'character', 'of', 'the', 'seh', 'properties', 'being', 'inherent', 'in', 'schamels', 'model', 'of', 'undamped', 'vlasovpoisson', 'structures', 'identified', 'here', 'as', 'lowest', 'order', 'trapped', 'particle', 'equilibria', 'an', 'important', 'role', 'in', 'the', 'final', 'adaption', 'of', 'nonlinear', 'plasma', 'eigenmodes', 'is', 'played', 'by', 'a', 'deterministic', 'response', 'of', 'trapped', 'electrons', 'which', 'facilitates', 'transfer', 'of', 'energy', 'from', 'electron', 'thermal', 'energy', 'to', 'an', 'ion', 'acoustic', 'nonuniformity', 'accelerating', 'the', 'seh', 'and', 'positioning', 'it', 'into', 'the', 'right', 'place', 'assigned', 'by', 'the', 'theory']]
|
[-0.1718884092271603, 0.25081918552482624, -0.04076339967613076, 0.08174339594442079, -0.02650516214115279, -0.15207819992176308, -0.0186905215959996, 0.31290932544713534, -0.26127595735686315, -0.2445709085484205, 0.025123351691703637, -0.2721221805618975, -0.09861349483282109, 0.18077113301512726, 0.03127368830882467, 0.0280330625885703, 0.03450716983554472, -0.023691519743905133, 0.03855857754979521, -0.11993434846291108, 0.2995638285598401, 0.1309157385445817, 0.2903946683434724, 0.009785925506114079, 0.09384708632164511, -0.04065945942592555, 0.0370078903437693, 0.012655191261119443, -0.11230896534637624, 0.038656918375564765, 0.23010485014197785, 0.010649058189050391, 0.31039990421632313, -0.48782391775527906, -0.24941999569886222, 0.04046218420993628, 0.22643278852957324, 0.13359572958049773, -0.10360248428909911, -0.26630311765652975, 0.0066303869725429804, -0.1556646175499893, -0.1570841373366492, -0.03535273776669514, 0.02884402759074981, 0.006679973514576263, -0.26856852671087905, 0.13562521993256005, 0.12014757067979007, 0.005001611677296643, -0.10829263721166059, -0.016865833189907333, -0.06964809940485604, 0.048259871121807935, 0.04254100683074688, -0.01265092534609506, 0.15602256355834712, -0.143182621644569, -0.07365819205127982, 0.37799924943513546, -0.055004422489227954, -0.16342089252014244, 0.18759445956990747, -0.15358949289370438, -0.04798825418409144, 0.2109163628565377, 0.1704908224428302, 0.09818702277364989, -0.11241512381003739, 0.04895422602325189, 0.008910928508771464, 0.1691005868985839, 0.11827919523465663, 0.0771211448017728, 0.28830151408543725, 0.19356105641606425, 0.03611494780270374, 0.12182888681120056, -0.058246443171990035, -0.07014349016895417, -0.27457286582644935, -0.09123296333302565, -0.148669873293589, 0.03881858325492547, -0.014915076687443414, -0.2011179675192118, 0.42714837338922207, 0.07257132746939882, 0.15981729585147494, -0.0878263988619294, 0.29377768831196377, 0.16182713023802092, -0.007769888512941601, 0.09178896170921551, 0.30265007628669294, 0.1495906131220477, 0.12530813675048058, -0.2763606780432302, 0.004312783527862409, 0.05591353246932987]
|
1,803.0608
|
K-Theory of Hilbert Schemes as a Formal Quantum Field Theory
|
We define a notion of formal quantum field theory and associate a formal
quantum field theory to K-theoretical intersection theories on Hilbert schemes
of points on algebraic surfaces. This enables us to find an effective way to
compute K-theoretical intersection theories on Hilbert schemes via a connection
to Macdonald polynomials and vertex operators.
|
math.AG math-ph math.AT math.MP
|
we define a notion of formal quantum field theory and associate a formal quantum field theory to ktheoretical intersection theories on hilbert schemes of points on algebraic surfaces this enables us to find an effective way to compute ktheoretical intersection theories on hilbert schemes via a connection to macdonald polynomials and vertex operators
|
[['we', 'define', 'a', 'notion', 'of', 'formal', 'quantum', 'field', 'theory', 'and', 'associate', 'a', 'formal', 'quantum', 'field', 'theory', 'to', 'ktheoretical', 'intersection', 'theories', 'on', 'hilbert', 'schemes', 'of', 'points', 'on', 'algebraic', 'surfaces', 'this', 'enables', 'us', 'to', 'find', 'an', 'effective', 'way', 'to', 'compute', 'ktheoretical', 'intersection', 'theories', 'on', 'hilbert', 'schemes', 'via', 'a', 'connection', 'to', 'macdonald', 'polynomials', 'and', 'vertex', 'operators']]
|
[-0.1990389340855884, 0.039635929553868375, -0.19760628831836413, 0.09983658085726553, -0.13461133824081495, -0.1723078241273058, 0.07702824656570435, 0.29694625041184, -0.310997872701231, -0.17192625963647482, 0.0007792542741264937, -0.24066874328649268, -0.18297890823264168, 0.1761703292118772, -0.17695894206540203, 0.025218153969859176, -0.019177101877570716, 0.05770317057393632, -0.13876261066575096, -0.28791935534550334, 0.43794948764075087, 0.0016761235673121125, 0.25865231433285857, 0.06819116603583097, 0.14101756358835496, 0.028001002273258736, -0.020832720247782627, -0.001102048675266077, -0.1793583177100375, 0.2047876869591902, 0.3361664440412566, 0.10515734485684419, 0.20121646340374114, -0.4685333136398837, -0.15042035643643928, 0.11853371285569836, 0.1199115442797401, 0.08531203546192286, 0.04510308833977313, -0.2521185164146547, 0.044833421285422344, -0.21873004270612068, -0.16673482560886527, -0.17850099711345052, 0.011712295473289659, -0.08252439827148644, -0.2486673469286201, -0.11234324404646924, -0.002720921353067992, 0.16983695656834347, -0.011510770416484689, 0.011258113850347416, 0.025338399654500326, 0.02784700488741949, -0.05075663166507235, 0.06442491931594768, 0.11093286130542182, -0.09963718604929042, -0.23255644255440752, 0.3444514200442804, -0.021438473271083017, -0.24034783896058798, 0.1821476013733531, -0.10555068515944031, -0.15266755012408742, 0.038419865844946985, 0.14178574542989428, 0.16485863403891618, -0.045638286034172436, 0.2196109815531428, -0.05749343469176652, 0.06564798715682525, 0.07078060149303023, 0.062020790007598, 0.18955562442962853, -0.03896581854249509, 0.11859234649125698, 0.11444509913266268, 0.06158427698625568, -0.2017289256009291, -0.3640309254515846, -0.21210961772199227, -0.08870589886879865, 0.12861093499188153, -0.128458925416882, -0.2496979044627328, 0.4163686793367818, 0.1285287228254777, 0.17055249584944182, 0.10078616951644984, 0.2142906209831741, 0.14348146022420447, 0.0707257292321268, 0.0029390629662095374, 0.09948510638842324, 0.3022726311365951, 0.015793689219105355, -0.15384333810487869, -0.08316969562251612, 0.30588543935204454]
|
1,803.06081
|
Two-Qubit Stabilizer Circuits with Recovery I: Existence
|
Understanding how a stabilizer circuit responds to different input is
important to formulating an effective strategy for resource management. In this
paper, we further investigate the many ways of using stabilizer operations to
generate a single qubit output from a two-qubit state. In particular, by
restricting the input to certain product states, we discover probabilistic
operations capable of transforming stabilizer circuit outputs back into
stabilizer circuit inputs. These secondary operations are ideally suited for
recovery purposes and require only one extra resource ancilla to succeed. As a
result of reusing qubits in this manner, we present an alternative to the
original state preparation process that can lower the overall costs of
executing any two-qubit stabilizer procedure involving non-stabilizer
resources.
|
quant-ph
|
understanding how a stabilizer circuit responds to different input is important to formulating an effective strategy for resource management in this paper we further investigate the many ways of using stabilizer operations to generate a single qubit output from a twoqubit state in particular by restricting the input to certain product states we discover probabilistic operations capable of transforming stabilizer circuit outputs back into stabilizer circuit inputs these secondary operations are ideally suited for recovery purposes and require only one extra resource ancilla to succeed as a result of reusing qubits in this manner we present an alternative to the original state preparation process that can lower the overall costs of executing any twoqubit stabilizer procedure involving nonstabilizer resources
|
[['understanding', 'how', 'a', 'stabilizer', 'circuit', 'responds', 'to', 'different', 'input', 'is', 'important', 'to', 'formulating', 'an', 'effective', 'strategy', 'for', 'resource', 'management', 'in', 'this', 'paper', 'we', 'further', 'investigate', 'the', 'many', 'ways', 'of', 'using', 'stabilizer', 'operations', 'to', 'generate', 'a', 'single', 'qubit', 'output', 'from', 'a', 'twoqubit', 'state', 'in', 'particular', 'by', 'restricting', 'the', 'input', 'to', 'certain', 'product', 'states', 'we', 'discover', 'probabilistic', 'operations', 'capable', 'of', 'transforming', 'stabilizer', 'circuit', 'outputs', 'back', 'into', 'stabilizer', 'circuit', 'inputs', 'these', 'secondary', 'operations', 'are', 'ideally', 'suited', 'for', 'recovery', 'purposes', 'and', 'require', 'only', 'one', 'extra', 'resource', 'ancilla', 'to', 'succeed', 'as', 'a', 'result', 'of', 'reusing', 'qubits', 'in', 'this', 'manner', 'we', 'present', 'an', 'alternative', 'to', 'the', 'original', 'state', 'preparation', 'process', 'that', 'can', 'lower', 'the', 'overall', 'costs', 'of', 'executing', 'any', 'twoqubit', 'stabilizer', 'procedure', 'involving', 'nonstabilizer', 'resources']]
|
[-0.12772978888628925, 0.1538922490511469, -0.03441755846142769, 0.03577230444739334, -0.035244024949570914, -0.26037665221746226, 0.11901353036558271, 0.3769331127092117, -0.28622552107612625, -0.3401907580364652, 0.0675505775774383, -0.17785851439429806, -0.11141463276781455, 0.21733865330285324, -0.14639703618722552, 0.12873475489054, 0.10481128018709417, 0.024480372859055504, -0.06760442014020562, -0.28003161552385625, 0.29930857751135004, 0.06710931915445488, 0.28055347769473243, -0.06816402029739145, 0.06693907545002944, 0.0328808119911857, 0.01477746814445342, -0.07616322711031853, -0.032806245852547926, 0.13418878198693263, 0.3405928479002773, 0.22016342139231557, 0.25772835804196464, -0.5101347617773699, -0.17031461145423604, 0.1109369341949267, 0.11670130890786272, 0.20761824003225113, -0.016526339383905426, -0.2685625648063396, 0.03977558357218484, -0.207707314286381, -0.04779872121758947, -0.15506199851412983, 0.0009585802732896404, -0.10074234017055529, -0.29330185436087997, -0.04057937383993153, 0.08938705163593051, 0.0012800412315155279, -0.003233059070722646, -0.07001895335416834, 0.019434932053887417, 0.1911499188712039, -0.09308964864594448, 0.016349019658822222, 0.20502592900674008, -0.11888949709754641, -0.16771556137466193, 0.33653321330036434, 0.00030571937623645077, -0.23794989461595772, 0.1527366336482037, -0.020744784414267338, -0.1539039227861066, 0.054690629588205274, 0.14295928886144602, 0.05298059904838309, -0.17376179840540937, 0.05647861344315221, 0.01122051093946485, 0.2217690590030451, 0.04618696300234614, 0.12476009966711663, 0.14633877324957809, 0.138412164623493, 0.12413228030009352, 0.25265130168609634, -0.0020273057917551676, -0.06288984860587052, -0.33303340852745816, -0.19401587786332963, -0.18391068574401134, 0.1055204056520328, -0.02339598579914798, -0.12475108916033842, 0.43658514285632294, 0.14544174304142, 0.14822503513149807, 0.04215333203025976, 0.36176722128914685, 0.08705928180065445, 0.08001197726385542, 0.11249496970137879, 0.13198957900847347, 0.10855215340030983, 0.015560754316569376, -0.2248992502998498, 0.0861614914806638, 0.03247840304960724]
|
1,803.06082
|
Load Balancing for 5G Ultra-Dense Networks using Device-to-Device
Communications
|
Load balancing is an effective approach to address the spatial-temporal
fluctuation problem of mobile data traffic for cellular networks. The existing
schemes that focus on channel borrowing from neighboring cells cannot be
directly applied to future 5G wireless networks, because the neighboring cells
will reuse the same spectrum band in 5G systems. In this paper, we consider an
orthogonal frequency division multiple access~(OFDMA) ultra-dense small cell
network, where Device-to-Device~(D2D) communication is advocated to facilitate
load balancing without extra spectrum. Specifically, the data traffic can be
effectively offloaded from a congested small cell to other underutilized small
cells by D2D communications. The problem is naturally formulated as a joint
resource allocation and D2D routing problem that maximizes the system sum-rate.
To efficiently solve the problem, we decouple the problem into a resource
allocation subproblem and a D2D routing subproblem. The two subproblems are
solved iteratively as a monotonic optimization problem and a complementary
geometric programming problem, respectively. Simulation results show that the
data sum-rate in the neighboring small cells increases 20\% on average by
offloading the data traffic in the congested small cell to the neighboring
small cell base stations~(SBSs).
|
cs.IT math.IT
|
load balancing is an effective approach to address the spatialtemporal fluctuation problem of mobile data traffic for cellular networks the existing schemes that focus on channel borrowing from neighboring cells cannot be directly applied to future 5g wireless networks because the neighboring cells will reuse the same spectrum band in 5g systems in this paper we consider an orthogonal frequency division multiple accessofdma ultradense small cell network where devicetodeviced2d communication is advocated to facilitate load balancing without extra spectrum specifically the data traffic can be effectively offloaded from a congested small cell to other underutilized small cells by d2d communications the problem is naturally formulated as a joint resource allocation and d2d routing problem that maximizes the system sumrate to efficiently solve the problem we decouple the problem into a resource allocation subproblem and a d2d routing subproblem the two subproblems are solved iteratively as a monotonic optimization problem and a complementary geometric programming problem respectively simulation results show that the data sumrate in the neighboring small cells increases 20 on average by offloading the data traffic in the congested small cell to the neighboring small cell base stationssbss
|
[['load', 'balancing', 'is', 'an', 'effective', 'approach', 'to', 'address', 'the', 'spatialtemporal', 'fluctuation', 'problem', 'of', 'mobile', 'data', 'traffic', 'for', 'cellular', 'networks', 'the', 'existing', 'schemes', 'that', 'focus', 'on', 'channel', 'borrowing', 'from', 'neighboring', 'cells', 'can', 'not', 'be', 'directly', 'applied', 'to', 'future', '5g', 'wireless', 'networks', 'because', 'the', 'neighboring', 'cells', 'will', 'reuse', 'the', 'same', 'spectrum', 'band', 'in', '5g', 'systems', 'in', 'this', 'paper', 'we', 'consider', 'an', 'orthogonal', 'frequency', 'division', 'multiple', 'accessofdma', 'ultradense', 'small', 'cell', 'network', 'where', 'devicetodeviced2d', 'communication', 'is', 'advocated', 'to', 'facilitate', 'load', 'balancing', 'without', 'extra', 'spectrum', 'specifically', 'the', 'data', 'traffic', 'can', 'be', 'effectively', 'offloaded', 'from', 'a', 'congested', 'small', 'cell', 'to', 'other', 'underutilized', 'small', 'cells', 'by', 'd2d', 'communications', 'the', 'problem', 'is', 'naturally', 'formulated', 'as', 'a', 'joint', 'resource', 'allocation', 'and', 'd2d', 'routing', 'problem', 'that', 'maximizes', 'the', 'system', 'sumrate', 'to', 'efficiently', 'solve', 'the', 'problem', 'we', 'decouple', 'the', 'problem', 'into', 'a', 'resource', 'allocation', 'subproblem', 'and', 'a', 'd2d', 'routing', 'subproblem', 'the', 'two', 'subproblems', 'are', 'solved', 'iteratively', 'as', 'a', 'monotonic', 'optimization', 'problem', 'and', 'a', 'complementary', 'geometric', 'programming', 'problem', 'respectively', 'simulation', 'results', 'show', 'that', 'the', 'data', 'sumrate', 'in', 'the', 'neighboring', 'small', 'cells', 'increases', '20', 'on', 'average', 'by', 'offloading', 'the', 'data', 'traffic', 'in', 'the', 'congested', 'small', 'cell', 'to', 'the', 'neighboring', 'small', 'cell', 'base', 'stationssbss']]
|
[-0.2450105383006089, 0.043982948917543195, 0.025880476743739875, 0.04421634330005848, -0.09158709055101648, -0.22373859421972603, 0.1625778887496843, 0.3777404946840323, -0.37577736053994315, -0.27744380016885895, 0.08398683114913616, -0.23813907581476126, -0.17762600036865886, 0.11549346268744791, -0.1593301650161611, 0.04905295753938689, 0.09676544209518893, -0.00046369509104101416, 0.043481232606517005, -0.24410049268418058, 0.25997112186770027, 0.07833696379485655, 0.4077152673922041, 0.052404779356276805, 0.03840781105582647, -0.010128494216388161, -0.006327145279728792, 0.009220869192619495, -0.055520563003322906, 0.13664576706394335, 0.3741670700118822, 0.2004470354454084, 0.33550271643873525, -0.4996290983411827, -0.2847864976984494, 0.11466601897369731, 0.2388694629578647, 0.05399054706216177, 0.002220883931252448, -0.24248852980208588, 0.13278161000210126, -0.21348908863448723, -0.016401895147593902, 0.020527334497833158, -0.07832247102483708, 0.044209949270682655, -0.33375414812758086, 0.00979904578279649, -0.06300751778750337, -0.019784279132789788, -0.08684108117259143, -0.08864470529880494, -0.004776234544295678, 0.1961229550340935, 0.022220902116894523, -0.014936268992004866, 0.13891572507788094, -0.08461436858764267, -0.1118161964596294, 0.421082079470317, 0.05073744645665953, -0.2559638328546469, 0.12201221530570992, -0.022434901278017755, -0.11526839744208137, 0.14829817726426225, 0.2606328870443737, 0.06400223498177879, -0.20997889554015994, 0.020742873889381654, -0.04944484897473339, 0.14663103633724592, 0.081272982994722, 0.044798497491600836, 0.16426825245349286, 0.2322673927793369, 0.21008933093996449, 0.11428039814102747, -0.09401011430250013, -0.12737127942285864, -0.16192740027918506, -0.09153395784019, -0.23608409115959975, -0.010999582611932669, -0.12895110781893773, -0.06428052507276164, 0.3553613123638346, 0.0947952568941914, 0.1573769259814392, 0.10602993107610009, 0.4107796623705224, 0.10076580575996023, 0.11455170731439958, 0.13773692114139224, 0.1483483689632964, 0.037020853745507044, 0.20778207285429307, -0.2665736241425502, 0.01482155657482936, 0.026850251361408974]
|
1,803.06083
|
On isomorphisms between weighted $L^p$-algebras
|
Let $G$ be a locally compact group and $\omega$ be a continuous weight on
$G$. In this paper, we first characterize bicontinuous biseparating algebra
isomorphisms between weighted $L^p$-algebras. As a result we extend previous
results of Edwards, Strichartz and Parrot on algebra isomorphisms between
$L^p$-algebras to the setting of weighted $L^p$-algebras. We then study the
automorphisms of certain weighted $L^p$-algebras on integers, applying known
results on composition operators on classical function spaces.
|
math.FA
|
let g be a locally compact group and omega be a continuous weight on g in this paper we first characterize bicontinuous biseparating algebra isomorphisms between weighted lpalgebras as a result we extend previous results of edwards strichartz and parrot on algebra isomorphisms between lpalgebras to the setting of weighted lpalgebras we then study the automorphisms of certain weighted lpalgebras on integers applying known results on composition operators on classical function spaces
|
[['let', 'g', 'be', 'a', 'locally', 'compact', 'group', 'and', 'omega', 'be', 'a', 'continuous', 'weight', 'on', 'g', 'in', 'this', 'paper', 'we', 'first', 'characterize', 'bicontinuous', 'biseparating', 'algebra', 'isomorphisms', 'between', 'weighted', 'lpalgebras', 'as', 'a', 'result', 'we', 'extend', 'previous', 'results', 'of', 'edwards', 'strichartz', 'and', 'parrot', 'on', 'algebra', 'isomorphisms', 'between', 'lpalgebras', 'to', 'the', 'setting', 'of', 'weighted', 'lpalgebras', 'we', 'then', 'study', 'the', 'automorphisms', 'of', 'certain', 'weighted', 'lpalgebras', 'on', 'integers', 'applying', 'known', 'results', 'on', 'composition', 'operators', 'on', 'classical', 'function', 'spaces']]
|
[-0.14015531721007493, 0.08029180250337555, -0.08870846371751719, 0.04900884361025722, -0.11444279859683269, -0.05392391757858503, 0.04912480276187933, 0.4048942212038027, -0.3472151237915063, -0.20659628690272155, 0.10356063277383025, -0.26526790492547053, -0.17554635539838476, 0.22085601034309044, -0.16349969277831, -0.03435326069464079, 0.055407604540555946, 0.08861889969557524, -0.13746539699948496, -0.26454232276106876, 0.43290645631754565, -0.0472557370020594, 0.18666671441557506, 0.04246342469640593, 0.05279244531347002, 0.050812959942656256, -0.025441844915298537, -0.006707629127453806, -0.21831992823475352, 0.11203050227939254, 0.25750820455141366, 0.06082931097545144, 0.25349257110307616, -0.35583147851543295, -0.15568924141633841, 0.23647970524002127, 0.07696981906580429, -0.07367988886673832, -0.0019455317734456104, -0.3032584073435929, 0.10641090702524202, -0.15508969066690448, -0.07376873854082078, -0.08350256083455558, 0.02925707644964051, 0.059609071413029194, -0.28329010323310894, 0.027930261353806902, 0.10575148276984692, 0.08606811861197154, -0.1404769099705542, -0.09127664065454155, -0.038363625269590154, 0.07743470535691206, -0.10139435387423469, 0.0875242939283554, 0.05925226557560058, 0.006393594725523144, -0.16040157723990786, 0.3163160889719923, -0.0959036568722998, -0.21734950818871665, 0.1305741117280882, -0.16895047965873447, -0.18729351587697035, -0.013579894969653752, 0.16361446898534066, 0.196369715500623, -0.047281940014929406, 0.15303494941488477, -0.1509272190871545, 0.089969056373876, 0.10875606556267788, -0.0069181854164020885, 0.05725299612256802, 0.10537410413639413, 0.1462487240916946, 0.17131333288853057, 0.08986522776346344, -0.0002653162009664811, -0.33662021259725505, -0.15024115996331805, -0.15163584512386782, 0.12430960657851149, -0.10579249612985425, -0.15860141426997465, 0.36826169413203996, 0.07507534647447756, 0.19659978373804027, 0.1571601220122021, 0.1787769805200191, 0.06003181167600107, 0.050981729795845844, 0.055431503543837204, 0.07951595278508547, 0.281193704360501, -0.0117228718720273, -0.137477301093491, -0.026364444568672398, 0.2628691339632496]
|
1,803.06084
|
A Kernel Theory of Modern Data Augmentation
|
Data augmentation, a technique in which a training set is expanded with
class-preserving transformations, is ubiquitous in modern machine learning
pipelines. In this paper, we seek to establish a theoretical framework for
understanding data augmentation. We approach this from two directions: First,
we provide a general model of augmentation as a Markov process, and show that
kernels appear naturally with respect to this model, even when we do not employ
kernel classification. Next, we analyze more directly the effect of
augmentation on kernel classifiers, showing that data augmentation can be
approximated by first-order feature averaging and second-order variance
regularization components. These frameworks both serve to illustrate the ways
in which data augmentation affects the downstream learning model, and the
resulting analyses provide novel connections between prior work in invariant
kernels, tangent propagation, and robust optimization. Finally, we provide
several proof-of-concept applications showing that our theory can be useful for
accelerating machine learning workflows, such as reducing the amount of
computation needed to train using augmented data, and predicting the utility of
a transformation prior to training.
|
cs.LG stat.ML
|
data augmentation a technique in which a training set is expanded with classpreserving transformations is ubiquitous in modern machine learning pipelines in this paper we seek to establish a theoretical framework for understanding data augmentation we approach this from two directions first we provide a general model of augmentation as a markov process and show that kernels appear naturally with respect to this model even when we do not employ kernel classification next we analyze more directly the effect of augmentation on kernel classifiers showing that data augmentation can be approximated by firstorder feature averaging and secondorder variance regularization components these frameworks both serve to illustrate the ways in which data augmentation affects the downstream learning model and the resulting analyses provide novel connections between prior work in invariant kernels tangent propagation and robust optimization finally we provide several proofofconcept applications showing that our theory can be useful for accelerating machine learning workflows such as reducing the amount of computation needed to train using augmented data and predicting the utility of a transformation prior to training
|
[['data', 'augmentation', 'a', 'technique', 'in', 'which', 'a', 'training', 'set', 'is', 'expanded', 'with', 'classpreserving', 'transformations', 'is', 'ubiquitous', 'in', 'modern', 'machine', 'learning', 'pipelines', 'in', 'this', 'paper', 'we', 'seek', 'to', 'establish', 'a', 'theoretical', 'framework', 'for', 'understanding', 'data', 'augmentation', 'we', 'approach', 'this', 'from', 'two', 'directions', 'first', 'we', 'provide', 'a', 'general', 'model', 'of', 'augmentation', 'as', 'a', 'markov', 'process', 'and', 'show', 'that', 'kernels', 'appear', 'naturally', 'with', 'respect', 'to', 'this', 'model', 'even', 'when', 'we', 'do', 'not', 'employ', 'kernel', 'classification', 'next', 'we', 'analyze', 'more', 'directly', 'the', 'effect', 'of', 'augmentation', 'on', 'kernel', 'classifiers', 'showing', 'that', 'data', 'augmentation', 'can', 'be', 'approximated', 'by', 'firstorder', 'feature', 'averaging', 'and', 'secondorder', 'variance', 'regularization', 'components', 'these', 'frameworks', 'both', 'serve', 'to', 'illustrate', 'the', 'ways', 'in', 'which', 'data', 'augmentation', 'affects', 'the', 'downstream', 'learning', 'model', 'and', 'the', 'resulting', 'analyses', 'provide', 'novel', 'connections', 'between', 'prior', 'work', 'in', 'invariant', 'kernels', 'tangent', 'propagation', 'and', 'robust', 'optimization', 'finally', 'we', 'provide', 'several', 'proofofconcept', 'applications', 'showing', 'that', 'our', 'theory', 'can', 'be', 'useful', 'for', 'accelerating', 'machine', 'learning', 'workflows', 'such', 'as', 'reducing', 'the', 'amount', 'of', 'computation', 'needed', 'to', 'train', 'using', 'augmented', 'data', 'and', 'predicting', 'the', 'utility', 'of', 'a', 'transformation', 'prior', 'to', 'training']]
|
[-0.026385692368256223, 0.03252916151276705, -0.10805193559181961, 0.08328351850291876, -0.13364061617969789, -0.14826697593922622, 0.04944967873995087, 0.44459438462217804, -0.3267518177295146, -0.30807360392811295, 0.09361105963563948, -0.23474593305251223, -0.20864205561916938, 0.20795121222975219, -0.09712009852740845, 0.07790259784616699, 0.1250220204767009, 0.01000554243348068, -0.08787068452643738, -0.2635772433502346, 0.31273286463626637, 0.050941547140775416, 0.32709481980947946, 0.01493325830956978, 0.09323430517460193, -0.009001133401232602, -0.050285851142358624, 0.021457681921839885, -0.08010933649608308, 0.1842589104357599, 0.31539616005532234, 0.2098637188557239, 0.3056865859861401, -0.4221022787228735, -0.23942736961180344, 0.13603754665448584, 0.1506971828480759, 0.1318908303973413, -0.04050355181814005, -0.2761764558540149, 0.07663638482335955, -0.1795373602812602, -0.052501654439931204, -0.2024917454982642, -0.06975966505011787, 0.0030713541378976183, -0.31627814878646116, 0.011353846754549191, 0.10001549979543514, 0.06572227378968488, -0.05009149604963816, -0.08145806394498901, 0.041711939256029756, 0.09646847892492422, 0.03870315002644598, 0.05173967323869213, 0.10381628201470118, -0.13483920274434655, -0.1348578663442326, 0.3506598769877614, -0.0773355583914963, -0.22516472991661762, 0.19233256385301833, -0.027241664999978224, -0.17109897052234208, 0.05163513409206644, 0.24277484777849168, 0.09295370779264803, -0.1603292726210632, 0.044787985122886974, 0.0028954361967573113, 0.12786786571219141, 0.02774020228852433, -0.03062573722027909, 0.14896983226935845, 0.20961594432976033, 0.06341984852666759, 0.16437588083764157, -0.09416472792773592, -0.07091217117638073, -0.3116146005129188, -0.14938527629287404, -0.17502926490587098, 0.0033736174532763966, -0.10210404562489699, -0.14931172725284175, 0.37129153481377714, 0.2406627800175391, 0.2482396045789673, 0.09624562070530374, 0.33889781341845676, 0.08730003680507666, 0.10006956155517731, 0.11051606803349304, 0.16710261295189743, 0.059759263715188186, 0.09477390032208693, -0.15240660898350392, 0.06894085260699451, 0.04194884032900022]
|
1,803.06085
|
High-Resolution Observations of Flares in an Arch Filament System
|
We study five sequential solar flares (SOL2015-08-07) occurring in Active
Region 12396 observed with the Goode Solar Telescope (GST) at the BBSO,
complemented by IRIS and SDO observations. The main flaring region is an arch
filament system (AFS) consisting of multiple bundles of dark filament threads
enclosed by semi-circular flare ribbons. We study the magnetic configuration
and evolution of the active region by constructing coronal magnetic field
models based on SDO/HMI magnetograms using two independent methods, i.e., the
nonlinear force-free field (NLFFF) extrapolation and the flux rope insertion
method. The models consist of multiple flux ropes with mixed signs of helicity,
i.e., positive (negative) in the northern (southern) region, which is
consistent with the GST observations of multiple filament bundles. The
footprints of quasi-separatrix layers (QSLs) derived from the extrapolated
NLFFF compare favorably with the observed flare ribbons. An interesting
double-ribbon fine structure located at the east border of the AFS is
consistent with the fine structure of the QSL's footprint. Moreover, magnetic
field lines traced along the semi-circular footprint of a dome-like QSL
surrounding the AFS are connected to the regions of significant helicity and
Poynting flux injection. The maps of magnetic twist show that positive twist
became dominant as time progressed, which is consistent with the injection of
positive helicity before the flares. We hence conclude that these circular
shaped flares are caused by 3D magnetic reconnection at the QSLs associated
with the AFS possessing mixed signs of helicity.
|
astro-ph.SR
|
we study five sequential solar flares sol20150807 occurring in active region 12396 observed with the goode solar telescope gst at the bbso complemented by iris and sdo observations the main flaring region is an arch filament system afs consisting of multiple bundles of dark filament threads enclosed by semicircular flare ribbons we study the magnetic configuration and evolution of the active region by constructing coronal magnetic field models based on sdohmi magnetograms using two independent methods ie the nonlinear forcefree field nlfff extrapolation and the flux rope insertion method the models consist of multiple flux ropes with mixed signs of helicity ie positive negative in the northern southern region which is consistent with the gst observations of multiple filament bundles the footprints of quasiseparatrix layers qsls derived from the extrapolated nlfff compare favorably with the observed flare ribbons an interesting doubleribbon fine structure located at the east border of the afs is consistent with the fine structure of the qsls footprint moreover magnetic field lines traced along the semicircular footprint of a domelike qsl surrounding the afs are connected to the regions of significant helicity and poynting flux injection the maps of magnetic twist show that positive twist became dominant as time progressed which is consistent with the injection of positive helicity before the flares we hence conclude that these circular shaped flares are caused by 3d magnetic reconnection at the qsls associated with the afs possessing mixed signs of helicity
|
[['we', 'study', 'five', 'sequential', 'solar', 'flares', 'sol20150807', 'occurring', 'in', 'active', 'region', '12396', 'observed', 'with', 'the', 'goode', 'solar', 'telescope', 'gst', 'at', 'the', 'bbso', 'complemented', 'by', 'iris', 'and', 'sdo', 'observations', 'the', 'main', 'flaring', 'region', 'is', 'an', 'arch', 'filament', 'system', 'afs', 'consisting', 'of', 'multiple', 'bundles', 'of', 'dark', 'filament', 'threads', 'enclosed', 'by', 'semicircular', 'flare', 'ribbons', 'we', 'study', 'the', 'magnetic', 'configuration', 'and', 'evolution', 'of', 'the', 'active', 'region', 'by', 'constructing', 'coronal', 'magnetic', 'field', 'models', 'based', 'on', 'sdohmi', 'magnetograms', 'using', 'two', 'independent', 'methods', 'ie', 'the', 'nonlinear', 'forcefree', 'field', 'nlfff', 'extrapolation', 'and', 'the', 'flux', 'rope', 'insertion', 'method', 'the', 'models', 'consist', 'of', 'multiple', 'flux', 'ropes', 'with', 'mixed', 'signs', 'of', 'helicity', 'ie', 'positive', 'negative', 'in', 'the', 'northern', 'southern', 'region', 'which', 'is', 'consistent', 'with', 'the', 'gst', 'observations', 'of', 'multiple', 'filament', 'bundles', 'the', 'footprints', 'of', 'quasiseparatrix', 'layers', 'qsls', 'derived', 'from', 'the', 'extrapolated', 'nlfff', 'compare', 'favorably', 'with', 'the', 'observed', 'flare', 'ribbons', 'an', 'interesting', 'doubleribbon', 'fine', 'structure', 'located', 'at', 'the', 'east', 'border', 'of', 'the', 'afs', 'is', 'consistent', 'with', 'the', 'fine', 'structure', 'of', 'the', 'qsls', 'footprint', 'moreover', 'magnetic', 'field', 'lines', 'traced', 'along', 'the', 'semicircular', 'footprint', 'of', 'a', 'domelike', 'qsl', 'surrounding', 'the', 'afs', 'are', 'connected', 'to', 'the', 'regions', 'of', 'significant', 'helicity', 'and', 'poynting', 'flux', 'injection', 'the', 'maps', 'of', 'magnetic', 'twist', 'show', 'that', 'positive', 'twist', 'became', 'dominant', 'as', 'time', 'progressed', 'which', 'is', 'consistent', 'with', 'the', 'injection', 'of', 'positive', 'helicity', 'before', 'the', 'flares', 'we', 'hence', 'conclude', 'that', 'these', 'circular', 'shaped', 'flares', 'are', 'caused', 'by', '3d', 'magnetic', 'reconnection', 'at', 'the', 'qsls', 'associated', 'with', 'the', 'afs', 'possessing', 'mixed', 'signs', 'of', 'helicity']]
|
[-0.1714709215252582, 0.2091767529419187, 0.057867743307724595, 0.10141726975434874, -0.051856172402162386, -0.06923129523227758, -0.020772734231378164, 0.45146825584042977, -0.19510607270938696, -0.35568381827168105, 0.07854624189037297, -0.23063189588768893, -0.10176291247876752, 0.19958658666670823, 0.013123405073156008, -0.029551870815706354, 0.07419152399490807, -0.017587045751054214, -0.039026457350701094, -0.1611185670867484, 0.30433709217365557, 0.09559295947874795, 0.261698533330864, -0.04260558780564481, 0.09781975523072702, -0.12199518105559082, -0.023953736218733385, 0.06063934146356182, -0.06814835909131607, 0.07593528708411741, 0.1399549370901642, 0.027520025882911782, 0.18651936121554966, -0.4900272233145578, -0.22250256686815756, -0.02391206444350674, 0.16731926939497163, -0.041518394791270695, 0.01774143162251943, -0.2818291540954168, 0.04402620080827164, -0.08817561378420287, -0.1363915409129739, 0.04157380750324546, -0.01605833978284573, 0.005008407159681048, -0.2641428924413171, 0.07574008914794647, 0.02737177079719562, 0.12285364447689827, -0.1456728469846504, -0.08057548157907944, -0.1303149437294107, 0.11988191721479588, 0.1194585083999491, 0.09754101244562517, 0.196295899429022, -0.1331912418260012, -0.12813494713319576, 0.2585086375853402, -0.02054045961273662, -0.028851058114977443, 0.14412843151665644, -0.22682750017280465, -0.15758159161670557, 0.2635639735317531, 0.10239519806531798, 0.07441223966275212, -0.0695673700166106, 0.010311559902136253, -0.10322739647803124, 0.12279729250262827, 0.04737341501006559, -0.028856554888423626, 0.32489999218554305, 0.12396322540007532, 0.03597837871824931, 0.1706983513492766, -0.25876664872865285, -0.12004247199090495, -0.3096247345887559, -0.12874623547315972, -0.09666671620646664, 0.0337459629867715, -0.08576430318883949, -0.25592131053191464, 0.4341088324440878, 0.12149943019059964, 0.22065143878062984, -0.034817161748260106, 0.2871733178157641, 0.07113354150235199, 0.1081466310727997, 0.17736643668608504, 0.27652621640581165, 0.23638034543949923, 0.19171901222244062, -0.22878060024720812, 0.045159157175774206, 0.08578386818677061]
|
1,803.06086
|
Weak units, universal cells, and coherence via universality for
bicategories
|
Poly-bicategories generalise planar polycategories in the same way as
bicategories generalise monoidal categories. In a poly-bicategory, the
existence of enough 2-cells satisfying certain universal properties
(representability) induces coherent algebraic structure on the 2-graph of
single-input, single-output 2-cells. A special case of this theory was used by
Hermida to produce a proof of strictification for bicategories. No full
strictification is possible for higher-dimensional categories, seemingly due to
problems with 2-cells that have degenerate boundaries; it was conjectured by C.
Simpson that semi-strictification excluding units may be possible.
We study poly-bicategories where 2-cells with degenerate boundaries are
barred, and show that we can recover the structure of a bicategory through a
different construction of weak units. We prove that the existence of these
units is equivalent to the existence of 1-cells satisfying lower-dimensional
universal properties, and study the relation between preservation of units and
universal cells.
Then, we introduce merge-bicategories, a variant of poly-bicategories with
more composition operations, which admits a natural monoidal closed structure,
giving access to higher morphisms. We derive equivalences between morphisms,
transformations, and modifications of representable merge-bicategories and the
corresponding notions for bicategories. Finally, we prove a
semi-strictification theorem for representable merge-bicategories with a choice
of composites and units.
|
math.CT
|
polybicategories generalise planar polycategories in the same way as bicategories generalise monoidal categories in a polybicategory the existence of enough 2cells satisfying certain universal properties representability induces coherent algebraic structure on the 2graph of singleinput singleoutput 2cells a special case of this theory was used by hermida to produce a proof of strictification for bicategories no full strictification is possible for higherdimensional categories seemingly due to problems with 2cells that have degenerate boundaries it was conjectured by c simpson that semistrictification excluding units may be possible we study polybicategories where 2cells with degenerate boundaries are barred and show that we can recover the structure of a bicategory through a different construction of weak units we prove that the existence of these units is equivalent to the existence of 1cells satisfying lowerdimensional universal properties and study the relation between preservation of units and universal cells then we introduce mergebicategories a variant of polybicategories with more composition operations which admits a natural monoidal closed structure giving access to higher morphisms we derive equivalences between morphisms transformations and modifications of representable mergebicategories and the corresponding notions for bicategories finally we prove a semistrictification theorem for representable mergebicategories with a choice of composites and units
|
[['polybicategories', 'generalise', 'planar', 'polycategories', 'in', 'the', 'same', 'way', 'as', 'bicategories', 'generalise', 'monoidal', 'categories', 'in', 'a', 'polybicategory', 'the', 'existence', 'of', 'enough', '2cells', 'satisfying', 'certain', 'universal', 'properties', 'representability', 'induces', 'coherent', 'algebraic', 'structure', 'on', 'the', '2graph', 'of', 'singleinput', 'singleoutput', '2cells', 'a', 'special', 'case', 'of', 'this', 'theory', 'was', 'used', 'by', 'hermida', 'to', 'produce', 'a', 'proof', 'of', 'strictification', 'for', 'bicategories', 'no', 'full', 'strictification', 'is', 'possible', 'for', 'higherdimensional', 'categories', 'seemingly', 'due', 'to', 'problems', 'with', '2cells', 'that', 'have', 'degenerate', 'boundaries', 'it', 'was', 'conjectured', 'by', 'c', 'simpson', 'that', 'semistrictification', 'excluding', 'units', 'may', 'be', 'possible', 'we', 'study', 'polybicategories', 'where', '2cells', 'with', 'degenerate', 'boundaries', 'are', 'barred', 'and', 'show', 'that', 'we', 'can', 'recover', 'the', 'structure', 'of', 'a', 'bicategory', 'through', 'a', 'different', 'construction', 'of', 'weak', 'units', 'we', 'prove', 'that', 'the', 'existence', 'of', 'these', 'units', 'is', 'equivalent', 'to', 'the', 'existence', 'of', '1cells', 'satisfying', 'lowerdimensional', 'universal', 'properties', 'and', 'study', 'the', 'relation', 'between', 'preservation', 'of', 'units', 'and', 'universal', 'cells', 'then', 'we', 'introduce', 'mergebicategories', 'a', 'variant', 'of', 'polybicategories', 'with', 'more', 'composition', 'operations', 'which', 'admits', 'a', 'natural', 'monoidal', 'closed', 'structure', 'giving', 'access', 'to', 'higher', 'morphisms', 'we', 'derive', 'equivalences', 'between', 'morphisms', 'transformations', 'and', 'modifications', 'of', 'representable', 'mergebicategories', 'and', 'the', 'corresponding', 'notions', 'for', 'bicategories', 'finally', 'we', 'prove', 'a', 'semistrictification', 'theorem', 'for', 'representable', 'mergebicategories', 'with', 'a', 'choice', 'of', 'composites', 'and', 'units']]
|
[-0.14897862140031065, 0.08374761910759844, -0.05347945889225229, 0.10756766215257813, -0.10247598227579147, -0.15595411406597123, 0.0246902733220486, 0.36699689254164697, -0.3414673694956582, -0.22206774778431282, 0.05324727541184984, -0.20121485593146646, -0.15982980289496482, 0.16237408131477424, -0.1610435795725789, -0.04511924734804779, 0.050247445465065536, 0.02636253899661824, -0.11202951510960701, -0.22208933597663416, 0.3956542971980525, -0.028265322161605582, 0.22657703700475396, 0.031086569954641163, 0.1263226115703583, -0.004930374892428518, 0.013803249802440404, 0.03274070537416265, -0.15000984488244284, 0.1261274797457736, 0.28987956705503165, 0.10710930336732417, 0.18233529058634304, -0.3878160815872252, -0.11893559275646112, 0.153248349345522, 0.08203943402288133, 0.052088446275447495, -0.012103926343625062, -0.2854929238813929, 0.15126163777997134, -0.18270543386199278, -0.10060529884067364, -0.10948267070110887, 0.042754263700917366, 0.037502660716418175, -0.25234208054112967, -0.0006838996091391891, 0.15271672111703083, 0.08399226161651313, -0.07924327333690599, -0.042419626056798734, -0.06805321257212199, 0.11117067429469898, -0.04032200753223151, -0.02910087288590148, 0.09083795696031302, -0.08922317769145593, -0.1350996888487134, 0.3706223140843213, -0.039184543182200285, -0.20284789830446243, 0.19571346613345666, -0.09572048424277455, -0.17604721216252073, 0.07850149712001439, 0.05085405640653334, 0.12890722271287813, -0.09021378454373917, 0.15149580259632786, -0.15412593734188704, 0.12186636990285478, 0.16835971633670851, 0.07881328675372061, 0.1751534593012184, 0.1039412498055026, 0.07466802244191058, 0.1937297917314572, 0.03598847088986076, -0.07795432541694026, -0.3318105038627982, -0.17054100006018416, -0.031478486402193084, 0.11796260723029263, -0.05800828495717724, -0.19921272294945083, 0.3382971091289073, 0.0950453928700881, 0.1811863580928184, 0.14247101756569464, 0.20796045298920945, 0.042970803884672934, 0.09376340322720353, 0.02961743597057648, 0.1515482033160515, 0.26358318091137334, 0.02305680567398667, -0.09396473798900842, 0.02392508727265522, 0.1577920422097668]
|
1,803.06087
|
A Globally Asymptotically Stable Polynomial Vector Field with Rational
Coefficients and no Local Polynomial Lyapunov Function
|
We give an explicit example of a two-dimensional polynomial vector field of
degree seven that has rational coefficients, is globally asymptotically stable,
but does not admit an analytic Lyapunov function even locally.
|
math.OC cs.SY math.DS
|
we give an explicit example of a twodimensional polynomial vector field of degree seven that has rational coefficients is globally asymptotically stable but does not admit an analytic lyapunov function even locally
|
[['we', 'give', 'an', 'explicit', 'example', 'of', 'a', 'twodimensional', 'polynomial', 'vector', 'field', 'of', 'degree', 'seven', 'that', 'has', 'rational', 'coefficients', 'is', 'globally', 'asymptotically', 'stable', 'but', 'does', 'not', 'admit', 'an', 'analytic', 'lyapunov', 'function', 'even', 'locally']]
|
[-0.244071892600914, 0.10654124854136171, -0.1293267217988614, 0.040294292721227976, -0.1368292580009438, -0.19915094516181853, -0.0654625475872308, 0.39717056520748883, -0.2340665254741907, -0.12973317991418298, 0.12032438883034047, -0.20078954748169053, -0.23779139842372388, 0.2346966384211555, -0.0472114133881405, 0.04372838919516653, -0.02791771831107326, 0.1435951540552196, -0.07322694809408858, -0.35389740121900104, 0.334331986901816, 0.01485192630207166, 0.2115580849640537, 0.032423046708572656, 0.1928219085020828, 0.0001250245695700869, 0.017179150134325027, 0.04163458541734144, -0.16503090950686783, 0.04580349917523563, 0.28607661492424086, 0.10005686426302418, 0.24281531915767118, -0.3985651265247725, -0.1456928805419011, 0.2548032551421784, 0.20855149450653698, 0.11479624765343033, -0.07658144657034427, -0.11648240714566782, 0.11114020482636988, -0.14026231081197693, -0.2586114651930984, -0.20408568799030036, 0.05290700104160351, 0.002822860755259171, -0.3358885671623284, 0.04614081035833806, 0.11587964615318924, 0.13193370003136806, -0.10066864615509985, -0.06662143531139009, -0.060868361877510324, 0.07460897995042615, -0.03326537050452316, 0.09452072740532458, 0.0630044309218647, -0.08467774638847914, -0.11776281747734174, 0.2861991249374114, -0.07481802700203843, -0.3415544484741986, 0.1667605354450643, -0.13562441428075545, -0.08474903137539513, 0.19852136727422476, 0.09968745926744305, 0.1868061815330293, -0.09131062781671062, 0.21574137918651104, -0.15449708374217153, 0.21751555764785735, 0.05653872148832306, -0.012977427642908879, 0.14731424485216849, -0.013546566624427214, 0.19866964151151478, 0.08742666331818327, 0.054002263001166284, -0.11069950280943885, -0.334245184349129, -0.16104157862719148, -0.15191957123897737, 0.1545154902928516, -0.15022509734262712, -0.3325745369947981, 0.41126188077032566, -0.031637047592084855, 0.1675617877044715, 0.15456102404277772, 0.22077750164316967, 0.1896320224914234, -0.009441219008294865, 0.12811095317010768, 0.22264198277844116, 0.09057734744419577, -0.02797659597126767, -0.09725220153632108, 0.06637833802960813, 0.1443052936292588]
|
1,803.06088
|
High resolution observations of sympathetic eruptions by NVST
|
We investigate two sympathetic filament eruptions observed by the New Vacuum
Solar Telescope (NVST) on 2015 October 15. The full picture of the eruptions is
obtained from the corresponding SDO/AIA observations. The two filaments start
from active region NOAA 12434 in the north and end in one large quiescent
filament channel in the south. The left filament erupts firstly, followed by
the right filament eruption about 10 minutes later. Clear twist structure and
rotating motion are observed in both filaments during the eruption. Both
eruptions are failed, since the filaments firstly rise up, then flow towards
the south and merge into the southern large quiescent filament. We also observe
repeating activations of mini filaments below the right filament after its
eruption. Using magnetic field models constructed based on SDO/HMI magnetograms
by flux rope insertion method, we find that the left filament eruption is
likely to be triggered by kink instability, while weakening of overlying
magnetic fields due to magnetic reconnection at an X-point between the two
filament systems might play an important role in the onset of the right
filament eruption.
|
astro-ph.SR
|
we investigate two sympathetic filament eruptions observed by the new vacuum solar telescope nvst on 2015 october 15 the full picture of the eruptions is obtained from the corresponding sdoaia observations the two filaments start from active region noaa 12434 in the north and end in one large quiescent filament channel in the south the left filament erupts firstly followed by the right filament eruption about 10 minutes later clear twist structure and rotating motion are observed in both filaments during the eruption both eruptions are failed since the filaments firstly rise up then flow towards the south and merge into the southern large quiescent filament we also observe repeating activations of mini filaments below the right filament after its eruption using magnetic field models constructed based on sdohmi magnetograms by flux rope insertion method we find that the left filament eruption is likely to be triggered by kink instability while weakening of overlying magnetic fields due to magnetic reconnection at an xpoint between the two filament systems might play an important role in the onset of the right filament eruption
|
[['we', 'investigate', 'two', 'sympathetic', 'filament', 'eruptions', 'observed', 'by', 'the', 'new', 'vacuum', 'solar', 'telescope', 'nvst', 'on', '2015', 'october', '15', 'the', 'full', 'picture', 'of', 'the', 'eruptions', 'is', 'obtained', 'from', 'the', 'corresponding', 'sdoaia', 'observations', 'the', 'two', 'filaments', 'start', 'from', 'active', 'region', 'noaa', '12434', 'in', 'the', 'north', 'and', 'end', 'in', 'one', 'large', 'quiescent', 'filament', 'channel', 'in', 'the', 'south', 'the', 'left', 'filament', 'erupts', 'firstly', 'followed', 'by', 'the', 'right', 'filament', 'eruption', 'about', '10', 'minutes', 'later', 'clear', 'twist', 'structure', 'and', 'rotating', 'motion', 'are', 'observed', 'in', 'both', 'filaments', 'during', 'the', 'eruption', 'both', 'eruptions', 'are', 'failed', 'since', 'the', 'filaments', 'firstly', 'rise', 'up', 'then', 'flow', 'towards', 'the', 'south', 'and', 'merge', 'into', 'the', 'southern', 'large', 'quiescent', 'filament', 'we', 'also', 'observe', 'repeating', 'activations', 'of', 'mini', 'filaments', 'below', 'the', 'right', 'filament', 'after', 'its', 'eruption', 'using', 'magnetic', 'field', 'models', 'constructed', 'based', 'on', 'sdohmi', 'magnetograms', 'by', 'flux', 'rope', 'insertion', 'method', 'we', 'find', 'that', 'the', 'left', 'filament', 'eruption', 'is', 'likely', 'to', 'be', 'triggered', 'by', 'kink', 'instability', 'while', 'weakening', 'of', 'overlying', 'magnetic', 'fields', 'due', 'to', 'magnetic', 'reconnection', 'at', 'an', 'xpoint', 'between', 'the', 'two', 'filament', 'systems', 'might', 'play', 'an', 'important', 'role', 'in', 'the', 'onset', 'of', 'the', 'right', 'filament', 'eruption']]
|
[-0.12562908152329288, 0.22867296423164238, 0.02253631900388809, 0.08615392201466908, -0.09070732853071795, -0.051298996172485185, -0.0005814615078784979, 0.45454617079285625, -0.20329440504075183, -0.3283088849754541, 0.11840054914754049, -0.23071043545930794, -0.13883843202946594, 0.17112033120073503, -0.0032192045142759155, -0.06505423506177725, 0.12812594439286368, -0.011947374639116763, -0.0051258534645836655, -0.22830302675655986, 0.2506058747977924, 0.11634155871727354, 0.23212368274043257, -0.03153045301310183, 0.11794224527062468, -0.14164332092806534, -0.033291142873172724, -0.05338807251479333, -0.1299291116204219, -0.008514080155455605, 0.1070196545828246, 0.07902754368311957, 0.2681484344165813, -0.528131303454631, -0.17108613266275155, -0.03465025190222823, 0.2217591962473498, -0.021037143028665394, 0.017338775613349063, -0.3189961352097437, 0.04325012424291827, -0.10936259981296256, -0.12194838224606619, 0.10157714367880183, 0.02788480742801063, -0.02916875248742727, -0.22876666217125202, 0.13029085285816913, 0.027488491753356156, 0.10895740583111939, -0.14193751202003504, -0.017057073546974864, -0.11025398409120142, 0.13035520935914793, 0.12925086178667639, 0.12833319085094438, 0.23496694144026187, -0.16741209308094557, -0.0677552894812633, 0.27844984552280166, -0.0017041016175657335, 0.05736020314430005, 0.13961319726485327, -0.2159517850078519, -0.16247608983189443, 0.2582628183762764, 0.11903275875631947, 0.028250307944546665, -0.09964946210570891, -0.0682375911859286, -0.07053843299338584, 0.09502733905384997, 0.11842243733059471, -0.08455387937665264, 0.3387084901950307, 0.11763443849281052, 0.041816201925442366, 0.18514218285116393, -0.2641644532179964, -0.10610139381027271, -0.2945067080326934, -0.1179656119430592, -0.0491171268429813, 0.034525692464609486, -0.03618076493301447, -0.1668213407588783, 0.3894961478898703, 0.12902666156524947, 0.2628334708261311, -0.07514825541827087, 0.25035618673701315, 0.022018447253359122, 0.10733326452202807, 0.17643143990056498, 0.32305101665426356, 0.22612158987717446, 0.24954437494962295, -0.20179702116733478, 0.027854367307238077, 0.11643303462268156]
|
1,803.06089
|
Distributed Caching for Complex Querying of Raw Arrays
|
As applications continue to generate multi-dimensional data at exponentially
increasing rates, fast analytics to extract meaningful results is becoming
extremely important. The database community has developed array databases that
alleviate this problem through a series of techniques. In-situ mechanisms
provide direct access to raw data in the original format---without loading and
partitioning. Parallel processing scales to the largest datasets. In-memory
caching reduces latency when the same data are accessed across a workload of
queries. However, we are not aware of any work on distributed caching of
multi-dimensional raw arrays. In this paper, we introduce a distributed
framework for cost-based caching of multi-dimensional arrays in native format.
Given a set of files that contain portions of an array and an online query
workload, the framework computes an effective caching plan in two stages.
First, the plan identifies the cells to be cached locally from each of the
input files by continuously refining an evolving R-tree index. In the second
stage, an optimal assignment of cells to nodes that collocates dependent cells
in order to minimize the overall data transfer is determined. We design cache
eviction and placement heuristic algorithms that consider the historical query
workload. A thorough experimental evaluation over two real datasets in three
file formats confirms the superiority -- by as much as two orders of magnitude
-- of the proposed framework over existing techniques in terms of cache
overhead and workload execution time.
|
cs.DB cs.DC
|
as applications continue to generate multidimensional data at exponentially increasing rates fast analytics to extract meaningful results is becoming extremely important the database community has developed array databases that alleviate this problem through a series of techniques insitu mechanisms provide direct access to raw data in the original formatwithout loading and partitioning parallel processing scales to the largest datasets inmemory caching reduces latency when the same data are accessed across a workload of queries however we are not aware of any work on distributed caching of multidimensional raw arrays in this paper we introduce a distributed framework for costbased caching of multidimensional arrays in native format given a set of files that contain portions of an array and an online query workload the framework computes an effective caching plan in two stages first the plan identifies the cells to be cached locally from each of the input files by continuously refining an evolving rtree index in the second stage an optimal assignment of cells to nodes that collocates dependent cells in order to minimize the overall data transfer is determined we design cache eviction and placement heuristic algorithms that consider the historical query workload a thorough experimental evaluation over two real datasets in three file formats confirms the superiority by as much as two orders of magnitude of the proposed framework over existing techniques in terms of cache overhead and workload execution time
|
[['as', 'applications', 'continue', 'to', 'generate', 'multidimensional', 'data', 'at', 'exponentially', 'increasing', 'rates', 'fast', 'analytics', 'to', 'extract', 'meaningful', 'results', 'is', 'becoming', 'extremely', 'important', 'the', 'database', 'community', 'has', 'developed', 'array', 'databases', 'that', 'alleviate', 'this', 'problem', 'through', 'a', 'series', 'of', 'techniques', 'insitu', 'mechanisms', 'provide', 'direct', 'access', 'to', 'raw', 'data', 'in', 'the', 'original', 'formatwithout', 'loading', 'and', 'partitioning', 'parallel', 'processing', 'scales', 'to', 'the', 'largest', 'datasets', 'inmemory', 'caching', 'reduces', 'latency', 'when', 'the', 'same', 'data', 'are', 'accessed', 'across', 'a', 'workload', 'of', 'queries', 'however', 'we', 'are', 'not', 'aware', 'of', 'any', 'work', 'on', 'distributed', 'caching', 'of', 'multidimensional', 'raw', 'arrays', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'distributed', 'framework', 'for', 'costbased', 'caching', 'of', 'multidimensional', 'arrays', 'in', 'native', 'format', 'given', 'a', 'set', 'of', 'files', 'that', 'contain', 'portions', 'of', 'an', 'array', 'and', 'an', 'online', 'query', 'workload', 'the', 'framework', 'computes', 'an', 'effective', 'caching', 'plan', 'in', 'two', 'stages', 'first', 'the', 'plan', 'identifies', 'the', 'cells', 'to', 'be', 'cached', 'locally', 'from', 'each', 'of', 'the', 'input', 'files', 'by', 'continuously', 'refining', 'an', 'evolving', 'rtree', 'index', 'in', 'the', 'second', 'stage', 'an', 'optimal', 'assignment', 'of', 'cells', 'to', 'nodes', 'that', 'collocates', 'dependent', 'cells', 'in', 'order', 'to', 'minimize', 'the', 'overall', 'data', 'transfer', 'is', 'determined', 'we', 'design', 'cache', 'eviction', 'and', 'placement', 'heuristic', 'algorithms', 'that', 'consider', 'the', 'historical', 'query', 'workload', 'a', 'thorough', 'experimental', 'evaluation', 'over', 'two', 'real', 'datasets', 'in', 'three', 'file', 'formats', 'confirms', 'the', 'superiority', 'by', 'as', 'much', 'as', 'two', 'orders', 'of', 'magnitude', 'of', 'the', 'proposed', 'framework', 'over', 'existing', 'techniques', 'in', 'terms', 'of', 'cache', 'overhead', 'and', 'workload', 'execution', 'time']]
|
[-0.15602048564182183, 0.029657180004592408, -0.04848226408062914, 0.031478195911821674, -0.07985232182218012, -0.13344504391508444, 0.11017569938313732, 0.41709495274938674, -0.29577519466245783, -0.3354138672367964, 0.11368073557717201, -0.2775367762776519, -0.10011493910237082, 0.18665112593328154, -0.11682787852652081, 0.07077439026878109, 0.10943856037016358, 0.007594323677874625, -0.014937388582671166, -0.31955926970566634, 0.2707509409406452, 0.09107813567681101, 0.34468396193472856, -0.0033710514219453583, 0.05222811705475165, 0.007602644131772898, -0.10066090809640946, -0.006847109424869542, -0.06693061446184917, 0.1285892813441291, 0.3507500071909069, 0.240031464632149, 0.287651823857775, -0.46683541566004483, -0.15891765168509184, 0.06931147959664892, 0.16811364540806065, 0.06875053519855286, -0.04002754944245617, -0.25383919877810524, 0.1283330779756496, -0.188700973925088, -0.015380058428514507, -0.08329234332313915, 0.02214720602110996, 0.018646623094886686, -0.31355402961945833, -0.03268012978114869, 0.0015029220387502876, 0.01955374129050012, -0.06333055333395637, -0.10004689839660509, 0.03346077109146783, 0.16706711045721873, 0.024637229771487357, 0.02962007277213779, 0.14101406008416376, -0.08600315944774448, -0.17418640601933527, 0.39120155546685187, -0.006954277587905365, -0.17813305244959984, 0.12633686095528562, -0.042644347383709244, -0.14317875154905055, 0.15513252746011433, 0.24458377854495403, 0.0851031631055929, -0.18455158978695851, 0.0527703118675844, -0.025219683051341136, 0.2239032835040435, 0.08403480757941044, 0.04550767889361248, 0.1523585943021364, 0.23856690155873397, 0.09705359302662732, 0.17122996393722195, -0.06269791219746332, -0.10060493781904638, -0.21068853196522697, -0.15320069494645122, -0.2229012873082208, -0.04530652272871552, -0.14981561513464933, -0.16971832010098753, 0.37552123287192735, 0.19641092216829845, 0.18835378632159072, 0.09181243243606588, 0.3895688693631779, 0.032947403890873486, 0.12168047632452593, 0.1391192528991698, 0.06345115573592967, -0.02394631742781988, 0.19517219593966162, -0.18108969473179723, 0.09905358550876572, 0.011901517411758438]
|
1,803.0609
|
A falling Corona model for the anomalous behavior of the broad emission
lines in NGC 5548
|
NGC 5548 has been intensively monitored by the AGN Space Telescope and
Optical Reverberation Mapping collaboration. Approximately after half of the
light curves, the correlation between the broad emission lines and the
lag-corrected ultraviolet continua becomes weak. This anomalous behavior is
accompanied by an increase of soft X-ray emission. We propose a simple model to
understand this anomalous behavior, i.e., the corona might fall down, thereby
increasing the covering fraction of the inner disk. Therefore, X-ray and
extreme ultraviolet emission suffer from spectral variations. The ultraviolet
continua variations are driven by both X-ray and extreme ultraviolet
variations. Consequently, the spectral variability induced by the falling
corona would dilute the correlation between the broad emission lines and the
ultraviolet continua. Our model can explain many additional observational
facts, including the dependence of the anomalous behavior on velocity and
ionization energy. We also show that the time lag and correlation between the
X-ray and the ultraviolet variations change as NGC 5548 displays the anomalous
behavior. The time lag is dramatically longer than the expectation from disk
reprocessing if the anomalous behavior is properly excluded. During the
anomalous state, the time lag approaches the light-travel timescale of disk
reprocessing albeit with a much weaker correlation. We speculate that the time
lag in the normal state is caused by reprocessing of the broad line region gas.
As NGC 5548 enters the abnormal state, the contribution of the broad line
region gas is smaller; the time lag reflects disk reprocessing. We also discuss
alternative scenarios.
|
astro-ph.HE astro-ph.GA
|
ngc 5548 has been intensively monitored by the agn space telescope and optical reverberation mapping collaboration approximately after half of the light curves the correlation between the broad emission lines and the lagcorrected ultraviolet continua becomes weak this anomalous behavior is accompanied by an increase of soft xray emission we propose a simple model to understand this anomalous behavior ie the corona might fall down thereby increasing the covering fraction of the inner disk therefore xray and extreme ultraviolet emission suffer from spectral variations the ultraviolet continua variations are driven by both xray and extreme ultraviolet variations consequently the spectral variability induced by the falling corona would dilute the correlation between the broad emission lines and the ultraviolet continua our model can explain many additional observational facts including the dependence of the anomalous behavior on velocity and ionization energy we also show that the time lag and correlation between the xray and the ultraviolet variations change as ngc 5548 displays the anomalous behavior the time lag is dramatically longer than the expectation from disk reprocessing if the anomalous behavior is properly excluded during the anomalous state the time lag approaches the lighttravel timescale of disk reprocessing albeit with a much weaker correlation we speculate that the time lag in the normal state is caused by reprocessing of the broad line region gas as ngc 5548 enters the abnormal state the contribution of the broad line region gas is smaller the time lag reflects disk reprocessing we also discuss alternative scenarios
|
[['ngc', '5548', 'has', 'been', 'intensively', 'monitored', 'by', 'the', 'agn', 'space', 'telescope', 'and', 'optical', 'reverberation', 'mapping', 'collaboration', 'approximately', 'after', 'half', 'of', 'the', 'light', 'curves', 'the', 'correlation', 'between', 'the', 'broad', 'emission', 'lines', 'and', 'the', 'lagcorrected', 'ultraviolet', 'continua', 'becomes', 'weak', 'this', 'anomalous', 'behavior', 'is', 'accompanied', 'by', 'an', 'increase', 'of', 'soft', 'xray', 'emission', 'we', 'propose', 'a', 'simple', 'model', 'to', 'understand', 'this', 'anomalous', 'behavior', 'ie', 'the', 'corona', 'might', 'fall', 'down', 'thereby', 'increasing', 'the', 'covering', 'fraction', 'of', 'the', 'inner', 'disk', 'therefore', 'xray', 'and', 'extreme', 'ultraviolet', 'emission', 'suffer', 'from', 'spectral', 'variations', 'the', 'ultraviolet', 'continua', 'variations', 'are', 'driven', 'by', 'both', 'xray', 'and', 'extreme', 'ultraviolet', 'variations', 'consequently', 'the', 'spectral', 'variability', 'induced', 'by', 'the', 'falling', 'corona', 'would', 'dilute', 'the', 'correlation', 'between', 'the', 'broad', 'emission', 'lines', 'and', 'the', 'ultraviolet', 'continua', 'our', 'model', 'can', 'explain', 'many', 'additional', 'observational', 'facts', 'including', 'the', 'dependence', 'of', 'the', 'anomalous', 'behavior', 'on', 'velocity', 'and', 'ionization', 'energy', 'we', 'also', 'show', 'that', 'the', 'time', 'lag', 'and', 'correlation', 'between', 'the', 'xray', 'and', 'the', 'ultraviolet', 'variations', 'change', 'as', 'ngc', '5548', 'displays', 'the', 'anomalous', 'behavior', 'the', 'time', 'lag', 'is', 'dramatically', 'longer', 'than', 'the', 'expectation', 'from', 'disk', 'reprocessing', 'if', 'the', 'anomalous', 'behavior', 'is', 'properly', 'excluded', 'during', 'the', 'anomalous', 'state', 'the', 'time', 'lag', 'approaches', 'the', 'lighttravel', 'timescale', 'of', 'disk', 'reprocessing', 'albeit', 'with', 'a', 'much', 'weaker', 'correlation', 'we', 'speculate', 'that', 'the', 'time', 'lag', 'in', 'the', 'normal', 'state', 'is', 'caused', 'by', 'reprocessing', 'of', 'the', 'broad', 'line', 'region', 'gas', 'as', 'ngc', '5548', 'enters', 'the', 'abnormal', 'state', 'the', 'contribution', 'of', 'the', 'broad', 'line', 'region', 'gas', 'is', 'smaller', 'the', 'time', 'lag', 'reflects', 'disk', 'reprocessing', 'we', 'also', 'discuss', 'alternative', 'scenarios']]
|
[-0.07953809320821004, 0.14977766659507485, -0.08397668713786037, 0.13573588677691334, -0.0820607861642348, -0.09517541684090612, 0.04473623111619648, 0.4712102788100281, -0.21894121045353318, -0.3241999481396046, 0.09741541217539429, -0.3102840318893415, -0.06409081446481905, 0.18914823186767088, -0.036813750367258195, -0.025676422057688296, -0.00943359950170235, -0.1024238259880336, -0.058437027093247475, -0.162841997614755, 0.30491857338943573, 0.07471874042088728, 0.2094729024354447, 0.05207773100913887, 0.047492409889325855, -0.03580886516888368, -0.05802076521991606, 0.012613758807473565, -0.05987540175456855, 0.05471621176305538, 0.1962237300362483, 0.07862164621918376, 0.21513817507594105, -0.36576347425580025, -0.2846592313784874, 0.09574208889590449, 0.16202141905023928, -0.010126866443254742, 0.009298381385352298, -0.2471322484452831, -0.0533753108405265, -0.1477137015717306, -0.16002684496633005, 0.05978732385081669, 0.07790846702264974, -0.03133582564755287, -0.18917319547510275, 0.12797367174424285, 0.04322104724629008, 0.09658443552898206, -0.11815977460110044, -0.018691247638621664, -0.026848623468765025, 0.10273776083705895, 0.11469029547575577, 0.026318835487063735, 0.1997376500602473, -0.12190743959247019, -0.0538794849017433, 0.3545913883750458, -0.10132783447490701, 0.04598608460785993, 0.2120037449808533, -0.24778718991676368, -0.11236174250335758, 0.25942368708161945, 0.10813464338369443, 0.09143065242003276, -0.11864049204748618, 0.054703172049429045, -0.0384360351169624, 0.26088238300860345, 0.03317134623344704, 0.09330637315704289, 0.28256735750604944, 0.0866670272440227, -0.001092530921873932, 0.15967712395690778, -0.2121779223535599, -0.04818319770541177, -0.2867681989334075, -0.07007540015122259, -0.10022895449181518, 0.08111856539498072, -0.11971688677461437, -0.15161589402368808, 0.37080468485191703, 0.09430829159556384, 0.24258306477944475, 0.01821099045914579, 0.3158670016078196, 0.16521214007705742, 0.06721553912229207, 0.11179384143918333, 0.3360323585723209, 0.10202516474102785, 0.15330313399235856, -0.32656505532435565, 0.12458902129989462, 0.016375003252589858]
|
1,803.06091
|
Salient Objects in Clutter: Bringing Salient Object Detection to the
Foreground
|
We provide a comprehensive evaluation of salient object detection (SOD)
models. Our analysis identifies a serious design bias of existing SOD datasets
which assumes that each image contains at least one clearly outstanding salient
object in low clutter. The design bias has led to a saturated high performance
for state-of-the-art SOD models when evaluated on existing datasets. The
models, however, still perform far from being satisfactory when applied to
real-world daily scenes. Based on our analyses, we first identify 7 crucial
aspects that a comprehensive and balanced dataset should fulfill. Then, we
propose a new high quality dataset and update the previous saliency benchmark.
Specifically, our SOC (Salient Objects in Clutter) dataset, includes images
with salient and non-salient objects from daily object categories. Beyond
object category annotations, each salient image is accompanied by attributes
that reflect common challenges in real-world scenes. Finally, we report
attribute-based performance assessment on our dataset.
|
cs.CV
|
we provide a comprehensive evaluation of salient object detection sod models our analysis identifies a serious design bias of existing sod datasets which assumes that each image contains at least one clearly outstanding salient object in low clutter the design bias has led to a saturated high performance for stateoftheart sod models when evaluated on existing datasets the models however still perform far from being satisfactory when applied to realworld daily scenes based on our analyses we first identify 7 crucial aspects that a comprehensive and balanced dataset should fulfill then we propose a new high quality dataset and update the previous saliency benchmark specifically our soc salient objects in clutter dataset includes images with salient and nonsalient objects from daily object categories beyond object category annotations each salient image is accompanied by attributes that reflect common challenges in realworld scenes finally we report attributebased performance assessment on our dataset
|
[['we', 'provide', 'a', 'comprehensive', 'evaluation', 'of', 'salient', 'object', 'detection', 'sod', 'models', 'our', 'analysis', 'identifies', 'a', 'serious', 'design', 'bias', 'of', 'existing', 'sod', 'datasets', 'which', 'assumes', 'that', 'each', 'image', 'contains', 'at', 'least', 'one', 'clearly', 'outstanding', 'salient', 'object', 'in', 'low', 'clutter', 'the', 'design', 'bias', 'has', 'led', 'to', 'a', 'saturated', 'high', 'performance', 'for', 'stateoftheart', 'sod', 'models', 'when', 'evaluated', 'on', 'existing', 'datasets', 'the', 'models', 'however', 'still', 'perform', 'far', 'from', 'being', 'satisfactory', 'when', 'applied', 'to', 'realworld', 'daily', 'scenes', 'based', 'on', 'our', 'analyses', 'we', 'first', 'identify', '7', 'crucial', 'aspects', 'that', 'a', 'comprehensive', 'and', 'balanced', 'dataset', 'should', 'fulfill', 'then', 'we', 'propose', 'a', 'new', 'high', 'quality', 'dataset', 'and', 'update', 'the', 'previous', 'saliency', 'benchmark', 'specifically', 'our', 'soc', 'salient', 'objects', 'in', 'clutter', 'dataset', 'includes', 'images', 'with', 'salient', 'and', 'nonsalient', 'objects', 'from', 'daily', 'object', 'categories', 'beyond', 'object', 'category', 'annotations', 'each', 'salient', 'image', 'is', 'accompanied', 'by', 'attributes', 'that', 'reflect', 'common', 'challenges', 'in', 'realworld', 'scenes', 'finally', 'we', 'report', 'attributebased', 'performance', 'assessment', 'on', 'our', 'dataset']]
|
[-0.04279937301451961, -0.07386986879360241, -0.04813616880370925, 0.05823080324955905, -0.1198896259162575, -0.18049452967631321, 0.016285159904509783, 0.4489232973009348, -0.1633456870758285, -0.37064591955393555, 0.09507442001330976, -0.31107449892908334, -0.15960150685782235, 0.193609140937527, -0.2079895869231162, 0.04537328591415038, 0.18661534215634068, 0.051427849137107844, -0.026640594142178696, -0.2813828082755208, 0.31492111235080905, 0.05338949014743169, 0.3685766594360272, 0.040470569141519565, 0.14710732467472554, -0.0660780017543584, -0.07261961434851401, 0.03469622355264922, -0.04066558955853301, 0.1375424496010722, 0.3288794430874744, 0.19081719617980222, 0.2709579203813337, -0.3788331642126044, -0.22655723677327236, 0.037666072860981024, 0.11987209688872098, 0.08751876468867219, -0.06543727583484724, -0.39041972399999697, 0.10611039962464322, -0.1464944170912107, 0.020762203537548582, -0.15435242103412747, 0.029129896382025133, -0.058922827446355464, -0.2461759264926271, 0.06394234838274618, 0.050185741089905304, 0.10743962595239281, -0.06487272720240678, -0.14729061010992153, 0.018194764154031873, 0.17733308567704323, 0.024056752026469137, 0.01734133795602247, 0.17512096475499372, -0.2267583438177826, -0.14208076597269004, 0.40776203508178394, -0.034478571429305396, -0.17156753283614914, 0.24434058108832687, -0.08037686009891332, -0.21001825192322335, 0.1562949295838674, 0.21411816984104615, 0.1358026134315878, -0.13783370184809124, -0.017885577493386033, -0.09616403283240894, 0.20507344087352977, 0.007149403960211203, -0.018336530411615967, 0.2284198692906648, 0.2977032755408436, -0.0049685416929423805, 0.1533870177405576, -0.16161734611572076, -0.009394289118548234, -0.2518149900560578, -0.05471023618554076, -0.12926992537764212, -0.04535455514288818, -0.0947241308746743, -0.1331420284944276, 0.4490116053260863, 0.3335732135983805, 0.20248438544416178, 0.03505973803810775, 0.38246584495529534, -0.047484929899995525, 0.09684093866497279, 0.06549102885338168, 0.18443415095408758, -0.057806517809319, 0.08897700553139051, -0.1266022072577228, 0.0658029800405105, 0.0323868598540624]
|
1,803.06092
|
A Dataset and Architecture for Visual Reasoning with a Working Memory
|
A vexing problem in artificial intelligence is reasoning about events that
occur in complex, changing visual stimuli such as in video analysis or game
play. Inspired by a rich tradition of visual reasoning and memory in cognitive
psychology and neuroscience, we developed an artificial, configurable visual
question and answer dataset (COG) to parallel experiments in humans and
animals. COG is much simpler than the general problem of video analysis, yet it
addresses many of the problems relating to visual and logical reasoning and
memory -- problems that remain challenging for modern deep learning
architectures. We additionally propose a deep learning architecture that
performs competitively on other diagnostic VQA datasets (i.e. CLEVR) as well as
easy settings of the COG dataset. However, several settings of COG result in
datasets that are progressively more challenging to learn. After training, the
network can zero-shot generalize to many new tasks. Preliminary analyses of the
network architectures trained on COG demonstrate that the network accomplishes
the task in a manner interpretable to humans.
|
cs.AI cs.CV cs.LG
|
a vexing problem in artificial intelligence is reasoning about events that occur in complex changing visual stimuli such as in video analysis or game play inspired by a rich tradition of visual reasoning and memory in cognitive psychology and neuroscience we developed an artificial configurable visual question and answer dataset cog to parallel experiments in humans and animals cog is much simpler than the general problem of video analysis yet it addresses many of the problems relating to visual and logical reasoning and memory problems that remain challenging for modern deep learning architectures we additionally propose a deep learning architecture that performs competitively on other diagnostic vqa datasets ie clevr as well as easy settings of the cog dataset however several settings of cog result in datasets that are progressively more challenging to learn after training the network can zeroshot generalize to many new tasks preliminary analyses of the network architectures trained on cog demonstrate that the network accomplishes the task in a manner interpretable to humans
|
[['a', 'vexing', 'problem', 'in', 'artificial', 'intelligence', 'is', 'reasoning', 'about', 'events', 'that', 'occur', 'in', 'complex', 'changing', 'visual', 'stimuli', 'such', 'as', 'in', 'video', 'analysis', 'or', 'game', 'play', 'inspired', 'by', 'a', 'rich', 'tradition', 'of', 'visual', 'reasoning', 'and', 'memory', 'in', 'cognitive', 'psychology', 'and', 'neuroscience', 'we', 'developed', 'an', 'artificial', 'configurable', 'visual', 'question', 'and', 'answer', 'dataset', 'cog', 'to', 'parallel', 'experiments', 'in', 'humans', 'and', 'animals', 'cog', 'is', 'much', 'simpler', 'than', 'the', 'general', 'problem', 'of', 'video', 'analysis', 'yet', 'it', 'addresses', 'many', 'of', 'the', 'problems', 'relating', 'to', 'visual', 'and', 'logical', 'reasoning', 'and', 'memory', 'problems', 'that', 'remain', 'challenging', 'for', 'modern', 'deep', 'learning', 'architectures', 'we', 'additionally', 'propose', 'a', 'deep', 'learning', 'architecture', 'that', 'performs', 'competitively', 'on', 'other', 'diagnostic', 'vqa', 'datasets', 'ie', 'clevr', 'as', 'well', 'as', 'easy', 'settings', 'of', 'the', 'cog', 'dataset', 'however', 'several', 'settings', 'of', 'cog', 'result', 'in', 'datasets', 'that', 'are', 'progressively', 'more', 'challenging', 'to', 'learn', 'after', 'training', 'the', 'network', 'can', 'zeroshot', 'generalize', 'to', 'many', 'new', 'tasks', 'preliminary', 'analyses', 'of', 'the', 'network', 'architectures', 'trained', 'on', 'cog', 'demonstrate', 'that', 'the', 'network', 'accomplishes', 'the', 'task', 'in', 'a', 'manner', 'interpretable', 'to', 'humans']]
|
[-0.057602097391162045, 0.012098973956444261, -0.05557355487406879, 0.11958370939828455, -0.16705895672569018, -0.22753826343638453, 0.014184491677853853, 0.47070757843955546, -0.2674513237138173, -0.3763838146372648, 0.060206355215440654, -0.24380245711096746, -0.2537798755105116, 0.23433473371743074, -0.2063611528109815, 0.06054762564041836, 0.15195282073803024, 0.0610055943182809, 0.0060454555215525944, -0.295044751726314, 0.28152161230985634, 0.021653214083011345, 0.31240885081829245, 0.02275386614819799, 0.1237420812519309, -0.04242218769306016, -0.014467341306202482, 0.0030498690547666953, -0.012435452376527526, 0.17697095121033937, 0.39755452184207335, 0.2839875517574747, 0.3638029765326552, -0.4394721402976631, -0.23063485800918793, 0.06565554204402481, 0.17319815742788824, 0.10587732296616179, -0.006192690773443932, -0.35610135273818305, 0.04785141624052992, -0.13110023420750203, 0.04242296724072741, -0.16952453604007062, 0.02935066646101611, -0.08539841688812493, -0.2512745806218186, 0.013874760478969196, 0.11048926678165504, 0.1384129017245716, -0.046674085937128094, -0.09704330051248101, 0.06104918551341279, 0.18927807056813495, 0.029103691953385427, 0.0743430830945378, 0.18372235451072097, -0.22653936430488428, -0.18830139437846527, 0.37895550863527344, -0.010395218444375383, -0.17428604691306096, 0.24673720075564828, 0.010608528113316097, -0.20747195467252486, 0.03143159043696336, 0.2396258776881983, 0.12517017080353762, -0.1648245615338137, -0.002684581459466435, -0.09284283105886268, 0.18949532093937527, 0.06099665950855497, -0.0345120733296415, 0.17205137516647956, 0.294098761838911, 0.02685359934788242, 0.12035520150971706, -0.053807244428383284, -0.1179625724419996, -0.13629240187409217, -0.08473154428989409, -0.15058405420737353, -0.023180984169583557, -0.08823229892205163, -0.12943872884949348, 0.3591337858136007, 0.25901829497888684, 0.19527072058488687, 0.11026081934705109, 0.3667686884179934, -0.03166952027456869, 0.11564485979138199, 0.06853151817570446, 0.1406064660756843, 0.006035719525548601, 0.19706891396244663, -0.16225944975569487, 0.08547555939656888, -0.00876154507716705]
|
1,803.06093
|
Holomorphic sectional curvature, nefness and Miyaoka-Yau type inequality
|
On a compact K\"ahler manifold, we introduce a notion of almost nonpositivity
for the holomorphic sectional curvature, which by definition is weaker than the
existence of a K\"ahler metric with semi-negative holomorphic sectional
curvature. We prove that a compact K\"ahler manifold of almost nonpositive
holomorphic sectional curvature has a nef canonical line bundle, contains no
rational curves and satisfies some Miyaoka-Yau type inequalities. In the course
of the discussions, we attach a real value to any fixed K\"ahler class which,
up to a constant factor depending only on the dimension of manifold, turns out
to be an upper bound for the nef threshold.
|
math.DG
|
on a compact kahler manifold we introduce a notion of almost nonpositivity for the holomorphic sectional curvature which by definition is weaker than the existence of a kahler metric with seminegative holomorphic sectional curvature we prove that a compact kahler manifold of almost nonpositive holomorphic sectional curvature has a nef canonical line bundle contains no rational curves and satisfies some miyaokayau type inequalities in the course of the discussions we attach a real value to any fixed kahler class which up to a constant factor depending only on the dimension of manifold turns out to be an upper bound for the nef threshold
|
[['on', 'a', 'compact', 'kahler', 'manifold', 'we', 'introduce', 'a', 'notion', 'of', 'almost', 'nonpositivity', 'for', 'the', 'holomorphic', 'sectional', 'curvature', 'which', 'by', 'definition', 'is', 'weaker', 'than', 'the', 'existence', 'of', 'a', 'kahler', 'metric', 'with', 'seminegative', 'holomorphic', 'sectional', 'curvature', 'we', 'prove', 'that', 'a', 'compact', 'kahler', 'manifold', 'of', 'almost', 'nonpositive', 'holomorphic', 'sectional', 'curvature', 'has', 'a', 'nef', 'canonical', 'line', 'bundle', 'contains', 'no', 'rational', 'curves', 'and', 'satisfies', 'some', 'miyaokayau', 'type', 'inequalities', 'in', 'the', 'course', 'of', 'the', 'discussions', 'we', 'attach', 'a', 'real', 'value', 'to', 'any', 'fixed', 'kahler', 'class', 'which', 'up', 'to', 'a', 'constant', 'factor', 'depending', 'only', 'on', 'the', 'dimension', 'of', 'manifold', 'turns', 'out', 'to', 'be', 'an', 'upper', 'bound', 'for', 'the', 'nef', 'threshold']]
|
[-0.23791909631052352, 0.05151350907509518, -0.09175209960113596, 0.08879294813027407, -0.19060709354359187, -0.21765796244325278, -0.002133941594330431, 0.3629212294980992, -0.20657958568342807, -0.1662233838703013, 0.08723941888067943, -0.2684028847052634, -0.1598327679116532, 0.19003101456367855, -0.1302803055139132, -0.011660417397190067, 0.04351660740353818, 0.14628688826505998, -0.12499327609288388, -0.2988298151639824, 0.5435333376867896, -0.0030955795257451755, 0.1855381573550403, 0.1746573869988901, 0.16306903393197697, -0.08279242612493848, 0.05147677717404892, 0.011856668565458464, -0.19061019147094396, 0.1383516423808845, 0.21180939868327628, 0.07693332526832819, 0.23780413922058075, -0.3274555821604665, -0.1995592535319693, 0.28351343206120927, 0.06600106724433927, -0.04174199016330746, 0.00591556890189503, -0.2721346953377417, 0.12289557270284683, -0.02908734820593257, -0.23034864893517665, -0.11204551827632686, 0.05013092045301517, -0.07210929223417657, -0.19888358394552058, -0.02117506702186413, 0.12232964212816318, 0.08111830960673244, -0.07809977595088552, -0.12255862470969413, -0.0942624958833336, 0.0072017158415548285, 0.0199919106434235, 0.09907427781094227, 0.15536202328026438, -0.05497504401589219, -0.059028464175073556, 0.29905690312909994, -0.17846668867727186, -0.3033318704500505, 0.010878909227790909, -0.12408724371389061, -0.1699281076864493, 0.16956437826020987, 0.13490873682809976, 0.21015117485618706, -0.027670139125864773, 0.18688057935107227, -0.09161687867480864, 0.12869045664375486, 0.14017822674376149, -0.03385378870755904, 0.10872969844206734, 0.07482457691261056, 0.2089707815242045, 0.08069814474873462, 0.004145104551091067, -0.0908754900079763, -0.41624582616738903, -0.25828497421767255, -0.13187800488125045, 0.28948161802232014, -0.1817604355395091, -0.21759500493774714, 0.3750658821386909, -0.06951743656389632, 0.2525486983178021, 0.18371839562060258, 0.20786312316517228, 0.02921310179749305, 0.0930697604023752, 0.11228970166417833, 0.24447766490403824, 0.21425037511208464, 0.016871683209121805, -0.06720323887997244, -0.035366386386511614, 0.14173040308456109]
|
1,803.06094
|
Turbulence, Accretion Braking Torques and Efficient Jets Without
Magnetocentrifugal Acceleration: Core Concepts
|
I discuss three mutually-supportive notions or assumptions regarding jets and
accretion. The first is magnetocentrifugal acceleration (MCA), the
overwhelmingly favored mechanism for the production of jets in most steady
accreting systems. The second is the zero-torque inner boundary condition. The
third is that effective viscous dissipation is like real dissipation, leading
directly to heating. All three assumptions fit nicely together in a manner that
is simple, persuasive, and mutually-consistent. All, I argue, are incorrect.
For concreteness I focus on protostars. Magnetohydrodynamic (MHD) turbulence in
accretion is not a sink of energy, but a reservoir, capable of doing mechanical
work directly and therefore efficiently, rather than solely through ohmic
("viscous") heating. Advection of turbulence energy reduces the effective
radiative efficiency, and may help solve the missing boundary-layer emission
problem. The angular momentum problem, whereby accretion spins up a protostar
to breakup, is resolved by allowing direct viscous coupling to the protostar,
permitting substantially greater energy to be deposited into the accretion flow
than otherwise possible. This goes not into heat, but into a turbulent,
tangled, buoyant toroidal magnetic field. I argue that there is neither an
angular momentum problem nor an efficiency problem that MCA is needed to solve.
Moreover, the turbulent magnetic field has ample ability not just to collimate
but to accelerate gas, first radially inwards through tension forces and then
vertically through pressure forces, without any MCA mechanism. I suggest then
that jets, particularly the most powerful and well-collimated protostellar
jets, are not magnetocentrifugally driven.
|
astro-ph.SR astro-ph.HE
|
i discuss three mutuallysupportive notions or assumptions regarding jets and accretion the first is magnetocentrifugal acceleration mca the overwhelmingly favored mechanism for the production of jets in most steady accreting systems the second is the zerotorque inner boundary condition the third is that effective viscous dissipation is like real dissipation leading directly to heating all three assumptions fit nicely together in a manner that is simple persuasive and mutuallyconsistent all i argue are incorrect for concreteness i focus on protostars magnetohydrodynamic mhd turbulence in accretion is not a sink of energy but a reservoir capable of doing mechanical work directly and therefore efficiently rather than solely through ohmic viscous heating advection of turbulence energy reduces the effective radiative efficiency and may help solve the missing boundarylayer emission problem the angular momentum problem whereby accretion spins up a protostar to breakup is resolved by allowing direct viscous coupling to the protostar permitting substantially greater energy to be deposited into the accretion flow than otherwise possible this goes not into heat but into a turbulent tangled buoyant toroidal magnetic field i argue that there is neither an angular momentum problem nor an efficiency problem that mca is needed to solve moreover the turbulent magnetic field has ample ability not just to collimate but to accelerate gas first radially inwards through tension forces and then vertically through pressure forces without any mca mechanism i suggest then that jets particularly the most powerful and wellcollimated protostellar jets are not magnetocentrifugally driven
|
[['i', 'discuss', 'three', 'mutuallysupportive', 'notions', 'or', 'assumptions', 'regarding', 'jets', 'and', 'accretion', 'the', 'first', 'is', 'magnetocentrifugal', 'acceleration', 'mca', 'the', 'overwhelmingly', 'favored', 'mechanism', 'for', 'the', 'production', 'of', 'jets', 'in', 'most', 'steady', 'accreting', 'systems', 'the', 'second', 'is', 'the', 'zerotorque', 'inner', 'boundary', 'condition', 'the', 'third', 'is', 'that', 'effective', 'viscous', 'dissipation', 'is', 'like', 'real', 'dissipation', 'leading', 'directly', 'to', 'heating', 'all', 'three', 'assumptions', 'fit', 'nicely', 'together', 'in', 'a', 'manner', 'that', 'is', 'simple', 'persuasive', 'and', 'mutuallyconsistent', 'all', 'i', 'argue', 'are', 'incorrect', 'for', 'concreteness', 'i', 'focus', 'on', 'protostars', 'magnetohydrodynamic', 'mhd', 'turbulence', 'in', 'accretion', 'is', 'not', 'a', 'sink', 'of', 'energy', 'but', 'a', 'reservoir', 'capable', 'of', 'doing', 'mechanical', 'work', 'directly', 'and', 'therefore', 'efficiently', 'rather', 'than', 'solely', 'through', 'ohmic', 'viscous', 'heating', 'advection', 'of', 'turbulence', 'energy', 'reduces', 'the', 'effective', 'radiative', 'efficiency', 'and', 'may', 'help', 'solve', 'the', 'missing', 'boundarylayer', 'emission', 'problem', 'the', 'angular', 'momentum', 'problem', 'whereby', 'accretion', 'spins', 'up', 'a', 'protostar', 'to', 'breakup', 'is', 'resolved', 'by', 'allowing', 'direct', 'viscous', 'coupling', 'to', 'the', 'protostar', 'permitting', 'substantially', 'greater', 'energy', 'to', 'be', 'deposited', 'into', 'the', 'accretion', 'flow', 'than', 'otherwise', 'possible', 'this', 'goes', 'not', 'into', 'heat', 'but', 'into', 'a', 'turbulent', 'tangled', 'buoyant', 'toroidal', 'magnetic', 'field', 'i', 'argue', 'that', 'there', 'is', 'neither', 'an', 'angular', 'momentum', 'problem', 'nor', 'an', 'efficiency', 'problem', 'that', 'mca', 'is', 'needed', 'to', 'solve', 'moreover', 'the', 'turbulent', 'magnetic', 'field', 'has', 'ample', 'ability', 'not', 'just', 'to', 'collimate', 'but', 'to', 'accelerate', 'gas', 'first', 'radially', 'inwards', 'through', 'tension', 'forces', 'and', 'then', 'vertically', 'through', 'pressure', 'forces', 'without', 'any', 'mca', 'mechanism', 'i', 'suggest', 'then', 'that', 'jets', 'particularly', 'the', 'most', 'powerful', 'and', 'wellcollimated', 'protostellar', 'jets', 'are', 'not', 'magnetocentrifugally', 'driven']]
|
[-0.12351125516021168, 0.18943759687328046, -0.06180246666796049, 0.10296262344725582, -0.1573674084466635, -0.1505841250455349, -0.02221526183302001, 0.37330029191715375, -0.2896733748082699, -0.29628646342577986, 0.05860638271456546, -0.2248905902690425, -0.012271112017808672, 0.1935291421012858, -0.007098871323146991, 4.46509807465636e-05, 0.07301868791977058, -0.07113649551471582, 0.0018617696573064492, -0.18142634826921383, 0.35552889105420776, 0.10695497183395283, 0.19141867542639374, 0.06681884663673687, 0.0803512684658778, -0.11540898026622907, -0.008722592175021122, 0.03439896887130275, -0.13146082820986726, 0.019874899520785833, 0.18738193586373664, 0.06739255853035316, 0.2802096545247228, -0.4975541260397556, -0.2534531573156769, 0.059353323059384615, 0.21302344642047372, 0.09117264248696821, -0.037995872813352975, -0.16756945695271905, 0.06548005942972757, -0.20689618941396476, -0.09263502676134967, -0.042827667715978256, 0.04106954013862248, -0.022372000422138643, -0.2822118934787387, 0.11478403832891727, 0.12770949811840962, 0.02637937638851605, -0.11002188057339352, -0.039679631092870725, -0.09559070479162797, 0.050029121507529396, 0.10872767289663304, 0.06816425582165925, 0.23228024294865982, -0.16276586668242757, -0.05950023703733269, 0.3882965496532163, -0.009538129458265683, -0.1997810570694202, 0.230201032402336, -0.17405390572753185, -0.09241258957784394, 0.21420572995189197, 0.14930648273237201, 0.11284397693840331, -0.14139881441417168, -0.007855432022039836, -0.013279521913381711, 0.16667698785586624, 0.023322809392548337, -0.04179217320182646, 0.2880722911800353, 0.13108246698500398, 0.052216976660550855, 0.11940320340336813, -0.11334942765171611, -0.09187260274656535, -0.2668758821540645, -0.15495426982299101, -0.16142582295804608, 0.1062472654629513, -0.06474904734641314, -0.12440439321062699, 0.30882876004111404, 0.15677282393871977, 0.17952960298529694, -0.0025289850314242804, 0.3722899552662762, 0.1018785888481201, 0.06828755925038868, 0.20944730423732985, 0.31744861918292483, 0.15564482484716086, 0.14519119657462046, -0.25542306757011757, 0.08146374898449499, 0.045973541846080705]
|
1,803.06095
|
On the Iwasawa asymptotic class number formula for
$\mathbb{Z}_p^r\rtimes\mathbb{Z}_p$-extensions
|
Let $p$ be an odd prime and $F_{\infty,\infty}$ a $p$-adic Lie extension of a
number field $F$ with Galois group isomorphic to
$\mathbb{Z}_p^r\rtimes\mathbb{Z}_p$, $r\geq 1$. Under certain assumptions, we
prove an asymptotic formula for the growth of $p$-exponents of the class groups
in the said $p$-adic Lie extension. This generalizes a previous result of Lei,
where he establishes such a formula in the case $r=1$. An important and new
ingredient towards extending Lei's result rests on an asymptotic formula for a
finitely generated (not necessarily torsion)
$\mathbb{Z}_p[[\mathbb{Z}_p^r]]$-module which we will also establish in this
paper. We then continue studying the growth of $p$-exponents of the class
groups under more restrictive assumptions and show that there is an asymptotic
formula in our noncommutative $p$-adic Lie extension analogous to a refined
formula of Monsky (which is for the commutative extension) in a special case.
|
math.NT
|
let p be an odd prime and f_inftyinfty a padic lie extension of a number field f with galois group isomorphic to mathbbz_prrtimesmathbbz_p rgeq 1 under certain assumptions we prove an asymptotic formula for the growth of pexponents of the class groups in the said padic lie extension this generalizes a previous result of lei where he establishes such a formula in the case r1 an important and new ingredient towards extending leis result rests on an asymptotic formula for a finitely generated not necessarily torsion mathbbz_pmathbbz_prmodule which we will also establish in this paper we then continue studying the growth of pexponents of the class groups under more restrictive assumptions and show that there is an asymptotic formula in our noncommutative padic lie extension analogous to a refined formula of monsky which is for the commutative extension in a special case
|
[['let', 'p', 'be', 'an', 'odd', 'prime', 'and', 'f_inftyinfty', 'a', 'padic', 'lie', 'extension', 'of', 'a', 'number', 'field', 'f', 'with', 'galois', 'group', 'isomorphic', 'to', 'mathbbz_prrtimesmathbbz_p', 'rgeq', '1', 'under', 'certain', 'assumptions', 'we', 'prove', 'an', 'asymptotic', 'formula', 'for', 'the', 'growth', 'of', 'pexponents', 'of', 'the', 'class', 'groups', 'in', 'the', 'said', 'padic', 'lie', 'extension', 'this', 'generalizes', 'a', 'previous', 'result', 'of', 'lei', 'where', 'he', 'establishes', 'such', 'a', 'formula', 'in', 'the', 'case', 'r1', 'an', 'important', 'and', 'new', 'ingredient', 'towards', 'extending', 'leis', 'result', 'rests', 'on', 'an', 'asymptotic', 'formula', 'for', 'a', 'finitely', 'generated', 'not', 'necessarily', 'torsion', 'mathbbz_pmathbbz_prmodule', 'which', 'we', 'will', 'also', 'establish', 'in', 'this', 'paper', 'we', 'then', 'continue', 'studying', 'the', 'growth', 'of', 'pexponents', 'of', 'the', 'class', 'groups', 'under', 'more', 'restrictive', 'assumptions', 'and', 'show', 'that', 'there', 'is', 'an', 'asymptotic', 'formula', 'in', 'our', 'noncommutative', 'padic', 'lie', 'extension', 'analogous', 'to', 'a', 'refined', 'formula', 'of', 'monsky', 'which', 'is', 'for', 'the', 'commutative', 'extension', 'in', 'a', 'special', 'case']]
|
[-0.17250637457749585, 0.05986472608644278, -0.1620070559555571, 0.06994250832710133, -0.11015890040870407, -0.13529487310995836, -0.010096911293213263, 0.2786441549806179, -0.2721036117249202, -0.2255421343373416, 0.08696233256294546, -0.19108024044062863, -0.15661482618645958, 0.25826283013649126, -0.1545807800800549, -0.04320134987163512, -0.008828720719412826, 0.13527657728133013, -0.05512635694756407, -0.274882757259037, 0.36143504838934903, -0.004114349821595837, 0.20819300439597355, 0.05701424508680516, 0.04914535857107249, 0.057421694519735285, -0.012303533429521129, -0.03563393485772578, -0.187592621258112, 0.1143862276920955, 0.3014613653687264, 0.04873714142934613, 0.28034414908523747, -0.3735530314256819, -0.14047469580613023, 0.2286355025235483, 0.15510735120758307, 0.03381769915057762, -0.07276193464307613, -0.24035522117105265, 0.13769476547194043, -0.20574403229913266, -0.203735403997971, -0.030073424824681, 0.07170750765320878, -0.007166985609139845, -0.31599893773530724, 0.004954972022787581, 0.1671806199027212, 0.14616056963430363, -0.0776021651531697, -0.09221211555179396, 0.019276916052770914, 0.0373064896306224, 0.04680427994994487, 0.04116416599588107, 0.04722196637257505, -0.06965550575941372, -0.08790705822367999, 0.3457812349372309, -0.08075572696360324, -0.2132449831491966, 0.11879495921605032, -0.17816594009213954, -0.24087330280206828, 0.08502108803129481, 0.07563372538341276, 0.18977559528735688, -0.0442093186174258, 0.1908858301835771, -0.16562690989201445, 0.07590553043879193, 0.09127560663271508, -0.01540210112098524, 0.11668501638978211, 0.09372683292214605, 0.10938386102173504, 0.16134977708453407, 0.0374204554216494, -0.022560716325269757, -0.38560862338049806, -0.21028981308901695, -0.13089619188991597, 0.14574105294746692, -0.10754779711830105, -0.15661075785957115, 0.35615398411190125, 0.11664670014673535, 0.15591519404698512, 0.15152981386540068, 0.19790360816627098, 0.1091133429469514, 0.0536389189283196, 0.06991717544687483, 0.12200414609137199, 0.23492109642209982, -0.03724423223074606, -0.11547082857222116, 0.01332170722952528, 0.16768892855792167]
|
1,803.06096
|
Expected Time to Extinction of SIS Epidemic Model Using Quasy Stationary
Distribution
|
We study that the breakdown of epidemic depends on some parameters, that is
expressed in epidemic reproduction ratio number. It is noted that when $R_0 $
exceeds 1, the stochastic model have two different results. But, eventually the
extinction will be reached even though the major epidemic occurs. The question
is how long this process will reach extinction. In this paper, we will focus on
the Markovian process of SIS model when major epidemic occurs. Using the
approximation of quasi--stationary distribution, the expected mean time of
extinction only occurs when the process is one step away from being extinct.
Combining the theorm from Ethier and Kurtz, we use CLT to find the
approximation of this quasi distribution and successfully determine the
asymptotic mean time to extinction of SIS model without demography.
|
math.ST math.PR q-bio.PE stat.TH
|
we study that the breakdown of epidemic depends on some parameters that is expressed in epidemic reproduction ratio number it is noted that when r_0 exceeds 1 the stochastic model have two different results but eventually the extinction will be reached even though the major epidemic occurs the question is how long this process will reach extinction in this paper we will focus on the markovian process of sis model when major epidemic occurs using the approximation of quasistationary distribution the expected mean time of extinction only occurs when the process is one step away from being extinct combining the theorm from ethier and kurtz we use clt to find the approximation of this quasi distribution and successfully determine the asymptotic mean time to extinction of sis model without demography
|
[['we', 'study', 'that', 'the', 'breakdown', 'of', 'epidemic', 'depends', 'on', 'some', 'parameters', 'that', 'is', 'expressed', 'in', 'epidemic', 'reproduction', 'ratio', 'number', 'it', 'is', 'noted', 'that', 'when', 'r_0', 'exceeds', '1', 'the', 'stochastic', 'model', 'have', 'two', 'different', 'results', 'but', 'eventually', 'the', 'extinction', 'will', 'be', 'reached', 'even', 'though', 'the', 'major', 'epidemic', 'occurs', 'the', 'question', 'is', 'how', 'long', 'this', 'process', 'will', 'reach', 'extinction', 'in', 'this', 'paper', 'we', 'will', 'focus', 'on', 'the', 'markovian', 'process', 'of', 'sis', 'model', 'when', 'major', 'epidemic', 'occurs', 'using', 'the', 'approximation', 'of', 'quasistationary', 'distribution', 'the', 'expected', 'mean', 'time', 'of', 'extinction', 'only', 'occurs', 'when', 'the', 'process', 'is', 'one', 'step', 'away', 'from', 'being', 'extinct', 'combining', 'the', 'theorm', 'from', 'ethier', 'and', 'kurtz', 'we', 'use', 'clt', 'to', 'find', 'the', 'approximation', 'of', 'this', 'quasi', 'distribution', 'and', 'successfully', 'determine', 'the', 'asymptotic', 'mean', 'time', 'to', 'extinction', 'of', 'sis', 'model', 'without', 'demography']]
|
[-0.07278636867144647, 0.11793938322494237, -0.10497884016412382, 0.10893157623559091, 0.01740560899130427, -0.16153322812886192, 0.08709790221003529, 0.3730128037241789, -0.2635932772205426, -0.25105441560198627, 0.1377739824157638, -0.260477482004521, -0.14743268748996063, 0.1374437383429792, -0.07084357814075282, -0.0004149996424810244, 0.06559618304555233, 0.03081486215814948, 0.01120921064956257, -0.2758744440525054, 0.3184953961879588, 0.061673803652565064, 0.26057101308296504, 0.04842239603122624, 0.08487497963942588, 0.011306012629602964, -0.018953686147086465, -0.01488024344882713, -0.16961809107580428, 0.005166045529767871, 0.20615576467512606, 0.1450213191189015, 0.30052930881770756, -0.408002101816237, -0.22194598313564293, 0.16907236371547557, 0.20830661875818177, 0.1684038162535916, 0.03723379198837882, -0.22158589746015003, 0.05415028413900962, -0.1601000886123914, -0.18429678493680862, 0.038489507432453905, 0.030946841083753566, 0.040274335506658716, -0.24351982017262624, 0.10994033862102347, 0.0673811769256225, 0.04554651600237076, -0.0029931818045532475, -0.11583761223233663, -0.05509142508157171, 0.15822185335765915, 0.08854706052784772, -0.0060526369193282265, 0.16329172782671567, -0.12933309349912003, -0.049294322757766795, 0.32903376886119634, -0.0800420830778491, -0.14087813867327686, 0.14519682202774745, -0.2043194408241946, -0.13745888132745257, 0.14536062233293287, 0.18277160867045705, 0.09920894615710354, -0.15445841554756043, 0.04456292985705659, -0.022056464478373526, 0.14303167866131003, 0.061298991460353135, -0.04105862919599391, 0.13263793853469766, 0.2384223764995113, 0.07184189767397653, 0.08489487583193785, -0.12160518220625818, -0.1674079027152262, -0.27664392330468845, -0.08985575190028892, -0.16618378981858348, 0.12342205808963627, -0.11275036264045271, -0.14113236338313212, 0.35480585461482406, 0.22234826441137837, 0.19406900289468468, 0.10783908720164058, 0.2528240749496035, 0.1771055609990771, 0.0003859774693130301, 0.0781781720678107, 0.2586415300873341, 0.09052666493046742, 0.09087318165066581, -0.19235704318942645, 0.20474671016608437, 0.02297628795584807]
|
1,803.06097
|
Evolution of superconductivity in ultrathin NbS2
|
We report a systematic study of thickness-dependent superconductivity and
carrier transport properties in exfoliated layered 2H-NbS2. Hall-effect
measurements reveal 2H-NbS2 in its normal state to be a p-type metal with hole
mobility of 1-3 cm2/Vs. The superconducting transition temperature is found to
decrease with thickness. We find that the suppression of superconductivity is
due to disorder resulting from the incorporation of atmospheric oxygen and a
reduced hole density. Cross-section transmission electron microscope (TEM)
imaging reveals a chemical change of NbS2 in ambient conditions, resulting in
the formation of amorphous oxide layers sandwiching crystalline layered NbS2.
Though few-nm-thick 2H-NbS2 completely converts to amorphous oxide in ambient
conditions, PMMA encapsulation prevents further chemical change and preserves
superconductivity.
|
cond-mat.supr-con cond-mat.mtrl-sci
|
we report a systematic study of thicknessdependent superconductivity and carrier transport properties in exfoliated layered 2hnbs2 halleffect measurements reveal 2hnbs2 in its normal state to be a ptype metal with hole mobility of 13 cm2vs the superconducting transition temperature is found to decrease with thickness we find that the suppression of superconductivity is due to disorder resulting from the incorporation of atmospheric oxygen and a reduced hole density crosssection transmission electron microscope tem imaging reveals a chemical change of nbs2 in ambient conditions resulting in the formation of amorphous oxide layers sandwiching crystalline layered nbs2 though fewnmthick 2hnbs2 completely converts to amorphous oxide in ambient conditions pmma encapsulation prevents further chemical change and preserves superconductivity
|
[['we', 'report', 'a', 'systematic', 'study', 'of', 'thicknessdependent', 'superconductivity', 'and', 'carrier', 'transport', 'properties', 'in', 'exfoliated', 'layered', '2hnbs2', 'halleffect', 'measurements', 'reveal', '2hnbs2', 'in', 'its', 'normal', 'state', 'to', 'be', 'a', 'ptype', 'metal', 'with', 'hole', 'mobility', 'of', '13', 'cm2vs', 'the', 'superconducting', 'transition', 'temperature', 'is', 'found', 'to', 'decrease', 'with', 'thickness', 'we', 'find', 'that', 'the', 'suppression', 'of', 'superconductivity', 'is', 'due', 'to', 'disorder', 'resulting', 'from', 'the', 'incorporation', 'of', 'atmospheric', 'oxygen', 'and', 'a', 'reduced', 'hole', 'density', 'crosssection', 'transmission', 'electron', 'microscope', 'tem', 'imaging', 'reveals', 'a', 'chemical', 'change', 'of', 'nbs2', 'in', 'ambient', 'conditions', 'resulting', 'in', 'the', 'formation', 'of', 'amorphous', 'oxide', 'layers', 'sandwiching', 'crystalline', 'layered', 'nbs2', 'though', 'fewnmthick', '2hnbs2', 'completely', 'converts', 'to', 'amorphous', 'oxide', 'in', 'ambient', 'conditions', 'pmma', 'encapsulation', 'prevents', 'further', 'chemical', 'change', 'and', 'preserves', 'superconductivity']]
|
[-0.16003112826172425, 0.20127172962883894, -0.04292866696158181, -0.08627265560562196, 0.005295891450394107, -0.1543585615516033, 0.13422662954291573, 0.4193371646349197, -0.255051111664785, -0.2979331659396058, -0.0201251584722701, -0.34107422828674316, -0.13031677321490387, 0.13018043616219707, -0.012086638079389282, 0.0077001444504434325, -0.04160690867220578, -0.12387339677864119, -0.18896027836827156, -0.2062091447991881, 0.2734637787889527, 0.06305545823567588, 0.38357200986381784, 0.13769914660926746, 0.020761223555967698, -0.031112963611098086, 0.14245832174732956, 0.03154690571068584, -0.18968802433614063, 0.01022086991402118, 0.29273071894827096, -0.13171032786004894, 0.14044114089692417, -0.47687697413822877, -0.2872594326977497, -0.05919454116475485, 0.09626382383639398, 0.12959666838869452, -0.14760129201509384, -0.2241940516249641, 0.09837483769363684, -0.12038261725810236, -0.10150975302550132, -0.04862630538966345, -0.04927683910683972, -0.06989932905720628, -0.23728947945587012, 0.14483602161964645, 0.025967389630639683, 0.09288416040615867, -0.14707656692733745, -0.11115835268998205, -0.1563325058263929, 0.02892505794601596, 0.01986222791525981, 0.012766380006771372, 0.29781580508722033, -0.10032605602527442, -0.0214642233579703, 0.3366594074536925, -0.039201915350175746, -0.012898704176262507, 0.1949200173151558, -0.20661108139092507, -0.02433330869788061, 0.241369903601868, 0.09421870316803942, 0.07632664468078672, -0.17074292941099922, 0.05371282486822051, 0.006459836310545064, 0.24356533395652863, 0.10754933198509009, 0.11593601032686622, 0.2302535554961018, 0.2711009585136629, 0.044824591513885105, 0.14289586854106545, -0.12782069855501227, 0.03655901582628165, -0.12126862704551414, -0.27595390053870883, -0.16052136795352334, 0.15218619163472044, -0.07620904244869725, -0.2524398259089693, 0.34154770039831817, 0.148427473369014, 0.1901615532277071, -0.12515611115478628, 0.20974403599115168, 0.0477817938253081, 0.07525094822251602, -0.008895820031023544, 0.23481752190172026, 0.22435449331836857, 0.15547056712372148, -0.29873384217043286, 0.14701568864123976, -0.030907288412361043]
|
1,803.06098
|
Skyrmions in models with pions and rho mesons
|
A problem with the standard Skyrme model is that Skyrmion binding energies
are around $15\%$, being much larger than the order $1\%$ binding energies of
the nuclei that they aim to describe. Here we consider theories that extend the
standard Skyrme model of pions by including rho mesons, via dimensional
deconstruction of Yang-Mills theory with an extra dimension. We report the
first results of parallel numerical computations of multi-Skyrmions in theories
of this type, including a model that reduces Skyrmion energies below those of
the standard Skyrme model whilst retaining exactly the same Faddeev-Bogomolny
energy bound. We compute all Skyrmions with baryons numbers up to 12 and find
that the inclusion of rho mesons reduces binding energies to less than $4\%,$
and therefore moves Skyrmion theory closer to experimental data. Furthermore,
we find that this dramatic reduction in binding energies is obtained without
changing the qualitative features of the Skyrmions, such as their symmetries.
|
hep-th
|
a problem with the standard skyrme model is that skyrmion binding energies are around 15 being much larger than the order 1 binding energies of the nuclei that they aim to describe here we consider theories that extend the standard skyrme model of pions by including rho mesons via dimensional deconstruction of yangmills theory with an extra dimension we report the first results of parallel numerical computations of multiskyrmions in theories of this type including a model that reduces skyrmion energies below those of the standard skyrme model whilst retaining exactly the same faddeevbogomolny energy bound we compute all skyrmions with baryons numbers up to 12 and find that the inclusion of rho mesons reduces binding energies to less than 4 and therefore moves skyrmion theory closer to experimental data furthermore we find that this dramatic reduction in binding energies is obtained without changing the qualitative features of the skyrmions such as their symmetries
|
[['a', 'problem', 'with', 'the', 'standard', 'skyrme', 'model', 'is', 'that', 'skyrmion', 'binding', 'energies', 'are', 'around', '15', 'being', 'much', 'larger', 'than', 'the', 'order', '1', 'binding', 'energies', 'of', 'the', 'nuclei', 'that', 'they', 'aim', 'to', 'describe', 'here', 'we', 'consider', 'theories', 'that', 'extend', 'the', 'standard', 'skyrme', 'model', 'of', 'pions', 'by', 'including', 'rho', 'mesons', 'via', 'dimensional', 'deconstruction', 'of', 'yangmills', 'theory', 'with', 'an', 'extra', 'dimension', 'we', 'report', 'the', 'first', 'results', 'of', 'parallel', 'numerical', 'computations', 'of', 'multiskyrmions', 'in', 'theories', 'of', 'this', 'type', 'including', 'a', 'model', 'that', 'reduces', 'skyrmion', 'energies', 'below', 'those', 'of', 'the', 'standard', 'skyrme', 'model', 'whilst', 'retaining', 'exactly', 'the', 'same', 'faddeevbogomolny', 'energy', 'bound', 'we', 'compute', 'all', 'skyrmions', 'with', 'baryons', 'numbers', 'up', 'to', '12', 'and', 'find', 'that', 'the', 'inclusion', 'of', 'rho', 'mesons', 'reduces', 'binding', 'energies', 'to', 'less', 'than', '4', 'and', 'therefore', 'moves', 'skyrmion', 'theory', 'closer', 'to', 'experimental', 'data', 'furthermore', 'we', 'find', 'that', 'this', 'dramatic', 'reduction', 'in', 'binding', 'energies', 'is', 'obtained', 'without', 'changing', 'the', 'qualitative', 'features', 'of', 'the', 'skyrmions', 'such', 'as', 'their', 'symmetries']]
|
[-0.06810625061222346, 0.19874762963540502, -0.05493852393579931, 0.11554719528390302, -0.03251230135998305, -0.13770029091830152, 0.05134412857971696, 0.33443957835046295, -0.1925524192865256, -0.3416394298421402, -0.019998159967180268, -0.33028243184454886, -0.06918144098702161, 0.13790109264968706, 0.031079478196653666, 0.009327793261797161, 0.03798352272761073, 0.08134726898781225, -0.10663391909717272, -0.2283991011501795, 0.29732256844104116, 0.04288578091883192, 0.2233602567575872, 0.09809868606537872, 0.044970294770334235, -0.016063753465263574, 0.05918800640277552, 0.022601533483324294, -0.16229398463374486, 0.1437968936957285, 0.18028182083447128, 0.024281723027610603, 0.18688092359457337, -0.4485576087182838, -0.2211787223882876, 0.10638708821528294, 0.1542831807080778, 0.19783956403204916, -0.014475201619515085, -0.24689727610439743, 0.1381036922734328, -0.19979140395907308, -0.15972486528829713, -0.13731079251548045, 0.01333657075084892, 0.0070494020302944325, -0.2073912688613157, 0.1041368489226728, 0.02668640061640759, 0.03238101142878626, -0.14539588024395403, -0.17755921953205578, -0.06718649209349178, 0.03632334723164711, 0.10558491737464423, 0.08059197905917767, 0.13316252935385586, -0.18967977771292985, -0.1537467526588467, 0.422326593121112, -0.017869525292494144, -0.1805227450977743, 0.1678188203353118, -0.1474430105661109, -0.13089852245962796, 0.14473775931743577, 0.13310013432968773, 0.12093376774596525, -0.09807058117577648, 0.09854137326143317, -0.04019794637927773, 0.21615461956213528, 0.07547589989981669, 0.03530192303051259, 0.14407584138117194, 0.17375485418254838, 0.0429730116803613, 0.11743658008145205, -0.06732391909653553, -0.13230340363567367, -0.3225065587161511, -0.11452825872259506, -0.13247780684987387, 0.0416059658826128, -0.0954139239968522, -0.11214567745238348, 0.3736120147046213, 0.13636537234479976, 0.20727873702983987, 0.08221461972239993, 0.2578674879813798, 0.08481173198959285, 0.12064497572905536, 0.08280160639349834, 0.2610460929146487, 0.12243512865259415, 0.06945077976930181, -0.22408291856222634, -0.0539192114074051, 0.0758585819511924]
|
1,803.06099
|
Kinematic dynamo action of a precession driven flow based on the results
of water experiments and hydrodynamic simulations
|
The project DRESDYN (DREsden Sodium facility for DYNamo and thermohydraulic
studies) conducted at Helmholtz-Zentrum Dresden-Rossendorf (HZDR) provides a
new platform for a variety of liquid sodium experiments devoted to problems of
geo- and astrophysical magnetohydrodynamics. The most ambitious experiment
within this project is a precession driven dynamo experiment that currently is
under construction. It consists of a cylinder filled with liquid sodium that
simultaneously rotates around two axes. The experiment is motivated by the idea
of a precession-driven flow as a complementary energy source for the geodynamo
or the ancient lunar dynamo.
In the present study we address numerical and experimental examinations in
order to identify parameter regions where the onset of magnetic field
excitation will be most probable. Both approaches show that in the strongly
nonlinear regime the flow is essentially composed of the directly forced
primary Kelvin mode and higher modes in terms of standing inertial waves that
arise from nonlinear self-interactions. A peculiarity is the resonance-like
emergence of an axisymmetric mode that represents a double roll structure in
the meridional plane, which, however, only occurs in a very limited range of
the precession ratio. This axisymmetric mode turns out to be beneficial for
dynamo action, and kinematic simulations of the magnetic field evolution
induced by the time-averaged flow exhibit magnetic field excitation at critical
magnetic Reynolds numbers around ${\rm{Rm}}^{\rm{c}}\approx 430$, which is well
within the range of the planned liquid sodium experiment.
|
physics.flu-dyn astro-ph.EP
|
the project dresdyn dresden sodium facility for dynamo and thermohydraulic studies conducted at helmholtzzentrum dresdenrossendorf hzdr provides a new platform for a variety of liquid sodium experiments devoted to problems of geo and astrophysical magnetohydrodynamics the most ambitious experiment within this project is a precession driven dynamo experiment that currently is under construction it consists of a cylinder filled with liquid sodium that simultaneously rotates around two axes the experiment is motivated by the idea of a precessiondriven flow as a complementary energy source for the geodynamo or the ancient lunar dynamo in the present study we address numerical and experimental examinations in order to identify parameter regions where the onset of magnetic field excitation will be most probable both approaches show that in the strongly nonlinear regime the flow is essentially composed of the directly forced primary kelvin mode and higher modes in terms of standing inertial waves that arise from nonlinear selfinteractions a peculiarity is the resonancelike emergence of an axisymmetric mode that represents a double roll structure in the meridional plane which however only occurs in a very limited range of the precession ratio this axisymmetric mode turns out to be beneficial for dynamo action and kinematic simulations of the magnetic field evolution induced by the timeaveraged flow exhibit magnetic field excitation at critical magnetic reynolds numbers around rmrmrmcapprox 430 which is well within the range of the planned liquid sodium experiment
|
[['the', 'project', 'dresdyn', 'dresden', 'sodium', 'facility', 'for', 'dynamo', 'and', 'thermohydraulic', 'studies', 'conducted', 'at', 'helmholtzzentrum', 'dresdenrossendorf', 'hzdr', 'provides', 'a', 'new', 'platform', 'for', 'a', 'variety', 'of', 'liquid', 'sodium', 'experiments', 'devoted', 'to', 'problems', 'of', 'geo', 'and', 'astrophysical', 'magnetohydrodynamics', 'the', 'most', 'ambitious', 'experiment', 'within', 'this', 'project', 'is', 'a', 'precession', 'driven', 'dynamo', 'experiment', 'that', 'currently', 'is', 'under', 'construction', 'it', 'consists', 'of', 'a', 'cylinder', 'filled', 'with', 'liquid', 'sodium', 'that', 'simultaneously', 'rotates', 'around', 'two', 'axes', 'the', 'experiment', 'is', 'motivated', 'by', 'the', 'idea', 'of', 'a', 'precessiondriven', 'flow', 'as', 'a', 'complementary', 'energy', 'source', 'for', 'the', 'geodynamo', 'or', 'the', 'ancient', 'lunar', 'dynamo', 'in', 'the', 'present', 'study', 'we', 'address', 'numerical', 'and', 'experimental', 'examinations', 'in', 'order', 'to', 'identify', 'parameter', 'regions', 'where', 'the', 'onset', 'of', 'magnetic', 'field', 'excitation', 'will', 'be', 'most', 'probable', 'both', 'approaches', 'show', 'that', 'in', 'the', 'strongly', 'nonlinear', 'regime', 'the', 'flow', 'is', 'essentially', 'composed', 'of', 'the', 'directly', 'forced', 'primary', 'kelvin', 'mode', 'and', 'higher', 'modes', 'in', 'terms', 'of', 'standing', 'inertial', 'waves', 'that', 'arise', 'from', 'nonlinear', 'selfinteractions', 'a', 'peculiarity', 'is', 'the', 'resonancelike', 'emergence', 'of', 'an', 'axisymmetric', 'mode', 'that', 'represents', 'a', 'double', 'roll', 'structure', 'in', 'the', 'meridional', 'plane', 'which', 'however', 'only', 'occurs', 'in', 'a', 'very', 'limited', 'range', 'of', 'the', 'precession', 'ratio', 'this', 'axisymmetric', 'mode', 'turns', 'out', 'to', 'be', 'beneficial', 'for', 'dynamo', 'action', 'and', 'kinematic', 'simulations', 'of', 'the', 'magnetic', 'field', 'evolution', 'induced', 'by', 'the', 'timeaveraged', 'flow', 'exhibit', 'magnetic', 'field', 'excitation', 'at', 'critical', 'magnetic', 'reynolds', 'numbers', 'around', 'rmrmrmcapprox', '430', 'which', 'is', 'well', 'within', 'the', 'range', 'of', 'the', 'planned', 'liquid', 'sodium', 'experiment']]
|
[-0.16676952878439114, 0.1900053691685734, -0.05756003393803556, 0.03091690824048705, -0.06590462047964908, -0.0843496782780808, -0.02436546979444181, 0.3046404607832814, -0.23200325444679007, -0.30392268870790035, 0.09281154644166112, -0.2509995264152431, -0.09935903949533692, 0.24102335761830562, 0.019375633422989782, 0.01891867769185581, 0.055816893513577104, 0.00854316930899508, 0.010961542791551631, -0.15110424254636845, 0.28564276703151786, 0.10775873765476748, 0.2781807849358799, 0.009088075627984766, 0.09839838763706896, -0.0722600116539233, 0.023929266578470092, 0.0295970297506095, -0.14225215200585653, 0.023835850483538885, 0.26911292429098016, 0.05356328887466946, 0.2520694427548422, -0.43193297088544214, -0.21143274800740003, 0.02806572187751627, 0.1415825673382984, 0.0940214253605829, -0.07805425457670812, -0.24376066944673339, 0.05984740493108685, -0.14053184677385047, -0.16966981403967446, -0.026440744572836492, 0.0123055761686972, 0.0032070616801701183, -0.2954994686075753, 0.0795651773780855, 0.03559619564469506, 0.11259863907312098, -0.09062288810785574, -0.07511701523405938, -0.011526790673896257, 0.0745194114293927, 0.09262906116558813, 0.07497207596340877, 0.17374682821070728, -0.15118515947793856, -0.076107387104605, 0.4048598015235148, -0.08582913666480006, -0.12557972787131166, 0.17922102317958274, -0.20919567671341774, -0.09379822851813391, 0.17871324286565313, 0.16697359455547406, 0.12226847564089152, -0.1213722889230519, 0.017366821081407417, -0.07072612862341487, 0.1656093621928977, 0.07792616242037402, -0.041469354301882096, 0.2896540596579703, 0.2416834094040255, 0.0437129955404462, 0.10564311614069037, -0.144459660576943, -0.07843271614565776, -0.2773441944319086, -0.10663321314831802, -0.10947470701288166, 0.024452528972019497, -0.004006074737191785, -0.13369628201680592, 0.39288096541029394, 0.1291639004684373, 0.12289493396663322, -0.05118991178460419, 0.2867633456634915, 0.04584702752027103, 0.0639311073935724, 0.07180155656981067, 0.31585204359701174, 0.15486136224801436, 0.13998633369397467, -0.2876002391657004, 0.018069569951790966, 0.022411711923937257]
|
1,803.061
|
Coexisting localized and itinerant gapless excitations in a quantum spin
liquid candidate 1T-TaS$_2$
|
To reveal the nature of elementary excitations in a quantum spin liquid
(QSL), we measured low temperature thermal conductivity and specific heat of
1T-TaS$_2$, a QSL candidate material with frustrated triangular lattice of
spin-1/2. The nonzero temperature linear specific heat coefficient $\gamma$ and
the finite residual linear term of the thermal conductivity in the zero
temperature limit $\kappa_0/T=\kappa/T(T\rightarrow 0)$ are clearly resolved.
This demonstrates the presence of highly mobile gapless excitations, which is
consistent with fractionalized spinon excitations that form a Fermi surface.
Remarkably, an external magnetic field strongly suppresses $\gamma$, whereas it
enhances $\kappa_0/T$. This unusual contrasting behavior in the field
dependence of specific heat and thermal conductivity can be accounted for by
the presence of two types of gapless excitations with itinerant and localized
characters, as recently predicted theoretically (I. Kimchi et al.,
arXiv:1803.00013 (2018)). This unique feature of 1T-TaS$_2$ provides new
insights into the influence of quenched disorder on the QSL.
|
cond-mat.str-el
|
to reveal the nature of elementary excitations in a quantum spin liquid qsl we measured low temperature thermal conductivity and specific heat of 1ttas_2 a qsl candidate material with frustrated triangular lattice of spin12 the nonzero temperature linear specific heat coefficient gamma and the finite residual linear term of the thermal conductivity in the zero temperature limit kappa_0tkappattrightarrow 0 are clearly resolved this demonstrates the presence of highly mobile gapless excitations which is consistent with fractionalized spinon excitations that form a fermi surface remarkably an external magnetic field strongly suppresses gamma whereas it enhances kappa_0t this unusual contrasting behavior in the field dependence of specific heat and thermal conductivity can be accounted for by the presence of two types of gapless excitations with itinerant and localized characters as recently predicted theoretically i kimchi et al arxiv180300013 2018 this unique feature of 1ttas_2 provides new insights into the influence of quenched disorder on the qsl
|
[['to', 'reveal', 'the', 'nature', 'of', 'elementary', 'excitations', 'in', 'a', 'quantum', 'spin', 'liquid', 'qsl', 'we', 'measured', 'low', 'temperature', 'thermal', 'conductivity', 'and', 'specific', 'heat', 'of', '1ttas_2', 'a', 'qsl', 'candidate', 'material', 'with', 'frustrated', 'triangular', 'lattice', 'of', 'spin12', 'the', 'nonzero', 'temperature', 'linear', 'specific', 'heat', 'coefficient', 'gamma', 'and', 'the', 'finite', 'residual', 'linear', 'term', 'of', 'the', 'thermal', 'conductivity', 'in', 'the', 'zero', 'temperature', 'limit', 'kappa_0tkappattrightarrow', '0', 'are', 'clearly', 'resolved', 'this', 'demonstrates', 'the', 'presence', 'of', 'highly', 'mobile', 'gapless', 'excitations', 'which', 'is', 'consistent', 'with', 'fractionalized', 'spinon', 'excitations', 'that', 'form', 'a', 'fermi', 'surface', 'remarkably', 'an', 'external', 'magnetic', 'field', 'strongly', 'suppresses', 'gamma', 'whereas', 'it', 'enhances', 'kappa_0t', 'this', 'unusual', 'contrasting', 'behavior', 'in', 'the', 'field', 'dependence', 'of', 'specific', 'heat', 'and', 'thermal', 'conductivity', 'can', 'be', 'accounted', 'for', 'by', 'the', 'presence', 'of', 'two', 'types', 'of', 'gapless', 'excitations', 'with', 'itinerant', 'and', 'localized', 'characters', 'as', 'recently', 'predicted', 'theoretically', 'i', 'kimchi', 'et', 'al', 'arxiv180300013', '2018', 'this', 'unique', 'feature', 'of', '1ttas_2', 'provides', 'new', 'insights', 'into', 'the', 'influence', 'of', 'quenched', 'disorder', 'on', 'the', 'qsl']]
|
[-0.1950005716675066, 0.27570896439789333, -0.04924664184734817, 0.002631976656208666, -0.08363331151996671, -0.18148759845335852, 0.0789304726698516, 0.32124489503881787, -0.2639435278991891, -0.2594977792102646, -0.0018597785903862523, -0.34695867243352413, -0.11418940197862994, 0.1608179818691581, 0.050194609493930016, 0.0025156363012232134, -0.06631426695758934, -0.0010880740892931524, -0.08339726790132014, -0.2169351849840574, 0.26446311600160916, 0.05354873402990919, 0.3361377714399174, 0.1202782561296338, 0.04780260896593924, -0.007848825512318225, 0.09808839193008692, 0.05079069878560621, -0.12712011448847205, 0.020859414631414493, 0.24104088543920427, -0.13342078073591684, 0.13874805041446986, -0.4055743750480824, -0.25422079846361617, 0.020244309317863342, 0.14179957760821732, 0.1199973141982695, -0.06719858875106527, -0.28600482644500913, 0.010932637198168216, -0.15990081974397727, -0.15440718914668958, -0.14209098249846538, -0.0012490118819825499, -0.04148187336148787, -0.2125949946275314, 0.18883184729211822, 0.1251563573909911, 0.10041343176271766, -0.10307304451044723, -0.13846414085995679, -0.10266179217654743, 0.06281335781858802, 0.062142154303632235, 0.04188357583487665, 0.14924374781548977, -0.17691907749375613, -0.08800554192402948, 0.32430779393022224, -0.09677481793163233, -0.11659308134374634, 0.19037610786159012, -0.1839852168900115, -0.10869156290847956, 0.20393865049156723, 0.09843979606448075, 0.07396420634456521, -0.14334368749964205, 0.08590376254541966, -0.04810889656131236, 0.17332416608010648, -0.022756610525192213, 0.10908870470235187, 0.3249430330655235, 0.18304151267241933, 0.008897760707194245, 0.18657936117325027, -0.11361674819795402, -0.06108664579085068, -0.2544340695445703, -0.17854452009207958, -0.2587040112606737, 0.08770458193361721, -0.07064941137780849, -0.22253998122810206, 0.40363292316659444, 0.1400649528598701, 0.17156173448257198, -0.06466346690107433, 0.2072834715228651, 0.14126020989346855, 0.034124912700264264, 0.11103294888782679, 0.23210641881605204, 0.18278391478854594, 0.10361590068355597, -0.349778039217464, 0.039894287720390456, 0.02227841755560297]
|
1,803.06101
|
Tractability properties of the weighted star discrepancy of the Halton
sequence
|
We study the weighted star discrepancy of the Halton sequence. In particular,
we show that the Halton sequence achieves strong polynomial tractability for
the weighted star discrepancy for product weights $(\gamma_j)_{j \ge 1}$ under
the mildest condition on the weight sequence known so far for explicitly
constructive sequences. The condition requires $\sup_{d \ge 1} \max_{\emptyset
\not= \mathfrak{u} \subseteq [d]} \prod_{j \in \mathfrak{u}} (j \gamma_j) <
\infty$. The same result holds for Niederreiter sequences and for other types
of digital sequences. Our results are true also for the weighted unanchored
discrepancy.
|
math.NA
|
we study the weighted star discrepancy of the halton sequence in particular we show that the halton sequence achieves strong polynomial tractability for the weighted star discrepancy for product weights gamma_j_j ge 1 under the mildest condition on the weight sequence known so far for explicitly constructive sequences the condition requires sup_d ge 1 max_emptyset not mathfraku subseteq d prod_j in mathfraku j gamma_j infty the same result holds for niederreiter sequences and for other types of digital sequences our results are true also for the weighted unanchored discrepancy
|
[['we', 'study', 'the', 'weighted', 'star', 'discrepancy', 'of', 'the', 'halton', 'sequence', 'in', 'particular', 'we', 'show', 'that', 'the', 'halton', 'sequence', 'achieves', 'strong', 'polynomial', 'tractability', 'for', 'the', 'weighted', 'star', 'discrepancy', 'for', 'product', 'weights', 'gamma_j_j', 'ge', '1', 'under', 'the', 'mildest', 'condition', 'on', 'the', 'weight', 'sequence', 'known', 'so', 'far', 'for', 'explicitly', 'constructive', 'sequences', 'the', 'condition', 'requires', 'sup_d', 'ge', '1', 'max_emptyset', 'not', 'mathfraku', 'subseteq', 'd', 'prod_j', 'in', 'mathfraku', 'j', 'gamma_j', 'infty', 'the', 'same', 'result', 'holds', 'for', 'niederreiter', 'sequences', 'and', 'for', 'other', 'types', 'of', 'digital', 'sequences', 'our', 'results', 'are', 'true', 'also', 'for', 'the', 'weighted', 'unanchored', 'discrepancy']]
|
[-0.1265835491351612, 0.0777652229867533, 0.003825824437448862, 0.12782967062774062, -0.02359709537577355, -0.12053769721446195, 0.051250255304046144, 0.4049044040556269, -0.3077196120016876, -0.2308577309769375, 0.07455736364173735, -0.272514832088317, -0.11942161280319266, 0.1971653375838851, -0.1314166321836669, 0.01600916340984618, 0.10073929716265578, 0.06047252136357557, -0.032586164480134114, -0.30441984014810414, 0.346854837003817, -0.048735587959359776, 0.2108926590864584, 0.030667067601093917, 0.056108822984200765, 0.025101675803173632, 0.011038535295974934, -0.049457540794479095, -0.23641573118847786, 0.04346680942181519, 0.20905317957031316, 0.19467664781379804, 0.2697039403064155, -0.3305555522099309, -0.1206022774634733, 0.18978042915147655, 0.15604641294406577, 0.0031542914609114328, -0.037137220063696394, -0.20423800394410033, 0.18881732606511006, -0.08191749216030599, -0.09726576868915694, -0.02371990782123102, 0.0684086932886349, 0.07608492729981997, -0.38215831282345214, 0.06810962239343234, 0.19090146087270615, 0.05751799984203502, -0.041744488328909396, -0.22356291260334782, 0.02416492568532369, 0.13525759767013035, -0.02619509900995027, 0.10524606745657993, -0.022714845635446495, -0.07343158668613639, -0.09827891273769261, 0.30920479851293153, -0.05857568063998017, -0.19768627754401888, 0.1154707741907573, -0.15969009813049745, -0.2186732350771005, 0.07255506953063967, 0.029708243108986097, 0.16803653473997937, -0.06161672659432409, 0.12761728700997052, -0.09530034349781685, 0.13098205391574522, 0.1398085827909774, 0.04353903799756676, 0.08918163612827487, 0.08039796537848125, 0.10269983027173185, 0.09869262685092038, -0.06160394947751072, -0.031088228722841574, -0.31433935574759014, -0.14614087842062287, -0.21701473647450237, 0.08559072401187913, -0.16607311413467504, -0.1306161476250995, 0.2873438441779347, 0.06357211946113699, 0.16126595737262703, 0.18588476172038193, 0.18676506290774278, 0.07360401190415924, 0.026572154683660417, 0.05900399836486783, 0.1546959032441072, 0.13206776235809273, 0.03505415723849109, -0.1898363864306232, 0.07225229131257237, 0.16454932341972986]
|
1,803.06102
|
Parameterized Low-Rank Binary Matrix Approximation
|
We provide a number of algorithmic results for the following family of
problems: For a given binary m\times n matrix A and integer k, decide whether
there is a "simple" binary matrix B which differs from A in at most k entries.
For an integer r, the "simplicity" of B is characterized as follows.
- Binary r-Means: Matrix B has at most r different columns. This problem is
known to be NP-complete already for r=2. We show that the problem is solvable
in time 2^{O(k\log k)}\cdot(nm)^{O(1)} and thus is fixed-parameter tractable
parameterized by k. We prove that the problem admits a polynomial kernel when
parameterized by r and k but it has no polynomial kernel when parameterized by
k only unless NP\subseteq coNP/poly. We also complement these result by showing
that when being parameterized by r and k, the problem admits an algorithm of
running time 2^{O(r\cdot \sqrt{k\log{(k+r)}})}(nm)^{O(1)}, which is
subexponential in k for r\in O(k^{1/2 -\epsilon}) for any \epsilon>0.
- Low GF(2)-Rank Approximation: Matrix B is of GF(2)-rank at most r. This
problem is known to be NP-complete already for r=1. It also known to be
W[1]-hard when parameterized by k. Interestingly, when parameterized by r and
k, the problem is not only fixed-parameter tractable, but it is solvable in
time 2^{O(r^{ 3/2}\cdot \sqrt{k\log{k}})}(nm)^{O(1)}, which is subexponential
in k.
- Low Boolean-Rank Approximation: Matrix B is of Boolean rank at most r. The
problem is known to be NP-complete for k=0 as well as for r=1. We show that it
is solvable in subexponential in k time 2^{O(r2^r\cdot \sqrt{k\log
k})}(nm)^{O(1)}.
|
cs.DS cs.DM
|
we provide a number of algorithmic results for the following family of problems for a given binary mtimes n matrix a and integer k decide whether there is a simple binary matrix b which differs from a in at most k entries for an integer r the simplicity of b is characterized as follows binary rmeans matrix b has at most r different columns this problem is known to be npcomplete already for r2 we show that the problem is solvable in time 2oklog kcdotnmo1 and thus is fixedparameter tractable parameterized by k we prove that the problem admits a polynomial kernel when parameterized by r and k but it has no polynomial kernel when parameterized by k only unless npsubseteq conppoly we also complement these result by showing that when being parameterized by r and k the problem admits an algorithm of running time 2orcdot sqrtklogkrnmo1 which is subexponential in k for rin ok12 epsilon for any epsilon0 low gf2rank approximation matrix b is of gf2rank at most r this problem is known to be npcomplete already for r1 it also known to be w1hard when parameterized by k interestingly when parameterized by r and k the problem is not only fixedparameter tractable but it is solvable in time 2or 32cdot sqrtklogknmo1 which is subexponential in k low booleanrank approximation matrix b is of boolean rank at most r the problem is known to be npcomplete for k0 as well as for r1 we show that it is solvable in subexponential in k time 2or2rcdot sqrtklog knmo1
|
[['we', 'provide', 'a', 'number', 'of', 'algorithmic', 'results', 'for', 'the', 'following', 'family', 'of', 'problems', 'for', 'a', 'given', 'binary', 'mtimes', 'n', 'matrix', 'a', 'and', 'integer', 'k', 'decide', 'whether', 'there', 'is', 'a', 'simple', 'binary', 'matrix', 'b', 'which', 'differs', 'from', 'a', 'in', 'at', 'most', 'k', 'entries', 'for', 'an', 'integer', 'r', 'the', 'simplicity', 'of', 'b', 'is', 'characterized', 'as', 'follows', 'binary', 'rmeans', 'matrix', 'b', 'has', 'at', 'most', 'r', 'different', 'columns', 'this', 'problem', 'is', 'known', 'to', 'be', 'npcomplete', 'already', 'for', 'r2', 'we', 'show', 'that', 'the', 'problem', 'is', 'solvable', 'in', 'time', '2oklog', 'kcdotnmo1', 'and', 'thus', 'is', 'fixedparameter', 'tractable', 'parameterized', 'by', 'k', 'we', 'prove', 'that', 'the', 'problem', 'admits', 'a', 'polynomial', 'kernel', 'when', 'parameterized', 'by', 'r', 'and', 'k', 'but', 'it', 'has', 'no', 'polynomial', 'kernel', 'when', 'parameterized', 'by', 'k', 'only', 'unless', 'npsubseteq', 'conppoly', 'we', 'also', 'complement', 'these', 'result', 'by', 'showing', 'that', 'when', 'being', 'parameterized', 'by', 'r', 'and', 'k', 'the', 'problem', 'admits', 'an', 'algorithm', 'of', 'running', 'time', '2orcdot', 'sqrtklogkrnmo1', 'which', 'is', 'subexponential', 'in', 'k', 'for', 'rin', 'ok12', 'epsilon', 'for', 'any', 'epsilon0', 'low', 'gf2rank', 'approximation', 'matrix', 'b', 'is', 'of', 'gf2rank', 'at', 'most', 'r', 'this', 'problem', 'is', 'known', 'to', 'be', 'npcomplete', 'already', 'for', 'r1', 'it', 'also', 'known', 'to', 'be', 'w1hard', 'when', 'parameterized', 'by', 'k', 'interestingly', 'when', 'parameterized', 'by', 'r', 'and', 'k', 'the', 'problem', 'is', 'not', 'only', 'fixedparameter', 'tractable', 'but', 'it', 'is', 'solvable', 'in', 'time', '2or', '32cdot', 'sqrtklogknmo1', 'which', 'is', 'subexponential', 'in', 'k', 'low', 'booleanrank', 'approximation', 'matrix', 'b', 'is', 'of', 'boolean', 'rank', 'at', 'most', 'r', 'the', 'problem', 'is', 'known', 'to', 'be', 'npcomplete', 'for', 'k0', 'as', 'well', 'as', 'for', 'r1', 'we', 'show', 'that', 'it', 'is', 'solvable', 'in', 'subexponential', 'in', 'k', 'time', '2or2rcdot', 'sqrtklog', 'knmo1']]
|
[-0.14397990624850474, 0.11163851280566249, -0.025010626555521446, 0.024475172775457184, -0.08810649960709503, -0.2575222737713152, 0.04969346861497136, 0.3752670329359611, -0.3294947548118611, -0.2881203347547765, 0.1220258431266956, -0.24910319600830297, -0.14327375366012135, 0.18404206905858106, -0.0274698603038029, 0.03851308057039796, 0.030949582903081155, 0.09994819026777473, -0.037991591852652024, -0.3146059306704974, 0.2630680702649147, -0.0002020813148827797, 0.07580606963290987, 0.06593572297395323, 0.062451100062923016, 4.7874494818559136e-05, 0.03177760036294741, 0.08297537798136773, -0.13674812571832398, -0.017173142460863065, 0.3433424741530933, 0.1959521590998414, 0.26095548382750805, -0.33513695598172255, -0.15405862569719195, 0.18340672464689697, 0.1533484733195968, 0.04548663412450801, 0.026539822071641087, -0.17341097584508555, 0.19480293317245373, -0.10630155798238534, -0.08664457259295755, -0.02783635977550922, 0.18220319553702904, -0.07434946974088628, -0.3313484618937724, 0.03541240987557746, 0.13610608249306155, 0.018889090072599837, 0.005118393229814358, -0.19669959305347987, 0.06286341954026387, 0.02783434643388172, 7.573382210839226e-05, 0.10784491472671848, 0.009765994619114333, -0.10162287554189368, -0.07000239357823529, 0.3971534006745951, -0.058565423369452536, -0.1829810234751687, 0.12223711633965013, -0.12159762891705136, -0.17143075695321203, 0.14844276116839256, 0.0910672167433897, 0.17932586707036857, -0.08790419039455098, 0.23204545903086932, -0.15242151172839136, 0.1762633086317761, 0.09180587758291438, -0.0557855265107507, 0.09837609472269394, 0.11824711416773198, 0.14174961753518706, 0.15744433731465304, 0.031800318426119696, -0.009931455263456547, -0.2607459322321247, -0.10279859760289929, -0.2591191475395577, 0.060760953546893016, -0.1418189335392716, -0.13161036663176304, 0.32355287144274775, 0.06509113504390521, 0.21054826425687675, 0.13904603261895193, 0.2450879416171364, 0.14998752178379285, 0.011303639434227518, 0.17894036858062068, 0.14810304862473264, 0.12177803765806598, -0.005530254021436575, -0.20231648507139022, 0.11226058749474555, 0.08837858425626526]
|
1,803.06103
|
Model-based Verification and Validation of an Autonomous Vehicle System
|
The software development for Cyber-Physical Systems (CPS), e.g., autonomous
vehicles, requires both functional and non-functional quality assurance to
guarantee that the CPS operates safely and effectively. EAST-ADL is a domain
specific architectural language dedicated to safety-critical automotive
embedded system design. We have previously modified EAST-ADL to include energy
constraints and transformed energy-aware real-time (ERT) behaviors modeled in
EAST-ADL/STATEFLOW into UPPAAL models amenable to formal verification. Previous
work is extended in this paper by including support for SIMULINK and an
integration of Simulink/Stateflow within a same tool-chain. Simulink/Stateflow
models are transformed, based on extended ERT constraints in EAST-ADL, into
verifiable UPPAAL models with stochastic semantics and integrate the
translation with formal statistical analysis techniques: Probabilistic
extension of EAST-ADL constraints is defined as a semantics denotation. A set
of mapping rules is proposed to facilitate the guarantee of translation. Formal
analysis on both functional- and non-functional properties is performed using
SIMULINK DESIGN VERIFIER/UPPAAL-SMC. The analysis techniques are validated and
demonstrated on the autonomous traffic sign recognition vehicle case study.
|
cs.SE
|
the software development for cyberphysical systems cps eg autonomous vehicles requires both functional and nonfunctional quality assurance to guarantee that the cps operates safely and effectively eastadl is a domain specific architectural language dedicated to safetycritical automotive embedded system design we have previously modified eastadl to include energy constraints and transformed energyaware realtime ert behaviors modeled in eastadlstateflow into uppaal models amenable to formal verification previous work is extended in this paper by including support for simulink and an integration of simulinkstateflow within a same toolchain simulinkstateflow models are transformed based on extended ert constraints in eastadl into verifiable uppaal models with stochastic semantics and integrate the translation with formal statistical analysis techniques probabilistic extension of eastadl constraints is defined as a semantics denotation a set of mapping rules is proposed to facilitate the guarantee of translation formal analysis on both functional and nonfunctional properties is performed using simulink design verifieruppaalsmc the analysis techniques are validated and demonstrated on the autonomous traffic sign recognition vehicle case study
|
[['the', 'software', 'development', 'for', 'cyberphysical', 'systems', 'cps', 'eg', 'autonomous', 'vehicles', 'requires', 'both', 'functional', 'and', 'nonfunctional', 'quality', 'assurance', 'to', 'guarantee', 'that', 'the', 'cps', 'operates', 'safely', 'and', 'effectively', 'eastadl', 'is', 'a', 'domain', 'specific', 'architectural', 'language', 'dedicated', 'to', 'safetycritical', 'automotive', 'embedded', 'system', 'design', 'we', 'have', 'previously', 'modified', 'eastadl', 'to', 'include', 'energy', 'constraints', 'and', 'transformed', 'energyaware', 'realtime', 'ert', 'behaviors', 'modeled', 'in', 'eastadlstateflow', 'into', 'uppaal', 'models', 'amenable', 'to', 'formal', 'verification', 'previous', 'work', 'is', 'extended', 'in', 'this', 'paper', 'by', 'including', 'support', 'for', 'simulink', 'and', 'an', 'integration', 'of', 'simulinkstateflow', 'within', 'a', 'same', 'toolchain', 'simulinkstateflow', 'models', 'are', 'transformed', 'based', 'on', 'extended', 'ert', 'constraints', 'in', 'eastadl', 'into', 'verifiable', 'uppaal', 'models', 'with', 'stochastic', 'semantics', 'and', 'integrate', 'the', 'translation', 'with', 'formal', 'statistical', 'analysis', 'techniques', 'probabilistic', 'extension', 'of', 'eastadl', 'constraints', 'is', 'defined', 'as', 'a', 'semantics', 'denotation', 'a', 'set', 'of', 'mapping', 'rules', 'is', 'proposed', 'to', 'facilitate', 'the', 'guarantee', 'of', 'translation', 'formal', 'analysis', 'on', 'both', 'functional', 'and', 'nonfunctional', 'properties', 'is', 'performed', 'using', 'simulink', 'design', 'verifieruppaalsmc', 'the', 'analysis', 'techniques', 'are', 'validated', 'and', 'demonstrated', 'on', 'the', 'autonomous', 'traffic', 'sign', 'recognition', 'vehicle', 'case', 'study']]
|
[-0.12055297437490839, -0.06114058418571596, -0.09185088638209202, 0.061884881400813656, -0.1431688929033099, -0.18607467642674844, 0.03342692848421972, 0.3743370234176065, -0.23812170454554937, -0.3347415712408044, 0.14652567203368314, -0.21455320888057802, -0.12789261632627158, 0.21949011446259012, -0.11756254822918863, 0.16505029479775465, 0.07298412214625966, -0.004791409752303452, -0.016079054195716074, -0.19353240395430477, 0.25816198410325203, 0.001873750730671666, 0.32266022406631345, 0.031931036214033766, 0.08498818756956043, 0.029721637022201763, -0.029174370561359506, 0.023779034500969857, -0.07109405795331854, 0.1516375755326766, 0.338591188075401, 0.24220545284280723, 0.28300250901445523, -0.48597555989681773, -0.22412974827104445, 0.04004008384266247, 0.10861783304514547, 0.015669252991563444, -0.005404412949627096, -0.36534154270493396, 0.11656941016853758, -0.2399243695266319, -0.041255374289484635, -0.1525563584640622, -0.026241504266914545, 0.05160169091611875, -0.26678745547718735, -0.0687657379121943, 0.08503862937178576, 0.12759919603298786, -0.08771871247074821, -0.05860124717141981, -0.036729348660446706, 0.13892371815093088, -0.0075913340149616655, 0.00549920411131373, 0.18798703718366044, -0.07471909789566064, -0.14790509882326605, 0.4154405371314197, -0.023619018104209594, -0.23033275993719035, 0.20193510400272455, 0.044466438841526255, -0.234114171028363, 0.061460780703716654, 0.22327871638717073, 0.053483530634901286, -0.2509819721012856, 0.11684939587298272, 0.047481770737971545, 0.2325301593367123, 0.007658488045898125, -0.01691439218932029, 0.18770766406122483, 0.27275571858115266, 0.027800640775680993, 0.12864385515338544, 0.02533206440734141, -0.141606021694712, -0.25053844028858074, -0.1516965586743247, -0.0879224621888363, -0.061444032748907126, -0.01815808573676005, -0.15112779300772783, 0.36556591593632193, 0.18720324582034004, 0.08282855408227381, 0.10628308048612918, 0.38093640194697814, 0.12558897135816302, 0.10705949321643195, 0.05534845886215793, 0.14776327146506502, 0.03774400729290033, 0.14740240526046944, -0.18300958525417654, 0.1141717719252814, 0.06639561824726337]
|
1,803.06104
|
The growth of interest for astronomical X-ray polarimetry
|
Astronomical X-ray polarimetry was first explored in the end of the 60's by
pioneering rocket instruments. The craze arising from the first discoveries on
stellar and supernova remnant X-ray polarization led to the addition of X-ray
polarimeters on-board of early satellites. Unfortunately, the inadequacy of the
diffraction and scattering technologies required to measure polarization with
respect to the constraints driven by X-ray mirrors and detectors, coupled to
long integration times, slowed down the field for almost 40 years. Thanks to
the development of new, highly sensitive, compact X-ray polarimeters in the
beginning of the 2000's, the possibility to observe astronomical X-ray
polarization is rising again and scientists are now ready to explore the high
energy sky thanks to modern X-ray polarimeters. In the forthcoming years,
several X-ray missions (both rockets, balloons and satellites) will open a new
observational windows. A wind of renewal blows over the area of X-ray
polarimetry and this paper presents for the first time a quantitative
assessment, all based on scientific literature, of the growth of interest for
astronomical X-ray polarimetry.
|
astro-ph.IM astro-ph.HE
|
astronomical xray polarimetry was first explored in the end of the 60s by pioneering rocket instruments the craze arising from the first discoveries on stellar and supernova remnant xray polarization led to the addition of xray polarimeters onboard of early satellites unfortunately the inadequacy of the diffraction and scattering technologies required to measure polarization with respect to the constraints driven by xray mirrors and detectors coupled to long integration times slowed down the field for almost 40 years thanks to the development of new highly sensitive compact xray polarimeters in the beginning of the 2000s the possibility to observe astronomical xray polarization is rising again and scientists are now ready to explore the high energy sky thanks to modern xray polarimeters in the forthcoming years several xray missions both rockets balloons and satellites will open a new observational windows a wind of renewal blows over the area of xray polarimetry and this paper presents for the first time a quantitative assessment all based on scientific literature of the growth of interest for astronomical xray polarimetry
|
[['astronomical', 'xray', 'polarimetry', 'was', 'first', 'explored', 'in', 'the', 'end', 'of', 'the', '60s', 'by', 'pioneering', 'rocket', 'instruments', 'the', 'craze', 'arising', 'from', 'the', 'first', 'discoveries', 'on', 'stellar', 'and', 'supernova', 'remnant', 'xray', 'polarization', 'led', 'to', 'the', 'addition', 'of', 'xray', 'polarimeters', 'onboard', 'of', 'early', 'satellites', 'unfortunately', 'the', 'inadequacy', 'of', 'the', 'diffraction', 'and', 'scattering', 'technologies', 'required', 'to', 'measure', 'polarization', 'with', 'respect', 'to', 'the', 'constraints', 'driven', 'by', 'xray', 'mirrors', 'and', 'detectors', 'coupled', 'to', 'long', 'integration', 'times', 'slowed', 'down', 'the', 'field', 'for', 'almost', '40', 'years', 'thanks', 'to', 'the', 'development', 'of', 'new', 'highly', 'sensitive', 'compact', 'xray', 'polarimeters', 'in', 'the', 'beginning', 'of', 'the', '2000s', 'the', 'possibility', 'to', 'observe', 'astronomical', 'xray', 'polarization', 'is', 'rising', 'again', 'and', 'scientists', 'are', 'now', 'ready', 'to', 'explore', 'the', 'high', 'energy', 'sky', 'thanks', 'to', 'modern', 'xray', 'polarimeters', 'in', 'the', 'forthcoming', 'years', 'several', 'xray', 'missions', 'both', 'rockets', 'balloons', 'and', 'satellites', 'will', 'open', 'a', 'new', 'observational', 'windows', 'a', 'wind', 'of', 'renewal', 'blows', 'over', 'the', 'area', 'of', 'xray', 'polarimetry', 'and', 'this', 'paper', 'presents', 'for', 'the', 'first', 'time', 'a', 'quantitative', 'assessment', 'all', 'based', 'on', 'scientific', 'literature', 'of', 'the', 'growth', 'of', 'interest', 'for', 'astronomical', 'xray', 'polarimetry']]
|
[-0.0640812597689884, 0.15517564934279238, -0.06292105174224291, 0.07647368737629481, -0.13201722743521843, -0.04430816966574639, 0.03929358728695661, 0.41771515041589735, -0.23436849314453345, -0.3455426447668911, 0.1709627829971058, -0.333508704613362, -0.048827389116798126, 0.2995376308847751, -0.06046118606946298, 0.07801899146288634, 0.07666369884674039, -0.09786586730075734, -0.048756767720250144, -0.2617868649906346, 0.23804024013557604, 0.17323254424280354, 0.23015424969240225, 0.01813220744420375, 0.11717079595313408, 0.006195928041956254, -0.13327634205775601, -0.030246460655970232, -0.08635642996457006, 0.11384329494621072, 0.2866001573827816, 0.13621317268083138, 0.23510542157392983, -0.4544222877680191, -0.21587225542536803, 0.03994857962642397, 0.09915299116866663, -0.008859932525083422, -0.05387285717363868, -0.26766463649060046, -0.009413365427670734, -0.1841954698227346, -0.18629996301340204, -0.0019876275451055593, 0.05479453186171927, 0.03440556465415284, -0.16096460380192315, -0.003871180821609284, -0.040439664032310245, 0.05612553972318502, -0.1380677176932139, -0.038938295114785436, 0.03917965600134007, 0.09020651361771992, 0.06369548614802105, 0.0646284768816882, 0.09459559264991965, -0.13350066922405468, -0.10336247766390443, 0.36895510432443446, -0.03651337092808847, 0.04360239079288606, 0.18431011771650185, -0.24826253108414156, -0.16145731080057366, 0.15044882187885897, 0.15825027532343353, 0.08768494078623397, -0.17541083487449213, 0.05883447947412995, 0.0631329053427492, 0.19659254060459455, 0.1250431341571467, 0.05713915350169243, 0.31378544412952447, 0.19764285313630742, 0.06181217507326177, 0.12513249771137322, -0.22602239592133888, -0.002905873688203948, -0.23171828347191747, -0.1301031288211899, -0.13162497684559119, 0.0863509621324816, -0.030360832764667327, -0.13791693837647992, 0.3663714635930955, 0.1452747353498957, 0.10454625184514693, -0.025054968290829233, 0.3544297115797443, 0.03438372157114957, 0.09143095142740224, 0.029401715798303484, 0.3404289940584983, 0.14314429516504917, 0.20399416710316604, -0.1797273322793522, 0.05421421418365623, -0.03734439352261169]
|
1,803.06105
|
Efficient Decoding Schemes for Noisy Non-Adaptive Group Testing when
Noise Depends on Number of Items in Test
|
The goal of non-adaptive group testing is to identify at most $d$ defective
items from $N$ items, in which a test of a subset of $N$ items is positive if
it contains at least one defective item, and negative otherwise. However, in
many cases, especially in biological screening, the outcome is unreliable due
to biochemical interaction; i.e., \textit{noise.} Consequently, a positive
result can change to a negative one (false negative) and vice versa (false
positive). In this work, we first consider the dilution effect in which
\textit{the degree of noise depends on the number of items in the test}. Two
efficient schemes are presented for identifying the defective items in time
linearly to the number of tests needed. Experimental results validate our
theoretical analysis. Specifically, setting the error precision of 0.001 and
$d\leq16$, our proposed algorithms always identify all defective items in less
than 7 seconds for $N=2^{33}\approx 9$ billion.
|
cs.IT math.IT
|
the goal of nonadaptive group testing is to identify at most d defective items from n items in which a test of a subset of n items is positive if it contains at least one defective item and negative otherwise however in many cases especially in biological screening the outcome is unreliable due to biochemical interaction ie textitnoise consequently a positive result can change to a negative one false negative and vice versa false positive in this work we first consider the dilution effect in which textitthe degree of noise depends on the number of items in the test two efficient schemes are presented for identifying the defective items in time linearly to the number of tests needed experimental results validate our theoretical analysis specifically setting the error precision of 0001 and dleq16 our proposed algorithms always identify all defective items in less than 7 seconds for n233approx 9 billion
|
[['the', 'goal', 'of', 'nonadaptive', 'group', 'testing', 'is', 'to', 'identify', 'at', 'most', 'd', 'defective', 'items', 'from', 'n', 'items', 'in', 'which', 'a', 'test', 'of', 'a', 'subset', 'of', 'n', 'items', 'is', 'positive', 'if', 'it', 'contains', 'at', 'least', 'one', 'defective', 'item', 'and', 'negative', 'otherwise', 'however', 'in', 'many', 'cases', 'especially', 'in', 'biological', 'screening', 'the', 'outcome', 'is', 'unreliable', 'due', 'to', 'biochemical', 'interaction', 'ie', 'textitnoise', 'consequently', 'a', 'positive', 'result', 'can', 'change', 'to', 'a', 'negative', 'one', 'false', 'negative', 'and', 'vice', 'versa', 'false', 'positive', 'in', 'this', 'work', 'we', 'first', 'consider', 'the', 'dilution', 'effect', 'in', 'which', 'textitthe', 'degree', 'of', 'noise', 'depends', 'on', 'the', 'number', 'of', 'items', 'in', 'the', 'test', 'two', 'efficient', 'schemes', 'are', 'presented', 'for', 'identifying', 'the', 'defective', 'items', 'in', 'time', 'linearly', 'to', 'the', 'number', 'of', 'tests', 'needed', 'experimental', 'results', 'validate', 'our', 'theoretical', 'analysis', 'specifically', 'setting', 'the', 'error', 'precision', 'of', '0001', 'and', 'dleq16', 'our', 'proposed', 'algorithms', 'always', 'identify', 'all', 'defective', 'items', 'in', 'less', 'than', '7', 'seconds', 'for', 'n233approx', '9', 'billion']]
|
[-0.0986489213128398, 0.10790622014531903, 0.005637053617376935, 0.05331965911711843, -0.0711582905936961, -0.22012673138414282, 0.12014416773249773, 0.3403538706259349, -0.2273680796772808, -0.3328662630619137, 0.08203697084489839, -0.32649246714317015, -0.1259732924408053, 0.16205855118853316, -0.07289343982277363, 0.010926202546830315, 0.041920244365698904, 0.08442579700636703, 0.01820846732919784, -0.3875222021471583, 0.2752895644500952, 0.03756357621200181, 0.2528377596502872, 0.019954479195213346, 0.050081194777138426, -0.01564066086084003, -0.07309934336415215, 0.06093290850223541, -0.07746286277884988, 0.08655221456334598, 0.3125125764231229, 0.13957586954033152, 0.3633897577638964, -0.3715830023488584, -0.13846914608950248, 0.1464973546570872, 0.09714540804506631, 0.11005672567517723, -0.05190606363356818, -0.2012132946999643, 0.17009941048485958, -0.1018679743323741, -0.06174477760548659, -0.023664171867248777, 0.0700718110326577, -0.03037615618558374, -0.32011421339435353, 0.07548655835106163, 0.026115848961273662, 0.03908448801784952, -0.03154742507172774, -0.16255711876736903, 0.028036645671818405, 0.12441290583386011, 0.08266538229686007, -0.006022155369833313, 0.11697766814078833, -0.11026219455222441, -0.12439467910617413, 0.39184582929718437, -0.0264073264004617, -0.2143876111776744, 0.20596109621299155, -0.16897348172622859, -0.1433829512396777, 0.16438684409887, 0.20047539099421655, 0.1384972544729936, -0.08845862459369332, 0.021049303828968313, -0.06042534277484928, 0.2028951523919917, 0.09420499971727966, 0.014061052040700373, 0.1490238079505444, 0.16467344697023667, 0.07711871811133696, 0.09618060961145454, -0.050022013789055415, -0.021132552178224195, -0.2871226052174697, -0.18597752758226282, -0.2103356778396709, 0.06285797085729428, -0.11375280861191002, -0.1513956168326675, 0.37725126331772757, 0.16782878758700415, 0.21166981656718947, 0.054053818733066424, 0.27940573830730153, 0.014284494749861895, 0.018648216701704596, 0.06804117784722129, 0.18113022883315696, 0.058452424555513506, 0.032355844740900586, -0.190773937802422, 0.13727600056350836, 0.006858888064901269]
|
1,803.06106
|
An Irreducible Polynomial Functional Basis of Two-dimensional Eshelby
Tensors
|
Representation theorems for both isotropic and anisotropic functions are of
prime importance in both theoretical and applied mechanics. The Eshelby
inclusion problem is very fundamental, and is of particular importance in the
design of advanced functional composite materials. In this paper, we discuss
about two-dimensional Eshelby tensors (denoted as $M^{(2)}$). Eshelby tensors
satisfy the minor index symmetry $M_{ijkl}^{(2)}=M_{jikl}^{(2)}=M_{ijlk}^{(2)}$
and have wide applications in many fields of mechanics. In view of the
representation of two-dimensional irreducible tensors in complex field, we
obtain a minimal integrity basis of ten isotropic invariants of $M^{(2)}$.
Remarkably, note that an integrity basis is always a functional basis, we
further confirm that the minimal integrity basis is also an irreducible
function basis of isotropic invariants of $M^{(2)}$.
|
math-ph math.MP
|
representation theorems for both isotropic and anisotropic functions are of prime importance in both theoretical and applied mechanics the eshelby inclusion problem is very fundamental and is of particular importance in the design of advanced functional composite materials in this paper we discuss about twodimensional eshelby tensors denoted as m2 eshelby tensors satisfy the minor index symmetry m_ijkl2m_jikl2m_ijlk2 and have wide applications in many fields of mechanics in view of the representation of twodimensional irreducible tensors in complex field we obtain a minimal integrity basis of ten isotropic invariants of m2 remarkably note that an integrity basis is always a functional basis we further confirm that the minimal integrity basis is also an irreducible function basis of isotropic invariants of m2
|
[['representation', 'theorems', 'for', 'both', 'isotropic', 'and', 'anisotropic', 'functions', 'are', 'of', 'prime', 'importance', 'in', 'both', 'theoretical', 'and', 'applied', 'mechanics', 'the', 'eshelby', 'inclusion', 'problem', 'is', 'very', 'fundamental', 'and', 'is', 'of', 'particular', 'importance', 'in', 'the', 'design', 'of', 'advanced', 'functional', 'composite', 'materials', 'in', 'this', 'paper', 'we', 'discuss', 'about', 'twodimensional', 'eshelby', 'tensors', 'denoted', 'as', 'm2', 'eshelby', 'tensors', 'satisfy', 'the', 'minor', 'index', 'symmetry', 'm_ijkl2m_jikl2m_ijlk2', 'and', 'have', 'wide', 'applications', 'in', 'many', 'fields', 'of', 'mechanics', 'in', 'view', 'of', 'the', 'representation', 'of', 'twodimensional', 'irreducible', 'tensors', 'in', 'complex', 'field', 'we', 'obtain', 'a', 'minimal', 'integrity', 'basis', 'of', 'ten', 'isotropic', 'invariants', 'of', 'm2', 'remarkably', 'note', 'that', 'an', 'integrity', 'basis', 'is', 'always', 'a', 'functional', 'basis', 'we', 'further', 'confirm', 'that', 'the', 'minimal', 'integrity', 'basis', 'is', 'also', 'an', 'irreducible', 'function', 'basis', 'of', 'isotropic', 'invariants', 'of', 'm2']]
|
[-0.16402321661201616, 0.11179777779058592, -0.06153335841372609, 0.04510391059545024, -0.0663061765798678, -0.07180194512475283, -0.0707920195137073, 0.3465757124358788, -0.2528177600742007, -0.24605179394905766, 0.10249518259079196, -0.2509876454210219, -0.22809022896302242, 0.16569636669009924, -0.03953482269619902, 0.0589060808008071, -0.0011525391989077132, 0.015307759307324887, -0.11526419268532967, -0.20847319928385938, 0.3155490388472875, 0.05201970556130012, 0.29672655591275543, 0.06237748149627199, 0.07296220879458512, 0.051657265808898956, -0.01684181762005513, 0.04002545414647708, -0.12771810973705822, 0.15746650292130654, 0.3059598733088933, 0.10120489351296176, 0.21807722834249338, -0.4370249835153421, -0.17480066341813655, 0.1097672239334012, 0.10488559810522323, 0.0696979308500886, -0.04382879684659808, -0.1859540838787022, 0.09211982061776022, -0.18716742763839042, -0.18259898230123023, -0.1315795669797808, 0.06256952254819528, 0.004357189211683969, -0.2319957237690687, 0.0900552157543037, 0.09154442390912057, 0.12038238561556985, -0.11329779692071801, -0.14775243829935789, -0.034373609651811424, 0.07646251719755431, 0.03764695159625262, 0.026089387133833953, 0.09276169746202262, -0.1579513402170657, -0.10201083598658442, 0.41584931089698024, -0.014918256822663048, -0.2628824663348496, 0.12602662118927885, -0.10089509279156725, -0.1788395812851377, 0.10585915961031181, 0.1576436635281425, 0.08215730870142579, -0.12468587554370364, 0.15646730874238227, -0.06443279074349752, 0.13738865048314133, 0.062357132425919795, 0.04969296808121726, 0.1836936449088777, 0.12089688692358322, 0.02608006673932929, 0.13689581567790204, 0.002336396265309304, -0.05153411750216037, -0.3452695843297988, -0.22923463446398576, -0.18739342549233698, 0.059188915428239855, -0.14920153853357382, -0.1876478318668281, 0.404500179629152, 0.10179294427701582, 0.12131086219839442, 0.024721547386919458, 0.21741510117426516, 0.08508888111197545, 0.045837057568132875, 0.025463837668454895, 0.24706655313493683, 0.22316263495983246, 0.004173604709406694, -0.1264991169019292, 0.0013257682866727313, 0.08048450600666304]
|
1,803.06107
|
Lipschitz Constrained GANs via Boundedness and Continuity
|
One of the challenges in the study of Generative Adversarial Networks (GANs)
is the difficulty of its performance control. Lipschitz constraint is essential
in guaranteeing training stability for GANs. Although heuristic methods such as
weight clipping, gradient penalty and spectral normalization have been proposed
to enforce Lipschitz constraint, it is still difficult to achieve a solution
that is both practically effective and theoretically provably satisfying a
Lipschitz constraint. In this paper, we introduce the boundedness and
continuity ($BC$) conditions to enforce the Lipschitz constraint on the
discriminator functions of GANs. We prove theoretically that GANs with
discriminators meeting the BC conditions satisfy the Lipschitz constraint. We
present a practically very effective implementation of a GAN based on a
convolutional neural network (CNN) by forcing the CNN to satisfy the $BC$
conditions (BC-GAN). We show that as compared to recent techniques including
gradient penalty and spectral normalization, BC-GANs not only have better
performances but also lower computational complexity.
|
cs.CV
|
one of the challenges in the study of generative adversarial networks gans is the difficulty of its performance control lipschitz constraint is essential in guaranteeing training stability for gans although heuristic methods such as weight clipping gradient penalty and spectral normalization have been proposed to enforce lipschitz constraint it is still difficult to achieve a solution that is both practically effective and theoretically provably satisfying a lipschitz constraint in this paper we introduce the boundedness and continuity bc conditions to enforce the lipschitz constraint on the discriminator functions of gans we prove theoretically that gans with discriminators meeting the bc conditions satisfy the lipschitz constraint we present a practically very effective implementation of a gan based on a convolutional neural network cnn by forcing the cnn to satisfy the bc conditions bcgan we show that as compared to recent techniques including gradient penalty and spectral normalization bcgans not only have better performances but also lower computational complexity
|
[['one', 'of', 'the', 'challenges', 'in', 'the', 'study', 'of', 'generative', 'adversarial', 'networks', 'gans', 'is', 'the', 'difficulty', 'of', 'its', 'performance', 'control', 'lipschitz', 'constraint', 'is', 'essential', 'in', 'guaranteeing', 'training', 'stability', 'for', 'gans', 'although', 'heuristic', 'methods', 'such', 'as', 'weight', 'clipping', 'gradient', 'penalty', 'and', 'spectral', 'normalization', 'have', 'been', 'proposed', 'to', 'enforce', 'lipschitz', 'constraint', 'it', 'is', 'still', 'difficult', 'to', 'achieve', 'a', 'solution', 'that', 'is', 'both', 'practically', 'effective', 'and', 'theoretically', 'provably', 'satisfying', 'a', 'lipschitz', 'constraint', 'in', 'this', 'paper', 'we', 'introduce', 'the', 'boundedness', 'and', 'continuity', 'bc', 'conditions', 'to', 'enforce', 'the', 'lipschitz', 'constraint', 'on', 'the', 'discriminator', 'functions', 'of', 'gans', 'we', 'prove', 'theoretically', 'that', 'gans', 'with', 'discriminators', 'meeting', 'the', 'bc', 'conditions', 'satisfy', 'the', 'lipschitz', 'constraint', 'we', 'present', 'a', 'practically', 'very', 'effective', 'implementation', 'of', 'a', 'gan', 'based', 'on', 'a', 'convolutional', 'neural', 'network', 'cnn', 'by', 'forcing', 'the', 'cnn', 'to', 'satisfy', 'the', 'bc', 'conditions', 'bcgan', 'we', 'show', 'that', 'as', 'compared', 'to', 'recent', 'techniques', 'including', 'gradient', 'penalty', 'and', 'spectral', 'normalization', 'bcgans', 'not', 'only', 'have', 'better', 'performances', 'but', 'also', 'lower', 'computational', 'complexity']]
|
[-0.08128440319053017, -0.03386457427404821, -0.10088544921615185, 0.10256595126254699, -0.13233272687275296, -0.21558425465646464, 0.01598920689176362, 0.46344988468365794, -0.2900930678901764, -0.29032061072305226, 0.10477607715233134, -0.20247145195921454, -0.186913605265988, 0.1391531416000082, -0.17642983281686425, 0.16176294092385946, 0.09416736329857929, 0.01833454467421875, -0.10771559108233748, -0.3163188530351573, 0.3232815934983918, 0.0422477077286786, 0.32521545155218634, 0.07469511941636507, 0.14238699433954957, -0.10038695064409134, 0.04588027952465778, -0.004041922279448511, -0.11533560759128775, 0.13636195852058547, 0.24211542500565067, 0.19240743909568453, 0.3523238516197755, -0.4277185918524479, -0.2324560654822749, 0.14568619607225394, 0.10456578712313412, 0.046696176076343715, -0.06436820321370107, -0.2410262731823306, 0.16061088836823517, -0.12574671812427157, -0.005620818165763735, -0.1310627706325016, -0.06414447096474947, 0.03812722266332294, -0.36496822375696725, 0.03273887499716903, 0.12466117263568613, 0.03545935841229481, -0.09438916900454877, -0.11408001422070158, -0.024201321675298877, 0.08416313600117484, 0.052067369933072954, 0.0705854105270611, 0.07433195479321651, -0.16997245143209463, -0.06843658588014734, 0.33256768189872116, -0.05803111901817223, -0.2709455024034982, 0.1544975253696649, -0.02814757064035616, -0.16935489053885716, 0.07280813923213057, 0.1881121955364226, 0.11375525251377183, -0.16360567801464826, 0.07832548992248634, -0.016936940748471383, 0.13547374348108393, 0.07921838923954429, 0.06751681642475514, 0.07505737618955138, 0.19527189172834206, 0.17328986098082402, 0.15223922716783514, -0.06238911741708692, -0.06164520469088203, -0.27126934859925544, -0.06975713131303052, -0.20011016365009335, 0.0063348756745817345, -0.0831025649867325, -0.18319896087408638, 0.3801427486342175, 0.18228590691115898, 0.19565751943334292, 0.18735349749047786, 0.34713509843613094, 0.09886448528731051, 0.10736321474168783, 0.10698156179979634, 0.2628158766467375, 0.12428130949130999, 0.12981955313052124, -0.1812179260521542, 0.12992736384983752, 0.07924370150057933]
|
1,803.06108
|
Business Cycles in Economics
|
The business cycles are generated by the oscillating macro-/micro-/nano-
economic output variables in the economy of the scale and the scope in the
amplitude/frequency/phase/time domains in the economics. The accurate forward
looking assumptions on the business cycles oscillation dynamics can optimize
the financial capital investing and/or borrowing by the economic agents in the
capital markets. The book's main objective is to study the business cycles in
the economy of the scale and the scope, formulating the Ledenyov unified
business cycles theory in the Ledenyov classic and quantum econodynamics.
|
econ.EM
|
the business cycles are generated by the oscillating macromicronano economic output variables in the economy of the scale and the scope in the amplitudefrequencyphasetime domains in the economics the accurate forward looking assumptions on the business cycles oscillation dynamics can optimize the financial capital investing andor borrowing by the economic agents in the capital markets the books main objective is to study the business cycles in the economy of the scale and the scope formulating the ledenyov unified business cycles theory in the ledenyov classic and quantum econodynamics
|
[['the', 'business', 'cycles', 'are', 'generated', 'by', 'the', 'oscillating', 'macromicronano', 'economic', 'output', 'variables', 'in', 'the', 'economy', 'of', 'the', 'scale', 'and', 'the', 'scope', 'in', 'the', 'amplitudefrequencyphasetime', 'domains', 'in', 'the', 'economics', 'the', 'accurate', 'forward', 'looking', 'assumptions', 'on', 'the', 'business', 'cycles', 'oscillation', 'dynamics', 'can', 'optimize', 'the', 'financial', 'capital', 'investing', 'andor', 'borrowing', 'by', 'the', 'economic', 'agents', 'in', 'the', 'capital', 'markets', 'the', 'books', 'main', 'objective', 'is', 'to', 'study', 'the', 'business', 'cycles', 'in', 'the', 'economy', 'of', 'the', 'scale', 'and', 'the', 'scope', 'formulating', 'the', 'ledenyov', 'unified', 'business', 'cycles', 'theory', 'in', 'the', 'ledenyov', 'classic', 'and', 'quantum', 'econodynamics']]
|
[-0.11845939211437807, 0.1042569131754777, -0.04356396294691983, 0.14422694289755514, -0.06697237063199282, -0.03391557110692648, 0.10990430891431649, 0.2968809206915252, -0.29991703050806845, -0.27614988320890593, 0.16327082838260515, -0.25052294714157197, -0.136460321823902, 0.16018410340389785, -0.16220181509304574, 0.022657845402136445, 0.02161334372837754, 0.019616734126911443, 0.10625532386167084, -0.2806869005674825, 0.2866350695326486, 0.047717927337405, 0.3293417812270277, 0.029898173646891818, 0.052238066520487125, -0.0016950915019740076, -0.07677125420202227, -0.018184888012268963, -0.11539614625713404, 0.21476852082483033, 0.32734441862386815, 0.20465341815177132, 0.4233444647096536, -0.5122428870595553, -0.17250436133540728, 0.11624330647618455, 0.039917949176229095, 0.023737328428336802, 0.09580106125350166, -0.2675031008527559, -0.01649530788554865, -0.20629088701132467, -0.11723697564619429, -0.0680889847688377, 0.01150094241122989, 0.05704635281170554, -0.2505445059251917, -0.0032975972137030433, 0.06189934645834214, 0.11772965653525556, -0.0366072605309241, -0.09176834815127008, -0.05764516230453463, 0.18980584451312418, 0.1622543898055001, -0.05305941707235487, 0.21689242766622235, -0.19282492268830537, -0.19616091200972305, 0.3868747332845541, -0.039584630675723445, -0.13392350128030076, 0.11844920829376754, -0.13976521604858777, -0.1200487957445576, 0.052244159940849334, 0.18975767087848747, -0.0048942271620035175, -0.1966118637143689, 0.11735897870419328, 0.01567923516199431, 0.12959868697559132, 0.1048275266226162, -0.040139113163904235, 0.21371535861125107, 0.21670671243439701, 0.12328434555846102, 0.0880977087215904, 0.02353165522799827, -0.24917623614207568, -0.26181596359785864, -0.10275689030514674, -0.12212979368701139, 0.05328928260680507, -0.17612749997146346, -0.12954570101026228, 0.44834238612914784, 0.143875033030396, 0.08334156367927789, 0.048616278015405814, 0.29493386802427907, 0.10432963148855111, 0.04270465871976579, 0.08139832675566568, 0.21886602053966592, 0.025278041281682602, 0.25581762114101475, -0.19795032466268714, 0.14726723766721347, 0.034384352330337556]
|
1,803.06109
|
Modeling the effects of telephone nursing on healthcare utilization
|
Background: Telephone nursing is the first line of contact for many
care-seekers and aims at optimizing the performance of the healthcare system by
supporting and guiding patients to the correct level of care and reduce the
amount of unscheduled visits. Good statistical models that describe the effects
of telephone nursing are important in order to study its impact on healthcare
resources and evaluate changes in telephone nursing procedures.
Objective: To develop a valid model that captures the complex relationships
between the nurse's recommendations, the patients' intended actions and the
patients' health seeking behavior. Using the model to estimate the effects of
telephone nursing on patient behavior, healthcare utilization, and infer
potential cost savings.
Methods: Bayesian ordinal regression modeling of data from randomly selected
patients that received telephone nursing. Inference is based on Markov Chain
Monte Carlo methods, model selection using the Watanabe-Akaike Information
Criteria, and model validation using posterior predictive checks on standard
discrepancy measures.
Results and Conclusions: We present a robust Bayesian ordinal regression
model that predicts 76% of the patients' healthcare utilization after telephone
nursing and we found no evidence of model deficiencies. The model reveals a
risk reducing behavior and the effect of the telephone nursing recommendation
is 7 times higher than the effect of the patient's intended action prior to
consultation if the recommendation is the highest level of care. But the effect
of the nurse's recommendation is lower, or even non-existing, if the
recommendation is self-care. Telephone nursing was found to have a constricting
effect on healthcare utilization, however, the compliance to nurse's
recommendation is closely tied to perceptions of risk, emphasizing the
importance to address caller's needs of reassurance.
|
stat.AP
|
background telephone nursing is the first line of contact for many careseekers and aims at optimizing the performance of the healthcare system by supporting and guiding patients to the correct level of care and reduce the amount of unscheduled visits good statistical models that describe the effects of telephone nursing are important in order to study its impact on healthcare resources and evaluate changes in telephone nursing procedures objective to develop a valid model that captures the complex relationships between the nurses recommendations the patients intended actions and the patients health seeking behavior using the model to estimate the effects of telephone nursing on patient behavior healthcare utilization and infer potential cost savings methods bayesian ordinal regression modeling of data from randomly selected patients that received telephone nursing inference is based on markov chain monte carlo methods model selection using the watanabeakaike information criteria and model validation using posterior predictive checks on standard discrepancy measures results and conclusions we present a robust bayesian ordinal regression model that predicts 76 of the patients healthcare utilization after telephone nursing and we found no evidence of model deficiencies the model reveals a risk reducing behavior and the effect of the telephone nursing recommendation is 7 times higher than the effect of the patients intended action prior to consultation if the recommendation is the highest level of care but the effect of the nurses recommendation is lower or even nonexisting if the recommendation is selfcare telephone nursing was found to have a constricting effect on healthcare utilization however the compliance to nurses recommendation is closely tied to perceptions of risk emphasizing the importance to address callers needs of reassurance
|
[['background', 'telephone', 'nursing', 'is', 'the', 'first', 'line', 'of', 'contact', 'for', 'many', 'careseekers', 'and', 'aims', 'at', 'optimizing', 'the', 'performance', 'of', 'the', 'healthcare', 'system', 'by', 'supporting', 'and', 'guiding', 'patients', 'to', 'the', 'correct', 'level', 'of', 'care', 'and', 'reduce', 'the', 'amount', 'of', 'unscheduled', 'visits', 'good', 'statistical', 'models', 'that', 'describe', 'the', 'effects', 'of', 'telephone', 'nursing', 'are', 'important', 'in', 'order', 'to', 'study', 'its', 'impact', 'on', 'healthcare', 'resources', 'and', 'evaluate', 'changes', 'in', 'telephone', 'nursing', 'procedures', 'objective', 'to', 'develop', 'a', 'valid', 'model', 'that', 'captures', 'the', 'complex', 'relationships', 'between', 'the', 'nurses', 'recommendations', 'the', 'patients', 'intended', 'actions', 'and', 'the', 'patients', 'health', 'seeking', 'behavior', 'using', 'the', 'model', 'to', 'estimate', 'the', 'effects', 'of', 'telephone', 'nursing', 'on', 'patient', 'behavior', 'healthcare', 'utilization', 'and', 'infer', 'potential', 'cost', 'savings', 'methods', 'bayesian', 'ordinal', 'regression', 'modeling', 'of', 'data', 'from', 'randomly', 'selected', 'patients', 'that', 'received', 'telephone', 'nursing', 'inference', 'is', 'based', 'on', 'markov', 'chain', 'monte', 'carlo', 'methods', 'model', 'selection', 'using', 'the', 'watanabeakaike', 'information', 'criteria', 'and', 'model', 'validation', 'using', 'posterior', 'predictive', 'checks', 'on', 'standard', 'discrepancy', 'measures', 'results', 'and', 'conclusions', 'we', 'present', 'a', 'robust', 'bayesian', 'ordinal', 'regression', 'model', 'that', 'predicts', '76', 'of', 'the', 'patients', 'healthcare', 'utilization', 'after', 'telephone', 'nursing', 'and', 'we', 'found', 'no', 'evidence', 'of', 'model', 'deficiencies', 'the', 'model', 'reveals', 'a', 'risk', 'reducing', 'behavior', 'and', 'the', 'effect', 'of', 'the', 'telephone', 'nursing', 'recommendation', 'is', '7', 'times', 'higher', 'than', 'the', 'effect', 'of', 'the', 'patients', 'intended', 'action', 'prior', 'to', 'consultation', 'if', 'the', 'recommendation', 'is', 'the', 'highest', 'level', 'of', 'care', 'but', 'the', 'effect', 'of', 'the', 'nurses', 'recommendation', 'is', 'lower', 'or', 'even', 'nonexisting', 'if', 'the', 'recommendation', 'is', 'selfcare', 'telephone', 'nursing', 'was', 'found', 'to', 'have', 'a', 'constricting', 'effect', 'on', 'healthcare', 'utilization', 'however', 'the', 'compliance', 'to', 'nurses', 'recommendation', 'is', 'closely', 'tied', 'to', 'perceptions', 'of', 'risk', 'emphasizing', 'the', 'importance', 'to', 'address', 'callers', 'needs', 'of', 'reassurance']]
|
[-0.06495003310035588, 0.020821563690479328, -0.04861886018115379, 0.11465779219475324, -0.11727931489148279, -0.16986498205555453, 0.1386006537614132, 0.39820237567199623, -0.18034195595754, -0.3392443709945592, 0.12475900733649066, -0.35897354289454264, -0.1538581251233466, 0.18258239024311956, -0.16036690597381634, 0.03623916544882669, 0.08809615843219812, 0.09307797021915742, -0.014261248778448997, -0.3092868626253666, 0.25125769491309136, 0.10312529367201002, 0.37295366842452654, 0.056604058477079264, 0.0654404979427753, 0.047666656670847185, -0.048522955320994744, -0.014542794964840487, -0.08053221149334172, 0.14135884083631678, 0.3216688098522766, 0.2025974337215515, 0.386065161922933, -0.4036758924582905, -0.205815496740618, 0.10227030659023074, 0.07729607665177135, 0.03753489095642891, 0.005058609485799569, -0.3245215334438372, 0.062468912991198854, -0.21687387930661403, -0.05705564676777181, -0.04945397088525096, -0.011148608442082368, -0.009449687082809907, -0.28719853760417974, 0.08063691121995123, -0.009330940867067199, 0.14406503773341975, -0.0894679277281304, -0.1465651822781163, -0.026794133345039058, 0.22303368343315666, 0.12454176015291961, -0.006539773451543352, 0.17432244036373865, -0.17202013152726162, -0.14484442346776075, 0.39919532983339506, 0.018668481595055828, -0.1842285527365051, 0.15493932802206326, -0.07203381411547698, -0.13807665330296667, 0.08245503724986912, 0.23241602827074265, 0.03819891419193714, -0.21533618542794003, -0.014202312841233083, 0.03019450470953024, 0.17659417340994207, 0.013627215627628466, -0.04238805633053578, 0.15739457733694628, 0.20753940179039906, 0.021361563688468692, 0.10185496075109436, -0.08689467873199959, -0.07889714579770926, -0.20401553644621948, -0.1343327078247701, -0.11714826044915448, 0.01905422800230746, -0.0908092159711387, -0.14317683942520815, 0.3819174062712186, 0.23415482907340068, 0.09300166936625258, 0.07463865978626304, 0.30641579175585487, 0.06380294837111974, 0.0734182571286643, 0.052324949391526134, 0.14374967235018138, 0.008793823894310444, 0.10871511304676261, -0.21419010270492303, 0.19345012956203717, -0.010098989429224256]
|
1,803.0611
|
Plastic flow and localization in an amorphous material: experimental
interpretation of the fluidity
|
We present a thorough study of the plastic response of a granular material
progressively loaded. We study experimentally the evolution of the plastic
field from a homogeneous one to an heterogeneous one and its fluctuations in
term of incremental strain. We show that the plastic field can be decomposed in
two components evolving on two decoupled strain increment scales. We argue that
the slowly varying part of the field can be identified to the so-called
fluidity field introduced recently to interpret the rheological behaviour of
amorphous materials. This fluidity field progressively concentrates along a
macroscopic direction corresponding to the Mohr-Coulomb angle.
|
cond-mat.soft
|
we present a thorough study of the plastic response of a granular material progressively loaded we study experimentally the evolution of the plastic field from a homogeneous one to an heterogeneous one and its fluctuations in term of incremental strain we show that the plastic field can be decomposed in two components evolving on two decoupled strain increment scales we argue that the slowly varying part of the field can be identified to the socalled fluidity field introduced recently to interpret the rheological behaviour of amorphous materials this fluidity field progressively concentrates along a macroscopic direction corresponding to the mohrcoulomb angle
|
[['we', 'present', 'a', 'thorough', 'study', 'of', 'the', 'plastic', 'response', 'of', 'a', 'granular', 'material', 'progressively', 'loaded', 'we', 'study', 'experimentally', 'the', 'evolution', 'of', 'the', 'plastic', 'field', 'from', 'a', 'homogeneous', 'one', 'to', 'an', 'heterogeneous', 'one', 'and', 'its', 'fluctuations', 'in', 'term', 'of', 'incremental', 'strain', 'we', 'show', 'that', 'the', 'plastic', 'field', 'can', 'be', 'decomposed', 'in', 'two', 'components', 'evolving', 'on', 'two', 'decoupled', 'strain', 'increment', 'scales', 'we', 'argue', 'that', 'the', 'slowly', 'varying', 'part', 'of', 'the', 'field', 'can', 'be', 'identified', 'to', 'the', 'socalled', 'fluidity', 'field', 'introduced', 'recently', 'to', 'interpret', 'the', 'rheological', 'behaviour', 'of', 'amorphous', 'materials', 'this', 'fluidity', 'field', 'progressively', 'concentrates', 'along', 'a', 'macroscopic', 'direction', 'corresponding', 'to', 'the', 'mohrcoulomb', 'angle']]
|
[-0.17827854784998562, 0.21746090428899664, -0.12489524009720523, -0.023699124008278814, -0.06249507318831759, -0.0733389135007516, -0.03333142567495124, 0.37902381732174667, -0.3368991490564134, -0.23281011990695674, 0.09059385391238081, -0.24236998542921967, -0.15259121978968973, 0.12321310275520134, -0.015589130913267042, 0.0064855309769206925, -0.021427912457205246, -0.002648028860325086, -0.05667676758666587, -0.20913114032643562, 0.3042539763356568, 0.0527014614447103, 0.318990205458393, 0.013521281605826156, 0.09912117895218406, -0.011798414710614056, 0.0020145295178609908, 0.14024060944759167, -0.14952339284599753, 0.08316751192369969, 0.20599039638470304, 0.0005919103934844532, 0.2629774137224891, -0.47060866218687286, -0.23725782623422323, 0.05244279294136432, 0.12734317395024666, 0.1046987004246157, -0.014053810986063195, -0.24013850268087175, 0.04468561077287587, -0.13861230092980706, -0.1518865532546055, -0.05734756064260065, 0.020282002881694915, 0.021425643442475266, -0.23223197817949964, 0.07734184517262338, 0.05773524145162342, 0.06355802457212553, -0.1113660495018236, -0.06537906315620287, -0.02594961151757305, 0.07587105828789201, 0.10684803958133895, 0.041068868946726664, 0.22321193936363895, -0.15944849592541335, -0.025641677458540048, 0.3631370001297333, -0.08209066548831945, -0.16957196261789095, 0.17560720155107798, -0.12309321808158466, -0.0893279407726656, 0.17395420627447195, 0.2123508471304016, 0.07241307185169789, -0.16989527152629919, -0.006167120466787958, -0.008591996035584719, 0.1803907572596085, 0.029043373919211992, -0.02293078828773618, 0.2296019254602713, 0.2179962804179067, 0.02053174804969596, 0.2194924554009553, -0.0988202749931318, -0.06916480246783778, -0.28155928082985454, -0.20131856162506756, -0.18695366989802753, 0.06328198750789213, -0.11513319831456191, -0.1998653649859647, 0.43405050812012486, 0.14223382539936516, 0.2036865669381021, 0.024785199340912376, 0.22604795230211377, 0.08236393284532104, 0.0817754644898255, 0.033947680910846385, 0.3140920978592764, 0.1454003173927085, 0.1364006897167183, -0.2248656822363892, 0.053288643331368374, 0.005556034113252812]
|
1,803.06111
|
Vulnerability of Deep Learning
|
The Renormalisation Group (RG) provides a framework in which it is possible
to assess whether a deep-learning network is sensitive to small changes in the
input data and hence prone to error, or susceptible to adversarial attack.
Distinct classification outputs are associated with different RG fixed points
and sensitivity to small changes in the input data is due to the presence of
relevant operators at a fixed point. A numerical scheme, based on Monte Carlo
RG ideas, is proposed for identifying the existence of relevant operators and
the corresponding directions of greatest sensitivity in the input data. Thus, a
trained deep-learning network may be tested for its robustness and, if it is
vulnerable to attack, dangerous perturbations of the input data identified.
|
stat.ML cond-mat.dis-nn cond-mat.stat-mech cs.AI cs.LG
|
the renormalisation group rg provides a framework in which it is possible to assess whether a deeplearning network is sensitive to small changes in the input data and hence prone to error or susceptible to adversarial attack distinct classification outputs are associated with different rg fixed points and sensitivity to small changes in the input data is due to the presence of relevant operators at a fixed point a numerical scheme based on monte carlo rg ideas is proposed for identifying the existence of relevant operators and the corresponding directions of greatest sensitivity in the input data thus a trained deeplearning network may be tested for its robustness and if it is vulnerable to attack dangerous perturbations of the input data identified
|
[['the', 'renormalisation', 'group', 'rg', 'provides', 'a', 'framework', 'in', 'which', 'it', 'is', 'possible', 'to', 'assess', 'whether', 'a', 'deeplearning', 'network', 'is', 'sensitive', 'to', 'small', 'changes', 'in', 'the', 'input', 'data', 'and', 'hence', 'prone', 'to', 'error', 'or', 'susceptible', 'to', 'adversarial', 'attack', 'distinct', 'classification', 'outputs', 'are', 'associated', 'with', 'different', 'rg', 'fixed', 'points', 'and', 'sensitivity', 'to', 'small', 'changes', 'in', 'the', 'input', 'data', 'is', 'due', 'to', 'the', 'presence', 'of', 'relevant', 'operators', 'at', 'a', 'fixed', 'point', 'a', 'numerical', 'scheme', 'based', 'on', 'monte', 'carlo', 'rg', 'ideas', 'is', 'proposed', 'for', 'identifying', 'the', 'existence', 'of', 'relevant', 'operators', 'and', 'the', 'corresponding', 'directions', 'of', 'greatest', 'sensitivity', 'in', 'the', 'input', 'data', 'thus', 'a', 'trained', 'deeplearning', 'network', 'may', 'be', 'tested', 'for', 'its', 'robustness', 'and', 'if', 'it', 'is', 'vulnerable', 'to', 'attack', 'dangerous', 'perturbations', 'of', 'the', 'input', 'data', 'identified']]
|
[-0.12345885145706964, 0.0754339262207619, -0.07206628759025184, 0.09464817696926565, -0.08080207022502407, -0.18875245969803606, 0.06997414641120456, 0.3439004981401758, -0.27445653025976946, -0.3030886271869245, 0.15184463138050844, -0.3002744614314593, -0.14827353891069223, 0.17545133258681744, -0.10760566541070088, 0.09659926845171092, 0.06953834230461936, 0.054172388955446904, -0.06321901623608132, -0.24896237811027858, 0.3419103251434252, 0.08315601715909653, 0.2906321985131801, 0.022058340732283035, 0.07968005930363643, -0.03944157509011079, -0.07193102709019603, 0.003216763693060665, -0.06398069417317871, 0.08165355125114371, 0.30479517182538984, 0.12945151431715024, 0.28636907114357246, -0.39927662164736233, -0.18990506225677786, 0.1304386402556642, 0.10181554459554494, 0.13418074346387943, -0.022051294930622776, -0.32142563179501743, 0.15688195678817687, -0.13921770008975548, -0.1141741947408338, -0.12339148204010285, 0.025410766037730653, -0.021437361489095894, -0.3165280752410715, 0.02085702892270733, -0.010418775083008603, 0.03168283444523933, 0.003105117346839521, -0.05492308677448968, -0.07129505372674921, 0.15251923382442567, 0.08127696373686957, 0.06737434075020261, 0.15955490425427551, -0.13370781310559174, -0.08009659358849902, 0.37512308589686627, -0.03599447511770137, -0.23016327995135158, 0.19688423168959981, -0.04287034870873465, -0.13445229166126277, 0.1466678915522443, 0.22387168458357576, 0.10236372864713557, -0.1345567731644775, 0.02946153735993888, 0.00793279213525477, 0.15434895384962266, 0.007354522097214568, 0.013041990769065183, 0.15780543768492175, 0.19090119827172305, 0.07087887064782811, 0.11117923104673716, -0.12376172126692597, -0.07579100243585016, -0.288055161967469, -0.06565405684904974, -0.18982188273831957, 0.014273267143909803, -0.11223890817081021, -0.14843654176640156, 0.4241254037985572, 0.2464422116974048, 0.21173103270502608, 0.02177950136886421, 0.32937185830993915, 0.06679677018193436, 0.11240623912346534, 0.09616032512629497, 0.20578281028142778, 0.06332903651551144, 0.03235253393192027, -0.20935378128616902, 0.10461101907717645, 0.03699610391860736]
|
1,803.06112
|
Magnetic shocks and substructures excited by torsional Alfv\'en wave
interactions in merging expanding flux tubes
|
Vortex motions are frequently observed on the solar photosphere. These
motions may play a key role in the transport of energy and momentum from the
lower atmosphere into the upper solar atmosphere, contributing to coronal
heating. The lower solar atmosphere also consists of complex networks of flux
tubes that expand and merge throughout the chromosphere and upper atmosphere.
We perform numerical simulations to investigate the behaviour of vortex driven
waves propagating in a pair of such flux tubes in a non-force-free equilibrium
with a realistically modelled solar atmosphere. The two flux tubes are
independently perturbed at their footpoints by counter-rotating vortex motions.
When the flux tubes merge, the vortex motions interact both linearly and
nonlinearly. The linear interactions generate many small-scale transient
magnetic substructures due to the magnetic stress imposed by the vortex
motions. Thus, an initially monolithic tube is separated into a complex
multi-threaded tube due to the photospheric vortex motions. The wave
interactions also drive a superposition that increases in amplitude until it
exceeds the local Mach number and produces shocks that propagate upwards with
speeds of approximately $ 50$ km s$^{-1}$. The shocks act as conduits
transporting momentum and energy upwards, and heating the local plasma by more
than an order of magnitude, with peak temperature approximately $60,000$ K.
Therefore, we present a new mechanism for the generation of magnetic waveguides
from the lower solar atmosphere to the solar corona. This wave guide appears as
the result of interacting perturbations in neighbouring flux tubes. Thus, the
interactions of photospheric vortex motions is a potentially significant
mechanism for energy transfer from the lower to upper solar atmosphere.
|
astro-ph.SR
|
vortex motions are frequently observed on the solar photosphere these motions may play a key role in the transport of energy and momentum from the lower atmosphere into the upper solar atmosphere contributing to coronal heating the lower solar atmosphere also consists of complex networks of flux tubes that expand and merge throughout the chromosphere and upper atmosphere we perform numerical simulations to investigate the behaviour of vortex driven waves propagating in a pair of such flux tubes in a nonforcefree equilibrium with a realistically modelled solar atmosphere the two flux tubes are independently perturbed at their footpoints by counterrotating vortex motions when the flux tubes merge the vortex motions interact both linearly and nonlinearly the linear interactions generate many smallscale transient magnetic substructures due to the magnetic stress imposed by the vortex motions thus an initially monolithic tube is separated into a complex multithreaded tube due to the photospheric vortex motions the wave interactions also drive a superposition that increases in amplitude until it exceeds the local mach number and produces shocks that propagate upwards with speeds of approximately 50 km s1 the shocks act as conduits transporting momentum and energy upwards and heating the local plasma by more than an order of magnitude with peak temperature approximately 60000 k therefore we present a new mechanism for the generation of magnetic waveguides from the lower solar atmosphere to the solar corona this wave guide appears as the result of interacting perturbations in neighbouring flux tubes thus the interactions of photospheric vortex motions is a potentially significant mechanism for energy transfer from the lower to upper solar atmosphere
|
[['vortex', 'motions', 'are', 'frequently', 'observed', 'on', 'the', 'solar', 'photosphere', 'these', 'motions', 'may', 'play', 'a', 'key', 'role', 'in', 'the', 'transport', 'of', 'energy', 'and', 'momentum', 'from', 'the', 'lower', 'atmosphere', 'into', 'the', 'upper', 'solar', 'atmosphere', 'contributing', 'to', 'coronal', 'heating', 'the', 'lower', 'solar', 'atmosphere', 'also', 'consists', 'of', 'complex', 'networks', 'of', 'flux', 'tubes', 'that', 'expand', 'and', 'merge', 'throughout', 'the', 'chromosphere', 'and', 'upper', 'atmosphere', 'we', 'perform', 'numerical', 'simulations', 'to', 'investigate', 'the', 'behaviour', 'of', 'vortex', 'driven', 'waves', 'propagating', 'in', 'a', 'pair', 'of', 'such', 'flux', 'tubes', 'in', 'a', 'nonforcefree', 'equilibrium', 'with', 'a', 'realistically', 'modelled', 'solar', 'atmosphere', 'the', 'two', 'flux', 'tubes', 'are', 'independently', 'perturbed', 'at', 'their', 'footpoints', 'by', 'counterrotating', 'vortex', 'motions', 'when', 'the', 'flux', 'tubes', 'merge', 'the', 'vortex', 'motions', 'interact', 'both', 'linearly', 'and', 'nonlinearly', 'the', 'linear', 'interactions', 'generate', 'many', 'smallscale', 'transient', 'magnetic', 'substructures', 'due', 'to', 'the', 'magnetic', 'stress', 'imposed', 'by', 'the', 'vortex', 'motions', 'thus', 'an', 'initially', 'monolithic', 'tube', 'is', 'separated', 'into', 'a', 'complex', 'multithreaded', 'tube', 'due', 'to', 'the', 'photospheric', 'vortex', 'motions', 'the', 'wave', 'interactions', 'also', 'drive', 'a', 'superposition', 'that', 'increases', 'in', 'amplitude', 'until', 'it', 'exceeds', 'the', 'local', 'mach', 'number', 'and', 'produces', 'shocks', 'that', 'propagate', 'upwards', 'with', 'speeds', 'of', 'approximately', '50', 'km', 's1', 'the', 'shocks', 'act', 'as', 'conduits', 'transporting', 'momentum', 'and', 'energy', 'upwards', 'and', 'heating', 'the', 'local', 'plasma', 'by', 'more', 'than', 'an', 'order', 'of', 'magnitude', 'with', 'peak', 'temperature', 'approximately', '60000', 'k', 'therefore', 'we', 'present', 'a', 'new', 'mechanism', 'for', 'the', 'generation', 'of', 'magnetic', 'waveguides', 'from', 'the', 'lower', 'solar', 'atmosphere', 'to', 'the', 'solar', 'corona', 'this', 'wave', 'guide', 'appears', 'as', 'the', 'result', 'of', 'interacting', 'perturbations', 'in', 'neighbouring', 'flux', 'tubes', 'thus', 'the', 'interactions', 'of', 'photospheric', 'vortex', 'motions', 'is', 'a', 'potentially', 'significant', 'mechanism', 'for', 'energy', 'transfer', 'from', 'the', 'lower', 'to', 'upper', 'solar', 'atmosphere']]
|
[-0.1607639603195156, 0.2882582943324206, 0.013423687370308092, 0.08790190238549041, -0.060678251003394766, -0.026951557325908163, 0.015375942733736514, 0.38182642803624717, -0.24288798662931171, -0.3652193844101197, 0.052464357044490456, -0.24807254702492215, -0.03909595754847223, 0.23084996712963973, 0.023409132976015445, -0.016195066670675193, 0.07528127460486826, -0.010489178692866395, 0.014451883539536607, -0.1644542076518071, 0.25677955371619604, 0.1175237798675853, 0.22637626686335, 0.004548171069473028, 0.0666025015369141, -0.12781739549332563, -0.008569847620804724, 0.02025376511442322, -0.1116920209203557, 0.06554143357094128, 0.15200790969771985, 0.022299227208323055, 0.23299434165810862, -0.5411223672441582, -0.26340447566967196, 0.022219026019907932, 0.1990224415637942, 0.05124459212468659, -0.012937484555971138, -0.23969527840164295, 0.017673542208747187, -0.12381537536892401, -0.15439581169760716, 0.023742454876389558, 0.035077292260143965, 0.052729053594608125, -0.25667130877785105, 0.07785790211346466, 0.0854703156807922, 0.05977857709610782, -0.1101417288578588, -0.05090676593844459, -0.1308273644839872, 0.1039348577963468, 0.06406559906908617, 0.06075918356672541, 0.21957097915778764, -0.14212789735126954, -0.0393828357597674, 0.3720791140847506, -0.08104309196386933, -0.11576080557051004, 0.19674931966209672, -0.17826038700139232, -0.047947106786170424, 0.2633270122086518, 0.19284626261553547, 0.05764405555943194, -0.11425598438475376, -0.049157012769832524, -0.051642793362657015, 0.1267765283310063, 0.11016050537825743, 0.01198712026929733, 0.3330859507211665, 0.1445237495562882, 0.09717952813792438, 0.12407825627266916, -0.19066582791378667, -0.07868346582695063, -0.26184442290713067, -0.1201933361459593, -0.09798834336497612, 0.04862765523947345, -0.0817468529372192, -0.21091309154263713, 0.3779904279934326, 0.168312441797861, 0.1923414639827366, -0.020024756183361272, 0.3215833371748397, 0.11591251968638971, 0.07325466068152255, 0.17894123280212396, 0.304941014726403, 0.21745721695322626, 0.17810128063290143, -0.23251693700040593, 0.01226674390734354, 0.07239361394130722]
|
1,803.06113
|
Multiple structure and symmetry types in narrow temperature and magnetic
field ranges in two-dimensional Cr2Ge2Te6 crystal
|
Multiple structure and symmetry types and their transformations are
discovered in quasi-two-dimensional (quasi-2D) Cr2Ge2Te6 crystal in
surprisingly very narrow temperature range of 2 K and magnetic field range of
0.07 T using a homebuilt magnetic force microscope (MFM). A series of basic
domain patterns are extracted from the MFM images. Some of them seem unique to
2-D materials as they are not observed in 3-D materials, such as self-fitting
disks, and fine ladder structure within Y-connected walls. Based on these
findings, a phase map is drawn for the magnetic phase structures. The symmetry
of the patterns are discussed. The results are not only important in developing
new theories but also highly desirable in applications.
|
cond-mat.mtrl-sci
|
multiple structure and symmetry types and their transformations are discovered in quasitwodimensional quasi2d cr2ge2te6 crystal in surprisingly very narrow temperature range of 2 k and magnetic field range of 007 t using a homebuilt magnetic force microscope mfm a series of basic domain patterns are extracted from the mfm images some of them seem unique to 2d materials as they are not observed in 3d materials such as selffitting disks and fine ladder structure within yconnected walls based on these findings a phase map is drawn for the magnetic phase structures the symmetry of the patterns are discussed the results are not only important in developing new theories but also highly desirable in applications
|
[['multiple', 'structure', 'and', 'symmetry', 'types', 'and', 'their', 'transformations', 'are', 'discovered', 'in', 'quasitwodimensional', 'quasi2d', 'cr2ge2te6', 'crystal', 'in', 'surprisingly', 'very', 'narrow', 'temperature', 'range', 'of', '2', 'k', 'and', 'magnetic', 'field', 'range', 'of', '007', 't', 'using', 'a', 'homebuilt', 'magnetic', 'force', 'microscope', 'mfm', 'a', 'series', 'of', 'basic', 'domain', 'patterns', 'are', 'extracted', 'from', 'the', 'mfm', 'images', 'some', 'of', 'them', 'seem', 'unique', 'to', '2d', 'materials', 'as', 'they', 'are', 'not', 'observed', 'in', '3d', 'materials', 'such', 'as', 'selffitting', 'disks', 'and', 'fine', 'ladder', 'structure', 'within', 'yconnected', 'walls', 'based', 'on', 'these', 'findings', 'a', 'phase', 'map', 'is', 'drawn', 'for', 'the', 'magnetic', 'phase', 'structures', 'the', 'symmetry', 'of', 'the', 'patterns', 'are', 'discussed', 'the', 'results', 'are', 'not', 'only', 'important', 'in', 'developing', 'new', 'theories', 'but', 'also', 'highly', 'desirable', 'in', 'applications']]
|
[-0.1375583666397558, 0.16822902707333146, -0.0518493703815953, 0.03559114275620751, -0.09046881539896796, -0.13762552595082006, 0.011843200723108436, 0.47008564562669825, -0.28136724394114154, -0.3284493675788066, 0.09103300120010058, -0.26766197770068956, -0.1492430844394091, 0.23337550332403875, 0.016741163340546854, 0.04784501536570523, -0.030238306532347842, -0.020936579352045164, -0.08288222533987469, -0.1785798406885338, 0.2801377407574494, -0.010130185434328658, 0.30456835572009106, 0.03166383245427694, 0.03717556020793771, -0.05621319780974383, 0.04355383334664761, 0.08440918783058546, -0.13860893156587345, 0.06575996503878352, 0.25738158530189786, -0.005590598685167996, 0.17987833325501665, -0.4520809258101508, -0.23419600334351084, 0.011418432146976036, 0.15184473431924875, 0.11390865042085352, -0.1094038148107107, -0.28800550144764464, 0.0972187419392867, -0.076129585824674, -0.09305146141144048, -0.1518774109842655, -0.010334946451523917, 0.040359231051427615, -0.2225179894480139, 0.07787829687601645, 0.059581522033633, 0.13655830412504397, -0.10300181075373464, -0.11873442521859293, -0.036055884045448953, 0.12297926004144497, 0.02265407745289849, 0.05123948357400617, 0.16074253485047457, -0.1659901784530088, -0.0828702102839348, 0.41850980293072226, -0.00496718699079273, -0.13656735714591509, 0.22749064056344132, -0.20711787219624966, -0.13298526106102923, 0.15348953522957995, 0.13075883650734405, 0.12677383217461674, -0.14229534949845402, 0.04892077611917297, -0.052078070592999993, 0.17597700849624484, 0.052224638133858595, 0.06971975026785263, 0.26638192892174367, 0.14346677283174358, -0.015095971536149071, 0.10115801099995483, -0.12014268019395656, -0.04775745274465797, -0.25147012075311587, -0.13859720870303655, -0.18490373561923792, -0.005727044345933662, -0.07081142675711558, -0.19913698771935223, 0.36611961759626865, 0.12577766873541155, 0.22944962183412695, -0.07197210381231603, 0.2250678585010714, 0.010592936581815593, 0.12710245398297307, 0.0022542898035940845, 0.21797903757422837, 0.15268419808957592, 0.1450584179422419, -0.14676179179930063, 0.029042563363743414, 0.005324380133450697]
|
1,803.06114
|
A constant-ratio approximation algorithm for a class of hub-and-spoke
network design problems and metric labeling problems: star metric case
|
Transportation networks frequently employ hub-and-spoke network architectures
to route flows between many origin and destination pairs. Hub facilities work
as switching points for flows in large networks. In this study, we deal with a
problem, called the single allocation hub-and-spoke network design problem. In
the problem, the goal is to allocate each non-hub node to exactly one of given
hub nodes so as to minimize the total transportation cost. The problem is
essentially equivalent to another combinatorial optimization problem, called
the metric labeling problem. The metric labeling problem was first introduced
by Kleinberg and Tardos in 2002, motivated by application to segmentation
problems in computer vision and related areas. In this study, we deal with the
case where the set of hubs forms a star, which arises especially in
telecommunication networks. We propose a polynomial-time randomized
approximation algorithm for the problem, whose approximation ratio is less than
5.281. Our algorithms solve a linear relaxation problem and apply dependent
rounding procedures.
|
cs.DM cs.DS
|
transportation networks frequently employ hubandspoke network architectures to route flows between many origin and destination pairs hub facilities work as switching points for flows in large networks in this study we deal with a problem called the single allocation hubandspoke network design problem in the problem the goal is to allocate each nonhub node to exactly one of given hub nodes so as to minimize the total transportation cost the problem is essentially equivalent to another combinatorial optimization problem called the metric labeling problem the metric labeling problem was first introduced by kleinberg and tardos in 2002 motivated by application to segmentation problems in computer vision and related areas in this study we deal with the case where the set of hubs forms a star which arises especially in telecommunication networks we propose a polynomialtime randomized approximation algorithm for the problem whose approximation ratio is less than 5281 our algorithms solve a linear relaxation problem and apply dependent rounding procedures
|
[['transportation', 'networks', 'frequently', 'employ', 'hubandspoke', 'network', 'architectures', 'to', 'route', 'flows', 'between', 'many', 'origin', 'and', 'destination', 'pairs', 'hub', 'facilities', 'work', 'as', 'switching', 'points', 'for', 'flows', 'in', 'large', 'networks', 'in', 'this', 'study', 'we', 'deal', 'with', 'a', 'problem', 'called', 'the', 'single', 'allocation', 'hubandspoke', 'network', 'design', 'problem', 'in', 'the', 'problem', 'the', 'goal', 'is', 'to', 'allocate', 'each', 'nonhub', 'node', 'to', 'exactly', 'one', 'of', 'given', 'hub', 'nodes', 'so', 'as', 'to', 'minimize', 'the', 'total', 'transportation', 'cost', 'the', 'problem', 'is', 'essentially', 'equivalent', 'to', 'another', 'combinatorial', 'optimization', 'problem', 'called', 'the', 'metric', 'labeling', 'problem', 'the', 'metric', 'labeling', 'problem', 'was', 'first', 'introduced', 'by', 'kleinberg', 'and', 'tardos', 'in', '2002', 'motivated', 'by', 'application', 'to', 'segmentation', 'problems', 'in', 'computer', 'vision', 'and', 'related', 'areas', 'in', 'this', 'study', 'we', 'deal', 'with', 'the', 'case', 'where', 'the', 'set', 'of', 'hubs', 'forms', 'a', 'star', 'which', 'arises', 'especially', 'in', 'telecommunication', 'networks', 'we', 'propose', 'a', 'polynomialtime', 'randomized', 'approximation', 'algorithm', 'for', 'the', 'problem', 'whose', 'approximation', 'ratio', 'is', 'less', 'than', '5281', 'our', 'algorithms', 'solve', 'a', 'linear', 'relaxation', 'problem', 'and', 'apply', 'dependent', 'rounding', 'procedures']]
|
[-0.13454351391410455, 0.005010861021582968, -0.0276248550391756, 0.07612786040481297, -0.10588301523093832, -0.18536355861579068, 0.0816163270319521, 0.38592656096443534, -0.34302948166587155, -0.3215178289625328, 0.09724815052832128, -0.2768124580208678, -0.22653447329939808, 0.139580981770996, -0.15126927730161696, 0.09732913468615152, 0.08727348465326941, 0.012397513436735608, 0.009851664247662484, -0.2568733348685782, 0.29667634762372475, 0.04915023182984442, 0.2894751060579438, 0.04728779349534307, 0.10464656357944477, 0.012143654123065062, -0.0008787712344201281, 0.028993935503967803, -0.10570916114811553, 0.1296160009216692, 0.3416122642986011, 0.16992411732207985, 0.3699063775129616, -0.4127271249308251, -0.20832491375040263, 0.17071938521548874, 0.12925945903189132, 0.08298048589713289, 0.007485185326368082, -0.22304416282422607, 0.09767643762461375, -0.14594057914364383, -0.051661717493152536, 0.010460367253108416, 0.01727127241611015, -0.0157877014571568, -0.2795771993813105, 0.00614449594868347, -0.0006182708428241312, -0.003842571465065703, -0.05177956398983952, -0.08298511736356887, 0.0721874642156763, 0.12261923822188692, 0.029320400209689977, 0.0838645459021791, 0.08224579258094308, -0.13642099061889895, -0.2007252705283463, 0.4059404097381048, 0.04754458922061531, -0.22789263238664717, 0.13687445319228572, -0.0029910724697401747, -0.19470898660219974, 0.0863446861389093, 0.23890032535418868, 0.16814813467790374, -0.1614477297756821, 0.04115625894482946, -0.06799686627346091, 0.10803462200201466, 0.09161205417476595, -0.02726073043013457, 0.12471086451332666, 0.2103359935688786, 0.19601546598787536, 0.2039126796014898, -0.04787315187859349, -0.11987174429523292, -0.18179912630002945, -0.0900896564606228, -0.22430320435596512, 0.008330790464242455, -0.07951644994864182, -0.150925231401925, 0.37548658865271134, 0.13029122291191014, 0.206550877034897, 0.09642767418190487, 0.3102134004191612, 0.08327771541817128, 0.05064920640907076, 0.1646599577885354, 0.15490544409985887, 0.11378579156298656, 0.13016265108744846, -0.19583140373688365, 0.08777575972781052, 0.1008164384504198]
|
1,803.06115
|
Multi-gradient fluids
|
An internal energy function of the mass density, the volumetric entropy and
their gradients at n-order generates the representation of multi-gradient
fluids. Thanks to Hamilton's principle, we obtain a thermodynamical form of the
equation of motion which generalizes the case of perfect compressible fluids.
First integrals of flows are extended cases of perfect compressible fluids. The
equation of motion and the equation of energy are written for dissipative
cases, and are compatible with the second law of thermodynamics.
|
physics.flu-dyn math-ph math.MP
|
an internal energy function of the mass density the volumetric entropy and their gradients at norder generates the representation of multigradient fluids thanks to hamiltons principle we obtain a thermodynamical form of the equation of motion which generalizes the case of perfect compressible fluids first integrals of flows are extended cases of perfect compressible fluids the equation of motion and the equation of energy are written for dissipative cases and are compatible with the second law of thermodynamics
|
[['an', 'internal', 'energy', 'function', 'of', 'the', 'mass', 'density', 'the', 'volumetric', 'entropy', 'and', 'their', 'gradients', 'at', 'norder', 'generates', 'the', 'representation', 'of', 'multigradient', 'fluids', 'thanks', 'to', 'hamiltons', 'principle', 'we', 'obtain', 'a', 'thermodynamical', 'form', 'of', 'the', 'equation', 'of', 'motion', 'which', 'generalizes', 'the', 'case', 'of', 'perfect', 'compressible', 'fluids', 'first', 'integrals', 'of', 'flows', 'are', 'extended', 'cases', 'of', 'perfect', 'compressible', 'fluids', 'the', 'equation', 'of', 'motion', 'and', 'the', 'equation', 'of', 'energy', 'are', 'written', 'for', 'dissipative', 'cases', 'and', 'are', 'compatible', 'with', 'the', 'second', 'law', 'of', 'thermodynamics']]
|
[-0.15717785043472593, 0.115983363901841, -0.11020913061552814, 0.020125994743029407, -0.055226118787639326, -0.08534981033994586, -0.05484035322079798, 0.24177489588158085, -0.28168384631031324, -0.30116690557401676, 0.053824089001864195, -0.28005109473990347, -0.06856594474792674, 0.17388316993783046, -0.02311344697236918, 0.07455861022961992, 0.027497467509313644, 0.05920215386461902, -0.0699212257085102, -0.19289078799306186, 0.3359295910272699, 0.013075196801067947, 0.24975493695441778, 0.012608596788985389, 0.1946735168722543, -0.046535126975277896, -0.024504243438555437, 0.047216983521446, -0.18259145569225604, 0.10137484193622291, 0.19232454909277813, 0.024432445053833646, 0.19158125636107348, -0.4407009549148671, -0.25986489918469996, 0.06688083843751387, 0.07529234418693881, 0.13348880051423542, 0.000652023001465124, -0.24403433045432843, 0.02065687236533343, -0.17878357529059632, -0.19422212944595846, -0.09435097088239022, 0.01705031366655966, 0.09784611292763964, -0.2565785806698652, 0.24787937693733286, 0.09899697312480443, 0.001854312497299987, -0.16934213080358776, -0.07008045433730177, -0.06730154296383262, 0.08313399620426747, 0.0423124987728797, -0.028625695935946393, 0.10127105315929497, -0.20743256478340594, -0.0472239229174984, 0.4438081271462626, -0.059051510776610826, -0.2624107994284336, 0.17613480353800506, -0.11849375710181602, -0.06989440213671172, 0.1410578522746536, 0.1564339337410865, 0.16032898729841313, -0.16028814505809894, 0.0840187883919238, -0.03333969003756761, 0.10523363006869693, 0.10017552567258864, -0.016930437150907206, 0.20020552381099044, 0.09035148083341199, 0.03445278982293199, 0.15596796587932032, -0.025923042533943404, -0.16882830493563375, -0.3619790090272179, -0.2392918160986518, -0.18386737445925738, 0.06818386121326453, -0.12251094940315793, -0.17983205004462174, 0.3414509378580751, 0.07360953742081856, 0.10545218644010557, 0.06650757035028866, 0.26385804520339357, 0.187077287064454, -0.0178774000091067, 0.12136817216728028, 0.24003138858503692, 0.22232945052023928, 0.16847883863979346, -0.21288540679092108, 0.0037273723033389877, 0.1346543916567628]
|
1,803.06116
|
Thermophysical modeling of main-belt asteroids from WISE thermal data
|
By means of a varied-shape thermophysical model (VS-TPM) of Hanus et al.
(2015) that takes into account asteroid shape and pole uncertainties, we
analyze the thermal IR data acquired by the NASA's WISE satellite of about 300
asteroids with derived convex shape models. We utilize publicly available
convex shape models and rotation states as input for the TPM. For more than one
hundred asteroids, the TPM gives us an acceptable fit to the thermal IR data
allowing us to report their size, thermal inertia, surface roughness or visible
geometric albedo. This work more than doubles the number of asteroids with
determined thermophysical properties. In the remaining cases, the shape model
and pole orientation uncertainties, specific rotation or thermophysical
properties, poor thermal IR data or their coverage prevent the determination of
reliable thermophysical properties. Finally, we present the main results of the
statistical study of derived thermophysical parameters within the whole
population of main-belt asteroids and within few asteroid families. Our sizes
are, in average, consistent with the radiometric sizes reported by Mainzer et
al. (2016). The thermal inertia increases with decreasing size, but a large
range of thermal inertia values is observed within the similar size ranges
between D~10-100 km. We derived unexpectedly low thermal inertias (<20 SI) for
several asteroids with sizes 10<D<50 km, indicating a very fine and mature
regolith on their surface. The thermal inertia values seem to be consistent
within several collisional families. The fast rotators with P<4 h tend to have
slightly larger thermal inertia values, so probably are not covered by a fine
regolith. This could be explained, for example, by the loss of the fine
regolith due to the centrifugal force, or by the ineffectiveness of the
regolith production (e.g., by the thermal cracking mechanism of Delbo' et al.
2014).
|
astro-ph.EP
|
by means of a variedshape thermophysical model vstpm of hanus et al 2015 that takes into account asteroid shape and pole uncertainties we analyze the thermal ir data acquired by the nasas wise satellite of about 300 asteroids with derived convex shape models we utilize publicly available convex shape models and rotation states as input for the tpm for more than one hundred asteroids the tpm gives us an acceptable fit to the thermal ir data allowing us to report their size thermal inertia surface roughness or visible geometric albedo this work more than doubles the number of asteroids with determined thermophysical properties in the remaining cases the shape model and pole orientation uncertainties specific rotation or thermophysical properties poor thermal ir data or their coverage prevent the determination of reliable thermophysical properties finally we present the main results of the statistical study of derived thermophysical parameters within the whole population of mainbelt asteroids and within few asteroid families our sizes are in average consistent with the radiometric sizes reported by mainzer et al 2016 the thermal inertia increases with decreasing size but a large range of thermal inertia values is observed within the similar size ranges between d10100 km we derived unexpectedly low thermal inertias 20 si for several asteroids with sizes 10d50 km indicating a very fine and mature regolith on their surface the thermal inertia values seem to be consistent within several collisional families the fast rotators with p4 h tend to have slightly larger thermal inertia values so probably are not covered by a fine regolith this could be explained for example by the loss of the fine regolith due to the centrifugal force or by the ineffectiveness of the regolith production eg by the thermal cracking mechanism of delbo et al 2014
|
[['by', 'means', 'of', 'a', 'variedshape', 'thermophysical', 'model', 'vstpm', 'of', 'hanus', 'et', 'al', '2015', 'that', 'takes', 'into', 'account', 'asteroid', 'shape', 'and', 'pole', 'uncertainties', 'we', 'analyze', 'the', 'thermal', 'ir', 'data', 'acquired', 'by', 'the', 'nasas', 'wise', 'satellite', 'of', 'about', '300', 'asteroids', 'with', 'derived', 'convex', 'shape', 'models', 'we', 'utilize', 'publicly', 'available', 'convex', 'shape', 'models', 'and', 'rotation', 'states', 'as', 'input', 'for', 'the', 'tpm', 'for', 'more', 'than', 'one', 'hundred', 'asteroids', 'the', 'tpm', 'gives', 'us', 'an', 'acceptable', 'fit', 'to', 'the', 'thermal', 'ir', 'data', 'allowing', 'us', 'to', 'report', 'their', 'size', 'thermal', 'inertia', 'surface', 'roughness', 'or', 'visible', 'geometric', 'albedo', 'this', 'work', 'more', 'than', 'doubles', 'the', 'number', 'of', 'asteroids', 'with', 'determined', 'thermophysical', 'properties', 'in', 'the', 'remaining', 'cases', 'the', 'shape', 'model', 'and', 'pole', 'orientation', 'uncertainties', 'specific', 'rotation', 'or', 'thermophysical', 'properties', 'poor', 'thermal', 'ir', 'data', 'or', 'their', 'coverage', 'prevent', 'the', 'determination', 'of', 'reliable', 'thermophysical', 'properties', 'finally', 'we', 'present', 'the', 'main', 'results', 'of', 'the', 'statistical', 'study', 'of', 'derived', 'thermophysical', 'parameters', 'within', 'the', 'whole', 'population', 'of', 'mainbelt', 'asteroids', 'and', 'within', 'few', 'asteroid', 'families', 'our', 'sizes', 'are', 'in', 'average', 'consistent', 'with', 'the', 'radiometric', 'sizes', 'reported', 'by', 'mainzer', 'et', 'al', '2016', 'the', 'thermal', 'inertia', 'increases', 'with', 'decreasing', 'size', 'but', 'a', 'large', 'range', 'of', 'thermal', 'inertia', 'values', 'is', 'observed', 'within', 'the', 'similar', 'size', 'ranges', 'between', 'd10100', 'km', 'we', 'derived', 'unexpectedly', 'low', 'thermal', 'inertias', '20', 'si', 'for', 'several', 'asteroids', 'with', 'sizes', '10d50', 'km', 'indicating', 'a', 'very', 'fine', 'and', 'mature', 'regolith', 'on', 'their', 'surface', 'the', 'thermal', 'inertia', 'values', 'seem', 'to', 'be', 'consistent', 'within', 'several', 'collisional', 'families', 'the', 'fast', 'rotators', 'with', 'p4', 'h', 'tend', 'to', 'have', 'slightly', 'larger', 'thermal', 'inertia', 'values', 'so', 'probably', 'are', 'not', 'covered', 'by', 'a', 'fine', 'regolith', 'this', 'could', 'be', 'explained', 'for', 'example', 'by', 'the', 'loss', 'of', 'the', 'fine', 'regolith', 'due', 'to', 'the', 'centrifugal', 'force', 'or', 'by', 'the', 'ineffectiveness', 'of', 'the', 'regolith', 'production', 'eg', 'by', 'the', 'thermal', 'cracking', 'mechanism', 'of', 'delbo', 'et', 'al', '2014']]
|
[-0.025982086000500768, 0.17321790533452, -0.09628552203257361, 0.038126990305174004, -0.08505075185801261, -0.07170873617359243, 0.039277121261773004, 0.36104457289514486, -0.22104670991644315, -0.40586937483997676, 0.09530334293511744, -0.2624268356087672, -0.04596307124217826, 0.21585736725139257, -0.13218986950163117, 0.03940356605913317, 0.07040939185998416, -0.06742283950381794, -0.01035613657146972, -0.22518860454966694, 0.24796299144399986, 0.12905343397243946, 0.18189885134811898, 0.02091131233278449, 0.05592441498087369, -0.026132280707123205, -0.04221732189235954, 0.027253053042148992, -0.20752680422385075, 0.11772414978252686, 0.17415498333392404, 0.045590085490787906, 0.18040516230185538, -0.39833824861629424, -0.23487252532742892, 0.07199652997519401, 0.07651403521475861, 0.07904529222490865, 0.006341266767546986, -0.25641063832894045, 0.04653017879098196, -0.20327729822705426, -0.19545543356083409, -0.05075177531502664, 0.08196752328654504, 0.014396323355188142, -0.2298756587214183, 0.0888661448223955, 0.061138771344834475, 0.12197716646103042, -0.12934841639950312, -0.21493668385476206, -0.10031555788416682, 0.1061150634076459, 0.04625243353323674, -0.04152314611805965, 0.1975240369856599, -0.07459403350218215, -0.0200501384786505, 0.4129136443096801, -0.035309056865759414, -0.09476416878298533, 0.20139714545783277, -0.1634619478152194, -0.09598360026190486, 0.19733690205204965, 0.1640750467991806, 0.09202499203773298, -0.15335931008802442, 0.0264679522414687, -0.02323128381758331, 0.20862471484079018, 0.07651477383367031, 0.04344360128922369, 0.2516542572217021, 0.14404556163429336, 0.011377309737075438, 0.10328533649269758, -0.17909833452578494, -0.05167069438778964, -0.21757721203083724, -0.08250414994513496, -0.16439112105864537, 0.028087540427208943, -0.13806617019614387, -0.13652441296058965, 0.3490332749897913, 0.14872058142981223, 0.22272300138575288, 0.048591098872509245, 0.2883869000097082, 0.035656290226568285, 0.09657864690020858, 0.09621224708540473, 0.3011414175757776, 0.10336280792376262, 0.08548674200591552, -0.23042465974862844, 0.13335315768850123, 0.006977587397950908]
|
1,803.06117
|
Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic
Analysis
|
This work is motivated by the problem of error correction in bit-shift
channels with the so-called $ (d,k) $ input constraints (where successive $ 1
$'s are required to be separated by at least $ d $ and at most $ k $ zeros, $ 0
\leq d < k \leq \infty $). Bounds on the size of optimal $ (d,k) $-constrained
codes correcting a fixed number of bit-shifts are derived, with a focus on
their asymptotic behavior in the large block-length limit. The upper bound is
obtained by a packing argument, while the lower bound follows from a
construction based on a family of integer lattices. Several properties of $ (d,
k) $-constrained sequences that may be of independent interest are established
as well; in particular, the exponential growth-rate of the number of $ (d, k)
$-constrained constant-weight sequences is characterized. The results are
relevant for magnetic and optical information storage systems, reader-to-tag
RFID channels, and other communication models where bit-shift errors are
dominant and where $ (d, k) $-constrained sequences are used for modulation.
|
cs.IT cs.DM math.IT
|
this work is motivated by the problem of error correction in bitshift channels with the socalled dk input constraints where successive 1 s are required to be separated by at least d and at most k zeros 0 leq d k leq infty bounds on the size of optimal dk constrained codes correcting a fixed number of bitshifts are derived with a focus on their asymptotic behavior in the large blocklength limit the upper bound is obtained by a packing argument while the lower bound follows from a construction based on a family of integer lattices several properties of d k constrained sequences that may be of independent interest are established as well in particular the exponential growthrate of the number of d k constrained constantweight sequences is characterized the results are relevant for magnetic and optical information storage systems readertotag rfid channels and other communication models where bitshift errors are dominant and where d k constrained sequences are used for modulation
|
[['this', 'work', 'is', 'motivated', 'by', 'the', 'problem', 'of', 'error', 'correction', 'in', 'bitshift', 'channels', 'with', 'the', 'socalled', 'dk', 'input', 'constraints', 'where', 'successive', '1', 's', 'are', 'required', 'to', 'be', 'separated', 'by', 'at', 'least', 'd', 'and', 'at', 'most', 'k', 'zeros', '0', 'leq', 'd', 'k', 'leq', 'infty', 'bounds', 'on', 'the', 'size', 'of', 'optimal', 'dk', 'constrained', 'codes', 'correcting', 'a', 'fixed', 'number', 'of', 'bitshifts', 'are', 'derived', 'with', 'a', 'focus', 'on', 'their', 'asymptotic', 'behavior', 'in', 'the', 'large', 'blocklength', 'limit', 'the', 'upper', 'bound', 'is', 'obtained', 'by', 'a', 'packing', 'argument', 'while', 'the', 'lower', 'bound', 'follows', 'from', 'a', 'construction', 'based', 'on', 'a', 'family', 'of', 'integer', 'lattices', 'several', 'properties', 'of', 'd', 'k', 'constrained', 'sequences', 'that', 'may', 'be', 'of', 'independent', 'interest', 'are', 'established', 'as', 'well', 'in', 'particular', 'the', 'exponential', 'growthrate', 'of', 'the', 'number', 'of', 'd', 'k', 'constrained', 'constantweight', 'sequences', 'is', 'characterized', 'the', 'results', 'are', 'relevant', 'for', 'magnetic', 'and', 'optical', 'information', 'storage', 'systems', 'readertotag', 'rfid', 'channels', 'and', 'other', 'communication', 'models', 'where', 'bitshift', 'errors', 'are', 'dominant', 'and', 'where', 'd', 'k', 'constrained', 'sequences', 'are', 'used', 'for', 'modulation']]
|
[-0.21032638288455904, 0.17060179699513112, -0.023968680589662297, 0.04382000214084752, -0.003564620412226697, -0.22998587688812927, 0.08919768905562135, 0.31264983234429583, -0.27949741354967056, -0.3147089187321918, 0.14344910445177686, -0.27894176735964993, -0.10049421669950026, 0.2186062338050478, -0.03323821439436689, 0.0872143664092161, 0.0045843574446944165, 0.08279137837451807, -0.05760848195644917, -0.27771468498159824, 0.2677348726443507, 0.025821514300400427, 0.19070960404293508, 0.011945548296692024, 0.01616441800045023, -0.0013767207209136546, -0.032560393685671665, 0.0012397693689935696, -0.180704879464796, 0.11155485822486558, 0.25628762111973513, 0.1188544790677257, 0.23381376913777605, -0.34223038316791105, -0.1954005691061962, 0.11519988983441491, 0.17345247713860518, 0.06661015679562314, 0.013752253469432594, -0.22724330864748368, 0.1472831982020173, -0.09282753827709773, -0.07125207840505501, 0.0009432981565872335, 0.07610523286897411, 0.06256003787861096, -0.3365846032288319, 0.055872244724240266, 0.08427408044891697, 0.06781583990860493, -0.00983794679957795, -0.2361314004657339, 0.001027409344483514, 0.097692178226776, 0.018344953084966132, 0.04684890148024543, 0.07543795001664147, -0.09928271486366064, -0.0879905514147202, 0.3312364358882281, -0.06295985228133312, -0.18090410258979622, 0.13754830150163633, -0.12919791780053552, -0.1309997946174341, 0.15878620070133428, 0.18893660438935395, 0.1651930904756329, -0.10240086291841469, 0.14591319451357312, -0.06605515131576462, 0.15588570934263354, 0.10111932576813312, 0.12258577896339923, 0.15179376731632474, 0.12198925443045702, 0.07547240681738032, 0.1306610975926724, -0.06382746553852553, -0.04663392975752861, -0.30068336574140914, -0.0690365544000065, -0.24680027092072349, 0.044300104526120314, -0.10590584424103072, -0.08584371446241387, 0.2777245439450193, 0.062101539985785804, 0.23320402217427302, 0.10701062940842015, 0.2522244692681739, 0.09534981715715611, 0.02955176350472622, 0.1235830251986406, 0.1724601849647505, 0.1588671005646241, 0.009148563002380802, -0.19691904853329478, 0.07507509790846835, 0.07614990186686657]
|
1,803.06118
|
Gaussian Processes indexed on the symmetric group: prediction and
learning
|
In the framework of the supervised learning of a real function defined on a
space X , the so called Kriging method stands on a real Gaussian field defined
on X. The Euclidean case is well known and has been widely studied. In this
paper, we explore the less classical case where X is the non commutative finite
group of permutations. In this setting, we propose and study an harmonic
analysis of the covariance operators that enables to consider Gaussian
processes models and forecasting issues. Our theory is motivated by statistical
ranking problems.
|
stat.ML
|
in the framework of the supervised learning of a real function defined on a space x the so called kriging method stands on a real gaussian field defined on x the euclidean case is well known and has been widely studied in this paper we explore the less classical case where x is the non commutative finite group of permutations in this setting we propose and study an harmonic analysis of the covariance operators that enables to consider gaussian processes models and forecasting issues our theory is motivated by statistical ranking problems
|
[['in', 'the', 'framework', 'of', 'the', 'supervised', 'learning', 'of', 'a', 'real', 'function', 'defined', 'on', 'a', 'space', 'x', 'the', 'so', 'called', 'kriging', 'method', 'stands', 'on', 'a', 'real', 'gaussian', 'field', 'defined', 'on', 'x', 'the', 'euclidean', 'case', 'is', 'well', 'known', 'and', 'has', 'been', 'widely', 'studied', 'in', 'this', 'paper', 'we', 'explore', 'the', 'less', 'classical', 'case', 'where', 'x', 'is', 'the', 'non', 'commutative', 'finite', 'group', 'of', 'permutations', 'in', 'this', 'setting', 'we', 'propose', 'and', 'study', 'an', 'harmonic', 'analysis', 'of', 'the', 'covariance', 'operators', 'that', 'enables', 'to', 'consider', 'gaussian', 'processes', 'models', 'and', 'forecasting', 'issues', 'our', 'theory', 'is', 'motivated', 'by', 'statistical', 'ranking', 'problems']]
|
[-0.09109426292833751, 0.05198421587793627, -0.07456896516858884, 0.08491599157518383, -0.053988034065063716, -0.11503005483815365, 0.019736753619761894, 0.3812478120924662, -0.27601865411776566, -0.2188671273989198, 0.09320599004454182, -0.26159461430759856, -0.2014669349224752, 0.18898007038818754, -0.12798940676831358, 0.06767871532508213, -0.0030829063313000875, 0.07620487486660156, -0.09717420109740013, -0.2679941487908566, 0.3664569824114037, 0.015877020867344032, 0.2836470358559619, 0.002639182134652915, 0.12838762020186076, 0.04342369841786264, -0.07580877315637696, 0.015559910092712886, -0.10330645378931165, 0.11874354577056416, 0.25876457979270723, 0.1428439604983989, 0.33816527393039153, -0.35142967015828774, -0.2696644897957373, 0.19347491830147034, 0.1366620090810339, 0.025157794928299667, -0.015544180301493843, -0.27929470495260117, 0.06351993632067562, -0.14664880437877678, -0.07965625215665964, -0.09579699115989648, 0.0017236736767581137, -0.016905713089964473, -0.303973771813933, 0.03670812103613887, 0.06767388682372098, 0.08970995833996036, -0.02067184682591292, -0.10668902883670577, 0.052964630875857954, 0.06735762079631019, 0.03957346748970651, 0.06540750827812387, 0.09341071400305499, -0.07808958850902221, -0.14312835430483456, 0.39676930848509073, -0.05327930316106295, -0.25974210557203903, 0.16238643757685128, -0.14800960371655453, -0.15236906490653104, 0.015043103348706727, 0.20677892317610752, 0.20182823138969505, -0.1373423898957022, 0.20512572551745942, -0.10460374553930825, 0.12593470157488532, -0.0026270525489488373, -0.041206369079072436, 0.10899668803904206, 0.204930359021882, 0.06867611784052671, 0.16201252465480534, -0.06221740949726866, -0.1150230823651604, -0.29357149806278554, -0.1454946979293195, -0.2008647459063112, 0.04346080124504743, -0.06901832618298256, -0.207625631030406, 0.38947816536275914, 0.13695969804298921, 0.19828677116437693, 0.05876727524193247, 0.2938819582493085, 0.12907030268030686, 0.03312915333283498, 0.06179864309556053, 0.15143549606285017, 0.16597904803980465, 0.06067740059781657, -0.1176728864235844, 0.037847609451526536, 0.07562673489725136]
|
1,803.06119
|
Surjections and double posets
|
The theory and structure of the Hopf algebra of surjections (known as WQSym,
the Hopf algebra of word quasi-symmetric functions) parallels largely the one
of bijections (known as FQSym or MR, the Hopf algebra of word quasi-symmetric
functions or Malvenuto-Reutenauer Hopf algebra). The study of surjections from
a picture and double poset theoretic point of view, which is the subject of the
present article, seems instead new. The article is organized as follows. We
introduce first a family of double posets, weak planar posets, that generalize
the planar posets and are in bijection with surjections or, equivalently,
packed words. The following sections investigate their Hopf algebraic
properties, which are inherited from the Hopf algebra structure of double
posets and their relations with WQSym
|
math.CO math.RA
|
the theory and structure of the hopf algebra of surjections known as wqsym the hopf algebra of word quasisymmetric functions parallels largely the one of bijections known as fqsym or mr the hopf algebra of word quasisymmetric functions or malvenutoreutenauer hopf algebra the study of surjections from a picture and double poset theoretic point of view which is the subject of the present article seems instead new the article is organized as follows we introduce first a family of double posets weak planar posets that generalize the planar posets and are in bijection with surjections or equivalently packed words the following sections investigate their hopf algebraic properties which are inherited from the hopf algebra structure of double posets and their relations with wqsym
|
[['the', 'theory', 'and', 'structure', 'of', 'the', 'hopf', 'algebra', 'of', 'surjections', 'known', 'as', 'wqsym', 'the', 'hopf', 'algebra', 'of', 'word', 'quasisymmetric', 'functions', 'parallels', 'largely', 'the', 'one', 'of', 'bijections', 'known', 'as', 'fqsym', 'or', 'mr', 'the', 'hopf', 'algebra', 'of', 'word', 'quasisymmetric', 'functions', 'or', 'malvenutoreutenauer', 'hopf', 'algebra', 'the', 'study', 'of', 'surjections', 'from', 'a', 'picture', 'and', 'double', 'poset', 'theoretic', 'point', 'of', 'view', 'which', 'is', 'the', 'subject', 'of', 'the', 'present', 'article', 'seems', 'instead', 'new', 'the', 'article', 'is', 'organized', 'as', 'follows', 'we', 'introduce', 'first', 'a', 'family', 'of', 'double', 'posets', 'weak', 'planar', 'posets', 'that', 'generalize', 'the', 'planar', 'posets', 'and', 'are', 'in', 'bijection', 'with', 'surjections', 'or', 'equivalently', 'packed', 'words', 'the', 'following', 'sections', 'investigate', 'their', 'hopf', 'algebraic', 'properties', 'which', 'are', 'inherited', 'from', 'the', 'hopf', 'algebra', 'structure', 'of', 'double', 'posets', 'and', 'their', 'relations', 'with', 'wqsym']]
|
[-0.1670425571141598, 0.10275418934510733, -0.0401860465734773, 0.10440409793972788, -0.1789547161963897, -0.11921681749929743, 0.0161226533317363, 0.3268975128790712, -0.465578927166336, -0.191624102163757, 0.11851316576774376, -0.25644511273660797, -0.20844688875471976, 0.17040137272958486, -0.1283021920883074, -0.03802392332307328, 0.05929978036821434, 0.12219651493932901, -0.11367064540471306, -0.1941647966206831, 0.45201818203190114, -0.003949858797184094, 0.2308052074981899, -0.014584868536822922, 0.087604878905676, 0.015633697432231128, -0.05832468307524071, 0.022276051736217203, -0.2174309055471525, 0.09008397005604414, 0.2904240421163357, 0.09507446031169436, 0.18937386303943227, -0.34410725441587164, -0.03951519951830065, 0.11302852745894797, 0.17721378677562485, 0.01821356638130255, -0.019129971539170097, -0.268847924210434, 0.043851966310928504, -0.22596354984746472, -0.09268454680923463, -0.04188492888919782, 0.042043606138303574, 0.06529919181314366, -0.20962110134049855, -0.01179935291364062, 0.1774404352091677, 0.14940407698050262, -0.02652608044634808, -0.1118291873679822, -0.13064403273922398, 0.10317597019380124, -0.05656344797159356, 0.07245039324866744, 0.11162185467158754, -0.10808665912628658, -0.2540264766799604, 0.3668159486785554, 0.07438360455321012, -0.1959576675577498, 0.1340028870589577, -0.2259853876051985, -0.19220304763989476, 0.09730290146771728, 0.042221585296215565, 0.10767650642863862, -0.060779837545762744, 0.183902284292773, -0.18857277270285336, 0.029926578144446332, 0.1539949108278606, 0.033162476237469575, 0.18539574449669902, 0.11208524212347178, 0.01697281890594196, 0.21282737700616924, 0.06699199277937896, -0.057199876861480196, -0.30935032920139593, -0.11866473482649137, -0.06369792365628045, 0.09114893127565946, -0.08818818304481409, -0.2660184970913016, 0.40197591724373943, 0.08381269237677741, 0.17814664627478374, 0.14075053910482524, 0.16070208690182222, 0.04566999375384786, 0.1389410598089964, -0.04410254309044742, 0.119276276221726, 0.2985829352817642, 0.02052997022004026, -0.08742964006884675, -0.011602626379003854, 0.2621160670017021]
|
1,803.0612
|
Learning Sparse Deep Feedforward Networks via Tree Skeleton Expansion
|
Despite the popularity of deep learning, structure learning for deep models
remains a relatively under-explored area. In contrast, structure learning has
been studied extensively for probabilistic graphical models (PGMs). In
particular, an efficient algorithm has been developed for learning a class of
tree-structured PGMs called hierarchical latent tree models (HLTMs), where
there is a layer of observed variables at the bottom and multiple layers of
latent variables on top. In this paper, we propose a simple method for learning
the structures of feedforward neural networks (FNNs) based on HLTMs. The idea
is to expand the connections in the tree skeletons from HLTMs and to use the
resulting structures for FNNs. An important characteristic of FNN structures
learned this way is that they are sparse. We present extensive empirical
results to show that, compared with standard FNNs tuned-manually, sparse FNNs
learned by our method achieve better or comparable classification performance
with much fewer parameters. They are also more interpretable.
|
cs.LG
|
despite the popularity of deep learning structure learning for deep models remains a relatively underexplored area in contrast structure learning has been studied extensively for probabilistic graphical models pgms in particular an efficient algorithm has been developed for learning a class of treestructured pgms called hierarchical latent tree models hltms where there is a layer of observed variables at the bottom and multiple layers of latent variables on top in this paper we propose a simple method for learning the structures of feedforward neural networks fnns based on hltms the idea is to expand the connections in the tree skeletons from hltms and to use the resulting structures for fnns an important characteristic of fnn structures learned this way is that they are sparse we present extensive empirical results to show that compared with standard fnns tunedmanually sparse fnns learned by our method achieve better or comparable classification performance with much fewer parameters they are also more interpretable
|
[['despite', 'the', 'popularity', 'of', 'deep', 'learning', 'structure', 'learning', 'for', 'deep', 'models', 'remains', 'a', 'relatively', 'underexplored', 'area', 'in', 'contrast', 'structure', 'learning', 'has', 'been', 'studied', 'extensively', 'for', 'probabilistic', 'graphical', 'models', 'pgms', 'in', 'particular', 'an', 'efficient', 'algorithm', 'has', 'been', 'developed', 'for', 'learning', 'a', 'class', 'of', 'treestructured', 'pgms', 'called', 'hierarchical', 'latent', 'tree', 'models', 'hltms', 'where', 'there', 'is', 'a', 'layer', 'of', 'observed', 'variables', 'at', 'the', 'bottom', 'and', 'multiple', 'layers', 'of', 'latent', 'variables', 'on', 'top', 'in', 'this', 'paper', 'we', 'propose', 'a', 'simple', 'method', 'for', 'learning', 'the', 'structures', 'of', 'feedforward', 'neural', 'networks', 'fnns', 'based', 'on', 'hltms', 'the', 'idea', 'is', 'to', 'expand', 'the', 'connections', 'in', 'the', 'tree', 'skeletons', 'from', 'hltms', 'and', 'to', 'use', 'the', 'resulting', 'structures', 'for', 'fnns', 'an', 'important', 'characteristic', 'of', 'fnn', 'structures', 'learned', 'this', 'way', 'is', 'that', 'they', 'are', 'sparse', 'we', 'present', 'extensive', 'empirical', 'results', 'to', 'show', 'that', 'compared', 'with', 'standard', 'fnns', 'tunedmanually', 'sparse', 'fnns', 'learned', 'by', 'our', 'method', 'achieve', 'better', 'or', 'comparable', 'classification', 'performance', 'with', 'much', 'fewer', 'parameters', 'they', 'are', 'also', 'more', 'interpretable']]
|
[-0.015083037419867506, 0.04018869488162677, -0.07727001877620247, 0.10173070044360556, -0.13225033750555887, -0.16832201076659617, 0.025106153373048896, 0.5033103180871268, -0.28860875963571536, -0.29164827678494964, 0.0708161152433604, -0.227818442710266, -0.2576688959850532, 0.188897519127709, -0.09044999176648202, 0.08838368379244, 0.10324498809945241, 0.07730783471632986, -0.06485044313216534, -0.2923905846283172, 0.3007141299498309, 0.05935969872208858, 0.313091421737128, -0.04571862216260481, 0.1329107139234366, -0.046692753118717935, -0.017493666653895075, 0.01572617048480708, -0.06400566079824715, 0.21606777925162937, 0.295229725201723, 0.1604421637851484, 0.3308960847633707, -0.41964626882913386, -0.273996365606595, 0.10687392892517672, 0.1662776562367465, 0.09140478457164043, -0.042558722085765104, -0.271949293873433, 0.12595124863633875, -0.1710527053838418, 0.01905209300068213, -0.15679083493461085, -0.018655345259103805, -0.026441828591695683, -0.2864141782625596, 0.011926600162145995, 0.09715335677188056, 0.06247697130978629, -0.02079096196848116, -0.1726998241950467, 0.02011056533706179, 0.11053902053594541, 0.013180610043097549, 0.058545136012494337, 0.07377134144579055, -0.19962264170460878, -0.16008082562523662, 0.30362887318382503, -0.04868869254199468, -0.21216992987616426, 0.23904901404663398, -0.0190754792131009, -0.20304122148674858, 0.0961722912634634, 0.2588149500123943, 0.12243768452387896, -0.15268233076559534, 0.07131699834739683, -0.09156771035046335, 0.1645808920418476, 0.01823079026605234, -0.025988631745337682, 0.16047826283136798, 0.29174926141158314, 0.022148130519410513, 0.13210330588096503, -0.11414207132521328, -0.10033040419576844, -0.1688403389672452, -0.09335068682658006, -0.1721288984430847, -0.039579648480774346, -0.11280810880711284, -0.1979547659125013, 0.407779646313684, 0.179732754635239, 0.249552849893737, 0.13948618392104128, 0.30219267919113874, 0.0456718127754855, 0.12945273130016913, 0.14794641189205987, 0.19794369329272762, 0.10622607449597567, 0.0939005255538994, -0.09474061849633837, 0.14120870602619687, 0.041625028194349475]
|
1,803.06121
|
Complex Urban LiDAR Data Set
|
This paper presents a Light Detection and Ranging (LiDAR) data set that
targets complex urban environments. Urban environments with high-rise buildings
and congested traffic pose a significant challenge for many robotics
applications. The presented data set is unique in the sense it is able to
capture the genuine features of an urban environment (e.g. metropolitan areas,
large building complexes and underground parking lots). Data of two-dimensional
(2D) and threedimensional (3D) LiDAR, which are typical types of LiDAR sensors,
are provided in the data set. The two 16-ray 3D LiDARs are tilted on both sides
for maximal coverage. One 2D LiDAR faces backward while the other faces
forwards to collect data of roads and buildings, respectively. Raw sensor data
from Fiber Optic Gyro (FOG), Inertial Measurement Unit (IMU), and the Global
Positioning System (GPS) are presented in a file format for vehicle pose
estimation. The pose information of the vehicle estimated at 100 Hz is also
presented after applying the graph simultaneous localization and mapping (SLAM)
algorithm. For the convenience of development, the file player and data viewer
in Robot Operating System (ROS) environment were also released via the web
page. The full data sets are available at: http://irap.kaist.ac.kr/dataset. In
this website, 3D preview of each data set is provided using WebGL.
|
cs.RO
|
this paper presents a light detection and ranging lidar data set that targets complex urban environments urban environments with highrise buildings and congested traffic pose a significant challenge for many robotics applications the presented data set is unique in the sense it is able to capture the genuine features of an urban environment eg metropolitan areas large building complexes and underground parking lots data of twodimensional 2d and threedimensional 3d lidar which are typical types of lidar sensors are provided in the data set the two 16ray 3d lidars are tilted on both sides for maximal coverage one 2d lidar faces backward while the other faces forwards to collect data of roads and buildings respectively raw sensor data from fiber optic gyro fog inertial measurement unit imu and the global positioning system gps are presented in a file format for vehicle pose estimation the pose information of the vehicle estimated at 100 hz is also presented after applying the graph simultaneous localization and mapping slam algorithm for the convenience of development the file player and data viewer in robot operating system ros environment were also released via the web page the full data sets are available at httpirapkaistackrdataset in this website 3d preview of each data set is provided using webgl
|
[['this', 'paper', 'presents', 'a', 'light', 'detection', 'and', 'ranging', 'lidar', 'data', 'set', 'that', 'targets', 'complex', 'urban', 'environments', 'urban', 'environments', 'with', 'highrise', 'buildings', 'and', 'congested', 'traffic', 'pose', 'a', 'significant', 'challenge', 'for', 'many', 'robotics', 'applications', 'the', 'presented', 'data', 'set', 'is', 'unique', 'in', 'the', 'sense', 'it', 'is', 'able', 'to', 'capture', 'the', 'genuine', 'features', 'of', 'an', 'urban', 'environment', 'eg', 'metropolitan', 'areas', 'large', 'building', 'complexes', 'and', 'underground', 'parking', 'lots', 'data', 'of', 'twodimensional', '2d', 'and', 'threedimensional', '3d', 'lidar', 'which', 'are', 'typical', 'types', 'of', 'lidar', 'sensors', 'are', 'provided', 'in', 'the', 'data', 'set', 'the', 'two', '16ray', '3d', 'lidars', 'are', 'tilted', 'on', 'both', 'sides', 'for', 'maximal', 'coverage', 'one', '2d', 'lidar', 'faces', 'backward', 'while', 'the', 'other', 'faces', 'forwards', 'to', 'collect', 'data', 'of', 'roads', 'and', 'buildings', 'respectively', 'raw', 'sensor', 'data', 'from', 'fiber', 'optic', 'gyro', 'fog', 'inertial', 'measurement', 'unit', 'imu', 'and', 'the', 'global', 'positioning', 'system', 'gps', 'are', 'presented', 'in', 'a', 'file', 'format', 'for', 'vehicle', 'pose', 'estimation', 'the', 'pose', 'information', 'of', 'the', 'vehicle', 'estimated', 'at', '100', 'hz', 'is', 'also', 'presented', 'after', 'applying', 'the', 'graph', 'simultaneous', 'localization', 'and', 'mapping', 'slam', 'algorithm', 'for', 'the', 'convenience', 'of', 'development', 'the', 'file', 'player', 'and', 'data', 'viewer', 'in', 'robot', 'operating', 'system', 'ros', 'environment', 'were', 'also', 'released', 'via', 'the', 'web', 'page', 'the', 'full', 'data', 'sets', 'are', 'available', 'at', 'httpirapkaistackrdataset', 'in', 'this', 'website', '3d', 'preview', 'of', 'each', 'data', 'set', 'is', 'provided', 'using', 'webgl']]
|
[-0.11673626305232422, 0.026987582396754313, -0.007706536523748243, -0.003672015691135952, -0.056990246442770454, -0.17254293912076993, 0.015285971405710936, 0.41263524325047596, -0.2668484478551698, -0.33396351200853736, 0.15721574582468104, -0.3483950303506516, -0.09749864736286719, 0.25183645032544544, -0.17135717515927254, 0.11647007549760872, 0.15189539077836556, 0.016326761596164117, 0.028249377246643084, -0.20766462134846272, 0.2639025175658781, 0.013931157334783431, 0.3493711059048558, 0.009823765648020939, 0.13106728888631455, 0.021968350370729823, -0.06404538461760256, -0.030258535093329313, -0.07370901951733023, 0.16065263642336836, 0.3443236827101719, 0.19853818729858508, 0.20667607736947577, -0.4520728271031244, -0.20160655900568625, 0.05517642939592484, 0.09345214550502311, 0.06696848192811458, -0.0706768712228271, -0.3873196132793024, 0.07828412990812122, -0.16739415882921746, -0.07835649689392112, -0.02081730227436175, 0.0377937221819419, 0.020949830945846334, -0.26356940782733673, -0.018959788712795432, -0.04041354038235152, 0.14479111209422635, -0.06376049275572399, -0.05616357768261939, -0.04605385903090809, 0.24757387868293593, -0.02638009846467819, 0.03202323483817868, 0.20482562659709364, -0.14677288828185941, -0.07323180466420218, 0.432454738115366, 0.039024287753439905, -0.1756066995841099, 0.19829423167201374, -0.10750529701870523, -0.11632077028734263, 0.14189368226391633, 0.249178010163802, 0.055648456700814614, -0.20576518485946446, 0.015833009631511127, -0.04812652941650609, 0.13266198372949609, 0.06061896332539618, -0.007622404770399822, 0.18580290095203303, 0.22084800928661769, 0.12855340346040062, 0.07100163225745158, -0.19961871803792763, -0.0484757516065247, -0.22900192243488213, -0.13046354899387896, -0.19761320807342753, -0.040886674918519536, -0.11797793442606214, -0.1192479967874916, 0.36329387310607153, 0.2063258735454111, 0.16839981853904015, 0.03883870060357341, 0.3903133347407696, -0.009369134846974485, 0.07468169852511948, 0.09270032230982836, 0.13616991387657892, -0.03254590231510833, 0.19358108592727644, -0.11166615953165414, 0.03358824964519144, 0.019921260523837078]
|
1,803.06122
|
BPS Equations of Monopole and Dyon in $SU(2)$ Yang-Mills-Higgs Model,
Nakamula-Shiraishi Models, and Their Generalized Versions from The BPS
Lagrangian Method
|
We apply the BPS Lagrangian method~\cite{Atmaja:2015umo} to derive BPS
equations of monopole and dyon in the $SU(2)$ Yang-Mills-Higgs model,
Nakamula-Shiraishi models, and their Generalized versions. We argue that by
identifying the effective fields of scalar field, $f$, and of time-component
gauge field, $j$, explicitly by $j=\beta f$ with $\beta$ is a real constant,
the usual BPS equations for dyon can be obtained naturally. We validate this
identification by showing that both Euler-Lagrange equations for $f$ and $j$
are identical in the BPS limit. The value of $\beta$ is bounded to $|\beta|<1$
due to reality condition on the resulting BPS equations. In the Born-Infeld
type of actions, namely Nakamula-Shiraishi models and their Generalized
versions, we find a new feature that adding the energy density by a constant
$4b^2$, with $b$ is the Born-Infeld parameter, will turn monopole(dyon) to
anti-monopole(anti-dyon) and vice versa. In all Generalized versions there are
additional constraint equations that relate the scalar-dependent couplings of
scalar and of gauge kinectic terms; or $G$ and $w$ respectively. For monopole
the constraint equation is $G=w^{-1}$, while for dyon is $w(G-\beta^2
w)=1-\beta^2$ which further gives lower bound to $G$ as such
$G\geq|2\beta\sqrt{1-\beta^2}|$. We also write down the complete square-forms
of all effective Lagrangians.
|
hep-th
|
we apply the bps lagrangian methodciteatmaja2015umo to derive bps equations of monopole and dyon in the su2 yangmillshiggs model nakamulashiraishi models and their generalized versions we argue that by identifying the effective fields of scalar field f and of timecomponent gauge field j explicitly by jbeta f with beta is a real constant the usual bps equations for dyon can be obtained naturally we validate this identification by showing that both eulerlagrange equations for f and j are identical in the bps limit the value of beta is bounded to beta1 due to reality condition on the resulting bps equations in the borninfeld type of actions namely nakamulashiraishi models and their generalized versions we find a new feature that adding the energy density by a constant 4b2 with b is the borninfeld parameter will turn monopoledyon to antimonopoleantidyon and vice versa in all generalized versions there are additional constraint equations that relate the scalardependent couplings of scalar and of gauge kinectic terms or g and w respectively for monopole the constraint equation is gw1 while for dyon is wgbeta2 w1beta2 which further gives lower bound to g as such ggeq2betasqrt1beta2 we also write down the complete squareforms of all effective lagrangians
|
[['we', 'apply', 'the', 'bps', 'lagrangian', 'methodciteatmaja2015umo', 'to', 'derive', 'bps', 'equations', 'of', 'monopole', 'and', 'dyon', 'in', 'the', 'su2', 'yangmillshiggs', 'model', 'nakamulashiraishi', 'models', 'and', 'their', 'generalized', 'versions', 'we', 'argue', 'that', 'by', 'identifying', 'the', 'effective', 'fields', 'of', 'scalar', 'field', 'f', 'and', 'of', 'timecomponent', 'gauge', 'field', 'j', 'explicitly', 'by', 'jbeta', 'f', 'with', 'beta', 'is', 'a', 'real', 'constant', 'the', 'usual', 'bps', 'equations', 'for', 'dyon', 'can', 'be', 'obtained', 'naturally', 'we', 'validate', 'this', 'identification', 'by', 'showing', 'that', 'both', 'eulerlagrange', 'equations', 'for', 'f', 'and', 'j', 'are', 'identical', 'in', 'the', 'bps', 'limit', 'the', 'value', 'of', 'beta', 'is', 'bounded', 'to', 'beta1', 'due', 'to', 'reality', 'condition', 'on', 'the', 'resulting', 'bps', 'equations', 'in', 'the', 'borninfeld', 'type', 'of', 'actions', 'namely', 'nakamulashiraishi', 'models', 'and', 'their', 'generalized', 'versions', 'we', 'find', 'a', 'new', 'feature', 'that', 'adding', 'the', 'energy', 'density', 'by', 'a', 'constant', '4b2', 'with', 'b', 'is', 'the', 'borninfeld', 'parameter', 'will', 'turn', 'monopoledyon', 'to', 'antimonopoleantidyon', 'and', 'vice', 'versa', 'in', 'all', 'generalized', 'versions', 'there', 'are', 'additional', 'constraint', 'equations', 'that', 'relate', 'the', 'scalardependent', 'couplings', 'of', 'scalar', 'and', 'of', 'gauge', 'kinectic', 'terms', 'or', 'g', 'and', 'w', 'respectively', 'for', 'monopole', 'the', 'constraint', 'equation', 'is', 'gw1', 'while', 'for', 'dyon', 'is', 'wgbeta2', 'w1beta2', 'which', 'further', 'gives', 'lower', 'bound', 'to', 'g', 'as', 'such', 'ggeq2betasqrt1beta2', 'we', 'also', 'write', 'down', 'the', 'complete', 'squareforms', 'of', 'all', 'effective', 'lagrangians']]
|
[-0.13243068362433444, 0.15411240258623685, -0.044185833096326815, 0.08746783732234564, -0.09838473478026649, -0.1638357438092864, 0.011693623775499873, 0.28401260781434495, -0.18782102621515237, -0.33116777224722443, 0.06632096464400766, -0.253740807380478, -0.1413299340234882, 0.13957271273937766, -0.031672621539439116, 0.011258495828659131, -0.004844165685532427, 0.09016306262719569, -0.09220622707941821, -0.2519573006488225, 0.3501035426176651, -0.022768187980295687, 0.21695997337250178, 0.04542779691810547, 0.09784862630699993, -0.015050458990988475, 0.01082886297196623, 0.04116073431121924, -0.1549039591818607, 0.10418030312691356, 0.18539044701189533, 0.08543009876899382, 0.18332669452305825, -0.3928154542322749, -0.20539783758342897, 0.12117150254922096, 0.1545358592026532, 0.09755957654305294, 0.008482033558677705, -0.2717825765204098, 0.11703379016379437, -0.14619730115946994, -0.15529526159211637, -0.1205850282718462, 0.05234637507976639, 0.02605263608669192, -0.31058207122490755, 0.08539244098722486, 0.06570410877823456, -0.012496118039562904, -0.09393521837850727, -0.1324205976644797, -0.09269023766475064, 0.05729923030459624, 0.09224128166753208, 0.04806184983028779, 0.08609161050448184, -0.19562445942647558, -0.09533820183431513, 0.3603901795909873, -0.12435379017421005, -0.2722275017947944, 0.1170741953891973, -0.09735912050086039, -0.1363541154121911, 0.08714233278962118, 0.10362825879738444, 0.14924157908674152, -0.12565720289521826, 0.20845623299104984, -0.054018511984462815, 0.1294237035671594, 0.08182503640769966, 0.0001098404813400179, 0.20299197466940516, 0.023467719957735094, 0.07569994104572783, 0.14159503740704465, -0.015659464487470885, -0.1055665770718069, -0.3668344234604211, -0.15200160528322504, -0.10342827075525685, 0.09743098960203862, -0.101931302112813, -0.1481592374528566, 0.37097809599742054, 0.12351535580603888, 0.14982926466615584, 0.07042905903069016, 0.198304476919855, 0.17350439860783615, 0.055421236586798886, 0.08877864107859158, 0.23287699423316452, 0.17071151042051574, 0.07989675042505262, -0.23392850038147084, -0.09934850616341151, 0.15723295639065482]
|
1,803.06123
|
On Combination Networks with Cache-aided Relays and Users
|
Caching is an efficient way to reduce peak hour network traffic congestion by
storing some contents at the user's cache without knowledge of later demands.
Coded caching strategy was originally proposed by Maddah-Ali and Niesen to give
an additional coded caching gain compared the conventional uncoded scheme.
Under practical consideration, the caching model was recently considered in
relay network, in particular the combination network, where the central server
communicates with $K=\binom{H}{r}$ users (each is with a cache of $M$ files)
through $H$ immediate relays, and each user is connected to a different
$r-$subsets of relays. Several inner bounds and outer bounds were proposed for
combination networks with end-user-caches. This paper extends the recent work
by the authors on centralized combination networks with end-user caches to a
more general setting, where both relays and users have caches. In contrast to
the existing schemes in which the packets transmitted from the server are
independent of the cached contents of relays, we propose a novel caching scheme
by creating an additional coded caching gain to the transmitted load from the
server with the help of the cached contents in relays. We also show that the
proposed scheme outperforms the state-of-the-art approaches.
|
cs.IT math.IT
|
caching is an efficient way to reduce peak hour network traffic congestion by storing some contents at the users cache without knowledge of later demands coded caching strategy was originally proposed by maddahali and niesen to give an additional coded caching gain compared the conventional uncoded scheme under practical consideration the caching model was recently considered in relay network in particular the combination network where the central server communicates with kbinomhr users each is with a cache of m files through h immediate relays and each user is connected to a different rsubsets of relays several inner bounds and outer bounds were proposed for combination networks with endusercaches this paper extends the recent work by the authors on centralized combination networks with enduser caches to a more general setting where both relays and users have caches in contrast to the existing schemes in which the packets transmitted from the server are independent of the cached contents of relays we propose a novel caching scheme by creating an additional coded caching gain to the transmitted load from the server with the help of the cached contents in relays we also show that the proposed scheme outperforms the stateoftheart approaches
|
[['caching', 'is', 'an', 'efficient', 'way', 'to', 'reduce', 'peak', 'hour', 'network', 'traffic', 'congestion', 'by', 'storing', 'some', 'contents', 'at', 'the', 'users', 'cache', 'without', 'knowledge', 'of', 'later', 'demands', 'coded', 'caching', 'strategy', 'was', 'originally', 'proposed', 'by', 'maddahali', 'and', 'niesen', 'to', 'give', 'an', 'additional', 'coded', 'caching', 'gain', 'compared', 'the', 'conventional', 'uncoded', 'scheme', 'under', 'practical', 'consideration', 'the', 'caching', 'model', 'was', 'recently', 'considered', 'in', 'relay', 'network', 'in', 'particular', 'the', 'combination', 'network', 'where', 'the', 'central', 'server', 'communicates', 'with', 'kbinomhr', 'users', 'each', 'is', 'with', 'a', 'cache', 'of', 'm', 'files', 'through', 'h', 'immediate', 'relays', 'and', 'each', 'user', 'is', 'connected', 'to', 'a', 'different', 'rsubsets', 'of', 'relays', 'several', 'inner', 'bounds', 'and', 'outer', 'bounds', 'were', 'proposed', 'for', 'combination', 'networks', 'with', 'endusercaches', 'this', 'paper', 'extends', 'the', 'recent', 'work', 'by', 'the', 'authors', 'on', 'centralized', 'combination', 'networks', 'with', 'enduser', 'caches', 'to', 'a', 'more', 'general', 'setting', 'where', 'both', 'relays', 'and', 'users', 'have', 'caches', 'in', 'contrast', 'to', 'the', 'existing', 'schemes', 'in', 'which', 'the', 'packets', 'transmitted', 'from', 'the', 'server', 'are', 'independent', 'of', 'the', 'cached', 'contents', 'of', 'relays', 'we', 'propose', 'a', 'novel', 'caching', 'scheme', 'by', 'creating', 'an', 'additional', 'coded', 'caching', 'gain', 'to', 'the', 'transmitted', 'load', 'from', 'the', 'server', 'with', 'the', 'help', 'of', 'the', 'cached', 'contents', 'in', 'relays', 'we', 'also', 'show', 'that', 'the', 'proposed', 'scheme', 'outperforms', 'the', 'stateoftheart', 'approaches']]
|
[-0.2216721024452283, -0.01557203429359009, -0.04095233296786392, -0.028012988440040028, -0.10085616931130136, -0.2876269847419359, 0.17712937794249922, 0.40994131445960347, -0.256953837926769, -0.29210393297660925, 0.06790750787113581, -0.29924052825943936, -0.1286510267120025, 0.08370517748337107, -0.16504477249543528, 0.03562919342143433, 0.024978720823275978, 0.04829893613867651, -0.001252546869832928, -0.37144172910321976, 0.3067608419510295, 0.12985730907988502, 0.35947308886493673, 0.02190606590439589, 0.04943525986887779, 0.015745030242127134, -0.07100180654401234, -0.04952175068245908, -0.07030117331767191, 0.10136579466909218, 0.3577742610353655, 0.1932022143335204, 0.2692264266179752, -0.46850020978316137, -0.2575961695068048, 0.03415873855220031, 0.1660875028854964, 0.07538214838073168, -0.05976031171587866, -0.31579252148075454, 0.17066552986149786, -0.2669021894275991, 0.02398578138657973, 0.021416710472197703, -0.07471878448179757, 0.07126380530597293, -0.33205259310053237, -0.07099098036893606, -0.027588409031292206, -0.009834472146145244, -0.0300732994709769, -0.1132041354076275, 0.006905600615318505, 0.15892646419886633, 0.03422639282422641, 0.014401996785391898, 0.11561669616281589, -0.07392966910856327, -0.14442926493288977, 0.3547266072990741, -0.0012533064402148204, -0.18487938934568374, 0.11913795418904971, -0.015054427678247696, -0.10295385471781536, 0.15656183683549807, 0.2276902034179057, 0.07137851141449915, -0.18193253170436505, 0.02555878773724027, -0.07694228674724773, 0.18432335576709113, 0.13569311291064481, 0.10405454461653078, 0.11283750130516018, 0.21308318848797322, 0.15085047201920054, 0.14065265873456514, -0.0755075214916443, -0.10222704205094708, -0.19919272724463402, -0.13365465906084642, -0.22589216197410664, -0.038714947859723556, -0.14383016139248783, -0.004025485871246245, 0.3426675795358117, 0.15317420449301714, 0.1348867541377617, 0.111520713910243, 0.44162280008499394, 0.07501089383391805, 0.12101349456538328, 0.22998160821607874, 0.09994904726562279, 0.03779016363701599, 0.1975925288418412, -0.16238989592718933, 0.11048663091469972, 0.02520330367505853]
|
1,803.06124
|
Topological Hall effect for electron scattering on skyrmions in external
magnetic field
|
We consider topological Hall effect (THE) in thin ferromagnetic films due to
electron scattering on magnetic skyrmions in the presence of the relatively
strong external magnetic field. We account for the effect of the magnetic field
on a skyrmion structure and describe the hallmarks of THE differentiating it
from ordinary and anomalous Hall effects. We have found that, although in
typical ferromagnets the variation of magnetic field in the range 1-5 T
substantially affects the skyrmion size, THE changes rather weakly remaining
quite robust. Therefore, the magnitude of THE is primarily determined by the
skyrmions sheet density $n_{sk}$, being comparable to the magnitude of the
ordinary Hall effect (OHE) at $n_{sk}=10^{11}$ cm$^{-2}$. The sign of THE is
opposite to that of OHE for skyrmions with positive vorticity, while for
antiskyrmions the signs are the same.
|
cond-mat.mes-hall
|
we consider topological hall effect the in thin ferromagnetic films due to electron scattering on magnetic skyrmions in the presence of the relatively strong external magnetic field we account for the effect of the magnetic field on a skyrmion structure and describe the hallmarks of the differentiating it from ordinary and anomalous hall effects we have found that although in typical ferromagnets the variation of magnetic field in the range 15 t substantially affects the skyrmion size the changes rather weakly remaining quite robust therefore the magnitude of the is primarily determined by the skyrmions sheet density n_sk being comparable to the magnitude of the ordinary hall effect ohe at n_sk1011 cm2 the sign of the is opposite to that of ohe for skyrmions with positive vorticity while for antiskyrmions the signs are the same
|
[['we', 'consider', 'topological', 'hall', 'effect', 'the', 'in', 'thin', 'ferromagnetic', 'films', 'due', 'to', 'electron', 'scattering', 'on', 'magnetic', 'skyrmions', 'in', 'the', 'presence', 'of', 'the', 'relatively', 'strong', 'external', 'magnetic', 'field', 'we', 'account', 'for', 'the', 'effect', 'of', 'the', 'magnetic', 'field', 'on', 'a', 'skyrmion', 'structure', 'and', 'describe', 'the', 'hallmarks', 'of', 'the', 'differentiating', 'it', 'from', 'ordinary', 'and', 'anomalous', 'hall', 'effects', 'we', 'have', 'found', 'that', 'although', 'in', 'typical', 'ferromagnets', 'the', 'variation', 'of', 'magnetic', 'field', 'in', 'the', 'range', '15', 't', 'substantially', 'affects', 'the', 'skyrmion', 'size', 'the', 'changes', 'rather', 'weakly', 'remaining', 'quite', 'robust', 'therefore', 'the', 'magnitude', 'of', 'the', 'is', 'primarily', 'determined', 'by', 'the', 'skyrmions', 'sheet', 'density', 'n_sk', 'being', 'comparable', 'to', 'the', 'magnitude', 'of', 'the', 'ordinary', 'hall', 'effect', 'ohe', 'at', 'n_sk1011', 'cm2', 'the', 'sign', 'of', 'the', 'is', 'opposite', 'to', 'that', 'of', 'ohe', 'for', 'skyrmions', 'with', 'positive', 'vorticity', 'while', 'for', 'antiskyrmions', 'the', 'signs', 'are', 'the', 'same']]
|
[-0.17175269820171393, 0.21911995196993003, -0.024879609502212546, 0.05137851865051676, -0.06446546168803279, -0.06802577980960817, 0.003495452094583341, 0.34368987307438986, -0.25985944456657145, -0.35367493779718207, 0.049931145922989764, -0.27952012168452034, -0.08468629828473526, 0.1904624762402764, 0.025702575979226115, -0.032305534477276146, -0.0706419015091274, 0.028738171452962195, -0.06393028314072471, -0.22488723794144314, 0.3245915747438766, -0.028443884114915535, 0.29445951116452024, 0.07157647724735981, 0.06596142486599621, -0.014780419206232834, 0.05832949701180584, 0.09077050389874894, -0.10788540479975993, 0.03344292588730268, 0.16182542613832585, -0.12887284414384015, 0.17674903180484952, -0.48740973957438966, -0.16772531411513242, 0.055898699838209394, 0.14077293144108088, 0.1480423440051668, -0.07835921225634945, -0.28546781742201643, 0.10427426973031138, -0.13538593684545538, -0.1294801735472101, -0.05598490632750761, 0.08928158935489577, -0.015173950507531443, -0.22348499358996554, 0.11572791732249976, 0.09280008190561698, 0.07694927325694641, -0.115990185206617, -0.14487662663294085, -0.06109315331733382, 0.0722038618692044, 0.12417436316661509, 0.055923584017228446, 0.18789830633418272, -0.2246448761477733, -0.11221599942698741, 0.36819426159360513, -0.06922262281513036, -0.1335935516171279, 0.16420945083833674, -0.254446279177609, -0.05923728523219922, 0.16668200298775432, 0.11928958202531534, 0.10701776833843384, -0.07169346531215402, 0.0757021079310772, -0.018473705573097816, 0.1539392768963129, 0.02920056079034763, 0.06771949260606806, 0.28320062735270873, 0.1581693399478612, 0.050727923680444376, 0.1382733375353586, -0.15309954163924194, -0.04751829114923282, -0.22104983481773133, -0.15033660259153417, -0.19068898440081514, 0.05985866296070336, -0.08325558153233915, -0.1932891637656782, 0.39809043217561585, 0.1863888482599686, 0.1706562241497658, -0.06509146420285106, 0.2795791841918297, 0.12889942415614628, 0.11529939329084843, 0.02979942028577537, 0.30472618381061883, 0.18343562119355453, 0.14467857638384832, -0.3166259348430713, 0.1171425515855315, -0.009266299812415087]
|
1,803.06125
|
Improved Landauer's principle and generalized second law of
thermodynamics with initial correlations and non-equilibrium surrounding
environments
|
Traditional form of the second law of thermodynamics is strongly restricted
by three conditions: One is the initial joint state of the system and
surroundings should be a product state, so that there exists no initial
correlations. The second is the initial states of surroundings are in
equilibrium thermodynamics. And the end is weak couplings between the system
and surroundings. This formulation of the second law should be reexamined in
order to understand the relations of thermodynamics and information theory,
especially, when existing initial correlations. In this work, using the
techniques of quantum statistical mechanics for thermodynamics and quantum
information science, we recast fundamental laws of thermodynamics from
theoretical information point of view. Initial correlations between the system
and surroundings are considered, which evolves thermodynamically and result in
modifications of the traditional formulations. We obtained improved forms of
the entropy increase, Landauer's principle, and the second law of
thermodynamics, which are exhibited as equalities rather than inequalities, and
through which physical nature of information can be demonstrated precisely.
Further, using the language totally belongs to quantum information theory, we
give the direction of natural evolution process a new statement: the evolution
of an isolated quantum system, where no correlations exist between subsystems,
initially, always towards to directions of the correlation information never be
decreased. Such result indicates that the traditional principle of entropy
increase can be redescribed using information theory, identically.
|
quant-ph gr-qc
|
traditional form of the second law of thermodynamics is strongly restricted by three conditions one is the initial joint state of the system and surroundings should be a product state so that there exists no initial correlations the second is the initial states of surroundings are in equilibrium thermodynamics and the end is weak couplings between the system and surroundings this formulation of the second law should be reexamined in order to understand the relations of thermodynamics and information theory especially when existing initial correlations in this work using the techniques of quantum statistical mechanics for thermodynamics and quantum information science we recast fundamental laws of thermodynamics from theoretical information point of view initial correlations between the system and surroundings are considered which evolves thermodynamically and result in modifications of the traditional formulations we obtained improved forms of the entropy increase landauers principle and the second law of thermodynamics which are exhibited as equalities rather than inequalities and through which physical nature of information can be demonstrated precisely further using the language totally belongs to quantum information theory we give the direction of natural evolution process a new statement the evolution of an isolated quantum system where no correlations exist between subsystems initially always towards to directions of the correlation information never be decreased such result indicates that the traditional principle of entropy increase can be redescribed using information theory identically
|
[['traditional', 'form', 'of', 'the', 'second', 'law', 'of', 'thermodynamics', 'is', 'strongly', 'restricted', 'by', 'three', 'conditions', 'one', 'is', 'the', 'initial', 'joint', 'state', 'of', 'the', 'system', 'and', 'surroundings', 'should', 'be', 'a', 'product', 'state', 'so', 'that', 'there', 'exists', 'no', 'initial', 'correlations', 'the', 'second', 'is', 'the', 'initial', 'states', 'of', 'surroundings', 'are', 'in', 'equilibrium', 'thermodynamics', 'and', 'the', 'end', 'is', 'weak', 'couplings', 'between', 'the', 'system', 'and', 'surroundings', 'this', 'formulation', 'of', 'the', 'second', 'law', 'should', 'be', 'reexamined', 'in', 'order', 'to', 'understand', 'the', 'relations', 'of', 'thermodynamics', 'and', 'information', 'theory', 'especially', 'when', 'existing', 'initial', 'correlations', 'in', 'this', 'work', 'using', 'the', 'techniques', 'of', 'quantum', 'statistical', 'mechanics', 'for', 'thermodynamics', 'and', 'quantum', 'information', 'science', 'we', 'recast', 'fundamental', 'laws', 'of', 'thermodynamics', 'from', 'theoretical', 'information', 'point', 'of', 'view', 'initial', 'correlations', 'between', 'the', 'system', 'and', 'surroundings', 'are', 'considered', 'which', 'evolves', 'thermodynamically', 'and', 'result', 'in', 'modifications', 'of', 'the', 'traditional', 'formulations', 'we', 'obtained', 'improved', 'forms', 'of', 'the', 'entropy', 'increase', 'landauers', 'principle', 'and', 'the', 'second', 'law', 'of', 'thermodynamics', 'which', 'are', 'exhibited', 'as', 'equalities', 'rather', 'than', 'inequalities', 'and', 'through', 'which', 'physical', 'nature', 'of', 'information', 'can', 'be', 'demonstrated', 'precisely', 'further', 'using', 'the', 'language', 'totally', 'belongs', 'to', 'quantum', 'information', 'theory', 'we', 'give', 'the', 'direction', 'of', 'natural', 'evolution', 'process', 'a', 'new', 'statement', 'the', 'evolution', 'of', 'an', 'isolated', 'quantum', 'system', 'where', 'no', 'correlations', 'exist', 'between', 'subsystems', 'initially', 'always', 'towards', 'to', 'directions', 'of', 'the', 'correlation', 'information', 'never', 'be', 'decreased', 'such', 'result', 'indicates', 'that', 'the', 'traditional', 'principle', 'of', 'entropy', 'increase', 'can', 'be', 'redescribed', 'using', 'information', 'theory', 'identically']]
|
[-0.11086163929163668, 0.14200151702082964, -0.15057863362206073, 0.08131947218937285, -0.03897312959430344, -0.14455066071581338, 0.0461709777430482, 0.29338120175243326, -0.30732658770523996, -0.3070995689075424, 0.09663913926791974, -0.3122463768017498, -0.112613096015802, 0.16079216912082392, -0.03930619359392028, 0.03608914696333277, 0.05277411269479596, 0.06877046693277694, -0.08549018362657977, -0.219755155266186, 0.3451912021405543, 0.04518029953703865, 0.29531744844784147, 0.060302591928002705, 0.07910212366418405, -0.0012642845538650433, 0.010417445347083982, 0.06755610641751748, -0.12316658899816231, 0.11940973079375301, 0.23225431052012394, 0.14963672823954002, 0.26507533169895797, -0.4289155270243104, -0.22098444419957342, 0.09714456536158016, 0.10215748126570184, 0.12337440353247753, -0.022365740938333885, -0.2667618269247942, 0.04011813437984954, -0.16198757278745052, -0.13962389133052672, -0.06881165494779487, 0.01609902340793797, -0.010282182642682032, -0.2364695648379519, 0.1330613174669251, 0.119827443872905, 0.04596432404909122, -0.06979978441974366, -0.04550476480493104, -0.039595705927732636, 0.1573723798787304, 0.02233149464044607, 0.010135960628609152, 0.14546687010619225, -0.11422992743213069, -0.1122757781826633, 0.3696253191935729, -0.012204193395526688, -0.20296730347848557, 0.17069911271498994, -0.14735876381154336, -0.15813245221335456, 0.06884647673399096, 0.12032605088074003, 0.0958955719385352, -0.1850548083342746, 0.056232454376930203, 0.01029306658426727, 0.18618123517515345, 0.03497360275203596, 0.08713989963581649, 0.2410870639426388, 0.11071030769065764, 0.0399899288076601, 0.1566625129591746, -0.016295553596279065, -0.19876690375017914, -0.3094582864147857, -0.19836448413598073, -0.20206089265588106, 0.07893870150049527, -0.08400592145763763, -0.10542160739065894, 0.31283032939188765, 0.14574913677731247, 0.14715468985314817, 0.016946018390756632, 0.26913576592233646, 0.14401003787116634, 0.02786923920759907, 0.0679380344418462, 0.28816730102364907, 0.16141234307743416, 0.13607782970920398, -0.1834800238194432, 0.09142608454983149, 0.06120211122662345]
|
1,803.06126
|
Fokker-Planck equations of jumping particles and mean field games of
impulse control
|
This paper is interested in the description of the density of particles
evolving according to some optimal policy of an impulse control problem. We
first fix sets on which the particles jump and explain how we can characterize
such a density. We then investigate the coupled case in which the underlying
impulse control problem depends on the density we are looking for : the mean
field games of impulse control. In both cases, we give a variational
characterization of the densities of jumping particles.
|
math.AP
|
this paper is interested in the description of the density of particles evolving according to some optimal policy of an impulse control problem we first fix sets on which the particles jump and explain how we can characterize such a density we then investigate the coupled case in which the underlying impulse control problem depends on the density we are looking for the mean field games of impulse control in both cases we give a variational characterization of the densities of jumping particles
|
[['this', 'paper', 'is', 'interested', 'in', 'the', 'description', 'of', 'the', 'density', 'of', 'particles', 'evolving', 'according', 'to', 'some', 'optimal', 'policy', 'of', 'an', 'impulse', 'control', 'problem', 'we', 'first', 'fix', 'sets', 'on', 'which', 'the', 'particles', 'jump', 'and', 'explain', 'how', 'we', 'can', 'characterize', 'such', 'a', 'density', 'we', 'then', 'investigate', 'the', 'coupled', 'case', 'in', 'which', 'the', 'underlying', 'impulse', 'control', 'problem', 'depends', 'on', 'the', 'density', 'we', 'are', 'looking', 'for', 'the', 'mean', 'field', 'games', 'of', 'impulse', 'control', 'in', 'both', 'cases', 'we', 'give', 'a', 'variational', 'characterization', 'of', 'the', 'densities', 'of', 'jumping', 'particles']]
|
[-0.11844415760722506, 0.11832037104271964, -0.1085285758599639, 0.07305884283843887, -0.029382324452141683, -0.06598889298108687, 0.05351623584353646, 0.37164220080363103, -0.2720044376777418, -0.2734985997036369, 0.11798694752947797, -0.23926372612344035, -0.15996172835668884, 0.13314760760235858, -0.10270313725032541, 0.036941809417029105, -0.020232915373361974, 0.08490226143993528, -0.04528276539261801, -0.21915940915694437, 0.3428523862195841, 0.009435408243752387, 0.22525071958640971, 0.041535140350404905, 0.13941755701776548, 0.05806469356259668, -0.016655220599643077, 0.04825313681678644, -0.1968538883613445, 0.10607593352569783, 0.2256412670824183, 0.11035402444561562, 0.29722705254533205, -0.44600624301616687, -0.1937605156198548, 0.14013993353526816, 0.12960597510303717, 0.1283232229116586, -0.04215306099448129, -0.239945003715153, 0.0605804465699896, -0.13051073491034737, -0.13136190045288348, -0.03772643112566277, -0.01842011682302074, 0.08890799105346921, -0.3000806896633143, 0.03850493035896356, 0.03275152358664087, 0.022876048578420675, -0.12305197408927762, -0.07121617688112948, 0.040587337102729784, 0.13928856930684252, 0.038089593533000135, -0.02246846887002508, 0.15560712260811263, -0.16311141911961408, -0.10765370066805058, 0.3744274543890034, -0.05246827738213701, -0.24355145263855896, 0.1664922656154776, -0.13894567958672577, -0.11351362940664571, 0.11608134030577648, 0.25629465499084936, 0.15033595465931548, -0.16199488106396903, 0.09407221129744774, -0.07668811890874506, 0.13883612643792687, 0.05340170186484255, 0.006144236167331776, 0.16356995092502918, 0.1701598025140274, 0.13259618489789854, 0.15651627876290894, -0.0704595879202776, -0.11623708827488394, -0.3358315477057932, -0.15670799929648638, -0.1685450755295355, 0.02725708882986422, -0.04241457239269554, -0.1723927834059998, 0.43138691001986884, 0.18760946385158472, 0.1886982658361814, 0.07822968070507498, 0.2539670888267188, 0.1886187439492668, -0.0488409431179963, 0.10272006242794085, 0.20266597639069422, 0.14568010796175665, 0.057890018998050546, -0.24082802543809345, 0.0807710083549371, 0.03661927543804947]
|
1,803.06127
|
Towards Advanced Phenotypic Mutations in Cartesian Genetic Programming
|
Cartesian Genetic Programming is often used with a point mutation as the sole
genetic operator. In this paper, we propose two phenotypic mutation techniques
and take a step towards advanced phenotypic mutations in Cartesian Genetic
Programming. The functionality of the proposed mutations is inspired by
biological evolution which mutates DNA sequences by inserting and deleting
nucleotides. Experiments with symbolic regression and boolean functions
problems show a better search performance when the proposed mutations are in
use. The results of our experiments indicate that the use of phenotypic
mutations could be beneficial for the use of Cartesian Genetic Programming.
|
cs.NE cs.AI
|
cartesian genetic programming is often used with a point mutation as the sole genetic operator in this paper we propose two phenotypic mutation techniques and take a step towards advanced phenotypic mutations in cartesian genetic programming the functionality of the proposed mutations is inspired by biological evolution which mutates dna sequences by inserting and deleting nucleotides experiments with symbolic regression and boolean functions problems show a better search performance when the proposed mutations are in use the results of our experiments indicate that the use of phenotypic mutations could be beneficial for the use of cartesian genetic programming
|
[['cartesian', 'genetic', 'programming', 'is', 'often', 'used', 'with', 'a', 'point', 'mutation', 'as', 'the', 'sole', 'genetic', 'operator', 'in', 'this', 'paper', 'we', 'propose', 'two', 'phenotypic', 'mutation', 'techniques', 'and', 'take', 'a', 'step', 'towards', 'advanced', 'phenotypic', 'mutations', 'in', 'cartesian', 'genetic', 'programming', 'the', 'functionality', 'of', 'the', 'proposed', 'mutations', 'is', 'inspired', 'by', 'biological', 'evolution', 'which', 'mutates', 'dna', 'sequences', 'by', 'inserting', 'and', 'deleting', 'nucleotides', 'experiments', 'with', 'symbolic', 'regression', 'and', 'boolean', 'functions', 'problems', 'show', 'a', 'better', 'search', 'performance', 'when', 'the', 'proposed', 'mutations', 'are', 'in', 'use', 'the', 'results', 'of', 'our', 'experiments', 'indicate', 'that', 'the', 'use', 'of', 'phenotypic', 'mutations', 'could', 'be', 'beneficial', 'for', 'the', 'use', 'of', 'cartesian', 'genetic', 'programming']]
|
[-0.05708680887307439, 0.05313591276561575, -0.03865761402044065, 0.09696058840229538, -0.08609575229906002, -0.16953249086568856, 0.09012316149342876, 0.38638367635026877, -0.32201409138435005, -0.19862053400779867, 0.06587190499020816, -0.19698680785950273, -0.30571591258001496, 0.16557234306867252, -0.1183942690941338, 0.014237827868485937, 0.18313892735334644, -0.02630839601387175, 0.043354925022422504, -0.30960736081612356, 0.2980364135713602, 0.06216629320394476, 0.23861320013636533, -0.0387269826605916, 0.1244581122550049, -0.0025452956205652077, -0.04103226188513241, 0.03577507810895236, -0.09982450593333295, 0.14561606901139496, 0.35673336971703234, 0.2747155654871342, 0.3665288243708866, -0.4508337490260601, -0.17695392328979714, 0.09304867777023085, 0.15886373915329424, 0.19057151073071993, -0.06463518757753227, -0.2625361487307415, 0.08484158902524078, -0.11552241963467427, -0.016807904514503116, -0.10200814127313848, -0.02449140094733816, 0.0772038117687845, -0.3054067733298455, 0.01933900660559611, 0.04625812595786185, 0.1536603868862956, -0.008858985932809966, -0.1991319562004385, -0.051752925477446796, 0.14065586822018342, 0.04542096092232636, 0.05143205289804966, 0.20007979758654018, -0.047002914387789765, -0.26032657414788796, 0.3287992044351995, -0.008882627874726847, -0.2797189465467343, 0.21352091705312534, -0.09381392542082741, -0.15612760025589745, 0.08843559728061058, 0.1524565223157786, 0.1099335614268725, -0.19896650891967846, 0.07896977988824876, 0.01906352603275861, 0.15808245978865781, 0.12507974721576867, -0.044118678411088734, 0.1718729921279247, 0.22661878355560178, 0.07134594978546077, 0.1560457774772955, -0.07449651952376779, -0.12940774650826137, -0.18817674888449967, -0.17703045690812322, -0.1427403353344725, 0.02166304019830969, -0.15389782708682884, -0.20923843809251427, 0.38582713168342503, 0.14123768195253322, 0.13949871046126497, 0.1306515888522417, 0.2787527574881987, 0.05899429158307612, 0.1495333725541393, -0.024814677158636705, 0.07025503668083562, 0.058552308678056816, 0.08641280881034172, -0.29854221563971584, 0.1807844709719018, 0.07683208116273187]
|
1,803.06128
|
Noncommutative Mather-Yau theorem and its applications to Calabi-Yau
algebras
|
In this article, we prove that for a finite quiver $Q$ the equivalence class
of a potential up to formal change of variables of the complete path algebra
$\widehat{\mathbb{C} Q}$, is determined by its Jacobi algebra together with the
class in its 0-th Hochschild homology represented by the potential assuming the
Jacobi algebra is finite dimensional. This is an noncommutative analogue of the
famous theorem of Mather and Yau on isolated hypersurface singularities. We
also prove that the right equivalence class of a potential is determined by its
sufficiently high jet assuming the Jacobi algebra is finite dimensional. These
two theorems can be viewed as a first step towards the singularity theory of
noncommutative power series. As an application, we show that if the Jacobi
algebra is finite dimensional then the corresponding complete Ginzburg
dg-algebra, and the (topological) generalized cluster category thereof, are
determined by the isomorphic type of the Jacobi algebra together with the class
in its 0-th Hochschild homology represented by the potential.
|
math.AG math.RA math.RT
|
in this article we prove that for a finite quiver q the equivalence class of a potential up to formal change of variables of the complete path algebra widehatmathbbc q is determined by its jacobi algebra together with the class in its 0th hochschild homology represented by the potential assuming the jacobi algebra is finite dimensional this is an noncommutative analogue of the famous theorem of mather and yau on isolated hypersurface singularities we also prove that the right equivalence class of a potential is determined by its sufficiently high jet assuming the jacobi algebra is finite dimensional these two theorems can be viewed as a first step towards the singularity theory of noncommutative power series as an application we show that if the jacobi algebra is finite dimensional then the corresponding complete ginzburg dgalgebra and the topological generalized cluster category thereof are determined by the isomorphic type of the jacobi algebra together with the class in its 0th hochschild homology represented by the potential
|
[['in', 'this', 'article', 'we', 'prove', 'that', 'for', 'a', 'finite', 'quiver', 'q', 'the', 'equivalence', 'class', 'of', 'a', 'potential', 'up', 'to', 'formal', 'change', 'of', 'variables', 'of', 'the', 'complete', 'path', 'algebra', 'widehatmathbbc', 'q', 'is', 'determined', 'by', 'its', 'jacobi', 'algebra', 'together', 'with', 'the', 'class', 'in', 'its', '0th', 'hochschild', 'homology', 'represented', 'by', 'the', 'potential', 'assuming', 'the', 'jacobi', 'algebra', 'is', 'finite', 'dimensional', 'this', 'is', 'an', 'noncommutative', 'analogue', 'of', 'the', 'famous', 'theorem', 'of', 'mather', 'and', 'yau', 'on', 'isolated', 'hypersurface', 'singularities', 'we', 'also', 'prove', 'that', 'the', 'right', 'equivalence', 'class', 'of', 'a', 'potential', 'is', 'determined', 'by', 'its', 'sufficiently', 'high', 'jet', 'assuming', 'the', 'jacobi', 'algebra', 'is', 'finite', 'dimensional', 'these', 'two', 'theorems', 'can', 'be', 'viewed', 'as', 'a', 'first', 'step', 'towards', 'the', 'singularity', 'theory', 'of', 'noncommutative', 'power', 'series', 'as', 'an', 'application', 'we', 'show', 'that', 'if', 'the', 'jacobi', 'algebra', 'is', 'finite', 'dimensional', 'then', 'the', 'corresponding', 'complete', 'ginzburg', 'dgalgebra', 'and', 'the', 'topological', 'generalized', 'cluster', 'category', 'thereof', 'are', 'determined', 'by', 'the', 'isomorphic', 'type', 'of', 'the', 'jacobi', 'algebra', 'together', 'with', 'the', 'class', 'in', 'its', '0th', 'hochschild', 'homology', 'represented', 'by', 'the', 'potential']]
|
[-0.16649055165436233, 0.06777530536990416, -0.08974529157787788, 0.055199575493690756, -0.10171638014585231, -0.1287254261360927, -0.04198101208982707, 0.3123512518451069, -0.3905017078825922, -0.19779062192096855, 0.11266674058243745, -0.2221547859354001, -0.15099176132741074, 0.16013093775025372, -0.13265923070259414, -0.01719828667260255, 0.053132211893909806, 0.13205915422065917, -0.12044029857709326, -0.2594292715248285, 0.435418733483124, 0.004827375835597967, 0.1918477745867814, 0.05240805385577859, 0.12590133357567318, 0.023394954594021494, -0.011256105434431722, 0.024711971198011076, -0.13684737153036455, 0.09684992373187208, 0.27730763402739256, 0.04345509860608162, 0.2286076785276898, -0.3484956496028286, -0.12242817141284996, 0.15041651243739057, 0.1447721251851004, 0.014758046404599693, -0.018184047145063453, -0.27039663661271335, 0.13840551957149397, -0.23636962209235537, -0.21259513666401758, -0.06434158445635782, 0.05517145579285694, 0.017865015665125668, -0.22079774899351778, 0.04328192147747331, 0.10273165604325407, 0.12020715897281965, -0.08008757087430268, -0.05537783263646292, -0.09407613891332099, 0.06531105882516414, -0.02905426432068149, 0.04992114104274096, 0.07929214914752679, -0.07791088173958777, -0.15078109106274717, 0.35960514978929, -0.051122917895289985, -0.2207457897607872, 0.08601830513075445, -0.15353624539901362, -0.18511971780098974, 0.09945059194596428, 0.025155311749514304, 0.15046060673440947, -0.04286052497724692, 0.22648590991033637, -0.07787132253588148, 0.04783873050896959, 0.10687445173830246, -0.026529335374520582, 0.1713400039086771, 0.08222799337835926, 0.05740403892811049, 0.15604991649178732, 0.006507171516899358, -0.08196107160977342, -0.3699870137272008, -0.2019384451210499, -0.17991553467670174, 0.15523159102206893, -0.15731704690560672, -0.1946793425658887, 0.3996432148145907, 0.05786191283788701, 0.17069854009332078, 0.10976409173824571, 0.21596535508605566, 0.1669799062691516, 0.06950151728974148, 0.013005768372253939, 0.15563779971138997, 0.25579697242091326, 0.027029279752098248, -0.1546097056911976, -0.03512993520125747, 0.2425421820262052]
|
1,803.06129
|
Twin radio relics in a near-by low-mass galaxy cluster Abell 168
|
We report the discovery of twin radio relics in the outskirts of the low-mass
merging galaxy cluster Abell 168 (redshift=0.045). One of the relics is
elongated with a linear extent $\sim$ 800 kpc, a projected width of $\sim$ 80
kpc and is located $\sim$ 900 kpc toward the north of the cluster center,
oriented roughly perpendicular to the major axis of the X-ray emission. The
second relic is ring-shaped with a size $\sim$ 220 kpc and is located near the
inner edge of the elongated relic at a distance of $\sim$ 600 kpc from the
cluster center. These radio sources were imaged at 323 and 608 MHz with the
Giant Meterwave Radio Telescope and at 1520 MHz with the Karl G Jansky Very
Large Array (VLA). The elongated relic was detected at all the frequencies with
a radio power at 1.4 GHz of 1.38$\pm 0.14 \times 10^{23}$ W Hz$^{-1}$ having a
power law in the frequency range 70 - 1500 MHz (S$\propto \nu^{\alpha}, \alpha
= -1.1 \pm 0.04$). This radio power is in good agreement with that expected
from the known empirical relation between the radio powers of relics and the
host cluster masses. This is the lowest mass (M$_{500}$ = 1.24$\times$10$^{14}$
M$_{o}$) cluster in which relics due to merger shocks are detected. The
ring-shaped relic has a steeper spectral index ($\alpha$) of -1.74$\pm$0.29 in
the frequency range 100 - 600 MHz. We propose this relic to be an old plasma
revived due to adiabatic compression by the outgoing shock which produced the
elongated relic.
|
astro-ph.CO astro-ph.GA
|
we report the discovery of twin radio relics in the outskirts of the lowmass merging galaxy cluster abell 168 redshift0045 one of the relics is elongated with a linear extent sim 800 kpc a projected width of sim 80 kpc and is located sim 900 kpc toward the north of the cluster center oriented roughly perpendicular to the major axis of the xray emission the second relic is ringshaped with a size sim 220 kpc and is located near the inner edge of the elongated relic at a distance of sim 600 kpc from the cluster center these radio sources were imaged at 323 and 608 mhz with the giant meterwave radio telescope and at 1520 mhz with the karl g jansky very large array vla the elongated relic was detected at all the frequencies with a radio power at 14 ghz of 138pm 014 times 1023 w hz1 having a power law in the frequency range 70 1500 mhz spropto nualpha alpha 11 pm 004 this radio power is in good agreement with that expected from the known empirical relation between the radio powers of relics and the host cluster masses this is the lowest mass m_500 124times1014 m_o cluster in which relics due to merger shocks are detected the ringshaped relic has a steeper spectral index alpha of 174pm029 in the frequency range 100 600 mhz we propose this relic to be an old plasma revived due to adiabatic compression by the outgoing shock which produced the elongated relic
|
[['we', 'report', 'the', 'discovery', 'of', 'twin', 'radio', 'relics', 'in', 'the', 'outskirts', 'of', 'the', 'lowmass', 'merging', 'galaxy', 'cluster', 'abell', '168', 'redshift0045', 'one', 'of', 'the', 'relics', 'is', 'elongated', 'with', 'a', 'linear', 'extent', 'sim', '800', 'kpc', 'a', 'projected', 'width', 'of', 'sim', '80', 'kpc', 'and', 'is', 'located', 'sim', '900', 'kpc', 'toward', 'the', 'north', 'of', 'the', 'cluster', 'center', 'oriented', 'roughly', 'perpendicular', 'to', 'the', 'major', 'axis', 'of', 'the', 'xray', 'emission', 'the', 'second', 'relic', 'is', 'ringshaped', 'with', 'a', 'size', 'sim', '220', 'kpc', 'and', 'is', 'located', 'near', 'the', 'inner', 'edge', 'of', 'the', 'elongated', 'relic', 'at', 'a', 'distance', 'of', 'sim', '600', 'kpc', 'from', 'the', 'cluster', 'center', 'these', 'radio', 'sources', 'were', 'imaged', 'at', '323', 'and', '608', 'mhz', 'with', 'the', 'giant', 'meterwave', 'radio', 'telescope', 'and', 'at', '1520', 'mhz', 'with', 'the', 'karl', 'g', 'jansky', 'very', 'large', 'array', 'vla', 'the', 'elongated', 'relic', 'was', 'detected', 'at', 'all', 'the', 'frequencies', 'with', 'a', 'radio', 'power', 'at', '14', 'ghz', 'of', '138pm', '014', 'times', '1023', 'w', 'hz1', 'having', 'a', 'power', 'law', 'in', 'the', 'frequency', 'range', '70', '1500', 'mhz', 'spropto', 'nualpha', 'alpha', '11', 'pm', '004', 'this', 'radio', 'power', 'is', 'in', 'good', 'agreement', 'with', 'that', 'expected', 'from', 'the', 'known', 'empirical', 'relation', 'between', 'the', 'radio', 'powers', 'of', 'relics', 'and', 'the', 'host', 'cluster', 'masses', 'this', 'is', 'the', 'lowest', 'mass', 'm_500', '124times1014', 'm_o', 'cluster', 'in', 'which', 'relics', 'due', 'to', 'merger', 'shocks', 'are', 'detected', 'the', 'ringshaped', 'relic', 'has', 'a', 'steeper', 'spectral', 'index', 'alpha', 'of', '174pm029', 'in', 'the', 'frequency', 'range', '100', '600', 'mhz', 'we', 'propose', 'this', 'relic', 'to', 'be', 'an', 'old', 'plasma', 'revived', 'due', 'to', 'adiabatic', 'compression', 'by', 'the', 'outgoing', 'shock', 'which', 'produced', 'the', 'elongated', 'relic']]
|
[-0.12221650601372214, 0.17652623865406758, -0.017676811293898687, 0.025106652003999513, -0.1033325064663402, -0.06459116601943216, 0.03901061177751434, 0.43038590114774855, -0.17741176713661475, -0.39338019486471465, 0.07524062895738268, -0.31284824500156394, 0.04704712707406053, 0.18490798101922581, 0.07047271694486532, -0.0778828980033531, 0.03597331262968465, -0.05901228623541999, -0.01911971713453984, -0.16573052208584088, 0.19011930307573244, 0.14197242257316306, 0.20646573989067665, 0.004457959628132312, 0.07666312468352234, -0.14055857180334017, -0.02840131875184112, -0.07411991643035022, -0.10969979582416994, 0.03365901709715213, 0.23721865422058444, 0.058563657589482995, 0.227633680673203, -0.3038372224333945, -0.11361609676641672, 0.0707685141942015, 0.189162411203319, -0.029833377165972494, -0.01533877729675789, -0.3167635542670499, 0.15950944773694462, -0.24271717354625102, -0.2496212536406888, 0.2295152118075111, 0.07633545179191509, 0.007084490904803218, -0.17720650413510983, 0.23179608390021783, -0.0849832937053993, 0.047502667036073414, -0.059318327887911304, -0.1528839652694249, -0.003448879909475413, -0.0020380998105715645, -0.012927448145125198, 0.13590212455321, 0.21865320969127902, -0.07852666134010955, -0.033467239998601496, 0.39328438921516706, -0.045518446728061164, 0.09907536442402887, 0.2038476651379846, -0.26019011807641174, -0.19730797274931813, 0.19994535523387585, 0.124979935155433, 0.042289510470781305, -0.10245385895641558, 0.044863584257901726, -0.035532931200518966, 0.271818784847931, 0.14954981636746148, 0.04220609587355284, 0.34695575893422975, 0.08263608962127765, 0.07117470991251017, 0.13465278792555108, -0.3008583880025848, 0.04320661776212727, -0.2229157688533548, -0.019225307057096967, -0.14196043456660978, 0.10077262837072148, -0.1937823264539946, -0.08907389299739492, 0.37841749036692174, 0.05974433622002481, 0.22405144861458162, 0.08170468128014824, 0.3005238532235748, 0.08442944436435879, 0.12060799483522804, 0.18430888494816025, 0.3195750458158462, 0.253976757533524, 0.09952317643533592, -0.1829852908068508, -0.04024042000217356, -0.07477337620334194]
|
1,803.0613
|
Analysis of an asymptotic preserving scheme for stochastic linear
kinetic equations in the diffusion limit
|
We present an asymptotic preserving scheme based on a micro-macro
decomposition for stochastic linear transport equations in kinetic and
diffusive regimes. We perfom a mathematical analysis and prove that the scheme
is uniformly stable with respect to the mean free path of the particles in the
simple telegraph model and in the general case. We present several numerical
tests which validate our scheme.
|
math.NA math.AP math.PR
|
we present an asymptotic preserving scheme based on a micromacro decomposition for stochastic linear transport equations in kinetic and diffusive regimes we perfom a mathematical analysis and prove that the scheme is uniformly stable with respect to the mean free path of the particles in the simple telegraph model and in the general case we present several numerical tests which validate our scheme
|
[['we', 'present', 'an', 'asymptotic', 'preserving', 'scheme', 'based', 'on', 'a', 'micromacro', 'decomposition', 'for', 'stochastic', 'linear', 'transport', 'equations', 'in', 'kinetic', 'and', 'diffusive', 'regimes', 'we', 'perfom', 'a', 'mathematical', 'analysis', 'and', 'prove', 'that', 'the', 'scheme', 'is', 'uniformly', 'stable', 'with', 'respect', 'to', 'the', 'mean', 'free', 'path', 'of', 'the', 'particles', 'in', 'the', 'simple', 'telegraph', 'model', 'and', 'in', 'the', 'general', 'case', 'we', 'present', 'several', 'numerical', 'tests', 'which', 'validate', 'our', 'scheme']]
|
[-0.10665826719727307, 0.07007413274180772, -0.14262383474436188, 0.02502678205547411, -0.028453106770203226, -0.13390260310991417, 0.038760198882618356, 0.35515677528308026, -0.2716767120781162, -0.21158087699736897, 0.0905725212032271, -0.23849719052483875, -0.1615464642407402, 0.2164995219107599, -0.0496190662776667, 0.08143856843549108, 0.06192867888788146, -0.00186876609684929, -0.0448294767688605, -0.19969964781332583, 0.2822983656928594, 0.04260597459321457, 0.2999628067075733, 0.017797793629431416, 0.18411160201307328, -0.018539165309260763, -0.05054156935407913, 0.04328238126260066, -0.18386571943477656, 0.09836810325006289, 0.16070738489488287, 0.05072570397400312, 0.27298535885555403, -0.43818024016680224, -0.22276867355500896, 0.07335796748243627, 0.12454757800959568, 0.1454330150182137, -0.07527851364907942, -0.24530437410927364, 0.09810251095110462, -0.17224049970271096, -0.13652784717343155, -0.09712802156037281, -0.041446245138696026, 0.05463598278306779, -0.3275012660416819, 0.09619820559219945, 0.06194170752155875, 0.03478898928456363, -0.0639518987505682, -0.06642442081855345, 0.0370706543806822, 0.06118252810593399, 0.028993543686478267, -0.0629164138439274, 0.05460930876581678, -0.06195128853950235, -0.13120930096400635, 0.3857729123787038, -0.11267091227152075, -0.2903913120990471, 0.20340624826383732, -0.11124532924048484, -0.12678362037025628, 0.11209422219840307, 0.1715044668535628, 0.20018059772158425, -0.16509705478887235, 0.08201594172980607, -0.06416225523525287, 0.13588347099721432, -0.02001507974244536, -0.006322889162841002, 0.07984459685082713, 0.19570079018613176, 0.10379905290606004, 0.14148959918834625, -0.07385611414007606, -0.17047315040632846, -0.3734351037040589, -0.16814835767246902, -0.1345829132146069, 0.012885369798390283, -0.13575064330218575, -0.1743609088044318, 0.3951823509558467, 0.17449868616781064, 0.13579313921195174, 0.11295701087533777, 0.3168612276869161, 0.1733324147764564, -0.0706573577065553, 0.13141058570897532, 0.20772365009456517, 0.16443269341326658, 0.08835974275799734, -0.2535488058605956, 0.00846093413346107, 0.1250594754570297]
|
1,803.06131
|
Towards Image Understanding from Deep Compression without Decoding
|
Motivated by recent work on deep neural network (DNN)-based image compression
methods showing potential improvements in image quality, savings in storage,
and bandwidth reduction, we propose to perform image understanding tasks such
as classification and segmentation directly on the compressed representations
produced by these compression methods. Since the encoders and decoders in
DNN-based compression methods are neural networks with feature-maps as internal
representations of the images, we directly integrate these with architectures
for image understanding. This bypasses decoding of the compressed
representation into RGB space and reduces computational cost. Our study shows
that accuracies comparable to networks that operate on compressed RGB images
can be achieved while reducing the computational complexity up to $2\times$.
Furthermore, we show that synergies are obtained by jointly training
compression networks with classification networks on the compressed
representations, improving image quality, classification accuracy, and
segmentation performance. We find that inference from compressed
representations is particularly advantageous compared to inference from
compressed RGB images for aggressive compression rates.
|
cs.CV
|
motivated by recent work on deep neural network dnnbased image compression methods showing potential improvements in image quality savings in storage and bandwidth reduction we propose to perform image understanding tasks such as classification and segmentation directly on the compressed representations produced by these compression methods since the encoders and decoders in dnnbased compression methods are neural networks with featuremaps as internal representations of the images we directly integrate these with architectures for image understanding this bypasses decoding of the compressed representation into rgb space and reduces computational cost our study shows that accuracies comparable to networks that operate on compressed rgb images can be achieved while reducing the computational complexity up to 2times furthermore we show that synergies are obtained by jointly training compression networks with classification networks on the compressed representations improving image quality classification accuracy and segmentation performance we find that inference from compressed representations is particularly advantageous compared to inference from compressed rgb images for aggressive compression rates
|
[['motivated', 'by', 'recent', 'work', 'on', 'deep', 'neural', 'network', 'dnnbased', 'image', 'compression', 'methods', 'showing', 'potential', 'improvements', 'in', 'image', 'quality', 'savings', 'in', 'storage', 'and', 'bandwidth', 'reduction', 'we', 'propose', 'to', 'perform', 'image', 'understanding', 'tasks', 'such', 'as', 'classification', 'and', 'segmentation', 'directly', 'on', 'the', 'compressed', 'representations', 'produced', 'by', 'these', 'compression', 'methods', 'since', 'the', 'encoders', 'and', 'decoders', 'in', 'dnnbased', 'compression', 'methods', 'are', 'neural', 'networks', 'with', 'featuremaps', 'as', 'internal', 'representations', 'of', 'the', 'images', 'we', 'directly', 'integrate', 'these', 'with', 'architectures', 'for', 'image', 'understanding', 'this', 'bypasses', 'decoding', 'of', 'the', 'compressed', 'representation', 'into', 'rgb', 'space', 'and', 'reduces', 'computational', 'cost', 'our', 'study', 'shows', 'that', 'accuracies', 'comparable', 'to', 'networks', 'that', 'operate', 'on', 'compressed', 'rgb', 'images', 'can', 'be', 'achieved', 'while', 'reducing', 'the', 'computational', 'complexity', 'up', 'to', '2times', 'furthermore', 'we', 'show', 'that', 'synergies', 'are', 'obtained', 'by', 'jointly', 'training', 'compression', 'networks', 'with', 'classification', 'networks', 'on', 'the', 'compressed', 'representations', 'improving', 'image', 'quality', 'classification', 'accuracy', 'and', 'segmentation', 'performance', 'we', 'find', 'that', 'inference', 'from', 'compressed', 'representations', 'is', 'particularly', 'advantageous', 'compared', 'to', 'inference', 'from', 'compressed', 'rgb', 'images', 'for', 'aggressive', 'compression', 'rates']]
|
[-0.02134446483709056, -0.022408892127489786, -0.0382572014127674, 0.042303585510608956, -0.06351528187960755, -0.14962527361974395, 0.03625355055555701, 0.5176776423245485, -0.3005376101592211, -0.3371543656160802, 0.11319820938220845, -0.22597131169585075, -0.18187928642290013, 0.21921844242922503, -0.18280362825622254, 0.10181674200259609, 0.20709123545222813, 0.0354364856813149, -0.13938073301005155, -0.3378480653864918, 0.2331908554805983, 0.08077055705480571, 0.412668557745623, -0.0321056949129949, 0.10026663596767725, -0.05367810386707316, -0.03600265825006329, -0.03680727375404662, -0.01530234560023355, 0.22849480727871443, 0.3429624867096635, 0.2162480720054404, 0.2452335750804869, -0.44843086364598556, -0.3038691382633844, 0.06543547045267015, 0.203311733522073, 0.10302283945867079, -0.06683768481044904, -0.3398597456966124, 0.12715568772609126, -0.14068807551729273, 0.12646613831712325, -0.18253785893349783, -0.05847389862174168, -0.02236135458943066, -0.28398114978623246, 0.06709479521327641, 0.06919621246440026, 0.0432869832686804, -0.08081133264967781, -0.14631710269482645, 0.04871940618110706, 0.15376447256436043, 0.013314683460285541, 0.09257122474423621, 0.14665977313631662, -0.27236292447555627, -0.12302326825217424, 0.3681187864082555, -0.042330869007855654, -0.20007613028779073, 0.2187383615779748, -0.00980772960494146, -0.15142927037689974, 0.13706108063091466, 0.2656213169497794, 0.05562809364364287, -0.09414951958015193, -0.0017448198010736823, 0.017361752881473045, 0.20261157039024028, 0.1407674278339578, 0.026518083861626594, 0.13273650123938965, 0.27591580029485036, 0.022106486093109175, 0.16905605986090608, -0.15853816805045223, -0.006032221816030308, -0.14655833998924972, -0.09107640252109434, -0.19892856290558192, -0.03023024504346037, -0.12544063980255296, -0.07554436305733282, 0.36654275896338123, 0.22701341160113153, 0.24803093459204206, 0.1446989138012775, 0.4134623023830814, 0.02935888143443146, 0.1550191921012384, 0.10592772539153143, 0.17864015848479337, 0.05111409679348408, 0.09771064473574774, -0.15676868213110684, 0.04400027193126188, 0.08690380998800888]
|
1,803.06132
|
Selection for synchronized cell division in simple multicellular
organisms
|
The evolution of multicellularity was a major transition in the history of
life on earth. Conditions under which multicellularity is favored have been
studied theoretically and experimentally. But since the construction of a
multicellular organism requires multiple rounds of cell division, a natural
question is whether these cell divisions should be synchronous or not. We study
a simple population model in which there compete simple multicellular organisms
that grow either by synchronous or asynchronous cell divisions. We demonstrate
that natural selection can act differently on synchronous and asynchronous cell
division, and we offer intuition for why these phenotypes are generally not
neutral variants of each other.
|
q-bio.PE
|
the evolution of multicellularity was a major transition in the history of life on earth conditions under which multicellularity is favored have been studied theoretically and experimentally but since the construction of a multicellular organism requires multiple rounds of cell division a natural question is whether these cell divisions should be synchronous or not we study a simple population model in which there compete simple multicellular organisms that grow either by synchronous or asynchronous cell divisions we demonstrate that natural selection can act differently on synchronous and asynchronous cell division and we offer intuition for why these phenotypes are generally not neutral variants of each other
|
[['the', 'evolution', 'of', 'multicellularity', 'was', 'a', 'major', 'transition', 'in', 'the', 'history', 'of', 'life', 'on', 'earth', 'conditions', 'under', 'which', 'multicellularity', 'is', 'favored', 'have', 'been', 'studied', 'theoretically', 'and', 'experimentally', 'but', 'since', 'the', 'construction', 'of', 'a', 'multicellular', 'organism', 'requires', 'multiple', 'rounds', 'of', 'cell', 'division', 'a', 'natural', 'question', 'is', 'whether', 'these', 'cell', 'divisions', 'should', 'be', 'synchronous', 'or', 'not', 'we', 'study', 'a', 'simple', 'population', 'model', 'in', 'which', 'there', 'compete', 'simple', 'multicellular', 'organisms', 'that', 'grow', 'either', 'by', 'synchronous', 'or', 'asynchronous', 'cell', 'divisions', 'we', 'demonstrate', 'that', 'natural', 'selection', 'can', 'act', 'differently', 'on', 'synchronous', 'and', 'asynchronous', 'cell', 'division', 'and', 'we', 'offer', 'intuition', 'for', 'why', 'these', 'phenotypes', 'are', 'generally', 'not', 'neutral', 'variants', 'of', 'each', 'other']]
|
[-0.13563515976255866, 0.2021088493012665, -0.0458939689439985, 0.07549890854070841, -0.07443089601100546, -0.18455102996689812, 0.09529133069873699, 0.4108346575027648, -0.26595361485971875, -0.24326830620895018, 0.11337135858912864, -0.14787567673989063, -0.2541463649787782, 0.14800937574594017, -0.1113143678016539, -0.06310904940660551, 0.05810949804463406, 0.039501746360845164, 0.07194464635718965, -0.2919696378148214, 0.23642939601515262, 0.03918439776961744, 0.29366729190608243, -0.037478638613565804, 0.08765909634310892, -0.05822482089652627, 0.014603075096910854, 0.007755486009080174, -0.09477732476038651, 0.0654241654808844, 0.2698461182837216, 0.23871853063541973, 0.30850106902982827, -0.5257350423566576, -0.22263222677772646, 0.15591744306268837, 0.21089189370022207, 0.13733112945370726, -0.058196286055839284, -0.16344301899859928, 0.09393618475944507, -0.15553200870059333, -0.07873876464447745, -0.04957679641556065, 0.017980911650361038, 0.015362177129817318, -0.26424130160396675, 0.07423217882367097, 0.06976911990534303, 0.10776562965365197, -0.08341353904359254, -0.1106455078445164, -0.02595589929348174, 0.1756356415022516, 0.01230355868234633, -0.04114351024025313, 0.1866926962470214, -0.043697146764727975, -0.1744958592868709, 0.4103929608937283, 0.0033122003429903175, -0.21129927913359595, 0.2975664254682103, -0.1737795208145882, -0.14284589386299112, 0.06774354070635899, 0.166054916361628, 0.07965098354385568, -0.1721424550951441, 0.0326010587802025, -0.07049067250786806, 0.15050487000635773, 0.12418472577536584, 0.011325990056337894, 0.24916951166782178, 0.21667881696572844, 0.05306611917605448, 0.0412658905200792, -0.003534405764614074, -0.18920900180654707, -0.17258277645319225, -0.14321849165942283, -0.13191431533228956, 0.046882788499406504, -0.03108828735303349, -0.1695109507539046, 0.38192131342190616, 0.06264351279791093, 0.17200611516798162, 0.05271553707019127, 0.28638724139715843, 0.030531089796842832, 0.12334919571964387, 0.01057761791601496, 0.18146219999828148, 0.03500117856859809, 0.09384145108842344, -0.22971529796508686, 0.166565519072256, -0.006138363273216868]
|
1,803.06133
|
Physical implementations of quantum absorption refrigerators
|
Absorption refrigerators are autonomous thermal machines that harness the
spontaneous flow of heat from a hot bath into the environment in order to
perform cooling. Here we discuss quantum realizations of absorption
refrigerators in two different settings: namely, cavity and circuit quantum
electrodynamics. We first provide a unified description of these machines in
terms of the concept of virtual temperature. Next, we describe the two
different physical setups in detail and compare their properties and
performance. We conclude with an outlook on future work and open questions in
this field of research.
|
quant-ph cond-mat.mes-hall physics.atom-ph
|
absorption refrigerators are autonomous thermal machines that harness the spontaneous flow of heat from a hot bath into the environment in order to perform cooling here we discuss quantum realizations of absorption refrigerators in two different settings namely cavity and circuit quantum electrodynamics we first provide a unified description of these machines in terms of the concept of virtual temperature next we describe the two different physical setups in detail and compare their properties and performance we conclude with an outlook on future work and open questions in this field of research
|
[['absorption', 'refrigerators', 'are', 'autonomous', 'thermal', 'machines', 'that', 'harness', 'the', 'spontaneous', 'flow', 'of', 'heat', 'from', 'a', 'hot', 'bath', 'into', 'the', 'environment', 'in', 'order', 'to', 'perform', 'cooling', 'here', 'we', 'discuss', 'quantum', 'realizations', 'of', 'absorption', 'refrigerators', 'in', 'two', 'different', 'settings', 'namely', 'cavity', 'and', 'circuit', 'quantum', 'electrodynamics', 'we', 'first', 'provide', 'a', 'unified', 'description', 'of', 'these', 'machines', 'in', 'terms', 'of', 'the', 'concept', 'of', 'virtual', 'temperature', 'next', 'we', 'describe', 'the', 'two', 'different', 'physical', 'setups', 'in', 'detail', 'and', 'compare', 'their', 'properties', 'and', 'performance', 'we', 'conclude', 'with', 'an', 'outlook', 'on', 'future', 'work', 'and', 'open', 'questions', 'in', 'this', 'field', 'of', 'research']]
|
[-0.11313163433932578, 0.15466701713755712, -0.044121740363113095, 0.020531514039485835, -0.04131471460847103, -0.1296244277416364, 0.04083228155428989, 0.4156487505154117, -0.2394123743288219, -0.2873222760744798, 0.07382255408826852, -0.28338071751489263, -0.11279012459208784, 0.2691671476274243, -0.038727222688739064, 0.05218312801646433, 0.01249060709454605, 0.015258628872802745, -0.035467500942657985, -0.22487831213916448, 0.3279462514607155, 0.028160847052830555, 0.28371624436492665, 0.08719116743431306, 0.07115809911983492, -0.05703730830598785, -0.009851434242749669, 0.01589813320796289, -0.1436378223361712, 0.11887368800766442, 0.2505392997940678, 0.10854103718378136, 0.2572577587713528, -0.489311876706779, -0.2233240672832598, 0.06830561579124111, 0.10524538403842598, 0.1262810000436097, -0.047833621903049316, -0.23083738761994502, -0.010456037877820958, -0.18388582340887058, -0.12078028713838886, -0.10806130562306625, -0.0311472412874497, 0.006832432543413471, -0.18183881897256587, 0.004287362533985921, 0.07422725631571982, 0.08553832614510927, -0.06880264014066399, -0.0676627007373811, 0.09206067129422951, 0.1301580080155121, -0.040363748704650156, -0.0679697236451118, 0.19868288835024703, -0.17756421237161546, -0.193080650328699, 0.393694625802986, -0.07989883582416477, -0.1318971396261907, 0.22200331621317435, -0.10476087774251304, -0.13323697616199395, 0.05374108280090656, 0.2311636214853143, 0.07551643388021899, -0.1969189126064758, 0.047652031120378524, -0.0039909552281681936, 0.10009096612338908, 0.020831816407102768, 0.11105117960782397, 0.23690845938045127, 0.21539477281191427, -0.014692162350832445, 0.21376574489073866, -0.04579347990827797, -0.11533715133555233, -0.31884773694606416, -0.21858783527884795, -0.12566117272438967, 0.07433543684284973, -0.03779712804712092, -0.1223596557215585, 0.3989420553881918, 0.24146495003293714, 0.1819468882876327, -0.008306478970157712, 0.34862097963164357, 0.09087124003259384, -0.0009812747113123212, 0.0866634031990543, 0.25075045539795054, 0.13988103348073427, 0.12793981711602892, -0.2735382088171521, -0.037590078371779426, -0.009702306924737059]
|
1,803.06134
|
Resampling Strategies to Improve Surrogate Model-based Uncertainty
Quantification - Application to LES of LS89
|
Uncertainty Quantification (UQ) is receiving more and more attention for
engineering applications in particular from robust optimization. Indeed,
running a computer experiment only provides a limited knowledge in terms of
uncertainty and variability of the input parameters. These experiments are
often computationally expensive and surrogate models can be constructed to
address this issue. The outcome of a UQ study is in this case directly
correlated to the surrogate's quality. Thus, attention must be devoted to the
Design of Experiments (DoE) to retrieve as much information as possible. This
work presents two new strategies for parameter space resampling to improve a
Gaussian Process (GP) surrogate model. These techniques indeed show an
improvement of the predictive quality of the model with high dimensional
analytical input functions. Finally, the methods are successfully applied to a
turbine blade Large Eddy Simulation application: the aerothermal flow around
the LS89 blade cascade.
|
physics.flu-dyn physics.comp-ph
|
uncertainty quantification uq is receiving more and more attention for engineering applications in particular from robust optimization indeed running a computer experiment only provides a limited knowledge in terms of uncertainty and variability of the input parameters these experiments are often computationally expensive and surrogate models can be constructed to address this issue the outcome of a uq study is in this case directly correlated to the surrogates quality thus attention must be devoted to the design of experiments doe to retrieve as much information as possible this work presents two new strategies for parameter space resampling to improve a gaussian process gp surrogate model these techniques indeed show an improvement of the predictive quality of the model with high dimensional analytical input functions finally the methods are successfully applied to a turbine blade large eddy simulation application the aerothermal flow around the ls89 blade cascade
|
[['uncertainty', 'quantification', 'uq', 'is', 'receiving', 'more', 'and', 'more', 'attention', 'for', 'engineering', 'applications', 'in', 'particular', 'from', 'robust', 'optimization', 'indeed', 'running', 'a', 'computer', 'experiment', 'only', 'provides', 'a', 'limited', 'knowledge', 'in', 'terms', 'of', 'uncertainty', 'and', 'variability', 'of', 'the', 'input', 'parameters', 'these', 'experiments', 'are', 'often', 'computationally', 'expensive', 'and', 'surrogate', 'models', 'can', 'be', 'constructed', 'to', 'address', 'this', 'issue', 'the', 'outcome', 'of', 'a', 'uq', 'study', 'is', 'in', 'this', 'case', 'directly', 'correlated', 'to', 'the', 'surrogates', 'quality', 'thus', 'attention', 'must', 'be', 'devoted', 'to', 'the', 'design', 'of', 'experiments', 'doe', 'to', 'retrieve', 'as', 'much', 'information', 'as', 'possible', 'this', 'work', 'presents', 'two', 'new', 'strategies', 'for', 'parameter', 'space', 'resampling', 'to', 'improve', 'a', 'gaussian', 'process', 'gp', 'surrogate', 'model', 'these', 'techniques', 'indeed', 'show', 'an', 'improvement', 'of', 'the', 'predictive', 'quality', 'of', 'the', 'model', 'with', 'high', 'dimensional', 'analytical', 'input', 'functions', 'finally', 'the', 'methods', 'are', 'successfully', 'applied', 'to', 'a', 'turbine', 'blade', 'large', 'eddy', 'simulation', 'application', 'the', 'aerothermal', 'flow', 'around', 'the', 'ls89', 'blade', 'cascade']]
|
[-0.0291123128640626, 0.05145196608069016, -0.06741410191251157, 0.08290674966597651, -0.1187460984456642, -0.1427089262528923, 0.030071364733358395, 0.3983096699262487, -0.28476160448365684, -0.342284785082628, 0.13425700821369838, -0.2301420807388836, -0.1509703762170955, 0.2552115352792216, -0.11251579863822152, 0.14597300164208843, 0.1116714692321317, -0.007403815354638059, -0.06349183286194979, -0.23718985978449728, 0.2484301414437078, 0.09319538273045729, 0.3069422804589929, 0.01190375340941908, 0.07976175043731928, -0.0326591679441004, -0.037478817199710114, 0.009149187700301088, -0.1134472398183726, 0.1722330198398438, 0.3129275689362438, 0.14496509802752527, 0.3430209279060364, -0.41402516126118855, -0.261177198352806, 0.1046555980140793, 0.12935284451934798, 0.11110246340776311, -0.024721951069157762, -0.2476026935229913, 0.06432648681923105, -0.20509327285088086, -0.07122747711837292, -0.12569394822007623, -0.007927579329959277, -0.01030118428732686, -0.3375583202995617, 0.03414616113014776, 0.030736643692542767, 0.048995506273711034, 0.0031182895205786516, -0.10636435648715445, 0.015663187337461217, 0.13425107497143848, 0.06487990220314181, 0.04219573467311546, 0.13650815368084043, -0.14432627425578237, -0.11569335007044519, 0.39621683784985334, -0.00731547064477064, -0.2717551866217099, 0.16748585033326827, -0.08483091424187196, -0.13780203699294863, 0.1285943884948461, 0.24997434314492897, 0.09916863141517188, -0.1672894542418613, 0.027588845008647004, 0.003006603573609529, 0.1958346821721001, 0.020107581024861026, -0.026737793066121382, 0.152739409495402, 0.23676286285646775, 0.061678317129804656, 0.14908261471106832, -0.07604508462426221, -0.08633503802321402, -0.2612517121344291, -0.12231682128481695, -0.18436093048096217, 0.0017576393237787075, -0.07373268255323637, -0.14303790824327234, 0.37453445077648967, 0.2117595989365484, 0.17515386609232117, 0.03392385559092308, 0.35685088138641985, 0.10044846967954574, 0.05756355107858263, 0.031961998314564595, 0.2216086097487152, 0.06544113736599684, 0.08898526672273874, -0.18963280331849217, 0.09691918882669817, 0.00839078777373351]
|
1,803.06135
|
Signless Laplacian determinations of some graphs with independent edges
|
{Signless Laplacian determinations of some graphs with independent edges}%
{Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of
$G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix
and the adjacency matrix of $G$, respectively. The graph $G$ is said to be
determined by its signless Laplacian spectrum ({\rm DQS}, for short), if any
graph having the same signless Laplacian spectrum as $G$ is isomorphic to $G$.
We show that $G\sqcup rK_2$ is determined by its signless Laplacian spectra
under certain conditions, where $r$ and $K_2$ denote a natural number and the
complete graph on two vertices, respectively. Applying these results, some {\rm
DQS} graphs with independent edges are obtained.
|
math.CO
|
signless laplacian determinations of some graphs with independent edges let g be a simple undirected graph then the signless laplacian matrix of g is defined as d_g a_g in which d_g and a_g denote the degree matrix and the adjacency matrix of g respectively the graph g is said to be determined by its signless laplacian spectrum rm dqs for short if any graph having the same signless laplacian spectrum as g is isomorphic to g we show that gsqcup rk_2 is determined by its signless laplacian spectra under certain conditions where r and k_2 denote a natural number and the complete graph on two vertices respectively applying these results some rm dqs graphs with independent edges are obtained
|
[['signless', 'laplacian', 'determinations', 'of', 'some', 'graphs', 'with', 'independent', 'edges', 'let', 'g', 'be', 'a', 'simple', 'undirected', 'graph', 'then', 'the', 'signless', 'laplacian', 'matrix', 'of', 'g', 'is', 'defined', 'as', 'd_g', 'a_g', 'in', 'which', 'd_g', 'and', 'a_g', 'denote', 'the', 'degree', 'matrix', 'and', 'the', 'adjacency', 'matrix', 'of', 'g', 'respectively', 'the', 'graph', 'g', 'is', 'said', 'to', 'be', 'determined', 'by', 'its', 'signless', 'laplacian', 'spectrum', 'rm', 'dqs', 'for', 'short', 'if', 'any', 'graph', 'having', 'the', 'same', 'signless', 'laplacian', 'spectrum', 'as', 'g', 'is', 'isomorphic', 'to', 'g', 'we', 'show', 'that', 'gsqcup', 'rk_2', 'is', 'determined', 'by', 'its', 'signless', 'laplacian', 'spectra', 'under', 'certain', 'conditions', 'where', 'r', 'and', 'k_2', 'denote', 'a', 'natural', 'number', 'and', 'the', 'complete', 'graph', 'on', 'two', 'vertices', 'respectively', 'applying', 'these', 'results', 'some', 'rm', 'dqs', 'graphs', 'with', 'independent', 'edges', 'are', 'obtained']]
|
[-0.1715773945260379, 0.14643521114196786, -0.0355903861614374, -0.015712365712552596, -0.17032541539400625, -0.13108678642087257, -0.0712074265600397, 0.4226860301807905, -0.3049394557586847, -0.31786196192519534, 0.10220452195777693, -0.3581829833933431, -0.15090515858565384, 0.07362698591672458, -0.10894953542683497, -0.029066849154674917, 0.16836166776255027, 0.1860000839114635, 0.002270720296133405, -0.17065050749557936, 0.3092012458886856, -0.05802274746899931, 0.10991974337758799, 0.11260170715365511, 0.00580944078695825, -0.009366360198483508, -0.005677758980717542, 0.06472944990636255, -0.2394674337595531, 0.09652317823786448, 0.252659154132518, 0.11511188819141298, 0.18723231066977525, -0.3572909508425838, -0.17082418539585212, 0.29199535636088025, 0.11730559177609144, -0.15398905035128227, 0.08966818736750697, -0.26711339396862394, 0.21427395541825864, -0.09457029430427027, -0.07262025803773321, 0.03139015774513221, 0.1405947612057257, -0.01790529791202046, -0.3235737226075596, 0.023068005839983623, 0.05320528616062087, 0.059624166673638374, 0.08600351272318034, -0.2674094763679955, -0.14137831010704494, 0.07193682277097534, -0.10610900074243546, 0.009441040257294463, 0.04863809389818428, -0.01542258606905229, -0.11984885870439248, 0.4067929566829887, -0.10418683554754297, -0.15540027889596203, -0.005787142715615849, -0.1631001853583078, -0.12794393139819688, 0.03347745423730558, 0.07620324321791656, 0.17980885030462956, -0.04710389249440697, 0.16596637492497954, -0.11595490790155326, 0.06229358944946375, 0.107596616487568, 0.052112624570568145, 0.1020671319630411, 0.06298757683979268, 0.14613726768945146, 0.11780938758260101, 0.04809867019335238, 0.13852520673893964, -0.28535619333513784, -0.03751951430995877, -0.36674007224157834, 0.15902549340230468, -0.2916050420344696, -0.17439244673229182, 0.47460087239105475, 0.03669658887526418, 0.23264414549638063, 0.11745667531708272, 0.19992796572036722, 0.10772116017193557, 0.03617307648826868, 0.21930481376460728, 0.07292721921460639, 0.39091424162014043, -0.08205227660508747, -0.1851079573130442, 0.00014183447003746644, 0.18807381584953803]
|
1,803.06136
|
Digital Limits of Government: The Failure of E-Democracy
|
While the Internet is often touted as a revolutionary technology, it might be
noted that democratic institutions have witnessed no digital revolution through
the Internet. This observation leads this chapter to argue that the field of
e-democracy has generally failed to live up to its own reformist rhetoric. It
argues that instead of reforming government processes through technology,
e-democracy projects have tended to focus either on lowering the costs and
increasing the efficiency of existing political processes or on analysing the
civic participation that occurs outside of purpose-built e-democracy platforms.
The chapter suggests that this lack of attention to the Internet's potential
for systemic change in formal political institutions has little normative
impact on the democratization of society and may even re-enforce, rather than
challenge, the sociopolitical status quo. Further, it suggests that the current
approach of e-democracy risks normalizing the Internet to the norms and
expectations of the offline world. To elucidate this argument, this chapter
overviews both the general trend of e-democracy projects and criticisms of
those projects. Finally, the chapter proposes a more radical vision of
e-democracy that, it suggests, would usher a larger potential for
democratization. This more radical vision of e-democracy consists of
recognizing the attributes of the Internet that transcend the limits of the
analogue world and applying these to democracy. Such an approach would open the
path for envisaging new political processes and systems, allowing the field of
e-democracy to live up to its own rhetoric, and affording society the means to
address multiple of the centuries-old problems faced by democracy.
|
cs.CY
|
while the internet is often touted as a revolutionary technology it might be noted that democratic institutions have witnessed no digital revolution through the internet this observation leads this chapter to argue that the field of edemocracy has generally failed to live up to its own reformist rhetoric it argues that instead of reforming government processes through technology edemocracy projects have tended to focus either on lowering the costs and increasing the efficiency of existing political processes or on analysing the civic participation that occurs outside of purposebuilt edemocracy platforms the chapter suggests that this lack of attention to the internets potential for systemic change in formal political institutions has little normative impact on the democratization of society and may even reenforce rather than challenge the sociopolitical status quo further it suggests that the current approach of edemocracy risks normalizing the internet to the norms and expectations of the offline world to elucidate this argument this chapter overviews both the general trend of edemocracy projects and criticisms of those projects finally the chapter proposes a more radical vision of edemocracy that it suggests would usher a larger potential for democratization this more radical vision of edemocracy consists of recognizing the attributes of the internet that transcend the limits of the analogue world and applying these to democracy such an approach would open the path for envisaging new political processes and systems allowing the field of edemocracy to live up to its own rhetoric and affording society the means to address multiple of the centuriesold problems faced by democracy
|
[['while', 'the', 'internet', 'is', 'often', 'touted', 'as', 'a', 'revolutionary', 'technology', 'it', 'might', 'be', 'noted', 'that', 'democratic', 'institutions', 'have', 'witnessed', 'no', 'digital', 'revolution', 'through', 'the', 'internet', 'this', 'observation', 'leads', 'this', 'chapter', 'to', 'argue', 'that', 'the', 'field', 'of', 'edemocracy', 'has', 'generally', 'failed', 'to', 'live', 'up', 'to', 'its', 'own', 'reformist', 'rhetoric', 'it', 'argues', 'that', 'instead', 'of', 'reforming', 'government', 'processes', 'through', 'technology', 'edemocracy', 'projects', 'have', 'tended', 'to', 'focus', 'either', 'on', 'lowering', 'the', 'costs', 'and', 'increasing', 'the', 'efficiency', 'of', 'existing', 'political', 'processes', 'or', 'on', 'analysing', 'the', 'civic', 'participation', 'that', 'occurs', 'outside', 'of', 'purposebuilt', 'edemocracy', 'platforms', 'the', 'chapter', 'suggests', 'that', 'this', 'lack', 'of', 'attention', 'to', 'the', 'internets', 'potential', 'for', 'systemic', 'change', 'in', 'formal', 'political', 'institutions', 'has', 'little', 'normative', 'impact', 'on', 'the', 'democratization', 'of', 'society', 'and', 'may', 'even', 'reenforce', 'rather', 'than', 'challenge', 'the', 'sociopolitical', 'status', 'quo', 'further', 'it', 'suggests', 'that', 'the', 'current', 'approach', 'of', 'edemocracy', 'risks', 'normalizing', 'the', 'internet', 'to', 'the', 'norms', 'and', 'expectations', 'of', 'the', 'offline', 'world', 'to', 'elucidate', 'this', 'argument', 'this', 'chapter', 'overviews', 'both', 'the', 'general', 'trend', 'of', 'edemocracy', 'projects', 'and', 'criticisms', 'of', 'those', 'projects', 'finally', 'the', 'chapter', 'proposes', 'a', 'more', 'radical', 'vision', 'of', 'edemocracy', 'that', 'it', 'suggests', 'would', 'usher', 'a', 'larger', 'potential', 'for', 'democratization', 'this', 'more', 'radical', 'vision', 'of', 'edemocracy', 'consists', 'of', 'recognizing', 'the', 'attributes', 'of', 'the', 'internet', 'that', 'transcend', 'the', 'limits', 'of', 'the', 'analogue', 'world', 'and', 'applying', 'these', 'to', 'democracy', 'such', 'an', 'approach', 'would', 'open', 'the', 'path', 'for', 'envisaging', 'new', 'political', 'processes', 'and', 'systems', 'allowing', 'the', 'field', 'of', 'edemocracy', 'to', 'live', 'up', 'to', 'its', 'own', 'rhetoric', 'and', 'affording', 'society', 'the', 'means', 'to', 'address', 'multiple', 'of', 'the', 'centuriesold', 'problems', 'faced', 'by', 'democracy']]
|
[-0.10149189894387031, 0.07146338502391095, -0.0723013866127465, 0.045702871199287766, -0.12996610800884228, -0.10892129507176723, 0.08181376591667258, 0.345756827670617, -0.2485736307184346, -0.3106375073013892, 0.13624524478374794, -0.2904867713596918, -0.16666502054918428, 0.20428016997243237, -0.1377054210688832, -0.015832428059881328, 0.05022154897243031, 0.021998351130902708, -0.0014673983886308428, -0.2843337544092387, 0.3180601467547851, 0.08946881258265924, 0.3157455669154308, 0.09868621096152681, 0.04706676114270833, -0.017125258455052972, -0.0780927674375576, -0.016538222967230277, -0.06271743966227557, 0.1911463185199011, 0.30484673782099575, 0.23783130339638545, 0.3992083089259464, -0.4450300758150098, -0.1805151953617408, 0.11738796085619788, 0.13849238646742146, 0.06589389063874514, -0.045718491195310594, -0.3162795337159839, 0.05382526143008285, -0.24176300369232082, -0.15580121514202613, -0.04155258628891252, 0.0636606100513618, -0.021460934208501276, -0.160146315962598, 0.014367208883604796, 0.05516699762971427, 0.10083472735795704, -0.016877777889871007, -0.11463643208097174, -0.0015527630983108967, 0.15708968130570877, 0.12510749879872957, 0.027378468632929982, 0.17864797411464764, -0.1824387778176524, -0.15875064075022124, 0.4012121216136716, 0.01705431772375811, -0.09172061774408596, 0.2151395456724101, -0.1176938296817533, -0.1539025607370275, 0.044654190879141194, 0.19171460414511887, 0.024644992923081387, -0.15616669491701668, 0.05016320066210354, 0.011639815005057053, 0.15037644528907293, 0.0514607232241576, 0.0013643787675066072, 0.2500842158882917, 0.18897838205287545, 0.07528791144482995, 0.04155580109258904, 0.022664916637065505, -0.13006810112724965, -0.19624898820442369, -0.18379334020106744, -0.1255225944894471, 0.07509197534246784, -0.025810745955865688, -0.1475243586711658, 0.3644251422793514, 0.21892333868755107, 0.11197807538211672, 0.019150555714027656, 0.29398980996832397, 0.02981875021262493, 0.11966140976661258, 0.038256517578829585, 0.24215648322210354, 0.01430177396971457, 0.19496129401270954, -0.14333652997736418, 0.1248943726042945, -0.04746773803483419]
|
1,803.06137
|
Transport in partially hyperbolic fast-slow systems
|
I will discuss, from a dynamical systems point of view, some recent attempts
to rigorously derive the macroscopic laws of transport (e.g. the heat equation)
from deterministic microscopic dynamics.
|
math-ph cond-mat.stat-mech math.MP
|
i will discuss from a dynamical systems point of view some recent attempts to rigorously derive the macroscopic laws of transport eg the heat equation from deterministic microscopic dynamics
|
[['i', 'will', 'discuss', 'from', 'a', 'dynamical', 'systems', 'point', 'of', 'view', 'some', 'recent', 'attempts', 'to', 'rigorously', 'derive', 'the', 'macroscopic', 'laws', 'of', 'transport', 'eg', 'the', 'heat', 'equation', 'from', 'deterministic', 'microscopic', 'dynamics']]
|
[-0.13261129585062637, 0.09587820606498883, -0.16604315072041134, 0.048140161156911276, -0.0635223379679795, -0.1484727968405611, 0.0944937597639088, 0.23851063976000095, -0.3736940988355541, -0.2501576068843233, 0.08471648484982293, -0.3170301836016106, -0.18618049819407792, 0.18502139166029619, -0.048950825817883015, 0.1305566093531148, -0.011927832688750892, 0.006307820789515972, -0.08979281140812512, -0.1143840232799793, 0.3420236834549698, 0.021987400724199312, 0.24766329691970143, 0.022254370506210572, 0.1387995185715885, -0.03741981875922146, -0.04209562794080582, 0.021845469082673562, -0.23619433039606647, 0.06800494972487976, 0.20001894954977364, 0.09742414418222575, 0.2608334366874448, -0.5261468216776848, -0.319421855925486, 0.03458849183315861, 0.10975823419495759, 0.21582257545328346, -0.042439760929294704, -0.26112545353906425, -0.022888431983903564, -0.11624115577031827, -0.2025082742209257, -0.08280822088749244, 0.03301605076432742, 0.12531190217825874, -0.16026200238486815, 0.08964517468522334, 0.06601640714858338, 0.05169665868040817, -0.0772001050565199, -0.10105731672254102, 0.00517462675684485, 0.14754693749649772, 0.018297185623568708, -0.05712305017393725, 0.17323346294719597, -0.1495401973611322, -0.14224723150857307, 0.399192379209502, -0.014172468956656241, -0.1784234133966524, 0.2506978242047902, -0.14680425758505689, -0.14929789259772877, 0.11151108550357408, 0.1665605619019861, 0.06950671904206533, -0.30063452700088766, 0.07780674947746868, -0.029237017356630028, 0.09003951799240895, -0.043171422588157246, 0.05074496753513813, 0.26359196816538943, 0.1689764521373757, 0.019468145204129917, 0.098314960625681, -0.05693842014618989, -0.209142812463487, -0.3459251242657674, -0.11478802879694207, -0.15187564627106848, 0.23195342603942443, -0.07706735662088313, -0.08011886772924456, 0.33828593636381216, 0.268638858764336, 0.15743105479612432, 0.04740183838996394, 0.2459820893047185, 0.15933348077895312, -0.06015088878058154, 0.08435923297857416, 0.22609647943594108, 0.15723179043110075, 0.21438920955526933, -0.24197207248352212, 0.03187710365103879, 0.11134553357059586]
|
1,803.06138
|
I-convergent triple difference sequence spaces defined by a sequence of modulus function
|
The main objective of this paper is to introduce classes of $I$-convergent triple difference sequence spaces, $c_{0I}^{3}(\Delta,\digamma)$, $c_{I}^{3}(\Delta,\digamma)$, $\ell_{\infty I}^{3}(\Delta,\digamma)$, $M_{I}^{3}(\Delta,\digamma)$ and $M_{0I}^{3}(\Delta,\digamma)$, by using sequence of modulii function $\digamma=(f_{pqr})$. We also study some algebraic and topological properties of these new sequence spaces.
|
math.FA
|
the main objective of this paper is to introduce classes of iconvergent triple difference sequence spaces c_0i3deltadigamma c_i3deltadigamma ell_infty i3deltadigamma m_i3deltadigamma and m_0i3deltadigamma by using sequence of modulii function digammaf_pqr we also study some algebraic and topological properties of these new sequence spaces
|
[['the', 'main', 'objective', 'of', 'this', 'paper', 'is', 'to', 'introduce', 'classes', 'of', 'iconvergent', 'triple', 'difference', 'sequence', 'spaces', 'c_0i3deltadigamma', 'c_i3deltadigamma', 'ell_infty', 'i3deltadigamma', 'm_i3deltadigamma', 'and', 'm_0i3deltadigamma', 'by', 'using', 'sequence', 'of', 'modulii', 'function', 'digammaf_pqr', 'we', 'also', 'study', 'some', 'algebraic', 'and', 'topological', 'properties', 'of', 'these', 'new', 'sequence', 'spaces']]
|
[-0.12678668169757804, 0.08017927642307572, -0.0872376460984752, 0.11932495118093651, -0.07739921472966671, -0.013098484081392353, 0.023683585188779478, 0.40816011924195933, -0.38155243545770645, -0.2724254789283952, 0.11127927470197146, -0.22997262595674475, -0.23671929830232183, 0.17615311527373018, -0.16940275680374456, 0.05932854510831168, 0.050871634981720835, 0.003744178275401528, -0.11752578978602951, -0.2834667576716055, 0.5348226854930053, -0.10512381787034306, 0.16944810566869942, 0.0023005455228927974, 0.07784449102394786, 0.008111180775370952, -0.01605640142854001, -0.004027441748090692, -0.19787455784358285, 0.1969463009941014, 0.22004037679525446, 0.14989190785264647, 0.29780537922036004, -0.29426476470119245, -0.11735984874335495, 0.18475622138813944, 0.12859818052399802, -0.004152760620707193, -0.06030459814025341, -0.24807369668741483, 0.17807646146094477, -0.1213559681782499, -0.05394436974657347, -0.10308474372770335, -0.0021703294855920045, 0.10926520496581656, -0.2218559121310308, -0.01281986669464213, 0.12578518104714317, 0.08351538473790562, -0.06496134964195457, -0.1204356643956507, 0.0040762746278699994, 0.1501794866556805, 0.03830153612747184, 0.0992372317579449, 0.04033559899324098, -0.035294337191845514, -0.11939158914862452, 0.31506030206140634, -0.05929707489102273, -0.19858251683212616, 0.17530849514327743, -0.11893691423323911, -0.19485336637778863, 0.08562458244882323, 0.1416680073818645, 0.15541859965368704, -0.13991656889383858, 0.06651822565362563, -0.04399301204830408, 0.12457283707083883, 0.04844175203627831, 0.12238436367211712, 0.14658416266477592, 0.1524066217747089, 0.06651411739152831, 0.22008054770176877, -0.017914829423298705, -0.04416324838530272, -0.3561600839366784, -0.20472964781613365, -0.17732039660316062, 0.03779483400285244, -0.0811379421242777, -0.2156258799337052, 0.43227199344216166, 0.09389640164335032, 0.19262610660312143, 0.13671619482841846, 0.2472010488949112, 0.09380611983706823, -0.0138130949659122, -0.015995957976760896, 0.12170876486217477, 0.17688307675809875, 0.020916614203235588, -0.1622274738887476, 0.01293880185364066, 0.20282077735189247]
|
1,803.06139
|
New Framework of Getis-Ord's Indexes Associating Spatial Autocorrelation
with Interaction
|
Spatial autocorrelation and spatial interaction are two important analytical
processes for geographical analyses. However, the internal relations between
the two types of models have not been brought to light. This paper is devoted
to integrating spatial autocorrelation analysis and spatial interaction
analysis into a logic framework by means of Getis-Ord's indexes. Based on
mathematical derivation and transform, the spatial autocorrelation measurements
of Getis-Ord's indexes are reconstructed in a new and simple form. A finding is
that the local Getis-Ord's indexes of spatial autocorrelation are equivalent to
the rescaled potential energy indexes of spatial interaction theory based on
power-law distance decay. The normalized scatterplot is introduced into the
spatial analysis based on Getis-Ord's indexes, and the potential energy indexes
are proposed as a complementary measurement. The global Getis-Ord's index
proved to be the weighted sum of the potential energy indexes and the direct
sum of total potential energy. The empirical analysis of the system of Chinese
cities are taken as an example to illustrate the effect of the improved methods
and measurements. The mathematical framework newly derived from Getis-Ord's
work is helpful for further developing the methodology of geographical spatial
modeling and quantitative analysis.
|
physics.soc-ph
|
spatial autocorrelation and spatial interaction are two important analytical processes for geographical analyses however the internal relations between the two types of models have not been brought to light this paper is devoted to integrating spatial autocorrelation analysis and spatial interaction analysis into a logic framework by means of getisords indexes based on mathematical derivation and transform the spatial autocorrelation measurements of getisords indexes are reconstructed in a new and simple form a finding is that the local getisords indexes of spatial autocorrelation are equivalent to the rescaled potential energy indexes of spatial interaction theory based on powerlaw distance decay the normalized scatterplot is introduced into the spatial analysis based on getisords indexes and the potential energy indexes are proposed as a complementary measurement the global getisords index proved to be the weighted sum of the potential energy indexes and the direct sum of total potential energy the empirical analysis of the system of chinese cities are taken as an example to illustrate the effect of the improved methods and measurements the mathematical framework newly derived from getisords work is helpful for further developing the methodology of geographical spatial modeling and quantitative analysis
|
[['spatial', 'autocorrelation', 'and', 'spatial', 'interaction', 'are', 'two', 'important', 'analytical', 'processes', 'for', 'geographical', 'analyses', 'however', 'the', 'internal', 'relations', 'between', 'the', 'two', 'types', 'of', 'models', 'have', 'not', 'been', 'brought', 'to', 'light', 'this', 'paper', 'is', 'devoted', 'to', 'integrating', 'spatial', 'autocorrelation', 'analysis', 'and', 'spatial', 'interaction', 'analysis', 'into', 'a', 'logic', 'framework', 'by', 'means', 'of', 'getisords', 'indexes', 'based', 'on', 'mathematical', 'derivation', 'and', 'transform', 'the', 'spatial', 'autocorrelation', 'measurements', 'of', 'getisords', 'indexes', 'are', 'reconstructed', 'in', 'a', 'new', 'and', 'simple', 'form', 'a', 'finding', 'is', 'that', 'the', 'local', 'getisords', 'indexes', 'of', 'spatial', 'autocorrelation', 'are', 'equivalent', 'to', 'the', 'rescaled', 'potential', 'energy', 'indexes', 'of', 'spatial', 'interaction', 'theory', 'based', 'on', 'powerlaw', 'distance', 'decay', 'the', 'normalized', 'scatterplot', 'is', 'introduced', 'into', 'the', 'spatial', 'analysis', 'based', 'on', 'getisords', 'indexes', 'and', 'the', 'potential', 'energy', 'indexes', 'are', 'proposed', 'as', 'a', 'complementary', 'measurement', 'the', 'global', 'getisords', 'index', 'proved', 'to', 'be', 'the', 'weighted', 'sum', 'of', 'the', 'potential', 'energy', 'indexes', 'and', 'the', 'direct', 'sum', 'of', 'total', 'potential', 'energy', 'the', 'empirical', 'analysis', 'of', 'the', 'system', 'of', 'chinese', 'cities', 'are', 'taken', 'as', 'an', 'example', 'to', 'illustrate', 'the', 'effect', 'of', 'the', 'improved', 'methods', 'and', 'measurements', 'the', 'mathematical', 'framework', 'newly', 'derived', 'from', 'getisords', 'work', 'is', 'helpful', 'for', 'further', 'developing', 'the', 'methodology', 'of', 'geographical', 'spatial', 'modeling', 'and', 'quantitative', 'analysis']]
|
[-0.06577614651358966, 0.05603538753793254, -0.15060682272432382, 0.11037880825928359, -0.05142988697046636, -0.10037041800048375, 0.012447035508930027, 0.37856666892139634, -0.2563638011249352, -0.3318233925419729, 0.09648902654959073, -0.2866768147555117, -0.14346521990035946, 0.1958396440381522, 0.006682443041643948, 0.059073709269051825, 0.013484098673484487, 0.0005925324096445747, -0.053387726940591025, -0.17039681055192193, 0.3125957935599736, 0.07478910733081902, 0.3453757620266991, 0.08371531241935307, 0.06911894943507224, 0.02475350372640445, -0.15325741201561968, 0.05517851500506537, -0.11832756338143569, 0.17807008500495647, 0.17703718587284842, 0.13755460702657332, 0.26975697508670504, -0.401462153169698, -0.2299941934674129, 0.0916911353154465, 0.1492362615584222, 0.018654092026806866, -0.017577970807604645, -0.2986691424145407, 0.05628133836380867, -0.12645860203575593, -0.10082946186209667, -0.09171599274744892, 0.04209064608295038, 0.06157609901615356, -0.27706465416303183, 0.10360878181084025, 0.03899680732609463, 0.08103324062253682, -0.08478056876606506, -0.1296727401668862, -0.02458147562731424, 0.15780911230544892, 0.061755279094159336, -0.029832332140471728, 0.08971168128339274, -0.06473981957385616, -0.10780132321370621, 0.3387042618515887, -0.05546267575420285, -0.2135140261784138, 0.14736948841507186, -0.09431949575127638, -0.1153797978472563, 0.08128879464429277, 0.19621686248164238, 0.05913178498707133, -0.1842259027116927, 0.05184929052831055, -0.003359595091694995, 0.19639467673105973, 0.05982324625775604, 0.06528658483061611, 0.1962437134385688, 0.18175995878759443, 0.020871310064163772, 0.10603092291809792, -0.10685619136343898, -0.10535161129387163, -0.27054975377733537, -0.15010526086929993, -0.2018110332407366, -0.008193393904336372, -0.146138858610319, -0.13089533742526885, 0.44137780949439603, 0.12348076336838575, 0.14802728414685112, 0.053801156785532135, 0.31147799271501486, 0.15165937788919617, 0.06898005930176053, 0.019975869868124396, 0.20599192479466102, 0.13015890189861504, 0.11911792135097743, -0.17007555664333615, 0.04626983450243124, 0.08484113338726712]
|
1,803.0614
|
Decision Problems for Subclasses of Rational Relations over Finite and
Infinite Words
|
We consider decision problems for relations over finite and infinite words
defined by finite automata. We prove that the equivalence problem for binary
deterministic rational relations over infinite words is undecidable in contrast
to the case of finite words, where the problem is decidable. Furthermore, we
show that it is decidable in doubly exponential time for an automatic relation
over infinite words whether it is a recognizable relation. We also revisit this
problem in the context of finite words and improve the complexity of the
decision procedure to single exponential time. The procedure is based on a
polynomial time regularity test for deterministic visibly pushdown automata,
which is a result of independent interest.
|
cs.FL
|
we consider decision problems for relations over finite and infinite words defined by finite automata we prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the case of finite words where the problem is decidable furthermore we show that it is decidable in doubly exponential time for an automatic relation over infinite words whether it is a recognizable relation we also revisit this problem in the context of finite words and improve the complexity of the decision procedure to single exponential time the procedure is based on a polynomial time regularity test for deterministic visibly pushdown automata which is a result of independent interest
|
[['we', 'consider', 'decision', 'problems', 'for', 'relations', 'over', 'finite', 'and', 'infinite', 'words', 'defined', 'by', 'finite', 'automata', 'we', 'prove', 'that', 'the', 'equivalence', 'problem', 'for', 'binary', 'deterministic', 'rational', 'relations', 'over', 'infinite', 'words', 'is', 'undecidable', 'in', 'contrast', 'to', 'the', 'case', 'of', 'finite', 'words', 'where', 'the', 'problem', 'is', 'decidable', 'furthermore', 'we', 'show', 'that', 'it', 'is', 'decidable', 'in', 'doubly', 'exponential', 'time', 'for', 'an', 'automatic', 'relation', 'over', 'infinite', 'words', 'whether', 'it', 'is', 'a', 'recognizable', 'relation', 'we', 'also', 'revisit', 'this', 'problem', 'in', 'the', 'context', 'of', 'finite', 'words', 'and', 'improve', 'the', 'complexity', 'of', 'the', 'decision', 'procedure', 'to', 'single', 'exponential', 'time', 'the', 'procedure', 'is', 'based', 'on', 'a', 'polynomial', 'time', 'regularity', 'test', 'for', 'deterministic', 'visibly', 'pushdown', 'automata', 'which', 'is', 'a', 'result', 'of', 'independent', 'interest']]
|
[-0.1091315113337694, 0.16206629053327415, -0.06622738957372123, 0.15575652725405298, -0.11763720020272694, -0.14592604913163634, 0.13051591134028492, 0.3650630796575441, -0.3623160572343432, -0.2006279812441661, 0.11440158033830039, -0.2482740469112069, -0.11883623103520512, 0.21706800614493957, -0.10487307790271212, 0.09731506595833112, 0.06936916453862745, 0.11651814511185923, -0.051506824169176076, -0.3327294913577987, 0.32716098476399097, -0.041955530470385485, 0.2507131551845675, 0.01368463485485223, 0.15733287108452182, 0.04191263240506559, -0.03526510288774044, 0.06496083255511075, -0.10656902981384768, 0.0463694823314477, 0.3649500837236379, 0.18272282009313565, 0.3024242229191009, -0.35783636457064244, -0.16989474771626756, 0.19611407982482187, 0.16838603407408284, 0.10119430963423895, -5.461743299280648e-07, -0.21717283603080045, 0.12763272804636672, -0.18919263982865137, -0.05191609389313488, 0.020706171594329376, 0.09039449866498465, 0.005826605780594117, -0.24388775727876455, 0.02423859844823879, 0.18111548318931486, 0.07655948613959868, -0.07336577240674369, -0.0026456884817277963, 0.07730132613261025, 0.07688814579649308, 0.0012525786775518704, -0.0053355339873351355, 0.0024234957341928926, -0.05923450270675914, -0.1939612418429646, 0.37388889709141404, -0.07257893509272717, -0.257207105694487, 0.15759334352024032, -0.08336244170673489, -0.1893747145952904, 0.07945077164115104, 0.137419458684734, 0.14422200874845803, -0.09317989684476526, 0.18297398284714322, -0.1776885667123494, 0.23594474135403545, 0.13106881425740707, -0.0028693169165831226, 0.11637585615508456, 0.19385779632123568, 0.09458117172187935, 0.2009894101987634, 0.06037376008194303, -0.10208431826245072, -0.27152699408475806, -0.16139467697244433, -0.11411530218721755, -0.017509257725843812, -0.0974118244023973, -0.24699571771563683, 0.3397533085559849, 0.15523748900906176, 0.1306490220162457, 0.2345942256949529, 0.26506350030380804, 0.17252200047188826, 0.024199762476393872, 0.05315328835119778, 0.09125378323652972, 0.12849505969521022, 0.027825386474626058, -0.22468912488970477, 0.12743349066745918, 0.17958840903356277]
|
1,803.06141
|
Patchwise object tracking via structural local sparse appearance model
|
In this paper, we propose a robust visual tracking method which exploits the
relationships of targets in adjacent frames using patchwise joint sparse
representation. Two sets of overlapping patches with different sizes are
extracted from target candidates to construct two dictionaries with
consideration of joint sparse representation. By applying this representation
into structural sparse appearance model, we can take two-fold advantages.
First, the correlation of target patches over time is considered. Second, using
this local appearance model with different patch sizes takes into account local
features of target thoroughly. Furthermore, the position of candidate patches
and their occlusion levels are utilized simultaneously to obtain the final
likelihood of target candidates. Evaluations on recent challenging benchmark
show that our tracking method outperforms the state-of-the-art trackers.
|
cs.CV
|
in this paper we propose a robust visual tracking method which exploits the relationships of targets in adjacent frames using patchwise joint sparse representation two sets of overlapping patches with different sizes are extracted from target candidates to construct two dictionaries with consideration of joint sparse representation by applying this representation into structural sparse appearance model we can take twofold advantages first the correlation of target patches over time is considered second using this local appearance model with different patch sizes takes into account local features of target thoroughly furthermore the position of candidate patches and their occlusion levels are utilized simultaneously to obtain the final likelihood of target candidates evaluations on recent challenging benchmark show that our tracking method outperforms the stateoftheart trackers
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'robust', 'visual', 'tracking', 'method', 'which', 'exploits', 'the', 'relationships', 'of', 'targets', 'in', 'adjacent', 'frames', 'using', 'patchwise', 'joint', 'sparse', 'representation', 'two', 'sets', 'of', 'overlapping', 'patches', 'with', 'different', 'sizes', 'are', 'extracted', 'from', 'target', 'candidates', 'to', 'construct', 'two', 'dictionaries', 'with', 'consideration', 'of', 'joint', 'sparse', 'representation', 'by', 'applying', 'this', 'representation', 'into', 'structural', 'sparse', 'appearance', 'model', 'we', 'can', 'take', 'twofold', 'advantages', 'first', 'the', 'correlation', 'of', 'target', 'patches', 'over', 'time', 'is', 'considered', 'second', 'using', 'this', 'local', 'appearance', 'model', 'with', 'different', 'patch', 'sizes', 'takes', 'into', 'account', 'local', 'features', 'of', 'target', 'thoroughly', 'furthermore', 'the', 'position', 'of', 'candidate', 'patches', 'and', 'their', 'occlusion', 'levels', 'are', 'utilized', 'simultaneously', 'to', 'obtain', 'the', 'final', 'likelihood', 'of', 'target', 'candidates', 'evaluations', 'on', 'recent', 'challenging', 'benchmark', 'show', 'that', 'our', 'tracking', 'method', 'outperforms', 'the', 'stateoftheart', 'trackers']]
|
[-0.05111904393866538, -0.005621895667225603, -0.09688652681161476, 0.02929572990697418, -0.05896807473994071, -0.14458459583787067, 0.0072886593416408305, 0.45231300213133857, -0.27000695817743336, -0.3447115797241549, 0.03165455174354476, -0.24979794426091698, -0.15819831792220113, 0.10453651622763925, -0.09087339703053716, 0.04343844509041388, 0.11685811584034274, 0.03334548636226945, -0.11146851750128271, -0.28567803724698965, 0.2993361765221497, 0.010078772665902732, 0.33775049395438644, -0.04382408341212619, 0.15930316614873347, 0.01843110284385001, -0.10504022368413937, 0.026616638791423494, -0.04127986706079091, 0.19242371900397684, 0.2771878197466234, 0.17536576143151428, 0.28201361650961543, -0.4271371315173324, -0.2035462720593768, 0.0845387845840906, 0.1335153491874676, 0.11906109099377758, -0.042254774676327926, -0.3837756623453911, 0.10620935873744348, -0.12098739555315866, -0.006013820319616747, -0.13113898578129948, -0.011531632003043928, 0.026222933429263292, -0.31120233055985264, 0.0795195710229417, 0.05346551949473759, 0.006442950677967841, -0.10697638338822271, -0.16464263089602033, 0.02738420481065048, 0.1996169948251918, 0.041686407272561246, -0.012089980078951245, 0.10420721740980123, -0.12850853865928646, -0.10377805501611287, 0.3505268936240745, -0.04377322834015133, -0.2361692447523256, 0.2127842490726541, -0.082101124432689, -0.1456262899840611, 0.15533720530689724, 0.22968145417830638, 0.1412869668152604, -0.16677722661575722, -0.0032680932636139914, -0.06858226068077548, 0.17733974176113523, 0.07428040719147952, 0.027525102195795625, 0.225824169638086, 0.21878860259969388, 0.049754914033391905, 0.18537137356789543, -0.21767077135154977, -0.05902504192424878, -0.26080919165284405, -0.04741064343233443, -0.18478736694106052, -0.08823434532302687, -0.10134425188868679, -0.12720206606712553, 0.45496512327583566, 0.2003669016881876, 0.2584325270727277, 0.06922599394719357, 0.3547725689347698, 0.022162968905890482, 0.0995074009594147, 0.047347171160752974, 0.16431436555520182, 0.022938918186193934, 0.03210521924906531, -0.14911911491846344, 0.0737062152371847, 0.09754939800158384]
|
1,803.06142
|
The XXL Survey: XXIX. GMRT 610 MHz continuum observations
|
We present the 25 square-degree GMRT-XXL-N 610 MHz radio continuum survey,
conducted at 50~cm wavelength with the Giant Metrewave Radio Telescope (GMRT)
towards the XXL Northern field (XXL-N). We combined previously published
observations of the XMM-Large Scale Structure (XMM-LSS) field, located in the
central part of XXL-N, with newly conducted observations towards the remaining
XXL-N area, and imaged the combined data-set using the Source Peeling and
Atmospheric Modeling ({\sc SPAM}) pipeline. The final mosaic encompasses a
total area of $30.4$ square degrees, with ${\rm rms}<150~\mu$Jy/beam over 60\%
of the area. The ${\rm rms}$ achieved in the inner 9.6 square degree area,
enclosing the XMM-LSS field, is about $200~\mu$Jy/beam, while that over the
outer 12.66 square degree area (which excludes the noisy edges) is about
$45~\mu$Jy/beam. The resolution of the final mosaic is 6.5 arcsec. We present a
catalogue of 5\,434 sources detected at $\geq7\times {\rm rms}$. We verify, and
correct the reliability of, the catalog in terms of astrometry, flux, and false
detection rate. Making use of the (to date) deepest radio continuum survey over
a relatively large (2 square degree) field, complete at the flux levels probed
by the GMRT-XXL-N survey, we also assess the survey's incompleteness as a
function of flux density. The radio continuum sensitivity reached over a large
field with a wealth of multi-wavelength data available makes the GMRT-XXL-N 610
MHz survey an important asset for studying the physical properties,
environments and cosmic evolution of radio sources, in particular
radio-selected active galactic nuclei (AGN).
|
astro-ph.GA
|
we present the 25 squaredegree gmrtxxln 610 mhz radio continuum survey conducted at 50cm wavelength with the giant metrewave radio telescope gmrt towards the xxl northern field xxln we combined previously published observations of the xmmlarge scale structure xmmlss field located in the central part of xxln with newly conducted observations towards the remaining xxln area and imaged the combined dataset using the source peeling and atmospheric modeling sc spam pipeline the final mosaic encompasses a total area of 304 square degrees with rm rms150mujybeam over 60 of the area the rm rms achieved in the inner 96 square degree area enclosing the xmmlss field is about 200mujybeam while that over the outer 1266 square degree area which excludes the noisy edges is about 45mujybeam the resolution of the final mosaic is 65 arcsec we present a catalogue of 5434 sources detected at geq7times rm rms we verify and correct the reliability of the catalog in terms of astrometry flux and false detection rate making use of the to date deepest radio continuum survey over a relatively large 2 square degree field complete at the flux levels probed by the gmrtxxln survey we also assess the surveys incompleteness as a function of flux density the radio continuum sensitivity reached over a large field with a wealth of multiwavelength data available makes the gmrtxxln 610 mhz survey an important asset for studying the physical properties environments and cosmic evolution of radio sources in particular radioselected active galactic nuclei agn
|
[['we', 'present', 'the', '25', 'squaredegree', 'gmrtxxln', '610', 'mhz', 'radio', 'continuum', 'survey', 'conducted', 'at', '50cm', 'wavelength', 'with', 'the', 'giant', 'metrewave', 'radio', 'telescope', 'gmrt', 'towards', 'the', 'xxl', 'northern', 'field', 'xxln', 'we', 'combined', 'previously', 'published', 'observations', 'of', 'the', 'xmmlarge', 'scale', 'structure', 'xmmlss', 'field', 'located', 'in', 'the', 'central', 'part', 'of', 'xxln', 'with', 'newly', 'conducted', 'observations', 'towards', 'the', 'remaining', 'xxln', 'area', 'and', 'imaged', 'the', 'combined', 'dataset', 'using', 'the', 'source', 'peeling', 'and', 'atmospheric', 'modeling', 'sc', 'spam', 'pipeline', 'the', 'final', 'mosaic', 'encompasses', 'a', 'total', 'area', 'of', '304', 'square', 'degrees', 'with', 'rm', 'rms150mujybeam', 'over', '60', 'of', 'the', 'area', 'the', 'rm', 'rms', 'achieved', 'in', 'the', 'inner', '96', 'square', 'degree', 'area', 'enclosing', 'the', 'xmmlss', 'field', 'is', 'about', '200mujybeam', 'while', 'that', 'over', 'the', 'outer', '1266', 'square', 'degree', 'area', 'which', 'excludes', 'the', 'noisy', 'edges', 'is', 'about', '45mujybeam', 'the', 'resolution', 'of', 'the', 'final', 'mosaic', 'is', '65', 'arcsec', 'we', 'present', 'a', 'catalogue', 'of', '5434', 'sources', 'detected', 'at', 'geq7times', 'rm', 'rms', 'we', 'verify', 'and', 'correct', 'the', 'reliability', 'of', 'the', 'catalog', 'in', 'terms', 'of', 'astrometry', 'flux', 'and', 'false', 'detection', 'rate', 'making', 'use', 'of', 'the', 'to', 'date', 'deepest', 'radio', 'continuum', 'survey', 'over', 'a', 'relatively', 'large', '2', 'square', 'degree', 'field', 'complete', 'at', 'the', 'flux', 'levels', 'probed', 'by', 'the', 'gmrtxxln', 'survey', 'we', 'also', 'assess', 'the', 'surveys', 'incompleteness', 'as', 'a', 'function', 'of', 'flux', 'density', 'the', 'radio', 'continuum', 'sensitivity', 'reached', 'over', 'a', 'large', 'field', 'with', 'a', 'wealth', 'of', 'multiwavelength', 'data', 'available', 'makes', 'the', 'gmrtxxln', '610', 'mhz', 'survey', 'an', 'important', 'asset', 'for', 'studying', 'the', 'physical', 'properties', 'environments', 'and', 'cosmic', 'evolution', 'of', 'radio', 'sources', 'in', 'particular', 'radioselected', 'active', 'galactic', 'nuclei', 'agn']]
|
[-0.12140517992325847, 0.04965615323932751, -0.009880437776293039, 0.052613552170614, -0.08307432801340067, -0.02181907728747484, 0.07549456900240539, 0.41012719832360744, -0.15485252376354525, -0.3850019968233604, 0.1328242253397166, -0.29383478952962677, -0.019544810899859103, 0.19925064491893743, -0.010693015994405525, -0.03865818019166834, 0.05614626875608094, -0.06087310926475152, -0.004978118494053375, -0.256321919153525, 0.22465451302796358, 0.16331128810854328, 0.23830932804762764, -0.008651864883555061, 0.14031405917439732, -0.049630004040697596, -0.12995479469582316, 0.006587653948806625, -0.14367022457999803, 0.07192036651320173, 0.263449983934799, 0.12347509311569602, 0.23500298035384726, -0.3175758736614337, -0.17211270683402877, 0.05080211398847125, 0.14632437219115074, 0.021285658406664774, 0.0093459901447818, -0.31664125910967805, 0.07530968057167996, -0.16102512310413067, -0.2054562028564528, 0.10217452195085923, 0.019678204834419052, 0.040586391480882944, -0.1602376596812914, 0.10428649464460692, -0.0508595943516082, 0.17331170972528648, -0.08991071716364887, -0.17182559781006457, -0.013048391111306233, 0.10714884044663835, -0.0384929366908017, 0.12084223214372103, 0.14697271874921833, -0.17830597144003513, -0.051411785170964806, 0.31353339542914566, -0.07254780834701693, 0.01028056603419468, 0.13870857265028613, -0.22518061791880079, -0.18731586095386418, 0.21758354656252657, 0.1817493681401137, 0.07095232691161657, -0.16819194316267086, 0.05316254439732106, -0.048254813474350046, 0.2733554698434877, 0.04973135248148515, 0.06336452507264452, 0.28647514553970577, 0.144808651747205, 0.08204531420401677, 0.16346067965242422, -0.3333400860352158, -0.023426690892941117, -0.2832245726498618, -0.06689519627180732, -0.15511998256530474, 0.11096610038046852, -0.10022806385961992, -0.08936441664386602, 0.39476624805740856, 0.1114077462413283, 0.13295719887363752, 0.085392178757281, 0.29685923198444975, 0.009096349286271926, 0.11775470100757149, 0.10453929570446044, 0.2919293565047069, 0.16834205522684864, 0.11477164200453448, -0.17662937438437415, -0.028435895414907993, -0.036073853327881225]
|
1,803.06143
|
Disagreement among global cloud distributions from CALIOP, passive
satellite sensors and general circulation models
|
Cloud detection is the first step of any complex satellite-based cloud
retrieval. No instrument detects all clouds, and analyses that use a given
satellite climatology can only discuss a specific subset of clouds. We attempt
to clarify which subsets of clouds are detected in a robust way by passive
sensors, and which require active sensors. To do so, we identify where
retrievals of Cloud Amounts (CAs), based on numerous sensors and algorithms,
differ the most. We investigate large uncertainties, and confront retrievals
from the CALIOP lidar, which detects semitransparent clouds and directly
measures their vertical distribution, whatever the surface below. We document
the cloud vertical distribution, opacity and seasonal variability where CAs
from passive sensors disagree most. CALIOP CAs are larger than the passive
average by +0.05 (AM) and +0.07 (PM). Over land, the +0.1 average difference
rises to +0.2 over the African desert, Antarctica and Greenland, where large
passive disagreements are traced to unfavorable surface conditions. Over
oceans, CALIOP retrievals are closer to the average of passive retrievals
except over the ITCZ (+0.1). Passive CAs disagree more in tropical areas
associated with large-scale subsidence, where CALIOP observes a specific
multi-layer cloud population: optically thin, high-level clouds and opaque
(z>7km), shallow boundary layer clouds (z<2km). We evaluate the CA and cloud
vertical distribution from 8 General Circulation Models where passive
retrievals disagree and CALIOP provides new information. We find that modeled
clouds are not more realistic where cloud detections from passive observations
have long been robust, than where active sensors provide more reliable
information.
|
physics.ao-ph
|
cloud detection is the first step of any complex satellitebased cloud retrieval no instrument detects all clouds and analyses that use a given satellite climatology can only discuss a specific subset of clouds we attempt to clarify which subsets of clouds are detected in a robust way by passive sensors and which require active sensors to do so we identify where retrievals of cloud amounts cas based on numerous sensors and algorithms differ the most we investigate large uncertainties and confront retrievals from the caliop lidar which detects semitransparent clouds and directly measures their vertical distribution whatever the surface below we document the cloud vertical distribution opacity and seasonal variability where cas from passive sensors disagree most caliop cas are larger than the passive average by 005 am and 007 pm over land the 01 average difference rises to 02 over the african desert antarctica and greenland where large passive disagreements are traced to unfavorable surface conditions over oceans caliop retrievals are closer to the average of passive retrievals except over the itcz 01 passive cas disagree more in tropical areas associated with largescale subsidence where caliop observes a specific multilayer cloud population optically thin highlevel clouds and opaque z7km shallow boundary layer clouds z2km we evaluate the ca and cloud vertical distribution from 8 general circulation models where passive retrievals disagree and caliop provides new information we find that modeled clouds are not more realistic where cloud detections from passive observations have long been robust than where active sensors provide more reliable information
|
[['cloud', 'detection', 'is', 'the', 'first', 'step', 'of', 'any', 'complex', 'satellitebased', 'cloud', 'retrieval', 'no', 'instrument', 'detects', 'all', 'clouds', 'and', 'analyses', 'that', 'use', 'a', 'given', 'satellite', 'climatology', 'can', 'only', 'discuss', 'a', 'specific', 'subset', 'of', 'clouds', 'we', 'attempt', 'to', 'clarify', 'which', 'subsets', 'of', 'clouds', 'are', 'detected', 'in', 'a', 'robust', 'way', 'by', 'passive', 'sensors', 'and', 'which', 'require', 'active', 'sensors', 'to', 'do', 'so', 'we', 'identify', 'where', 'retrievals', 'of', 'cloud', 'amounts', 'cas', 'based', 'on', 'numerous', 'sensors', 'and', 'algorithms', 'differ', 'the', 'most', 'we', 'investigate', 'large', 'uncertainties', 'and', 'confront', 'retrievals', 'from', 'the', 'caliop', 'lidar', 'which', 'detects', 'semitransparent', 'clouds', 'and', 'directly', 'measures', 'their', 'vertical', 'distribution', 'whatever', 'the', 'surface', 'below', 'we', 'document', 'the', 'cloud', 'vertical', 'distribution', 'opacity', 'and', 'seasonal', 'variability', 'where', 'cas', 'from', 'passive', 'sensors', 'disagree', 'most', 'caliop', 'cas', 'are', 'larger', 'than', 'the', 'passive', 'average', 'by', '005', 'am', 'and', '007', 'pm', 'over', 'land', 'the', '01', 'average', 'difference', 'rises', 'to', '02', 'over', 'the', 'african', 'desert', 'antarctica', 'and', 'greenland', 'where', 'large', 'passive', 'disagreements', 'are', 'traced', 'to', 'unfavorable', 'surface', 'conditions', 'over', 'oceans', 'caliop', 'retrievals', 'are', 'closer', 'to', 'the', 'average', 'of', 'passive', 'retrievals', 'except', 'over', 'the', 'itcz', '01', 'passive', 'cas', 'disagree', 'more', 'in', 'tropical', 'areas', 'associated', 'with', 'largescale', 'subsidence', 'where', 'caliop', 'observes', 'a', 'specific', 'multilayer', 'cloud', 'population', 'optically', 'thin', 'highlevel', 'clouds', 'and', 'opaque', 'z7km', 'shallow', 'boundary', 'layer', 'clouds', 'z2km', 'we', 'evaluate', 'the', 'ca', 'and', 'cloud', 'vertical', 'distribution', 'from', '8', 'general', 'circulation', 'models', 'where', 'passive', 'retrievals', 'disagree', 'and', 'caliop', 'provides', 'new', 'information', 'we', 'find', 'that', 'modeled', 'clouds', 'are', 'not', 'more', 'realistic', 'where', 'cloud', 'detections', 'from', 'passive', 'observations', 'have', 'long', 'been', 'robust', 'than', 'where', 'active', 'sensors', 'provide', 'more', 'reliable', 'information']]
|
[-0.10445751048788975, 0.1312778945845951, -0.04507370960195586, 0.04673508293640297, -0.05418374380124511, -0.14530673415015732, 0.06807864653427036, 0.40070992292806745, -0.2127611677703773, -0.3449579211587589, 0.11253674880837992, -0.3196147681111821, -0.0914335486687912, 0.19431187531084843, -0.10608522081378079, 0.005292553945244955, 0.044681366104336956, -0.05488942535157548, -0.01139335724292323, -0.20270625330620476, 0.2745190004574224, 0.062291082116730866, 0.23522555434499823, -0.02648399522923495, 0.059612924953976215, -0.07904517185682106, -0.08909645585698031, -0.014821965063559234, -0.10174804596381219, 0.08853855039850468, 0.26924528904778744, 0.13331415233782506, 0.2123374603337623, -0.4627910728921138, -0.25424603941953844, 0.11368409297724683, 0.16824429995465343, 0.024971912598832406, -0.018812093368603476, -0.26332871127761603, 0.0801496529449997, -0.16855492712079828, -0.09310652638438142, 0.01326633140625846, 0.04454808283988978, 0.02827421272504291, -0.24361605633217434, 0.06973899150819754, -0.034418241560204135, 0.1643791012022467, -0.08864679473954888, -0.1539233001369414, -0.055898702428084875, 0.16068540048916705, -0.028111858065203128, 0.03666883653920469, 0.2350709693278149, -0.13220809233932831, 0.013677289210064041, 0.4021987537594719, -0.08043315934743972, -0.0977141043080597, 0.24306258791226096, -0.16499268768599168, -0.13069389436332995, 0.1535175707512757, 0.1811423147231662, 0.10860224679437658, -0.13003540161662386, -0.024844340718349456, -0.06301066394847848, 0.20689773216237506, 0.05161483341085148, 0.023930762545898602, 0.2724374411442864, 0.11776130340830793, 0.10631942208893301, 0.058951749900607246, -0.22002246038131748, -0.12230293406866535, -0.20396297160972146, -0.1252089546215425, -0.12859434745826995, 0.016615253803932334, -0.09428256027991117, -0.12217735631542931, 0.2656878078659435, 0.1888870235186279, 0.20503652690575339, 0.024165642994274903, 0.3597289025377009, 0.024858917500491122, 0.09928662991169693, 0.13323523941272425, 0.23374930148230985, 0.05578663212151104, 0.12362046019154063, -0.11674322441150065, 0.11632398735096175, -0.05110091308227903]
|
1,803.06144
|
Homotopy invariants of singularity categories
|
We present a method for computing $\mathbb{A}^1$-homotopy invariants of
singularity categories of rings admitting suitable gradings. Using this we
describe any such invariant, e.g. homotopy K-theory, for the stable categories
of self-injective algebras admitting a connected grading. A remark is also made
concerning the vanishing of all such invariants for cluster categories of type
$A_{2n}$ quivers.
|
math.KT math.AG math.RT
|
we present a method for computing mathbba1homotopy invariants of singularity categories of rings admitting suitable gradings using this we describe any such invariant eg homotopy ktheory for the stable categories of selfinjective algebras admitting a connected grading a remark is also made concerning the vanishing of all such invariants for cluster categories of type a_2n quivers
|
[['we', 'present', 'a', 'method', 'for', 'computing', 'mathbba1homotopy', 'invariants', 'of', 'singularity', 'categories', 'of', 'rings', 'admitting', 'suitable', 'gradings', 'using', 'this', 'we', 'describe', 'any', 'such', 'invariant', 'eg', 'homotopy', 'ktheory', 'for', 'the', 'stable', 'categories', 'of', 'selfinjective', 'algebras', 'admitting', 'a', 'connected', 'grading', 'a', 'remark', 'is', 'also', 'made', 'concerning', 'the', 'vanishing', 'of', 'all', 'such', 'invariants', 'for', 'cluster', 'categories', 'of', 'type', 'a_2n', 'quivers']]
|
[-0.2399208267202734, 0.008060340586650585, -0.09386416047345847, 0.11163119589244681, -0.0938257978580493, -0.21833795053784602, -0.05422913702620592, 0.3559301779605448, -0.35046933548125836, -0.18905648191659047, 0.12079981223879648, -0.1882928895075955, -0.1495330905308947, 0.18395170408101486, -0.19380335017506564, -0.07719787752388843, 0.10560395581082307, 0.1277250135234291, -0.11107320908922702, -0.2963248583421643, 0.5384801358616512, -0.07233874106064572, 0.17887002668203422, 0.060413106760409264, 0.13989784177725337, 0.014603922002217067, -0.053312818137263615, 0.057881911002498655, -0.17537675758857013, 0.14455236154026352, 0.3570268022886012, 0.031807849067263305, 0.12871230393648148, -0.3189661126650338, -0.05553183868947339, 0.22304165389920985, 0.14328660112966776, 0.0774359875026026, -0.05390063156041184, -0.3045259673381224, 0.13918120287624852, -0.27378120705751435, -0.15937700910892869, -0.1306079146452248, 0.10471437592890911, 0.026237155377332653, -0.21711573662469164, -0.0031613261385895646, 0.06537058440569256, 0.19060243942242647, -0.12877058873086103, -0.053857693348878195, -0.05013173322991601, 0.12905337101879663, -0.08862407171649725, -0.06011915636398563, 0.13497767196635582, -0.12852264798961446, -0.2017124519209444, 0.36467303830431774, 0.005544404382817447, -0.21412061983054237, 0.15014151729909436, -0.06976304846882288, -0.24897326459176838, 0.11962599614967726, -0.05175553204026073, 0.18707476804515213, 0.006385757870573018, 0.19060340581927449, -0.11078985627474529, 0.01879307973181962, 0.12921040494776598, 0.013232164151434387, 0.16327813735032187, 0.12068862358241209, 0.04717399793610509, 0.11874144565912761, 0.05011326460433858, 0.017873343338058994, -0.36507835232519675, -0.22939127864914813, -0.011903000103692258, 0.17186323005340196, -0.12357138897225793, -0.26039441380583284, 0.44551086688547265, 0.07757455270205225, 0.15315690743071692, 0.1833252023872254, 0.19954295694229326, -0.0038866809211737874, 0.12874839697698398, 0.049712474832111705, 0.10033102726031627, 0.25564458527203116, -0.025071663133400892, -0.05130530344519814, -0.06291977952267709, 0.2721841851390699]
|
1,803.06145
|
Q-processes and asymptotic properties of Markov processes conditioned
not to hit moving boundaries
|
We investigate some asymptotic properties of general Markov processes
conditioned not to be absorbed by moving boundaries. We first give general
criteria involving an exponential convergence towards the Q-process, that is
the law of the considered Markov process conditioned never to reach the moving
boundaries. This exponential convergence allows us to state the existence and
uniqueness of quasi-ergodic distribution considering either boundaries moving
periodically or stabilizing boundaries. We also state the existence and
uniqueness of quasi-limit distribution when absorbing boundaries stabilize. We
finally deal with some examples such as diffusions which are coming down from
infinity.
|
math.PR
|
we investigate some asymptotic properties of general markov processes conditioned not to be absorbed by moving boundaries we first give general criteria involving an exponential convergence towards the qprocess that is the law of the considered markov process conditioned never to reach the moving boundaries this exponential convergence allows us to state the existence and uniqueness of quasiergodic distribution considering either boundaries moving periodically or stabilizing boundaries we also state the existence and uniqueness of quasilimit distribution when absorbing boundaries stabilize we finally deal with some examples such as diffusions which are coming down from infinity
|
[['we', 'investigate', 'some', 'asymptotic', 'properties', 'of', 'general', 'markov', 'processes', 'conditioned', 'not', 'to', 'be', 'absorbed', 'by', 'moving', 'boundaries', 'we', 'first', 'give', 'general', 'criteria', 'involving', 'an', 'exponential', 'convergence', 'towards', 'the', 'qprocess', 'that', 'is', 'the', 'law', 'of', 'the', 'considered', 'markov', 'process', 'conditioned', 'never', 'to', 'reach', 'the', 'moving', 'boundaries', 'this', 'exponential', 'convergence', 'allows', 'us', 'to', 'state', 'the', 'existence', 'and', 'uniqueness', 'of', 'quasiergodic', 'distribution', 'considering', 'either', 'boundaries', 'moving', 'periodically', 'or', 'stabilizing', 'boundaries', 'we', 'also', 'state', 'the', 'existence', 'and', 'uniqueness', 'of', 'quasilimit', 'distribution', 'when', 'absorbing', 'boundaries', 'stabilize', 'we', 'finally', 'deal', 'with', 'some', 'examples', 'such', 'as', 'diffusions', 'which', 'are', 'coming', 'down', 'from', 'infinity']]
|
[-0.06877245181485227, 0.16790645183937158, -0.11298996457143834, 0.06622821637745227, -0.09562030552249205, -0.1538936447548239, 0.0891032867038647, 0.39962232189351005, -0.30660091003305034, -0.21200126663438584, 0.1929598189914893, -0.25838233573426567, -0.06566541672586218, 0.11812886382440889, -0.07039395652791428, 0.07677113191273652, 0.02364548486412356, 0.019469690567960864, -0.03149629311489039, -0.2280864458923277, 0.33591702007933666, 0.018808431531253614, 0.24318494658525053, 0.012406635951054724, 0.09254299001584418, -0.00822255477113159, 0.019926900862667123, 0.0027455191471074756, -0.16165174827459083, 0.05942074589823422, 0.19007006573833918, 0.06849163963312381, 0.2841170709782378, -0.43407629165602357, -0.1898772606871238, 0.1758940222624101, 0.1826299024255652, 0.12255302008216906, -0.05008280025795102, -0.3434637796918028, 0.07553367836793003, -0.11191081575265056, -0.257721926570919, -0.07814634883482205, -0.038545409614514366, 0.08630610788731198, -0.2578336759176301, 0.07783437735174391, 0.14653161329364306, 0.011483844095154813, -0.11632128751064699, -0.05021927023894693, -0.02711994897966322, 0.17589007147103794, 0.08889922774856371, -0.054824194178524376, 0.12110471155396417, -0.10460120404972449, -0.11916050468816569, 0.2955803214915489, -0.04758344391593709, -0.25305736654094957, 0.2467385801731756, -0.16918169607555394, -0.14628281637438034, 0.15578965872134032, 0.1723104464037246, 0.14288305684496758, -0.15259202301921937, 0.07742541858705838, -0.010752526719711329, 0.09782185380003955, 0.11090549261456258, 0.014071017955920022, 0.1637522146939055, 0.1293799808420437, 0.144849697765159, 0.20549389601219445, -0.044691067728164946, -0.1806413206958065, -0.3698687180190494, -0.16426052616320944, -0.13763524802695765, 0.10189260440452735, -0.09151007078165238, -0.2201795824656361, 0.31440066875105627, 0.1676548494222133, 0.227868007128372, 0.10831761923986243, 0.21139401904135746, 0.1641580045774677, -0.05918556378429026, 0.10272277732621755, 0.17399334229933294, 0.14274534902927516, 0.06502437786640305, -0.1763395616588624, 0.13166203343579055, 0.07829433157549877]
|
1,803.06146
|
Local weak convergence for PageRank
|
PageRank is a well-known algorithm for measuring centrality in networks. It
was originally proposed by Google for ranking pages in the World-Wide Web. One
of the intriguing empirical properties of PageRank is the so-called `power-law
hypothesis': in a scale-free network the PageRank scores follow a power law
with the same exponent as the (in-)degrees. Up to date, this hypothesis has
been confirmed empirically and in several specific random graphs models. In
contrast, this paper does not focus on one random graph model but investigates
the existence of an asymptotic PageRank distribution, when the graph size goes
to infinity, using local weak convergence. This may help to identify general
network structures in which the power-law hypothesis holds. We start from the
definition of local weak convergence for sequences of (random) undirected
graphs, and extend this notion to directed graphs. To this end, we define an
exploration process in the directed setting that keeps track of in- and
out-degrees of vertices. Then we use this to prove the existence of an
asymptotic PageRank distribution. As a result, the limiting distribution of
PageRank can be computed directly as a function of the limiting object. We
apply our results to the directed configuration model and continuous-time
branching processes trees, as well as preferential attachment models.
|
math.PR
|
pagerank is a wellknown algorithm for measuring centrality in networks it was originally proposed by google for ranking pages in the worldwide web one of the intriguing empirical properties of pagerank is the socalled powerlaw hypothesis in a scalefree network the pagerank scores follow a power law with the same exponent as the indegrees up to date this hypothesis has been confirmed empirically and in several specific random graphs models in contrast this paper does not focus on one random graph model but investigates the existence of an asymptotic pagerank distribution when the graph size goes to infinity using local weak convergence this may help to identify general network structures in which the powerlaw hypothesis holds we start from the definition of local weak convergence for sequences of random undirected graphs and extend this notion to directed graphs to this end we define an exploration process in the directed setting that keeps track of in and outdegrees of vertices then we use this to prove the existence of an asymptotic pagerank distribution as a result the limiting distribution of pagerank can be computed directly as a function of the limiting object we apply our results to the directed configuration model and continuoustime branching processes trees as well as preferential attachment models
|
[['pagerank', 'is', 'a', 'wellknown', 'algorithm', 'for', 'measuring', 'centrality', 'in', 'networks', 'it', 'was', 'originally', 'proposed', 'by', 'google', 'for', 'ranking', 'pages', 'in', 'the', 'worldwide', 'web', 'one', 'of', 'the', 'intriguing', 'empirical', 'properties', 'of', 'pagerank', 'is', 'the', 'socalled', 'powerlaw', 'hypothesis', 'in', 'a', 'scalefree', 'network', 'the', 'pagerank', 'scores', 'follow', 'a', 'power', 'law', 'with', 'the', 'same', 'exponent', 'as', 'the', 'indegrees', 'up', 'to', 'date', 'this', 'hypothesis', 'has', 'been', 'confirmed', 'empirically', 'and', 'in', 'several', 'specific', 'random', 'graphs', 'models', 'in', 'contrast', 'this', 'paper', 'does', 'not', 'focus', 'on', 'one', 'random', 'graph', 'model', 'but', 'investigates', 'the', 'existence', 'of', 'an', 'asymptotic', 'pagerank', 'distribution', 'when', 'the', 'graph', 'size', 'goes', 'to', 'infinity', 'using', 'local', 'weak', 'convergence', 'this', 'may', 'help', 'to', 'identify', 'general', 'network', 'structures', 'in', 'which', 'the', 'powerlaw', 'hypothesis', 'holds', 'we', 'start', 'from', 'the', 'definition', 'of', 'local', 'weak', 'convergence', 'for', 'sequences', 'of', 'random', 'undirected', 'graphs', 'and', 'extend', 'this', 'notion', 'to', 'directed', 'graphs', 'to', 'this', 'end', 'we', 'define', 'an', 'exploration', 'process', 'in', 'the', 'directed', 'setting', 'that', 'keeps', 'track', 'of', 'in', 'and', 'outdegrees', 'of', 'vertices', 'then', 'we', 'use', 'this', 'to', 'prove', 'the', 'existence', 'of', 'an', 'asymptotic', 'pagerank', 'distribution', 'as', 'a', 'result', 'the', 'limiting', 'distribution', 'of', 'pagerank', 'can', 'be', 'computed', 'directly', 'as', 'a', 'function', 'of', 'the', 'limiting', 'object', 'we', 'apply', 'our', 'results', 'to', 'the', 'directed', 'configuration', 'model', 'and', 'continuoustime', 'branching', 'processes', 'trees', 'as', 'well', 'as', 'preferential', 'attachment', 'models']]
|
[-0.08848530005567633, 0.0706072342479287, -0.10794754106533754, 0.10658942315245155, -0.08888402523972774, -0.12725521734986295, 0.0761146022208803, 0.39822128414224955, -0.28715967850856733, -0.3008000970756308, 0.057260341826446744, -0.2812477816116965, -0.17016137286996408, 0.12172046692167979, -0.06636025957648435, 0.07025352803111888, 0.04959644495302114, 0.08370327015332348, 0.008733897524007477, -0.25908924823696394, 0.3194143466631577, 0.0933352964643336, 0.29123409558528973, 0.04412493014474227, 0.05364823608435205, 0.019380103518647888, -0.02964158606455083, 0.057052890528478964, -0.12178985457950833, 0.09035805130285825, 0.2112357160047878, 0.1626145752296911, 0.2950470702837429, -0.3523279714852713, -0.21264434556401737, 0.1812015143995531, 0.15856743861934372, 0.10277686811932826, 0.009281153146092564, -0.2690030934191993, 0.12643818114111774, -0.17230516035326038, -0.12312644616683054, -0.0406241739054003, 0.0378773334453774, 0.08249627047723768, -0.27101469615703866, 0.05309743649807375, 0.11447534709120549, 0.030734213143013313, 0.00690462053267912, -0.09042176603332992, -0.001586579255344814, 0.15683559511671774, 0.04158058889545125, 0.01708740291684442, 0.11569123274880634, -0.1312510815660924, -0.2100092752536503, 0.3452571621208818, -0.05939606681214513, -0.17760759972530235, 0.16209816734937696, -0.1156422919306851, -0.20900356937950185, 0.057734150241980975, 0.20939076374068644, 0.13586987130155911, -0.17024543530549643, 0.0558523749480227, -0.07654861705510113, 0.10928284196884888, 0.05382892537544265, -0.03436552787224996, 0.13657363882217716, 0.18019231958027876, 0.11782341837106158, 0.19431455458251767, -0.030697904634223235, -0.10794856167129148, -0.238465230478861, -0.14326667763575276, -0.24603258665227354, 0.0658417442169783, -0.17263141552717934, -0.21994732486821217, 0.42739161668716097, 0.18244916033966663, 0.23999607748841928, 0.1457429209870829, 0.2421454022720156, 0.09576159465828496, 0.0359322401289155, 0.12325595101226845, 0.1845051856442262, 0.14239565791315023, 0.1329378063207872, -0.11534143540008497, 0.15299089481365555, 0.0964382018764852]
|
1,803.06147
|
Matter coupling to degenerate spacetimes in first order gravity
|
We develop a systematic study of the equations of motion in the first order
gravity with matter fields for degenerate metrics. Like the Hilbert-Palatini
action functional for pure gravity, the action functionals for matter fields
used are first order. These are defined for both invertible and non- invertible
metrics. Description for invertible metrics is equivalent to second order
gravity theory with matter. For degenerate metrics the theory describes a
different phase. The analysis for tetrads with one zero eigen value in theory
with scalar, Abelian vector gauge and fermion matter fields is presented in
detail.
|
gr-qc
|
we develop a systematic study of the equations of motion in the first order gravity with matter fields for degenerate metrics like the hilbertpalatini action functional for pure gravity the action functionals for matter fields used are first order these are defined for both invertible and non invertible metrics description for invertible metrics is equivalent to second order gravity theory with matter for degenerate metrics the theory describes a different phase the analysis for tetrads with one zero eigen value in theory with scalar abelian vector gauge and fermion matter fields is presented in detail
|
[['we', 'develop', 'a', 'systematic', 'study', 'of', 'the', 'equations', 'of', 'motion', 'in', 'the', 'first', 'order', 'gravity', 'with', 'matter', 'fields', 'for', 'degenerate', 'metrics', 'like', 'the', 'hilbertpalatini', 'action', 'functional', 'for', 'pure', 'gravity', 'the', 'action', 'functionals', 'for', 'matter', 'fields', 'used', 'are', 'first', 'order', 'these', 'are', 'defined', 'for', 'both', 'invertible', 'and', 'non', 'invertible', 'metrics', 'description', 'for', 'invertible', 'metrics', 'is', 'equivalent', 'to', 'second', 'order', 'gravity', 'theory', 'with', 'matter', 'for', 'degenerate', 'metrics', 'the', 'theory', 'describes', 'a', 'different', 'phase', 'the', 'analysis', 'for', 'tetrads', 'with', 'one', 'zero', 'eigen', 'value', 'in', 'theory', 'with', 'scalar', 'abelian', 'vector', 'gauge', 'and', 'fermion', 'matter', 'fields', 'is', 'presented', 'in', 'detail']]
|
[-0.15952168523186916, 0.16414822661317885, -0.08180758943291087, 0.10392021565930917, -0.0700700948701093, -0.14237523412233904, -0.07326646735278988, 0.31773732048704434, -0.20085784923285246, -0.27838216067634913, 0.06705588617631675, -0.2960992956239926, -0.155580590233991, 0.12773871447302793, -0.020296559345565342, 0.07043613912905321, -0.029739898011872642, 0.12913611294505628, -0.13094560540967473, -0.2609697307607061, 0.4147077527632447, -0.029372399841361727, 0.24660425897148486, -0.011918883868738225, 0.12436503150843475, -0.015072984375843876, -0.04087503101480634, 0.03531327853959642, -0.12590166030353622, 0.09698716770171335, 0.2618980468348845, 0.03506596887876329, 0.1915877591867588, -0.38705068979608387, -0.23925989667247785, 0.11507620070325701, 0.05496340057763614, 0.10943081052973866, -0.057638800624561934, -0.295669680647552, 0.08540549082191366, -0.16219157562100966, -0.13607146810176537, -0.15436595272468892, 0.0019631153413731802, -0.04081623211355978, -0.2782163282317158, 0.08712605758521118, -0.004657669023512618, 0.041300166623764914, -0.11804892900399863, -0.10397016048235329, 0.003042187492706274, 0.07763788362866954, 0.09069095968366846, 0.04292082439274772, 0.10224562655448129, -0.16353718389168773, -0.11596234525725442, 0.44077426825502986, -0.1752150681739869, -0.2760071526232519, 0.13504123343644958, -0.12149495109915734, -0.15202409122139215, 0.07212276394037824, 0.14502985987224076, 0.156427387827027, -0.12423828014809835, 0.171243422477212, 0.02310881381364245, 0.10774958407212244, 0.04484029499519812, 0.028431810753567047, 0.2485367295283236, 0.09444446988207729, 0.0672587030126076, 0.06915146313901795, 0.025260977701921213, -0.137942897900939, -0.40026199548064095, -0.2032729755989031, -0.08488162813561136, 0.027396104387987993, -0.09126649374405756, -0.20778195051672427, 0.4051917337077229, 0.11031092943525628, 0.06841567365550681, 0.05288528993137573, 0.24029112076141723, 0.13197727573937493, 0.03736695555087767, 0.05975699941627681, 0.24920673889941292, 0.23536426885739753, 0.05597017475795981, -0.17645995957856556, -0.09676424413919449, 0.1425446955585166]
|
1,803.06148
|
Oscillations and Waves in Radio Source of Drifting Pulsation Structures
|
Drifting pulsation structures (DPSs) are considered to be radio signatures of
the plasmoids formed during magnetic reconnection in the impulsive phase of
solar flares. In the present paper we analyze oscillations and waves in seven
examples of drifting pulsation structures, observed by the 800-2000 MHz
Ondrejov radiospectrograph. For their analysis we use a new type of oscillation
maps which give us a much more information about processes in DPSs than that in
previous analyzes. Based on these oscillation maps, made from radio spectra by
the wavelet technique, we recognized quasi-periodic oscillations with periods
ranging from about 1 to 108 s in all studied DPSs. This strongly supports the
idea that DPSs are generated during a fragmented magnetic reconnection. Phases
of most the oscillations in DPSs, especially for the period around 1 s, are
synchronized ("infinite" frequency drift) in the whole frequency range of DPSs.
For longer periods in some DPSs we found that the phases of the oscillations
drift with the frequency drift in the interval from -17 to +287 MHz\s. We
propose that these drifting phases can be caused (a) by the fast or slow
magnetosonic waves generated during the magnetic reconnection and propagating
through the plasmoid, (b) by a quasi-periodic structure in the plasma inflowing
to the reconnection forming a plasmoid, and (c) by a quasi-periodically varying
reconnection rate in the X-point of the reconnection close to the plasmoid.
|
astro-ph.SR
|
drifting pulsation structures dpss are considered to be radio signatures of the plasmoids formed during magnetic reconnection in the impulsive phase of solar flares in the present paper we analyze oscillations and waves in seven examples of drifting pulsation structures observed by the 8002000 mhz ondrejov radiospectrograph for their analysis we use a new type of oscillation maps which give us a much more information about processes in dpss than that in previous analyzes based on these oscillation maps made from radio spectra by the wavelet technique we recognized quasiperiodic oscillations with periods ranging from about 1 to 108 s in all studied dpss this strongly supports the idea that dpss are generated during a fragmented magnetic reconnection phases of most the oscillations in dpss especially for the period around 1 s are synchronized infinite frequency drift in the whole frequency range of dpss for longer periods in some dpss we found that the phases of the oscillations drift with the frequency drift in the interval from 17 to 287 mhzs we propose that these drifting phases can be caused a by the fast or slow magnetosonic waves generated during the magnetic reconnection and propagating through the plasmoid b by a quasiperiodic structure in the plasma inflowing to the reconnection forming a plasmoid and c by a quasiperiodically varying reconnection rate in the xpoint of the reconnection close to the plasmoid
|
[['drifting', 'pulsation', 'structures', 'dpss', 'are', 'considered', 'to', 'be', 'radio', 'signatures', 'of', 'the', 'plasmoids', 'formed', 'during', 'magnetic', 'reconnection', 'in', 'the', 'impulsive', 'phase', 'of', 'solar', 'flares', 'in', 'the', 'present', 'paper', 'we', 'analyze', 'oscillations', 'and', 'waves', 'in', 'seven', 'examples', 'of', 'drifting', 'pulsation', 'structures', 'observed', 'by', 'the', '8002000', 'mhz', 'ondrejov', 'radiospectrograph', 'for', 'their', 'analysis', 'we', 'use', 'a', 'new', 'type', 'of', 'oscillation', 'maps', 'which', 'give', 'us', 'a', 'much', 'more', 'information', 'about', 'processes', 'in', 'dpss', 'than', 'that', 'in', 'previous', 'analyzes', 'based', 'on', 'these', 'oscillation', 'maps', 'made', 'from', 'radio', 'spectra', 'by', 'the', 'wavelet', 'technique', 'we', 'recognized', 'quasiperiodic', 'oscillations', 'with', 'periods', 'ranging', 'from', 'about', '1', 'to', '108', 's', 'in', 'all', 'studied', 'dpss', 'this', 'strongly', 'supports', 'the', 'idea', 'that', 'dpss', 'are', 'generated', 'during', 'a', 'fragmented', 'magnetic', 'reconnection', 'phases', 'of', 'most', 'the', 'oscillations', 'in', 'dpss', 'especially', 'for', 'the', 'period', 'around', '1', 's', 'are', 'synchronized', 'infinite', 'frequency', 'drift', 'in', 'the', 'whole', 'frequency', 'range', 'of', 'dpss', 'for', 'longer', 'periods', 'in', 'some', 'dpss', 'we', 'found', 'that', 'the', 'phases', 'of', 'the', 'oscillations', 'drift', 'with', 'the', 'frequency', 'drift', 'in', 'the', 'interval', 'from', '17', 'to', '287', 'mhzs', 'we', 'propose', 'that', 'these', 'drifting', 'phases', 'can', 'be', 'caused', 'a', 'by', 'the', 'fast', 'or', 'slow', 'magnetosonic', 'waves', 'generated', 'during', 'the', 'magnetic', 'reconnection', 'and', 'propagating', 'through', 'the', 'plasmoid', 'b', 'by', 'a', 'quasiperiodic', 'structure', 'in', 'the', 'plasma', 'inflowing', 'to', 'the', 'reconnection', 'forming', 'a', 'plasmoid', 'and', 'c', 'by', 'a', 'quasiperiodically', 'varying', 'reconnection', 'rate', 'in', 'the', 'xpoint', 'of', 'the', 'reconnection', 'close', 'to', 'the', 'plasmoid']]
|
[-0.18547353145638198, 0.26505725205073627, -0.0050345114301245065, 0.08669301053434529, -0.059845746530107026, -0.07452503810495589, 0.047915117015065053, 0.39564648811862646, -0.2538499209472458, -0.27280893745263673, 0.11220114624321267, -0.2258764361547915, -0.12147388036778092, 0.26606624445966665, 0.0029979236686029733, -0.023377243287808935, 0.07599582267497783, -0.021284005714548162, -0.020352013651039693, -0.15484442122006442, 0.24622493908131793, 0.0812688789731577, 0.20284493859994399, -0.08016677154429676, 0.03913285150656323, -0.09684973503402494, -0.03580973371402239, -0.016160316563723406, -0.12489624224605445, 0.045364173242088524, 0.21321061377522427, 0.09748750745552669, 0.23385112930302915, -0.46225426338000214, -0.24275831986637988, 0.022351614921252965, 0.19354944325100581, 0.06342724614698053, -0.031997069742470616, -0.28659332752050387, 0.06770084510875858, -0.1473947037535506, -0.10369939771916786, 0.027427350715189786, 0.07256500167949569, 0.07687483937076385, -0.2643189878564316, 0.12465668637184547, 0.07788425995222417, 0.08270312368756894, -0.10808303998884024, -0.023527371068182704, -0.03824386400577826, 0.06505505011610493, 0.10741174163788686, 0.050525846731349085, 0.11649782607710851, -0.05449959987601128, -0.12877502999101156, 0.3288533796568389, -0.07075089168425164, -0.08604297296696412, 0.20988802011205424, -0.26827044047593407, -0.12788908627867956, 0.2296301730993119, 0.1703814198847586, 0.07652982213527863, -0.10013788436449766, -0.026799864641408884, 0.00615508566021887, 0.13952424266835214, 0.132020659617741, 0.013041411132654538, 0.2801226311185885, 0.14356406260225357, 0.033181587456890836, 0.1324245548047109, -0.17820874371430312, -0.027348726074658818, -0.257084117339545, -0.06492798843293035, -0.12283326783449312, 0.04445497550370647, -0.04257619545223782, -0.1731352042144737, 0.48709765923898907, 0.14964840763794798, 0.21804377624930843, -0.04493599372978415, 0.24146219567512667, 0.11257614512843164, 0.06239071743719298, 0.1546488831865952, 0.259417095276637, 0.16553818496665818, 0.1837117478324028, -0.21607361723834173, 0.030450028275619403, 0.03935677049672977]
|
1,803.06149
|
Catching drifting pebbles I. Enhanced pebble accretion efficiencies for
eccentric planets
|
Coagulation theory predicts that micron-sized dust grains grow into pebbles
which drift inward towards the star, when they reach sizes of mm-cm. When they
cross the orbit of a planet, a fraction of these drifting pebbles will be
accreted. In the pebble accretion mechanism, the combined effects of the
planet's gravitational attraction and gas drag greatly increase the accretion
rate. We calculate the pebble accretion efficiency $\varepsilon_{2D}$ -- the
probability a pebble is accreted by the planet -- in the 2D limit (pebbles
reside in the midplane). In particular, we investigate the dependence of
$\varepsilon_{2D}$ on the planet eccentricity and its implications for planet
formation models. We conduct N-body simulations to calculate the pebble
accretion efficiency in both the local frame and the global frame. With the
global method we investigate the pebble accretion efficiency when the planet is
on an eccentric orbit. We find that the local and the global methods generally
give consistent results. The efficiency increases with the planet's
eccentricity once the relative velocity between the pebble and the planet is
determined by the planet's eccentric velocity. At large eccentricities,
however, the relative velocity becomes too large for pebble accretion. The
efficiency then drops significantly and the accretion enters the ballistic
regime. We present general expressions for $\varepsilon_{2D}$. Applying the
obtained formula to the formation of a secondary planet, in resonance with an
already-formed giant planet, we find that the embryo grows quickly due to its
larger eccentricity. The maximum $\varepsilon_{2D}$ for a planet on an
eccentric orbit is several times higher than for a planet on a circular orbit,
but this increase gives the planet an important headstart and boosts its
following mass growth.
|
astro-ph.EP
|
coagulation theory predicts that micronsized dust grains grow into pebbles which drift inward towards the star when they reach sizes of mmcm when they cross the orbit of a planet a fraction of these drifting pebbles will be accreted in the pebble accretion mechanism the combined effects of the planets gravitational attraction and gas drag greatly increase the accretion rate we calculate the pebble accretion efficiency varepsilon_2d the probability a pebble is accreted by the planet in the 2d limit pebbles reside in the midplane in particular we investigate the dependence of varepsilon_2d on the planet eccentricity and its implications for planet formation models we conduct nbody simulations to calculate the pebble accretion efficiency in both the local frame and the global frame with the global method we investigate the pebble accretion efficiency when the planet is on an eccentric orbit we find that the local and the global methods generally give consistent results the efficiency increases with the planets eccentricity once the relative velocity between the pebble and the planet is determined by the planets eccentric velocity at large eccentricities however the relative velocity becomes too large for pebble accretion the efficiency then drops significantly and the accretion enters the ballistic regime we present general expressions for varepsilon_2d applying the obtained formula to the formation of a secondary planet in resonance with an alreadyformed giant planet we find that the embryo grows quickly due to its larger eccentricity the maximum varepsilon_2d for a planet on an eccentric orbit is several times higher than for a planet on a circular orbit but this increase gives the planet an important headstart and boosts its following mass growth
|
[['coagulation', 'theory', 'predicts', 'that', 'micronsized', 'dust', 'grains', 'grow', 'into', 'pebbles', 'which', 'drift', 'inward', 'towards', 'the', 'star', 'when', 'they', 'reach', 'sizes', 'of', 'mmcm', 'when', 'they', 'cross', 'the', 'orbit', 'of', 'a', 'planet', 'a', 'fraction', 'of', 'these', 'drifting', 'pebbles', 'will', 'be', 'accreted', 'in', 'the', 'pebble', 'accretion', 'mechanism', 'the', 'combined', 'effects', 'of', 'the', 'planets', 'gravitational', 'attraction', 'and', 'gas', 'drag', 'greatly', 'increase', 'the', 'accretion', 'rate', 'we', 'calculate', 'the', 'pebble', 'accretion', 'efficiency', 'varepsilon_2d', 'the', 'probability', 'a', 'pebble', 'is', 'accreted', 'by', 'the', 'planet', 'in', 'the', '2d', 'limit', 'pebbles', 'reside', 'in', 'the', 'midplane', 'in', 'particular', 'we', 'investigate', 'the', 'dependence', 'of', 'varepsilon_2d', 'on', 'the', 'planet', 'eccentricity', 'and', 'its', 'implications', 'for', 'planet', 'formation', 'models', 'we', 'conduct', 'nbody', 'simulations', 'to', 'calculate', 'the', 'pebble', 'accretion', 'efficiency', 'in', 'both', 'the', 'local', 'frame', 'and', 'the', 'global', 'frame', 'with', 'the', 'global', 'method', 'we', 'investigate', 'the', 'pebble', 'accretion', 'efficiency', 'when', 'the', 'planet', 'is', 'on', 'an', 'eccentric', 'orbit', 'we', 'find', 'that', 'the', 'local', 'and', 'the', 'global', 'methods', 'generally', 'give', 'consistent', 'results', 'the', 'efficiency', 'increases', 'with', 'the', 'planets', 'eccentricity', 'once', 'the', 'relative', 'velocity', 'between', 'the', 'pebble', 'and', 'the', 'planet', 'is', 'determined', 'by', 'the', 'planets', 'eccentric', 'velocity', 'at', 'large', 'eccentricities', 'however', 'the', 'relative', 'velocity', 'becomes', 'too', 'large', 'for', 'pebble', 'accretion', 'the', 'efficiency', 'then', 'drops', 'significantly', 'and', 'the', 'accretion', 'enters', 'the', 'ballistic', 'regime', 'we', 'present', 'general', 'expressions', 'for', 'varepsilon_2d', 'applying', 'the', 'obtained', 'formula', 'to', 'the', 'formation', 'of', 'a', 'secondary', 'planet', 'in', 'resonance', 'with', 'an', 'alreadyformed', 'giant', 'planet', 'we', 'find', 'that', 'the', 'embryo', 'grows', 'quickly', 'due', 'to', 'its', 'larger', 'eccentricity', 'the', 'maximum', 'varepsilon_2d', 'for', 'a', 'planet', 'on', 'an', 'eccentric', 'orbit', 'is', 'several', 'times', 'higher', 'than', 'for', 'a', 'planet', 'on', 'a', 'circular', 'orbit', 'but', 'this', 'increase', 'gives', 'the', 'planet', 'an', 'important', 'headstart', 'and', 'boosts', 'its', 'following', 'mass', 'growth']]
|
[-0.11549077336478175, 0.14891483157259863, -0.0902067043753577, 0.045005424345921106, -0.0711189261570141, -0.03719393433530586, 0.05274000561136442, 0.3103318243739668, -0.22623030735733177, -0.30013347897624626, 0.07473445728849755, -0.24750825695261575, -0.055132605160748506, 0.18572549209120157, -0.0842405410086373, 0.03661884278878553, 0.15510820802824193, -0.03182269019864337, -0.030876689104606277, -0.281933593521556, 0.27641592452224967, 0.09933052025060507, 0.07067287188154929, 0.04983279541825734, 0.06380533885237748, -0.05722976939168934, -0.0013738280985558379, -0.03430978655545176, -0.27384541013935115, 0.04670056378792809, 0.15584823756666266, 0.10145886000701347, 0.25321441087905533, -0.43475530096802156, -0.17409912450745216, 0.05728851474713588, 0.17153627093859436, 0.10239277351301744, -0.06777384254804718, -0.2011239930305738, 0.09179809425478343, -0.2695597803618327, -0.16241965458375754, 0.060569057045369475, 0.13176971153470862, 0.0012058201674085137, -0.304937015409055, 0.08723881591509595, 0.13411005715312532, 0.036421992121756994, -0.10299955456740344, -0.08354396672971695, -0.12528460121720328, 0.07615116496342217, 0.07273715363471242, 0.019095951763818553, 0.2627902872344999, -0.12259135937547662, -0.023085893346064226, 0.4009131136758631, -0.10525696002145381, -0.11035081977899898, 0.25492832851866126, -0.2593757820389895, -0.07592105709846837, 0.1687277169979137, 0.2200512853290791, 0.14532340208466665, -0.07371820298193717, 0.0069080159809200795, -0.02315274030611297, 0.16551111917942762, 0.10957188211529907, -0.015147784340787557, 0.4077878835023907, 0.16134853319997183, 0.12744063303967856, 0.0927698265662437, -0.19444928521799107, -0.09412275059266771, -0.1587314934172816, -0.15052314001250255, -0.1628403561392232, 0.018307434500404295, -0.1570886721108737, -0.1080950461530491, 0.3169101456963066, 0.14198033806557456, 0.24036918670289975, 0.08669913682936475, 0.32280075704245287, 0.1545308525842763, 0.09409134469393209, 0.15446413330905867, 0.3382952232386215, 0.11365502257156523, 0.08468625902289363, -0.32390503289997985, 0.12412128561940651, 0.041696502734313086]
|
1,803.0615
|
Catching drifting pebbles II. A stochastic equation of motions for
pebbles
|
Turbulence plays a key role in the transport of pebble-sized particles. It
also affects the ability of pebbles to be accreted by protoplanets, because it
stirs pebbles out of the disk midplane. In addition, turbulence can suppress
pebble accretion once the relative velocities become too large for the settling
mechanism to be viable. Following Paper I, we aim to quantify these effects by
calculating the pebble accretion efficiency $\varepsilon$ using three-body
simulations. To model the effect of turbulence on the pebbles, we derive a
stochastic equation of motion (SEOM) applicable to stratified disk
configurations. In the strong coupling limit (ignoring particle inertia) the
limiting form of this equation agrees with previous works. We conduct a
parameter study and calculate $\varepsilon$ in 3D, varying pebble and gas
(turbulence) properties and accounting for the planet inclination. We find that
strong turbulence suppresses pebble accretion through turbulent diffusion,
agreeing within factors of order unity with previous works. Another reduction
of $\varepsilon$ occurs when the turbulent rms motions are large and the
settling mechanism fails. Efficiency-wise, the outer disk regions are more
affected by turbulence than the inner regions. At the location of the H$_2$O
iceline, planets around low-mass stars achieve much higher efficiencies.
Including the results from Paper I, we present a framework to obtain
$\varepsilon$ under general circumstances.
|
astro-ph.EP
|
turbulence plays a key role in the transport of pebblesized particles it also affects the ability of pebbles to be accreted by protoplanets because it stirs pebbles out of the disk midplane in addition turbulence can suppress pebble accretion once the relative velocities become too large for the settling mechanism to be viable following paper i we aim to quantify these effects by calculating the pebble accretion efficiency varepsilon using threebody simulations to model the effect of turbulence on the pebbles we derive a stochastic equation of motion seom applicable to stratified disk configurations in the strong coupling limit ignoring particle inertia the limiting form of this equation agrees with previous works we conduct a parameter study and calculate varepsilon in 3d varying pebble and gas turbulence properties and accounting for the planet inclination we find that strong turbulence suppresses pebble accretion through turbulent diffusion agreeing within factors of order unity with previous works another reduction of varepsilon occurs when the turbulent rms motions are large and the settling mechanism fails efficiencywise the outer disk regions are more affected by turbulence than the inner regions at the location of the h_2o iceline planets around lowmass stars achieve much higher efficiencies including the results from paper i we present a framework to obtain varepsilon under general circumstances
|
[['turbulence', 'plays', 'a', 'key', 'role', 'in', 'the', 'transport', 'of', 'pebblesized', 'particles', 'it', 'also', 'affects', 'the', 'ability', 'of', 'pebbles', 'to', 'be', 'accreted', 'by', 'protoplanets', 'because', 'it', 'stirs', 'pebbles', 'out', 'of', 'the', 'disk', 'midplane', 'in', 'addition', 'turbulence', 'can', 'suppress', 'pebble', 'accretion', 'once', 'the', 'relative', 'velocities', 'become', 'too', 'large', 'for', 'the', 'settling', 'mechanism', 'to', 'be', 'viable', 'following', 'paper', 'i', 'we', 'aim', 'to', 'quantify', 'these', 'effects', 'by', 'calculating', 'the', 'pebble', 'accretion', 'efficiency', 'varepsilon', 'using', 'threebody', 'simulations', 'to', 'model', 'the', 'effect', 'of', 'turbulence', 'on', 'the', 'pebbles', 'we', 'derive', 'a', 'stochastic', 'equation', 'of', 'motion', 'seom', 'applicable', 'to', 'stratified', 'disk', 'configurations', 'in', 'the', 'strong', 'coupling', 'limit', 'ignoring', 'particle', 'inertia', 'the', 'limiting', 'form', 'of', 'this', 'equation', 'agrees', 'with', 'previous', 'works', 'we', 'conduct', 'a', 'parameter', 'study', 'and', 'calculate', 'varepsilon', 'in', '3d', 'varying', 'pebble', 'and', 'gas', 'turbulence', 'properties', 'and', 'accounting', 'for', 'the', 'planet', 'inclination', 'we', 'find', 'that', 'strong', 'turbulence', 'suppresses', 'pebble', 'accretion', 'through', 'turbulent', 'diffusion', 'agreeing', 'within', 'factors', 'of', 'order', 'unity', 'with', 'previous', 'works', 'another', 'reduction', 'of', 'varepsilon', 'occurs', 'when', 'the', 'turbulent', 'rms', 'motions', 'are', 'large', 'and', 'the', 'settling', 'mechanism', 'fails', 'efficiencywise', 'the', 'outer', 'disk', 'regions', 'are', 'more', 'affected', 'by', 'turbulence', 'than', 'the', 'inner', 'regions', 'at', 'the', 'location', 'of', 'the', 'h_2o', 'iceline', 'planets', 'around', 'lowmass', 'stars', 'achieve', 'much', 'higher', 'efficiencies', 'including', 'the', 'results', 'from', 'paper', 'i', 'we', 'present', 'a', 'framework', 'to', 'obtain', 'varepsilon', 'under', 'general', 'circumstances']]
|
[-0.11037155478147172, 0.170218394473021, -0.05285498002765996, 0.060236110731689524, -0.0647833913403659, -0.0744154005394117, 0.030804531227701527, 0.3147182423691048, -0.25437016125059053, -0.32099801175313714, 0.040503368642242084, -0.23283599684815678, -0.054571305994579794, 0.17063110649735866, -0.05276118828175224, 0.031168561436945276, 0.08177785055328891, -0.09449255706254985, -0.0023274018519523197, -0.2207873611320376, 0.32283205949161725, 0.11356558706437316, 0.13616553238358034, 0.03708847887704158, 0.05074294696770887, -0.12247520294171, -0.03654871988719521, 0.012655597624029511, -0.25281400609861165, 0.03237797765313674, 0.17637778632886814, 0.04639289771515667, 0.27531545413832104, -0.46322859191797044, -0.2376243264074916, 0.06580393121003339, 0.19978507213328778, 0.1046015547161974, -0.03443292522386519, -0.2020127546721112, 0.08803184399877405, -0.21265129718901513, -0.15977431738000608, -0.00782835531857944, 0.06759883607977078, 0.0028061271682120513, -0.2948268493876801, 0.12434531519965761, 0.12917081589575136, 0.03629902912364733, -0.07825794416723476, -0.08254944345920355, -0.05455614631412394, 0.11050622579959879, 0.07205399565853475, 0.019033404888593914, 0.244437082159272, -0.17394007927690258, -0.00505928120958819, 0.42899896454274933, -0.09322805762940758, -0.17473685831510435, 0.22145290462905107, -0.22883144986955015, -0.10021552868474658, 0.17277190840158996, 0.20398412398269364, 0.13996932670750403, -0.07859273826863636, 0.03129832037598347, -0.047673925101347964, 0.16436616514448216, 0.09485654422913234, -0.007175160057039792, 0.28425421354265135, 0.1535991273709425, 0.0672566494817419, 0.11959825328085572, -0.16892985180868966, -0.13569847532443563, -0.23317924345121066, -0.13090797045233302, -0.12643317070655813, 0.03902649653370483, -0.12092797251861047, -0.1057129859811165, 0.29169475487281055, 0.19705220706386614, 0.20669754742966773, 0.035673017435158806, 0.3180994799808886, 0.12830691353339596, 0.06588437181035771, 0.15765697123030217, 0.30327594354661686, 0.1558038645704651, 0.08651689887177373, -0.2727200401844631, 0.1317350121354249, 0.06058200388259002]
|
1,803.06151
|
Reverse Hardy-Littlewood-Sobolev inequalities
|
This paper is devoted to a new family of reverse Hardy-Littlewood-Sobolev
inequalities which involve a power law kernel with positive exponent. We
investigate the range of the admissible parameters and characterize the optimal
functions. A striking open question is the possibility of concentration which
is analyzed and related with nonlinear diffusion equations involving mean field
drifts.
|
math.AP
|
this paper is devoted to a new family of reverse hardylittlewoodsobolev inequalities which involve a power law kernel with positive exponent we investigate the range of the admissible parameters and characterize the optimal functions a striking open question is the possibility of concentration which is analyzed and related with nonlinear diffusion equations involving mean field drifts
|
[['this', 'paper', 'is', 'devoted', 'to', 'a', 'new', 'family', 'of', 'reverse', 'hardylittlewoodsobolev', 'inequalities', 'which', 'involve', 'a', 'power', 'law', 'kernel', 'with', 'positive', 'exponent', 'we', 'investigate', 'the', 'range', 'of', 'the', 'admissible', 'parameters', 'and', 'characterize', 'the', 'optimal', 'functions', 'a', 'striking', 'open', 'question', 'is', 'the', 'possibility', 'of', 'concentration', 'which', 'is', 'analyzed', 'and', 'related', 'with', 'nonlinear', 'diffusion', 'equations', 'involving', 'mean', 'field', 'drifts']]
|
[-0.13148681351283034, 0.10402839609222221, -0.040007681053664, 0.07686810177567947, -0.10421841111487343, -0.16390705929370597, 0.019889779968902337, 0.2944003072833376, -0.33774520363658667, -0.2536080471971737, 0.12164794526428782, -0.26465955617771086, -0.17036806256510317, 0.22448414850181767, -0.060042954116527526, 0.10760327816491813, -0.016097312011489912, 0.023344687876358097, -0.052768096078320274, -0.2052991028010313, 0.38029593834653497, 0.017703535825213685, 0.23738084102348825, 0.0714499459947027, 0.13219276052300952, -0.036953914777508805, -0.047211226949002594, 0.027288682646550506, -0.22919877121291524, 0.1542823191640699, 0.2086144064420036, 0.05607704706822655, 0.3313537699203672, -0.3137071265373379, -0.2229696716780641, 0.15865561738610268, 0.10402981857103961, 0.042913386810271605, -0.07175361235359949, -0.23570346493007882, 0.05453942807590855, -0.10952983367522913, -0.20476325560593978, -0.045820030832796226, 0.03298289819628865, 0.09966917039959558, -0.32716867164708674, 0.15422247113227577, 0.09211625948747885, 0.05469482132840702, -0.07156895370488721, -0.08119089814967342, 0.09175711499327528, 0.08056659540410951, 0.0628091496016298, 0.01678549422026013, 0.08712508676606896, -0.11415388391053836, -0.10112382441626064, 0.3179174784069931, -0.05199558861620192, -0.22089710529793852, 0.1389647126197815, -0.16861102883038775, -0.10809443706446993, 0.10256927144447607, 0.20029851784264402, 0.13997794169972622, -0.17224661646676914, 0.13188353491672647, -0.04361504822112953, 0.15866156841054493, 0.05958680495885866, 0.03047545352351985, 0.1195906144566834, 0.11488552019000053, 0.12405728151290012, 0.2055069266186495, -0.005395211678530488, -0.13064364382963894, -0.32248513460425393, -0.1957684016233543, -0.13783149836984063, 0.10633718054409005, -0.09663646752544862, -0.17930500819680414, 0.42828556785493027, 0.10012274425909189, 0.17710819128634675, 0.06027960726143127, 0.17119106538094847, 0.1974077984424574, 0.029073497197324678, 0.06729371450741642, 0.19882725634878234, 0.18500014135081852, 0.12421384676625687, -0.23320423561381176, 0.07899425218680076, 0.09330224243292053]
|
1,803.06152
|
Object Captioning and Retrieval with Natural Language
|
We address the problem of jointly learning vision and language to understand
the object in a fine-grained manner. The key idea of our approach is the use of
object descriptions to provide the detailed understanding of an object. Based
on this idea, we propose two new architectures to solve two related problems:
object captioning and natural language-based object retrieval. The goal of the
object captioning task is to simultaneously detect the object and generate its
associated description, while in the object retrieval task, the goal is to
localize an object given an input query. We demonstrate that both problems can
be solved effectively using hybrid end-to-end CNN-LSTM networks. The
experimental results on our new challenging dataset show that our methods
outperform recent methods by a fair margin, while providing a detailed
understanding of the object and having fast inference time. The source code
will be made available.
|
cs.CV
|
we address the problem of jointly learning vision and language to understand the object in a finegrained manner the key idea of our approach is the use of object descriptions to provide the detailed understanding of an object based on this idea we propose two new architectures to solve two related problems object captioning and natural languagebased object retrieval the goal of the object captioning task is to simultaneously detect the object and generate its associated description while in the object retrieval task the goal is to localize an object given an input query we demonstrate that both problems can be solved effectively using hybrid endtoend cnnlstm networks the experimental results on our new challenging dataset show that our methods outperform recent methods by a fair margin while providing a detailed understanding of the object and having fast inference time the source code will be made available
|
[['we', 'address', 'the', 'problem', 'of', 'jointly', 'learning', 'vision', 'and', 'language', 'to', 'understand', 'the', 'object', 'in', 'a', 'finegrained', 'manner', 'the', 'key', 'idea', 'of', 'our', 'approach', 'is', 'the', 'use', 'of', 'object', 'descriptions', 'to', 'provide', 'the', 'detailed', 'understanding', 'of', 'an', 'object', 'based', 'on', 'this', 'idea', 'we', 'propose', 'two', 'new', 'architectures', 'to', 'solve', 'two', 'related', 'problems', 'object', 'captioning', 'and', 'natural', 'languagebased', 'object', 'retrieval', 'the', 'goal', 'of', 'the', 'object', 'captioning', 'task', 'is', 'to', 'simultaneously', 'detect', 'the', 'object', 'and', 'generate', 'its', 'associated', 'description', 'while', 'in', 'the', 'object', 'retrieval', 'task', 'the', 'goal', 'is', 'to', 'localize', 'an', 'object', 'given', 'an', 'input', 'query', 'we', 'demonstrate', 'that', 'both', 'problems', 'can', 'be', 'solved', 'effectively', 'using', 'hybrid', 'endtoend', 'cnnlstm', 'networks', 'the', 'experimental', 'results', 'on', 'our', 'new', 'challenging', 'dataset', 'show', 'that', 'our', 'methods', 'outperform', 'recent', 'methods', 'by', 'a', 'fair', 'margin', 'while', 'providing', 'a', 'detailed', 'understanding', 'of', 'the', 'object', 'and', 'having', 'fast', 'inference', 'time', 'the', 'source', 'code', 'will', 'be', 'made', 'available']]
|
[-0.060438123918304755, -0.050509987016177586, -0.08803910036653685, 0.06457981262233292, -0.1341813107854275, -0.16345924168166254, 0.0038317624094648933, 0.4611632130077096, -0.27741280821829933, -0.36977896207094596, 0.08018777626059746, -0.23141804496523272, -0.15325082210050958, 0.2217267211368244, -0.1772156907055451, 0.09149593504448263, 0.16823922227561272, 0.050522558785678795, -0.04757371484967215, -0.27316228705806794, 0.3154380722446557, 0.050815815916981824, 0.29974826785963865, 0.05007825143394523, 0.14826620287787753, -0.043564481312269664, -0.06687657426362445, -0.030000740744579, -0.050479511507540514, 0.2242155703502156, 0.3155151633656628, 0.23351560778231645, 0.27812570038245243, -0.4131158499465305, -0.22423603344664333, 0.05742184644831078, 0.1326373140723603, 0.11957997126111976, -0.05163037590524119, -0.35708388098243143, 0.11186644399449938, -0.17488009231101695, 0.0009798035500761196, -0.12205454663113774, -0.010239472783797858, -0.06046052744768902, -0.2512506603914294, -0.02227691181168771, 0.11142355615754618, 0.007626603316312947, -0.08251073804040927, -0.05551570989698374, 0.09033329756201884, 0.20178160485716498, 0.01001946841125839, 0.104176293754456, 0.11673584435021087, -0.21115772584516582, -0.16569413724323723, 0.40920052699567305, -0.022140042197440757, -0.2305603987999818, 0.23568985226158637, -0.020599301666857636, -0.16252829353039971, 0.08362723115932982, 0.2179109336820995, 0.19600193030802773, -0.1686198120163817, -0.0028736456661630854, -0.06378660902862443, 0.22306294011294234, -0.011012828275307912, -0.006398979884882768, 0.25355990065046313, 0.2742427734683464, 0.04314153888231131, 0.17844548949268552, -0.12221327969261135, -0.06285565061380669, -0.218784379905888, -0.12536588683090852, -0.19986137486107292, -0.05343207233065904, -0.061776135442699276, -0.1242476347200319, 0.40279988646760684, 0.27592213536283244, 0.2285481885132589, 0.07378258963660368, 0.34767048482840157, 0.027902463849374174, 0.06543987219857027, 0.07268532479520837, 0.17912364391242566, 0.0028876310062347626, 0.1301817371380091, -0.2104259721941131, 0.0686757765372987, 0.09030349491810312]
|
1,803.06153
|
A closer look at Intrusion Detection System for web applications
|
Intrusion Detection System (IDS) is one of the security measures being used
as an additional defence mechanism to prevent the security breaches on web. It
has been well known methodology for detecting network-based attacks but still
immature in the domain of securing web application. The objective of the paper
is to thoroughly understand the design methodology of the detection system in
respect to web applications. In this paper, we discuss several specific aspects
of a web application in detail that makes challenging for a developer to build
an efficient web IDS. The paper also provides a comprehensive overview of the
existing detection systems exclusively designed to observe web traffic.
Furthermore, we identify various dimensions for comparing the IDS from
different perspectives based on their design and functionalities. We also
provide a conceptual framework of an IDS with prevention mechanism to offer a
systematic guidance for the implementation of the system specific to the web
applications. We compare its features with five existing detection systems,
namely AppSensor, PHPIDS, ModSecurity, Shadow Daemon and AQTRONIX WebKnight.
The paper will highly facilitate the interest groups with the cutting edge
information to understand the stronger and weaker sections of the web IDS and
provide a firm foundation for developing an intelligent and efficient system.
|
cs.CR
|
intrusion detection system ids is one of the security measures being used as an additional defence mechanism to prevent the security breaches on web it has been well known methodology for detecting networkbased attacks but still immature in the domain of securing web application the objective of the paper is to thoroughly understand the design methodology of the detection system in respect to web applications in this paper we discuss several specific aspects of a web application in detail that makes challenging for a developer to build an efficient web ids the paper also provides a comprehensive overview of the existing detection systems exclusively designed to observe web traffic furthermore we identify various dimensions for comparing the ids from different perspectives based on their design and functionalities we also provide a conceptual framework of an ids with prevention mechanism to offer a systematic guidance for the implementation of the system specific to the web applications we compare its features with five existing detection systems namely appsensor phpids modsecurity shadow daemon and aqtronix webknight the paper will highly facilitate the interest groups with the cutting edge information to understand the stronger and weaker sections of the web ids and provide a firm foundation for developing an intelligent and efficient system
|
[['intrusion', 'detection', 'system', 'ids', 'is', 'one', 'of', 'the', 'security', 'measures', 'being', 'used', 'as', 'an', 'additional', 'defence', 'mechanism', 'to', 'prevent', 'the', 'security', 'breaches', 'on', 'web', 'it', 'has', 'been', 'well', 'known', 'methodology', 'for', 'detecting', 'networkbased', 'attacks', 'but', 'still', 'immature', 'in', 'the', 'domain', 'of', 'securing', 'web', 'application', 'the', 'objective', 'of', 'the', 'paper', 'is', 'to', 'thoroughly', 'understand', 'the', 'design', 'methodology', 'of', 'the', 'detection', 'system', 'in', 'respect', 'to', 'web', 'applications', 'in', 'this', 'paper', 'we', 'discuss', 'several', 'specific', 'aspects', 'of', 'a', 'web', 'application', 'in', 'detail', 'that', 'makes', 'challenging', 'for', 'a', 'developer', 'to', 'build', 'an', 'efficient', 'web', 'ids', 'the', 'paper', 'also', 'provides', 'a', 'comprehensive', 'overview', 'of', 'the', 'existing', 'detection', 'systems', 'exclusively', 'designed', 'to', 'observe', 'web', 'traffic', 'furthermore', 'we', 'identify', 'various', 'dimensions', 'for', 'comparing', 'the', 'ids', 'from', 'different', 'perspectives', 'based', 'on', 'their', 'design', 'and', 'functionalities', 'we', 'also', 'provide', 'a', 'conceptual', 'framework', 'of', 'an', 'ids', 'with', 'prevention', 'mechanism', 'to', 'offer', 'a', 'systematic', 'guidance', 'for', 'the', 'implementation', 'of', 'the', 'system', 'specific', 'to', 'the', 'web', 'applications', 'we', 'compare', 'its', 'features', 'with', 'five', 'existing', 'detection', 'systems', 'namely', 'appsensor', 'phpids', 'modsecurity', 'shadow', 'daemon', 'and', 'aqtronix', 'webknight', 'the', 'paper', 'will', 'highly', 'facilitate', 'the', 'interest', 'groups', 'with', 'the', 'cutting', 'edge', 'information', 'to', 'understand', 'the', 'stronger', 'and', 'weaker', 'sections', 'of', 'the', 'web', 'ids', 'and', 'provide', 'a', 'firm', 'foundation', 'for', 'developing', 'an', 'intelligent', 'and', 'efficient', 'system']]
|
[-0.13302763399622608, -0.04438018358352299, -0.06039379825588406, 0.06896641019379675, -0.12462209687999835, -0.15932855031612078, 0.0543003585939182, 0.37585953101288616, -0.24250128481355382, -0.3271110065727177, 0.14604094780572668, -0.2848040654642008, -0.16767089468222565, 0.2411789396278015, -0.08989299028634844, 0.05511284566047124, 0.01800688323905555, 0.05902837679590803, -0.010426758500043211, -0.27179583360827186, 0.32970266814638927, 0.10501098120357932, 0.3501638576944881, 0.11606955383904279, 0.049584855483958454, -0.0023730571381747724, -0.08956430744885172, -0.019823546905252266, -0.11291018484246196, 0.18584952016344022, 0.3102462384395483, 0.21980117932757046, 0.29858199692808274, -0.41944619809708944, -0.18666745463908627, 0.06941681577903559, 0.1460047154357975, 0.11129787755766657, -0.09248903497042725, -0.3331214697122937, 0.10978163048147974, -0.23264523606020504, -0.12507798828230035, -0.10013833770573866, 0.021929493523770716, 0.0033440001240772443, -0.20357932959749434, -0.054666577464980416, 0.04977543525704432, 0.07654140864629526, -0.05202188253709365, -0.061271684287433945, 0.028594532652712633, 0.1761321540513053, 0.028179235327648135, -0.014855998448414228, 0.16473675566475565, -0.16502020312870694, -0.1583174378679293, 0.3758833711535284, -0.005967017707255919, -0.16252111634381525, 0.25053573136399615, 0.009658696268480725, -0.18608749693532178, 0.08121164409534597, 0.23323450215251706, 0.10090269547682709, -0.2268787435744321, 0.014183367291045171, 0.016340423519609543, 0.17553760304240645, -0.0009974926295576662, 0.06073715041005393, 0.2245403594837138, 0.25723376375872914, 0.10993354915465206, 0.1534748234263644, -0.08514521304835997, -0.06528286235605753, -0.24117055847877408, -0.20188416709169382, -0.10860431235419904, -0.0016384568178980817, -0.036929801269647344, -0.17245145742327156, 0.40942547382196276, 0.24847780757075424, 0.1450940770992907, 0.019831625307433126, 0.3649880982844568, 0.03300315653734909, 0.06633073577271184, 0.05756851573724572, 0.19987690038979053, 0.016045067261722758, 0.163561746939199, -0.13651824118001613, 0.1208117868498581, 0.005768523728702127]
|
1,803.06154
|
Isoparametric surfaces in $\mathbb{E}(\kappa,\tau)$-spaces
|
We provide an explicit classification of the following four families of
surfaces in any homogeneous 3-manifold with 4-dimensional isometry group:
isoparametric surfaces, surfaces with constant principal curvatures,
homogeneous surfaces, and surfaces with constant mean curvature and vanishing
Abresch-Rosenberg differential.
|
math.DG
|
we provide an explicit classification of the following four families of surfaces in any homogeneous 3manifold with 4dimensional isometry group isoparametric surfaces surfaces with constant principal curvatures homogeneous surfaces and surfaces with constant mean curvature and vanishing abreschrosenberg differential
|
[['we', 'provide', 'an', 'explicit', 'classification', 'of', 'the', 'following', 'four', 'families', 'of', 'surfaces', 'in', 'any', 'homogeneous', '3manifold', 'with', '4dimensional', 'isometry', 'group', 'isoparametric', 'surfaces', 'surfaces', 'with', 'constant', 'principal', 'curvatures', 'homogeneous', 'surfaces', 'and', 'surfaces', 'with', 'constant', 'mean', 'curvature', 'and', 'vanishing', 'abreschrosenberg', 'differential']]
|
[-0.2661094516515732, 0.09614090212264086, -0.06205213702737521, -0.008911080944996614, -0.11605562224315527, -0.2185723351266904, -0.1169631847490867, 0.4216880230949475, -0.2207265293273406, -0.24945460675427547, 0.10225919309036377, -0.30787565717951226, -0.16577766818376496, 0.1685691986901638, -0.17319697698052877, 0.04199407373865446, 0.03228811818198898, 0.06592994815601298, -0.16069657150178385, -0.36153032783514416, 0.5173594993658555, -0.04838665681055341, 0.21598602556742919, 0.062454844296623305, 0.15003639981389427, -0.013206996178875366, 0.018752775931109984, 0.04348922384759554, -0.2770851205747861, 0.18114027003638256, 0.24702897445800212, -0.09161056120856068, 0.07531720366424476, -0.3825230919397794, -0.2620503506265007, 0.20075699992668936, 0.04742347081311238, 0.030211349638799827, -0.08238819657036892, -0.2475274060972226, 0.0074602593070803545, 0.002293035531273255, -0.25399646339699244, -0.07430979740829805, 0.00841858153207562, -0.004600272251245303, -0.09515682736841533, 0.07582601186079092, 0.09898569735770042, 0.2076644160760901, -0.14638477494605842, -0.1492604255103148, -0.07891319620494659, 0.11229550996078895, 0.06968335367930241, 0.016945385720389776, 0.059321057732002094, -0.050282327458262444, -0.0918160544660611, 0.330401006512917, -0.19993020164278838, -0.3552717886483058, 0.098543272449229, -0.13701019352540755, -0.0787319540977478, 0.18721909419848368, 0.1652624117485128, 0.20582022131062472, -0.07373058883091196, 0.1711935768924797, -0.008786097288322754, 0.08512677791982125, 0.15472075452980322, -0.14562011486253676, 0.13087351771835715, 0.027361753157889232, 0.13265305783790657, 0.057197873576138265, -0.008319005632820802, -0.01985738856288103, -0.4156247595181832, -0.34577489933237815, -0.0721174313280827, 0.17658465307874557, -0.22662946746538346, -0.26676826264995795, 0.32155453709837717, -0.14995594005076548, 0.20147390453479228, 0.15909941200740063, 0.19770611975437555, -0.05951109294516918, 0.029605024852431737, 0.161263982550456, 0.1614269892183634, 0.23780794489460114, -0.10850076090831023, -0.09574347610274951, -0.09031991545522872, 0.17717843915885076]
|
1,803.06155
|
Few-body quark dynamics for doubly-heavy baryons and tetraquarks
|
We discuss the adequate treatment of the 3- and 4-body dynamics for the quark
model picture of double-charm baryons and tetraquarks. We stress that the
variational and Born-Oppenheimer approximations give energies very close to the
exact ones, while the diquark approximation might be rather misleading. The
Hall-Post inequalities also provide very useful lower bounds that exclude the
possibility of stable tetraquarks for some mass ratios and some color wave
functions.
|
hep-ph nucl-th
|
we discuss the adequate treatment of the 3 and 4body dynamics for the quark model picture of doublecharm baryons and tetraquarks we stress that the variational and bornoppenheimer approximations give energies very close to the exact ones while the diquark approximation might be rather misleading the hallpost inequalities also provide very useful lower bounds that exclude the possibility of stable tetraquarks for some mass ratios and some color wave functions
|
[['we', 'discuss', 'the', 'adequate', 'treatment', 'of', 'the', '3', 'and', '4body', 'dynamics', 'for', 'the', 'quark', 'model', 'picture', 'of', 'doublecharm', 'baryons', 'and', 'tetraquarks', 'we', 'stress', 'that', 'the', 'variational', 'and', 'bornoppenheimer', 'approximations', 'give', 'energies', 'very', 'close', 'to', 'the', 'exact', 'ones', 'while', 'the', 'diquark', 'approximation', 'might', 'be', 'rather', 'misleading', 'the', 'hallpost', 'inequalities', 'also', 'provide', 'very', 'useful', 'lower', 'bounds', 'that', 'exclude', 'the', 'possibility', 'of', 'stable', 'tetraquarks', 'for', 'some', 'mass', 'ratios', 'and', 'some', 'color', 'wave', 'functions']]
|
[-0.07668700213611558, 0.17561509578988171, -0.13355947855482067, 0.24896788145617946, -0.051420279171155846, -0.1655705069070277, 0.1301972650639389, 0.34825685450240323, -0.14689119478039767, -0.259139230609804, 0.029640055329039478, -0.25025853740078385, -0.06488541114157524, 0.12921867330990516, 0.036259443917568177, 0.06524992283379687, 0.0937712086158791, 0.012257254321846867, -0.10225914890432487, -0.221283545103464, 0.30976529191990476, 0.0003257410168863725, 0.17339296497917478, 0.16961721056039727, -0.0246984390946834, -0.03771610634293461, 0.03966378658146098, -0.03952334209790696, -0.16484728143183494, 0.11157725482801165, 0.21940481031998532, 0.10950794413118907, 0.1873510455361743, -0.43274077092823776, -0.15116433966972365, 0.12512739018648458, 0.15870738207646037, 0.16608492009328218, -0.04823074719288211, -0.30095631002947903, 0.07563175578210232, -0.16413858767760836, -0.21411641603470713, -0.1797671982397636, 0.0140330299222167, 0.007530627298958438, -0.28455422297659994, 0.14266271605046696, 0.03865373521230008, -0.02718717775280601, -0.10310750470861145, -0.24932046601737756, -0.008466564842661761, 0.025167646372447842, 0.06402134406549073, 0.03310749123709789, 0.10107360330774733, -0.18112473993602654, -0.0733052512590328, 0.40919023822399153, -0.023080649984784533, -0.23195870635032223, 0.17673608356330922, -0.14213824619039678, -0.15310245979091394, 0.10595018048163342, 0.1663544252919762, 0.11533716649653902, -0.15284736872232263, 0.04364129742674962, -0.03413296377508179, 0.1139058424429833, 0.09085571607979744, 0.10975354460432478, 0.2012730382139916, 0.09055069665276054, 0.029973932062748117, 0.06242625313925732, -0.045716319077958666, -0.12132392225085177, -0.35518342607479164, -0.10553984159596966, -0.09656710948363162, 0.03265952814325684, -0.1490426011294113, -0.1509672330415713, 0.35859637858643045, 0.12514167418703437, 0.20585598553652348, 0.08216732771783743, 0.2620556818294352, 0.10221215106033976, 0.01899445329563341, 0.0862740803833889, 0.31535073191322305, 0.20020776565956033, 0.06549860691260276, -0.22480892611033135, 0.046697648883243834, 0.05975291405574999]
|
1,803.06156
|
Smoothing for signals with discontinuities using higher order
Mumford-Shah models
|
Minimizing the Mumford-Shah functional is frequently used for smoothing
signals or time series with discontinuities. A significant limitation of the
standard Mumford-Shah model is that linear trends -- and in general polynomial
trends -- in the data are not well preserved. This can be improved by building
on splines of higher order which leads to higher order Mumford-Shah models. In
this work, we study these models in the univariate situation: we discuss
important differences to the first order Mumford-Shah model, and we obtain
uniqueness results for their solutions. As a main contribution, we derive fast
minimization algorithms for Mumford-Shah models of arbitrary orders. We show
that the worst case complexity of all proposed schemes is quadratic in the
length of the signal. Remarkably, they thus achieve the worst case complexity
of the fastest solver for the piecewise constant Mumford-Shah model (which is
the simplest model of the class). Further, we obtain stability results for the
proposed algorithms. We complement these results with a numerical study. Our
reference implementation processes signals with more than 10,000 elements in
less than one second.
|
math.NA cs.NA
|
minimizing the mumfordshah functional is frequently used for smoothing signals or time series with discontinuities a significant limitation of the standard mumfordshah model is that linear trends and in general polynomial trends in the data are not well preserved this can be improved by building on splines of higher order which leads to higher order mumfordshah models in this work we study these models in the univariate situation we discuss important differences to the first order mumfordshah model and we obtain uniqueness results for their solutions as a main contribution we derive fast minimization algorithms for mumfordshah models of arbitrary orders we show that the worst case complexity of all proposed schemes is quadratic in the length of the signal remarkably they thus achieve the worst case complexity of the fastest solver for the piecewise constant mumfordshah model which is the simplest model of the class further we obtain stability results for the proposed algorithms we complement these results with a numerical study our reference implementation processes signals with more than 10000 elements in less than one second
|
[['minimizing', 'the', 'mumfordshah', 'functional', 'is', 'frequently', 'used', 'for', 'smoothing', 'signals', 'or', 'time', 'series', 'with', 'discontinuities', 'a', 'significant', 'limitation', 'of', 'the', 'standard', 'mumfordshah', 'model', 'is', 'that', 'linear', 'trends', 'and', 'in', 'general', 'polynomial', 'trends', 'in', 'the', 'data', 'are', 'not', 'well', 'preserved', 'this', 'can', 'be', 'improved', 'by', 'building', 'on', 'splines', 'of', 'higher', 'order', 'which', 'leads', 'to', 'higher', 'order', 'mumfordshah', 'models', 'in', 'this', 'work', 'we', 'study', 'these', 'models', 'in', 'the', 'univariate', 'situation', 'we', 'discuss', 'important', 'differences', 'to', 'the', 'first', 'order', 'mumfordshah', 'model', 'and', 'we', 'obtain', 'uniqueness', 'results', 'for', 'their', 'solutions', 'as', 'a', 'main', 'contribution', 'we', 'derive', 'fast', 'minimization', 'algorithms', 'for', 'mumfordshah', 'models', 'of', 'arbitrary', 'orders', 'we', 'show', 'that', 'the', 'worst', 'case', 'complexity', 'of', 'all', 'proposed', 'schemes', 'is', 'quadratic', 'in', 'the', 'length', 'of', 'the', 'signal', 'remarkably', 'they', 'thus', 'achieve', 'the', 'worst', 'case', 'complexity', 'of', 'the', 'fastest', 'solver', 'for', 'the', 'piecewise', 'constant', 'mumfordshah', 'model', 'which', 'is', 'the', 'simplest', 'model', 'of', 'the', 'class', 'further', 'we', 'obtain', 'stability', 'results', 'for', 'the', 'proposed', 'algorithms', 'we', 'complement', 'these', 'results', 'with', 'a', 'numerical', 'study', 'our', 'reference', 'implementation', 'processes', 'signals', 'with', 'more', 'than', '10000', 'elements', 'in', 'less', 'than', 'one', 'second']]
|
[-0.09171324568274797, 0.0031877520227323423, -0.053192498952443344, 0.10926709150283315, -0.049937231374611514, -0.12132817630007277, 0.017478330446056643, 0.3639750799551355, -0.2633255104013729, -0.30211603716068136, 0.1321227072209664, -0.26429146822029204, -0.1856243019790148, 0.2266576947576335, -0.0598498746789364, 0.08807485444952598, 0.04203436650293932, 0.023165630270842084, -0.1018457736099254, -0.3086243718339319, 0.27772500291152785, 0.05025003443398837, 0.2529103332931657, 0.01629480885425478, 0.057678717282715807, -0.03245804786127521, -0.01662472588941455, 0.02445589711698651, -0.1381064026608829, 0.13691382200111835, 0.2618078224079837, 0.10127530435592019, 0.2847455171658919, -0.4311115753031179, -0.22797211559830768, 0.1525774514145647, 0.11293186343358724, 0.13693847514694202, -0.03255515051928801, -0.21459228888394707, 0.11893092993884923, -0.12532050672492137, -0.11515405550965349, -0.09970705320514488, -0.033409446477890015, 0.03725037573355386, -0.2936990355034202, 0.10801344652649726, 0.08672080369564192, 0.02002563730426384, -0.08698956639338494, -0.12103439506936002, 0.03205794858840409, 0.08785285826463754, 0.06618445629013305, 0.04312485253851693, 0.053295955678652134, -0.11437466649830424, -0.14555903506632684, 0.39476972222694434, -0.10625901375651972, -0.2390529051569573, 0.18864905785015795, -0.13751861857763084, -0.15782429365927794, 0.10323017743008023, 0.19085612403113772, 0.14870212725206708, -0.12006825936455907, 0.07733674124184096, -0.02715066760213355, 0.16905521192284448, 0.04161161588232839, -0.0041013441733320066, 0.0877884176659157, 0.18400157809393544, 0.10567372314386028, 0.15071549206145443, -0.0548807811920709, -0.09851906231599285, -0.3116859200042986, -0.15590746642294434, -0.15319599769551703, -0.040117666216124385, -0.12942280629214836, -0.14697357557002413, 0.41173628706935, 0.18732052735900612, 0.1868791288193943, 0.12877166864404643, 0.3164232862443569, 0.15419271192219097, 0.05720701534039435, 0.08777229955126897, 0.20895573739328663, 0.08794690094027521, 0.05591362257453082, -0.17461508298649198, 0.07993662246707153, 0.09017640536289998]
|
1,803.06157
|
Parameter Space Abstraction and Unfolding Semantics of Discrete
Regulatory Networks
|
The modelling of discrete regulatory networks combines a graph specifying the
pairwise influences between the variables of the system, and a parametrisation
from which can be derived a discrete transition system. Given the influence
graph only, the exploration of admissible parametrisations and the behaviours
they enable is computationally demanding due to the combinatorial explosions of
both parametrisation and reachable state space.
This article introduces an abstraction of the parametrisation space and its
refinement to account for the existence of given transitions, and for
constraints on the sign and observability of influences. The abstraction uses a
convex sublattice containing the concrete parametrisation space specified by
its infimum and supremum parametrisations. It is shown that the computed
abstractions are optimal, i.e., no smaller convex sublattice exists. Although
the abstraction may introduce over-approximation, it has been proven to be
conservative with respect to reachability of states.
Then, an unfolding semantics for Parametric Regulatory Networks is defined,
taking advantage of concurrency between transitions to provide a compact
representation of reachable transitions. A prototype implementation is
provided: it has been applied to several examples of Boolean and multi-valued
networks, showing its tractability for networks with numerous components.
|
cs.DM cs.LO
|
the modelling of discrete regulatory networks combines a graph specifying the pairwise influences between the variables of the system and a parametrisation from which can be derived a discrete transition system given the influence graph only the exploration of admissible parametrisations and the behaviours they enable is computationally demanding due to the combinatorial explosions of both parametrisation and reachable state space this article introduces an abstraction of the parametrisation space and its refinement to account for the existence of given transitions and for constraints on the sign and observability of influences the abstraction uses a convex sublattice containing the concrete parametrisation space specified by its infimum and supremum parametrisations it is shown that the computed abstractions are optimal ie no smaller convex sublattice exists although the abstraction may introduce overapproximation it has been proven to be conservative with respect to reachability of states then an unfolding semantics for parametric regulatory networks is defined taking advantage of concurrency between transitions to provide a compact representation of reachable transitions a prototype implementation is provided it has been applied to several examples of boolean and multivalued networks showing its tractability for networks with numerous components
|
[['the', 'modelling', 'of', 'discrete', 'regulatory', 'networks', 'combines', 'a', 'graph', 'specifying', 'the', 'pairwise', 'influences', 'between', 'the', 'variables', 'of', 'the', 'system', 'and', 'a', 'parametrisation', 'from', 'which', 'can', 'be', 'derived', 'a', 'discrete', 'transition', 'system', 'given', 'the', 'influence', 'graph', 'only', 'the', 'exploration', 'of', 'admissible', 'parametrisations', 'and', 'the', 'behaviours', 'they', 'enable', 'is', 'computationally', 'demanding', 'due', 'to', 'the', 'combinatorial', 'explosions', 'of', 'both', 'parametrisation', 'and', 'reachable', 'state', 'space', 'this', 'article', 'introduces', 'an', 'abstraction', 'of', 'the', 'parametrisation', 'space', 'and', 'its', 'refinement', 'to', 'account', 'for', 'the', 'existence', 'of', 'given', 'transitions', 'and', 'for', 'constraints', 'on', 'the', 'sign', 'and', 'observability', 'of', 'influences', 'the', 'abstraction', 'uses', 'a', 'convex', 'sublattice', 'containing', 'the', 'concrete', 'parametrisation', 'space', 'specified', 'by', 'its', 'infimum', 'and', 'supremum', 'parametrisations', 'it', 'is', 'shown', 'that', 'the', 'computed', 'abstractions', 'are', 'optimal', 'ie', 'no', 'smaller', 'convex', 'sublattice', 'exists', 'although', 'the', 'abstraction', 'may', 'introduce', 'overapproximation', 'it', 'has', 'been', 'proven', 'to', 'be', 'conservative', 'with', 'respect', 'to', 'reachability', 'of', 'states', 'then', 'an', 'unfolding', 'semantics', 'for', 'parametric', 'regulatory', 'networks', 'is', 'defined', 'taking', 'advantage', 'of', 'concurrency', 'between', 'transitions', 'to', 'provide', 'a', 'compact', 'representation', 'of', 'reachable', 'transitions', 'a', 'prototype', 'implementation', 'is', 'provided', 'it', 'has', 'been', 'applied', 'to', 'several', 'examples', 'of', 'boolean', 'and', 'multivalued', 'networks', 'showing', 'its', 'tractability', 'for', 'networks', 'with', 'numerous', 'components']]
|
[-0.1303107467386629, 0.06124916778829478, -0.0859189687774536, 0.08018789552382562, -0.1117256089746661, -0.1229245833552947, 0.05916521454734417, 0.382435076161831, -0.29939507477683946, -0.2895498901916653, 0.09139055990575191, -0.22216154941997956, -0.1326783488439105, 0.17385653005961407, -0.05766304389241365, 0.0662161840606738, 0.0687525225742623, 0.024110745688479557, -0.0691100475305196, -0.21963871188108897, 0.3260154784923846, 0.01363094733945521, 0.22723740474005658, 0.060072125777272355, 0.14996575258555822, -0.025421425261204906, -0.006346591165007946, 0.04049774484595522, -0.10604464207081794, 0.13563821924950994, 0.277606682839784, 0.21020444637300292, 0.26853132514467387, -0.4073805396910757, -0.20332205910563061, 0.1570122082036202, 0.10490934183326317, 0.09001883389828436, 0.024001938981503674, -0.31381627467635553, 0.06798965882141299, -0.16485058146281517, -0.0704916803551896, -0.13151541148787751, 0.04039347146075064, 0.016617219829640817, -0.29428072650625836, -0.041382385889543606, 0.08994885431578344, 0.0675656844008093, -0.04356295050759703, -0.10160908451386301, -0.0841368361870991, 0.120025845564669, -0.008151416632851275, 0.019789027282968163, 0.10676089166493814, -0.08992266297840008, -0.12517552487164116, 0.3978248578784284, 0.011915328177565243, -0.22819115149710947, 0.20803031097724065, -0.06665144646907113, -0.16670076345083848, 0.14008593313277137, 0.14521863332993235, 0.08704515057615936, -0.1457668445558132, 0.12377870427250552, -0.01066578022922234, 0.1520634005003861, 0.06034533287068674, 0.04499944607656895, 0.1652676061639795, 0.20781708635089066, 0.11045009866419757, 0.16140825061423433, -0.006837890565899822, -0.13547623800938405, -0.2947322213537215, -0.12167518594894015, -0.17967802632241123, 0.000620142881719706, -0.09586910178222752, -0.19178250597951774, 0.40135160503026174, 0.10931874395646446, 0.17685011804072323, 0.1005964547603071, 0.27874773967717675, 0.14681133046663794, 0.05919476449950404, 0.06712470933052828, 0.193674252554653, 0.1335932251519504, 0.04555106267798692, -0.1828437218706919, 0.15979791535573895, 0.06763662395436161]
|
1,803.06158
|
Rotor Spectra and Berry Phases in the Chiral Limit of QCD on a Torus
|
We consider the finite-volume spectra of QCD in the chiral limit of massless
up and down quarks and massive strange quarks in the baryon number sectors $B =
0$ and $B = 1$ for different values of the isospin. Spontaneous symmetry
breaking gives rise to rotor spectra, as the chiral order parameter precesses
through the vacuum manifold. Baryons of different isospin influence the motion
of the order parameter through non-trivial Berry phases and associated abstract
monopole fields. Our investigation provides detailed insights into the dynamics
of spontaneous chiral symmetry breaking in QCD on a torus. It also sheds new
light on Berry phases in the context of quantum field theory. Interestingly,
the Berry gauge field resulting from QCD solves a Yang-Mills-Chern-Simons
equation of motion on the vacuum manifold $SU(2) = S^3$.
|
hep-lat hep-th
|
we consider the finitevolume spectra of qcd in the chiral limit of massless up and down quarks and massive strange quarks in the baryon number sectors b 0 and b 1 for different values of the isospin spontaneous symmetry breaking gives rise to rotor spectra as the chiral order parameter precesses through the vacuum manifold baryons of different isospin influence the motion of the order parameter through nontrivial berry phases and associated abstract monopole fields our investigation provides detailed insights into the dynamics of spontaneous chiral symmetry breaking in qcd on a torus it also sheds new light on berry phases in the context of quantum field theory interestingly the berry gauge field resulting from qcd solves a yangmillschernsimons equation of motion on the vacuum manifold su2 s3
|
[['we', 'consider', 'the', 'finitevolume', 'spectra', 'of', 'qcd', 'in', 'the', 'chiral', 'limit', 'of', 'massless', 'up', 'and', 'down', 'quarks', 'and', 'massive', 'strange', 'quarks', 'in', 'the', 'baryon', 'number', 'sectors', 'b', '0', 'and', 'b', '1', 'for', 'different', 'values', 'of', 'the', 'isospin', 'spontaneous', 'symmetry', 'breaking', 'gives', 'rise', 'to', 'rotor', 'spectra', 'as', 'the', 'chiral', 'order', 'parameter', 'precesses', 'through', 'the', 'vacuum', 'manifold', 'baryons', 'of', 'different', 'isospin', 'influence', 'the', 'motion', 'of', 'the', 'order', 'parameter', 'through', 'nontrivial', 'berry', 'phases', 'and', 'associated', 'abstract', 'monopole', 'fields', 'our', 'investigation', 'provides', 'detailed', 'insights', 'into', 'the', 'dynamics', 'of', 'spontaneous', 'chiral', 'symmetry', 'breaking', 'in', 'qcd', 'on', 'a', 'torus', 'it', 'also', 'sheds', 'new', 'light', 'on', 'berry', 'phases', 'in', 'the', 'context', 'of', 'quantum', 'field', 'theory', 'interestingly', 'the', 'berry', 'gauge', 'field', 'resulting', 'from', 'qcd', 'solves', 'a', 'yangmillschernsimons', 'equation', 'of', 'motion', 'on', 'the', 'vacuum', 'manifold', 'su2', 's3']]
|
[-0.18233560360749834, 0.27721137922344496, -0.11522397411681595, 0.06287758045073133, -0.10152175717666978, -0.09554918221692787, 0.054098556801363884, 0.29761873157985974, -0.17201793573622126, -0.26011158656910993, 0.01609485736116767, -0.27636888454071595, -0.08968537276086863, 0.058479201597947394, 0.03593263469156227, 0.03698839583660174, -0.03739866694013472, 0.034675933260587044, -0.08473235618112085, -0.18503684205825266, 0.34356899059639545, -0.07998636035972595, 0.2564391523919767, 0.11518620380593347, 0.09360563810514577, -0.008461645595161826, 0.021067609979581903, -0.054233419985393994, -0.13131812907522544, 0.014499754717689939, 0.12616747064021183, -0.01723504743858939, 0.09220285368610348, -0.4245250670792302, -0.20862280599976657, 0.0749431565964187, 0.16006533637846587, 0.1658575625915546, -0.03944175186825305, -0.36661657943113823, 0.0429182222160307, -0.15182042513333727, -0.17999833503290574, -0.16107514238956355, -0.008339212547070929, -0.10768729048140813, -0.24984218559438887, 0.10683618905909498, 0.008076248040197243, 0.06872347108219401, -0.03586879289287026, -0.143810535693774, -0.1039869573633041, 0.07194133312077611, 0.16248703954897792, 0.07768839032723918, 0.1350298624183779, -0.2003216204320779, -0.13916575009352528, 0.4651502526248805, -0.06222084485034429, -0.17356055526033742, 0.0857273236670153, -0.15114746946005653, -0.1539934746651852, 0.17316820548876422, 0.1801383769543463, 0.10790896558319218, -0.08061490356703871, 0.17557733043440749, -0.030288516976725077, 0.1408634910485489, 0.04585037747165188, 0.0636999244125036, 0.27921225436148234, 0.12101001495648234, 0.034553129076812183, 0.1088533258116513, -0.04298443896777826, -0.1972095120945596, -0.38278935482139786, -0.14650921406973794, -0.1452172517983854, 0.13110056987352436, -0.14379370416963866, -0.11568837145750877, 0.4506919522100361, 0.10034929827452288, 0.19282117160400958, -0.030861780684290352, 0.26284024430060526, 0.07791275464842329, 0.03799524166555557, 0.030211929450160824, 0.24367634506415925, 0.2380490455761901, 0.11921939769308665, -0.3344377907778835, -0.14959129668659443, 0.11735012549615931]
|
1,803.06159
|
Generalized thermodynamics of Motility-Induced Phase Separation: Phase
equilibria, Laplace pressure, and change of ensembles
|
Motility-induced phase separation (MIPS) leads to cohesive active matter in
the absence of cohesive forces. We present, extend and illustrate a recent
generalized thermodynamic formalism which accounts for its binodal curve. Using
this formalism, we identify both a generalized surface tension, that controls
finite-size corrections to coexisting densities, and generalized forces, that
can be used to construct new thermodynamic ensembles. Our framework is based on
a nonequilibrium generalization of the Cahn-Hilliard equation and we discuss
its application to active particles interacting either via quorum-sensing
interactions or directly through pairwise forces.
|
cond-mat.stat-mech
|
motilityinduced phase separation mips leads to cohesive active matter in the absence of cohesive forces we present extend and illustrate a recent generalized thermodynamic formalism which accounts for its binodal curve using this formalism we identify both a generalized surface tension that controls finitesize corrections to coexisting densities and generalized forces that can be used to construct new thermodynamic ensembles our framework is based on a nonequilibrium generalization of the cahnhilliard equation and we discuss its application to active particles interacting either via quorumsensing interactions or directly through pairwise forces
|
[['motilityinduced', 'phase', 'separation', 'mips', 'leads', 'to', 'cohesive', 'active', 'matter', 'in', 'the', 'absence', 'of', 'cohesive', 'forces', 'we', 'present', 'extend', 'and', 'illustrate', 'a', 'recent', 'generalized', 'thermodynamic', 'formalism', 'which', 'accounts', 'for', 'its', 'binodal', 'curve', 'using', 'this', 'formalism', 'we', 'identify', 'both', 'a', 'generalized', 'surface', 'tension', 'that', 'controls', 'finitesize', 'corrections', 'to', 'coexisting', 'densities', 'and', 'generalized', 'forces', 'that', 'can', 'be', 'used', 'to', 'construct', 'new', 'thermodynamic', 'ensembles', 'our', 'framework', 'is', 'based', 'on', 'a', 'nonequilibrium', 'generalization', 'of', 'the', 'cahnhilliard', 'equation', 'and', 'we', 'discuss', 'its', 'application', 'to', 'active', 'particles', 'interacting', 'either', 'via', 'quorumsensing', 'interactions', 'or', 'directly', 'through', 'pairwise', 'forces']]
|
[-0.11450267059521543, 0.16951572108599874, -0.1623555702086176, 0.08043916676607397, -0.0669434547269096, -0.12836550113538073, 0.06882086717394284, 0.30838464403318033, -0.26438872483041553, -0.28728518022431265, -0.0006269514211453498, -0.27159200563198993, -0.2004338106011144, 0.1256133695417601, -0.013591222816871272, 0.019364902466380347, 0.004220691351737413, -0.026564530816136134, -0.07538673951704469, -0.17332472825008963, 0.3061416600158231, 0.003066390190118303, 0.26201963799798655, 0.11306818943832897, 0.09852502240488926, 0.019038192824357085, 0.023500999772093363, 0.08178448382661574, -0.18786073958892505, 0.1100896113138232, 0.1984868506875096, 0.024267131434236137, 0.20895477240491245, -0.45441908768067757, -0.28830340043124225, 0.12436264011388024, 0.13356637894952048, 0.12761091165011748, -0.030961164310833234, -0.2778036477251185, 0.025822777156200676, -0.21741934843464858, -0.16684828456491232, -0.15778364113842447, -0.009150421267582311, 0.06399635706071018, -0.24011381601707804, 0.1381830087190287, 0.025924419653084542, 0.00296897555575318, -0.10969038862579812, -0.06301682627138992, -0.017354394565336405, 0.0917808335662509, -0.0077719607933734855, -0.0038922451798700623, 0.2069558219984174, -0.10451272138549636, -0.08195147865141432, 0.39993850751779975, -0.0585867414664891, -0.20996655511359374, 0.2559917128774234, -0.03735628326733907, -0.12984007402426667, 0.11402537309461169, 0.19158168277806706, 0.10756545307942562, -0.20025778850540518, 0.04618270016960903, 0.026707241558587055, 0.14617222253905815, 0.023221275324208868, -0.04275421945171224, 0.23179761775924515, 0.1656106360981034, 0.03520263491405381, 0.20318913200947766, -0.08830420000012965, -0.17877446983216538, -0.31628493033349514, -0.14303398612416154, -0.15529797167206805, 0.009317826334800985, -0.09118343676495391, -0.17558055606205017, 0.3252259068398012, 0.16780544301469086, 0.15665686825393801, 0.057208237319719045, 0.2757118212680022, 0.07707785054291082, 0.05476813552280267, 0.04718474224209786, 0.2705677711139692, 0.16875971894090375, 0.04537982685077521, -0.26833900144815237, 0.012670220824010257, 0.11599126861741145]
|
1,803.0616
|
Fermions, differential forms and doubled geometry
|
We show that all fermions of one generation of the Standard Model (SM) can be
elegantly described by a single fixed parity (say even) inhomogeneous
real-valued differential form in seven dimensions. In this formalism the full
kinetic term of the SM fermionic Lagrangian is reproduced as the appropriate
dimensional reduction of (Psi, D Psi) where Psi is a general even degree
differential form in R^7, the inner product is as described in the main text,
and D is essentially an appropriately interpreted exterior derivative operator.
The new formalism is based on geometric constructions originating in the
subjects of generalised geometry and double field theory.
|
hep-th gr-qc
|
we show that all fermions of one generation of the standard model sm can be elegantly described by a single fixed parity say even inhomogeneous realvalued differential form in seven dimensions in this formalism the full kinetic term of the sm fermionic lagrangian is reproduced as the appropriate dimensional reduction of psi d psi where psi is a general even degree differential form in r7 the inner product is as described in the main text and d is essentially an appropriately interpreted exterior derivative operator the new formalism is based on geometric constructions originating in the subjects of generalised geometry and double field theory
|
[['we', 'show', 'that', 'all', 'fermions', 'of', 'one', 'generation', 'of', 'the', 'standard', 'model', 'sm', 'can', 'be', 'elegantly', 'described', 'by', 'a', 'single', 'fixed', 'parity', 'say', 'even', 'inhomogeneous', 'realvalued', 'differential', 'form', 'in', 'seven', 'dimensions', 'in', 'this', 'formalism', 'the', 'full', 'kinetic', 'term', 'of', 'the', 'sm', 'fermionic', 'lagrangian', 'is', 'reproduced', 'as', 'the', 'appropriate', 'dimensional', 'reduction', 'of', 'psi', 'd', 'psi', 'where', 'psi', 'is', 'a', 'general', 'even', 'degree', 'differential', 'form', 'in', 'r7', 'the', 'inner', 'product', 'is', 'as', 'described', 'in', 'the', 'main', 'text', 'and', 'd', 'is', 'essentially', 'an', 'appropriately', 'interpreted', 'exterior', 'derivative', 'operator', 'the', 'new', 'formalism', 'is', 'based', 'on', 'geometric', 'constructions', 'originating', 'in', 'the', 'subjects', 'of', 'generalised', 'geometry', 'and', 'double', 'field', 'theory']]
|
[-0.13501308668995848, 0.14835366178788087, -0.059344516150304116, 0.09314903312434371, -0.057659479191687964, -0.1607834326927192, -0.05853415624789285, 0.27550577155600947, -0.28574958469611234, -0.2735992031484784, 0.03956816400414727, -0.24512062250421598, -0.14986254135146737, 0.138107023898136, -0.05657659951919833, 0.0030426248469246696, -0.006850959871931432, 0.11231222133322333, -0.08693185704536378, -0.23578598325212413, 0.338511392928642, -0.02636701980820642, 0.19903194572543725, 0.0016005566766790042, 0.09516170501816444, 0.040208885280522876, -0.025014030227724176, 0.03216276495144344, -0.08718773066504162, 0.11266672009794722, 0.21816998611813268, 0.07750890697263038, 0.18433558040683587, -0.39323139539919794, -0.1957239189919514, 0.06194597998938452, 0.12741475839776775, 0.06761118577112658, 0.0008104495231796486, -0.2668349181051151, 0.06425008777743922, -0.18306835938165023, -0.17875973074338758, -0.06075372402735341, -0.0023836455825053584, -0.04827349937449281, -0.3041938735673634, 0.07684599031255437, 0.09559922187159267, 0.0509236158485202, -0.019231618858332064, -0.13449668428802397, -0.05279831300364234, 0.04455876941882217, 0.02004292227278571, 0.07809882615513813, 0.09674016976350686, -0.11602954110535044, -0.11833541583977282, 0.3867148627491238, -0.14494027331686363, -0.2678085860724633, 0.09993112639550908, -0.15980533111947948, -0.11691365568969139, 0.09947010106048555, 0.12385855818418069, 0.15023082230114737, -0.1583681104507727, 0.22086228334354438, -0.078546170248256, 0.1508229253007672, 0.0965995496729962, 0.008384493379428303, 0.17527429739801356, 0.11590237494741674, 0.026110117493842084, 0.11309544570058978, -0.011069307692545967, -0.1551373990906331, -0.3904271835210518, -0.16534334886994026, -0.15604168156166381, 0.08729323442094028, -0.10456348883963074, -0.15596310118696868, 0.36990975339162663, 0.04970290324854432, 0.20042164388220185, -0.0005367648801229035, 0.273552496254874, 0.1818780844758014, 0.07725374792845777, 0.013981506823956106, 0.20044656888617632, 0.14481817582810225, 0.056474953693395946, -0.18259174350308827, -0.004758059562076456, 0.11829847702504664]
|
1,803.06161
|
Evidence of Open Access of scientific publications in Google Scholar: a
large-scale analysis
|
This article uses Google Scholar (GS) as a source of data to analyse Open
Access (OA) levels across all countries and fields of research. All articles
and reviews with a DOI and published in 2009 or 2014 and covered by the three
main citation indexes in the Web of Science (2,269,022 documents) were selected
for study. The links to freely available versions of these documents displayed
in GS were collected. To differentiate between more reliable (sustainable and
legal) forms of access and less reliable ones, the data extracted from GS was
combined with information available in DOAJ, CrossRef, OpenDOAR, and ROAR. This
allowed us to distinguish the percentage of documents in our sample that are
made OA by the publisher (23.1%, including Gold, Hybrid, Delayed, and Bronze
OA) from those available as Green OA (17.6%), and those available from other
sources (40.6%, mainly due to ResearchGate). The data shows an overall free
availability of 54.6%, with important differences at the country and subject
category levels. The data extracted from GS yielded very similar results to
those found by other studies that analysed similar samples of documents, but
employed different methods to find evidence of OA, thus suggesting a relative
consistency among methods.
|
cs.DL
|
this article uses google scholar gs as a source of data to analyse open access oa levels across all countries and fields of research all articles and reviews with a doi and published in 2009 or 2014 and covered by the three main citation indexes in the web of science 2269022 documents were selected for study the links to freely available versions of these documents displayed in gs were collected to differentiate between more reliable sustainable and legal forms of access and less reliable ones the data extracted from gs was combined with information available in doaj crossref opendoar and roar this allowed us to distinguish the percentage of documents in our sample that are made oa by the publisher 231 including gold hybrid delayed and bronze oa from those available as green oa 176 and those available from other sources 406 mainly due to researchgate the data shows an overall free availability of 546 with important differences at the country and subject category levels the data extracted from gs yielded very similar results to those found by other studies that analysed similar samples of documents but employed different methods to find evidence of oa thus suggesting a relative consistency among methods
|
[['this', 'article', 'uses', 'google', 'scholar', 'gs', 'as', 'a', 'source', 'of', 'data', 'to', 'analyse', 'open', 'access', 'oa', 'levels', 'across', 'all', 'countries', 'and', 'fields', 'of', 'research', 'all', 'articles', 'and', 'reviews', 'with', 'a', 'doi', 'and', 'published', 'in', '2009', 'or', '2014', 'and', 'covered', 'by', 'the', 'three', 'main', 'citation', 'indexes', 'in', 'the', 'web', 'of', 'science', '2269022', 'documents', 'were', 'selected', 'for', 'study', 'the', 'links', 'to', 'freely', 'available', 'versions', 'of', 'these', 'documents', 'displayed', 'in', 'gs', 'were', 'collected', 'to', 'differentiate', 'between', 'more', 'reliable', 'sustainable', 'and', 'legal', 'forms', 'of', 'access', 'and', 'less', 'reliable', 'ones', 'the', 'data', 'extracted', 'from', 'gs', 'was', 'combined', 'with', 'information', 'available', 'in', 'doaj', 'crossref', 'opendoar', 'and', 'roar', 'this', 'allowed', 'us', 'to', 'distinguish', 'the', 'percentage', 'of', 'documents', 'in', 'our', 'sample', 'that', 'are', 'made', 'oa', 'by', 'the', 'publisher', '231', 'including', 'gold', 'hybrid', 'delayed', 'and', 'bronze', 'oa', 'from', 'those', 'available', 'as', 'green', 'oa', '176', 'and', 'those', 'available', 'from', 'other', 'sources', '406', 'mainly', 'due', 'to', 'researchgate', 'the', 'data', 'shows', 'an', 'overall', 'free', 'availability', 'of', '546', 'with', 'important', 'differences', 'at', 'the', 'country', 'and', 'subject', 'category', 'levels', 'the', 'data', 'extracted', 'from', 'gs', 'yielded', 'very', 'similar', 'results', 'to', 'those', 'found', 'by', 'other', 'studies', 'that', 'analysed', 'similar', 'samples', 'of', 'documents', 'but', 'employed', 'different', 'methods', 'to', 'find', 'evidence', 'of', 'oa', 'thus', 'suggesting', 'a', 'relative', 'consistency', 'among', 'methods']]
|
[-0.04250292912656732, 0.05288498111949593, -0.03405157141503878, 0.08043660144627211, -0.07007295666029677, -0.11935246075736358, 0.1252242849790491, 0.4070951339229941, -0.18691228056442924, -0.40384180163498967, 0.10086013230320531, -0.3805800535902381, -0.05042671387898736, 0.2296924971754197, -0.07282799876185891, -0.015762823353288696, 0.0895195141620934, 0.025715710100485012, -0.01982747083005961, -0.28217642642383, 0.2849448834930081, 0.0659182641422376, 0.36083893339615314, 0.020069245405029506, 0.0014537313528126105, -0.03327949010068551, -0.1865911455731839, 0.005807577988598496, -0.12176745650627709, 0.1609242670959793, 0.31070386776700615, 0.16647719696586136, 0.24677125652844553, -0.379746315595512, -0.16138010744471104, 0.023648424823768437, 0.10469990894984221, 0.06472353351535276, -0.023389109342024313, -0.3143490030663088, 0.06522292065899819, -0.2040076303522801, -0.05542862144997343, -0.031170620452994627, 0.03828954473370686, 0.055510330693796274, -0.21623279525229008, 0.06075833467068151, -0.033275153080867315, 0.11809898783685639, -0.043274239032762125, -0.18769951700465753, -0.06231910538626835, 0.22229765755473635, 0.09155078272568062, 0.056272605403792114, 0.08807375890726689, -0.11879077802645042, -0.11416985187330284, 0.382475871918723, -0.03635770612047054, -0.08153973252163269, 0.23248014975048137, -0.11484479898761492, -0.15648794919025932, 0.11874285516096279, 0.1533659632189665, 0.03815518234856427, -0.23836860727285966, -0.011382382426527329, -0.0016771156899631023, 0.20644301131076645, 0.0891700784652494, 0.007851612289668993, 0.15625912520103158, 0.09465134500991552, -0.02501503860927187, 0.12121637735224794, -0.05562475046142936, -0.04552945718052797, -0.20955497203860432, -0.09984144896734506, -0.15733246007817797, 0.022581826039822773, -0.04285176543911803, -0.1548936767751002, 0.3925934513192624, 0.17006562977447173, 0.1359755096200388, -0.015530105534853646, 0.22682799542322754, -0.031092585896258244, 0.12169491126944194, 0.1165006988728419, 0.20128890380263328, 0.03068156401044689, 0.16004079868551344, -0.0983085035532713, 0.07022380823502317, -0.02694228845415637]
|
1,803.06162
|
Logical inconsistencies in quantum mechanics
|
I show that the application of the quantum-mechanical (QM) which-way weak
measurement scheme of Vaidman may lead to logical inconsistencies. To this end,
I study weak values of projection operators. Weak values are (normalized)
amplitudes, operationally defined by a weak measurement followed by
postselection. Projector weak values have a direct physical significance. This
allows formulating an inconsistency in classical terms, viz., the contradiction
in the readings of several measuring devices. To arrive at the contradiction, I
also invoke the property of weak measurements not to collapse the wave function
but to leave the state of the system unchanged (to lowest order in the weak
measurement strength). My arguments rely entirely on basic QM rules plus
commonly accepted weak QM measurement approximations. Therefore, the
inconsistency challenges QM as such.
|
quant-ph
|
i show that the application of the quantummechanical qm whichway weak measurement scheme of vaidman may lead to logical inconsistencies to this end i study weak values of projection operators weak values are normalized amplitudes operationally defined by a weak measurement followed by postselection projector weak values have a direct physical significance this allows formulating an inconsistency in classical terms viz the contradiction in the readings of several measuring devices to arrive at the contradiction i also invoke the property of weak measurements not to collapse the wave function but to leave the state of the system unchanged to lowest order in the weak measurement strength my arguments rely entirely on basic qm rules plus commonly accepted weak qm measurement approximations therefore the inconsistency challenges qm as such
|
[['i', 'show', 'that', 'the', 'application', 'of', 'the', 'quantummechanical', 'qm', 'whichway', 'weak', 'measurement', 'scheme', 'of', 'vaidman', 'may', 'lead', 'to', 'logical', 'inconsistencies', 'to', 'this', 'end', 'i', 'study', 'weak', 'values', 'of', 'projection', 'operators', 'weak', 'values', 'are', 'normalized', 'amplitudes', 'operationally', 'defined', 'by', 'a', 'weak', 'measurement', 'followed', 'by', 'postselection', 'projector', 'weak', 'values', 'have', 'a', 'direct', 'physical', 'significance', 'this', 'allows', 'formulating', 'an', 'inconsistency', 'in', 'classical', 'terms', 'viz', 'the', 'contradiction', 'in', 'the', 'readings', 'of', 'several', 'measuring', 'devices', 'to', 'arrive', 'at', 'the', 'contradiction', 'i', 'also', 'invoke', 'the', 'property', 'of', 'weak', 'measurements', 'not', 'to', 'collapse', 'the', 'wave', 'function', 'but', 'to', 'leave', 'the', 'state', 'of', 'the', 'system', 'unchanged', 'to', 'lowest', 'order', 'in', 'the', 'weak', 'measurement', 'strength', 'my', 'arguments', 'rely', 'entirely', 'on', 'basic', 'qm', 'rules', 'plus', 'commonly', 'accepted', 'weak', 'qm', 'measurement', 'approximations', 'therefore', 'the', 'inconsistency', 'challenges', 'qm', 'as', 'such']]
|
[-0.14177413147081097, 0.11311921512526624, -0.07231961190336733, 0.1035769920617895, -0.08486061595795036, -0.15643680728317122, 0.08509762794346898, 0.30122808943269774, -0.2684345270463382, -0.2909331525588641, 0.04874280711555912, -0.25768216099288566, -0.072262575798959, 0.13104465622018324, -0.06786892219315632, 0.07088499950020832, 0.06812179760163417, 0.017317147618086892, -0.132109499309081, -0.16984683550253976, 0.33937482110741257, 0.06836891231068876, 0.2780193559738109, 0.05378197582103894, 0.08270003293364425, 0.04293549860994972, -0.03299130174491438, 0.03961805925973749, -0.0808863153891366, 0.07002558152635174, 0.22737642104129918, 0.15252978132048156, 0.29772177878476214, -0.4350598875898868, -0.16416896852024365, 0.11057263275188234, 0.08114457915871753, 0.13031915762690005, 0.01630250696598523, -0.3199573509155016, 0.0465940305548429, -0.15568799625953034, -0.1326727282774982, -0.06521803315263242, 0.014595060813007876, -0.012205158653159742, -0.2522283880134637, 0.11213111565643885, 0.06115391967432515, 0.060105268901679665, -0.011245320658076707, -0.10087528081476194, 0.07123306646826677, 0.08479870383962407, 0.04325405748386402, 0.027359831596186268, 0.13213455380991945, -0.09594590785491164, -0.1316087592558688, 0.3661216714372131, -0.046473397072077205, -0.19902389174967539, 0.16899290181117976, -0.14502357419405598, -0.1347928926570603, 0.0852710747940364, 0.03098548731941264, 0.05554292969100061, -0.1495793380363466, 0.05043656553607434, 0.012456075732302452, 0.17405277101352112, 0.07775606647555833, 0.10435927713115234, 0.20404188461725425, 0.04836772262933664, 0.014216038793165353, 0.03486531664384529, -0.031303542038585874, -0.10401977579022059, -0.4129823414477869, -0.16007932234788314, -0.1775662189538707, 0.08082067542318327, -0.03952507057579169, -0.16250107403539005, 0.31002877256023, 0.21856322604844536, 0.2153697918367925, 0.006519702746118128, 0.31493472121292143, 0.1688001206766785, 0.0591389874171, -0.03147343337695929, 0.3474573819148645, 0.17039544221188407, 0.09513144758966519, -0.19629606068701833, 0.1117608703134465, 0.07572084174535121]
|
1,803.06163
|
Unambiguous languages exhaust the index hierarchy
|
This work is a study of the expressive power of unambiguity in the case of
automata over infinite trees. An automaton is called unambiguous if it has at
most one accepting run on every input, the language of such an automaton is
called an unambiguous language. It is known that not every regular language of
infinite trees is unambiguous. Except that, very little is known about which
regular tree languages are unambiguous.
This paper answers the question whether unambiguous languages are of bounded
complexity among all regular tree languages. The notion of complexity is the
canonical one, called the (parity or Rabin-Mostowski) index hierarchy. The
answer is negative, as exhibited by a family of examples of unambiguous
languages that cannot be recognised by any alternating parity tree automata of
bounded range of priorities.
Hardness of the given examples is based on the theory of signatures in parity
games, previously studied by Walukiewicz. This theory is further developed here
to construct canonical signatures. The technical core of the article is a
parity game that compares signatures of a given pair of parity games (without
an increase in the index).
|
cs.FL
|
this work is a study of the expressive power of unambiguity in the case of automata over infinite trees an automaton is called unambiguous if it has at most one accepting run on every input the language of such an automaton is called an unambiguous language it is known that not every regular language of infinite trees is unambiguous except that very little is known about which regular tree languages are unambiguous this paper answers the question whether unambiguous languages are of bounded complexity among all regular tree languages the notion of complexity is the canonical one called the parity or rabinmostowski index hierarchy the answer is negative as exhibited by a family of examples of unambiguous languages that cannot be recognised by any alternating parity tree automata of bounded range of priorities hardness of the given examples is based on the theory of signatures in parity games previously studied by walukiewicz this theory is further developed here to construct canonical signatures the technical core of the article is a parity game that compares signatures of a given pair of parity games without an increase in the index
|
[['this', 'work', 'is', 'a', 'study', 'of', 'the', 'expressive', 'power', 'of', 'unambiguity', 'in', 'the', 'case', 'of', 'automata', 'over', 'infinite', 'trees', 'an', 'automaton', 'is', 'called', 'unambiguous', 'if', 'it', 'has', 'at', 'most', 'one', 'accepting', 'run', 'on', 'every', 'input', 'the', 'language', 'of', 'such', 'an', 'automaton', 'is', 'called', 'an', 'unambiguous', 'language', 'it', 'is', 'known', 'that', 'not', 'every', 'regular', 'language', 'of', 'infinite', 'trees', 'is', 'unambiguous', 'except', 'that', 'very', 'little', 'is', 'known', 'about', 'which', 'regular', 'tree', 'languages', 'are', 'unambiguous', 'this', 'paper', 'answers', 'the', 'question', 'whether', 'unambiguous', 'languages', 'are', 'of', 'bounded', 'complexity', 'among', 'all', 'regular', 'tree', 'languages', 'the', 'notion', 'of', 'complexity', 'is', 'the', 'canonical', 'one', 'called', 'the', 'parity', 'or', 'rabinmostowski', 'index', 'hierarchy', 'the', 'answer', 'is', 'negative', 'as', 'exhibited', 'by', 'a', 'family', 'of', 'examples', 'of', 'unambiguous', 'languages', 'that', 'can', 'not', 'be', 'recognised', 'by', 'any', 'alternating', 'parity', 'tree', 'automata', 'of', 'bounded', 'range', 'of', 'priorities', 'hardness', 'of', 'the', 'given', 'examples', 'is', 'based', 'on', 'the', 'theory', 'of', 'signatures', 'in', 'parity', 'games', 'previously', 'studied', 'by', 'walukiewicz', 'this', 'theory', 'is', 'further', 'developed', 'here', 'to', 'construct', 'canonical', 'signatures', 'the', 'technical', 'core', 'of', 'the', 'article', 'is', 'a', 'parity', 'game', 'that', 'compares', 'signatures', 'of', 'a', 'given', 'pair', 'of', 'parity', 'games', 'without', 'an', 'increase', 'in', 'the', 'index']]
|
[-0.1328325189108635, 0.14537251395544176, -0.06135714190048732, 0.12687088691052936, -0.11874882463814208, -0.17325308252737004, 0.06885304574413649, 0.3543273837320388, -0.28626032156448455, -0.2883174170951837, 0.08096099974619589, -0.25536748371702966, -0.1424062428564799, 0.16716560943756825, -0.09297183002764113, 0.00844157251428379, 0.060232839823045115, 0.12399776901547162, -0.012629534329765688, -0.24349757064276784, 0.3350108333286785, 0.050211293144871, 0.21980493688936192, 0.045959546672988426, 0.10193992099015131, -0.0278210467511108, -0.025337539339763303, 0.06625383325591289, -0.07587924042732637, 0.0741799222493283, 0.3154519293506546, 0.23335378279505425, 0.26351211090182897, -0.35745402392358444, -0.14928780332461453, 0.16610326677703707, 0.10045860862980287, 0.11817822078176375, -0.028395454450719868, -0.22085352514367845, 0.13599219108194424, -0.18722191110755954, -0.07197733106899751, -0.024808325178960644, 0.0865219154262117, -0.029799781127453403, -0.20965592645258993, -0.025927575532391313, 0.16226551205624468, 0.10308646775348476, -0.01103252847309387, -0.09283509723861855, -0.014778733062533238, 0.11361577895854319, -0.016843063869971416, 0.0271373383803096, 0.038652402721468616, -0.09848916075419063, -0.2579424586245623, 0.3652581746339497, -0.03679755554293041, -0.20840061984207264, 0.20227161813379516, -0.08171955026222993, -0.1891197702328788, 0.11668101032436998, 0.07781116554769811, 0.12912744295502465, -0.11333950035392291, 0.1524131538385831, -0.1619392360545813, 0.24840374532150766, 0.13363179399893083, 0.021148476340665072, 0.1959039696945597, 0.1799093735399385, 0.09244313001171957, 0.16397790796500408, 0.0396562055216501, -0.060450574661550856, -0.2844997493688155, -0.15423195226679717, -0.16239245470536862, 0.011386549169420654, -0.038498114063971176, -0.2441938573878909, 0.40027090647410624, 0.10072185066356151, 0.13017615924771658, 0.13984304169382625, 0.2752576446131108, 0.1230515458777537, 0.047316659495687835, 0.060745726711555294, 0.12413812178389105, 0.11901358621830624, 0.04840327023680041, -0.18285895190688303, 0.15202139092796535, 0.10374344778958605]
|
1,803.06164
|
Strings and missing wormhole entanglement
|
I show that holographic calculations of entanglement entropy in the context
of AdS bulk space modified by wormhole geometries provide the expected
entanglement magnitude. This arises in the context of string theory by means of
additional geometric structure that is seen by the string in its bulk
evolution. The process can be described as a net entanglement flow towards
stringy geometry. I make use of the fact that as opposed to quantum field
theory, strings have additional winding mode states around small extra
dimensions which modify the area computation given by the standard application
of the Ryu-Takayanagi entanglement entropy formula.
|
hep-th
|
i show that holographic calculations of entanglement entropy in the context of ads bulk space modified by wormhole geometries provide the expected entanglement magnitude this arises in the context of string theory by means of additional geometric structure that is seen by the string in its bulk evolution the process can be described as a net entanglement flow towards stringy geometry i make use of the fact that as opposed to quantum field theory strings have additional winding mode states around small extra dimensions which modify the area computation given by the standard application of the ryutakayanagi entanglement entropy formula
|
[['i', 'show', 'that', 'holographic', 'calculations', 'of', 'entanglement', 'entropy', 'in', 'the', 'context', 'of', 'ads', 'bulk', 'space', 'modified', 'by', 'wormhole', 'geometries', 'provide', 'the', 'expected', 'entanglement', 'magnitude', 'this', 'arises', 'in', 'the', 'context', 'of', 'string', 'theory', 'by', 'means', 'of', 'additional', 'geometric', 'structure', 'that', 'is', 'seen', 'by', 'the', 'string', 'in', 'its', 'bulk', 'evolution', 'the', 'process', 'can', 'be', 'described', 'as', 'a', 'net', 'entanglement', 'flow', 'towards', 'stringy', 'geometry', 'i', 'make', 'use', 'of', 'the', 'fact', 'that', 'as', 'opposed', 'to', 'quantum', 'field', 'theory', 'strings', 'have', 'additional', 'winding', 'mode', 'states', 'around', 'small', 'extra', 'dimensions', 'which', 'modify', 'the', 'area', 'computation', 'given', 'by', 'the', 'standard', 'application', 'of', 'the', 'ryutakayanagi', 'entanglement', 'entropy', 'formula']]
|
[-0.12787711650045822, 0.17075059609487653, -0.10890304237604141, 0.09924950802067542, -0.03307313568890095, -0.1459855153504759, 0.015712230536155402, 0.26905350459739563, -0.25317779038101434, -0.2973224110994488, 0.07263755955849774, -0.25986060964874924, -0.14602546938229352, 0.1363564498606138, -0.08101591497101253, 0.04567983251821715, 0.009209911848884075, 0.06059960668237181, -0.059056588753592223, -0.23018294260138647, 0.3559239419084042, 0.07876283981255255, 0.3086866916366853, 0.0524820966355037, 0.05782948397332802, 0.011810460989363492, -0.011913060527294874, 0.09458775278035318, -0.16614091695628302, 0.14636120612442027, 0.22382863881997764, 0.12047279555350542, 0.15934311837656423, -0.4644064364023507, -0.29433676235377787, 0.042962997870054094, 0.15403626651037483, 0.15857875896035695, -0.026666511446237565, -0.25496428295969964, 0.03730122286826372, -0.20416950735263525, -0.1720182127971202, -0.10055869243107736, 0.031571736970217895, -0.09339803698472679, -0.16078691772941966, 0.09867237305268645, 0.06115064392797649, 0.025513519194719267, -0.009034188297810032, -0.009769662369508296, -0.06865617483388632, 0.09316660439129919, 0.09287903401738731, 0.05508851463906467, 0.16862231620121748, -0.1583771330374293, -0.1672513154288754, 0.325204823683016, -0.08733699997887015, -0.19669310081750155, 0.11081640250980854, -0.12272703988477587, -0.07824448039755225, 0.09325036904774606, 0.09023684291169047, 0.1281195694208145, -0.09528535671590362, 0.1657097585779411, -0.024348269529873505, 0.1343181310966611, 0.09911839490756393, 0.11673269573249855, 0.2748732611699961, 0.06571349404635839, 0.04197550317738205, 0.229480361425085, -0.03801505886483938, -0.161722976770252, -0.39054515887750313, -0.21203572255093606, -0.2297732256175368, 0.09855214470764623, -0.1517043245851528, -0.1533331603743136, 0.3418357669049874, 0.0981718574417755, 0.18962949044071137, 0.0017976722947787493, 0.2528247378207743, 0.1182544386270456, 0.10363523767329752, 0.06998216312844306, 0.2668636778835207, 0.10648686458356678, 0.1103010095981881, -0.25430263596237634, 0.007482084636576474, 0.1384201781777665]
|
1,803.06165
|
Resolving the polarized dust emission of the disk around the massive
star powering the HH~80-81 radio jet
|
Here we present deep (16 mumJy), very high (40 mas) angular resolution 1.14
mm, polarimetric, Atacama Large Millimeter/submillimeter Array (ALMA)
observations towards the massive protostar driving the HH 80-81 radio jet. The
observations clearly resolve the disk oriented perpendicular to the radio jet,
with a radius of ~0.171 arcsec (~291 au at 1.7 kpc distance). The continuum
brightness temperature, the intensity profile, and the polarization properties
clearly indicate that the disk is optically thick for a radius of R<170 au. The
linear polarization of the dust emission is detected almost all along the disk
and its properties suggest that dust polarization is produced mainly by
self-scattering. However, the polarization pattern presents a clear
differentiation between the inner (optically thick) part of the disk and the
outer (optically thin) region of the disk, with a sharp transition that occurs
at a radius of 0.1 arcsec (~170 au). The polarization characteristics of the
inner disk suggest that dust settling has not occurred yet with a maximum dust
grain size between 50 and 500 mum. The outer part of the disk has a clear
azimuthal pattern but with a significantly higher polarization fraction
compared to the inner disk. This pattern is broadly consistent with
self-scattering of a radiation field that is beamed radially outward, as
expected in the optically thin outer region, although contribution from
non-spherical grains aligned with respect to the radiative flux cannot be
excluded.
|
astro-ph.SR astro-ph.GA
|
here we present deep 16 mumjy very high 40 mas angular resolution 114 mm polarimetric atacama large millimetersubmillimeter array alma observations towards the massive protostar driving the hh 8081 radio jet the observations clearly resolve the disk oriented perpendicular to the radio jet with a radius of 0171 arcsec 291 au at 17 kpc distance the continuum brightness temperature the intensity profile and the polarization properties clearly indicate that the disk is optically thick for a radius of r170 au the linear polarization of the dust emission is detected almost all along the disk and its properties suggest that dust polarization is produced mainly by selfscattering however the polarization pattern presents a clear differentiation between the inner optically thick part of the disk and the outer optically thin region of the disk with a sharp transition that occurs at a radius of 01 arcsec 170 au the polarization characteristics of the inner disk suggest that dust settling has not occurred yet with a maximum dust grain size between 50 and 500 mum the outer part of the disk has a clear azimuthal pattern but with a significantly higher polarization fraction compared to the inner disk this pattern is broadly consistent with selfscattering of a radiation field that is beamed radially outward as expected in the optically thin outer region although contribution from nonspherical grains aligned with respect to the radiative flux cannot be excluded
|
[['here', 'we', 'present', 'deep', '16', 'mumjy', 'very', 'high', '40', 'mas', 'angular', 'resolution', '114', 'mm', 'polarimetric', 'atacama', 'large', 'millimetersubmillimeter', 'array', 'alma', 'observations', 'towards', 'the', 'massive', 'protostar', 'driving', 'the', 'hh', '8081', 'radio', 'jet', 'the', 'observations', 'clearly', 'resolve', 'the', 'disk', 'oriented', 'perpendicular', 'to', 'the', 'radio', 'jet', 'with', 'a', 'radius', 'of', '0171', 'arcsec', '291', 'au', 'at', '17', 'kpc', 'distance', 'the', 'continuum', 'brightness', 'temperature', 'the', 'intensity', 'profile', 'and', 'the', 'polarization', 'properties', 'clearly', 'indicate', 'that', 'the', 'disk', 'is', 'optically', 'thick', 'for', 'a', 'radius', 'of', 'r170', 'au', 'the', 'linear', 'polarization', 'of', 'the', 'dust', 'emission', 'is', 'detected', 'almost', 'all', 'along', 'the', 'disk', 'and', 'its', 'properties', 'suggest', 'that', 'dust', 'polarization', 'is', 'produced', 'mainly', 'by', 'selfscattering', 'however', 'the', 'polarization', 'pattern', 'presents', 'a', 'clear', 'differentiation', 'between', 'the', 'inner', 'optically', 'thick', 'part', 'of', 'the', 'disk', 'and', 'the', 'outer', 'optically', 'thin', 'region', 'of', 'the', 'disk', 'with', 'a', 'sharp', 'transition', 'that', 'occurs', 'at', 'a', 'radius', 'of', '01', 'arcsec', '170', 'au', 'the', 'polarization', 'characteristics', 'of', 'the', 'inner', 'disk', 'suggest', 'that', 'dust', 'settling', 'has', 'not', 'occurred', 'yet', 'with', 'a', 'maximum', 'dust', 'grain', 'size', 'between', '50', 'and', '500', 'mum', 'the', 'outer', 'part', 'of', 'the', 'disk', 'has', 'a', 'clear', 'azimuthal', 'pattern', 'but', 'with', 'a', 'significantly', 'higher', 'polarization', 'fraction', 'compared', 'to', 'the', 'inner', 'disk', 'this', 'pattern', 'is', 'broadly', 'consistent', 'with', 'selfscattering', 'of', 'a', 'radiation', 'field', 'that', 'is', 'beamed', 'radially', 'outward', 'as', 'expected', 'in', 'the', 'optically', 'thin', 'outer', 'region', 'although', 'contribution', 'from', 'nonspherical', 'grains', 'aligned', 'with', 'respect', 'to', 'the', 'radiative', 'flux', 'can', 'not', 'be', 'excluded']]
|
[-0.0843878525114625, 0.12602660476425942, -0.042140254167272295, 0.011957490844692028, -0.07246190424840658, -0.06382684879326721, -0.021619550455081807, 0.4794202807954964, -0.23669159920352048, -0.32188475451880844, 0.08678268677756878, -0.2524964717124857, 0.025382012604483976, 0.14329846600238474, 0.0014159584122388539, -0.0399185654819921, 0.03911909824756849, -0.15598137165887418, -0.030574263371787005, -0.12721924986710267, 0.258389767857924, 0.13631012859989594, 0.1515104364585771, 0.0424473221908931, 0.05123926318838169, -0.13241110041052054, -0.03143790722804648, -0.0024632675765090236, -0.12932310049408222, 0.06993448320184655, 0.2114701319212102, 0.036533779530614104, 0.17481761987724787, -0.3740680445237445, -0.19748992496070175, 0.008760729196077701, 0.1746208763980135, 0.020726671077654787, -0.02532616511382994, -0.2219253345702419, 0.09090714313263722, -0.16133601984304932, -0.2273004356623815, 0.14646101488368066, 0.09910473443993444, -0.049613193053724206, -0.23410190459063013, 0.13054882480299237, 0.08655027953718984, 0.09638371816816312, -0.08017927105988219, -0.13009244540022774, -0.10925930306763096, 0.028290602247142773, 0.02217219344564102, 0.1391445672676135, 0.2580950428479923, -0.09753724956753076, -0.032980611121138086, 0.34583505775975343, -0.09493142350071186, -0.036396516944169836, 0.20655263783090425, -0.302587691409955, -0.08844793728320928, 0.26611637119043924, 0.14406155094006218, 0.13347216940768736, -0.09119533987460027, 0.012691079304141867, -0.06919106632688926, 0.28643755626349104, 0.10419675821334508, 0.05878541484083421, 0.3908600991036215, 0.10991151948947092, 0.048754336716619204, 0.15562765813350693, -0.28590396438353566, -0.0551676607107176, -0.24874133521255282, -0.10644883926969836, -0.14787016225461108, 0.08437012458710268, -0.16683830471300667, -0.11835872073250107, 0.31040338503372705, 0.08292162544873459, 0.2558741130678247, 0.04340004385548919, 0.3394614960263831, 0.027107137781737747, 0.13675572887930396, 0.15891375470218996, 0.3657974817314437, 0.18677924230795698, 0.14171615295882073, -0.22943125762716896, 0.08896345163639555, -0.06907318800072237]
|
1,803.06166
|
Evidence of energy and charge sign dependence of the recovery time for
the December 2006 Forbush event measured by the PAMELA experiment
|
New results on the short-term galactic cosmic ray (GCR) intensity variation
(Forbush decrease) in December 2006 measured by the PAMELA instrument are
presented. Forbush decreases are sudden suppressions of the GCR intensities
which are associated with the passage of interplanetary transients such as
shocks and interplanetary coronal mass ejections (ICMEs). Most of the past
measurements of this phenomenon were carried out with ground-based detectors
such as neutron monitors or muon telescopes. These techniques allow only the
indirect detection of the overall GCR intensity over an integrated energy
range. For the first time, thanks to the unique features of the PAMELA magnetic
spectrometer, the Forbush decrease commencing on 2006 December 14, following a
CME at the Sun on 2006 December 13 was studied in a wide rigidity range (0.4 -
20 GV) and for different species of GCRs detected directly in space. The daily
averaged GCR proton intensity was used to investigate the rigidity dependence
of the amplitude and the recovery time of the Forbush decrease. Additionally,
for the first time, the temporal variations in the helium and electron
intensities during a Forbush decrease were studied. Interestingly, the temporal
evolutions of the helium and proton intensities during the Forbush decrease
were found in good agreement, while the low rigidity electrons (< 2 GV)
displayed a faster recovery. This difference in the electron recovery is
interpreted as a charge-sign dependence introduced by drift motions experienced
by the GCRs during their propagation through the heliosphere.
|
astro-ph.HE physics.space-ph
|
new results on the shortterm galactic cosmic ray gcr intensity variation forbush decrease in december 2006 measured by the pamela instrument are presented forbush decreases are sudden suppressions of the gcr intensities which are associated with the passage of interplanetary transients such as shocks and interplanetary coronal mass ejections icmes most of the past measurements of this phenomenon were carried out with groundbased detectors such as neutron monitors or muon telescopes these techniques allow only the indirect detection of the overall gcr intensity over an integrated energy range for the first time thanks to the unique features of the pamela magnetic spectrometer the forbush decrease commencing on 2006 december 14 following a cme at the sun on 2006 december 13 was studied in a wide rigidity range 04 20 gv and for different species of gcrs detected directly in space the daily averaged gcr proton intensity was used to investigate the rigidity dependence of the amplitude and the recovery time of the forbush decrease additionally for the first time the temporal variations in the helium and electron intensities during a forbush decrease were studied interestingly the temporal evolutions of the helium and proton intensities during the forbush decrease were found in good agreement while the low rigidity electrons 2 gv displayed a faster recovery this difference in the electron recovery is interpreted as a chargesign dependence introduced by drift motions experienced by the gcrs during their propagation through the heliosphere
|
[['new', 'results', 'on', 'the', 'shortterm', 'galactic', 'cosmic', 'ray', 'gcr', 'intensity', 'variation', 'forbush', 'decrease', 'in', 'december', '2006', 'measured', 'by', 'the', 'pamela', 'instrument', 'are', 'presented', 'forbush', 'decreases', 'are', 'sudden', 'suppressions', 'of', 'the', 'gcr', 'intensities', 'which', 'are', 'associated', 'with', 'the', 'passage', 'of', 'interplanetary', 'transients', 'such', 'as', 'shocks', 'and', 'interplanetary', 'coronal', 'mass', 'ejections', 'icmes', 'most', 'of', 'the', 'past', 'measurements', 'of', 'this', 'phenomenon', 'were', 'carried', 'out', 'with', 'groundbased', 'detectors', 'such', 'as', 'neutron', 'monitors', 'or', 'muon', 'telescopes', 'these', 'techniques', 'allow', 'only', 'the', 'indirect', 'detection', 'of', 'the', 'overall', 'gcr', 'intensity', 'over', 'an', 'integrated', 'energy', 'range', 'for', 'the', 'first', 'time', 'thanks', 'to', 'the', 'unique', 'features', 'of', 'the', 'pamela', 'magnetic', 'spectrometer', 'the', 'forbush', 'decrease', 'commencing', 'on', '2006', 'december', '14', 'following', 'a', 'cme', 'at', 'the', 'sun', 'on', '2006', 'december', '13', 'was', 'studied', 'in', 'a', 'wide', 'rigidity', 'range', '04', '20', 'gv', 'and', 'for', 'different', 'species', 'of', 'gcrs', 'detected', 'directly', 'in', 'space', 'the', 'daily', 'averaged', 'gcr', 'proton', 'intensity', 'was', 'used', 'to', 'investigate', 'the', 'rigidity', 'dependence', 'of', 'the', 'amplitude', 'and', 'the', 'recovery', 'time', 'of', 'the', 'forbush', 'decrease', 'additionally', 'for', 'the', 'first', 'time', 'the', 'temporal', 'variations', 'in', 'the', 'helium', 'and', 'electron', 'intensities', 'during', 'a', 'forbush', 'decrease', 'were', 'studied', 'interestingly', 'the', 'temporal', 'evolutions', 'of', 'the', 'helium', 'and', 'proton', 'intensities', 'during', 'the', 'forbush', 'decrease', 'were', 'found', 'in', 'good', 'agreement', 'while', 'the', 'low', 'rigidity', 'electrons', '2', 'gv', 'displayed', 'a', 'faster', 'recovery', 'this', 'difference', 'in', 'the', 'electron', 'recovery', 'is', 'interpreted', 'as', 'a', 'chargesign', 'dependence', 'introduced', 'by', 'drift', 'motions', 'experienced', 'by', 'the', 'gcrs', 'during', 'their', 'propagation', 'through', 'the', 'heliosphere']]
|
[-0.08854922476069381, 0.2442490723532804, -0.030233046648997213, 0.11832850557160175, -0.005317917637876235, -0.021404912414436695, -0.0015922471318238725, 0.4159678987460211, -0.22214839100876513, -0.4120580830223238, 0.04715961099500419, -0.3121875588723924, -0.06958396176826985, 0.21082430813233563, -0.035902054908607775, 0.029007540044161336, 0.08962332796266613, -0.0006454035164400314, -0.07764926075275677, -0.22568530853653404, 0.17765349839658787, 0.20054091228291024, 0.24206082468153908, 0.06052221968517794, 0.08884311206735826, -0.008706778548851919, -0.0901406434684759, -0.0126669764941956, -0.09500038428717138, 0.03670830653572921, 0.21731796379657073, 0.10876367173974964, 0.1802577112694659, -0.445845066724966, -0.277324748004321, 0.07261700526857263, 0.1143855548017503, -0.0336299730828614, -0.02237249204724018, -0.28781776579562574, 0.011289669041677068, -0.16291418808784025, -0.11668071656119233, 0.06218529623389865, 0.060740044736303386, 0.09151227501497487, -0.2128729693843828, 0.11168441902652072, 0.015458508173469453, 0.11175564773924028, -0.1379498364321383, -0.08164458181515026, -0.022795370063977315, 0.1111941625199203, 0.14066811991797296, 0.06748456920516523, 0.1728054512932431, -0.06081058342436639, -0.10369593936241775, 0.32761921229539437, -0.09383805310062598, 0.005246806602432722, 0.16774362562088452, -0.23935742995466475, -0.1385285346749394, 0.2377317660827733, 0.18063496727942643, 0.06257032316158681, -0.13684264320569733, 0.006593037214164117, 0.022135436399063717, 0.16140629974882661, 0.13348939015025582, -0.018167637898083438, 0.18976901469092505, 0.14707599667744944, 0.07002679527310345, 0.06001827065192629, -0.25992205587802647, -0.005982158307839806, -0.2684035831131041, -0.12017374437515779, -0.09831324710588281, 0.04145059727986033, -0.07938070431088515, -0.10264701615039182, 0.42972546848274457, 0.10348425192666279, 0.22227670664142352, -0.01807182158663636, 0.27848974607283405, 0.10199440454307478, 0.033097268979569584, 0.09027217588397131, 0.3334684096921895, 0.15578107349574566, 0.2541225885705595, -0.25055234644629915, 0.11825283186820647, 0.040864312266542885]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.