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.09567
|
The Arches cluster revisited: I. Data presentation and stellar census
|
Located within the central region of the Galaxy, the Arches cluster appears
to be one of the youngest, densest and most massive stellar aggregates within
the Milky Way. As such it has the potential to be a uniquely instructive
laboratory for the study of star formation in extreme environments and the
physics of very massive stars. In order to determine the fundamental physical
properties of both cluster and constituent stars, we provide and analyse new
HST+VLT near-IR datasets. Stacking multiple epochs of spectroscopy results in
the deepest view of the cluster ever obtained, allowing us to to identify
candidate giant and main sequence stars for the first time. All cluster members
are found to be WNLh or O stars, with the smooth and continuous progression in
spectral morphologies from O super-/hypergiants through to the WNLh cohort
implying a direct evolutionary connection. Importantly no H-free Wolf-Rayets
are found, while no products of binary interaction/mass-transfer may be
unambiguously identified, despite the presence of massive binaries within the
Arches. We infer a main sequence turn-off around O4-5V, corresponding to
~30-38Msun, while the eclipsing binary F2 implies current masses of ~80Msun and
~60Msun for the WNLh and O hypergiant cohorts, respectively. A cluster age of
~2-3Myr is suggested by the location of the main-sequence turn-off. While the
absence of H-free Wolf-Rayets argues against the prior occurrence of SNe, such
an age does accommodate such events for exceptionally massive stars. Future
progress requires quantitative analysis of cluster members combined with
additional spectroscopic observations to better constrain the binary
population; nevertheless it is already abundantly clear that the Arches offers
an unprecedented insight into the formation, evolution and death of the most
massive stars Nature allows to form in the local universe (Abridged).
|
astro-ph.SR astro-ph.GA
|
located within the central region of the galaxy the arches cluster appears to be one of the youngest densest and most massive stellar aggregates within the milky way as such it has the potential to be a uniquely instructive laboratory for the study of star formation in extreme environments and the physics of very massive stars in order to determine the fundamental physical properties of both cluster and constituent stars we provide and analyse new hstvlt nearir datasets stacking multiple epochs of spectroscopy results in the deepest view of the cluster ever obtained allowing us to to identify candidate giant and main sequence stars for the first time all cluster members are found to be wnlh or o stars with the smooth and continuous progression in spectral morphologies from o superhypergiants through to the wnlh cohort implying a direct evolutionary connection importantly no hfree wolfrayets are found while no products of binary interactionmasstransfer may be unambiguously identified despite the presence of massive binaries within the arches we infer a main sequence turnoff around o45v corresponding to 3038msun while the eclipsing binary f2 implies current masses of 80msun and 60msun for the wnlh and o hypergiant cohorts respectively a cluster age of 23myr is suggested by the location of the mainsequence turnoff while the absence of hfree wolfrayets argues against the prior occurrence of sne such an age does accommodate such events for exceptionally massive stars future progress requires quantitative analysis of cluster members combined with additional spectroscopic observations to better constrain the binary population nevertheless it is already abundantly clear that the arches offers an unprecedented insight into the formation evolution and death of the most massive stars nature allows to form in the local universe abridged
|
[['located', 'within', 'the', 'central', 'region', 'of', 'the', 'galaxy', 'the', 'arches', 'cluster', 'appears', 'to', 'be', 'one', 'of', 'the', 'youngest', 'densest', 'and', 'most', 'massive', 'stellar', 'aggregates', 'within', 'the', 'milky', 'way', 'as', 'such', 'it', 'has', 'the', 'potential', 'to', 'be', 'a', 'uniquely', 'instructive', 'laboratory', 'for', 'the', 'study', 'of', 'star', 'formation', 'in', 'extreme', 'environments', 'and', 'the', 'physics', 'of', 'very', 'massive', 'stars', 'in', 'order', 'to', 'determine', 'the', 'fundamental', 'physical', 'properties', 'of', 'both', 'cluster', 'and', 'constituent', 'stars', 'we', 'provide', 'and', 'analyse', 'new', 'hstvlt', 'nearir', 'datasets', 'stacking', 'multiple', 'epochs', 'of', 'spectroscopy', 'results', 'in', 'the', 'deepest', 'view', 'of', 'the', 'cluster', 'ever', 'obtained', 'allowing', 'us', 'to', 'to', 'identify', 'candidate', 'giant', 'and', 'main', 'sequence', 'stars', 'for', 'the', 'first', 'time', 'all', 'cluster', 'members', 'are', 'found', 'to', 'be', 'wnlh', 'or', 'o', 'stars', 'with', 'the', 'smooth', 'and', 'continuous', 'progression', 'in', 'spectral', 'morphologies', 'from', 'o', 'superhypergiants', 'through', 'to', 'the', 'wnlh', 'cohort', 'implying', 'a', 'direct', 'evolutionary', 'connection', 'importantly', 'no', 'hfree', 'wolfrayets', 'are', 'found', 'while', 'no', 'products', 'of', 'binary', 'interactionmasstransfer', 'may', 'be', 'unambiguously', 'identified', 'despite', 'the', 'presence', 'of', 'massive', 'binaries', 'within', 'the', 'arches', 'we', 'infer', 'a', 'main', 'sequence', 'turnoff', 'around', 'o45v', 'corresponding', 'to', '3038msun', 'while', 'the', 'eclipsing', 'binary', 'f2', 'implies', 'current', 'masses', 'of', '80msun', 'and', '60msun', 'for', 'the', 'wnlh', 'and', 'o', 'hypergiant', 'cohorts', 'respectively', 'a', 'cluster', 'age', 'of', '23myr', 'is', 'suggested', 'by', 'the', 'location', 'of', 'the', 'mainsequence', 'turnoff', 'while', 'the', 'absence', 'of', 'hfree', 'wolfrayets', 'argues', 'against', 'the', 'prior', 'occurrence', 'of', 'sne', 'such', 'an', 'age', 'does', 'accommodate', 'such', 'events', 'for', 'exceptionally', 'massive', 'stars', 'future', 'progress', 'requires', 'quantitative', 'analysis', 'of', 'cluster', 'members', 'combined', 'with', 'additional', 'spectroscopic', 'observations', 'to', 'better', 'constrain', 'the', 'binary', 'population', 'nevertheless', 'it', 'is', 'already', 'abundantly', 'clear', 'that', 'the', 'arches', 'offers', 'an', 'unprecedented', 'insight', 'into', 'the', 'formation', 'evolution', 'and', 'death', 'of', 'the', 'most', 'massive', 'stars', 'nature', 'allows', 'to', 'form', 'in', 'the', 'local', 'universe', 'abridged']]
|
[-0.06978973088759585, 0.09383475937978002, -0.08023000966281967, 0.09690752244762521, -0.11585936343944664, -0.05812457206507101, 0.09517799736353971, 0.37798184164343995, -0.1770488842296974, -0.35574508703426055, 0.06127439460722096, -0.2646767891347858, -0.05611291049248109, 0.1773105074151201, -0.0397358449418073, -0.0471366383548139, 0.11388250155616321, 0.01852961213434039, -0.008179933298998413, -0.27591575000927193, 0.3145546549733015, 0.04561909362805862, 0.14055267229663038, -0.0483031335826765, 0.021767807342541398, -0.059354352469205965, -0.06402293870581399, -0.030749637641508877, -0.1154738255060067, 0.066453812196182, 0.24658511249110737, 0.17177770818126573, 0.246937104147456, -0.3608827886918018, -0.20012157841140557, 0.08387123675379532, 0.23023569952066597, 0.06271274633428407, -0.07151780325460333, -0.2697330396853599, 0.11656793194555873, -0.15167769725708594, -0.1945664782047351, 0.0283096910791091, 0.05599280578540044, 0.020782951096936415, -0.23284082036425777, 0.1198172277468752, 0.01892139837443036, 0.051978006757505184, -0.11333034498925017, -0.13056300249915068, -0.06604240966196244, 0.1463283908492324, 0.013695266686878597, 0.06518200276327049, 0.1094507035846386, -0.15283093469280168, -0.047871352632444165, 0.4082786074661194, -0.03794325639350102, 0.005789160176926682, 0.27868537323760756, -0.2056101318770782, -0.20116131743317114, 0.10481794219850464, 0.12522237502940078, 0.13122791014628235, -0.20481500962207502, 0.0029581277051210692, 0.011722118125614175, 0.1914216784854479, 0.052369434175953425, 0.07645408505849839, 0.3378800090085732, 0.1554916765398828, 0.02816038198954036, 0.1023606534655939, -0.17356654709115862, -0.09497768957339597, -0.21067398358553363, -0.14608206675146007, -0.10740500805504845, 0.05276551245606888, -0.13872057693608555, -0.1624833981585788, 0.3324835195878177, 0.10472044501831781, 0.2017009097336402, 0.004359025940801024, 0.23750899496970448, 0.056451173339465116, 0.1405251374095018, 0.10080113704316318, 0.2719242090478222, 0.19450448709044685, 0.0501312551623543, -0.23937020003993778, 0.10265291928551457, -0.01913832836447561]
|
1,803.09568
|
Low Mach number limit of some staggered schemes for compressible
barotropic flows
|
In this paper, we study the behaviour at low Mach number of numerical schemes
based on staggered discretizations for the barotropic Navier-Stokes equations.
Three time discretizations are considered: the implicit-in-time scheme and two
non-iterative pressure correction schemes. The last two schemes differ by the
discretization of the convection term: linearly implicit for the first one, so
the resulting scheme is unconditionnally stable, and explicit for the second
one, so the scheme is stable under a CFL condition involving the material
velocity only. We rigorously prove that these three variants are asymptotic
preserving in the following sense: for a given mesh and a given time step, a
sequence of solutions obtained with a sequence of vanishing Mach numbers tend
to a solution of a standard scheme for incompressible flows. This convergence
result is obtained by mimicking the proof already known in the continuous case.
|
math.NA math.AP physics.class-ph
|
in this paper we study the behaviour at low mach number of numerical schemes based on staggered discretizations for the barotropic navierstokes equations three time discretizations are considered the implicitintime scheme and two noniterative pressure correction schemes the last two schemes differ by the discretization of the convection term linearly implicit for the first one so the resulting scheme is unconditionnally stable and explicit for the second one so the scheme is stable under a cfl condition involving the material velocity only we rigorously prove that these three variants are asymptotic preserving in the following sense for a given mesh and a given time step a sequence of solutions obtained with a sequence of vanishing mach numbers tend to a solution of a standard scheme for incompressible flows this convergence result is obtained by mimicking the proof already known in the continuous case
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'behaviour', 'at', 'low', 'mach', 'number', 'of', 'numerical', 'schemes', 'based', 'on', 'staggered', 'discretizations', 'for', 'the', 'barotropic', 'navierstokes', 'equations', 'three', 'time', 'discretizations', 'are', 'considered', 'the', 'implicitintime', 'scheme', 'and', 'two', 'noniterative', 'pressure', 'correction', 'schemes', 'the', 'last', 'two', 'schemes', 'differ', 'by', 'the', 'discretization', 'of', 'the', 'convection', 'term', 'linearly', 'implicit', 'for', 'the', 'first', 'one', 'so', 'the', 'resulting', 'scheme', 'is', 'unconditionnally', 'stable', 'and', 'explicit', 'for', 'the', 'second', 'one', 'so', 'the', 'scheme', 'is', 'stable', 'under', 'a', 'cfl', 'condition', 'involving', 'the', 'material', 'velocity', 'only', 'we', 'rigorously', 'prove', 'that', 'these', 'three', 'variants', 'are', 'asymptotic', 'preserving', 'in', 'the', 'following', 'sense', 'for', 'a', 'given', 'mesh', 'and', 'a', 'given', 'time', 'step', 'a', 'sequence', 'of', 'solutions', 'obtained', 'with', 'a', 'sequence', 'of', 'vanishing', 'mach', 'numbers', 'tend', 'to', 'a', 'solution', 'of', 'a', 'standard', 'scheme', 'for', 'incompressible', 'flows', 'this', 'convergence', 'result', 'is', 'obtained', 'by', 'mimicking', 'the', 'proof', 'already', 'known', 'in', 'the', 'continuous', 'case']]
|
[-0.17512151386614863, 0.09833833004732231, -0.1008742201448112, 0.042090167959832905, -0.02251041341748844, -0.13974734849355125, 0.033892833605779896, 0.32917814654252536, -0.2798872500351936, -0.26571573893103256, 0.14119394876071417, -0.20548521794730445, -0.09151513721318459, 0.19848672496610797, -0.05621413738870589, 0.08887918494882753, 0.06899012638242928, 0.005426887305570649, -0.07853078504640063, -0.27740273723652314, 0.36066232512255647, -0.0298195178653081, 0.27195113995666065, -0.002587048596152189, 0.15631333818020937, -0.09873423057158927, -0.046185569310157035, 0.04077221145299817, -0.13712765688877074, 0.05615676441913718, 0.19838279957876548, 0.018479699588621317, 0.30767291351840215, -0.3983160609223105, -0.20944420480775042, 0.061992674477404905, 0.1479440558232836, 0.1440505291354823, -0.0539100056007778, -0.22141648893296667, 0.13089227842385195, -0.16210360908587756, -0.1486089782190177, -0.06265421019593527, -0.02483001941085591, 0.061693308375111514, -0.30702489264100996, 0.07351459119911793, 0.07269616154107181, 0.04446519720872825, -0.06926323976156047, -0.09273895467354727, -0.010769300351661818, 0.08626136938240249, 0.0760714584966418, -0.008453540896371632, 0.007110082124314317, -0.11009730782581272, -0.06336656936739044, 0.41619657983000463, -0.06901896931882297, -0.2774074392432308, 0.17803947962787967, -0.10143329235041267, -0.12270796939834848, 0.14540871879789274, 0.12727596372255234, 0.1986701763430415, -0.0784210403534499, 0.06248445471913971, -0.054695981691454676, 0.1464824134392755, 0.10537614563961963, -0.005116003405927987, 0.08866087469383033, 0.1542915300534504, 0.1267789280615174, 0.09353074931923847, -0.05784527837767728, -0.1383587798540044, -0.3459415848699066, -0.16738539769385868, -0.17155257265663126, -0.0014707329617878358, -0.10727185156765, -0.16940116890139514, 0.36586862066921444, 0.1057376344183499, 0.13922604590237558, 0.1064128114392499, 0.34222081624023565, 0.16293614254808508, 0.0006135869087403888, 0.10762928311315763, 0.20792406501730423, 0.14758740705633341, 0.13507098999278216, -0.21978276826044824, 0.04423455804117493, 0.21131617341425035]
|
1,803.09569
|
On Regularized Losses for Weakly-supervised CNN Segmentation
|
Minimization of regularized losses is a principled approach to weak
supervision well-established in deep learning, in general. However, it is
largely overlooked in semantic segmentation currently dominated by methods
mimicking full supervision via "fake" fully-labeled training masks (proposals)
generated from available partial input. To obtain such full masks the typical
methods explicitly use standard regularization techniques for "shallow"
segmentation, e.g. graph cuts or dense CRFs. In contrast, we integrate such
standard regularizers directly into the loss functions over partial input. This
approach simplifies weakly-supervised training by avoiding extra MRF/CRF
inference steps or layers explicitly generating full masks, while improving
both the quality and efficiency of training. This paper proposes and
experimentally compares different losses integrating MRF/CRF regularization
terms. We juxtapose our regularized losses with earlier proposal-generation
methods using explicit regularization steps or layers. Our approach achieves
state-of-the-art accuracy in semantic segmentation with near full-supervision
quality.
|
cs.CV
|
minimization of regularized losses is a principled approach to weak supervision wellestablished in deep learning in general however it is largely overlooked in semantic segmentation currently dominated by methods mimicking full supervision via fake fullylabeled training masks proposals generated from available partial input to obtain such full masks the typical methods explicitly use standard regularization techniques for shallow segmentation eg graph cuts or dense crfs in contrast we integrate such standard regularizers directly into the loss functions over partial input this approach simplifies weaklysupervised training by avoiding extra mrfcrf inference steps or layers explicitly generating full masks while improving both the quality and efficiency of training this paper proposes and experimentally compares different losses integrating mrfcrf regularization terms we juxtapose our regularized losses with earlier proposalgeneration methods using explicit regularization steps or layers our approach achieves stateoftheart accuracy in semantic segmentation with near fullsupervision quality
|
[['minimization', 'of', 'regularized', 'losses', 'is', 'a', 'principled', 'approach', 'to', 'weak', 'supervision', 'wellestablished', 'in', 'deep', 'learning', 'in', 'general', 'however', 'it', 'is', 'largely', 'overlooked', 'in', 'semantic', 'segmentation', 'currently', 'dominated', 'by', 'methods', 'mimicking', 'full', 'supervision', 'via', 'fake', 'fullylabeled', 'training', 'masks', 'proposals', 'generated', 'from', 'available', 'partial', 'input', 'to', 'obtain', 'such', 'full', 'masks', 'the', 'typical', 'methods', 'explicitly', 'use', 'standard', 'regularization', 'techniques', 'for', 'shallow', 'segmentation', 'eg', 'graph', 'cuts', 'or', 'dense', 'crfs', 'in', 'contrast', 'we', 'integrate', 'such', 'standard', 'regularizers', 'directly', 'into', 'the', 'loss', 'functions', 'over', 'partial', 'input', 'this', 'approach', 'simplifies', 'weaklysupervised', 'training', 'by', 'avoiding', 'extra', 'mrfcrf', 'inference', 'steps', 'or', 'layers', 'explicitly', 'generating', 'full', 'masks', 'while', 'improving', 'both', 'the', 'quality', 'and', 'efficiency', 'of', 'training', 'this', 'paper', 'proposes', 'and', 'experimentally', 'compares', 'different', 'losses', 'integrating', 'mrfcrf', 'regularization', 'terms', 'we', 'juxtapose', 'our', 'regularized', 'losses', 'with', 'earlier', 'proposalgeneration', 'methods', 'using', 'explicit', 'regularization', 'steps', 'or', 'layers', 'our', 'approach', 'achieves', 'stateoftheart', 'accuracy', 'in', 'semantic', 'segmentation', 'with', 'near', 'fullsupervision', 'quality']]
|
[0.008866461753475328, -0.02531916986331872, -0.006882377107568244, 0.10228720969513905, -0.13010550351773806, -0.15614991585875973, 0.041117971200753556, 0.4837825631504839, -0.2670251219500358, -0.3498378127800129, 0.043060604386289225, -0.264886595023109, -0.15836805585484476, 0.16196253345057315, -0.15710214208250087, 0.1412090769670045, 0.17422642774718106, -0.018304123992351352, -0.13206309015723935, -0.29893211568297046, 0.31060202566886996, 0.029088061228386253, 0.3619067275612648, 0.008584179205436868, 0.1610352488891849, 0.017657397438752206, -0.06876891818729804, 0.002377184613191701, -0.06209849497858197, 0.1828889254966077, 0.2991020845312044, 0.17222965186369335, 0.3378381416571479, -0.4263562196337268, -0.29193198774670454, 0.06553802495914782, 0.17405397245024268, 0.12917900385817263, -0.010811585209708898, -0.32620123971966986, 0.05730655281110964, -0.15322952382332572, 0.05383326728821646, -0.1851895683682821, -0.10218548221787742, -0.04166431521793748, -0.35122019352378153, 0.09809935482628379, 0.09631367468981879, 0.06488553920417284, -0.04295016978933403, -0.13401650220769992, 0.029342097349147847, 0.13758872958488022, 0.03245107465958659, 0.05829947314667681, 0.11557736506038313, -0.22305305554128602, -0.12306406682915325, 0.3090481752767525, -0.05847162306176644, -0.24619289667259717, 0.19598045690870242, 0.0076674902258467275, -0.1132916280824744, 0.1490873598249246, 0.19284048513674462, 0.16286516281881813, -0.15225403342752697, 0.04355911382371626, 0.027338880081231712, 0.14059584706044154, 0.11452789324606565, -0.0050548750074111345, 0.11725929855692682, 0.23501472540714957, 0.04559978576920306, 0.1669829820434675, -0.11120486923275476, -0.04430880362551052, -0.2568935249562223, -0.06634382894989235, -0.1708861835868963, -0.04178101756999679, -0.10847228629607872, -0.17053888226423333, 0.35061554554585656, 0.2275147076352691, 0.21541517065732296, 0.1053959785082133, 0.45406319874715295, 0.056610857316537214, 0.170364574126318, 0.08223657508100819, 0.1983353431726284, -0.0037153475514963164, 0.0706606277158147, -0.14546223582884837, 0.0739361550675454, 0.11914583577292291]
|
1,803.0957
|
Encodings of Bounded Synthesis
|
The reactive synthesis problem is to compute a system satisfying a given
specification in temporal logic. Bounded synthesis is the approach to bound the
maximum size of the system that we accept as a solution to the reactive
synthesis problem. As a result, bounded synthesis is decidable whenever the
corresponding verification problem is decidable, and can be applied in settings
where classic synthesis fails, such as in the synthesis of distributed systems.
In this paper, we study the constraint solving problem behind bounded
synthesis. We consider different reductions of the bounded synthesis problem of
linear-time temporal logic (LTL) to constraint systems given as boolean
formulas (SAT), quantified boolean formulas (QBF), and dependency quantified
boolean formulas (DQBF). The reductions represent different trade-offs between
conciseness and algorithmic efficiency. In the SAT encoding, both inputs and
states of the system are represented explicitly; in QBF, inputs are symbolic
and states are explicit; in DQBF, both inputs and states are symbolic. We
evaluate the encodings systematically using benchmarks from the reactive
synthesis competition (SYNTCOMP) and state-of-the-art solvers. Our key, and
perhaps surprising, empirical finding is that QBF clearly dominates both SAT
and DQBF.
|
cs.LO
|
the reactive synthesis problem is to compute a system satisfying a given specification in temporal logic bounded synthesis is the approach to bound the maximum size of the system that we accept as a solution to the reactive synthesis problem as a result bounded synthesis is decidable whenever the corresponding verification problem is decidable and can be applied in settings where classic synthesis fails such as in the synthesis of distributed systems in this paper we study the constraint solving problem behind bounded synthesis we consider different reductions of the bounded synthesis problem of lineartime temporal logic ltl to constraint systems given as boolean formulas sat quantified boolean formulas qbf and dependency quantified boolean formulas dqbf the reductions represent different tradeoffs between conciseness and algorithmic efficiency in the sat encoding both inputs and states of the system are represented explicitly in qbf inputs are symbolic and states are explicit in dqbf both inputs and states are symbolic we evaluate the encodings systematically using benchmarks from the reactive synthesis competition syntcomp and stateoftheart solvers our key and perhaps surprising empirical finding is that qbf clearly dominates both sat and dqbf
|
[['the', 'reactive', 'synthesis', 'problem', 'is', 'to', 'compute', 'a', 'system', 'satisfying', 'a', 'given', 'specification', 'in', 'temporal', 'logic', 'bounded', 'synthesis', 'is', 'the', 'approach', 'to', 'bound', 'the', 'maximum', 'size', 'of', 'the', 'system', 'that', 'we', 'accept', 'as', 'a', 'solution', 'to', 'the', 'reactive', 'synthesis', 'problem', 'as', 'a', 'result', 'bounded', 'synthesis', 'is', 'decidable', 'whenever', 'the', 'corresponding', 'verification', 'problem', 'is', 'decidable', 'and', 'can', 'be', 'applied', 'in', 'settings', 'where', 'classic', 'synthesis', 'fails', 'such', 'as', 'in', 'the', 'synthesis', 'of', 'distributed', 'systems', 'in', 'this', 'paper', 'we', 'study', 'the', 'constraint', 'solving', 'problem', 'behind', 'bounded', 'synthesis', 'we', 'consider', 'different', 'reductions', 'of', 'the', 'bounded', 'synthesis', 'problem', 'of', 'lineartime', 'temporal', 'logic', 'ltl', 'to', 'constraint', 'systems', 'given', 'as', 'boolean', 'formulas', 'sat', 'quantified', 'boolean', 'formulas', 'qbf', 'and', 'dependency', 'quantified', 'boolean', 'formulas', 'dqbf', 'the', 'reductions', 'represent', 'different', 'tradeoffs', 'between', 'conciseness', 'and', 'algorithmic', 'efficiency', 'in', 'the', 'sat', 'encoding', 'both', 'inputs', 'and', 'states', 'of', 'the', 'system', 'are', 'represented', 'explicitly', 'in', 'qbf', 'inputs', 'are', 'symbolic', 'and', 'states', 'are', 'explicit', 'in', 'dqbf', 'both', 'inputs', 'and', 'states', 'are', 'symbolic', 'we', 'evaluate', 'the', 'encodings', 'systematically', 'using', 'benchmarks', 'from', 'the', 'reactive', 'synthesis', 'competition', 'syntcomp', 'and', 'stateoftheart', 'solvers', 'our', 'key', 'and', 'perhaps', 'surprising', 'empirical', 'finding', 'is', 'that', 'qbf', 'clearly', 'dominates', 'both', 'sat', 'and', 'dqbf']]
|
[-0.0858195125600865, 0.025452125983228956, -0.03394833534818004, 0.10703301089002736, -0.09321399523615442, -0.16746543589782306, 0.06560775571165202, 0.3636776573078894, -0.35164993229721275, -0.3480109743103779, 0.12750390566030528, -0.2406976643934964, -0.1142233611163363, 0.2157937204760928, -0.09414016971958705, 0.15304257689172, 0.04032493136310704, -0.03395877030392291, -0.08041033880026252, -0.21352710964025132, 0.2860365776962358, -0.0505576151171847, 0.24819096377092936, 0.06685132137130177, 0.09718232089899993, -0.010149635752125904, 0.025021361245000096, 0.04864722773649548, -0.06116595258358829, 0.1290734010818168, 0.34865869783116354, 0.2843093010621569, 0.2590415563173198, -0.44810404363408607, -0.1321408867776867, 0.10460915722793077, 0.12348429862441859, 0.14217724589502842, -0.019205322858714867, -0.2456410428245488, 0.08617696601025288, -0.1682175273570311, 7.85095814280409e-05, -0.0840151642840947, 0.06423540273927665, 0.038057316995315775, -0.2633385368026596, -0.020006317260956006, 0.1600346916685344, 0.06762087905641508, -0.11106774668398968, -0.1439845680423012, 0.009375942202048406, 0.11666246886222215, -0.05426272935610974, -0.011307988878802726, 0.10412512751168045, -0.11281579104340703, -0.20422899424222854, 0.367331901727806, -0.025154050507351124, -0.23050366446533532, 0.15483089074894058, -0.01700194659470408, -0.19660983699073314, 0.06543979794279765, 0.16246284811052852, 0.1760959568028166, -0.11032630265172985, 0.12050514631854153, -0.07976615736039266, 0.265980255519035, 0.10066937663094708, 0.02119030152871298, 0.13722473208511632, 0.20728329984008004, 0.05036558631792783, 0.24344506027440604, 0.049361467918272686, -0.12970742531534699, -0.2555781710971758, -0.10600339366947227, -0.12110035415127794, -0.036947886075174054, -0.0787721425189394, -0.1622471415275146, 0.3647733171711917, 0.1728212980913225, 0.10738594916516117, 0.19844856617292242, 0.322047030267419, 0.19274503046094818, 0.029078912088479944, 0.050641220141813235, 0.1370667744891117, 0.12541197039921173, 0.09728108599742569, -0.2590375137158113, 0.16114340173622604, 0.07979659805974859]
|
1,803.09571
|
Source Code Optimization using Equivalent Mutants
|
A mutant is a program obtained by syntactically modifying a program's source
code; an equivalent mutant is a mutant, which is functionally equivalent to the
original program. Mutants are primarily used in \emph{mutation testing}, and
when deriving a test suite, obtaining an equivalent mutant is considered to be
highly negative, although these equivalent mutants could be used for other
purposes. We present an approach that considers equivalent mutants valuable,
and utilizes them for source code optimization. Source code optimization
enhances a program's source code preserving its behavior. We showcase a
procedure to achieve source code optimization based on equivalent mutants and
discuss proper mutation operators. Experimental evaluation with Java and C
programs demonstrates the applicability of the proposed approach. An
algorithmic approach for source code optimization using equivalent mutants is
proposed. It is showcased that whenever applicable, the approach can outperform
traditional compiler optimizations.
|
cs.SE
|
a mutant is a program obtained by syntactically modifying a programs source code an equivalent mutant is a mutant which is functionally equivalent to the original program mutants are primarily used in emphmutation testing and when deriving a test suite obtaining an equivalent mutant is considered to be highly negative although these equivalent mutants could be used for other purposes we present an approach that considers equivalent mutants valuable and utilizes them for source code optimization source code optimization enhances a programs source code preserving its behavior we showcase a procedure to achieve source code optimization based on equivalent mutants and discuss proper mutation operators experimental evaluation with java and c programs demonstrates the applicability of the proposed approach an algorithmic approach for source code optimization using equivalent mutants is proposed it is showcased that whenever applicable the approach can outperform traditional compiler optimizations
|
[['a', 'mutant', 'is', 'a', 'program', 'obtained', 'by', 'syntactically', 'modifying', 'a', 'programs', 'source', 'code', 'an', 'equivalent', 'mutant', 'is', 'a', 'mutant', 'which', 'is', 'functionally', 'equivalent', 'to', 'the', 'original', 'program', 'mutants', 'are', 'primarily', 'used', 'in', 'emphmutation', 'testing', 'and', 'when', 'deriving', 'a', 'test', 'suite', 'obtaining', 'an', 'equivalent', 'mutant', 'is', 'considered', 'to', 'be', 'highly', 'negative', 'although', 'these', 'equivalent', 'mutants', 'could', 'be', 'used', 'for', 'other', 'purposes', 'we', 'present', 'an', 'approach', 'that', 'considers', 'equivalent', 'mutants', 'valuable', 'and', 'utilizes', 'them', 'for', 'source', 'code', 'optimization', 'source', 'code', 'optimization', 'enhances', 'a', 'programs', 'source', 'code', 'preserving', 'its', 'behavior', 'we', 'showcase', 'a', 'procedure', 'to', 'achieve', 'source', 'code', 'optimization', 'based', 'on', 'equivalent', 'mutants', 'and', 'discuss', 'proper', 'mutation', 'operators', 'experimental', 'evaluation', 'with', 'java', 'and', 'c', 'programs', 'demonstrates', 'the', 'applicability', 'of', 'the', 'proposed', 'approach', 'an', 'algorithmic', 'approach', 'for', 'source', 'code', 'optimization', 'using', 'equivalent', 'mutants', 'is', 'proposed', 'it', 'is', 'showcased', 'that', 'whenever', 'applicable', 'the', 'approach', 'can', 'outperform', 'traditional', 'compiler', 'optimizations']]
|
[-0.06377544123905762, -0.03584266467846141, -0.09743225675386687, 0.13032277699191278, -0.0743980048169356, -0.30020523180590114, 0.035280185243512584, 0.4217113442460282, -0.26136198709072134, -0.28821470818365924, 0.08555970660462561, -0.21481237687920737, -0.13467098122075388, 0.2703197913360782, -0.10309630005051279, 0.047010636609936936, 0.17336979267727454, -0.05618204115631266, 0.0012443749227612796, -0.2929903721265469, 0.25772597914005424, 0.1106758125889529, 0.2827675568227682, 0.024200031349513058, 0.1252711446367256, -0.01873061471269466, -0.03276349635173877, 0.05338812524213507, -0.07597473323797506, 0.11315304468088369, 0.2849146104045859, 0.2949519961354478, 0.27066550602709566, -0.3446109600804953, -0.15514769841037276, 0.043726905507759914, 0.14325883294481578, 0.16901099992537638, -0.024670468408051722, -0.26244157102579874, 0.12221328892984376, -0.18182606454097872, -0.05644958160377832, -0.07906957452400497, -0.01421833279406807, 0.007221432536930984, -0.28451215506841737, -0.021632439442328177, 0.011458551553207345, 0.07603823697556639, -0.03428617032801008, -0.12314886227250099, -0.00908954258193262, 0.10615705645310906, 0.03352974198545174, 0.05708389688516036, 0.18075363459259583, -0.04683935058548943, -0.15586999754466685, 0.3707804887348579, -0.04486197679135431, -0.25485075113829225, 0.18800384557592528, 0.03722746088492891, -0.1314480870528819, 0.1785750588670554, 0.14373788106927854, 0.16795610829851487, -0.19751174485898243, 0.06759133476912717, -0.007233200720899428, 0.22881907830014825, 0.015449411691709733, -0.04613701538053445, 0.17977517309514546, 0.17197705278966977, 0.04225169376069163, 0.22480719458811413, -0.030969158335816854, -0.0707443138364599, -0.2781921333452273, -0.18708128857866135, -0.12161744413768044, 0.0024224074182307553, -0.04418482066790198, -0.18178749543100517, 0.4080059347454355, 0.17529165783909978, 0.025350944346023932, 0.142581382062215, 0.2795765137869037, 0.07356229909136244, 0.125673415002287, 0.09761985283047478, 0.11261277120017137, 0.06680999960291148, 0.029088371617641922, -0.228892574694732, 0.15254940903913747, 0.05606715893372893]
|
1,803.09572
|
Von Karman-Howarth equation for Hall magnetohydrodynamics: Hybrid
simulations
|
A dynamical vectorial equation for homogeneous incompressible Hall-MHD
turbulence together with the exact scaling law for third-order correlation
tensors, analogous to that for the incompressible MHD, is rederived and applied
to the results of two-dimensional hybrid simulations of plasma turbulence. At
large (MHD) scales the simulations exhibits a clear inertial range where the
MHD dynamic law is valid. In the sub-ion range the cascade continues via the
Hall term but the dynamic law derived in the framework of incompressible Hall
MHD equations is obtained only in a low plasma beta simulation. For a higher
beta plasma the cascade rate decreases in the sub-ion range and the change
becomes more pronounced as the plasma beta increases. This break in the cascade
flux can be ascribed to non thermal (kinetic) features or to others terms in
the dynamical equation that are not included in the Hall-MHD incompressible
approximation.
|
physics.space-ph astro-ph.SR physics.plasm-ph
|
a dynamical vectorial equation for homogeneous incompressible hallmhd turbulence together with the exact scaling law for thirdorder correlation tensors analogous to that for the incompressible mhd is rederived and applied to the results of twodimensional hybrid simulations of plasma turbulence at large mhd scales the simulations exhibits a clear inertial range where the mhd dynamic law is valid in the subion range the cascade continues via the hall term but the dynamic law derived in the framework of incompressible hall mhd equations is obtained only in a low plasma beta simulation for a higher beta plasma the cascade rate decreases in the subion range and the change becomes more pronounced as the plasma beta increases this break in the cascade flux can be ascribed to non thermal kinetic features or to others terms in the dynamical equation that are not included in the hallmhd incompressible approximation
|
[['a', 'dynamical', 'vectorial', 'equation', 'for', 'homogeneous', 'incompressible', 'hallmhd', 'turbulence', 'together', 'with', 'the', 'exact', 'scaling', 'law', 'for', 'thirdorder', 'correlation', 'tensors', 'analogous', 'to', 'that', 'for', 'the', 'incompressible', 'mhd', 'is', 'rederived', 'and', 'applied', 'to', 'the', 'results', 'of', 'twodimensional', 'hybrid', 'simulations', 'of', 'plasma', 'turbulence', 'at', 'large', 'mhd', 'scales', 'the', 'simulations', 'exhibits', 'a', 'clear', 'inertial', 'range', 'where', 'the', 'mhd', 'dynamic', 'law', 'is', 'valid', 'in', 'the', 'subion', 'range', 'the', 'cascade', 'continues', 'via', 'the', 'hall', 'term', 'but', 'the', 'dynamic', 'law', 'derived', 'in', 'the', 'framework', 'of', 'incompressible', 'hall', 'mhd', 'equations', 'is', 'obtained', 'only', 'in', 'a', 'low', 'plasma', 'beta', 'simulation', 'for', 'a', 'higher', 'beta', 'plasma', 'the', 'cascade', 'rate', 'decreases', 'in', 'the', 'subion', 'range', 'and', 'the', 'change', 'becomes', 'more', 'pronounced', 'as', 'the', 'plasma', 'beta', 'increases', 'this', 'break', 'in', 'the', 'cascade', 'flux', 'can', 'be', 'ascribed', 'to', 'non', 'thermal', 'kinetic', 'features', 'or', 'to', 'others', 'terms', 'in', 'the', 'dynamical', 'equation', 'that', 'are', 'not', 'included', 'in', 'the', 'hallmhd', 'incompressible', 'approximation']]
|
[-0.15483510404050171, 0.19696836756089423, -0.07349633748566553, 0.08963905846200124, -0.027820124442382934, -0.11984710127261965, -0.08118796436600897, 0.27497871064466156, -0.2836342379400963, -0.27992710735240617, 0.04857009493072887, -0.2416073541947934, -0.06181315820798125, 0.21651774800975795, 0.04998293569413562, 0.0937821870886606, 0.004380231991104067, -0.062466516478420935, -0.05539655139389103, -0.11440561376894785, 0.28116758940868997, 0.10122871912309377, 0.27848622002575085, 0.0019053020291285563, 0.08887862361176577, -0.09486266801274088, -0.0244571559293808, 0.09517695423700426, -0.16601677631095374, -0.03835979882270506, 0.22443459436779026, -0.04221899535073197, 0.2494561552733489, -0.44307174572517, -0.2836056092294724, 0.0019039089140826708, 0.19146585897925272, 0.0959134786070822, -0.01413030521004271, -0.19133659835573133, 0.08589748686102971, -0.20818320545686841, -0.1546000788651713, -0.044891930861424095, 0.03503073820818777, 0.027259016422274178, -0.3374567078968689, 0.19359375124522932, 0.08771445617288645, 0.04357154293572658, -0.11135628778800011, -0.07526005611596279, -0.021322304612561446, 0.07552290381863713, 0.07774605044508226, 0.032110329589819256, 0.13832583225472536, -0.19540331427371513, -0.05069313889763267, 0.4215774771578814, -0.09157896964740621, -0.20816971221300837, 0.2152129677523004, -0.21971160134504716, -0.09100474256879414, 0.2053173845873074, 0.15153413398625099, 0.06637410273808748, -0.09366351965023842, 0.07116363847676875, -0.07258113262830429, 0.15974516628074065, 0.019924339906899385, -0.03195496946445679, 0.1835786045962715, 0.1526057127008393, 0.020138175443631327, 0.12677952585413363, -0.08870705809485652, -0.11895867609355139, -0.3074915757632419, -0.1340077130454082, -0.15752208590099256, 0.0694104645941255, -0.10875401273030909, -0.19929650180960354, 0.35008679172789603, 0.1578129099311996, 0.0946254900860766, 0.0611967743284305, 0.2898682742953709, 0.20972780635730326, 0.020759998925974313, 0.12429088420132557, 0.29255872393945515, 0.1764177205359997, 0.21057364872771583, -0.27731116635929026, 0.00480075805505406, 0.09689466379365999]
|
1,803.09573
|
Colouring set families without monochromatic k-chains
|
A coloured version of classic extremal problems dates back to Erd\H{o}s and
Rothschild, who in 1974 asked which $n$-vertex graph has the maximum number of
2-edge-colourings without monochromatic triangles. They conjectured that the
answer is simply given by the largest triangle-free graph. Since then, this new
class of coloured extremal problems has been extensively studied by various
researchers. In this paper we pursue the Erd\H{o}s--Rothschild versions of
Sperner's Theorem, the classic result in extremal set theory on the size of the
largest antichain in the Boolean lattice, and Erd\H{o}s' extension to
$k$-chain-free families.
Given a family $\mathcal{F}$ of subsets of $[n]$, we define an
$(r,k)$-colouring of $\mathcal{F}$ to be an $r$-colouring of the sets without
any monochromatic $k$-chains $F_1 \subset F_2 \subset \dots \subset F_k$. We
prove that for $n$ sufficiently large in terms of $k$, the largest
$k$-chain-free families also maximise the number of $(2,k)$-colourings. We also
show that the middle level, $\binom{[n]}{\lfloor n/2 \rfloor}$, maximises the
number of $(3,2)$-colourings, and give asymptotic results on the maximum
possible number of $(r,k)$-colourings whenever $r(k-1)$ is divisible by three.
|
math.CO
|
a coloured version of classic extremal problems dates back to erdhos and rothschild who in 1974 asked which nvertex graph has the maximum number of 2edgecolourings without monochromatic triangles they conjectured that the answer is simply given by the largest trianglefree graph since then this new class of coloured extremal problems has been extensively studied by various researchers in this paper we pursue the erdhosrothschild versions of sperners theorem the classic result in extremal set theory on the size of the largest antichain in the boolean lattice and erdhos extension to kchainfree families given a family mathcalf of subsets of n we define an rkcolouring of mathcalf to be an rcolouring of the sets without any monochromatic kchains f_1 subset f_2 subset dots subset f_k we prove that for n sufficiently large in terms of k the largest kchainfree families also maximise the number of 2kcolourings we also show that the middle level binomnlfloor n2 rfloor maximises the number of 32colourings and give asymptotic results on the maximum possible number of rkcolourings whenever rk1 is divisible by three
|
[['a', 'coloured', 'version', 'of', 'classic', 'extremal', 'problems', 'dates', 'back', 'to', 'erdhos', 'and', 'rothschild', 'who', 'in', '1974', 'asked', 'which', 'nvertex', 'graph', 'has', 'the', 'maximum', 'number', 'of', '2edgecolourings', 'without', 'monochromatic', 'triangles', 'they', 'conjectured', 'that', 'the', 'answer', 'is', 'simply', 'given', 'by', 'the', 'largest', 'trianglefree', 'graph', 'since', 'then', 'this', 'new', 'class', 'of', 'coloured', 'extremal', 'problems', 'has', 'been', 'extensively', 'studied', 'by', 'various', 'researchers', 'in', 'this', 'paper', 'we', 'pursue', 'the', 'erdhosrothschild', 'versions', 'of', 'sperners', 'theorem', 'the', 'classic', 'result', 'in', 'extremal', 'set', 'theory', 'on', 'the', 'size', 'of', 'the', 'largest', 'antichain', 'in', 'the', 'boolean', 'lattice', 'and', 'erdhos', 'extension', 'to', 'kchainfree', 'families', 'given', 'a', 'family', 'mathcalf', 'of', 'subsets', 'of', 'n', 'we', 'define', 'an', 'rkcolouring', 'of', 'mathcalf', 'to', 'be', 'an', 'rcolouring', 'of', 'the', 'sets', 'without', 'any', 'monochromatic', 'kchains', 'f_1', 'subset', 'f_2', 'subset', 'dots', 'subset', 'f_k', 'we', 'prove', 'that', 'for', 'n', 'sufficiently', 'large', 'in', 'terms', 'of', 'k', 'the', 'largest', 'kchainfree', 'families', 'also', 'maximise', 'the', 'number', 'of', '2kcolourings', 'we', 'also', 'show', 'that', 'the', 'middle', 'level', 'binomnlfloor', 'n2', 'rfloor', 'maximises', 'the', 'number', 'of', '32colourings', 'and', 'give', 'asymptotic', 'results', 'on', 'the', 'maximum', 'possible', 'number', 'of', 'rkcolourings', 'whenever', 'rk1', 'is', 'divisible', 'by', 'three']]
|
[-0.13050925161700414, 0.11613236767888663, -0.02887918844094707, 0.04923649106790143, -0.06555295928942355, -0.11107385293607823, 0.06268460491545531, 0.31254124104410236, -0.266701439891163, -0.3192772448678332, 0.07786665307371524, -0.33873286163597777, -0.11588760430169597, 0.16304118241515686, -0.13895672345016566, 0.049392686823804384, 0.06892741824723563, 0.100375809418092, 0.053216202212129964, -0.33963083000806005, 0.3132888370326976, -0.06547943409259992, 0.1988837804634407, 0.06940668580879332, 0.05923546742843954, 0.03677880999978362, 0.017976747659628676, 0.060004965063151824, -0.20406574026298707, 0.10291458262615341, 0.255660533093526, 0.19858345158441723, 0.29311137974850443, -0.36790526822231145, -0.12546574996038182, 0.2502060287512229, 0.11903165830183524, 0.046175312401307476, 0.01747125396450535, -0.20909523027840107, 0.1536728129640483, -0.1209444629480485, -0.14682036744191024, 0.005341692974692897, 0.11184494782576872, 0.009472248030074855, -0.26474763070129687, -0.05285417844237738, 0.12724446000433282, 0.05256818948662159, 0.051898240719714925, -0.18847030507705625, -0.02214743714842248, 0.09260133389868277, 0.007452198760573572, 0.06318532183241475, -0.004477397067613943, -0.08757322074978868, -0.1615353297926921, 0.326077251026219, -0.028593276861554, -0.17310996498498651, 0.0922652616258166, -0.15849062729877425, -0.19083188155840275, 0.10361751510723553, 0.11556981531195125, 0.166592548595883, -0.10698748038205515, 0.1708666679564433, -0.1907083959079059, 0.13443169365936553, 0.1938752164677526, 0.020625112594611812, 0.13754595758608537, 0.07890371295993832, 0.11722036312900658, 0.20579788149320874, 0.021888832255315623, -0.00986789107596371, -0.2964702550681275, -0.11855984268143599, -0.23507742922921931, 0.12296371983244406, -0.14977144081615612, -0.19757039724081232, 0.38009651190443344, 0.09978866780568894, 0.16934370624217374, 0.0828550202364908, 0.19036660254497234, 0.05759444981971715, 0.008953994080119314, 0.13718212873277347, 0.1228205151501934, 0.16295068947821637, -0.03527647084747142, -0.16225074067145412, 0.03991876554209739, 0.16630497971571415]
|
1,803.09574
|
Long short-term memory and learning-to-learn in networks of spiking
neurons
|
Recurrent networks of spiking neurons (RSNNs) underlie the astounding
computing and learning capabilities of the brain. But computing and learning
capabilities of RSNN models have remained poor, at least in comparison with
artificial neural networks (ANNs). We address two possible reasons for that.
One is that RSNNs in the brain are not randomly connected or designed according
to simple rules, and they do not start learning as a tabula rasa network.
Rather, RSNNs in the brain were optimized for their tasks through evolution,
development, and prior experience. Details of these optimization processes are
largely unknown. But their functional contribution can be approximated through
powerful optimization methods, such as backpropagation through time (BPTT).
A second major mismatch between RSNNs in the brain and models is that the
latter only show a small fraction of the dynamics of neurons and synapses in
the brain. We include neurons in our RSNN model that reproduce one prominent
dynamical process of biological neurons that takes place at the behaviourally
relevant time scale of seconds: neuronal adaptation. We denote these networks
as LSNNs because of their Long short-term memory. The inclusion of adapting
neurons drastically increases the computing and learning capability of RSNNs if
they are trained and configured by deep learning (BPTT combined with a rewiring
algorithm that optimizes the network architecture). In fact, the computational
performance of these RSNNs approaches for the first time that of LSTM networks.
In addition RSNNs with adapting neurons can acquire abstract knowledge from
prior learning in a Learning-to-Learn (L2L) scheme, and transfer that knowledge
in order to learn new but related tasks from very few examples. We demonstrate
this for supervised learning and reinforcement learning.
|
cs.NE q-bio.NC
|
recurrent networks of spiking neurons rsnns underlie the astounding computing and learning capabilities of the brain but computing and learning capabilities of rsnn models have remained poor at least in comparison with artificial neural networks anns we address two possible reasons for that one is that rsnns in the brain are not randomly connected or designed according to simple rules and they do not start learning as a tabula rasa network rather rsnns in the brain were optimized for their tasks through evolution development and prior experience details of these optimization processes are largely unknown but their functional contribution can be approximated through powerful optimization methods such as backpropagation through time bptt a second major mismatch between rsnns in the brain and models is that the latter only show a small fraction of the dynamics of neurons and synapses in the brain we include neurons in our rsnn model that reproduce one prominent dynamical process of biological neurons that takes place at the behaviourally relevant time scale of seconds neuronal adaptation we denote these networks as lsnns because of their long shortterm memory the inclusion of adapting neurons drastically increases the computing and learning capability of rsnns if they are trained and configured by deep learning bptt combined with a rewiring algorithm that optimizes the network architecture in fact the computational performance of these rsnns approaches for the first time that of lstm networks in addition rsnns with adapting neurons can acquire abstract knowledge from prior learning in a learningtolearn l2l scheme and transfer that knowledge in order to learn new but related tasks from very few examples we demonstrate this for supervised learning and reinforcement learning
|
[['recurrent', 'networks', 'of', 'spiking', 'neurons', 'rsnns', 'underlie', 'the', 'astounding', 'computing', 'and', 'learning', 'capabilities', 'of', 'the', 'brain', 'but', 'computing', 'and', 'learning', 'capabilities', 'of', 'rsnn', 'models', 'have', 'remained', 'poor', 'at', 'least', 'in', 'comparison', 'with', 'artificial', 'neural', 'networks', 'anns', 'we', 'address', 'two', 'possible', 'reasons', 'for', 'that', 'one', 'is', 'that', 'rsnns', 'in', 'the', 'brain', 'are', 'not', 'randomly', 'connected', 'or', 'designed', 'according', 'to', 'simple', 'rules', 'and', 'they', 'do', 'not', 'start', 'learning', 'as', 'a', 'tabula', 'rasa', 'network', 'rather', 'rsnns', 'in', 'the', 'brain', 'were', 'optimized', 'for', 'their', 'tasks', 'through', 'evolution', 'development', 'and', 'prior', 'experience', 'details', 'of', 'these', 'optimization', 'processes', 'are', 'largely', 'unknown', 'but', 'their', 'functional', 'contribution', 'can', 'be', 'approximated', 'through', 'powerful', 'optimization', 'methods', 'such', 'as', 'backpropagation', 'through', 'time', 'bptt', 'a', 'second', 'major', 'mismatch', 'between', 'rsnns', 'in', 'the', 'brain', 'and', 'models', 'is', 'that', 'the', 'latter', 'only', 'show', 'a', 'small', 'fraction', 'of', 'the', 'dynamics', 'of', 'neurons', 'and', 'synapses', 'in', 'the', 'brain', 'we', 'include', 'neurons', 'in', 'our', 'rsnn', 'model', 'that', 'reproduce', 'one', 'prominent', 'dynamical', 'process', 'of', 'biological', 'neurons', 'that', 'takes', 'place', 'at', 'the', 'behaviourally', 'relevant', 'time', 'scale', 'of', 'seconds', 'neuronal', 'adaptation', 'we', 'denote', 'these', 'networks', 'as', 'lsnns', 'because', 'of', 'their', 'long', 'shortterm', 'memory', 'the', 'inclusion', 'of', 'adapting', 'neurons', 'drastically', 'increases', 'the', 'computing', 'and', 'learning', 'capability', 'of', 'rsnns', 'if', 'they', 'are', 'trained', 'and', 'configured', 'by', 'deep', 'learning', 'bptt', 'combined', 'with', 'a', 'rewiring', 'algorithm', 'that', 'optimizes', 'the', 'network', 'architecture', 'in', 'fact', 'the', 'computational', 'performance', 'of', 'these', 'rsnns', 'approaches', 'for', 'the', 'first', 'time', 'that', 'of', 'lstm', 'networks', 'in', 'addition', 'rsnns', 'with', 'adapting', 'neurons', 'can', 'acquire', 'abstract', 'knowledge', 'from', 'prior', 'learning', 'in', 'a', 'learningtolearn', 'l2l', 'scheme', 'and', 'transfer', 'that', 'knowledge', 'in', 'order', 'to', 'learn', 'new', 'but', 'related', 'tasks', 'from', 'very', 'few', 'examples', 'we', 'demonstrate', 'this', 'for', 'supervised', 'learning', 'and', 'reinforcement', 'learning']]
|
[-0.04992587908687394, 0.07818884085998803, -0.04346591695313058, 0.07137746479263471, -0.09224786535850253, -0.1973544597928159, 0.049717335688436164, 0.46641160437391826, -0.29214095786902244, -0.31903585223346087, 0.06899728617239473, -0.2273280359905861, -0.27278746657683095, 0.17854651345671457, -0.10307837159843589, 0.05294620154756189, 0.114410149898596, 0.05938062713476424, -0.01946559269466282, -0.2726054935788009, 0.2778722597859746, 0.0358015239879656, 0.2733916093163408, -0.008958607502079205, 0.13565616097564445, -0.06526430423748578, -0.01184359755058287, -0.02030223220622313, -0.026404553757026366, 0.16076591925904749, 0.3227700252938002, 0.194774919168423, 0.36938338947104477, -0.5086449684231016, -0.2506893324308043, 0.12010428065137155, 0.16832641400633028, 0.09440834187241136, 0.0019212045164380654, -0.28209591434553155, 0.09188559569757553, -0.14978372065039972, 0.010835779943854373, -0.14499346766261506, -0.01823299904556378, 0.04186632281112392, -0.2342552260775794, 0.04254863110090019, 0.09324487362027867, 0.04535100980833902, -0.05277669681590456, -0.09223579407662855, 0.00606162241825402, 0.1919495855176322, 0.01643633345878882, 0.035925362955954304, 0.17335307147658424, -0.19180571762220663, -0.1539384787902236, 0.296668400291178, -0.01707059767036496, -0.17300796119388248, 0.21629787469957618, -0.052722614916527404, -0.16599982847053427, 0.1007445872882786, 0.22447971938021036, 0.07588946695904124, -0.1716282621525444, 0.02601343360130567, 0.020466368144337575, 0.17749856460748403, 0.037996633882436945, 0.006548250134548415, 0.16443943034771466, 0.2734655247551163, 0.003961059129231718, 0.09087010691966524, -0.07724114682565889, -0.11268468217547153, -0.21600338820185835, -0.07763106008802635, -0.21410489876913177, 0.022164634200200217, -0.10447800869028931, -0.1353030524628791, 0.4034161918684797, 0.17918199748785718, 0.21861586959763055, 0.15015406903905282, 0.29756788140419277, 0.037900398868562966, 0.16595974525325405, 0.11263726140116004, 0.20180463600284554, 0.06939557941623734, 0.15369352951360718, -0.19131211745580134, 0.1402083538005304, 0.005234073358250485]
|
1,803.09575
|
Testing the capability of low-energy light ions identification of the
TRACE silicon detectors
|
The in-beam tests of two Si pixel type TRACE detectors have been performed at
Laboratori Nazionali di Legnaro (Italy). The aim was to investigate the
possibility of identifying heavy-ion reactions products with mass A~10 at low
kinetic energy, i.e., around 10 MeV. Two separate read-out chains, digital and
analog, were used. The Pulse Shape Analysis technique was employed to obtain
the identification matrices for the digitally processed part of the data.
Separation in both charge and mass was obtained, however, the $\alpha$
particles contaminated significantly the recorded data in the lower energy
part. Due to this effect, the identification of the light products ($^{7,6}$Li
isotopes) could be possible down only to ~20 MeV
|
physics.ins-det
|
the inbeam tests of two si pixel type trace detectors have been performed at laboratori nazionali di legnaro italy the aim was to investigate the possibility of identifying heavyion reactions products with mass a10 at low kinetic energy ie around 10 mev two separate readout chains digital and analog were used the pulse shape analysis technique was employed to obtain the identification matrices for the digitally processed part of the data separation in both charge and mass was obtained however the alpha particles contaminated significantly the recorded data in the lower energy part due to this effect the identification of the light products 76li isotopes could be possible down only to 20 mev
|
[['the', 'inbeam', 'tests', 'of', 'two', 'si', 'pixel', 'type', 'trace', 'detectors', 'have', 'been', 'performed', 'at', 'laboratori', 'nazionali', 'di', 'legnaro', 'italy', 'the', 'aim', 'was', 'to', 'investigate', 'the', 'possibility', 'of', 'identifying', 'heavyion', 'reactions', 'products', 'with', 'mass', 'a10', 'at', 'low', 'kinetic', 'energy', 'ie', 'around', '10', 'mev', 'two', 'separate', 'readout', 'chains', 'digital', 'and', 'analog', 'were', 'used', 'the', 'pulse', 'shape', 'analysis', 'technique', 'was', 'employed', 'to', 'obtain', 'the', 'identification', 'matrices', 'for', 'the', 'digitally', 'processed', 'part', 'of', 'the', 'data', 'separation', 'in', 'both', 'charge', 'and', 'mass', 'was', 'obtained', 'however', 'the', 'alpha', 'particles', 'contaminated', 'significantly', 'the', 'recorded', 'data', 'in', 'the', 'lower', 'energy', 'part', 'due', 'to', 'this', 'effect', 'the', 'identification', 'of', 'the', 'light', 'products', '76li', 'isotopes', 'could', 'be', 'possible', 'down', 'only', 'to', '20', 'mev']]
|
[-0.05761045168453295, 0.15607164256341224, -0.05174213304417208, 0.08762877580738859, 0.006807972163057586, -0.1326189786154178, 0.01184886647388339, 0.34816584087301244, -0.20150728173653729, -0.38522369218740743, 0.10285348123163983, -0.34008123036515564, 0.02860529867965462, 0.19619631122830988, 0.0004880201896802256, 0.056560786574014595, 0.0672415008624999, 0.0199474562001082, -0.0635681069111992, -0.21277402203330503, 0.2435659025982854, 0.163727018982172, 0.30421191667638986, 0.05876392571787749, 0.09303353766154032, -0.013338876501490762, -0.07519309031444468, -0.09280543960630894, -0.10302785560738162, 0.03218317749685541, 0.29086558391073986, 0.07045426429873, 0.18548612173097873, -0.422432256945675, -0.1422783712623641, 0.13813935388212226, 0.10964935975997443, 0.05675462082893189, -0.08203183088750977, -0.30389457585988566, 0.07903637257238318, -0.18026927845598298, -0.14456558217144838, 0.019275449303677306, -0.022390951710154434, 0.006344367798841891, -0.22940528781951539, 0.04645794055873661, -0.027378880817975317, 0.046445378667808006, -0.04038598769797578, -0.19632085661786342, -0.013987878961155989, 0.0959317037569625, 0.00573422849369568, 0.010919172734637479, 0.1864418070181273, -0.051748974259161126, -0.05083661288309876, 0.3251941493612581, -0.026354275867821082, -0.09342019886909318, 0.18058747825645177, -0.17571712383401714, -0.13453452155226842, 0.2166637408580365, 0.1731731820722676, 0.09881738981493982, -0.22407220753042825, 0.04472763365863232, 0.07266112130309921, 0.20263164843033468, 0.14595668479367824, -0.004602918492829693, 0.20114428791150982, 0.18440935433942027, -0.023706253618001938, 0.10189158556542159, -0.2150216448057368, 0.006011659594930409, -0.24093339638784528, -0.1591104143132855, -0.14473469382418053, 0.01614644160872558, -0.006265001732962057, -0.04964752395530273, 0.3818171769975639, 0.08154285493323446, 0.1604937950947455, -0.048719682439696044, 0.2838206282031024, 0.0595639558887342, 0.1129290829313894, -0.003294059669964814, 0.31100765592626495, 0.16394587564822619, 0.1766174214010659, -0.21468571288694097, 0.04895100147613058, 0.0395979074861056]
|
1,803.09576
|
Dushnik-Miller dimension of TD-Delaunay complexes
|
TD-Delaunay graphs, where TD stands for triangular distance, is a variation
of the classical Delaunay triangulations obtained from a specific convex
distance function. Bonichon et. al. noticed that every triangulation is the
TD-Delaunay graph of a set of points in $\mathbb{R}^2$, and conversely every
TD-Delaunay graph is planar. It seems natural to study the generalization of
this property in higher dimensions. Such a generalization is obtained by
defining an analogue of the triangular distance for $\mathbb{R}^d$. It is easy
to see that TD-Delaunay complexes of $\mathbb{R}^{d-1}$ are of Dushnik-Miller
dimension $d$. The converse holds for $d=2$ or $3$ and it was conjectured
independently by Mary and Evans et. al. to hold for larger $d$. Here we
disprove the conjecture already for $d = 4$.
|
cs.DM math.CO
|
tddelaunay graphs where td stands for triangular distance is a variation of the classical delaunay triangulations obtained from a specific convex distance function bonichon et al noticed that every triangulation is the tddelaunay graph of a set of points in mathbbr2 and conversely every tddelaunay graph is planar it seems natural to study the generalization of this property in higher dimensions such a generalization is obtained by defining an analogue of the triangular distance for mathbbrd it is easy to see that tddelaunay complexes of mathbbrd1 are of dushnikmiller dimension d the converse holds for d2 or 3 and it was conjectured independently by mary and evans et al to hold for larger d here we disprove the conjecture already for d 4
|
[['tddelaunay', 'graphs', 'where', 'td', 'stands', 'for', 'triangular', 'distance', 'is', 'a', 'variation', 'of', 'the', 'classical', 'delaunay', 'triangulations', 'obtained', 'from', 'a', 'specific', 'convex', 'distance', 'function', 'bonichon', 'et', 'al', 'noticed', 'that', 'every', 'triangulation', 'is', 'the', 'tddelaunay', 'graph', 'of', 'a', 'set', 'of', 'points', 'in', 'mathbbr2', 'and', 'conversely', 'every', 'tddelaunay', 'graph', 'is', 'planar', 'it', 'seems', 'natural', 'to', 'study', 'the', 'generalization', 'of', 'this', 'property', 'in', 'higher', 'dimensions', 'such', 'a', 'generalization', 'is', 'obtained', 'by', 'defining', 'an', 'analogue', 'of', 'the', 'triangular', 'distance', 'for', 'mathbbrd', 'it', 'is', 'easy', 'to', 'see', 'that', 'tddelaunay', 'complexes', 'of', 'mathbbrd1', 'are', 'of', 'dushnikmiller', 'dimension', 'd', 'the', 'converse', 'holds', 'for', 'd2', 'or', '3', 'and', 'it', 'was', 'conjectured', 'independently', 'by', 'mary', 'and', 'evans', 'et', 'al', 'to', 'hold', 'for', 'larger', 'd', 'here', 'we', 'disprove', 'the', 'conjecture', 'already', 'for', 'd', '4']]
|
[-0.1216428183110022, 0.0882909788336743, -0.061938346560469, 0.0516168298947481, -0.06484224561723025, -0.15415781697758088, 0.018652995586455837, 0.34423851606443645, -0.2581926091702852, -0.2562932096292999, 0.08420740196204979, -0.2890636781363074, -0.18571585902330898, 0.1675811173182314, -0.13659774070620778, 0.029430000102942493, 0.027838648372609926, 0.042555965810665876, -0.02048080632220802, -0.3034211084558023, 0.29415968936921016, -0.0033324836579159025, 0.18764989993750777, 0.0792885795538503, 0.07872164848722457, 0.056873930408051464, 0.007934174625339305, 0.07962287980608823, -0.1929735478390684, 0.08996289471643258, 0.2057223376435629, 0.14183484940529126, 0.20435525064273335, -0.30426077204481966, -0.19241521614452264, 0.15971806735118352, 0.11250560025010652, 0.06669968345989966, 0.007599138546871339, -0.24398528664880167, 0.13646220015286187, -0.08223588570452682, -0.18100139851931754, 0.0062207384751939284, 0.17539590709592875, -0.02504710347497669, -0.3182003240297904, 0.04357872767055907, 0.16371356883669289, 0.07945205160436539, 0.017200088582751228, -0.12935389954278745, -0.046468165712582506, 0.08054267342213722, -0.08461167669677122, 0.16256968959280085, 0.004751431455691837, -0.028351973255763087, -0.15933371868790921, 0.36691213289760355, 0.009896842293380722, -0.19507540061282433, 0.17419495103299634, -0.15328986745903161, -0.15469324616412441, 0.08125405322109175, 0.08718891410020793, 0.1458655874570453, -0.08749597027047908, 0.18294305603703243, -0.15968269664733634, 0.10500523963625111, 0.18680251722519353, -0.04096045500099114, 0.09566497555896034, 0.11833743977443717, 0.13799075351656998, 0.15189554714181316, -0.03256334503450075, -0.04559137992186063, -0.2694732486724672, -0.18029230645274727, -0.27731215437435036, 0.10106465782652177, -0.1485536597226415, -0.15813654820942055, 0.2767195580300035, 0.06868506361490467, 0.20767735819355015, 0.09167466660189193, 0.19264901838288073, 0.0681013509744023, 0.05332751472185298, 0.13753781126948392, 0.17681736040981563, 0.16839060377200868, 0.02857657308440383, -0.11617931739306002, 0.03486263086428729, 0.17686708301033188]
|
1,803.09577
|
Discrete Morse theory for the collapsibility of supremum sections
|
The Dushnik-Miller dimension of a poset $\le$ is the minimal number $d$ of
linear extensions $\le_1, \ldots , \le_d$ of $\le$ such that $\le$ is the
intersection of $\le_1, \ldots , \le_d$. Supremum sections are simplicial
complexes introduced by Scarf and are linked to the Dushnik-Miller as follows:
the inclusion poset of a simplicial complex is of Dushnik-Miller dimension at
most $d$ if and only if it is included in a supremum section coming from a
representation of dimension $d$. Collapsibility is a topoligical property of
simplicial complexes which has been introduced by Whitehead and which resembles
to shellability. While Ossona de Mendez proved in that a particular type of
supremum sections are shellable, we show in this article that supremum sections
are in general collapsible thanks to the discrete Morse theory developped by
Forman.
|
cs.DM math.CO
|
the dushnikmiller dimension of a poset le is the minimal number d of linear extensions le_1 ldots le_d of le such that le is the intersection of le_1 ldots le_d supremum sections are simplicial complexes introduced by scarf and are linked to the dushnikmiller as follows the inclusion poset of a simplicial complex is of dushnikmiller dimension at most d if and only if it is included in a supremum section coming from a representation of dimension d collapsibility is a topoligical property of simplicial complexes which has been introduced by whitehead and which resembles to shellability while ossona de mendez proved in that a particular type of supremum sections are shellable we show in this article that supremum sections are in general collapsible thanks to the discrete morse theory developped by forman
|
[['the', 'dushnikmiller', 'dimension', 'of', 'a', 'poset', 'le', 'is', 'the', 'minimal', 'number', 'd', 'of', 'linear', 'extensions', 'le_1', 'ldots', 'le_d', 'of', 'le', 'such', 'that', 'le', 'is', 'the', 'intersection', 'of', 'le_1', 'ldots', 'le_d', 'supremum', 'sections', 'are', 'simplicial', 'complexes', 'introduced', 'by', 'scarf', 'and', 'are', 'linked', 'to', 'the', 'dushnikmiller', 'as', 'follows', 'the', 'inclusion', 'poset', 'of', 'a', 'simplicial', 'complex', 'is', 'of', 'dushnikmiller', 'dimension', 'at', 'most', 'd', 'if', 'and', 'only', 'if', 'it', 'is', 'included', 'in', 'a', 'supremum', 'section', 'coming', 'from', 'a', 'representation', 'of', 'dimension', 'd', 'collapsibility', 'is', 'a', 'topoligical', 'property', 'of', 'simplicial', 'complexes', 'which', 'has', 'been', 'introduced', 'by', 'whitehead', 'and', 'which', 'resembles', 'to', 'shellability', 'while', 'ossona', 'de', 'mendez', 'proved', 'in', 'that', 'a', 'particular', 'type', 'of', 'supremum', 'sections', 'are', 'shellable', 'we', 'show', 'in', 'this', 'article', 'that', 'supremum', 'sections', 'are', 'in', 'general', 'collapsible', 'thanks', 'to', 'the', 'discrete', 'morse', 'theory', 'developped', 'by', 'forman']]
|
[-0.1291111802354201, 0.11782316505118753, -0.06714996566050545, 0.07384814991206495, -0.058851672509318276, -0.1343512098431926, -0.062379713012364155, 0.30863521688716544, -0.3011428441967644, -0.18675320142188645, 0.06804362217415914, -0.3085204487892263, -0.15171285981143062, 0.13374613433949312, -0.13955179818863558, -0.022371858876078586, 0.021813550312248426, 0.07307679336659159, 0.02636268830710006, -0.29393530160075787, 0.3547519496254002, -0.019232582230346674, 0.17391425462891208, 0.1021258661915481, 0.0951852673932797, 0.00964282323944975, -0.01653193395274381, 0.05814363243751524, -0.20164298183529658, 0.14231417425661208, 0.2907218864526261, 0.13612302635782259, 0.22244834104044872, -0.3084285287468722, -0.1487119316712558, 0.19658053781710227, 0.13833442384687564, -0.006663589516061951, 0.05576450239768195, -0.2562671877006351, 0.16433747679305574, -0.1429939258942437, -0.15586917813175893, -0.04986642390510745, 0.1355583924406815, 0.026081533438903563, -0.2814692002721131, 0.006110466289983103, 0.12087938043458218, 0.11304842917051053, 0.02647453491844124, -0.15907965118513498, -0.13085815036373044, 0.0145923777908496, -0.041520835684698824, 0.05124194642077341, 0.03606705692822509, -0.04873835241640777, -0.13989394581188785, 0.3561288382131324, -0.037702826014014354, -0.2072965917036389, 0.13224491423655613, -0.17493105516416219, -0.1717933968827834, 0.14793833175137866, 0.0487593822675108, 0.16691801548321647, -0.04266084206403431, 0.25655928060675226, -0.10778729350193206, 0.08561936493567897, 0.18390781972839526, 0.012901001336903199, 0.07086880250382378, 0.1226747434808534, 0.08410443892132731, 0.1059992252425714, 0.014211107600589678, -0.07884918519465084, -0.31526074469597504, -0.1838119855771462, -0.2043158247022692, 0.12761804829774934, -0.1015402853845444, -0.13760370823244253, 0.30529204393370135, 0.03751052602081362, 0.19484343128649265, 0.1295517056732382, 0.20688398944912478, 0.018083267216394288, 0.038190702093274784, 0.06568139821474413, 0.11604677807102262, 0.221411721863798, 0.0007841823160450792, -0.08735269756641972, 0.06358649748356336, 0.23182808716470996]
|
1,803.09578
|
Why Comparing Single Performance Scores Does Not Allow to Draw
Conclusions About Machine Learning Approaches
|
Developing state-of-the-art approaches for specific tasks is a major driving
force in our research community. Depending on the prestige of the task,
publishing it can come along with a lot of visibility. The question arises how
reliable are our evaluation methodologies to compare approaches?
One common methodology to identify the state-of-the-art is to partition data
into a train, a development and a test set. Researchers can train and tune
their approach on some part of the dataset and then select the model that
worked best on the development set for a final evaluation on unseen test data.
Test scores from different approaches are compared, and performance differences
are tested for statistical significance.
In this publication, we show that there is a high risk that a statistical
significance in this type of evaluation is not due to a superior learning
approach. Instead, there is a high risk that the difference is due to chance.
For example for the CoNLL 2003 NER dataset we observed in up to 26% of the
cases type I errors (false positives) with a threshold of p < 0.05, i.e.,
falsely concluding a statistically significant difference between two identical
approaches.
We prove that this evaluation setup is unsuitable to compare learning
approaches. We formalize alternative evaluation setups based on score
distributions.
|
cs.LG cs.AI cs.CL stat.ML
|
developing stateoftheart approaches for specific tasks is a major driving force in our research community depending on the prestige of the task publishing it can come along with a lot of visibility the question arises how reliable are our evaluation methodologies to compare approaches one common methodology to identify the stateoftheart is to partition data into a train a development and a test set researchers can train and tune their approach on some part of the dataset and then select the model that worked best on the development set for a final evaluation on unseen test data test scores from different approaches are compared and performance differences are tested for statistical significance in this publication we show that there is a high risk that a statistical significance in this type of evaluation is not due to a superior learning approach instead there is a high risk that the difference is due to chance for example for the conll 2003 ner dataset we observed in up to 26 of the cases type i errors false positives with a threshold of p 005 ie falsely concluding a statistically significant difference between two identical approaches we prove that this evaluation setup is unsuitable to compare learning approaches we formalize alternative evaluation setups based on score distributions
|
[['developing', 'stateoftheart', 'approaches', 'for', 'specific', 'tasks', 'is', 'a', 'major', 'driving', 'force', 'in', 'our', 'research', 'community', 'depending', 'on', 'the', 'prestige', 'of', 'the', 'task', 'publishing', 'it', 'can', 'come', 'along', 'with', 'a', 'lot', 'of', 'visibility', 'the', 'question', 'arises', 'how', 'reliable', 'are', 'our', 'evaluation', 'methodologies', 'to', 'compare', 'approaches', 'one', 'common', 'methodology', 'to', 'identify', 'the', 'stateoftheart', 'is', 'to', 'partition', 'data', 'into', 'a', 'train', 'a', 'development', 'and', 'a', 'test', 'set', 'researchers', 'can', 'train', 'and', 'tune', 'their', 'approach', 'on', 'some', 'part', 'of', 'the', 'dataset', 'and', 'then', 'select', 'the', 'model', 'that', 'worked', 'best', 'on', 'the', 'development', 'set', 'for', 'a', 'final', 'evaluation', 'on', 'unseen', 'test', 'data', 'test', 'scores', 'from', 'different', 'approaches', 'are', 'compared', 'and', 'performance', 'differences', 'are', 'tested', 'for', 'statistical', 'significance', 'in', 'this', 'publication', 'we', 'show', 'that', 'there', 'is', 'a', 'high', 'risk', 'that', 'a', 'statistical', 'significance', 'in', 'this', 'type', 'of', 'evaluation', 'is', 'not', 'due', 'to', 'a', 'superior', 'learning', 'approach', 'instead', 'there', 'is', 'a', 'high', 'risk', 'that', 'the', 'difference', 'is', 'due', 'to', 'chance', 'for', 'example', 'for', 'the', 'conll', '2003', 'ner', 'dataset', 'we', 'observed', 'in', 'up', 'to', '26', 'of', 'the', 'cases', 'type', 'i', 'errors', 'false', 'positives', 'with', 'a', 'threshold', 'of', 'p', '005', 'ie', 'falsely', 'concluding', 'a', 'statistically', 'significant', 'difference', 'between', 'two', 'identical', 'approaches', 'we', 'prove', 'that', 'this', 'evaluation', 'setup', 'is', 'unsuitable', 'to', 'compare', 'learning', 'approaches', 'we', 'formalize', 'alternative', 'evaluation', 'setups', 'based', 'on', 'score', 'distributions']]
|
[-0.051192287219843514, -0.0013650151271867115, -0.0913567928069363, 0.1048707565196523, -0.09500069593892656, -0.16636599616711617, 0.09076105095577282, 0.4156373777369938, -0.18494417025825718, -0.34264192810121424, 0.07933895476941269, -0.309194199421701, -0.12921915124301656, 0.2438278414687238, -0.127477869941818, 0.04606128070271736, 0.13872566066481207, 0.043904687892295804, -0.06149474709041137, -0.2887455136717424, 0.29825123207219506, 0.030451918805691418, 0.36164577018705685, 0.04246153332677805, 0.08762539771523221, -0.071351589812097, -0.049044756310611545, 0.02569160402426134, -0.08655198155594208, 0.1419569927425137, 0.2905627995174151, 0.2007282393407339, 0.36338280749773966, -0.3294048042609378, -0.16229953382933784, 0.11060261970578295, 0.10024932345392908, 0.1048145195198171, -0.0337782557753129, -0.2794377147941522, 0.0962569499322751, -0.17731481201634108, -0.036396209764875856, -0.11430540944104184, 0.036937002460975116, -0.01906928458981251, -0.2809131667236557, 0.05364164422231206, 0.03820217205124072, 0.0771106715934972, -0.03946252858939585, -0.14911099417056417, 0.0574594074029458, 0.1488932096377505, 0.08482659225212191, 0.06742966591769681, 0.13049916591945634, -0.13220353312396876, -0.16625156324627882, 0.38187280383853006, -0.05706199972962462, -0.21953558614650703, 0.22791817897226785, -0.06695745328327579, -0.16509173662257445, 0.08385423267098414, 0.21539990220682373, 0.07230754634321715, -0.15654304951971545, -0.002869817289466939, -0.01803788810557393, 0.18465411951634245, 0.060204032465308345, -0.052778122801237476, 0.18626682470255299, 0.2092024248110856, 0.02507823584502904, 0.11868257094130899, -0.10719756540807375, -0.07654421025408353, -0.27282970013838054, -0.13038815728480546, -0.1657084017694696, 0.0146709139445308, -0.05221173912915292, -0.15175774387748553, 0.39971913514929897, 0.24386140127140785, 0.18219396868390533, 0.06473107535300225, 0.32227334789188467, 0.05414638883544093, 0.06793614057277465, 0.05899622088856776, 0.22792023040276094, 0.017320844248806765, 0.06599250714570074, -0.16560233712191977, 0.09681889393909052, -0.005859889534953544]
|
1,803.09579
|
Schramm-Loewner evolution with Lie superalgebra symmetry
|
We propose a generalization of Schramm-Loewner evolution (SLE) that has
internal degrees of freedom described by an affine Lie superalgebra. We give a
general formulation of SLE corresponding to representation theory of an affine
Lie superalgebra whose underlying finite dimensional Lie superalgebra is basic
classical type, and write down stochastic differential equations on internal
degrees of freedom in case that the corresponding affine Lie superalgebra is
$\widehat{\mathfrak{osp}(1|2)}$. We also demonstrate computation of local
martingales associated with the solution from a representation of
$\widehat{\mathfrak{osp}(1|2)}$.
|
math-ph cond-mat.stat-mech math.MP math.PR math.QA math.RT
|
we propose a generalization of schrammloewner evolution sle that has internal degrees of freedom described by an affine lie superalgebra we give a general formulation of sle corresponding to representation theory of an affine lie superalgebra whose underlying finite dimensional lie superalgebra is basic classical type and write down stochastic differential equations on internal degrees of freedom in case that the corresponding affine lie superalgebra is widehatmathfrakosp12 we also demonstrate computation of local martingales associated with the solution from a representation of widehatmathfrakosp12
|
[['we', 'propose', 'a', 'generalization', 'of', 'schrammloewner', 'evolution', 'sle', 'that', 'has', 'internal', 'degrees', 'of', 'freedom', 'described', 'by', 'an', 'affine', 'lie', 'superalgebra', 'we', 'give', 'a', 'general', 'formulation', 'of', 'sle', 'corresponding', 'to', 'representation', 'theory', 'of', 'an', 'affine', 'lie', 'superalgebra', 'whose', 'underlying', 'finite', 'dimensional', 'lie', 'superalgebra', 'is', 'basic', 'classical', 'type', 'and', 'write', 'down', 'stochastic', 'differential', 'equations', 'on', 'internal', 'degrees', 'of', 'freedom', 'in', 'case', 'that', 'the', 'corresponding', 'affine', 'lie', 'superalgebra', 'is', 'widehatmathfrakosp12', 'we', 'also', 'demonstrate', 'computation', 'of', 'local', 'martingales', 'associated', 'with', 'the', 'solution', 'from', 'a', 'representation', 'of', 'widehatmathfrakosp12']]
|
[-0.14672979176695267, 0.07128587383138722, -0.07883687005995448, 0.0018861867650131505, -0.18312989937208862, -0.14985970915463495, -0.029112476716659605, 0.3060602949727439, -0.350594165858375, -0.22457450879625526, 0.11225560254204166, -0.19691167437437787, -0.19871313748769012, 0.14487399850938334, -0.13245479607111663, -0.06827163890408106, -0.001899483658552888, 0.13698901224836527, -0.13062391567593776, -0.2340279698024044, 0.34457470075485397, -0.013719467019819352, 0.20077236910092544, -0.08177737550563123, 0.2547557359752077, 0.03859120976819421, 0.008166749232325209, -0.033179664782371866, -0.14469855137997592, 0.13615690883394915, 0.2711704852485872, 0.07222583762044649, 0.1816612855946443, -0.3998844394886709, -0.13331335181011314, 0.10409174041530814, 0.2000438897454612, 0.08479584708735514, 0.022037483450216073, -0.26607505112875207, 0.00826765856066023, -0.1792362946175398, -0.24090282404122043, -0.07340362200693014, 0.04309328634247004, -0.044197392908025934, -0.20204843879194864, 0.1083821344819812, 0.09040999345773135, 0.14019477451644438, -0.09375539705639772, -0.08870378987027713, -0.086046473313886, 0.01757828946820045, -0.07938519587841289, 0.030737502702388418, 0.12393684421823058, -0.10764730100196307, -0.20955250053161598, 0.3416621510545353, 0.0015739947880046017, -0.29816748903424717, 0.14019396331116377, -0.16020311980721463, -0.186859892159476, 0.10600909793816776, 0.1358748441674264, 0.13760469346699944, -0.1510982587821333, 0.23236243474987653, -0.076479653648314, 0.02464986421975745, 0.03366619773792574, 0.028088916292980718, 0.15735010348305287, 0.14367008549217358, 0.05942212444371039, 0.13028155424329171, 0.052264935047371334, -0.14124639765415564, -0.4092591333102031, -0.19310821107790682, -0.08714984421315322, 0.18320866947971196, -0.1886356059314209, -0.14272800958659276, 0.3892875006085778, 0.1162011620535302, 0.13751344398471965, 0.1404298399967781, 0.15890276301876607, 0.1924871289653771, 0.10069750601717506, 0.0918933345700603, 0.11125793565535941, 0.2934601237009986, -0.02155399196276284, -0.20873700525381614, -0.07173619727907052, 0.1890372254896954]
|
1,803.0958
|
Finite horizon risk-sensitive continuous-time Markov decision processes
with unbounded transition and cost rates
|
We consider a risk-sensitive continuous-time Markov decision process over a
finite time duration. Under the conditions that can be satisfied by unbounded
transition and cost rates, we show the existence of an optimal policy, and the
existence and uniqueness of the solution to the optimality equation out of a
class of possibly unbounded functions, to which the Feynman-Kac formula was
also justified to hold.
|
math.OC
|
we consider a risksensitive continuoustime markov decision process over a finite time duration under the conditions that can be satisfied by unbounded transition and cost rates we show the existence of an optimal policy and the existence and uniqueness of the solution to the optimality equation out of a class of possibly unbounded functions to which the feynmankac formula was also justified to hold
|
[['we', 'consider', 'a', 'risksensitive', 'continuoustime', 'markov', 'decision', 'process', 'over', 'a', 'finite', 'time', 'duration', 'under', 'the', 'conditions', 'that', 'can', 'be', 'satisfied', 'by', 'unbounded', 'transition', 'and', 'cost', 'rates', 'we', 'show', 'the', 'existence', 'of', 'an', 'optimal', 'policy', 'and', 'the', 'existence', 'and', 'uniqueness', 'of', 'the', 'solution', 'to', 'the', 'optimality', 'equation', 'out', 'of', 'a', 'class', 'of', 'possibly', 'unbounded', 'functions', 'to', 'which', 'the', 'feynmankac', 'formula', 'was', 'also', 'justified', 'to', 'hold']]
|
[-0.13475718435802264, 0.08191828308395088, -0.11395133618498221, 0.11356270999127105, -0.09277231379746809, -0.13001037216599798, 0.121860086437664, 0.39559541520429775, -0.31748081580735743, -0.20659671719477046, 0.18830792643348104, -0.192089455522364, -0.1155046290368773, 0.1910041437986365, -0.0896148784813704, 0.10455178244774288, 0.057013839275896316, 0.040086490800604224, -0.06405801535674982, -0.2690088200070022, 0.3217299225307215, 0.027551052990020253, 0.23753698612563312, 0.07281906572688968, 0.17350491943216184, 0.005870829059858806, 0.07086951658857288, 0.01801162731135264, -0.16295150334610753, 0.04061223035387229, 0.28892396003357135, 0.13986895803827792, 0.3568178630521288, -0.3899237879377324, -0.2067273065331392, 0.19259715346925077, 0.0678314575488912, 0.06726153960880765, -0.021947337925666943, -0.3114110654896649, 0.11141451875664643, -0.1543026075232774, -0.17427738910919288, -0.03951444584890851, -0.013787591182335746, 0.05847153326612897, -0.3629051663156133, 0.07262357198806058, 0.10360255830164533, -0.020970132893125992, -0.14453790994593874, -0.03917965650180122, -0.01758064790192293, 0.08864428741435404, 0.07286095272638704, -0.04088597057852894, 0.07572095353680197, -0.09588464529224439, -0.15236321407428477, 0.287225209583994, -0.0917207518214127, -0.23472102123196237, 0.15411128997311607, -0.11725105770892696, -0.11396635307755787, 0.17009124090964178, 0.1754671972594224, 0.1789409825578332, -0.1984725104557583, 0.10196359661949828, -0.07510140807426069, 0.12104241964698303, 0.06278834569093306, 0.02105013338587014, 0.09061898692743853, 0.1263202257323428, 0.16819071139616426, 0.20116047682495264, 0.021707691987103317, -0.1854611454764381, -0.3601637975079939, -0.17054480719889398, -0.14442404532746878, 0.09832881860711495, -0.1220181182354736, -0.17195451584120747, 0.32452229694172274, 0.17241559605463408, 0.14915331736483495, 0.17694164343265584, 0.1882983043396962, 0.24741490624728613, -0.02626656141364947, 0.09226826796657406, 0.15328953991411254, 0.12757113014231436, 0.10981142884520523, -0.24243264036340406, 0.15654238968272693, 0.11199194856453687]
|
1,803.09581
|
Photophysics of pentacene-doped picene thin films
|
Here were report a study of picene nano-cristalline thin films doped with
pentacene molecules. The thin films were grown by supersonic molecular beam
deposition with a doping concentration that ranges between less than one
molecules of pentacene every 104 picene molecules up to about one molecule of
pentacene every 102 of picene. Morphology and opto-electronic properties of the
films were studied as a function of the concentration of dopants. The optical
response of the picene films, characterized by absorption, steady-state and
time-resolved photoluminescence measurements, changes dramatically after the
doping with pentacene. An efficient energy transfer from the picene host matrix
to the pentacene guest molecules was observed giving rise to an intense
photoluminescence coming out from pentacene. This efficient mechanism opens the
possibility to exploit applications where the excitonic states of the guest
component, pentacene, are of major interest such as MASER. The observed
mechanism could also serve as prototypical system for the study of the
photophysics of host guest systems based on different phenacenes and acenes.
|
cond-mat.mtrl-sci
|
here were report a study of picene nanocristalline thin films doped with pentacene molecules the thin films were grown by supersonic molecular beam deposition with a doping concentration that ranges between less than one molecules of pentacene every 104 picene molecules up to about one molecule of pentacene every 102 of picene morphology and optoelectronic properties of the films were studied as a function of the concentration of dopants the optical response of the picene films characterized by absorption steadystate and timeresolved photoluminescence measurements changes dramatically after the doping with pentacene an efficient energy transfer from the picene host matrix to the pentacene guest molecules was observed giving rise to an intense photoluminescence coming out from pentacene this efficient mechanism opens the possibility to exploit applications where the excitonic states of the guest component pentacene are of major interest such as maser the observed mechanism could also serve as prototypical system for the study of the photophysics of host guest systems based on different phenacenes and acenes
|
[['here', 'were', 'report', 'a', 'study', 'of', 'picene', 'nanocristalline', 'thin', 'films', 'doped', 'with', 'pentacene', 'molecules', 'the', 'thin', 'films', 'were', 'grown', 'by', 'supersonic', 'molecular', 'beam', 'deposition', 'with', 'a', 'doping', 'concentration', 'that', 'ranges', 'between', 'less', 'than', 'one', 'molecules', 'of', 'pentacene', 'every', '104', 'picene', 'molecules', 'up', 'to', 'about', 'one', 'molecule', 'of', 'pentacene', 'every', '102', 'of', 'picene', 'morphology', 'and', 'optoelectronic', 'properties', 'of', 'the', 'films', 'were', 'studied', 'as', 'a', 'function', 'of', 'the', 'concentration', 'of', 'dopants', 'the', 'optical', 'response', 'of', 'the', 'picene', 'films', 'characterized', 'by', 'absorption', 'steadystate', 'and', 'timeresolved', 'photoluminescence', 'measurements', 'changes', 'dramatically', 'after', 'the', 'doping', 'with', 'pentacene', 'an', 'efficient', 'energy', 'transfer', 'from', 'the', 'picene', 'host', 'matrix', 'to', 'the', 'pentacene', 'guest', 'molecules', 'was', 'observed', 'giving', 'rise', 'to', 'an', 'intense', 'photoluminescence', 'coming', 'out', 'from', 'pentacene', 'this', 'efficient', 'mechanism', 'opens', 'the', 'possibility', 'to', 'exploit', 'applications', 'where', 'the', 'excitonic', 'states', 'of', 'the', 'guest', 'component', 'pentacene', 'are', 'of', 'major', 'interest', 'such', 'as', 'maser', 'the', 'observed', 'mechanism', 'could', 'also', 'serve', 'as', 'prototypical', 'system', 'for', 'the', 'study', 'of', 'the', 'photophysics', 'of', 'host', 'guest', 'systems', 'based', 'on', 'different', 'phenacenes', 'and', 'acenes']]
|
[-0.0794049566289051, 0.15645511684036695, -0.01684236915007862, -0.04997583514946255, 0.043257862228496244, -0.15100407600122312, 0.08637819776146011, 0.4622510793921818, -0.24088428016886654, -0.32318620277142307, -0.018196648559028125, -0.3359081479040513, -0.07285964069958126, 0.19382238509245667, 0.03977261978855177, 0.02510309001116688, -0.02189452526599999, -0.14637055911308894, -0.05984419106761083, -0.18245329532817187, 0.23449783293384474, 0.08527558023272733, 0.27839307524881, 0.10800483943603467, 0.03707654119738524, -0.05042377733120538, 0.12175818455141846, -0.07779214195121663, -0.17896294370820467, 0.12665582035254605, 0.2801457454888038, -0.08333730593419084, 0.22744262797185724, -0.48586718689093467, -0.24026895972552248, -0.017693512513392032, 0.11850425957545009, 0.1333681738161179, -0.12554677115837098, -0.2643222017017339, 0.026108141048777712, -0.12421841184427704, -0.12212007205669645, -0.04818223938009286, 0.04197482656440642, 0.045775686553398885, -0.168624263216113, 0.06815777199903184, -0.0043960665969784, 0.07822879638343332, -0.13498218984803162, -0.15400341740481174, -0.13957411935272435, 0.06848267788146005, 0.028168095090617257, 0.008588354044358235, 0.2917702091775038, -0.07286450061919056, -0.09695756514500602, 0.4000870892834143, -0.05729205903770046, -0.010799926301711294, 0.17923354535329952, -0.1649357525194176, -0.1017695418755378, 0.2048201866767717, 0.09110841362355614, 0.17970995105107326, -0.161983040268028, 0.017094235759612778, -0.052301728955599064, 0.2563776300591697, 0.10600439940280483, 0.14806625176591418, 0.23043168682593806, 0.2240323292719851, -0.0076319958049669324, 0.18227469729798207, -0.12893552929078825, 0.015365018714107124, -0.12410156202715743, -0.23164806177794753, -0.21244176433152373, 0.1252018244648128, -0.03977095351404727, -0.16695187561752567, 0.41967376107237786, 0.056534768233681656, 0.1682753245940948, -0.0780777022865298, 0.19097032932093344, 0.029264127513034695, 0.0834880961842992, -0.03213360351201775, 0.24340155114790044, 0.16532577166098159, 0.10066078451805024, -0.27440141131596485, 0.15073915763971318, -0.04813793583854427]
|
1,803.09582
|
On accumulation points of volumes of log surfaces
|
Let $\mathcal C\subset(0,1]$ be a set satisfying the descending chain
condition. We show that any accumulation point of volumes of log canonical
surfaces $(X, B)$ with coefficients in $\mathcal C$ can be realized as the
volume of a log canonical surface with big and nef $K_X+B$ and coefficients in
$\overline{\mathcal C}\cup\{1\}$, with at least one coefficient in
$Acc(\mathcal C)\cup\{1\}$.
As a corollary, if $\overline{\mathcal C}\subset\mathbb Q$ then all
accumulation points of volumes are rational numbers, solving a conjecture of
Blache.
For the set of standard coefficients $\mathcal C_2=\{1-\frac{1}{n}\mid
n\in\mathbb N\}\cup\{1\}$ we prove that the minimal accumulation point is
between $\frac1{7^2\cdot 42^2}$ and $\frac1{42^2}$.
|
math.AG
|
let mathcal csubset01 be a set satisfying the descending chain condition we show that any accumulation point of volumes of log canonical surfaces x b with coefficients in mathcal c can be realized as the volume of a log canonical surface with big and nef k_xb and coefficients in overlinemathcal ccup1 with at least one coefficient in accmathcal ccup1 as a corollary if overlinemathcal csubsetmathbb q then all accumulation points of volumes are rational numbers solving a conjecture of blache for the set of standard coefficients mathcal c_21frac1nmid ninmathbb ncup1 we prove that the minimal accumulation point is between frac172cdot 422 and frac1422
|
[['let', 'mathcal', 'csubset01', 'be', 'a', 'set', 'satisfying', 'the', 'descending', 'chain', 'condition', 'we', 'show', 'that', 'any', 'accumulation', 'point', 'of', 'volumes', 'of', 'log', 'canonical', 'surfaces', 'x', 'b', 'with', 'coefficients', 'in', 'mathcal', 'c', 'can', 'be', 'realized', 'as', 'the', 'volume', 'of', 'a', 'log', 'canonical', 'surface', 'with', 'big', 'and', 'nef', 'k_xb', 'and', 'coefficients', 'in', 'overlinemathcal', 'ccup1', 'with', 'at', 'least', 'one', 'coefficient', 'in', 'accmathcal', 'ccup1', 'as', 'a', 'corollary', 'if', 'overlinemathcal', 'csubsetmathbb', 'q', 'then', 'all', 'accumulation', 'points', 'of', 'volumes', 'are', 'rational', 'numbers', 'solving', 'a', 'conjecture', 'of', 'blache', 'for', 'the', 'set', 'of', 'standard', 'coefficients', 'mathcal', 'c_21frac1nmid', 'ninmathbb', 'ncup1', 'we', 'prove', 'that', 'the', 'minimal', 'accumulation', 'point', 'is', 'between', 'frac172cdot', '422', 'and', 'frac1422']]
|
[-0.1714897662985753, 0.12841810581294147, -0.05289410767913301, 0.0004963771244411931, -0.002449267826221408, -0.16930516888486577, 0.03588749455694268, 0.29840415801872755, -0.3194311613296258, -0.20400131178494701, 0.0966316740476883, -0.3275644183530413, -0.11174504500516552, 0.21558787465154966, -0.09615037385176153, -0.0072816864815243385, 0.034637621945721356, 0.0752935770185704, -0.10189647168698819, -0.2798136983864366, 0.32299064070065603, -0.07799650689071798, 0.18918682364846004, 0.06459786324821254, 0.13350816423747133, -0.02388299361089284, 0.06884996222946396, 0.028083012327849072, -0.15000711426592775, 0.09628390263706604, 0.27525235122030084, 0.10869953409580395, 0.194222268351215, -0.3647066326712833, -0.13620878052848212, 0.26051331231212044, 0.1036850409433642, -0.03312680219359537, 0.009925307743152248, -0.1608766491346537, 0.19419764692150798, -0.11585362552803882, -0.1839853570588488, -0.05691855773825119, 0.09321457913957854, 0.018593223017462072, -0.33783294788581575, 0.032693800892918665, 0.04369218214514091, 0.12485489336417076, 0.014571106209954682, -0.13817361884928764, -0.14270351916313806, 0.04650498937909551, 0.007062384677912168, 0.09354557717179364, 0.06773073471924092, -0.06830306615720087, -0.0722390491703644, 0.369823238019772, -0.112009037315147, -0.21524742879766098, 0.10589726805251012, -0.19185645360142944, -0.11464055738055166, 0.11967132152850798, 0.10266099716511931, 0.17203597470800927, -0.023905113289885697, 0.21124909843746673, -0.10698262806189188, 0.11871699959180873, 0.12869112887865605, -0.018134859380649127, 0.1744785354314174, 0.07847399233364837, 0.07428356318021233, 0.0729249661182737, -0.050410858910293024, -0.008111484036681818, -0.4012700555885726, -0.23713499748524516, -0.1519808045135157, 0.17532332007713775, -0.14473357713397994, -0.1698561158474594, 0.27990911585932715, 0.04954744224094495, 0.2996655189769065, 0.09856060047217823, 0.20131441586195153, 0.10327461013660835, 0.040205689922391256, 0.11263885137444224, 0.0624197842107412, 0.10810429587009106, -0.061971641076292765, -0.14682187413440106, 0.005058966339887813, 0.18648560527350477]
|
1,803.09583
|
Electrical energy prediction study case based on neural networks
|
This paper presents some considerations regarding the prediction of the
electrical energy consumption. It is well known that the central element of a
microeconomic analysis is represented by the economical agents actions, actions
that follow their own interest such as: the consumer maximization of his
satisfaction, the producer maximization of his profit. The study case is
focused on the prediction of the sold energy in Banat region. The goal of this
study case is to optimize the electrical energy quantity purchased from the
producer by the energy distributor in Banat region. The prediction is based on
neural networks. There are used feed-forward and Elman type neural networks. In
order to enhance the prediction accuracy there have been used both linear and
nonlinear preprocessing units. The aspects considered in this paper can be
extrapolated in any general case of prediction based application, not only in
the already stated case of electrical energy.
|
cs.SY
|
this paper presents some considerations regarding the prediction of the electrical energy consumption it is well known that the central element of a microeconomic analysis is represented by the economical agents actions actions that follow their own interest such as the consumer maximization of his satisfaction the producer maximization of his profit the study case is focused on the prediction of the sold energy in banat region the goal of this study case is to optimize the electrical energy quantity purchased from the producer by the energy distributor in banat region the prediction is based on neural networks there are used feedforward and elman type neural networks in order to enhance the prediction accuracy there have been used both linear and nonlinear preprocessing units the aspects considered in this paper can be extrapolated in any general case of prediction based application not only in the already stated case of electrical energy
|
[['this', 'paper', 'presents', 'some', 'considerations', 'regarding', 'the', 'prediction', 'of', 'the', 'electrical', 'energy', 'consumption', 'it', 'is', 'well', 'known', 'that', 'the', 'central', 'element', 'of', 'a', 'microeconomic', 'analysis', 'is', 'represented', 'by', 'the', 'economical', 'agents', 'actions', 'actions', 'that', 'follow', 'their', 'own', 'interest', 'such', 'as', 'the', 'consumer', 'maximization', 'of', 'his', 'satisfaction', 'the', 'producer', 'maximization', 'of', 'his', 'profit', 'the', 'study', 'case', 'is', 'focused', 'on', 'the', 'prediction', 'of', 'the', 'sold', 'energy', 'in', 'banat', 'region', 'the', 'goal', 'of', 'this', 'study', 'case', 'is', 'to', 'optimize', 'the', 'electrical', 'energy', 'quantity', 'purchased', 'from', 'the', 'producer', 'by', 'the', 'energy', 'distributor', 'in', 'banat', 'region', 'the', 'prediction', 'is', 'based', 'on', 'neural', 'networks', 'there', 'are', 'used', 'feedforward', 'and', 'elman', 'type', 'neural', 'networks', 'in', 'order', 'to', 'enhance', 'the', 'prediction', 'accuracy', 'there', 'have', 'been', 'used', 'both', 'linear', 'and', 'nonlinear', 'preprocessing', 'units', 'the', 'aspects', 'considered', 'in', 'this', 'paper', 'can', 'be', 'extrapolated', 'in', 'any', 'general', 'case', 'of', 'prediction', 'based', 'application', 'not', 'only', 'in', 'the', 'already', 'stated', 'case', 'of', 'electrical', 'energy']]
|
[-0.09712092968826459, 0.023630431288312072, -0.031099795066251955, 0.06497952649030612, -0.06993554878535847, -0.126901863614677, 0.07197217435563687, 0.37737921965832744, -0.2502010374989928, -0.3079737548204447, 0.12079338198034278, -0.2830619405591182, -0.16512258988589246, 0.17374346458309928, -0.1258074806803461, 0.04208853931184735, 0.045169386667328955, 0.10812930687830247, 0.02313759062857065, -0.2739540536530217, 0.281459482719764, 0.10477603162756029, 0.32331343111736294, 0.07289601344035457, 0.07367513721364717, 0.020494217671367606, -0.03039788647511641, 0.02096326117533327, -0.09759403550305437, 0.14511425287265406, 0.306826316191821, 0.14281964525078317, 0.32657754685211654, -0.4287886997154414, -0.23213197417951972, 0.15274943984098213, 0.0851365021940333, 0.034401503584304494, -0.02811351560969029, -0.22111338214788412, 0.07202627379385544, -0.20279155192983073, -0.05601686727724328, -0.048542929689911814, -0.0357911516041094, 0.039293682088594364, -0.24432952952762413, 0.035321109955945354, 0.041466185163910076, 0.042350379139530346, -0.07790930924122992, -0.11461386508817187, -0.03150947581181019, 0.17604609872276172, 0.08385888516859749, 0.026959117983054642, 0.1491755083795415, -0.15716325949464266, -0.1281665419305471, 0.4013550473956872, -0.026269677117473095, -0.20464629294359996, 0.1369015067562905, -0.08257120357986712, -0.13803983937381514, 0.07227274416853359, 0.19531181420119392, 0.10094906545139307, -0.1728328911692447, 0.061088747448991024, -0.04438837091222603, 0.15850168506041268, 0.04053710443306936, 0.0045083746493683, 0.17592549793551743, 0.22403534473419584, 0.05609655162683435, 0.12053572214964087, -0.01589501987439611, -0.09771955725952786, -0.2616193375753745, -0.1409414324243337, -0.20151788069070964, 0.06198191793494016, -0.05337110814612994, -0.10213326115703938, 0.42913466166482855, 0.1413781776598698, 0.15541678200790424, 0.05269938331122035, 0.31881100314342425, 0.14649644561515912, 0.0679949469053316, 0.08593572648735531, 0.2638615670142501, 0.07472179064971228, 0.17263393771421437, -0.1808952587773863, 0.13138868165393638, 0.0526648347006975]
|
1,803.09584
|
Crossing the Architectural Barrier: Evaluating Representative Regions of
Parallel HPC Applications
|
Exascale computing will get mankind closer to solving important social,
scientific and engineering problems. Due to high prototyping costs, High
Performance Computing (HPC) system architects make use of simulation models for
design space exploration and hardware-software co-design. However, as HPC
systems reach exascale proportions, the cost of simulation increases, since
simulators themselves are largely single-threaded. Tools for selecting
representative parts of parallel applications to reduce running costs are
widespread, e.g., BarrierPoint achieves this by analysing, in simulation,
abstract characteristics such as basic blocks and reuse distances. However,
architectures new to HPC have a limited set of tools available.
In this work, we provide an independent cross-architectural evaluation on
real hardware - across Intel and ARM - of the BarrierPoint methodology, when
applied to parallel HPC proxy applications. We present both cases: when the
methodology can be applied and when it cannot. In the former case, results show
that we can predict the performance of full application execution by running
shorter representative sections. In the latter case, we dive into the
underlying issues and suggest improvements. We demonstrate a total simulation
time reduction of up to 178x, whilst keeping the error below 2.3% for both
cycles and instructions.
|
cs.PF cs.AR cs.DC
|
exascale computing will get mankind closer to solving important social scientific and engineering problems due to high prototyping costs high performance computing hpc system architects make use of simulation models for design space exploration and hardwaresoftware codesign however as hpc systems reach exascale proportions the cost of simulation increases since simulators themselves are largely singlethreaded tools for selecting representative parts of parallel applications to reduce running costs are widespread eg barrierpoint achieves this by analysing in simulation abstract characteristics such as basic blocks and reuse distances however architectures new to hpc have a limited set of tools available in this work we provide an independent crossarchitectural evaluation on real hardware across intel and arm of the barrierpoint methodology when applied to parallel hpc proxy applications we present both cases when the methodology can be applied and when it cannot in the former case results show that we can predict the performance of full application execution by running shorter representative sections in the latter case we dive into the underlying issues and suggest improvements we demonstrate a total simulation time reduction of up to 178x whilst keeping the error below 23 for both cycles and instructions
|
[['exascale', 'computing', 'will', 'get', 'mankind', 'closer', 'to', 'solving', 'important', 'social', 'scientific', 'and', 'engineering', 'problems', 'due', 'to', 'high', 'prototyping', 'costs', 'high', 'performance', 'computing', 'hpc', 'system', 'architects', 'make', 'use', 'of', 'simulation', 'models', 'for', 'design', 'space', 'exploration', 'and', 'hardwaresoftware', 'codesign', 'however', 'as', 'hpc', 'systems', 'reach', 'exascale', 'proportions', 'the', 'cost', 'of', 'simulation', 'increases', 'since', 'simulators', 'themselves', 'are', 'largely', 'singlethreaded', 'tools', 'for', 'selecting', 'representative', 'parts', 'of', 'parallel', 'applications', 'to', 'reduce', 'running', 'costs', 'are', 'widespread', 'eg', 'barrierpoint', 'achieves', 'this', 'by', 'analysing', 'in', 'simulation', 'abstract', 'characteristics', 'such', 'as', 'basic', 'blocks', 'and', 'reuse', 'distances', 'however', 'architectures', 'new', 'to', 'hpc', 'have', 'a', 'limited', 'set', 'of', 'tools', 'available', 'in', 'this', 'work', 'we', 'provide', 'an', 'independent', 'crossarchitectural', 'evaluation', 'on', 'real', 'hardware', 'across', 'intel', 'and', 'arm', 'of', 'the', 'barrierpoint', 'methodology', 'when', 'applied', 'to', 'parallel', 'hpc', 'proxy', 'applications', 'we', 'present', 'both', 'cases', 'when', 'the', 'methodology', 'can', 'be', 'applied', 'and', 'when', 'it', 'can', 'not', 'in', 'the', 'former', 'case', 'results', 'show', 'that', 'we', 'can', 'predict', 'the', 'performance', 'of', 'full', 'application', 'execution', 'by', 'running', 'shorter', 'representative', 'sections', 'in', 'the', 'latter', 'case', 'we', 'dive', 'into', 'the', 'underlying', 'issues', 'and', 'suggest', 'improvements', 'we', 'demonstrate', 'a', 'total', 'simulation', 'time', 'reduction', 'of', 'up', 'to', '178x', 'whilst', 'keeping', 'the', 'error', 'below', '23', 'for', 'both', 'cycles', 'and', 'instructions']]
|
[-0.10929946331210279, 0.03714775702921239, -0.033942051364041013, 0.04413556308403107, -0.08434698519219334, -0.14022419540803335, 0.05214506850582742, 0.4127219047465284, -0.2595515301388029, -0.396278273993327, 0.13703639568120707, -0.22582041933492292, -0.12073996372540326, 0.292004407706069, -0.09206350510794437, 0.08999909835498936, 0.145378202128389, -0.039396518334342545, -0.06525669720546527, -0.32024850658399373, 0.2210925405203549, 0.09713456944640105, 0.31275180662244867, 0.06657283819307243, 0.04702178159398803, -0.027376563117286423, -0.03193812827278938, -0.0027425390127007176, -0.06449941461221442, 0.13191852527234005, 0.34467232602365055, 0.2004756633168275, 0.34115980642673094, -0.4719126214834735, -0.1507518457607754, 0.07593700680202649, 0.1696406781037846, 0.07875611701986902, -0.025389258640037344, -0.2449440746252852, 0.10888837940334876, -0.19986772596166702, -0.09677635558424906, -0.12819372330886836, 0.014411159383598715, 0.028644994635518135, -0.22446381347011388, -0.023112033879442606, -0.006237511504271727, 0.07002606769431925, -0.02937634254825146, -0.15247822442324832, 0.03512183735801955, 0.17847479293762566, 0.020309438662176642, 0.005602295950666303, 0.183887546544914, -0.13642582666337452, -0.15145645027708574, 0.40695165599269484, 0.006734406438530034, -0.18579712168624005, 0.21891909987607505, -0.05686763363216111, -0.1669892677414282, 0.07341744030903403, 0.26070272024874913, 0.05019467758514414, -0.12900826984688743, 0.07686441866614284, 0.07120239672925284, 0.15872686319198692, 0.040663020087473946, 0.02298895603598794, 0.18062862489872109, 0.23392057839252325, 0.07597689894282667, 0.16152791048322493, -0.024381939553374348, -0.12960432029179478, -0.24265912729739134, -0.18144718447971778, -0.15138418084582858, 0.00926369839127498, -0.09154984336729892, -0.14430567041563336, 0.34209894316397066, 0.23211909874559447, 0.1209655460461363, 0.09386227088892458, 0.38866492824490706, 0.06590891456357895, 0.13447965529242842, 0.1547873725333678, 0.1717015781517451, 0.016605328926137492, 0.1565166758861475, -0.17682261905186655, 0.07705885606568093, -0.04388910494405233]
|
1,803.09585
|
Secure Web Access Control Algorithm
|
The paper presents a flexible and efficient method to secure the access to a
Web site implemented in PHP script language. The algorithm is based on the PHP
session mechanism. The proposed method is a general one and offers the
possibility to implement a PHP based secured access to a Web site, through a
portal page and using an additional script included in any site page, which is
required to be accessed only by registered users. This paper presents the
design, implementation and integration of the algorithm on any generic WEB
site.
|
cs.CR
|
the paper presents a flexible and efficient method to secure the access to a web site implemented in php script language the algorithm is based on the php session mechanism the proposed method is a general one and offers the possibility to implement a php based secured access to a web site through a portal page and using an additional script included in any site page which is required to be accessed only by registered users this paper presents the design implementation and integration of the algorithm on any generic web site
|
[['the', 'paper', 'presents', 'a', 'flexible', 'and', 'efficient', 'method', 'to', 'secure', 'the', 'access', 'to', 'a', 'web', 'site', 'implemented', 'in', 'php', 'script', 'language', 'the', 'algorithm', 'is', 'based', 'on', 'the', 'php', 'session', 'mechanism', 'the', 'proposed', 'method', 'is', 'a', 'general', 'one', 'and', 'offers', 'the', 'possibility', 'to', 'implement', 'a', 'php', 'based', 'secured', 'access', 'to', 'a', 'web', 'site', 'through', 'a', 'portal', 'page', 'and', 'using', 'an', 'additional', 'script', 'included', 'in', 'any', 'site', 'page', 'which', 'is', 'required', 'to', 'be', 'accessed', 'only', 'by', 'registered', 'users', 'this', 'paper', 'presents', 'the', 'design', 'implementation', 'and', 'integration', 'of', 'the', 'algorithm', 'on', 'any', 'generic', 'web', 'site']]
|
[-0.14829076356861903, -0.04415533639368495, -0.08093015689645773, 0.055253047346765095, -0.16634257885870402, -0.23753026533750413, 0.1455043222547671, 0.4050276687308012, -0.24139888408472357, -0.306932657957077, 0.10698750195139006, -0.22098432369935123, -0.09352817710327066, 0.21513769747284445, -0.04006680256039228, -0.011481868801638484, 0.0775396975779744, 0.05331101987267966, 0.031868010130141476, -0.28860884983821405, 0.2576914758310127, 0.14083062950521708, 0.33808931560539035, 0.10373777462392235, 0.13266021336185868, 0.050082990342913115, -0.08558672410435975, -0.05742984572830408, -0.08103366183754786, 0.16758110082667807, 0.26354735078158503, 0.20697833100617255, 0.25804243074811023, -0.3900999758979711, -0.1204484060568654, 0.0168307621801353, 0.13561584501598112, 0.13714739372928464, -0.10141519879486979, -0.3111332874421192, 0.13387657380055473, -0.24125216797034701, -0.05908047980072139, -0.032093712746206184, -0.01837859218231524, -0.0262789907257842, -0.3102065502633037, -0.06924303648385989, 0.0039003023513309336, 0.0676938132180468, 0.017535594874061644, -0.00462529512562627, 0.00834739335772136, 0.14424046008523717, -0.017946315714178363, 0.08200782897335518, 0.1587239186350337, -0.031515991616407, -0.14602290011901894, 0.41860541264000145, -0.03862934197177705, -0.1867799144516618, 0.18536113639382404, 0.01207935942195194, -0.16222117063791855, 0.11847550367288616, 0.2173452708951157, 0.12705131608021, -0.2586427364579361, 0.08466523302384936, 0.003998723205017007, 0.2318121491470779, 0.016123239247067628, -0.0345675690300793, 0.18779872529937522, 0.23695891377840028, 0.03733254777793975, 0.1710245994656124, -0.04832536703590607, -0.05034959115816847, -0.26223574890552653, -0.22767103657774304, -0.21598077902529875, -0.04427287199170045, -0.03060302809424921, -0.1724733018680759, 0.4129226900961088, 0.19677501296341096, 0.11377111034791755, -0.008534412936094905, 0.36549214775795524, 0.024470113723984232, 0.12664755000530378, 0.13430543678164805, 0.09372156700524299, -0.027638494641945253, 0.23218813776949662, -0.09712770139879506, 0.13587988957094596, 0.09913254132002096]
|
1,803.09586
|
A One-Dimensional Peridynamic Model of Defect Propagation and its
Relation to Certain Other Continuum Models
|
The peridynamic model of a solid does not involve spatial gradients of the
displacement field and is therefore well suited for studying defect
propagation. Here, bond-based peridynamic theory is used to study the
equilibrium and steady propagation of a lattice defect -- a kink -- in one
dimension. The material transforms locally, from one state to another, as the
kink passes through. The kink is in equilibrium if the applied force is less
than a certain critical value that is calculated, and propagates if it exceeds
that value. The kinetic relation giving the propagation speed as a function of
the applied force is also derived.
In addition, it is shown that the dynamical solutions of certain
differential-equation-based models of a continuum are the same as those of the
peridynamic model provided the micromodulus function is chosen suitably. A
formula for calculating the micromodulus function of the equivalent peridynamic
model is derived and illustrated. This ability to replace a
differential-equation-based model with a peridynamic one may prove useful when
numerically studying more complicated problems such as those involving multiple
and interacting defects.
|
physics.comp-ph cond-mat.mtrl-sci
|
the peridynamic model of a solid does not involve spatial gradients of the displacement field and is therefore well suited for studying defect propagation here bondbased peridynamic theory is used to study the equilibrium and steady propagation of a lattice defect a kink in one dimension the material transforms locally from one state to another as the kink passes through the kink is in equilibrium if the applied force is less than a certain critical value that is calculated and propagates if it exceeds that value the kinetic relation giving the propagation speed as a function of the applied force is also derived in addition it is shown that the dynamical solutions of certain differentialequationbased models of a continuum are the same as those of the peridynamic model provided the micromodulus function is chosen suitably a formula for calculating the micromodulus function of the equivalent peridynamic model is derived and illustrated this ability to replace a differentialequationbased model with a peridynamic one may prove useful when numerically studying more complicated problems such as those involving multiple and interacting defects
|
[['the', 'peridynamic', 'model', 'of', 'a', 'solid', 'does', 'not', 'involve', 'spatial', 'gradients', 'of', 'the', 'displacement', 'field', 'and', 'is', 'therefore', 'well', 'suited', 'for', 'studying', 'defect', 'propagation', 'here', 'bondbased', 'peridynamic', 'theory', 'is', 'used', 'to', 'study', 'the', 'equilibrium', 'and', 'steady', 'propagation', 'of', 'a', 'lattice', 'defect', 'a', 'kink', 'in', 'one', 'dimension', 'the', 'material', 'transforms', 'locally', 'from', 'one', 'state', 'to', 'another', 'as', 'the', 'kink', 'passes', 'through', 'the', 'kink', 'is', 'in', 'equilibrium', 'if', 'the', 'applied', 'force', 'is', 'less', 'than', 'a', 'certain', 'critical', 'value', 'that', 'is', 'calculated', 'and', 'propagates', 'if', 'it', 'exceeds', 'that', 'value', 'the', 'kinetic', 'relation', 'giving', 'the', 'propagation', 'speed', 'as', 'a', 'function', 'of', 'the', 'applied', 'force', 'is', 'also', 'derived', 'in', 'addition', 'it', 'is', 'shown', 'that', 'the', 'dynamical', 'solutions', 'of', 'certain', 'differentialequationbased', 'models', 'of', 'a', 'continuum', 'are', 'the', 'same', 'as', 'those', 'of', 'the', 'peridynamic', 'model', 'provided', 'the', 'micromodulus', 'function', 'is', 'chosen', 'suitably', 'a', 'formula', 'for', 'calculating', 'the', 'micromodulus', 'function', 'of', 'the', 'equivalent', 'peridynamic', 'model', 'is', 'derived', 'and', 'illustrated', 'this', 'ability', 'to', 'replace', 'a', 'differentialequationbased', 'model', 'with', 'a', 'peridynamic', 'one', 'may', 'prove', 'useful', 'when', 'numerically', 'studying', 'more', 'complicated', 'problems', 'such', 'as', 'those', 'involving', 'multiple', 'and', 'interacting', 'defects']]
|
[-0.09535746993418089, 0.12805979474747586, -0.10810899993504719, 0.09894099071264098, -0.05471456063763991, -0.1452959095223907, -0.010211921790956735, 0.33985569665871435, -0.2905347195722289, -0.24054510189788575, 0.10920698654977341, -0.2514542459936465, -0.15589899917811914, 0.20136998827164035, 0.010397744312419393, 0.05914259790265301, 0.025268393013584245, 0.07544002519120689, -0.057365561931494016, -0.18085658404381558, 0.3067143971053094, 0.04442006331673787, 0.2834511538204542, 0.04867282650028329, 0.10124309616568525, 0.0035598777855436006, 0.03821491393442187, 0.07843993157200978, -0.1190518272039201, 0.09263648305845967, 0.18310212433406978, 0.07598567560859719, 0.2717695263040773, -0.4134310799108892, -0.25873929139037255, 0.08855969769653922, 0.14199001048454793, 0.14013590492139766, -0.014428567557380598, -0.22541135743176197, 0.07560341194335182, -0.14014265061149606, -0.18867729877326953, -0.050539791413009336, 0.01746952882375947, 0.04351964614375121, -0.2777062851177939, 0.0943028688715905, 0.03647247696572278, 0.017945681423038286, -0.08966835650041868, -0.07833277715085926, -0.08131586861307338, 0.11111166624047815, 0.05976324844816015, 0.06676779356311564, 0.1374779828945122, -0.15633983878645058, -0.07102003438387719, 0.4290729543893982, -0.06592689714853923, -0.24352830118041927, 0.19457462868169162, -0.10802835631884745, -0.05541201070540369, 0.1163643717115987, 0.1020298287493445, 0.13930187330418134, -0.1342948119562694, 0.052929722102514155, -0.034218508534470185, 0.16189742531879978, 0.0513365738130685, -0.02451490278560984, 0.17641206991748284, 0.1652748076873963, 0.06755005082347046, 0.16408823766761413, -0.05864749269002238, -0.12059478735877464, -0.3247528171070094, -0.1734357999564059, -0.18995565015922622, 0.050737020524174614, -0.08514837886686608, -0.2062864480781866, 0.37845850011891563, 0.1307682123325902, 0.17122032553336378, 0.042539312687076336, 0.25604925167846815, 0.1865911086689744, 0.05720449357140957, 0.06353892581958302, 0.2611374793269035, 0.15653438025185742, 0.07322379985382244, -0.1977968654150701, 0.08024038269189791, 0.08350586422224461]
|
1,803.09587
|
Evaluation of Session-based Recommendation Algorithms
|
Recommender systems help users find relevant items of interest, for example
on e-commerce or media streaming sites. Most academic research is concerned
with approaches that personalize the recommendations according to long-term
user profiles. In many real-world applications, however, such long-term
profiles often do not exist and recommendations therefore have to be made
solely based on the observed behavior of a user during an ongoing session.
Given the high practical relevance of the problem, an increased interest in
this problem can be observed in recent years, leading to a number of proposals
for session-based recommendation algorithms that typically aim to predict the
user's immediate next actions. In this work, we present the results of an
in-depth performance comparison of a number of such algorithms, using a variety
of datasets and evaluation measures. Our comparison includes the most recent
approaches based on recurrent neural networks like GRU4REC, factorized Markov
model approaches such as FISM or FOSSIL, as well as simpler methods based,
e.g., on nearest neighbor schemes. Our experiments reveal that algorithms of
this latter class, despite their sometimes almost trivial nature, often perform
equally well or significantly better than today's more complex approaches based
on deep neural networks. Our results therefore suggest that there is
substantial room for improvement regarding the development of more
sophisticated session-based recommendation algorithms.
|
cs.IR cs.AI cs.LG cs.NE
|
recommender systems help users find relevant items of interest for example on ecommerce or media streaming sites most academic research is concerned with approaches that personalize the recommendations according to longterm user profiles in many realworld applications however such longterm profiles often do not exist and recommendations therefore have to be made solely based on the observed behavior of a user during an ongoing session given the high practical relevance of the problem an increased interest in this problem can be observed in recent years leading to a number of proposals for sessionbased recommendation algorithms that typically aim to predict the users immediate next actions in this work we present the results of an indepth performance comparison of a number of such algorithms using a variety of datasets and evaluation measures our comparison includes the most recent approaches based on recurrent neural networks like gru4rec factorized markov model approaches such as fism or fossil as well as simpler methods based eg on nearest neighbor schemes our experiments reveal that algorithms of this latter class despite their sometimes almost trivial nature often perform equally well or significantly better than todays more complex approaches based on deep neural networks our results therefore suggest that there is substantial room for improvement regarding the development of more sophisticated sessionbased recommendation algorithms
|
[['recommender', 'systems', 'help', 'users', 'find', 'relevant', 'items', 'of', 'interest', 'for', 'example', 'on', 'ecommerce', 'or', 'media', 'streaming', 'sites', 'most', 'academic', 'research', 'is', 'concerned', 'with', 'approaches', 'that', 'personalize', 'the', 'recommendations', 'according', 'to', 'longterm', 'user', 'profiles', 'in', 'many', 'realworld', 'applications', 'however', 'such', 'longterm', 'profiles', 'often', 'do', 'not', 'exist', 'and', 'recommendations', 'therefore', 'have', 'to', 'be', 'made', 'solely', 'based', 'on', 'the', 'observed', 'behavior', 'of', 'a', 'user', 'during', 'an', 'ongoing', 'session', 'given', 'the', 'high', 'practical', 'relevance', 'of', 'the', 'problem', 'an', 'increased', 'interest', 'in', 'this', 'problem', 'can', 'be', 'observed', 'in', 'recent', 'years', 'leading', 'to', 'a', 'number', 'of', 'proposals', 'for', 'sessionbased', 'recommendation', 'algorithms', 'that', 'typically', 'aim', 'to', 'predict', 'the', 'users', 'immediate', 'next', 'actions', 'in', 'this', 'work', 'we', 'present', 'the', 'results', 'of', 'an', 'indepth', 'performance', 'comparison', 'of', 'a', 'number', 'of', 'such', 'algorithms', 'using', 'a', 'variety', 'of', 'datasets', 'and', 'evaluation', 'measures', 'our', 'comparison', 'includes', 'the', 'most', 'recent', 'approaches', 'based', 'on', 'recurrent', 'neural', 'networks', 'like', 'gru4rec', 'factorized', 'markov', 'model', 'approaches', 'such', 'as', 'fism', 'or', 'fossil', 'as', 'well', 'as', 'simpler', 'methods', 'based', 'eg', 'on', 'nearest', 'neighbor', 'schemes', 'our', 'experiments', 'reveal', 'that', 'algorithms', 'of', 'this', 'latter', 'class', 'despite', 'their', 'sometimes', 'almost', 'trivial', 'nature', 'often', 'perform', 'equally', 'well', 'or', 'significantly', 'better', 'than', 'todays', 'more', 'complex', 'approaches', 'based', 'on', 'deep', 'neural', 'networks', 'our', 'results', 'therefore', 'suggest', 'that', 'there', 'is', 'substantial', 'room', 'for', 'improvement', 'regarding', 'the', 'development', 'of', 'more', 'sophisticated', 'sessionbased', 'recommendation', 'algorithms']]
|
[-0.06509127944634573, -0.0014722879302469126, -0.030145538858724414, 0.07954657180865372, -0.1232187226393122, -0.16174082252783356, 0.06623698326789222, 0.44613981651383694, -0.20618142720222413, -0.32799149361973695, 0.11926938313451872, -0.3040836940312551, -0.21121754588319971, 0.2652811421845669, -0.08562514251011803, 0.06697407142039286, 0.11306577227164612, 0.06856874478614407, -0.04916243145298385, -0.32615561524461456, 0.28945324934277405, 0.07822015765001804, 0.3333906625026699, 0.05829876484737421, 0.034980319712000586, -0.011320752740074467, -0.0752589499321335, 0.0201030877810303, -0.07419872824256243, 0.14311103821731835, 0.33459973865925957, 0.19143734515118585, 0.34835300543690445, -0.45525353027430054, -0.2459936860724594, 0.10581413959152997, 0.17509239606732552, 0.09088097581553922, -0.07069084544585806, -0.30106475160250235, 0.08390329467241557, -0.2174483837508079, -0.03214957642248245, -0.1100281098764821, 0.0070083783098703455, 0.04467372467775864, -0.25485933510828074, 0.006515528805687575, 0.057604796213261714, 0.08506748197531258, -0.03549928873676604, -0.14146851882051797, 0.05535383974266653, 0.16124589070225032, 0.1021379264162129, 0.019207623492952228, 0.13283032863788927, -0.16869180163484998, -0.2020919634259944, 0.40356513140378175, -0.024881284853513028, -0.16716892419100515, 0.2542674085211561, -0.032921130175021025, -0.18529525102133415, 0.08655768663501712, 0.22899894729791279, 0.12926030807446093, -0.13786510374942468, -0.021641507592263493, -0.04654390944051556, 0.19370655291411956, -0.0014635488181806136, 0.037839555651535864, 0.20620081006523427, 0.23143403550946257, 0.06858735546201286, 0.05390005411242816, -0.007922763555715964, -0.10927292422598435, -0.16881833045691666, -0.1154629154003083, -0.1697883548784173, 0.019767635690085526, -0.08724281514972702, -0.17605846948680226, 0.3701179226498223, 0.234692955736709, 0.20143244493994172, 0.04204545859613939, 0.32527048507256917, 0.03973875011972807, 0.08955077605356497, 0.08269968479268115, 0.18247579929367122, 0.008217023638146068, 0.1576483135512616, -0.1347066106862729, 0.14095542193670688, 0.0034370256503785234]
|
1,803.09588
|
Efficient Image Dataset Classification Difficulty Estimation for
Predicting Deep-Learning Accuracy
|
In the deep-learning community new algorithms are published at an incredible
pace. Therefore, solving an image classification problem for new datasets
becomes a challenging task, as it requires to re-evaluate published algorithms
and their different configurations in order to find a close to optimal
classifier. To facilitate this process, before biasing our decision towards a
class of neural networks or running an expensive search over the network space,
we propose to estimate the classification difficulty of the dataset. Our method
computes a single number that characterizes the dataset difficulty 27x faster
than training state-of-the-art networks. The proposed method can be used in
combination with network topology and hyper-parameter search optimizers to
efficiently drive the search towards promising neural-network configurations.
|
cs.CV
|
in the deeplearning community new algorithms are published at an incredible pace therefore solving an image classification problem for new datasets becomes a challenging task as it requires to reevaluate published algorithms and their different configurations in order to find a close to optimal classifier to facilitate this process before biasing our decision towards a class of neural networks or running an expensive search over the network space we propose to estimate the classification difficulty of the dataset our method computes a single number that characterizes the dataset difficulty 27x faster than training stateoftheart networks the proposed method can be used in combination with network topology and hyperparameter search optimizers to efficiently drive the search towards promising neuralnetwork configurations
|
[['in', 'the', 'deeplearning', 'community', 'new', 'algorithms', 'are', 'published', 'at', 'an', 'incredible', 'pace', 'therefore', 'solving', 'an', 'image', 'classification', 'problem', 'for', 'new', 'datasets', 'becomes', 'a', 'challenging', 'task', 'as', 'it', 'requires', 'to', 'reevaluate', 'published', 'algorithms', 'and', 'their', 'different', 'configurations', 'in', 'order', 'to', 'find', 'a', 'close', 'to', 'optimal', 'classifier', 'to', 'facilitate', 'this', 'process', 'before', 'biasing', 'our', 'decision', 'towards', 'a', 'class', 'of', 'neural', 'networks', 'or', 'running', 'an', 'expensive', 'search', 'over', 'the', 'network', 'space', 'we', 'propose', 'to', 'estimate', 'the', 'classification', 'difficulty', 'of', 'the', 'dataset', 'our', 'method', 'computes', 'a', 'single', 'number', 'that', 'characterizes', 'the', 'dataset', 'difficulty', '27x', 'faster', 'than', 'training', 'stateoftheart', 'networks', 'the', 'proposed', 'method', 'can', 'be', 'used', 'in', 'combination', 'with', 'network', 'topology', 'and', 'hyperparameter', 'search', 'optimizers', 'to', 'efficiently', 'drive', 'the', 'search', 'towards', 'promising', 'neuralnetwork', 'configurations']]
|
[-0.060658077028983064, -0.0326508145898966, -0.052491555146935605, 0.06967765776772933, -0.12088276446256943, -0.16496573450403804, 0.07785924700550548, 0.44695436362051916, -0.27179052426378014, -0.39946645002092135, 0.07775676897981305, -0.23728395615774794, -0.1562236069722156, 0.23825160367940182, -0.09280755054568231, 0.10653486105167315, 0.1512480370402962, 0.03055577494297959, -0.07013163572967741, -0.3162207205020705, 0.28253249527236934, 0.09111503141094782, 0.33540466696243076, -0.016351252097730376, 0.09622431707963691, -0.05249886142536059, -0.02599267222715088, -0.019673110406792982, -0.0554452809711704, 0.15392694256694972, 0.30025527817236275, 0.20723325335968504, 0.3507231939075311, -0.3838457999704014, -0.1889713191517292, 0.15816915186685548, 0.17721116241114607, 0.15699864252377008, -0.027491781976027023, -0.3266611185097018, 0.08783461128071952, -0.14603481411213884, -0.04367072009990195, -0.16534302724885339, -0.005482355860539344, -0.05878560488433147, -0.2932607420101887, -0.006204680469231445, 0.007167069067270691, -0.003393162981051357, -0.030478903094400503, -0.12471031102531847, 0.04993154414530311, 0.14159681921738723, 0.01657398253999173, 0.12377190560165073, 0.1307018843495107, -0.18164246062603348, -0.18246059538405232, 0.350138315617913, -0.05425721701166589, -0.18696290921779865, 0.2106565984881663, -0.0046365131788394034, -0.17574299066992743, 0.14728126106705486, 0.26446000118779034, 0.1592107669004247, -0.16465811627528615, -0.024200118719130567, -0.009266770742207515, 0.16917843606221264, -0.0011858007197557878, -0.040567699135007226, 0.18231901213401505, 0.29993971846919476, 0.11319985854666398, 0.1583804539434158, -0.10681678947969143, -0.06622120954767417, -0.17948582957052633, -0.11756614272036597, -0.1914944161167916, -0.025424805177549806, -0.10913837654882956, -0.15996833114313477, 0.3907064597764123, 0.24643250325099886, 0.1943654451722733, 0.12081280911043912, 0.32461438706817747, 0.03222078033390322, 0.12948768408851652, 0.11951123010474766, 0.20486641491317198, -0.004282549673206165, 0.152168499701314, -0.17709367052151062, 0.09039030120191517, 0.06576914593436513]
|
1,803.09589
|
Characterization of the Multi-Blade 10B-based detector at the CRISP
reflectometer at ISIS for neutron reflectometry at ESS
|
The Multi-Blade is a Boron-10-based gaseous thermal neutron detector
developed to face the challenge arising in neutron reflectometry at neutron
sources. Neutron reflectometers are challenging instruments in terms of
instantaneous counting rate and spatial resolution. This detector has been
designed according to the requirements given by the reflectometers at the
European Spallation Source (ESS) in Sweden. The Multi-Blade has been installed
and tested on the CRISP reflectometer at the ISIS neutron and muon source in
UK. The results on the detailed detector characterization are discussed in this
manuscript.
|
physics.ins-det
|
the multiblade is a boron10based gaseous thermal neutron detector developed to face the challenge arising in neutron reflectometry at neutron sources neutron reflectometers are challenging instruments in terms of instantaneous counting rate and spatial resolution this detector has been designed according to the requirements given by the reflectometers at the european spallation source ess in sweden the multiblade has been installed and tested on the crisp reflectometer at the isis neutron and muon source in uk the results on the detailed detector characterization are discussed in this manuscript
|
[['the', 'multiblade', 'is', 'a', 'boron10based', 'gaseous', 'thermal', 'neutron', 'detector', 'developed', 'to', 'face', 'the', 'challenge', 'arising', 'in', 'neutron', 'reflectometry', 'at', 'neutron', 'sources', 'neutron', 'reflectometers', 'are', 'challenging', 'instruments', 'in', 'terms', 'of', 'instantaneous', 'counting', 'rate', 'and', 'spatial', 'resolution', 'this', 'detector', 'has', 'been', 'designed', 'according', 'to', 'the', 'requirements', 'given', 'by', 'the', 'reflectometers', 'at', 'the', 'european', 'spallation', 'source', 'ess', 'in', 'sweden', 'the', 'multiblade', 'has', 'been', 'installed', 'and', 'tested', 'on', 'the', 'crisp', 'reflectometer', 'at', 'the', 'isis', 'neutron', 'and', 'muon', 'source', 'in', 'uk', 'the', 'results', 'on', 'the', 'detailed', 'detector', 'characterization', 'are', 'discussed', 'in', 'this', 'manuscript']]
|
[-0.03556116709792563, 0.11628458460009741, -0.08627491240622476, 0.07270764403272717, -0.05509155010804534, -0.08725891323146326, -0.014731339949569454, 0.3610580906600014, -0.16105075743557376, -0.3345900662243366, 0.14322119297073435, -0.3587834251600064, 0.04727210292846642, 0.2633504276984075, -0.07235299920747904, 0.10461244864762359, 0.09923674367283555, 0.04850200154363516, -0.04320816661294719, -0.20068735413025768, 0.29477255373388866, 0.2093785781636887, 0.342993056835522, 0.0859737018525431, 0.1627841743809933, -0.02348145313259341, -0.08465744044885716, -0.03363618957725769, -0.0892397884956815, 0.020101682526398112, 0.3745265905110335, 0.13667626678282183, 0.14888668404033856, -0.466881306566806, -0.1661970295390347, 0.04242517350410873, 0.03360605606047267, -0.011235053164207122, -0.06780699731792662, -0.30660464976575563, 0.07968339202819731, -0.23086534818338061, -0.1399624926270917, 0.019398068183694373, -0.0206664650732736, 0.061519920180382374, -0.19520496783661656, -0.05645256514915011, -0.01510001984371973, 0.050171446542001584, -0.05863083038076928, -0.1569329888813875, 0.07619447692360898, 0.0867152174839496, 0.015067463896808807, 0.060252301807684656, 0.11397957884367894, -0.12007052782808553, -0.08494326944293623, 0.30408384202217514, -0.010430654934184118, -0.12253536135804924, 0.16221892823920248, -0.24125142526199025, -0.14150595016756348, 0.15647581680042838, 0.1776882856766778, 0.1322386210826649, -0.24143169148274782, 0.050465102670634886, 0.003993410284403415, 0.1928689564043783, 0.15244496902662583, 0.00336360425518995, 0.26370583320121194, 0.30105010502633045, -0.005809005089924374, 0.1418493804865813, -0.2822104332577014, -0.0021781413299984047, -0.2467823459446663, -0.057244121552106335, -0.13824039276435293, -0.00158761748356152, 0.02274281916850834, -0.0768004086110688, 0.33551235928792844, 0.058245636226440016, 0.027389757165854626, -0.08301362668333406, 0.33914705622009933, 0.058825453986752436, 0.08499159473946995, 0.02198350834475026, 0.27104493442245503, 0.11873531118776141, 0.2079820902065628, -0.27072932780191133, 0.10480717529241122, 0.0014132008522706615]
|
1,803.0959
|
Rule-based Autoregressive Moving Average Models for Forecasting Load on
Special Days: A Case Study for France
|
This paper presents a case study on short-term load forecasting for France,
with emphasis on special days, such as public holidays. We investigate the
generalisability to French data of a recently proposed approach, which
generates forecasts for normal and special days in a coherent and unified
framework, by incorporating subjective judgment in univariate statistical
models using a rule-based methodology. The intraday, intraweek, and intrayear
seasonality in load are accommodated using a rule-based triple seasonal
adaptation of a seasonal autoregressive moving average (SARMA) model. We find
that, for application to French load, the method requires an important
adaption. We also adapt a recently proposed SARMA model that accommodates
special day effects on an hourly basis using indicator variables. Using a rule
formulated specifically for the French load, we compare the SARMA models with a
range of different benchmark methods based on an evaluation of their point and
density forecast accuracy. As sophisticated benchmarks, we employ the
rule-based triple seasonal adaptations of Holt-Winters-Taylor (HWT) exponential
smoothing and artificial neural networks (ANNs). We use nine years of
half-hourly French load data, and consider lead times ranging from one
half-hour up to a day ahead. The rule-based SARMA approach generated the most
accurate forecasts.
|
stat.AP
|
this paper presents a case study on shortterm load forecasting for france with emphasis on special days such as public holidays we investigate the generalisability to french data of a recently proposed approach which generates forecasts for normal and special days in a coherent and unified framework by incorporating subjective judgment in univariate statistical models using a rulebased methodology the intraday intraweek and intrayear seasonality in load are accommodated using a rulebased triple seasonal adaptation of a seasonal autoregressive moving average sarma model we find that for application to french load the method requires an important adaption we also adapt a recently proposed sarma model that accommodates special day effects on an hourly basis using indicator variables using a rule formulated specifically for the french load we compare the sarma models with a range of different benchmark methods based on an evaluation of their point and density forecast accuracy as sophisticated benchmarks we employ the rulebased triple seasonal adaptations of holtwinterstaylor hwt exponential smoothing and artificial neural networks anns we use nine years of halfhourly french load data and consider lead times ranging from one halfhour up to a day ahead the rulebased sarma approach generated the most accurate forecasts
|
[['this', 'paper', 'presents', 'a', 'case', 'study', 'on', 'shortterm', 'load', 'forecasting', 'for', 'france', 'with', 'emphasis', 'on', 'special', 'days', 'such', 'as', 'public', 'holidays', 'we', 'investigate', 'the', 'generalisability', 'to', 'french', 'data', 'of', 'a', 'recently', 'proposed', 'approach', 'which', 'generates', 'forecasts', 'for', 'normal', 'and', 'special', 'days', 'in', 'a', 'coherent', 'and', 'unified', 'framework', 'by', 'incorporating', 'subjective', 'judgment', 'in', 'univariate', 'statistical', 'models', 'using', 'a', 'rulebased', 'methodology', 'the', 'intraday', 'intraweek', 'and', 'intrayear', 'seasonality', 'in', 'load', 'are', 'accommodated', 'using', 'a', 'rulebased', 'triple', 'seasonal', 'adaptation', 'of', 'a', 'seasonal', 'autoregressive', 'moving', 'average', 'sarma', 'model', 'we', 'find', 'that', 'for', 'application', 'to', 'french', 'load', 'the', 'method', 'requires', 'an', 'important', 'adaption', 'we', 'also', 'adapt', 'a', 'recently', 'proposed', 'sarma', 'model', 'that', 'accommodates', 'special', 'day', 'effects', 'on', 'an', 'hourly', 'basis', 'using', 'indicator', 'variables', 'using', 'a', 'rule', 'formulated', 'specifically', 'for', 'the', 'french', 'load', 'we', 'compare', 'the', 'sarma', 'models', 'with', 'a', 'range', 'of', 'different', 'benchmark', 'methods', 'based', 'on', 'an', 'evaluation', 'of', 'their', 'point', 'and', 'density', 'forecast', 'accuracy', 'as', 'sophisticated', 'benchmarks', 'we', 'employ', 'the', 'rulebased', 'triple', 'seasonal', 'adaptations', 'of', 'holtwinterstaylor', 'hwt', 'exponential', 'smoothing', 'and', 'artificial', 'neural', 'networks', 'anns', 'we', 'use', 'nine', 'years', 'of', 'halfhourly', 'french', 'load', 'data', 'and', 'consider', 'lead', 'times', 'ranging', 'from', 'one', 'halfhour', 'up', 'to', 'a', 'day', 'ahead', 'the', 'rulebased', 'sarma', 'approach', 'generated', 'the', 'most', 'accurate', 'forecasts']]
|
[-0.05031002084795518, 0.04753781331495942, -0.09236042871054848, 0.0913075533604514, -0.06559170473858639, -0.16196029496185368, 0.10172688819897635, 0.3914712237094902, -0.184762384502281, -0.31128945425720084, 0.1116394235233677, -0.2580367587211301, -0.18210811839973184, 0.22930089948547597, -0.11961574655033289, 0.06812832507465583, 0.08428191633890313, 0.002087404637072746, -0.03607730640731941, -0.2750887234144499, 0.2622866778573031, 0.0859149874774219, 0.3312960608299765, -0.0071345366168823945, 0.12511194034640294, -0.005889639230610491, -0.0852842057445252, -0.01422905589354598, -0.09523777145016903, 0.12653345714658876, 0.24721919898072117, 0.16864683435577427, 0.3249811286740194, -0.4290560548652323, -0.23478685278766953, 0.10078902440476538, 0.0546521594333356, 0.05991248876213328, 0.005961209013207159, -0.28315136007383124, 0.02323023252174977, -0.26713724463656874, -0.08321014982098619, -0.12668502592271297, 0.032382991431436976, 0.034381559785505104, -0.3153379158575447, 0.09343516741519402, 0.0320757594158126, 0.15677555767006152, -0.07840179994484874, -0.14084791603408336, 0.009033128681833747, 0.10188007341026503, 0.06037222798606428, 0.009871032718937788, 0.10080141752180029, -0.07938511554165956, -0.16267128681957835, 0.37648053270372267, -0.11354843893934627, -0.14755608187456554, 0.15827092178624483, -0.012437901242168118, -0.17909882114231018, 0.044367177728067156, 0.2769501499269101, 0.09049246056468656, -0.16715489589517019, 0.002115480952215414, -0.041182880350719514, 0.1832819025318533, 0.08453006838592535, -0.08457465343612251, 0.18926954020741324, 0.26717433740791446, 0.023700030453191114, 0.10361734453853466, -0.15204611765031661, -0.14754947041619929, -0.22274305334853642, -0.08584404800394208, -0.10491550424925718, -0.0015544064418616028, -0.09902734499437106, -0.14950756848373728, 0.43312030483561986, 0.2132897034055804, 0.15786916011386565, 0.0789201646756031, 0.31205962086805533, 0.08110970428430943, 0.05457050399382027, 0.08474707253990715, 0.15497480388518026, 0.002974829193308647, 0.15070680192752084, -0.16696084034629166, 0.08653796219318954, 0.043832818955079025]
|
1,803.09591
|
Volume bounds of the Ricci flow on closed manifolds
|
Let $\{g(t)\}_{t\in [0,T)}$ be the solution of the Ricci flow on a closed
Riemannian manifold $M^n$ with $n\geq 3$. Without any assumption, we derive
lower volume bounds of the form ${\rm Vol}_{g(t)}\geq C (T-t)^{\frac{n}{2}}$,
where $C$ depends only on $n$, $T$ and $g(0)$. In particular, we show that
$${\rm Vol}_{g(t)} \geq e^{ T\lambda-\frac{n}{2}}
\left(\frac{4}{(A(\lambda-r)+4B)T}\right)^{\frac{n}{2}}\left(T-t\right)^{\frac{n}{2}},$$
where $r:=\inf_{\|\phi\|_2^2=1} \int_M R\phi^2 \ d{\rm vol}_{g(0)}$,
$\lambda:=\inf_{\|\phi\|_2^2=1} \int_M 4|\nabla\phi|^2+R\phi^2\ d{\rm
vol}_{g(0)}$ and $A,B$ are Sobolev constants of $(M,g(0))$. This estimate is
sharp in the sense that it is achieved by the unit sphere with scalar curvature
$R_{g(0)}=n(n-1)$ and $A=\frac{4}{n(n-2)}\omega_n^{-\frac{2}{n}}$,
$B=\frac{n-1}{n-2}\omega_n^{-\frac{2}{n}}$.
On the other hand, if the diameter satisfies ${\rm diam}_{g(t)}\leq
c_1\sqrt{T-t}$ and there exist a point $x_0\in M$ such that $R(x_0,t)\leq
c_2(T-t)^{-1}$, then we have ${\rm Vol}_{g(t)}\leq C (T-t)^{\frac{n}{2}}$ for
all $t>\frac{T}{2}$, where $C$ depends only on $c_1,c_2,n,T$ and $g(0)$.
|
math.DG
|
let gt_tin 0t be the solution of the ricci flow on a closed riemannian manifold mn with ngeq 3 without any assumption we derive lower volume bounds of the form rm vol_gtgeq c ttfracn2 where c depends only on n t and g0 in particular we show that rm vol_gt geq e tlambdafracn2 leftfrac4alambdar4btrightfracn2leftttrightfracn2 where rinf_phi_221 int_m rphi2 drm vol_g0 lambdainf_phi_221 int_m 4nablaphi2rphi2 drm vol_g0 and ab are sobolev constants of mg0 this estimate is sharp in the sense that it is achieved by the unit sphere with scalar curvature r_g0nn1 and afrac4nn2omega_nfrac2n bfracn1n2omega_nfrac2n on the other hand if the diameter satisfies rm diam_gtleq c_1sqrttt and there exist a point x_0in m such that rx_0tleq c_2tt1 then we have rm vol_gtleq c ttfracn2 for all tfract2 where c depends only on c_1c_2nt and g0
|
[['let', 'gt_tin', '0t', 'be', 'the', 'solution', 'of', 'the', 'ricci', 'flow', 'on', 'a', 'closed', 'riemannian', 'manifold', 'mn', 'with', 'ngeq', '3', 'without', 'any', 'assumption', 'we', 'derive', 'lower', 'volume', 'bounds', 'of', 'the', 'form', 'rm', 'vol_gtgeq', 'c', 'ttfracn2', 'where', 'c', 'depends', 'only', 'on', 'n', 't', 'and', 'g0', 'in', 'particular', 'we', 'show', 'that', 'rm', 'vol_gt', 'geq', 'e', 'tlambdafracn2', 'leftfrac4alambdar4btrightfracn2leftttrightfracn2', 'where', 'rinf_phi_221', 'int_m', 'rphi2', 'drm', 'vol_g0', 'lambdainf_phi_221', 'int_m', '4nablaphi2rphi2', 'drm', 'vol_g0', 'and', 'ab', 'are', 'sobolev', 'constants', 'of', 'mg0', 'this', 'estimate', 'is', 'sharp', 'in', 'the', 'sense', 'that', 'it', 'is', 'achieved', 'by', 'the', 'unit', 'sphere', 'with', 'scalar', 'curvature', 'r_g0nn1', 'and', 'afrac4nn2omega_nfrac2n', 'bfracn1n2omega_nfrac2n', 'on', 'the', 'other', 'hand', 'if', 'the', 'diameter', 'satisfies', 'rm', 'diam_gtleq', 'c_1sqrttt', 'and', 'there', 'exist', 'a', 'point', 'x_0in', 'm', 'such', 'that', 'rx_0tleq', 'c_2tt1', 'then', 'we', 'have', 'rm', 'vol_gtleq', 'c', 'ttfracn2', 'for', 'all', 'tfract2', 'where', 'c', 'depends', 'only', 'on', 'c_1c_2nt', 'and', 'g0']]
|
[-0.17831374260172847, 0.11840113020402246, -0.011619195807725191, -0.02169805170914125, -0.05030967179586047, -0.21086208807537332, -0.01356084959531602, 0.36543596579784726, -0.23120193686294702, -0.22008928823717205, 0.12644205000313896, -0.31781682349641677, -0.08969992980720624, 0.20806312989693002, -0.03797396632061074, -0.04873480341380595, 0.0075442392241841716, 0.15982327177854522, -0.07491909475356806, -0.23130813656981836, 0.3581066265469417, -0.08951733765258853, 0.16625746108391987, 0.11573893844199899, 0.1050961453500869, -0.02980186030617915, 0.07134561075612769, 0.019573623636720834, -0.27424932492320814, 0.07643040135735646, 0.17691884404796707, 0.12674334162979253, 0.20560980095095666, -0.36766531099731636, -0.1658203884809544, 0.1930244060682266, 0.1335553336414575, -0.07019807417444619, -0.00511833861154238, -0.2322914718991212, 0.18890724837131398, -0.054037556576076895, -0.0843536661512709, -0.02395852911286056, 0.12705565245206735, 0.012877291186928883, -0.320167160543081, 0.05977982049392137, 0.10351379438569504, 0.04617602990557706, -0.0550706305408052, -0.175901816789909, -0.07538412567061771, 0.05402268412789064, 0.008966845227405429, 0.16116157564205683, 0.08437876304794502, -0.06860611254108205, 0.009989170126833155, 0.36360629345290363, -0.16377381927200726, -0.25009360581836, 0.09066300932733741, -0.20412145889089775, -0.14174717183673888, 0.05226145405790054, 0.1185460978678228, 0.19228899352518575, -0.02708872797042464, 0.2692487861136864, -0.07441479139976893, 0.1803868945418279, 0.09591319082288205, -0.020829214891169352, 0.06984487002150022, 0.08103353687952872, 0.15012251401328416, 0.020374296988718146, -0.07007113526924513, 0.014834362177810232, -0.39295485489336507, -0.22134106701040374, -0.1916715570436541, 0.1696223767108417, -0.14505098548852402, -0.0973390750327131, 0.2413923797492836, 0.04345044654162068, 0.23051061177726037, 0.09351414385517794, 0.20284831640310585, 0.1017261287488509, 0.030388854331769317, 0.19560085968779667, 0.1653166519577748, 0.11361409741220996, 0.023431723430154046, -0.1855187321068245, 0.014354221285819741, 0.08745325151747758]
|
1,803.09592
|
Similarity based hierarchical clustering of physiological parameters for
the identification of health states - a feasibility study
|
This paper introduces a new unsupervised method for the clustering of
physiological data into health states based on their similarity. We propose an
iterative hierarchical clustering approach that combines health states
according to a similarity constraint to new arbitrary health states. We applied
method to experimental data in which the physical strain of subjects was
systematically varied. We derived health states based on parameters extracted
from ECG data. The occurrence of health states shows a high temporal
correlation to the experimental phases of the physical exercise. We compared
our method to other clustering algorithms and found a significantly higher
accuracy with respect to the identification of health states.
|
eess.SP cs.CY cs.LG
|
this paper introduces a new unsupervised method for the clustering of physiological data into health states based on their similarity we propose an iterative hierarchical clustering approach that combines health states according to a similarity constraint to new arbitrary health states we applied method to experimental data in which the physical strain of subjects was systematically varied we derived health states based on parameters extracted from ecg data the occurrence of health states shows a high temporal correlation to the experimental phases of the physical exercise we compared our method to other clustering algorithms and found a significantly higher accuracy with respect to the identification of health states
|
[['this', 'paper', 'introduces', 'a', 'new', 'unsupervised', 'method', 'for', 'the', 'clustering', 'of', 'physiological', 'data', 'into', 'health', 'states', 'based', 'on', 'their', 'similarity', 'we', 'propose', 'an', 'iterative', 'hierarchical', 'clustering', 'approach', 'that', 'combines', 'health', 'states', 'according', 'to', 'a', 'similarity', 'constraint', 'to', 'new', 'arbitrary', 'health', 'states', 'we', 'applied', 'method', 'to', 'experimental', 'data', 'in', 'which', 'the', 'physical', 'strain', 'of', 'subjects', 'was', 'systematically', 'varied', 'we', 'derived', 'health', 'states', 'based', 'on', 'parameters', 'extracted', 'from', 'ecg', 'data', 'the', 'occurrence', 'of', 'health', 'states', 'shows', 'a', 'high', 'temporal', 'correlation', 'to', 'the', 'experimental', 'phases', 'of', 'the', 'physical', 'exercise', 'we', 'compared', 'our', 'method', 'to', 'other', 'clustering', 'algorithms', 'and', 'found', 'a', 'significantly', 'higher', 'accuracy', 'with', 'respect', 'to', 'the', 'identification', 'of', 'health', 'states']]
|
[-0.06313369386932915, 0.04373096080221499, -0.16221806639805436, 0.06701430391102028, -0.07327749664653782, -0.11742570629791806, 0.10732511336229639, 0.39239315912817363, -0.2400374628034317, -0.3423348317699964, 0.06950328295028561, -0.29330901475838833, -0.15502115645601103, 0.18152229343023565, -0.10007669235993591, 0.11165976129942229, 0.08639758415908243, 0.0580339468670664, -0.08384728528067677, -0.2467151725906189, 0.31549960088536694, 0.033092497313326155, 0.3940016133365808, 0.04902784195211199, 0.09941246670442289, 0.0034892721558679586, -0.045349957697369436, 0.01973707677037358, -0.09619054850440147, 0.20018824050310757, 0.30883480903382104, 0.19396682574275742, 0.3006061052179171, -0.39201828595940713, -0.2111963601179283, 0.05579652229358477, 0.11130291255432423, 0.131036161569042, -0.05136086743678553, -0.38070108293107263, 0.0626153420329232, -0.16120546875969954, -0.0633610996969596, -0.13874077463212112, -0.025946954636041214, -0.035384794986047956, -0.30133572392407115, 0.12837451121002366, -0.043720448286169104, 0.07829606023625713, -0.1403921005419559, -0.1412771690412666, -0.025489900897136302, 0.15584874312669314, 0.04609930391759715, 0.009945036162173859, 0.15416842267451877, -0.10242654426514895, -0.15972134294969254, 0.35650591440153895, -0.021266602971418587, -0.17471524569447394, 0.21351878356438614, -0.05437343236270761, -0.18709163129743603, 0.07929981649094434, 0.2514166543723722, 0.07869374235505583, -0.16655829134052275, -0.059037546554463916, 0.02412840453217979, 0.20833441634938396, -0.008980273372597165, 0.012394148362714245, 0.12193389452349274, 0.20048846189726005, 0.05620291931727142, 0.15368358007388586, -0.12121925872957541, -0.03349492641993695, -0.20347852818452306, -0.10766384409982022, -0.18201282693944112, -0.0033285918999118387, -0.09404609434258654, -0.1768812973190237, 0.4807304470644643, 0.23199354574683606, 0.19611232591516994, 0.03795439719882173, 0.2761260865221697, 0.044775374635786715, 0.08614197957838231, 0.025842043510810646, 0.17913800244504172, 0.0620521941282614, 0.1169106894026131, -0.2538044725833633, 0.11095993492441873, -0.00041882363492967906]
|
1,803.09593
|
Optimal artificial boundary condition for random elliptic media
|
We are given a uniformly elliptic coefficient field that we regard as a
realization of a stationary and finite-range (say, range unity) ensemble of
coefficient fields. Given a (deterministic) right-hand-side supported in a ball
of size $\ell\gg 1$ and of vanishing average, we are interested in an algorithm
to compute the (gradient of the) solution near the origin, just using the
knowledge of the (given realization of the) coefficient field in some large box
of size $L\gg\ell$. More precisely, we are interested in the most seamless
(artificial) boundary condition on the boundary of the computational domain of
size $L$.
Motivated by the recently introduced multipole expansion in random media, we
propose an algorithm. We rigorously establish an error estimate (on the level
of the gradient) in terms of $L\gg\ell\gg 1$, using recent results in
quantitative stochastic homogenization. More precisely, our error estimate has
an a priori and an a posteriori aspect: With a priori overwhelming probability,
the (random) prefactor can be bounded by a constant that is computable without
much further effort, on the basis of the given realization in the box of size
$L$.
We also rigorously establish that the order of the error estimate in both $L$
and $\ell$ is optimal, where in this paper we focus on the case of $d=2$. This
amounts to a lower bound on the variance of the quantity of interest when
conditioned on the coefficients inside the computational domain, and relies on
the deterministic insight that a sensitivity analysis wrt a defect commutes
with (stochastic) homogenization. Finally, we carry out numerical experiments
that show that this optimal convergence rate already sets in at only moderately
large $L$, and that more naive boundary conditions perform worse both in terms
of rate and prefactor.
|
math.NA math.AP
|
we are given a uniformly elliptic coefficient field that we regard as a realization of a stationary and finiterange say range unity ensemble of coefficient fields given a deterministic righthandside supported in a ball of size ellgg 1 and of vanishing average we are interested in an algorithm to compute the gradient of the solution near the origin just using the knowledge of the given realization of the coefficient field in some large box of size lggell more precisely we are interested in the most seamless artificial boundary condition on the boundary of the computational domain of size l motivated by the recently introduced multipole expansion in random media we propose an algorithm we rigorously establish an error estimate on the level of the gradient in terms of lggellgg 1 using recent results in quantitative stochastic homogenization more precisely our error estimate has an a priori and an a posteriori aspect with a priori overwhelming probability the random prefactor can be bounded by a constant that is computable without much further effort on the basis of the given realization in the box of size l we also rigorously establish that the order of the error estimate in both l and ell is optimal where in this paper we focus on the case of d2 this amounts to a lower bound on the variance of the quantity of interest when conditioned on the coefficients inside the computational domain and relies on the deterministic insight that a sensitivity analysis wrt a defect commutes with stochastic homogenization finally we carry out numerical experiments that show that this optimal convergence rate already sets in at only moderately large l and that more naive boundary conditions perform worse both in terms of rate and prefactor
|
[['we', 'are', 'given', 'a', 'uniformly', 'elliptic', 'coefficient', 'field', 'that', 'we', 'regard', 'as', 'a', 'realization', 'of', 'a', 'stationary', 'and', 'finiterange', 'say', 'range', 'unity', 'ensemble', 'of', 'coefficient', 'fields', 'given', 'a', 'deterministic', 'righthandside', 'supported', 'in', 'a', 'ball', 'of', 'size', 'ellgg', '1', 'and', 'of', 'vanishing', 'average', 'we', 'are', 'interested', 'in', 'an', 'algorithm', 'to', 'compute', 'the', 'gradient', 'of', 'the', 'solution', 'near', 'the', 'origin', 'just', 'using', 'the', 'knowledge', 'of', 'the', 'given', 'realization', 'of', 'the', 'coefficient', 'field', 'in', 'some', 'large', 'box', 'of', 'size', 'lggell', 'more', 'precisely', 'we', 'are', 'interested', 'in', 'the', 'most', 'seamless', 'artificial', 'boundary', 'condition', 'on', 'the', 'boundary', 'of', 'the', 'computational', 'domain', 'of', 'size', 'l', 'motivated', 'by', 'the', 'recently', 'introduced', 'multipole', 'expansion', 'in', 'random', 'media', 'we', 'propose', 'an', 'algorithm', 'we', 'rigorously', 'establish', 'an', 'error', 'estimate', 'on', 'the', 'level', 'of', 'the', 'gradient', 'in', 'terms', 'of', 'lggellgg', '1', 'using', 'recent', 'results', 'in', 'quantitative', 'stochastic', 'homogenization', 'more', 'precisely', 'our', 'error', 'estimate', 'has', 'an', 'a', 'priori', 'and', 'an', 'a', 'posteriori', 'aspect', 'with', 'a', 'priori', 'overwhelming', 'probability', 'the', 'random', 'prefactor', 'can', 'be', 'bounded', 'by', 'a', 'constant', 'that', 'is', 'computable', 'without', 'much', 'further', 'effort', 'on', 'the', 'basis', 'of', 'the', 'given', 'realization', 'in', 'the', 'box', 'of', 'size', 'l', 'we', 'also', 'rigorously', 'establish', 'that', 'the', 'order', 'of', 'the', 'error', 'estimate', 'in', 'both', 'l', 'and', 'ell', 'is', 'optimal', 'where', 'in', 'this', 'paper', 'we', 'focus', 'on', 'the', 'case', 'of', 'd2', 'this', 'amounts', 'to', 'a', 'lower', 'bound', 'on', 'the', 'variance', 'of', 'the', 'quantity', 'of', 'interest', 'when', 'conditioned', 'on', 'the', 'coefficients', 'inside', 'the', 'computational', 'domain', 'and', 'relies', 'on', 'the', 'deterministic', 'insight', 'that', 'a', 'sensitivity', 'analysis', 'wrt', 'a', 'defect', 'commutes', 'with', 'stochastic', 'homogenization', 'finally', 'we', 'carry', 'out', 'numerical', 'experiments', 'that', 'show', 'that', 'this', 'optimal', 'convergence', 'rate', 'already', 'sets', 'in', 'at', 'only', 'moderately', 'large', 'l', 'and', 'that', 'more', 'naive', 'boundary', 'conditions', 'perform', 'worse', 'both', 'in', 'terms', 'of', 'rate', 'and', 'prefactor']]
|
[-0.11450019072597367, 0.0850196339329159, -0.059883546897455946, 0.030429484350962512, -0.05022015668105774, -0.09543042341505902, 0.0745783610125525, 0.3499233418196026, -0.2510826306651224, -0.2558584613130329, 0.13249248112212322, -0.2571286829350154, -0.14206320923787846, 0.20806485571342315, -0.08374280523397222, 0.07135189109370306, 0.048864962127279594, 0.09367810961298852, -0.06406235361565552, -0.25592027758900965, 0.3182004777255416, 0.05989773233886808, 0.24958149892821288, 0.0529245272207643, 0.10061598742403374, -0.017422445673016936, -0.02223759383034323, 0.044038285700581686, -0.17108781124511552, 0.13338774653352126, 0.2015062449322108, 0.08710466220132831, 0.31843581398586845, -0.41585638871118946, -0.18353345168078603, 0.115592322559678, 0.14973803492183732, 0.10451780273352698, -0.049068332895886774, -0.24210760060183625, 0.12050859601125315, -0.13057808859674777, -0.12923563171271882, -0.05657150125140712, 0.03070474197981336, 0.017546023142939602, -0.31431609034674085, 0.07619417742201524, 0.08130278293982782, 0.07415147997219013, -0.04021902032157717, -0.1173447678407279, 0.02752948404991508, 0.10839466043772619, 0.039005823142360896, 0.04442898678715008, 0.08125178902992047, -0.13952147073076857, -0.08031410044835259, 0.33413058362526094, -0.0914810949169704, -0.26313817140342305, 0.15169807459703102, -0.1600970891304314, -0.10985503159463406, 0.12288312724558637, 0.19207313980708327, 0.13720127980438215, -0.11923023662656204, 0.12046946730232674, -0.06643477090353321, 0.1940961503722873, 0.06053015605074405, 0.01655735823523072, 0.11629317780413355, 0.15602279050734877, 0.12205684330223852, 0.14171226376210042, -0.061968525766537316, -0.08852007362778143, -0.3439450604087647, -0.15449666830702175, -0.23100471978412113, 0.062353989425092654, -0.1367548774558903, -0.17110506175352688, 0.3501509045264457, 0.16651997181502842, 0.24045858967777653, 0.0909757960600675, 0.2618893060692547, 0.14831476803940152, 0.010451736008690204, 0.09609262029375208, 0.20174177693166306, 0.10482365140099621, 0.060027149326439634, -0.20789796988214626, 0.07039073880474057, 0.08785231335236353]
|
1,803.09594
|
On periodicity of a meromorphic function when sharing two sets IM
|
In this paper, we have investigated the sufficient conditions for periodicity
of meromorphic functions and obtained two results directly improving the result
of \emph{Bhoosnurmath-Kabbur} \cite{Bho & Kab-2013}, \emph{Qi-Dou-Yang}
\cite{Qi & Dou & Yan-ADE-2012} and \emph{Zhang} \cite{Zha-JMMA-2010}. Let
$\mathcal{S}_{1}=\left\{z:\displaystyle\int_{0}^{z-a}(t-a)^n(t-b)^4dt+1=0\right\}$
and $\mathcal{S}_{2}=\bigg\{a,b\bigg\}$, where $n\geq 4(n\geq 3)$ be an
integer.\emph{Let $f(z)$ be a non-constant meromorphic (entire) function
satisfying $\ol E_{f(z)}(\mathcal{S}_j)=\ol E_{f(z+c)}(\mathcal{S}_j),
(j=1,\;2)$ then $f(z)\equiv f(z+c)$.} Some examples have been exhibited to show
that, it is not necessary that meromorphic function should be of finite order
and also to show that the sets considered in the paper simply can't be replace
by arbitrary sets. At the last section, we have posed an open question for the
further improvement of the results of this paper.
|
math.CV
|
in this paper we have investigated the sufficient conditions for periodicity of meromorphic functions and obtained two results directly improving the result of emphbhoosnurmathkabbur citebho kab2013 emphqidouyang citeqi dou yanade2012 and emphzhang citezhajmma2010 let mathcals_1leftzdisplaystyleint_0zatantb4dt10right and mathcals_2biggabbigg where ngeq 4ngeq 3 be an integeremphlet fz be a nonconstant meromorphic entire function satisfying ol e_fzmathcals_jol e_fzcmathcals_j j12 then fzequiv fzc some examples have been exhibited to show that it is not necessary that meromorphic function should be of finite order and also to show that the sets considered in the paper simply cant be replace by arbitrary sets at the last section we have posed an open question for the further improvement of the results of this paper
|
[['in', 'this', 'paper', 'we', 'have', 'investigated', 'the', 'sufficient', 'conditions', 'for', 'periodicity', 'of', 'meromorphic', 'functions', 'and', 'obtained', 'two', 'results', 'directly', 'improving', 'the', 'result', 'of', 'emphbhoosnurmathkabbur', 'citebho', 'kab2013', 'emphqidouyang', 'citeqi', 'dou', 'yanade2012', 'and', 'emphzhang', 'citezhajmma2010', 'let', 'mathcals_1leftzdisplaystyleint_0zatantb4dt10right', 'and', 'mathcals_2biggabbigg', 'where', 'ngeq', '4ngeq', '3', 'be', 'an', 'integeremphlet', 'fz', 'be', 'a', 'nonconstant', 'meromorphic', 'entire', 'function', 'satisfying', 'ol', 'e_fzmathcals_jol', 'e_fzcmathcals_j', 'j12', 'then', 'fzequiv', 'fzc', 'some', 'examples', 'have', 'been', 'exhibited', 'to', 'show', 'that', 'it', 'is', 'not', 'necessary', 'that', 'meromorphic', 'function', 'should', 'be', 'of', 'finite', 'order', 'and', 'also', 'to', 'show', 'that', 'the', 'sets', 'considered', 'in', 'the', 'paper', 'simply', 'cant', 'be', 'replace', 'by', 'arbitrary', 'sets', 'at', 'the', 'last', 'section', 'we', 'have', 'posed', 'an', 'open', 'question', 'for', 'the', 'further', 'improvement', 'of', 'the', 'results', 'of', 'this', 'paper']]
|
[-0.10028140343652636, 0.07172463060266512, -0.06345980784481428, 0.04116586420351785, -0.05129403706101299, -0.1215639353008466, 0.002399299970563209, 0.3752876389954312, -0.2604108151669304, -0.24692276746545935, 0.13662432771240013, -0.2385721642925751, -0.17742286063274185, 0.23855608446048757, -0.07858977738000891, 0.04598403486934509, 0.03858679467036078, 0.040664645331893484, -0.059395393692230916, -0.3626776235178113, 0.37655278622154514, -0.028828621033907813, 0.16616279036537104, 0.1481833971475306, 0.07368332059944377, -0.030677349352296077, 0.014486666921727067, 0.031311944106538946, -0.16161093516519245, 0.08213395886488405, 0.27969598212146984, 0.14044055662473992, 0.27913147010201333, -0.41094995028905423, -0.19012864288307874, 0.1816188296823598, 0.18479798587299334, 0.02861462529821723, -0.02325933562208186, -0.25281324367239777, 0.1676097200914085, -0.1461790704268816, -0.17489785575490518, -0.07336816009061009, 0.05038584070280194, 0.039126124802529444, -0.3087573737207362, 0.0017990534734231985, 0.11317867413163185, 0.06399042942725561, -0.0939558822360328, -0.10843591277451053, -0.020740111006935145, 0.11720333724310074, 0.02872178939801148, 0.11800257654805832, 0.004301944336689571, -0.06259431358536377, -0.09345147377519193, 0.3096251301010888, -0.06179552681072999, -0.27004290622312066, 0.13489179354042327, -0.1717215099271533, -0.1545016007205727, 0.06578889676351465, 0.13291936438968954, 0.11935733249821864, -0.14537930639241547, 0.13511799233646005, -0.09905536437644531, 0.1447687346668567, 0.14649174932171316, 0.010841236901743448, 0.13145788397420854, 0.09350494620865028, 0.07127220814308043, 0.13577986197253944, 0.006861067660079867, 0.004439048619721742, -0.329464077876479, -0.17850608285059968, -0.16130787585679368, 0.06113539567441501, -0.03308338711127255, -0.13236522972903342, 0.3932072569378743, 0.13338866251676032, 0.22217119985040934, 0.0767196427355064, 0.2179277107192605, 0.17714919077458463, 0.03768219095746092, 0.05991757624125218, 0.18735924592913886, 0.10618911032318412, 0.05002386263553418, -0.1341920812938399, 0.028103758297933667, 0.04189643014094555]
|
1,803.09595
|
FCC-ee polarimeter
|
Another way to measure electron beam polarization by inverse Compton
scattering
|
physics.ins-det physics.acc-ph
|
another way to measure electron beam polarization by inverse compton scattering
|
[['another', 'way', 'to', 'measure', 'electron', 'beam', 'polarization', 'by', 'inverse', 'compton', 'scattering']]
|
[0.0016877749426798387, 0.2680466700006615, -0.10593227415599606, 0.18637128800831057, -0.1035193165933544, -0.16471062261949887, 0.007269736718047749, 0.5307180000977083, -0.41702556813305075, -0.283988393843174, -0.07221597907218066, -0.3525336943566799, 0.08245748755606738, 0.23219537997448986, 0.14535001292824745, 0.1404341670515185, -0.09758140883323821, -0.21101496842774478, 0.013568743047389116, -0.04351111708886244, 0.4316774864088405, 0.2544450624845922, 0.33167536014860327, 0.08183878575536338, 0.14219688861207527, 0.22228667681867426, -0.05971554273062132, -0.09567143717272715, 0.006849763068285855, 0.10842662905766205, 0.24840613700110803, 0.029067853635007686, 0.05094145102934404, -0.34938574446873233, -0.2034541012888605, 0.025246973064812748, 0.20705269954421304, 0.07332070578228343, -0.06013828346675092, -0.25529938902367244, -0.17088901488618416, -0.11148767715150659, -0.2676598160866309, -0.011411973232911392, 0.08643081140789119, -0.10220448909835382, -0.27511062955653126, -0.014680331572890282, -0.0011320588263598356, -0.05776935477148403, -0.019434392790902744, -0.056851292875680054, 0.13005301136184821, -0.12648435614325784, 0.10263127427209508, 0.1180856932293285, 0.30853061767464335, -0.03715769552879713, -0.18905400823463092, 0.34387703764845023, -0.042339162562381134, -0.12409256060015071, 0.03882690146565437, -0.3489763090302321, 0.15014357754791324, 0.2986386641860008, 0.16142115674235605, -0.01119100031527606, -0.2770890245976096, 0.014760794287378138, -0.0724120953712951, 0.16854249550537628, 0.20172700793905693, -0.0029309334402734585, 0.24237421696836298, 0.12404975591396744, 0.11465372145175934, 0.13423651981760154, -0.24414227902889252, 0.1512187413701957, -0.24173618006435307, -0.07904983515089209, -0.15019242617894302, 0.22242633185603403, -0.026017277586189182, -0.08178355477072975, 0.26925668662244623, 0.08462999828837135, 0.15101843411949548, -0.10260594974864613, 0.46150924400849774, 0.24051074074073273, 0.06513509383975444, -0.036333544476127085, 0.2473682469942353, 0.26732533799738367, 0.12074204500425946, -0.37008642980998213, 0.030644567175344986, -0.0035836818543347445]
|
1,803.09596
|
A Single Microscopic State to Characterize Ordering Tendency in Discrete
Multicomponent System
|
Our recent study reveals that macroscopic structure in thermodynamically
equilibrium state and its temperature dependence for classical discrete system
can be well-characterized by a single specially-selected microscopic state
(which we call projection state: PS), whose structure can be known a priori
without any information about energy or temperature. Although PS can be
universally constructed for any number of components R, practical application
of PS to systems with R >= 3 is non-trivial compared with R = 2 (i.e., binary
system). This is because (i) essentially, multicomponent system should
inevitably requires linear transformation from conventional basis functions to
intuitively-interpreted cluster probability basis, i.e., multiple PS energies
are required to predict one chosen pair probability, leading to practically
accumulating numerical errors, and (ii) additionally, explicit formula for the
transformation from basis functions to pair probabilities should be required,
which has been explicitly provided up to ternary (R = 3) system so far. We here
derive modified formulation to directly determine probability for likeand
unlike-atom pair consisting of any chosen elements by using a single PS energy,
with providing explicit relationship between basis functions and pair
probabilities up to quinary (R = 5) systems. We demonstrate the validity of the
formulation by comparing temperature dependence of pair probabilities for
multicomponent systems from thermodynamic simulations.
|
cond-mat.mtrl-sci
|
our recent study reveals that macroscopic structure in thermodynamically equilibrium state and its temperature dependence for classical discrete system can be wellcharacterized by a single speciallyselected microscopic state which we call projection state ps whose structure can be known a priori without any information about energy or temperature although ps can be universally constructed for any number of components r practical application of ps to systems with r 3 is nontrivial compared with r 2 ie binary system this is because i essentially multicomponent system should inevitably requires linear transformation from conventional basis functions to intuitivelyinterpreted cluster probability basis ie multiple ps energies are required to predict one chosen pair probability leading to practically accumulating numerical errors and ii additionally explicit formula for the transformation from basis functions to pair probabilities should be required which has been explicitly provided up to ternary r 3 system so far we here derive modified formulation to directly determine probability for likeand unlikeatom pair consisting of any chosen elements by using a single ps energy with providing explicit relationship between basis functions and pair probabilities up to quinary r 5 systems we demonstrate the validity of the formulation by comparing temperature dependence of pair probabilities for multicomponent systems from thermodynamic simulations
|
[['our', 'recent', 'study', 'reveals', 'that', 'macroscopic', 'structure', 'in', 'thermodynamically', 'equilibrium', 'state', 'and', 'its', 'temperature', 'dependence', 'for', 'classical', 'discrete', 'system', 'can', 'be', 'wellcharacterized', 'by', 'a', 'single', 'speciallyselected', 'microscopic', 'state', 'which', 'we', 'call', 'projection', 'state', 'ps', 'whose', 'structure', 'can', 'be', 'known', 'a', 'priori', 'without', 'any', 'information', 'about', 'energy', 'or', 'temperature', 'although', 'ps', 'can', 'be', 'universally', 'constructed', 'for', 'any', 'number', 'of', 'components', 'r', 'practical', 'application', 'of', 'ps', 'to', 'systems', 'with', 'r', '3', 'is', 'nontrivial', 'compared', 'with', 'r', '2', 'ie', 'binary', 'system', 'this', 'is', 'because', 'i', 'essentially', 'multicomponent', 'system', 'should', 'inevitably', 'requires', 'linear', 'transformation', 'from', 'conventional', 'basis', 'functions', 'to', 'intuitivelyinterpreted', 'cluster', 'probability', 'basis', 'ie', 'multiple', 'ps', 'energies', 'are', 'required', 'to', 'predict', 'one', 'chosen', 'pair', 'probability', 'leading', 'to', 'practically', 'accumulating', 'numerical', 'errors', 'and', 'ii', 'additionally', 'explicit', 'formula', 'for', 'the', 'transformation', 'from', 'basis', 'functions', 'to', 'pair', 'probabilities', 'should', 'be', 'required', 'which', 'has', 'been', 'explicitly', 'provided', 'up', 'to', 'ternary', 'r', '3', 'system', 'so', 'far', 'we', 'here', 'derive', 'modified', 'formulation', 'to', 'directly', 'determine', 'probability', 'for', 'likeand', 'unlikeatom', 'pair', 'consisting', 'of', 'any', 'chosen', 'elements', 'by', 'using', 'a', 'single', 'ps', 'energy', 'with', 'providing', 'explicit', 'relationship', 'between', 'basis', 'functions', 'and', 'pair', 'probabilities', 'up', 'to', 'quinary', 'r', '5', 'systems', 'we', 'demonstrate', 'the', 'validity', 'of', 'the', 'formulation', 'by', 'comparing', 'temperature', 'dependence', 'of', 'pair', 'probabilities', 'for', 'multicomponent', 'systems', 'from', 'thermodynamic', 'simulations']]
|
[-0.09964038670725955, 0.11350301931052482, -0.08676160413202981, 0.03196971160944625, -0.03979903979460924, -0.1763514820440429, 0.06745041891407184, 0.37181652066632737, -0.28406062811782834, -0.3195900415240103, 0.07268149977930698, -0.24093629257395643, -0.08933078119499159, 0.17919895420851084, 0.019918483029362822, 0.07257504630896947, 0.04225446938151686, 0.06339570081889115, -0.11753871348477772, -0.20919227347310101, 0.315105032565742, 0.06814330396944372, 0.24979507284849112, 0.020585860913674453, 0.10097148666660682, 0.021390899114902568, 0.011627747283863097, 0.031146082472861308, -0.11221519019587334, 0.07748521308316, 0.24683327769076113, 0.12451617221870996, 0.22572089407106705, -0.40969865829248, -0.21255244166484755, 0.11933151669077703, 0.13735204795375466, 0.1316875513044319, -0.010358896608845206, -0.23521785317000296, 0.12189826536051966, -0.1962475078363944, -0.1427406634736274, -0.10563387513491027, 0.05325295621520046, 0.043407025405783846, -0.3170301552140498, 0.06913822778084704, 0.030472486661838855, 0.03793605946788904, -0.04383054678959157, -0.13283386993568316, -0.03845452211838528, 0.09980107655718905, -0.026330791549124006, 0.02840302226975505, 0.11475599701906293, -0.057205767582946, -0.09394360145610146, 0.36079329764699847, -0.04057581553217299, -0.2204699262456505, 0.18931998189405672, -0.12192381748681878, -0.08427956308641935, 0.16325074675827853, 0.11471736055209297, 0.09852315245277657, -0.17943040471354252, 0.06087354228062225, -0.00159871518116426, 0.24395235115891606, 0.0579151137401648, 0.06067529435641146, 0.23008495823507716, 0.11549634375297488, 0.015549639688041739, 0.11409697537293217, -0.0482724981567148, -0.11158552967250494, -0.2974128720463538, -0.14860185152240868, -0.18558919271958874, 0.08638704227045031, -0.057301716411413434, -0.12496349587233672, 0.34655955836195224, 0.09603750470565779, 0.19089168980098306, 0.059102784537164305, 0.24181826517279512, 0.14770995230205228, 0.039575023031243, 0.0590147002453324, 0.1916097571587034, 0.09599545369901938, 0.019415083668180948, -0.17942754032343783, 0.0733482309914162, 0.0727854172774852]
|
1,803.09597
|
One-Shot Segmentation in Clutter
|
We tackle the problem of one-shot segmentation: finding and segmenting a
previously unseen object in a cluttered scene based on a single instruction
example. We propose a novel dataset, which we call $\textit{cluttered
Omniglot}$. Using a baseline architecture combining a Siamese embedding for
detection with a U-net for segmentation we show that increasing levels of
clutter make the task progressively harder. Using oracle models with access to
various amounts of ground-truth information, we evaluate different aspects of
the problem and show that in this kind of visual search task, detection and
segmentation are two intertwined problems, the solution to each of which helps
solving the other. We therefore introduce $\textit{MaskNet}$, an improved model
that attends to multiple candidate locations, generates segmentation proposals
to mask out background clutter and selects among the segmented objects. Our
findings suggest that such image recognition models based on an iterative
refinement of object detection and foreground segmentation may provide a way to
deal with highly cluttered scenes.
|
cs.CV
|
we tackle the problem of oneshot segmentation finding and segmenting a previously unseen object in a cluttered scene based on a single instruction example we propose a novel dataset which we call textitcluttered omniglot using a baseline architecture combining a siamese embedding for detection with a unet for segmentation we show that increasing levels of clutter make the task progressively harder using oracle models with access to various amounts of groundtruth information we evaluate different aspects of the problem and show that in this kind of visual search task detection and segmentation are two intertwined problems the solution to each of which helps solving the other we therefore introduce textitmasknet an improved model that attends to multiple candidate locations generates segmentation proposals to mask out background clutter and selects among the segmented objects our findings suggest that such image recognition models based on an iterative refinement of object detection and foreground segmentation may provide a way to deal with highly cluttered scenes
|
[['we', 'tackle', 'the', 'problem', 'of', 'oneshot', 'segmentation', 'finding', 'and', 'segmenting', 'a', 'previously', 'unseen', 'object', 'in', 'a', 'cluttered', 'scene', 'based', 'on', 'a', 'single', 'instruction', 'example', 'we', 'propose', 'a', 'novel', 'dataset', 'which', 'we', 'call', 'textitcluttered', 'omniglot', 'using', 'a', 'baseline', 'architecture', 'combining', 'a', 'siamese', 'embedding', 'for', 'detection', 'with', 'a', 'unet', 'for', 'segmentation', 'we', 'show', 'that', 'increasing', 'levels', 'of', 'clutter', 'make', 'the', 'task', 'progressively', 'harder', 'using', 'oracle', 'models', 'with', 'access', 'to', 'various', 'amounts', 'of', 'groundtruth', 'information', 'we', 'evaluate', 'different', 'aspects', 'of', 'the', 'problem', 'and', 'show', 'that', 'in', 'this', 'kind', 'of', 'visual', 'search', 'task', 'detection', 'and', 'segmentation', 'are', 'two', 'intertwined', 'problems', 'the', 'solution', 'to', 'each', 'of', 'which', 'helps', 'solving', 'the', 'other', 'we', 'therefore', 'introduce', 'textitmasknet', 'an', 'improved', 'model', 'that', 'attends', 'to', 'multiple', 'candidate', 'locations', 'generates', 'segmentation', 'proposals', 'to', 'mask', 'out', 'background', 'clutter', 'and', 'selects', 'among', 'the', 'segmented', 'objects', 'our', 'findings', 'suggest', 'that', 'such', 'image', 'recognition', 'models', 'based', 'on', 'an', 'iterative', 'refinement', 'of', 'object', 'detection', 'and', 'foreground', 'segmentation', 'may', 'provide', 'a', 'way', 'to', 'deal', 'with', 'highly', 'cluttered', 'scenes']]
|
[-0.053106098141870464, -0.01569942091136909, -0.0710694233464892, 0.03630019078627811, -0.13461463158600964, -0.18657346004620196, 0.030698458204278724, 0.46148552584345454, -0.2295622300094692, -0.3822358913545031, 0.059052326552045994, -0.2789398384891683, -0.18650241357972847, 0.17014502655656544, -0.18864506743702805, 0.04941793721154682, 0.1596845763386227, 0.0496423403326844, -0.05945433070692161, -0.24371662795456359, 0.3040595210681204, 0.03780789992306381, 0.30423200884833934, 0.011075543929473497, 0.16823646770499182, -0.025978004588978365, -0.07168582451122348, 0.013773771852720528, -0.024037711180608313, 0.18245581056107768, 0.3197452050159427, 0.2023361165600363, 0.2808177772880299, -0.3962900668091606, -0.23838936499669217, 0.08613880542980042, 0.15290772192092844, 0.11720975934003945, -0.09874546141727478, -0.39702619405579753, 0.11207133975876786, -0.14465046324767172, 0.0193098713454674, -0.10687223995191744, -0.021535355597006856, -0.0655265745557699, -0.3107461876468733, 0.010047568628215231, 0.0758942039537942, 0.008903679077047855, -0.11144611718627857, -0.08082392602082109, 0.07377212561914348, 0.1700762704189401, -0.0068137225774989926, 0.06033941921996302, 0.1326960711972788, -0.26097296559414646, -0.1633325614486239, 0.3833133769483538, -0.013290573647827842, -0.2453995274467161, 0.2180474638895248, -0.024631201024749316, -0.19706922477053013, 0.11076192742038984, 0.21804485472821397, 0.18668082766525912, -0.15395717524806968, -0.04704635078123829, -0.07782912299880991, 0.1953080093022436, 0.07191638496879023, -0.0210967632025131, 0.22670674151158893, 0.26824216995155437, 0.07059875878003367, 0.21523773761618942, -0.2236357652465813, -0.012362516143184621, -0.20941968221195567, -0.09705759166536154, -0.13903133811982116, -0.047553363587576315, -0.10657389729994975, -0.185003340759431, 0.387984141567722, 0.28938335785423985, 0.24959996001125545, 0.08770587610924849, 0.34500324053224174, 0.0079641395022918, 0.07612531322956784, 0.047504432949790495, 0.13412561624209046, -0.0358550142715103, 0.06555519184912555, -0.15762858991656686, 0.06728362163848942, 0.08917625555768609]
|
1,803.09598
|
Formation of autophagosomes coincides with relaxation of membrane
curvature
|
Autophagy is an intracellular degradation process that employs complex
membrane dynamics to isolate and break down cellular components. However, many
unanswered questions remain concerning remodeling of autophagic membranes.
Here, we focus on the advantages of theoretical modelling to study the
formation of autophagosomes and to understand the origin of autophagosomal
membranes. Starting from the well-defined geometry of final autophagosomes we
ask the question of how these organelles can be formed by combining various
preautophagosomal membranes such as vesicles, membrane tubules or sheets. We
analyse the geometric constraints of autophagosome formation by taking the area
of the precursor membranes and their internal volume into account. Our results
suggest that vesicle fusion contributes little to the formation of
autophagosomes. In the second part we quantify the curvature of the precursors
and report that the formation of autophagosomes is associated with a strong
relaxation of membrane curvature energy. This effect we find for a wide range
of membrane asymmetries. It is especially strong for small distances between
both autophagosomal membranes, as observed in vivo. We quantify the membrane
bending energies of all precursors by considering membrane asymmetries. We
propose that the generation and supply of pre-autophagosomal membranes is one
limiting step for autophagosome formation.
|
q-bio.SC cond-mat.soft
|
autophagy is an intracellular degradation process that employs complex membrane dynamics to isolate and break down cellular components however many unanswered questions remain concerning remodeling of autophagic membranes here we focus on the advantages of theoretical modelling to study the formation of autophagosomes and to understand the origin of autophagosomal membranes starting from the welldefined geometry of final autophagosomes we ask the question of how these organelles can be formed by combining various preautophagosomal membranes such as vesicles membrane tubules or sheets we analyse the geometric constraints of autophagosome formation by taking the area of the precursor membranes and their internal volume into account our results suggest that vesicle fusion contributes little to the formation of autophagosomes in the second part we quantify the curvature of the precursors and report that the formation of autophagosomes is associated with a strong relaxation of membrane curvature energy this effect we find for a wide range of membrane asymmetries it is especially strong for small distances between both autophagosomal membranes as observed in vivo we quantify the membrane bending energies of all precursors by considering membrane asymmetries we propose that the generation and supply of preautophagosomal membranes is one limiting step for autophagosome formation
|
[['autophagy', 'is', 'an', 'intracellular', 'degradation', 'process', 'that', 'employs', 'complex', 'membrane', 'dynamics', 'to', 'isolate', 'and', 'break', 'down', 'cellular', 'components', 'however', 'many', 'unanswered', 'questions', 'remain', 'concerning', 'remodeling', 'of', 'autophagic', 'membranes', 'here', 'we', 'focus', 'on', 'the', 'advantages', 'of', 'theoretical', 'modelling', 'to', 'study', 'the', 'formation', 'of', 'autophagosomes', 'and', 'to', 'understand', 'the', 'origin', 'of', 'autophagosomal', 'membranes', 'starting', 'from', 'the', 'welldefined', 'geometry', 'of', 'final', 'autophagosomes', 'we', 'ask', 'the', 'question', 'of', 'how', 'these', 'organelles', 'can', 'be', 'formed', 'by', 'combining', 'various', 'preautophagosomal', 'membranes', 'such', 'as', 'vesicles', 'membrane', 'tubules', 'or', 'sheets', 'we', 'analyse', 'the', 'geometric', 'constraints', 'of', 'autophagosome', 'formation', 'by', 'taking', 'the', 'area', 'of', 'the', 'precursor', 'membranes', 'and', 'their', 'internal', 'volume', 'into', 'account', 'our', 'results', 'suggest', 'that', 'vesicle', 'fusion', 'contributes', 'little', 'to', 'the', 'formation', 'of', 'autophagosomes', 'in', 'the', 'second', 'part', 'we', 'quantify', 'the', 'curvature', 'of', 'the', 'precursors', 'and', 'report', 'that', 'the', 'formation', 'of', 'autophagosomes', 'is', 'associated', 'with', 'a', 'strong', 'relaxation', 'of', 'membrane', 'curvature', 'energy', 'this', 'effect', 'we', 'find', 'for', 'a', 'wide', 'range', 'of', 'membrane', 'asymmetries', 'it', 'is', 'especially', 'strong', 'for', 'small', 'distances', 'between', 'both', 'autophagosomal', 'membranes', 'as', 'observed', 'in', 'vivo', 'we', 'quantify', 'the', 'membrane', 'bending', 'energies', 'of', 'all', 'precursors', 'by', 'considering', 'membrane', 'asymmetries', 'we', 'propose', 'that', 'the', 'generation', 'and', 'supply', 'of', 'preautophagosomal', 'membranes', 'is', 'one', 'limiting', 'step', 'for', 'autophagosome', 'formation']]
|
[-0.11234797642580666, 0.13421168268399286, -0.03713725666880377, 0.05267469897317664, -0.02818100962481226, -0.0763464812093328, 0.009380246189749348, 0.38418165073470817, -0.2705998165489741, -0.2682542501295888, 0.08461924725975457, -0.22770554775410554, -0.19159758063369267, 0.1543672765333916, -0.06113374198921332, -0.020836253788504636, 0.03681655038152965, -0.05487006503282134, 0.027421666770098135, -0.16698726507254213, 0.29078718959881933, 0.06129474232462955, 0.26808320840379013, 0.13030918468733213, 0.0951840192170756, -0.03957401073151316, -0.0043570916816477005, 0.025633647000973987, -0.20684052311851928, 0.13797907405964954, 0.2009946022077089, 0.06947956249158657, 0.24726000827612335, -0.5068346816355113, -0.25662382012209134, 0.0822821137526543, 0.157298841283263, 0.13384553315730036, -0.053010432743923454, -0.20719420187386503, 0.09249664498247043, -0.10934894779677858, -0.1126143451728774, -0.0556577352360467, 0.026631561957645353, 0.04500035535767386, -0.19052100020758422, 0.11797843621707685, 0.06605248087200999, 0.021024566441390318, -0.10615713678938865, -0.08775707636359772, -0.06690398141316897, 0.183129449597003, 0.08929297776359311, -0.011901652355817598, 0.24475644495831467, -0.15651090243187993, -0.08811565439130381, 0.39323249301265867, -0.021581169662483458, -0.17500904154634947, 0.20668299305828808, -0.16075983861240453, -0.1323490833561176, 0.13186450276197387, 0.16519899522290402, 0.08428113994467043, -0.1550915637917663, 0.024391784740446287, 0.025277316638690987, 0.15955480001386754, 0.11175080257367112, 0.026632234191320377, 0.26689081610247645, 0.2483716393513701, 0.019633954522263238, 0.1586905182414261, -0.09977201276942463, -0.09101433330695577, -0.2688353517868066, -0.18323384859771996, -0.12092585966876737, 0.08320806718061764, -0.0629515679400581, -0.1732273513748858, 0.3700355372161211, 0.09728304966420089, 0.23599996197891912, 0.03451432536935827, 0.24223332240764706, 0.022449197648477155, 0.07452461850282151, -0.0175016579006981, 0.25350256845806296, 0.14504090316003168, 0.08393242195027775, -0.2667902870361451, 0.06208913285314038, -0.003232502594551782]
|
1,803.09599
|
Exploring Higgs boson Yukawa interactions with a scalar singlet using
Dyson-Schwinger equations
|
Higgs, being the first discovery of a fundamental scalar field in the
standard model (SM), opens the possibility of existence of other scalar or
pseudo scalar particles in nature. Though it does not conclusively fulfill the
role of inflaton, it does provide motivation for experimental searches
involving interactions of scalar (or pseudo scalar) particles as well as
implications of such particles' existence from the perspective of theoretical
understanding. Yukawa interactions are among the possible interactions. The
considered model addresses Yukawa interaction among the Higgs (and Higgs bar)
and a real singlet scalar field using Dyson Schwinger equations (DSEs) over a
range of bare coupling values relevant to inflation-related physics for several
scalar bare masses and cutoff values. The Higgs mass is kept fixed at two
values for two different scenarios. It is found that Higgs propagators are tree
level dominated while scalar propagators, despite their dependence on parameter
region, do not degenerate over the whole parameter space. The interaction
vertices show significant deviations from tree level expression for a number of
parameters and exhibit two distinct behaviors. Furthermore, the theory does not
show any conclusive sign of triviality over the explored parameter space,
despite suppressed vertices for some parameters, particularly for small
coupling values in a certain region of parameter space.
|
hep-ph
|
higgs being the first discovery of a fundamental scalar field in the standard model sm opens the possibility of existence of other scalar or pseudo scalar particles in nature though it does not conclusively fulfill the role of inflaton it does provide motivation for experimental searches involving interactions of scalar or pseudo scalar particles as well as implications of such particles existence from the perspective of theoretical understanding yukawa interactions are among the possible interactions the considered model addresses yukawa interaction among the higgs and higgs bar and a real singlet scalar field using dyson schwinger equations dses over a range of bare coupling values relevant to inflationrelated physics for several scalar bare masses and cutoff values the higgs mass is kept fixed at two values for two different scenarios it is found that higgs propagators are tree level dominated while scalar propagators despite their dependence on parameter region do not degenerate over the whole parameter space the interaction vertices show significant deviations from tree level expression for a number of parameters and exhibit two distinct behaviors furthermore the theory does not show any conclusive sign of triviality over the explored parameter space despite suppressed vertices for some parameters particularly for small coupling values in a certain region of parameter space
|
[['higgs', 'being', 'the', 'first', 'discovery', 'of', 'a', 'fundamental', 'scalar', 'field', 'in', 'the', 'standard', 'model', 'sm', 'opens', 'the', 'possibility', 'of', 'existence', 'of', 'other', 'scalar', 'or', 'pseudo', 'scalar', 'particles', 'in', 'nature', 'though', 'it', 'does', 'not', 'conclusively', 'fulfill', 'the', 'role', 'of', 'inflaton', 'it', 'does', 'provide', 'motivation', 'for', 'experimental', 'searches', 'involving', 'interactions', 'of', 'scalar', 'or', 'pseudo', 'scalar', 'particles', 'as', 'well', 'as', 'implications', 'of', 'such', 'particles', 'existence', 'from', 'the', 'perspective', 'of', 'theoretical', 'understanding', 'yukawa', 'interactions', 'are', 'among', 'the', 'possible', 'interactions', 'the', 'considered', 'model', 'addresses', 'yukawa', 'interaction', 'among', 'the', 'higgs', 'and', 'higgs', 'bar', 'and', 'a', 'real', 'singlet', 'scalar', 'field', 'using', 'dyson', 'schwinger', 'equations', 'dses', 'over', 'a', 'range', 'of', 'bare', 'coupling', 'values', 'relevant', 'to', 'inflationrelated', 'physics', 'for', 'several', 'scalar', 'bare', 'masses', 'and', 'cutoff', 'values', 'the', 'higgs', 'mass', 'is', 'kept', 'fixed', 'at', 'two', 'values', 'for', 'two', 'different', 'scenarios', 'it', 'is', 'found', 'that', 'higgs', 'propagators', 'are', 'tree', 'level', 'dominated', 'while', 'scalar', 'propagators', 'despite', 'their', 'dependence', 'on', 'parameter', 'region', 'do', 'not', 'degenerate', 'over', 'the', 'whole', 'parameter', 'space', 'the', 'interaction', 'vertices', 'show', 'significant', 'deviations', 'from', 'tree', 'level', 'expression', 'for', 'a', 'number', 'of', 'parameters', 'and', 'exhibit', 'two', 'distinct', 'behaviors', 'furthermore', 'the', 'theory', 'does', 'not', 'show', 'any', 'conclusive', 'sign', 'of', 'triviality', 'over', 'the', 'explored', 'parameter', 'space', 'despite', 'suppressed', 'vertices', 'for', 'some', 'parameters', 'particularly', 'for', 'small', 'coupling', 'values', 'in', 'a', 'certain', 'region', 'of', 'parameter', 'space']]
|
[-0.15312079911261478, 0.23018800280105448, -0.03361802222289948, 0.1289921407797484, -0.11655117253666981, -0.17733871659387557, 0.02635683381203915, 0.31363873269355974, -0.20750910365486172, -0.3272367183878241, 0.015565780725802397, -0.261872993534987, -0.11245299447647857, 0.16118427350183603, 0.06970534015030896, 0.031099297927518185, 0.04617118467113347, 0.06126824561829273, -0.04849681711200651, -0.232708150869615, 0.34780986561832766, -0.005278051358546126, 0.20428286500548795, 0.09688471916122847, 0.07535060950206213, 0.03375970604564659, 0.013325223054513953, -0.02443229950458513, -0.11486216109170566, 0.027824242025507852, 0.17889102420745356, 0.06278100428701118, 0.22561772192400215, -0.33643217865042213, -0.21538117216730057, 0.18988198886506294, 0.17920187088248202, 0.09019428630628716, -0.06330910611564461, -0.27175431858342125, 0.0583247247580174, -0.1549636228319028, -0.14400722101160823, -0.08995539620209715, -0.01040460399387325, -0.07073100312900954, -0.31577242754280604, 0.08204968071705993, -0.012994629652592491, 0.039564483582761614, -0.06663509210355369, -0.1736921040877541, -0.060831381571898456, 0.08786408462830912, 0.1451441796106988, -0.011842892256673532, 0.1470138569499291, -0.21489623582246603, -0.11346719270545583, 0.39509394519931473, -0.10419495433780819, -0.21461230092152284, 0.1913725931108576, -0.16455743523751568, -0.12566962071424914, 0.13088697973215044, 0.14248673081887947, 0.08656616610368952, -0.13664096017849248, 0.20055798509475992, -0.006710635743134818, 0.15654888046713397, 0.06833102028393209, 0.06952424433470761, 0.2620052220295702, 0.13011937109550453, 0.030868361647774893, 0.051389698853100525, -0.009121707605277475, -0.16693540732955595, -0.37912127566943166, -0.12033270992905837, -0.1312498554446121, 0.02569443083022582, -0.12241091153455315, -0.16844457081602932, 0.3995492362585007, 0.145121800775035, 0.22796059222406403, 0.03261892073368433, 0.24717354563934402, 0.061129678024190934, 0.10359829587760377, 0.020159803399864708, 0.32598983588083913, 0.1389519672364138, 0.08465519491351382, -0.1938680371642554, 0.025256290263827377, 0.05979912992460892]
|
1,803.096
|
On the evolutionary status and pulsations of the recently discovered
Blue Large-Amplitude Pulsators (BLAPs)
|
The Blue Large-Amplitude Pulsators (BLAPs) constitute a new class of
pulsating stars. They are hot stars with effective temperatures of ~30 000 K
and surface gravities of log g ~ 4.9, that pulsate with periods in the range
20-40 min. Until now, their origin and evolutionary state, as well as the
nature of their pulsations, were not been unveiled. In this paper, we propose
that the BLAPs are the hot counterpart of the already known pulsating
pre-Extremely Low Mass (pre-ELM) white dwarf (WD) stars, that are He-core
low-mass stars resulting from interacting binary evolution. Using fully
evolutionary sequences, we show that the BLAPs are well represented by pre-ELM
WD models with high effective temperature and stellar masses ~ 0.34 Msun. From
the analysis of their pulsational properties, we find that the observed
variabilities can be explained by high-order nonradial g-mode pulsations or, in
the case of the shortest periods, also by low-order radial modes, including the
fundamental radial mode. The theoretical modes with periods in the observed
range are unstable due to the kappa mechanism associated to the Z-bump in the
opacity at log T ~ 5.25.
|
astro-ph.SR
|
the blue largeamplitude pulsators blaps constitute a new class of pulsating stars they are hot stars with effective temperatures of 30 000 k and surface gravities of log g 49 that pulsate with periods in the range 2040 min until now their origin and evolutionary state as well as the nature of their pulsations were not been unveiled in this paper we propose that the blaps are the hot counterpart of the already known pulsating preextremely low mass preelm white dwarf wd stars that are hecore lowmass stars resulting from interacting binary evolution using fully evolutionary sequences we show that the blaps are well represented by preelm wd models with high effective temperature and stellar masses 034 msun from the analysis of their pulsational properties we find that the observed variabilities can be explained by highorder nonradial gmode pulsations or in the case of the shortest periods also by loworder radial modes including the fundamental radial mode the theoretical modes with periods in the observed range are unstable due to the kappa mechanism associated to the zbump in the opacity at log t 525
|
[['the', 'blue', 'largeamplitude', 'pulsators', 'blaps', 'constitute', 'a', 'new', 'class', 'of', 'pulsating', 'stars', 'they', 'are', 'hot', 'stars', 'with', 'effective', 'temperatures', 'of', '30', '000', 'k', 'and', 'surface', 'gravities', 'of', 'log', 'g', '49', 'that', 'pulsate', 'with', 'periods', 'in', 'the', 'range', '2040', 'min', 'until', 'now', 'their', 'origin', 'and', 'evolutionary', 'state', 'as', 'well', 'as', 'the', 'nature', 'of', 'their', 'pulsations', 'were', 'not', 'been', 'unveiled', 'in', 'this', 'paper', 'we', 'propose', 'that', 'the', 'blaps', 'are', 'the', 'hot', 'counterpart', 'of', 'the', 'already', 'known', 'pulsating', 'preextremely', 'low', 'mass', 'preelm', 'white', 'dwarf', 'wd', 'stars', 'that', 'are', 'hecore', 'lowmass', 'stars', 'resulting', 'from', 'interacting', 'binary', 'evolution', 'using', 'fully', 'evolutionary', 'sequences', 'we', 'show', 'that', 'the', 'blaps', 'are', 'well', 'represented', 'by', 'preelm', 'wd', 'models', 'with', 'high', 'effective', 'temperature', 'and', 'stellar', 'masses', '034', 'msun', 'from', 'the', 'analysis', 'of', 'their', 'pulsational', 'properties', 'we', 'find', 'that', 'the', 'observed', 'variabilities', 'can', 'be', 'explained', 'by', 'highorder', 'nonradial', 'gmode', 'pulsations', 'or', 'in', 'the', 'case', 'of', 'the', 'shortest', 'periods', 'also', 'by', 'loworder', 'radial', 'modes', 'including', 'the', 'fundamental', 'radial', 'mode', 'the', 'theoretical', 'modes', 'with', 'periods', 'in', 'the', 'observed', 'range', 'are', 'unstable', 'due', 'to', 'the', 'kappa', 'mechanism', 'associated', 'to', 'the', 'zbump', 'in', 'the', 'opacity', 'at', 'log', 't', '525']]
|
[-0.09750525162636704, 0.24701253186829916, -0.06123598390182511, 0.08980898324672458, -0.12277076745029193, -0.0719966791631257, 0.10183641594475837, 0.38969316767131695, -0.1884461589223741, -0.37020622257937175, 0.08254942103082956, -0.2851328022896398, -0.07444199680635716, 0.2165263413382908, -0.07290480161961066, 0.007935790257920293, 0.10967187990836515, -0.005897708165286303, -0.01769283996790627, -0.24461942885256796, 0.2786268415807395, -0.007472641493799419, 0.09723567617344644, -0.0859173290126784, -0.00887732896088658, -0.133677296214508, -0.029887741577908234, -0.06555539541852361, -0.14819808358736394, -0.0041021954260583296, 0.24698828779062135, 0.0881741949809315, 0.20221100696279856, -0.3310232717706695, -0.25195279173664953, 0.05415469180802748, 0.1980943452634294, 0.0392704294851976, -0.03908143048934878, -0.2149641387758756, 0.1272636466491662, -0.16724871517708678, -0.16129108945345455, -0.018497890721538353, 0.09034955157781314, 0.07032904963268609, -0.2033493500457354, 0.14520826236210646, 0.069005328077884, 0.09971072308495234, -0.11448361441910349, -0.1738594347646694, -0.10421785183983748, 0.0670665902978756, 0.06608173716495251, 0.0434280819732879, 0.06252171606833085, -0.07942438170522492, -0.029376402591441662, 0.40119261287255825, -0.1557325367647849, -0.015884223987623194, 0.24253677435300716, -0.16830511825525615, -0.13737672523600483, 0.14335693263504756, 0.15288660116748162, 0.18943742374619826, -0.16236428537945483, -0.007789900518293477, 0.03596524727566402, 0.179390349845234, 0.08981248028474591, 0.09542225635116869, 0.35061573097227866, 0.13452072806727608, -0.046006327614574974, 0.04808752435575051, -0.20832589385258746, -0.050798990269435844, -0.22487098841019523, -0.06254890994194263, -0.09442766267813289, 0.04647437337465658, -0.0909280360564545, -0.16169249789555215, 0.36074282437094735, 0.06629908321898614, 0.1991366763151368, 0.04157444049573702, 0.2460716563414355, 0.14630682855880123, 0.08868330662823257, 0.1759320438045581, 0.31318437813938965, 0.23434321233707536, 0.09496463776713675, -0.26915521140317206, 0.04746032008758741, -0.00538260047196772]
|
1,803.09601
|
Threshold Progressions in a Variety of Covering and Packing Contexts
|
Using standard methods (due to Janson, Stein-Chen, and Talagrand) from
probabilistic combinatorics, we explore the following general theme: As one
progresses from each member of a family of objects ${\cal A}$ being "covered"
by at most one object in a random collection ${\cal C}$, to being covered at
most $\lambda$ times, to being covered at least once, to being covered at least
$\lambda$ times, a hierarchy of thresholds emerge. We will then see how such
results vary according to the context, and level of dependence introduced.
Examples will be from extremal set theory, combinatorics, and additive number
theory.
|
math.CO
|
using standard methods due to janson steinchen and talagrand from probabilistic combinatorics we explore the following general theme as one progresses from each member of a family of objects cal a being covered by at most one object in a random collection cal c to being covered at most lambda times to being covered at least once to being covered at least lambda times a hierarchy of thresholds emerge we will then see how such results vary according to the context and level of dependence introduced examples will be from extremal set theory combinatorics and additive number theory
|
[['using', 'standard', 'methods', 'due', 'to', 'janson', 'steinchen', 'and', 'talagrand', 'from', 'probabilistic', 'combinatorics', 'we', 'explore', 'the', 'following', 'general', 'theme', 'as', 'one', 'progresses', 'from', 'each', 'member', 'of', 'a', 'family', 'of', 'objects', 'cal', 'a', 'being', 'covered', 'by', 'at', 'most', 'one', 'object', 'in', 'a', 'random', 'collection', 'cal', 'c', 'to', 'being', 'covered', 'at', 'most', 'lambda', 'times', 'to', 'being', 'covered', 'at', 'least', 'once', 'to', 'being', 'covered', 'at', 'least', 'lambda', 'times', 'a', 'hierarchy', 'of', 'thresholds', 'emerge', 'we', 'will', 'then', 'see', 'how', 'such', 'results', 'vary', 'according', 'to', 'the', 'context', 'and', 'level', 'of', 'dependence', 'introduced', 'examples', 'will', 'be', 'from', 'extremal', 'set', 'theory', 'combinatorics', 'and', 'additive', 'number', 'theory']]
|
[-0.02941941457078317, 0.12209818236130689, -0.053031820585304985, 0.04808640741500814, -0.060534337250401776, -0.15342952014536274, 0.060734380414348324, 0.32364549890768773, -0.29873858136837655, -0.31385445793881556, 0.13355461608176594, -0.3458590135738558, -0.10983610429744027, 0.1731210424023091, -0.1141505939695908, -0.010085127180993405, 0.015736155783310914, 0.05348206767622305, -0.03915879429241984, -0.2888169448338069, 0.2897898640616664, 0.021303163812856893, 0.1555806154252163, 0.008813102325728657, 0.07588036364533615, 0.005759234007980142, -0.05206140168058705, 0.087664856591392, -0.16058689785874164, 0.13247786655342586, 0.29083572499862664, 0.14580366236385794, 0.2707332643319149, -0.35873583768855555, -0.16032976614149783, 0.10334027312429887, 0.12102789217035989, 0.0880963618924119, 0.0190302374658688, -0.26364719791679964, 0.1346843607761726, -0.16509575241872546, -0.14097263827820175, 0.0026096144063892414, 0.048652579551752735, 0.0027171473151871134, -0.226005859796566, 0.0003637734192366503, 0.03123901014178231, 0.04244327922209109, 0.04370353963910317, -0.15994663044931462, -0.022982163005508482, 0.09108694621281015, 0.05911620769041533, 0.0725888325835754, 0.11948332774015713, -0.10850939369399329, -0.11553533034570211, 0.35924817160976463, -0.04875285539548008, -0.1619859220155952, 0.22871871927410972, -0.16893874397216252, -0.20141322163351794, 0.11683592992853753, 0.16715348142018654, 0.13813350806773014, -0.102939997619132, 0.11372595836648394, -0.026446969250730257, 0.15050373217376062, 0.14988573802140903, 0.01948984425303488, 0.21916834338644178, 0.16225058229982245, 0.05837522969790259, 0.10768829319478791, -0.0270051162746944, -0.09054133055579601, -0.3373917294666171, -0.07306894228546595, -0.18864093336029625, 0.07752912718688651, -0.05011558846516501, -0.12681109290950152, 0.3802409728855959, 0.12285657990628815, 0.23168502961836604, 0.05524764978326857, 0.16943354134172278, 0.08647915461277043, 0.057150083333871574, 0.08212999841174567, 0.15968788468233805, 0.14167783097886688, 0.025601569021462788, -0.07405042498638588, 0.028111309696901208, 0.10552733491307922]
|
1,803.09602
|
Comparison of angular spread for 6 and 60 GHz based on 3GPP standard
|
In an urban environment, a multipath propagation is one of the basic
phenomena affecting a quality of received signals. This causes dispersions in
time and angular domains. Basic parameters describing these dispersions are the
rms delay spread and rms angle spread, respectively. The delay spread is
related to a frequency of the transmitted signal and the nature of the
propagation environment. In this paper, we show a mutual relationship between
the time and angular dispersions in the received signal. The obtained
simulation results present a comparison of the described dispersions for two
different frequencies. In this case, the multi-elliptical propagation model and
standard model developed by 3GPP are the basis for the simulation analysis of
new communication system solutions.
|
cs.IT eess.SP math.IT
|
in an urban environment a multipath propagation is one of the basic phenomena affecting a quality of received signals this causes dispersions in time and angular domains basic parameters describing these dispersions are the rms delay spread and rms angle spread respectively the delay spread is related to a frequency of the transmitted signal and the nature of the propagation environment in this paper we show a mutual relationship between the time and angular dispersions in the received signal the obtained simulation results present a comparison of the described dispersions for two different frequencies in this case the multielliptical propagation model and standard model developed by 3gpp are the basis for the simulation analysis of new communication system solutions
|
[['in', 'an', 'urban', 'environment', 'a', 'multipath', 'propagation', 'is', 'one', 'of', 'the', 'basic', 'phenomena', 'affecting', 'a', 'quality', 'of', 'received', 'signals', 'this', 'causes', 'dispersions', 'in', 'time', 'and', 'angular', 'domains', 'basic', 'parameters', 'describing', 'these', 'dispersions', 'are', 'the', 'rms', 'delay', 'spread', 'and', 'rms', 'angle', 'spread', 'respectively', 'the', 'delay', 'spread', 'is', 'related', 'to', 'a', 'frequency', 'of', 'the', 'transmitted', 'signal', 'and', 'the', 'nature', 'of', 'the', 'propagation', 'environment', 'in', 'this', 'paper', 'we', 'show', 'a', 'mutual', 'relationship', 'between', 'the', 'time', 'and', 'angular', 'dispersions', 'in', 'the', 'received', 'signal', 'the', 'obtained', 'simulation', 'results', 'present', 'a', 'comparison', 'of', 'the', 'described', 'dispersions', 'for', 'two', 'different', 'frequencies', 'in', 'this', 'case', 'the', 'multielliptical', 'propagation', 'model', 'and', 'standard', 'model', 'developed', 'by', '3gpp', 'are', 'the', 'basis', 'for', 'the', 'simulation', 'analysis', 'of', 'new', 'communication', 'system', 'solutions']]
|
[-0.21175496451067344, 0.10493001116795359, -0.07486668454435796, 0.05473240269486145, -0.027526257046640426, -0.07426082127001453, 0.03103354714428059, 0.3981557096338878, -0.2888747642400785, -0.3152698311260191, 0.08004130378771984, -0.27477677589503385, -0.14589586991311634, 0.20899655145466706, -0.02604147858160027, 0.05436825296857347, 0.0569113825400502, 0.0036014639871131816, -0.05329835355692243, -0.17541987558834696, 0.2761000035788422, 0.07373742026797796, 0.31243551509076, 0.00727457438903403, 0.09806878942901552, 0.01151283954366868, -0.05080795930935291, 0.011894244325773443, -0.12116673494633919, 0.10455208643876268, 0.21879737986788406, 0.11077903220982496, 0.25523462609814135, -0.3783394666862185, -0.27051078937789896, 0.0676870305935647, 0.15284422765608277, 0.10141663831191026, -0.0659321453017814, -0.28809139781465787, 0.027783136081810787, -0.1588618282516787, -0.13525446916740955, 0.05375647883846472, 0.022796472897595267, 0.06811789797334852, -0.22174972598835574, 0.13078627247073277, -0.0022972775248305526, 0.07742394064035132, -0.06308861508555079, -0.1072102785534699, -0.017746030057038543, 0.17316417690066588, 0.04564329345367249, -0.015761101973574547, 0.09104955793453097, -0.11837619446588964, -0.08487982121769781, 0.40411867378121713, -0.04197973663863426, -0.21151735384206652, 0.17002934639113246, -0.14141475911063767, -0.045603729717401884, 0.12923399017239778, 0.2629751139517747, 0.04175853742665406, -0.16770081060555747, 0.00044086323889471607, 0.010392432262868448, 0.20694115052346962, 0.06918808851012234, 0.06760946537320645, 0.17539033743600219, 0.18478862617669975, 0.021310487422713284, 0.08818391715847272, -0.14132995236175672, -0.0935623426605963, -0.2666842966765694, -0.1353030103669202, -0.14714246302827308, -0.002013686640874751, -0.09930150752225635, -0.10113691082382101, 0.4580940187166808, 0.18626207231654454, 0.17264085519522177, 0.08664948209899209, 0.3380340097030088, 0.13815946709680355, 0.020499663762906094, 0.06309749762196157, 0.2619157217016791, 0.1400855788625619, 0.13788274782946555, -0.22005450995481116, 0.08785276482339506, -0.02005034834698979]
|
1,803.09603
|
Evaluation of angular dispersion for various propagation environments in
emerging 5G systems
|
Angular dispersion is the effect of a multi-path propagation observed in
received signals. An assessment of this phenomenon is particularly important
from the viewpoint of emerging fifth generation (5G) communication systems. In
these systems, using the beam-forming and massive multiple-input
multiple-output antenna arrays are planned. This phenomenon also has a negative
impact on direction finding and older generation communication systems used in
an urban environment. In this paper, we present the angular dispersion
evaluation for various propagation environments based on simulation studies.
This analysis is carried out for different environment types defined in the
3GPP standard model for a selected frequency. In this case, the angular spread
is determinated based on the power angular spectrum. This parameter is the
basis for the influence evaluation of the propagation environment on the
received signal angular dispersion.
|
cs.IT eess.SP math.IT
|
angular dispersion is the effect of a multipath propagation observed in received signals an assessment of this phenomenon is particularly important from the viewpoint of emerging fifth generation 5g communication systems in these systems using the beamforming and massive multipleinput multipleoutput antenna arrays are planned this phenomenon also has a negative impact on direction finding and older generation communication systems used in an urban environment in this paper we present the angular dispersion evaluation for various propagation environments based on simulation studies this analysis is carried out for different environment types defined in the 3gpp standard model for a selected frequency in this case the angular spread is determinated based on the power angular spectrum this parameter is the basis for the influence evaluation of the propagation environment on the received signal angular dispersion
|
[['angular', 'dispersion', 'is', 'the', 'effect', 'of', 'a', 'multipath', 'propagation', 'observed', 'in', 'received', 'signals', 'an', 'assessment', 'of', 'this', 'phenomenon', 'is', 'particularly', 'important', 'from', 'the', 'viewpoint', 'of', 'emerging', 'fifth', 'generation', '5g', 'communication', 'systems', 'in', 'these', 'systems', 'using', 'the', 'beamforming', 'and', 'massive', 'multipleinput', 'multipleoutput', 'antenna', 'arrays', 'are', 'planned', 'this', 'phenomenon', 'also', 'has', 'a', 'negative', 'impact', 'on', 'direction', 'finding', 'and', 'older', 'generation', 'communication', 'systems', 'used', 'in', 'an', 'urban', 'environment', 'in', 'this', 'paper', 'we', 'present', 'the', 'angular', 'dispersion', 'evaluation', 'for', 'various', 'propagation', 'environments', 'based', 'on', 'simulation', 'studies', 'this', 'analysis', 'is', 'carried', 'out', 'for', 'different', 'environment', 'types', 'defined', 'in', 'the', '3gpp', 'standard', 'model', 'for', 'a', 'selected', 'frequency', 'in', 'this', 'case', 'the', 'angular', 'spread', 'is', 'determinated', 'based', 'on', 'the', 'power', 'angular', 'spectrum', 'this', 'parameter', 'is', 'the', 'basis', 'for', 'the', 'influence', 'evaluation', 'of', 'the', 'propagation', 'environment', 'on', 'the', 'received', 'signal', 'angular', 'dispersion']]
|
[-0.24445234441003805, 0.0758467679167837, -0.04782611855180628, 0.030379304321788585, -0.07158024311621687, -0.0789273909202763, 0.0057861902116825665, 0.38886510395208623, -0.2213285057318967, -0.27554408920956636, 0.08867570530074134, -0.2533369912251608, -0.18703127888017404, 0.22238137226016608, -0.021216459996275493, 0.04858112566776004, 0.04781173626238953, -0.012363746133285449, -0.019175841104684035, -0.18813717737793922, 0.31930651528580084, 0.13821277679717378, 0.36032723814054435, 0.01183226784871919, 0.07306111386435023, 0.03241192688122948, -0.07412544557644027, -0.026836374232462094, -0.0825423937607574, 0.10275437333273577, 0.2618475397544871, 0.14712604762180082, 0.2831904460161702, -0.36242073720126455, -0.2728193411117058, 0.10196760999136117, 0.19007654590254178, 0.08483878058492582, -0.12020691114116404, -0.29065398653837116, 0.04045039805611456, -0.2141247878038783, -0.1059972037033025, 0.054539961643072205, 0.010977884325365634, 0.028789313843668396, -0.26835485507470014, 0.062418375162315666, 0.00048120337913730253, 0.10531311318862127, -0.0303510593132241, -0.12605393764479503, 0.022409325648870652, 0.13047513778238043, 0.02750273346779312, -0.0013757262651725157, 0.10564459643045218, -0.10611099710535091, -0.08724368919979837, 0.413993990827185, -0.02271586162674088, -0.2519564705962965, 0.16777718871998698, -0.1431653013597538, -0.12202859568451323, 0.09243399482706922, 0.2999414927812655, 0.07621501533509191, -0.18941725348730556, 0.026602725104824986, 0.00048217046380376636, 0.17101817186000937, 0.0544360239100434, 0.108903935165214, 0.2317362133528231, 0.23591555641102258, 0.06800810527751472, 0.11758162071511372, -0.15197468223919008, -0.09273773178444314, -0.22116141587820723, -0.11518063549292899, -0.19155433367062083, 0.027974169045415664, -0.06530796544979944, -0.1056779314722143, 0.3941300587951025, 0.2042613802547219, 0.10324966624629364, 0.03849958938741083, 0.38270537598308785, 0.13049781720028886, 0.07579542489013454, 0.0551916935477656, 0.27427332520957537, 0.10720848965583675, 0.17945650321389758, -0.22471013393968955, 0.06087046434386953, -0.02753358381564048]
|
1,803.09604
|
A Theorem of Fermat on Congruent Number Curves
|
A positive integer $A$ is called a congruent number if $A$ is the area of a
right-angled triangle with three rational sides. Equivalently, $A$ is a
congruent number if and only if the congruent number curve $y^2=x^3-A^2x$ has a
rational point $(x,y)\in\mathbb Q^2$ with $y\neq 0$. Using a theorem of Fermat,
we give an elementary proof for the fact that congruent number curves do not
contain rational points of finite order.
|
math.NT
|
a positive integer a is called a congruent number if a is the area of a rightangled triangle with three rational sides equivalently a is a congruent number if and only if the congruent number curve y2x3a2x has a rational point xyinmathbb q2 with yneq 0 using a theorem of fermat we give an elementary proof for the fact that congruent number curves do not contain rational points of finite order
|
[['a', 'positive', 'integer', 'a', 'is', 'called', 'a', 'congruent', 'number', 'if', 'a', 'is', 'the', 'area', 'of', 'a', 'rightangled', 'triangle', 'with', 'three', 'rational', 'sides', 'equivalently', 'a', 'is', 'a', 'congruent', 'number', 'if', 'and', 'only', 'if', 'the', 'congruent', 'number', 'curve', 'y2x3a2x', 'has', 'a', 'rational', 'point', 'xyinmathbb', 'q2', 'with', 'yneq', '0', 'using', 'a', 'theorem', 'of', 'fermat', 'we', 'give', 'an', 'elementary', 'proof', 'for', 'the', 'fact', 'that', 'congruent', 'number', 'curves', 'do', 'not', 'contain', 'rational', 'points', 'of', 'finite', 'order']]
|
[-0.2059484918734857, 0.13120062515725814, -0.12882461138402246, 0.018552040293746228, -0.11240229316587959, -0.22070951854943166, 0.06295645335423095, 0.28400856416140285, -0.2752007577568293, -0.22207221915679318, 0.09379027785866388, -0.36562659027321, -0.1406295739455215, 0.19133587716579703, -0.1308666908448296, -0.010800999669092043, 0.007755651171984417, 0.14635800860290016, -0.049213841500958165, -0.3203700782198991, 0.32374187628073353, -0.1551759624587638, 0.13806050156376193, 0.0668577005404846, 0.12490466369615336, 0.04277728851219373, 0.05447993757469313, 0.06420758030477113, -0.13831508220558006, 0.09509485817647406, 0.25886119309746264, 0.08660819434693881, 0.25619414396850126, -0.3495037586295179, -0.0930074142491711, 0.2758256535844079, 0.1435879808517971, -0.011526617780327797, -0.06434700264196311, -0.11324170282376664, 0.15492304945364593, -0.1055000003427267, -0.2045290353175785, -0.029543591703155212, 0.08933449776876452, 0.037660933352474654, -0.2696425532256918, -0.02985945317362036, 0.1296015825388687, 0.16981099573895336, 0.021709615005446332, -0.15512601058664066, -0.03700579739441829, 0.07168201228903075, -0.030670891040270883, 0.08659993912193126, 0.024170638747247203, -0.07279089977964759, -0.08771373206483467, 0.3922158551269344, 0.041751700072615805, -0.27925899140536786, 0.0755639145682965, -0.16870737384472576, -0.12748795628015483, 0.224215085598241, 0.08334015559272043, 0.1268322940965715, 0.0007797327823936939, 0.1666511135300555, -0.19108782779159292, 0.2495408510577233, 0.13693538693977253, -0.09979326389064747, 0.2245812153177602, 0.05976167238716568, 0.09104916730429977, 0.11902105715292106, -0.03469627717775958, 0.007074223638379148, -0.38892732922519957, -0.2056705896676119, -0.20991060522251895, 0.13494341663837467, -0.09743199504092835, -0.22193485888253364, 0.3329578119463154, -0.021759105859590427, 0.20366143280906338, 0.13224918815706457, 0.2529669470552887, 0.0847089331996228, 0.0557607757792409, 0.07197076118817287, 0.10197185515051907, 0.10445754795468279, -0.05428718442230352, -0.10287023434149367, -0.013776327184002315, 0.17758231594426824]
|
1,803.09605
|
Path loss model modification for various gains and directions of
antennas
|
Emerging telecommunication technologies like 5G, green communications, and
massive MIMO contribute to the use of directional antennas and beamforming. For
this reason, modern propagation models should consider directional antennas
with different beam widths, gains and radiation pattern directions. Most of the
available propagation models are based on omnidirectional or isotropic
antennas. A proposition to solve this problem is an empirical path loss model
that considers the different types of antennas. This model assumes that the
transmitting and receiving antenna beams are directing each other. In this
paper, we propose modifying this model by determining attenuation for any
direction of the antenna patterns. For this aim, the multi-elliptic channel
model is used.
|
cs.IT math.IT
|
emerging telecommunication technologies like 5g green communications and massive mimo contribute to the use of directional antennas and beamforming for this reason modern propagation models should consider directional antennas with different beam widths gains and radiation pattern directions most of the available propagation models are based on omnidirectional or isotropic antennas a proposition to solve this problem is an empirical path loss model that considers the different types of antennas this model assumes that the transmitting and receiving antenna beams are directing each other in this paper we propose modifying this model by determining attenuation for any direction of the antenna patterns for this aim the multielliptic channel model is used
|
[['emerging', 'telecommunication', 'technologies', 'like', '5g', 'green', 'communications', 'and', 'massive', 'mimo', 'contribute', 'to', 'the', 'use', 'of', 'directional', 'antennas', 'and', 'beamforming', 'for', 'this', 'reason', 'modern', 'propagation', 'models', 'should', 'consider', 'directional', 'antennas', 'with', 'different', 'beam', 'widths', 'gains', 'and', 'radiation', 'pattern', 'directions', 'most', 'of', 'the', 'available', 'propagation', 'models', 'are', 'based', 'on', 'omnidirectional', 'or', 'isotropic', 'antennas', 'a', 'proposition', 'to', 'solve', 'this', 'problem', 'is', 'an', 'empirical', 'path', 'loss', 'model', 'that', 'considers', 'the', 'different', 'types', 'of', 'antennas', 'this', 'model', 'assumes', 'that', 'the', 'transmitting', 'and', 'receiving', 'antenna', 'beams', 'are', 'directing', 'each', 'other', 'in', 'this', 'paper', 'we', 'propose', 'modifying', 'this', 'model', 'by', 'determining', 'attenuation', 'for', 'any', 'direction', 'of', 'the', 'antenna', 'patterns', 'for', 'this', 'aim', 'the', 'multielliptic', 'channel', 'model', 'is', 'used']]
|
[-0.2151591826399619, 0.11061090971038952, 0.006479528224603696, 0.0185114385814152, -0.11110097801270472, -0.21671248816207728, 0.005103245285466652, 0.4596929594874382, -0.24583725546253846, -0.2634046634320508, 0.04574887332485311, -0.2829739765814421, -0.19341532337606293, 0.14292946873994714, -0.04555047146806663, 0.029924213705288076, 0.04341895235619714, -0.019721072023226455, 0.004721867424351248, -0.17128299453126436, 0.30068741756999356, 0.11773623658174819, 0.3895271059802987, 0.0062079426028173075, 0.09892676961052613, 0.05846319178711962, -0.04625463602556424, -0.07579932683570818, -0.07308901570041516, 0.1680757142635147, 0.3078970508849042, 0.18640457184731282, 0.25065809883685275, -0.44369020123373376, -0.3072040878490291, 0.1043111940634183, 0.16996009453961794, 0.10272805841470306, -0.06014167092507705, -0.22558742800558154, 0.09460375516950577, -0.1768714194440029, -0.13907915611582047, 0.09299287963023578, -0.051609860007143155, 0.06665836845270612, -0.3028808642178774, -0.01766889329830354, -0.0015701991421255199, 0.02308335922319781, -0.025502267549745737, -0.1447654290124774, 0.06971487936309793, 0.12552791304082017, 0.055180177423806695, -0.018269360454922372, 0.08112683229741048, -0.11661545460281725, -0.11870507128875364, 0.40614836364984513, 0.01474221117307686, -0.25829564792696724, 0.15605557943874207, -0.10350010126395236, -0.05450677184642039, 0.11118507666343992, 0.2855157792060213, 0.08898299997672439, -0.19335873937234282, -0.004343515678986229, -0.004831506570123814, 0.18331015986305746, 0.10816191677850756, 0.08916929834522307, 0.22694500865691225, 0.19374952221458608, 0.09483314814384688, 0.1314727227674501, -0.14436181485229596, -0.05657650870271027, -0.24260804710078943, -0.13149588412012567, -0.1805101582272486, 0.005424433286217126, -0.07582038103719242, -0.08379852262918244, 0.375327944975685, 0.20790553679689766, 0.08981749498370019, 0.085841119334906, 0.40117536383596336, 0.11319066087969325, 0.09043064632886937, 0.08088141027837992, 0.2369948170994493, 0.08641304387075996, 0.1350166867614131, -0.16095394459129733, 0.04118825340304862, -0.04504426136104898]
|
1,803.09606
|
Can we use linear response theory to assess geoengineering strategies?
|
Geoengineering can control only some climatic variables but not others,
resulting in side-effects. We investigate in an intermediate-complexity climate
model the applicability of linear response theory (LRT) to the assessment of a
geoengineering method. This application of LRT is twofold. First, our objective
(O1) is to assess only the best possible geoengineering scenario by looking for
a suitable modulation of solar forcing that can cancel out or otherwise
modulate a climate change signal resulting from a rise in CO2 alone. Here we
consider only the cancellation of the expected global mean surface air
temperature. It is a straightforward inverse problem for this solar forcing,
and, considering an infinite time period, we use LRT to provide the solution in
the frequency domain in closed form. We provide procedures suitable for
numerical implementation that apply to finite time periods too. Second, to be
able to use LRT to quantify side-effects, the response with respect to
uncontrolled observables, such as regional must be approximately linear. Our
objective (O2) here is to assess the linearity of the response. We find that
under geoengineering in the sense of (O1) the asymptotic response of the
globally averaged temperature is actually not zero. This is due to an
inaccurate determination of the linear susceptibilities. The error is due to a
significant quadratic nonlinearity of the response. This nonlinear contribution
can be easily removed, which results in much better estimates of the linear
susceptibility, and, in turn, in a fivefold reduction in the global average
surface temperature under geoengineering. This correction dramatically improves
also the agreement of the spatial patterns of the predicted and of the true
response. However, such an agreement is not perfect and is worse in the case of
the precipitation patterns, as a result of greater degree of nonlinearity.
|
physics.geo-ph cond-mat.stat-mech nlin.CD physics.ao-ph
|
geoengineering can control only some climatic variables but not others resulting in sideeffects we investigate in an intermediatecomplexity climate model the applicability of linear response theory lrt to the assessment of a geoengineering method this application of lrt is twofold first our objective o1 is to assess only the best possible geoengineering scenario by looking for a suitable modulation of solar forcing that can cancel out or otherwise modulate a climate change signal resulting from a rise in co2 alone here we consider only the cancellation of the expected global mean surface air temperature it is a straightforward inverse problem for this solar forcing and considering an infinite time period we use lrt to provide the solution in the frequency domain in closed form we provide procedures suitable for numerical implementation that apply to finite time periods too second to be able to use lrt to quantify sideeffects the response with respect to uncontrolled observables such as regional must be approximately linear our objective o2 here is to assess the linearity of the response we find that under geoengineering in the sense of o1 the asymptotic response of the globally averaged temperature is actually not zero this is due to an inaccurate determination of the linear susceptibilities the error is due to a significant quadratic nonlinearity of the response this nonlinear contribution can be easily removed which results in much better estimates of the linear susceptibility and in turn in a fivefold reduction in the global average surface temperature under geoengineering this correction dramatically improves also the agreement of the spatial patterns of the predicted and of the true response however such an agreement is not perfect and is worse in the case of the precipitation patterns as a result of greater degree of nonlinearity
|
[['geoengineering', 'can', 'control', 'only', 'some', 'climatic', 'variables', 'but', 'not', 'others', 'resulting', 'in', 'sideeffects', 'we', 'investigate', 'in', 'an', 'intermediatecomplexity', 'climate', 'model', 'the', 'applicability', 'of', 'linear', 'response', 'theory', 'lrt', 'to', 'the', 'assessment', 'of', 'a', 'geoengineering', 'method', 'this', 'application', 'of', 'lrt', 'is', 'twofold', 'first', 'our', 'objective', 'o1', 'is', 'to', 'assess', 'only', 'the', 'best', 'possible', 'geoengineering', 'scenario', 'by', 'looking', 'for', 'a', 'suitable', 'modulation', 'of', 'solar', 'forcing', 'that', 'can', 'cancel', 'out', 'or', 'otherwise', 'modulate', 'a', 'climate', 'change', 'signal', 'resulting', 'from', 'a', 'rise', 'in', 'co2', 'alone', 'here', 'we', 'consider', 'only', 'the', 'cancellation', 'of', 'the', 'expected', 'global', 'mean', 'surface', 'air', 'temperature', 'it', 'is', 'a', 'straightforward', 'inverse', 'problem', 'for', 'this', 'solar', 'forcing', 'and', 'considering', 'an', 'infinite', 'time', 'period', 'we', 'use', 'lrt', 'to', 'provide', 'the', 'solution', 'in', 'the', 'frequency', 'domain', 'in', 'closed', 'form', 'we', 'provide', 'procedures', 'suitable', 'for', 'numerical', 'implementation', 'that', 'apply', 'to', 'finite', 'time', 'periods', 'too', 'second', 'to', 'be', 'able', 'to', 'use', 'lrt', 'to', 'quantify', 'sideeffects', 'the', 'response', 'with', 'respect', 'to', 'uncontrolled', 'observables', 'such', 'as', 'regional', 'must', 'be', 'approximately', 'linear', 'our', 'objective', 'o2', 'here', 'is', 'to', 'assess', 'the', 'linearity', 'of', 'the', 'response', 'we', 'find', 'that', 'under', 'geoengineering', 'in', 'the', 'sense', 'of', 'o1', 'the', 'asymptotic', 'response', 'of', 'the', 'globally', 'averaged', 'temperature', 'is', 'actually', 'not', 'zero', 'this', 'is', 'due', 'to', 'an', 'inaccurate', 'determination', 'of', 'the', 'linear', 'susceptibilities', 'the', 'error', 'is', 'due', 'to', 'a', 'significant', 'quadratic', 'nonlinearity', 'of', 'the', 'response', 'this', 'nonlinear', 'contribution', 'can', 'be', 'easily', 'removed', 'which', 'results', 'in', 'much', 'better', 'estimates', 'of', 'the', 'linear', 'susceptibility', 'and', 'in', 'turn', 'in', 'a', 'fivefold', 'reduction', 'in', 'the', 'global', 'average', 'surface', 'temperature', 'under', 'geoengineering', 'this', 'correction', 'dramatically', 'improves', 'also', 'the', 'agreement', 'of', 'the', 'spatial', 'patterns', 'of', 'the', 'predicted', 'and', 'of', 'the', 'true', 'response', 'however', 'such', 'an', 'agreement', 'is', 'not', 'perfect', 'and', 'is', 'worse', 'in', 'the', 'case', 'of', 'the', 'precipitation', 'patterns', 'as', 'a', 'result', 'of', 'greater', 'degree', 'of', 'nonlinearity']]
|
[-0.10147310476138462, 0.09119137581141855, -0.07958941747418652, 0.0823824242696608, -0.06311011098767236, -0.09744588135725867, 0.06820489954227045, 0.3503103366500493, -0.2660721213288479, -0.2899795934725632, 0.12581339720518217, -0.24351706534113057, -0.17400097071856133, 0.18529589035848187, -0.1089801000304899, 0.037619887146964605, 0.018265001244164247, 0.039958039145735175, -0.07484845848757994, -0.265276013653315, 0.2415175368078053, 0.10831497360526, 0.26513682215837603, 0.05674300278947389, 0.06865121600932395, -0.014074851835335968, -0.008295889807000788, 0.04057702117962605, -0.09855985912231441, 0.07142181157458069, 0.26385601291243554, 0.10373852407930703, 0.2746893916926268, -0.42788266822758875, -0.20618376914506495, 0.1238793007303345, 0.09618009560488922, 0.12127616007188809, 0.0018653420987933622, -0.1941822710076063, 0.07958968100966728, -0.1550977054330761, -0.1499701881045239, -0.08022684188780643, 0.0034623561221790514, -0.003819832053445911, -0.32064525944859545, 0.09948783081441218, 0.07570712859821269, 0.0650261519555697, -0.07572185489885762, -0.07279569701591539, -0.01977724409267559, 0.12411754565526557, 0.08408614065324477, 0.030126520762441017, 0.1111207267561517, -0.11468428916108432, -0.06385993266643925, 0.3902720300322872, -0.10052264735686703, -0.21727339802536783, 0.17576698672610447, -0.15848109092705456, -0.08272031729969875, 0.1458519908899473, 0.17643493743834354, 0.09705038554177194, -0.15970773346114397, 0.0505160014504188, -0.020462896217891977, 0.22830881211172663, 0.07288176516994392, 0.00918232159392111, 0.17396454835720992, 0.14526397255012544, 0.12555191904164345, 0.12661069414254783, -0.07411641625142892, -0.06613775840506621, -0.28770392126427424, -0.13291743968305636, -0.158664303018822, 0.0422568743027869, -0.07933941342832394, -0.17499448072670376, 0.40558078230548084, 0.18662218359946195, 0.17106290443847746, 0.056761700288447854, 0.30185643504768356, 0.1560159103027387, 0.06658122753551805, 0.044263278691382225, 0.26674023088022386, 0.09365586805299429, 0.08341669855302425, -0.2557267025224588, 0.12077711470172567, -0.00423730736661513]
|
1,803.09607
|
Murder at the Asylum
|
I describe a puzzle I wrote for the 2018 MIT Mystery Hunt which introduced
new types of people in logic puzzles. I discuss the puzzle itself, the
solution, and the mathematics behind it.
|
math.HO
|
i describe a puzzle i wrote for the 2018 mit mystery hunt which introduced new types of people in logic puzzles i discuss the puzzle itself the solution and the mathematics behind it
|
[['i', 'describe', 'a', 'puzzle', 'i', 'wrote', 'for', 'the', '2018', 'mit', 'mystery', 'hunt', 'which', 'introduced', 'new', 'types', 'of', 'people', 'in', 'logic', 'puzzles', 'i', 'discuss', 'the', 'puzzle', 'itself', 'the', 'solution', 'and', 'the', 'mathematics', 'behind', 'it']]
|
[-0.015069681135090914, 0.059777875995319904, -0.11470380829026301, 0.15581599114970726, -0.1968848156093648, -0.21750012016149634, 0.03714023253908663, 0.22721080326785645, -0.314437538724054, -0.3373285907913338, 0.10646198087047334, -0.29879405516002217, -0.17888312899705136, 0.0629871752903317, -0.1596335977823897, -0.07311648017529285, 0.008974548429250717, -0.0449002625590021, 0.02505870799138916, -0.2579386438609976, 0.28679417529510276, -0.021283513894586853, 0.18603231472838105, 0.10595062287580786, 0.1421649855928439, 0.007204560972185749, -0.05979985848182079, -0.009647125999132792, -0.18085493054240942, 0.04656417154227242, 0.27362290076967893, 0.28343969058584084, 0.3118176595731215, -0.4320301544203451, -0.11364853684084886, 6.31174524173592e-05, 0.06453030293976719, 0.13122511045146507, -0.10133594198321755, -0.32537747047502885, 0.0020329987517360487, -0.14836241090388008, -0.18463912036157015, 0.010481422823486906, 0.13914860818873753, -0.08703207320561915, -0.07445986659237833, -0.017612345869455374, 0.12230360135436058, 0.02648290331390771, -0.004580074921250343, -0.17526149349004932, 0.16770422735223264, 0.09590395070104436, 0.05458209790628065, 0.00533233978080027, 0.0011794392273507335, -0.1593211953612891, -0.18266392027902784, 0.40651675968459156, 0.02717880103172678, -0.032494780381746365, 0.11824114214290272, -0.1145010729687232, -0.1969681606825554, 0.008639543571255424, 0.10638343164640846, 0.11929431259914329, -0.15614396388727156, 0.10547716398970365, -0.06915681687832782, 0.14382441890792866, 0.08553869897415015, -0.03422511449422349, 0.28839077868244867, 0.20129045702968584, -0.06412676418425911, 0.021296214030096024, -0.01686411260655432, -0.1065786808418731, -0.342676353189304, -0.24619384064818872, -0.10032482979471696, 0.023573878926761223, 0.06483365835800103, -0.14179668914188037, 0.4131627998907458, 0.2232720503639994, 0.12129749733051567, -0.07969416028495427, 0.204910437371864, 0.04259740099113322, 0.06362285109406168, 0.13774520212389302, 0.20958619835701855, 0.10094392191703347, 0.2634871904314919, -0.2149520039727742, 0.06824040549779029, 0.094566064964359]
|
1,803.09608
|
Diagrammatic Monte Carlo study of the Fr\"ohlich polaron dispersion in
2D and 3D
|
We present results for the solution of the large polaron Fr\"ohlich
Hamiltonian in 3-dimensions (3D) and 2-dimensions (2D) obtained via the
Diagrammatic Monte Carlo (DMC) method. Our implementation is based on the
approach by Mishchenko [A.S. Mishchenko et al., Phys. Rev. B 62, 6317 (2000)].
Polaron ground state energies and effective polaron masses are successfully
benchmarked with data obtained using Feynman's path integral formalism. By
comparing 3D and 2D data, we verify the analytically exact scaling relations
for energies and effective masses from 3D$\to$2D, which provides a stringent
test for the quality of DMC predictions. The accuracy of our results is further
proven by providing values for the exactly known coefficients in weak- and
strong coupling expansions. Moreover, we compute polaron dispersion curves
which are validated with analytically known lower and upper limits in the small
coupling regime and verify the first order expansion results for larger
couplings, thus disproving previous critiques on the apparent incompatibility
of DMC with analytical results and furnishing useful reference for a wide range
of coupling strengths.
|
cond-mat.mtrl-sci cond-mat.quant-gas
|
we present results for the solution of the large polaron frohlich hamiltonian in 3dimensions 3d and 2dimensions 2d obtained via the diagrammatic monte carlo dmc method our implementation is based on the approach by mishchenko as mishchenko et al phys rev b 62 6317 2000 polaron ground state energies and effective polaron masses are successfully benchmarked with data obtained using feynmans path integral formalism by comparing 3d and 2d data we verify the analytically exact scaling relations for energies and effective masses from 3dto2d which provides a stringent test for the quality of dmc predictions the accuracy of our results is further proven by providing values for the exactly known coefficients in weak and strong coupling expansions moreover we compute polaron dispersion curves which are validated with analytically known lower and upper limits in the small coupling regime and verify the first order expansion results for larger couplings thus disproving previous critiques on the apparent incompatibility of dmc with analytical results and furnishing useful reference for a wide range of coupling strengths
|
[['we', 'present', 'results', 'for', 'the', 'solution', 'of', 'the', 'large', 'polaron', 'frohlich', 'hamiltonian', 'in', '3dimensions', '3d', 'and', '2dimensions', '2d', 'obtained', 'via', 'the', 'diagrammatic', 'monte', 'carlo', 'dmc', 'method', 'our', 'implementation', 'is', 'based', 'on', 'the', 'approach', 'by', 'mishchenko', 'as', 'mishchenko', 'et', 'al', 'phys', 'rev', 'b', '62', '6317', '2000', 'polaron', 'ground', 'state', 'energies', 'and', 'effective', 'polaron', 'masses', 'are', 'successfully', 'benchmarked', 'with', 'data', 'obtained', 'using', 'feynmans', 'path', 'integral', 'formalism', 'by', 'comparing', '3d', 'and', '2d', 'data', 'we', 'verify', 'the', 'analytically', 'exact', 'scaling', 'relations', 'for', 'energies', 'and', 'effective', 'masses', 'from', '3dto2d', 'which', 'provides', 'a', 'stringent', 'test', 'for', 'the', 'quality', 'of', 'dmc', 'predictions', 'the', 'accuracy', 'of', 'our', 'results', 'is', 'further', 'proven', 'by', 'providing', 'values', 'for', 'the', 'exactly', 'known', 'coefficients', 'in', 'weak', 'and', 'strong', 'coupling', 'expansions', 'moreover', 'we', 'compute', 'polaron', 'dispersion', 'curves', 'which', 'are', 'validated', 'with', 'analytically', 'known', 'lower', 'and', 'upper', 'limits', 'in', 'the', 'small', 'coupling', 'regime', 'and', 'verify', 'the', 'first', 'order', 'expansion', 'results', 'for', 'larger', 'couplings', 'thus', 'disproving', 'previous', 'critiques', 'on', 'the', 'apparent', 'incompatibility', 'of', 'dmc', 'with', 'analytical', 'results', 'and', 'furnishing', 'useful', 'reference', 'for', 'a', 'wide', 'range', 'of', 'coupling', 'strengths']]
|
[-0.0691061410376109, 0.07983503781542822, -0.04422026854868014, 0.06294091539809393, -0.0492604416551415, -0.1307786024570855, 0.08705405125578562, 0.3577127460563599, -0.16058187711399136, -0.35875300739805194, 0.03169339025991449, -0.2534144398022638, -0.10820400279805843, 0.25930287149399084, 0.029033291348537733, 0.10167024233373394, 0.1006399420182069, -0.031673233176386636, -0.08378646699684607, -0.235494235382946, 0.24818781103808865, 0.08932263063548436, 0.28797261222525566, 0.10433257220118025, 0.07691723690503602, 0.0408146190457046, 0.010298657493644156, 0.024067187237791544, -0.22410445302714008, 0.12566279980819672, 0.22026659505168344, 0.011972358575507696, 0.19003738565262146, -0.38214851756103685, -0.1928587703416354, -0.009246681528544963, 0.12182900467011022, 0.17388499253510692, -0.049234187903240065, -0.3545290199270862, 0.05825277052814314, -0.19001228290171426, -0.1348275858692305, -0.14943749441895202, 0.04290826597283486, 0.024712844376809637, -0.3089152867797502, 0.12995358821116984, -0.012534923498521472, 0.046832270057821854, -0.08190542238298804, -0.1497205803306167, -0.011477144102046137, 0.09046313972049934, 0.009058968676516427, 0.03913796047590738, 0.05373448981676077, -0.08273593077387358, -0.11695841003783307, 0.3753457303364696, -0.10287807000256793, -0.17009395105408256, 0.21413382299942896, -0.1022114347162938, -0.09985944520016092, 0.1477730883242086, 0.08686706874259682, 0.12653856210530395, -0.16959937280389145, 0.13360232446778586, -0.030572253375498275, 0.1231686714657604, 0.031764561137141184, 0.015575450866721397, 0.12923617023545036, 0.11882797069847584, -0.035972859531770957, 0.11330784370020833, -0.08077540305621791, -0.14266799579050965, -0.2670232200843477, -0.1301791766964227, -0.22970760543323068, 0.033376356650436256, -0.11393948319993458, -0.09637806954966902, 0.34872320624133357, 0.2019359806436114, 0.189936148517137, 0.12076099959424112, 0.2705622740187357, 0.14387824033389712, 0.025061600522454937, 0.08762500788353189, 0.2895840503881837, 0.1518352650712396, 0.041711305349328834, -0.23500336836861058, 0.008906070264814379, 0.11815471591178847]
|
1,803.09609
|
Modeling power angle spectrum and antenna pattern directions in
multipath propagation environment
|
Most propagation models do not consider the influence of antenna patterns on
the parameters and characteristics of received signals. This assumption is
equivalent to the use of isotropic or omnidirectional antennas in these models.
Empirical measurement results indicate that the radiation pattern, gain and
direction of directional antennas significantly influence on properties of the
received signal. This fact shows that consideration the directional antennas in
propagation models is very important especially in the context of emerging
telecommunication technologies such as beamforming or massive MIMO. The purpose
of this paper is to present the modeling method of power angular spectrum and
direction of antenna patterns in a multipath propagation environment.
|
eess.SP cs.IT math.IT
|
most propagation models do not consider the influence of antenna patterns on the parameters and characteristics of received signals this assumption is equivalent to the use of isotropic or omnidirectional antennas in these models empirical measurement results indicate that the radiation pattern gain and direction of directional antennas significantly influence on properties of the received signal this fact shows that consideration the directional antennas in propagation models is very important especially in the context of emerging telecommunication technologies such as beamforming or massive mimo the purpose of this paper is to present the modeling method of power angular spectrum and direction of antenna patterns in a multipath propagation environment
|
[['most', 'propagation', 'models', 'do', 'not', 'consider', 'the', 'influence', 'of', 'antenna', 'patterns', 'on', 'the', 'parameters', 'and', 'characteristics', 'of', 'received', 'signals', 'this', 'assumption', 'is', 'equivalent', 'to', 'the', 'use', 'of', 'isotropic', 'or', 'omnidirectional', 'antennas', 'in', 'these', 'models', 'empirical', 'measurement', 'results', 'indicate', 'that', 'the', 'radiation', 'pattern', 'gain', 'and', 'direction', 'of', 'directional', 'antennas', 'significantly', 'influence', 'on', 'properties', 'of', 'the', 'received', 'signal', 'this', 'fact', 'shows', 'that', 'consideration', 'the', 'directional', 'antennas', 'in', 'propagation', 'models', 'is', 'very', 'important', 'especially', 'in', 'the', 'context', 'of', 'emerging', 'telecommunication', 'technologies', 'such', 'as', 'beamforming', 'or', 'massive', 'mimo', 'the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'present', 'the', 'modeling', 'method', 'of', 'power', 'angular', 'spectrum', 'and', 'direction', 'of', 'antenna', 'patterns', 'in', 'a', 'multipath', 'propagation', 'environment']]
|
[-0.2148297373718078, 0.09104143994339152, -0.04783434935187528, 0.013358774098328426, -0.10537950165458707, -0.1290227393021619, 0.0030509401358441886, 0.4370121502001351, -0.23922699152966193, -0.2811270142102255, 0.06876185466748995, -0.2725329986330733, -0.22100717841365605, 0.1709313123442079, -0.028736012137640234, 0.018786872135808503, 0.06625375840300267, 0.028442987868852847, -0.01670662750737793, -0.159400525308479, 0.29492404943314987, 0.13759225431761338, 0.39691882171249443, 0.02347399070944398, 0.08854799351971084, 0.03325039391841637, -0.06960453342116617, -0.01870910162554729, -0.04190399342949754, 0.11188817946582076, 0.28124713368412535, 0.1744349388098088, 0.2320808351825957, -0.4321566154548061, -0.30511116393662374, 0.10438723688295812, 0.16462902715344221, 0.07944799717430265, -0.08171982904084436, -0.2452657394657988, 0.08884913943186744, -0.15679427174800034, -0.11537969484951971, 0.07578603579842169, -0.03474983266221547, 0.07755514892211202, -0.27992726743665586, 0.03096050604186747, 0.06878620522831558, 0.04047006386579997, -0.02814101376314434, -0.12291916635383023, 0.04006475851435317, 0.10032595735077464, 0.09398208901504003, -0.04942134792121862, 0.10399559842542223, -0.1525258608610976, -0.08141913275242946, 0.40371490522808984, -0.029689132960068934, -0.25076629841751463, 0.1647890315096347, -0.16840652290997607, -0.090230872384657, 0.12975419881334954, 0.29760548768035316, 0.09740451302105954, -0.1441115773274401, 0.023500514180942036, -0.003437231213640456, 0.20758874354661877, 0.06536986112355365, 0.13167076485248608, 0.19761668935999138, 0.16452639122758436, 0.08353240606204154, 0.11811567938869494, -0.13867807622417944, -0.05702547292404492, -0.20769257929097057, -0.10558918746478788, -0.1953863444238252, 0.026065332501183622, -0.09034697260718831, -0.1199984875413666, 0.4158897738767053, 0.2098578358445009, 0.1219271151263506, 0.042437970962956414, 0.38551004630846714, 0.0923974851099347, 0.07347123048037564, 0.0394876917713074, 0.2826639574251796, 0.12626741600645824, 0.13424022373563926, -0.1897028020514739, 0.08613247622163334, -0.06357514944542712]
|
1,803.0961
|
Homological Solution of the Riemann-Lanczos and Weyl-Lanczos Problems in
Arbitrary Dimension
|
When ${\cal{D}}$ is a linear partial differential operator of any order, a
direct problem is to look for an operator ${\cal{D}}_1$ generating the
compatibility conditions (CC) ${\cal{D}}_1\eta=0$ of ${\cal{D}}\xi=\eta$. We
may thus construct a differential sequence with successive operators
${\cal{D}},{\cal{D}}_1,{\cal{D}}_2, ...$, where each operator is generating the
CC of the previous one. Introducing the formal adjoint $ad( )$, we have
${\cal{D}}_i\circ {\cal{D}}_{i-1}=0 \Rightarrow ad({\cal{D}}_{i-1}) \circ
ad({\cal{D}}_i)=0$ but $ad({\cal{D}}_{i-1})$ may not generate all the CC of
$ad({\cal{D}}_i)$. When $D=K[d_1,...,d_n]=K[d]$ is the (non-commutative) ring
of differential operators with coefficients in a differential field $K$, it
gives rise by residue to a differential module $M$ over $D$. The homological
extension modules $ext^i(M)=ext^i_D(M,D)$ with $ext^0(M)=hom_D(M,D)$ only
depend on $M$ and are measuring the above gaps, independently of the previous
differential sequence.The purpose of this rather technical paper is to compute
them for certain Lie operators involved in the formal theory of Lie
pseudogroups in arbitrary dimension $n$. In particular, we prove that the
extension modules highly depend on the Vessiot structure constants $c$. When
one is dealing with a Lie group of transformations or, equivalently, when
${\cal{D}}$ is a Lie operator of finite type, then we shall prove that
$ext^i(M)=0, \forall 0\leq i \leq n-1$. It will follow that the Riemann-Lanczos
and Weyl-Lanczos problems just amount to prove such a result for $i=2$ and
arbitrary $n$ when ${\cal{D}}$ is the Killing or conformal Killing operator. We
finally prove that ${ext}^i(M)=0, \forall i\geq 1$ for the Lie operator of
infinitesimal contact transformations with arbitrary $n=2p+1$. Most of these
new results have been checked by means of computer algebra.
|
math.GM
|
when cald is a linear partial differential operator of any order a direct problem is to look for an operator cald_1 generating the compatibility conditions cc cald_1eta0 of caldxieta we may thus construct a differential sequence with successive operators caldcald_1cald_2 where each operator is generating the cc of the previous one introducing the formal adjoint ad we have cald_icirc cald_i10 rightarrow adcald_i1 circ adcald_i0 but adcald_i1 may not generate all the cc of adcald_i when dkd_1d_nkd is the noncommutative ring of differential operators with coefficients in a differential field k it gives rise by residue to a differential module m over d the homological extension modules extimexti_dmd with ext0mhom_dmd only depend on m and are measuring the above gaps independently of the previous differential sequencethe purpose of this rather technical paper is to compute them for certain lie operators involved in the formal theory of lie pseudogroups in arbitrary dimension n in particular we prove that the extension modules highly depend on the vessiot structure constants c when one is dealing with a lie group of transformations or equivalently when cald is a lie operator of finite type then we shall prove that extim0 forall 0leq i leq n1 it will follow that the riemannlanczos and weyllanczos problems just amount to prove such a result for i2 and arbitrary n when cald is the killing or conformal killing operator we finally prove that extim0 forall igeq 1 for the lie operator of infinitesimal contact transformations with arbitrary n2p1 most of these new results have been checked by means of computer algebra
|
[['when', 'cald', 'is', 'a', 'linear', 'partial', 'differential', 'operator', 'of', 'any', 'order', 'a', 'direct', 'problem', 'is', 'to', 'look', 'for', 'an', 'operator', 'cald_1', 'generating', 'the', 'compatibility', 'conditions', 'cc', 'cald_1eta0', 'of', 'caldxieta', 'we', 'may', 'thus', 'construct', 'a', 'differential', 'sequence', 'with', 'successive', 'operators', 'caldcald_1cald_2', 'where', 'each', 'operator', 'is', 'generating', 'the', 'cc', 'of', 'the', 'previous', 'one', 'introducing', 'the', 'formal', 'adjoint', 'ad', 'we', 'have', 'cald_icirc', 'cald_i10', 'rightarrow', 'adcald_i1', 'circ', 'adcald_i0', 'but', 'adcald_i1', 'may', 'not', 'generate', 'all', 'the', 'cc', 'of', 'adcald_i', 'when', 'dkd_1d_nkd', 'is', 'the', 'noncommutative', 'ring', 'of', 'differential', 'operators', 'with', 'coefficients', 'in', 'a', 'differential', 'field', 'k', 'it', 'gives', 'rise', 'by', 'residue', 'to', 'a', 'differential', 'module', 'm', 'over', 'd', 'the', 'homological', 'extension', 'modules', 'extimexti_dmd', 'with', 'ext0mhom_dmd', 'only', 'depend', 'on', 'm', 'and', 'are', 'measuring', 'the', 'above', 'gaps', 'independently', 'of', 'the', 'previous', 'differential', 'sequencethe', 'purpose', 'of', 'this', 'rather', 'technical', 'paper', 'is', 'to', 'compute', 'them', 'for', 'certain', 'lie', 'operators', 'involved', 'in', 'the', 'formal', 'theory', 'of', 'lie', 'pseudogroups', 'in', 'arbitrary', 'dimension', 'n', 'in', 'particular', 'we', 'prove', 'that', 'the', 'extension', 'modules', 'highly', 'depend', 'on', 'the', 'vessiot', 'structure', 'constants', 'c', 'when', 'one', 'is', 'dealing', 'with', 'a', 'lie', 'group', 'of', 'transformations', 'or', 'equivalently', 'when', 'cald', 'is', 'a', 'lie', 'operator', 'of', 'finite', 'type', 'then', 'we', 'shall', 'prove', 'that', 'extim0', 'forall', '0leq', 'i', 'leq', 'n1', 'it', 'will', 'follow', 'that', 'the', 'riemannlanczos', 'and', 'weyllanczos', 'problems', 'just', 'amount', 'to', 'prove', 'such', 'a', 'result', 'for', 'i2', 'and', 'arbitrary', 'n', 'when', 'cald', 'is', 'the', 'killing', 'or', 'conformal', 'killing', 'operator', 'we', 'finally', 'prove', 'that', 'extim0', 'forall', 'igeq', '1', 'for', 'the', 'lie', 'operator', 'of', 'infinitesimal', 'contact', 'transformations', 'with', 'arbitrary', 'n2p1', 'most', 'of', 'these', 'new', 'results', 'have', 'been', 'checked', 'by', 'means', 'of', 'computer', 'algebra']]
|
[-0.17091269132936537, 0.10776126530811185, -0.04738095634661944, 0.04114648457108748, -0.1147898103305955, -0.1676977861005767, -0.030184591040992536, 0.35257672675628476, -0.31377001125758336, -0.22412196662633416, 0.13045631866847499, -0.27598208663486895, -0.13293884829675526, 0.17509872990625877, -0.06882933687146585, 0.0024666108656674623, 0.033008081185029736, 0.1323945626210222, -0.10566815116668864, -0.2506536780559523, 0.40754626425550367, -0.028177922989678694, 0.17510506499045117, 0.02500197056579354, 0.12746361862875735, 0.024890446725709617, -0.03053055107095298, -0.004023473767310749, -0.11814354059974846, 0.09952245514749822, 0.2848924130580767, 0.09859470473295806, 0.24256291268910798, -0.40089491511016717, -0.13260722354748153, 0.16519087434117777, 0.1439939056438827, 0.05730986102089408, -0.010051060408553102, -0.24342984864354103, 0.16560177442353266, -0.15648217956341973, -0.13117725809905756, -0.056621682841652705, 0.0759704719920865, 0.01654186879462896, -0.3078260721551128, 0.023061891736983947, 0.09901804748707961, 0.09337886697239024, -0.05097190864573888, -0.11229861630634654, -0.033473283191376324, 0.07823458976179856, -0.018116607899881072, 0.03144173761408148, 0.09164484080172493, -0.07581241710907723, -0.10475314449669348, 0.3427201923224385, -0.0597694245195342, -0.26792420478683315, 0.12067957004578209, -0.1783812393658553, -0.15617222134732936, 0.07406544328548413, 0.07752247843868626, 0.16906911982192252, -0.10836969701643437, 0.191498891214041, -0.0804883774960176, 0.1250834751216917, 0.0853334898569855, 0.003770724366277211, 0.10313473999071023, 0.08055363426851148, 0.10668364531610165, 0.08682679804425242, 0.025563104195906416, -0.04607648148446693, -0.370084772001446, -0.20473096873841168, -0.09821469800157756, 0.1188309217263382, -0.09841672801001834, -0.14623908332928462, 0.3546331244685645, 0.10372657099720273, 0.2181196255614663, 0.09175482255966237, 0.21535314974440223, 0.16353689383240147, 0.09633686693448482, 0.04974714033458949, 0.15584468258350298, 0.17790249722660997, 0.04114959302450312, -0.1618705948531137, 0.014097182664621637, 0.1381885558941666]
|
1,803.09611
|
Segal Topoi and Natural Phenomena: Universality of Physical Laws
|
J. Lurie proved in Higher Topos Theory that for $K$ a simplicial set,
$\mathcal{C}$ a simplicial category, $f: \mathfrak{C}[K] \rightarrow
\mathcal{C}^{\text{op}}$ an equivalence of simplicial categories, we have a
Quillen equivalence $(\text{Set}^+_{\Delta})_{/K} \rightleftarrows
(\text{Set}^+_{\Delta})^{\mathcal{C}}$. We prove a partial converse to this
theorem at the level of Segal categories, namely that if
$L(\text{Set}^+_{\Delta})_{/K}$ is isomorphic to
$L(\text{Set}^+_{\Delta})^{\mathcal{C}}$ in Ho(SePC), then $L
\mathfrak{C}[K]^{\text{op}}$ and $L\mathcal{C}$ are equivalent as Segal
pre-categories relative to Segal categories of pre-stacks. We interpret this as
indicating that the Segal category of pre-stacks
$L(\text{Set}^+_{\Delta})^{\mathcal{C}} \cong \mathbb{R} \underline{\text{Hom}}
(L \mathcal{C}, L \text{Set}^+_{\Delta})$ on $L \mathcal{C}$ is equivalently
given by a choice of simplicial set $K$, relative to which phenomena in
$\text{Top}^+ = L \text{Set}^+_{\Delta}$ are considered, a sort of relativity
principle. If we further take the Bousfield localizations of
$L(\text{Set}^+_{\Delta})^{\mathfrak{C}[K]^{\text{op}}} \cong L(
\text{Set}^+_{\Delta})_{/K}$ and $L(\text{Set}^+_{\Delta})^{\mathcal{C}}$ with
respect to hypercovers, then regarding
$L_{\text{Bous}}(L(\text{Set}^+_{\Delta})^{\mathcal{C}})$ as the Segal topos of
natural phenomena on $L\mathcal{C}$, we also obtain an isomorphism
$L_{\text{Bous}}(L(\text{Set}^+_{\Delta})^{\mathfrak{C}[K]^{\text{op}}}) \cong
L_{\text{Bous}} (L(\text{Set}^+_{\Delta})^{\mathcal{C}})$ of Segal topoi of
stacks. This provides two representations of the same natural phenomena,
concurrently with the equivalence $L \mathfrak{C}[K]^{\text{op}} \simeq
L\mathcal{C}$ relative to prestacks, which we interpret as a weak universality
of natural laws.
|
math.CT math.AT
|
j lurie proved in higher topos theory that for k a simplicial set mathcalc a simplicial category f mathfrakck rightarrow mathcalctextop an equivalence of simplicial categories we have a quillen equivalence textset_delta_k rightleftarrows textset_deltamathcalc we prove a partial converse to this theorem at the level of segal categories namely that if ltextset_delta_k is isomorphic to ltextset_deltamathcalc in hosepc then l mathfrakcktextop and lmathcalc are equivalent as segal precategories relative to segal categories of prestacks we interpret this as indicating that the segal category of prestacks ltextset_deltamathcalc cong mathbbr underlinetexthom l mathcalc l textset_delta on l mathcalc is equivalently given by a choice of simplicial set k relative to which phenomena in texttop l textset_delta are considered a sort of relativity principle if we further take the bousfield localizations of ltextset_deltamathfrakcktextop cong l textset_delta_k and ltextset_deltamathcalc with respect to hypercovers then regarding l_textbousltextset_deltamathcalc as the segal topos of natural phenomena on lmathcalc we also obtain an isomorphism l_textbousltextset_deltamathfrakcktextop cong l_textbous ltextset_deltamathcalc of segal topoi of stacks this provides two representations of the same natural phenomena concurrently with the equivalence l mathfrakcktextop simeq lmathcalc relative to prestacks which we interpret as a weak universality of natural laws
|
[['j', 'lurie', 'proved', 'in', 'higher', 'topos', 'theory', 'that', 'for', 'k', 'a', 'simplicial', 'set', 'mathcalc', 'a', 'simplicial', 'category', 'f', 'mathfrakck', 'rightarrow', 'mathcalctextop', 'an', 'equivalence', 'of', 'simplicial', 'categories', 'we', 'have', 'a', 'quillen', 'equivalence', 'textset_delta_k', 'rightleftarrows', 'textset_deltamathcalc', 'we', 'prove', 'a', 'partial', 'converse', 'to', 'this', 'theorem', 'at', 'the', 'level', 'of', 'segal', 'categories', 'namely', 'that', 'if', 'ltextset_delta_k', 'is', 'isomorphic', 'to', 'ltextset_deltamathcalc', 'in', 'hosepc', 'then', 'l', 'mathfrakcktextop', 'and', 'lmathcalc', 'are', 'equivalent', 'as', 'segal', 'precategories', 'relative', 'to', 'segal', 'categories', 'of', 'prestacks', 'we', 'interpret', 'this', 'as', 'indicating', 'that', 'the', 'segal', 'category', 'of', 'prestacks', 'ltextset_deltamathcalc', 'cong', 'mathbbr', 'underlinetexthom', 'l', 'mathcalc', 'l', 'textset_delta', 'on', 'l', 'mathcalc', 'is', 'equivalently', 'given', 'by', 'a', 'choice', 'of', 'simplicial', 'set', 'k', 'relative', 'to', 'which', 'phenomena', 'in', 'texttop', 'l', 'textset_delta', 'are', 'considered', 'a', 'sort', 'of', 'relativity', 'principle', 'if', 'we', 'further', 'take', 'the', 'bousfield', 'localizations', 'of', 'ltextset_deltamathfrakcktextop', 'cong', 'l', 'textset_delta_k', 'and', 'ltextset_deltamathcalc', 'with', 'respect', 'to', 'hypercovers', 'then', 'regarding', 'l_textbousltextset_deltamathcalc', 'as', 'the', 'segal', 'topos', 'of', 'natural', 'phenomena', 'on', 'lmathcalc', 'we', 'also', 'obtain', 'an', 'isomorphism', 'l_textbousltextset_deltamathfrakcktextop', 'cong', 'l_textbous', 'ltextset_deltamathcalc', 'of', 'segal', 'topoi', 'of', 'stacks', 'this', 'provides', 'two', 'representations', 'of', 'the', 'same', 'natural', 'phenomena', 'concurrently', 'with', 'the', 'equivalence', 'l', 'mathfrakcktextop', 'simeq', 'lmathcalc', 'relative', 'to', 'prestacks', 'which', 'we', 'interpret', 'as', 'a', 'weak', 'universality', 'of', 'natural', 'laws']]
|
[-0.13600622998874928, 0.08653073967320013, -0.0853714035500856, 0.12275277432989527, -0.10241214373264085, -0.14517472589943098, 0.010330669547227117, 0.3777557577953538, -0.36556791432536717, -0.2149780886421069, 0.005223767646834296, -0.20967331136644848, -0.09308892510454642, 0.12789962658386553, -0.2037553332923922, -0.09255400213957084, 0.03193744066631777, 0.09582607923049397, -0.04855292216152622, -0.241694639520615, 0.3810242581301568, -0.027906549913976134, 0.2067642449082485, 0.06249766985119289, 0.09568573729255435, -0.026377969117981664, 0.034347508394020725, 0.027015305648173935, -0.20472048091491404, 0.09388715659106003, 0.3183010226649264, 0.09867063945740084, 0.19868425992801472, -0.3155645541375859, -0.09114693882194964, 0.16985674894917127, 0.0643398695385994, -0.01480453255131129, 0.08445582170238237, -0.35304400486756493, 0.1671947984998062, -0.19120173247039235, -0.05444293543944931, -0.06902382281521241, 0.16512346809554657, -0.011599133887950834, -0.26158653189208403, -0.048241338479558915, 0.15384677789899817, 0.11850621940677965, -0.05424759507943154, -0.06579495793184935, -0.09775047775964892, 0.05527980898486011, -0.04791518701358144, 0.08718252660045427, 0.09391554269751304, -0.07989431214466523, -0.14068458707521805, 0.4099372274796949, -0.07188199191835573, -0.16567426436486538, 0.1723026997263261, -0.11595381097606478, -0.193929595564063, 0.10543534771691003, -0.018856194147609927, 0.15974346998283703, -0.008926572034847034, 0.18664935145859365, -0.1772453028135122, 0.07806528135650175, 0.1358088503573404, 0.03858014840496641, 0.11719222858239467, 0.10714743890619073, 0.06930147302389313, 0.12562431248553682, 0.03164605467234937, -0.0018747324226005527, -0.37265355036374226, -0.18223866728772775, -0.06673799452418985, 0.20214711567988683, -0.06627444335549881, -0.14810298103315944, 0.2945834328600315, 0.13338207798287943, 0.2230483008502182, 0.16577031458283284, 0.18733062441042217, 0.016904332091818627, 0.04221849176729244, -0.013151630037202594, 0.12218480109331313, 0.25507919508780696, -0.013081403668928012, -0.08376414196570979, -0.041839750447007044, 0.2519332445383574]
|
1,803.09612
|
Partial Regularity for BV Minimizers
|
We establish an $\varepsilon$-regularity result for the derivative of a map
of bounded variation that minimizes a strongly quasiconvex variational integral
of linear growth, and, as a consequence, the partial regularity of such BV
minimizers. This result extends the regularity theory for minimizers of
quasiconvex integrals on Sobolev spaces to the context of maps of bounded
variation. Previous partial regularity results for BV minimizers in the linear
growth set-up were confined to the convex situation.
|
math.AP
|
we establish an varepsilonregularity result for the derivative of a map of bounded variation that minimizes a strongly quasiconvex variational integral of linear growth and as a consequence the partial regularity of such bv minimizers this result extends the regularity theory for minimizers of quasiconvex integrals on sobolev spaces to the context of maps of bounded variation previous partial regularity results for bv minimizers in the linear growth setup were confined to the convex situation
|
[['we', 'establish', 'an', 'varepsilonregularity', 'result', 'for', 'the', 'derivative', 'of', 'a', 'map', 'of', 'bounded', 'variation', 'that', 'minimizes', 'a', 'strongly', 'quasiconvex', 'variational', 'integral', 'of', 'linear', 'growth', 'and', 'as', 'a', 'consequence', 'the', 'partial', 'regularity', 'of', 'such', 'bv', 'minimizers', 'this', 'result', 'extends', 'the', 'regularity', 'theory', 'for', 'minimizers', 'of', 'quasiconvex', 'integrals', 'on', 'sobolev', 'spaces', 'to', 'the', 'context', 'of', 'maps', 'of', 'bounded', 'variation', 'previous', 'partial', 'regularity', 'results', 'for', 'bv', 'minimizers', 'in', 'the', 'linear', 'growth', 'setup', 'were', 'confined', 'to', 'the', 'convex', 'situation']]
|
[-0.11809124675268928, 0.025829573443043045, -0.07680940978694707, 0.12372353818733245, -0.10849928475916386, -0.03094854695722461, 0.006640475744691988, 0.32049980405718087, -0.37803478201230367, -0.19863416047145924, 0.14465274825536956, -0.2719785848756631, -0.13097777819260956, 0.17609084028750657, -0.1875794322602451, 0.12992839051410557, 0.05215278760840496, 0.0062855969990293185, -0.1090872287346671, -0.27996513186177857, 0.3681290187252065, -0.11464932210743427, 0.1961838718255361, 0.09028321228921414, 0.1053293878150483, 0.04547394526501496, 0.01169764985019962, 0.04882594233999649, -0.25056495054673483, 0.19580684448281924, 0.2298474312822024, 0.05568481459592779, 0.33946706538399063, -0.38015312150120734, -0.23932777401059865, 0.10626857557644447, 0.08191305356410643, 0.01251621256271998, -0.037675725328736004, -0.26495857181648413, 0.06715722681333622, -0.07162313462545475, -0.20507669383039076, -0.07739681551853815, 0.013806695422778527, 0.08665292288021495, -0.3433005987107754, 0.15156109041223922, 0.12534190466006598, 0.08541658775880932, -0.1968385561183095, -0.05198684482524792, -0.07600337028658638, 0.038930465038865804, 0.07819662548601627, 0.11008708061029514, 0.07131708241999149, -0.09510126551690821, -0.08646482012545069, 0.31703783507148425, -0.12361260427317272, -0.2555938314894835, 0.15579482535521189, -0.16744440051416556, -0.15879126029709975, 0.10518712729960195, 0.1465719380353888, 0.19759247094392776, -0.11641278651853403, 0.18793878387271737, -0.08256994180381298, 0.1120055038233598, 0.10908137573550145, 0.07163683911785483, 0.0019132798785964648, 0.11684057970220844, 0.2684458428248763, 0.1670782328552256, 0.009418513840064407, -0.0916388341683584, -0.4152398623029391, -0.16025231023629508, -0.15832412810375293, 0.0778425613977015, -0.12103708710269226, -0.2311234981318315, 0.3679570840423306, 0.02656020374968648, 0.1600014479085803, 0.17903642427176236, 0.17614154189825057, 0.16776114158798008, 0.017866220648090046, 0.05164509623001019, 0.20489832216408105, 0.17940329750689368, 0.08656226376071573, -0.18914913716726006, 0.027935811796536047, 0.1854120918592283]
|
1,803.09613
|
Three-nucleon force in chiral EFT with explicit $\Delta(1232)$ degrees
of freedom: Longest-range contributions at fourth order
|
We analyze the longest-range two-pion exchange contributions to the
three-nucleon force at leading-loop order in the framework of heavy-baryon
chiral effective field theory with explicit $\Delta(1232)$ degrees of freedom.
All relevant low-energy constants which appear in the calculation are
determined from pion-nucleon scattering. Comparing our results with the ones
obtained in the $\Delta$-less theory at N4LO, we find effects of the $\Delta$
isobar for this particular topology to be rather well represented in terms of
resonance saturation of various low-energy constants in the $\Delta$-less
approach.
|
nucl-th
|
we analyze the longestrange twopion exchange contributions to the threenucleon force at leadingloop order in the framework of heavybaryon chiral effective field theory with explicit delta1232 degrees of freedom all relevant lowenergy constants which appear in the calculation are determined from pionnucleon scattering comparing our results with the ones obtained in the deltaless theory at n4lo we find effects of the delta isobar for this particular topology to be rather well represented in terms of resonance saturation of various lowenergy constants in the deltaless approach
|
[['we', 'analyze', 'the', 'longestrange', 'twopion', 'exchange', 'contributions', 'to', 'the', 'threenucleon', 'force', 'at', 'leadingloop', 'order', 'in', 'the', 'framework', 'of', 'heavybaryon', 'chiral', 'effective', 'field', 'theory', 'with', 'explicit', 'delta1232', 'degrees', 'of', 'freedom', 'all', 'relevant', 'lowenergy', 'constants', 'which', 'appear', 'in', 'the', 'calculation', 'are', 'determined', 'from', 'pionnucleon', 'scattering', 'comparing', 'our', 'results', 'with', 'the', 'ones', 'obtained', 'in', 'the', 'deltaless', 'theory', 'at', 'n4lo', 'we', 'find', 'effects', 'of', 'the', 'delta', 'isobar', 'for', 'this', 'particular', 'topology', 'to', 'be', 'rather', 'well', 'represented', 'in', 'terms', 'of', 'resonance', 'saturation', 'of', 'various', 'lowenergy', 'constants', 'in', 'the', 'deltaless', 'approach']]
|
[-0.11147561077848964, 0.18548244726289773, -0.08447463125256556, 0.08754640670598574, -0.015322697698138654, -0.05793143493965978, 0.009340710303236154, 0.2997114290594168, -0.220230468271655, -0.2862864419779119, -0.054669153390152915, -0.32938939526433214, -0.13203416969848886, 0.11297787897776634, 0.08642073981242165, 0.03013154144199299, -0.017467739731295125, 0.09333352193546791, -0.06035847382043444, -0.1883153249786812, 0.3252803103532642, 0.012880237035763761, 0.19866977951356343, 0.16127584686148025, 0.01758546431526719, 0.07168905786238611, -0.021581842591764315, -0.024984974768899736, -0.18319733078325434, 0.14478091646707894, 0.28211555496922563, -0.03594752498966478, 0.10912600924660053, -0.42727355156759067, -0.16953157202806324, 0.012304737490402269, 0.1442498019355948, 0.20185231169480608, 0.03542674675450793, -0.28889688405962216, 0.034266503111991496, -0.20425996110064998, -0.1922946078037577, -0.1692125614610545, -0.04705978723636474, -0.014792217545965243, -0.3171226412190923, 0.08805146021040855, -0.030179513844251188, 0.10001484235926043, -0.08063956012483686, -0.22120311928890823, 0.016431125372903244, 0.11275922823586457, 0.12787899866677999, 0.05752984841265494, 0.13685756987736872, -0.18114964992439905, -0.09885014620764802, 0.401749696471684, -0.06774568520735816, -0.17631848123918253, 0.09264847635114122, -0.16469761565150248, -0.14691186665801242, 0.15165614292934715, 0.13227760270958588, 0.10301929400226245, -0.17711642253146107, 0.13389927625290252, 0.02609601782058321, 0.13699669514954577, 0.09917192558558392, 0.0975673931950171, 0.11785747490024992, 0.11483470585032289, -0.03873813449449483, 0.06143221570805292, -0.04373071013971986, -0.14699075725262187, -0.39909706371171133, -0.0006687936506101064, -0.12493291048338592, 0.03485284806118302, -0.11775828276516959, -0.09877848504748683, 0.3635439724173574, 0.1254368080144992, 0.18930881609031486, -0.0026504539294234875, 0.28734991930070375, 0.13969458012226305, 0.1001984836932804, 0.05066866142650334, 0.3297334227356173, 0.183416410959104, 0.06565867194772831, -0.30573108168097124, -0.020874491012017687, 0.08748447250885268]
|
1,803.09614
|
Groups of generalized $G$-type and applications to torsion subgroups of
rational elliptic curves over infinite extensions of $\mathbb{Q}$
|
Recently there has been much interest in studying the torsion subgroups of
elliptic curves base-extended to infinite extensions of $\mathbb{Q}$. In this
paper, given a finite group $G$, we study what happens with the torsion of an
elliptic curve $E$ over $\mathbb{Q}$ when changing base to the compositum of
all number fields with Galois group $G$. We do this by studying a group
theoretic condition called generalized $G$-type, which is a necessary condition
for a number field with Galois group $H$ to be contained in that compositum. In
general, group theory allows one to reduce the original problem to the question
of finding rational points on finitely many modular curves. To illustrate this
method we completely determine which torsion structures occur for elliptic
curves defined over $\mathbb{Q}$ and base-changed to the compositum of all
fields whose Galois group is $A_4$.
|
math.NT
|
recently there has been much interest in studying the torsion subgroups of elliptic curves baseextended to infinite extensions of mathbbq in this paper given a finite group g we study what happens with the torsion of an elliptic curve e over mathbbq when changing base to the compositum of all number fields with galois group g we do this by studying a group theoretic condition called generalized gtype which is a necessary condition for a number field with galois group h to be contained in that compositum in general group theory allows one to reduce the original problem to the question of finding rational points on finitely many modular curves to illustrate this method we completely determine which torsion structures occur for elliptic curves defined over mathbbq and basechanged to the compositum of all fields whose galois group is a_4
|
[['recently', 'there', 'has', 'been', 'much', 'interest', 'in', 'studying', 'the', 'torsion', 'subgroups', 'of', 'elliptic', 'curves', 'baseextended', 'to', 'infinite', 'extensions', 'of', 'mathbbq', 'in', 'this', 'paper', 'given', 'a', 'finite', 'group', 'g', 'we', 'study', 'what', 'happens', 'with', 'the', 'torsion', 'of', 'an', 'elliptic', 'curve', 'e', 'over', 'mathbbq', 'when', 'changing', 'base', 'to', 'the', 'compositum', 'of', 'all', 'number', 'fields', 'with', 'galois', 'group', 'g', 'we', 'do', 'this', 'by', 'studying', 'a', 'group', 'theoretic', 'condition', 'called', 'generalized', 'gtype', 'which', 'is', 'a', 'necessary', 'condition', 'for', 'a', 'number', 'field', 'with', 'galois', 'group', 'h', 'to', 'be', 'contained', 'in', 'that', 'compositum', 'in', 'general', 'group', 'theory', 'allows', 'one', 'to', 'reduce', 'the', 'original', 'problem', 'to', 'the', 'question', 'of', 'finding', 'rational', 'points', 'on', 'finitely', 'many', 'modular', 'curves', 'to', 'illustrate', 'this', 'method', 'we', 'completely', 'determine', 'which', 'torsion', 'structures', 'occur', 'for', 'elliptic', 'curves', 'defined', 'over', 'mathbbq', 'and', 'basechanged', 'to', 'the', 'compositum', 'of', 'all', 'fields', 'whose', 'galois', 'group', 'is', 'a_4']]
|
[-0.23149344077725234, 0.1184935605051578, -0.142497389982252, 0.035181362440883844, -0.16314937571819493, -0.12855465977412203, -0.007883184880483896, 0.3358488521552172, -0.34890216105766053, -0.27809159644285514, 0.06316584841334734, -0.23978029275357307, -0.11882515868468993, 0.24800473825240077, -0.1702105679643759, 0.0001963368495521338, -0.01443011153732305, 0.16213246346856264, -0.05166088222303306, -0.35873072217825963, 0.3639778868949878, -0.059397313643442605, 0.19059787619777996, 0.01134056902989961, 0.0885909244897303, 0.047350610253752035, 0.010243910282134902, 0.006514673009919731, -0.15101297204476566, 0.10918600083095953, 0.3448144568575789, 0.040766092457646584, 0.23302074334165757, -0.3611234922123992, -0.21144200652918738, 0.2952155384734489, 0.135898200309147, 0.015622006715747757, -0.03208728542929326, -0.21978430749605532, 0.14702186805442435, -0.16321472056965897, -0.17549657286819664, -0.051452618903831404, 0.07540084058385127, -0.0007100240344289637, -0.22765260017004565, -0.047009651309581124, 0.0420027638539213, 0.209885206842876, -0.03439693498480863, -0.09767881073513189, -0.029588501278287393, 0.06001397113515481, 0.06841614221533139, 0.057460344057408685, 0.050104770714930004, -0.10454909015021732, -0.08203777139567757, 0.4116791695950256, -0.07894310750998557, -0.18205484026449098, 0.08141080440575446, -0.17450400964572918, -0.1611895667510512, 0.15363470471018684, 0.12515129736098257, 0.15330208449597485, -0.04643225626553075, 0.18816731238115134, -0.16376102617347066, 0.09683174146440528, 0.0659617752822089, -0.06289064158488106, 0.12426413031821341, 0.04611954793791233, 0.08183443807934383, 0.09125664310725541, 0.05327650879853931, -0.02060366461417921, -0.3455599853364022, -0.16092948389469067, -0.08868627791778873, 0.09438846828213529, -0.05626673727501707, -0.18773870984686242, 0.44362899250742316, 0.11126475735311059, 0.16209615573988875, 0.0671162368355157, 0.20766308841605982, 0.07838147404887107, 0.0915104005046263, 0.0813751610306402, 0.10690176392149559, 0.23891112498645467, -0.08031295236044873, -0.1777856056764047, -0.030728669590789123, 0.15290366729006064]
|
1,803.09615
|
Homa: A Receiver-Driven Low-Latency Transport Protocol Using Network
Priorities (Complete Version)
|
Homa is a new transport protocol for datacenter networks. It provides
exceptionally low latency, especially for workloads with a high volume of very
short messages, and it also supports large messages and high network
utilization. Homa uses in-network priority queues to ensure low latency for
short messages; priority allocation is managed dynamically by each receiver and
integrated with a receiver-driven flow control mechanism. Homa also uses
controlled overcommitment of receiver downlinks to ensure efficient bandwidth
utilization at high load. Our implementation of Homa delivers 99th percentile
round-trip times less than 15{\mu}s for short messages on a 10 Gbps network
running at 80% load. These latencies are almost 100x lower than the best
published measurements of an implementation. In simulations, Homa's latency is
roughly equal to pFabric and significantly better than pHost, PIAS, and NDP for
almost all message sizes and workloads. Homa can also sustain higher network
loads than pFabric, pHost, or PIAS.
|
cs.NI
|
homa is a new transport protocol for datacenter networks it provides exceptionally low latency especially for workloads with a high volume of very short messages and it also supports large messages and high network utilization homa uses innetwork priority queues to ensure low latency for short messages priority allocation is managed dynamically by each receiver and integrated with a receiverdriven flow control mechanism homa also uses controlled overcommitment of receiver downlinks to ensure efficient bandwidth utilization at high load our implementation of homa delivers 99th percentile roundtrip times less than 15mus for short messages on a 10 gbps network running at 80 load these latencies are almost 100x lower than the best published measurements of an implementation in simulations homas latency is roughly equal to pfabric and significantly better than phost pias and ndp for almost all message sizes and workloads homa can also sustain higher network loads than pfabric phost or pias
|
[['homa', 'is', 'a', 'new', 'transport', 'protocol', 'for', 'datacenter', 'networks', 'it', 'provides', 'exceptionally', 'low', 'latency', 'especially', 'for', 'workloads', 'with', 'a', 'high', 'volume', 'of', 'very', 'short', 'messages', 'and', 'it', 'also', 'supports', 'large', 'messages', 'and', 'high', 'network', 'utilization', 'homa', 'uses', 'innetwork', 'priority', 'queues', 'to', 'ensure', 'low', 'latency', 'for', 'short', 'messages', 'priority', 'allocation', 'is', 'managed', 'dynamically', 'by', 'each', 'receiver', 'and', 'integrated', 'with', 'a', 'receiverdriven', 'flow', 'control', 'mechanism', 'homa', 'also', 'uses', 'controlled', 'overcommitment', 'of', 'receiver', 'downlinks', 'to', 'ensure', 'efficient', 'bandwidth', 'utilization', 'at', 'high', 'load', 'our', 'implementation', 'of', 'homa', 'delivers', '99th', 'percentile', 'roundtrip', 'times', 'less', 'than', '15mus', 'for', 'short', 'messages', 'on', 'a', '10', 'gbps', 'network', 'running', 'at', '80', 'load', 'these', 'latencies', 'are', 'almost', '100x', 'lower', 'than', 'the', 'best', 'published', 'measurements', 'of', 'an', 'implementation', 'in', 'simulations', 'homas', 'latency', 'is', 'roughly', 'equal', 'to', 'pfabric', 'and', 'significantly', 'better', 'than', 'phost', 'pias', 'and', 'ndp', 'for', 'almost', 'all', 'message', 'sizes', 'and', 'workloads', 'homa', 'can', 'also', 'sustain', 'higher', 'network', 'loads', 'than', 'pfabric', 'phost', 'or', 'pias']]
|
[-0.22881929752261687, 0.07862862759977968, -0.012743307070049923, 0.05192701043289465, -0.06211186725491037, -0.2615635141854485, 0.15843925533195335, 0.43124912030994894, -0.1949643910303712, -0.3664226748918494, 0.12094524795732771, -0.2638035193737596, -0.03655451389805724, 0.21875444164965302, -0.12450864996450643, 0.057843526086459554, 0.07441373777575791, 0.022548613006559512, -0.002510120295919478, -0.3180548031674698, 0.14534665159415452, 0.16171915916725993, 0.344742314076672, 0.06859416909671077, 0.10455779418659707, -0.016592120320225754, -0.0074579690672302, -0.07213519091950729, -0.03733791097998619, 0.09037237729178742, 0.2913491247377048, 0.14047690697324772, 0.2684323520337542, -0.4230148507724516, -0.16442474241678914, 0.0570360627428939, 0.13439173175022007, 0.031099604362001022, 0.026683010465931148, -0.1995519665442407, 0.19081133337070544, -0.2336705174917976, -0.012558153871019991, -0.04250052411109209, 0.011646653989640375, 0.04697869559051469, -0.29641587297742567, 0.022005086966673845, -0.050696305422267565, 0.046514000094806156, -0.008777898961367707, -0.11668542111913363, -0.005629947857620815, 0.12785122776792074, -0.027271233418335518, 0.05017638142065455, 0.13882566671197613, -0.09385411135309066, -0.09436218634868662, 0.38287145690371593, -0.030913037944119422, -0.11824284247277926, 0.17279667600058018, -0.03913630814912419, -0.10390407091317078, 0.20285391081434986, 0.234684155707558, 0.05617274498916231, -0.15263322759031628, -0.0741098904753259, 0.04410120543713371, 0.22660348980066677, 0.12511114929647496, 0.11344021474321683, 0.11198733744211495, 0.24466522269571822, 0.17769763183091225, 0.11100945213732, -0.03937926712135474, -0.07855769169516862, -0.18154721521462003, -0.13346286746052405, -0.17118984279610838, 0.024159726415916037, -0.1614275582222035, -0.056122931108499564, 0.35911360574886203, 0.14248128751448044, 0.1345874865205648, 0.2242064218328839, 0.399524496893088, 0.07526938100345433, 0.1388316841920217, 0.2667776497174054, 0.10747340135897199, 0.017740007609439393, 0.18189222897402943, -0.1387447908675919, 0.12479634519685835, -0.047301006680354474]
|
1,803.09616
|
Discontinuous Galerkin Isogeometric Analysis for segmentations
generating overlapping regions
|
In the Isogeometric Analysis (IGA) framework, the computational domain has
very often a multipatch representation. The multipatch domain can be obtained
by a volume segmentation of a boundary represented domain, e.g., provided by a
Computer Aided Design (CAD) model. Typically, small gap and overlapping regions
can appear at the patch interfaces of such multipatch representations. In the
current work we consider multipatch representations having only small
overlapping regions between the patches.
We develop a Discontinuous Galerkin (DG)- IGA method which can be immediately
applied to these representations. Our method appropriately connects the fluxes
of the one face of the overlapping region with the flux of the opposite face.
We provide a theoretical justification of our approach by splitting the whole
error into two components: the first is related to the incorrect representation
of the patches (consistency error) and the second to the approximation
properties of the IGA space. We show bounds for both components of the error.
We verify the theoretical error estimates in a series of numerical examples.
|
math.NA
|
in the isogeometric analysis iga framework the computational domain has very often a multipatch representation the multipatch domain can be obtained by a volume segmentation of a boundary represented domain eg provided by a computer aided design cad model typically small gap and overlapping regions can appear at the patch interfaces of such multipatch representations in the current work we consider multipatch representations having only small overlapping regions between the patches we develop a discontinuous galerkin dg iga method which can be immediately applied to these representations our method appropriately connects the fluxes of the one face of the overlapping region with the flux of the opposite face we provide a theoretical justification of our approach by splitting the whole error into two components the first is related to the incorrect representation of the patches consistency error and the second to the approximation properties of the iga space we show bounds for both components of the error we verify the theoretical error estimates in a series of numerical examples
|
[['in', 'the', 'isogeometric', 'analysis', 'iga', 'framework', 'the', 'computational', 'domain', 'has', 'very', 'often', 'a', 'multipatch', 'representation', 'the', 'multipatch', 'domain', 'can', 'be', 'obtained', 'by', 'a', 'volume', 'segmentation', 'of', 'a', 'boundary', 'represented', 'domain', 'eg', 'provided', 'by', 'a', 'computer', 'aided', 'design', 'cad', 'model', 'typically', 'small', 'gap', 'and', 'overlapping', 'regions', 'can', 'appear', 'at', 'the', 'patch', 'interfaces', 'of', 'such', 'multipatch', 'representations', 'in', 'the', 'current', 'work', 'we', 'consider', 'multipatch', 'representations', 'having', 'only', 'small', 'overlapping', 'regions', 'between', 'the', 'patches', 'we', 'develop', 'a', 'discontinuous', 'galerkin', 'dg', 'iga', 'method', 'which', 'can', 'be', 'immediately', 'applied', 'to', 'these', 'representations', 'our', 'method', 'appropriately', 'connects', 'the', 'fluxes', 'of', 'the', 'one', 'face', 'of', 'the', 'overlapping', 'region', 'with', 'the', 'flux', 'of', 'the', 'opposite', 'face', 'we', 'provide', 'a', 'theoretical', 'justification', 'of', 'our', 'approach', 'by', 'splitting', 'the', 'whole', 'error', 'into', 'two', 'components', 'the', 'first', 'is', 'related', 'to', 'the', 'incorrect', 'representation', 'of', 'the', 'patches', 'consistency', 'error', 'and', 'the', 'second', 'to', 'the', 'approximation', 'properties', 'of', 'the', 'iga', 'space', 'we', 'show', 'bounds', 'for', 'both', 'components', 'of', 'the', 'error', 'we', 'verify', 'the', 'theoretical', 'error', 'estimates', 'in', 'a', 'series', 'of', 'numerical', 'examples']]
|
[-0.09179766310830793, -0.009585534221735182, -0.10806575845568799, 0.048158165216914336, -0.07259336914095653, -0.07629749809044617, 0.025463978368678742, 0.381557506310737, -0.28292018701680577, -0.29910660159881586, 0.14426378173183252, -0.23261877942896453, -0.12897900485339955, 0.16831580910848223, -0.09616209606425809, 0.05032814068157645, 0.09662396799133727, -0.0024313513041796307, -0.08578328586310237, -0.21575707083598286, 0.31481765749032153, -0.009571106291579954, 0.291804173189772, 0.031151360686118963, 0.09168162580700756, -0.06884902709483351, -0.054803891632342214, 0.05639702227423326, -0.0968043178832434, 0.2004329976184878, 0.28102552275222964, 0.0794795018113797, 0.31104873594298915, -0.4359567757012576, -0.23763084305262955, 0.06234700753375579, 0.15843081964101, 0.11629091593582933, -0.034446887872402264, -0.32169631212266414, 0.09763487473201866, -0.1476569035856505, -0.08033846549348102, -0.08550177479835128, -0.058507363766586114, 0.025287373060327484, -0.30756936580791366, 0.06868199690537163, 0.06514484271649602, 0.05157197393014057, -0.06566139823239098, -0.1196098538630879, 0.00405401013207418, 0.14998811281412927, 0.022206105291843414, 0.025093968852957678, 0.06915492879381106, -0.12297029390699676, -0.0720546830944254, 0.35470896140402236, -0.039522094988214546, -0.2847412925863848, 0.19433140027827236, -0.11611413141470071, -0.09153211541121176, 0.14259678326800643, 0.1880471952226476, 0.13500560627638544, -0.09555849685890258, 0.082106269494432, -0.0191717967962758, 0.16162650464391942, 0.0379277939216603, -0.05562853923387076, 0.16923771376484598, 0.18818647837123045, 0.061458932525411486, 0.1374086321193102, -0.12606053005631176, -0.0688226365721261, -0.3528911331668496, -0.1331425699151876, -0.18850811889957217, -0.07758048502108379, -0.14399599359965243, -0.21079023735881536, 0.4269705411878872, 0.13750069063796094, 0.19517332079032293, 0.05552009564546108, 0.314225808932231, 0.10110822606682998, 0.07878156736997348, 0.08839974067719465, 0.20511896206760372, 0.08628273811659737, 0.06801941770696517, -0.1929028349001713, 0.03904702228641402, 0.1405846310349611]
|
1,803.09617
|
Correlation properties of signal at mobile receiver for different
propagation environments
|
An issue of the parameter selection in various branches of a multi-antenna
receiver system determines its effectiveness. A significant effect on these
parameters are correlation properties of received signals. In this paper, the
assessment of the signal correlation properties for different environmental
conditions is presented. The obtained results showed that depending on the
receiver speed, the adaptive selection of the delays in the different RAKE
receiver branches provide minimization of the correlation between the signals.
Particularly low levels of the signal correlation could be obtained in complex
propagation environments such as urban and bad urban.
|
cs.IT eess.SP math.IT
|
an issue of the parameter selection in various branches of a multiantenna receiver system determines its effectiveness a significant effect on these parameters are correlation properties of received signals in this paper the assessment of the signal correlation properties for different environmental conditions is presented the obtained results showed that depending on the receiver speed the adaptive selection of the delays in the different rake receiver branches provide minimization of the correlation between the signals particularly low levels of the signal correlation could be obtained in complex propagation environments such as urban and bad urban
|
[['an', 'issue', 'of', 'the', 'parameter', 'selection', 'in', 'various', 'branches', 'of', 'a', 'multiantenna', 'receiver', 'system', 'determines', 'its', 'effectiveness', 'a', 'significant', 'effect', 'on', 'these', 'parameters', 'are', 'correlation', 'properties', 'of', 'received', 'signals', 'in', 'this', 'paper', 'the', 'assessment', 'of', 'the', 'signal', 'correlation', 'properties', 'for', 'different', 'environmental', 'conditions', 'is', 'presented', 'the', 'obtained', 'results', 'showed', 'that', 'depending', 'on', 'the', 'receiver', 'speed', 'the', 'adaptive', 'selection', 'of', 'the', 'delays', 'in', 'the', 'different', 'rake', 'receiver', 'branches', 'provide', 'minimization', 'of', 'the', 'correlation', 'between', 'the', 'signals', 'particularly', 'low', 'levels', 'of', 'the', 'signal', 'correlation', 'could', 'be', 'obtained', 'in', 'complex', 'propagation', 'environments', 'such', 'as', 'urban', 'and', 'bad', 'urban']]
|
[-0.20562171177252342, 0.06132618056650053, -0.09345641021469706, 0.06860859750917084, -0.03427740125671813, -0.12519476760276838, 0.03404515586719897, 0.3815934851373497, -0.24996572070215878, -0.3067471212462375, 0.11355427787394116, -0.26055914509159167, -0.19475910602333515, 0.19985872780732614, -0.061060840464932355, 0.03867555955657735, 0.045990696023708505, 0.028264214329139673, -0.06602817314284805, -0.2166439345939771, 0.3000087584221834, 0.10659124817895262, 0.35425486261956396, 0.051191892259215055, 0.12024916093306322, 0.019489319095584122, -0.048167156354573214, -0.006001850354828333, -0.06666510062771666, 0.05082066022839985, 0.3062839641799464, 0.1814984210325699, 0.2751592621207237, -0.4010133752109189, -0.2589675733819604, 0.10003357758059313, 0.11032869849893215, 0.0567161388744257, -0.07287358112486178, -0.29200697719658675, 0.04209916315188533, -0.1294072930854255, -0.042341967779946955, 0.031132986974951468, -0.02729818669981078, 0.07553773446523242, -0.2863104854367281, 0.06530500808240551, 0.006456983167874185, 0.08785796432118667, -0.05145776593003814, -0.154313694767801, -0.01327255905581344, 0.22256492555729654, 0.054461062797590304, -0.03627256529993917, 0.12849141766660307, -0.15300619541177232, -0.08720175179064665, 0.3567325438127706, -0.0479944178859066, -0.22242667341702863, 0.21964729431232338, -0.13057372518171753, -0.11935165105632653, 0.1386708712670952, 0.2512121409471882, 0.04231430695784327, -0.16891491235674996, 0.014790370469410462, 0.027217553906436813, 0.17256437493978363, 0.05266587484725996, 0.11140630189819556, 0.1513089389883374, 0.16879379035610903, 0.07903518040517443, 0.14777992497271808, -0.14719800632937174, -0.04569670089618548, -0.24487219015994158, -0.10742483809835425, -0.18656874603934978, -0.038277647977596835, -0.15766417895869572, -0.11988499660633112, 0.4354021572262833, 0.17743861865448324, 0.18316068341465372, 0.03189831607435879, 0.3240762145699639, 0.1269030681357866, 0.021560943023742812, 0.013160051856386034, 0.277304281843336, 0.09054556783092649, 0.08951094278967694, -0.26905597037096557, 0.110411466859085, -0.044338903953566364]
|
1,803.09618
|
An Introduction to Influence Theory: Kinematics and Dynamics
|
Influence theory is a foundational theory of physics that is not based on
traditional empirically defined concepts, such as positions in space and time,
mass, energy, or momentum. Instead, the aim is to derive these concepts, and
their empirically determined relationships, from a more primitive model. It is
postulated that there exist things, which we call particles, that influence one
another in a discrete and directed fashion resulting in a partially ordered set
of influence events. We consider the problem of consistent quantification of
the influence events. Observers are modeled as particle chains (observer
chains) as if an observer were able to track a particle and quantify the
influence events that the particle experiences. From these quantified influence
events, we study consistent quantification of the universe of events based on
the observer chains. In this paper, we both review and further develop the
kinematics and dynamics of particles from the perspective of influence theory.
|
physics.gen-ph
|
influence theory is a foundational theory of physics that is not based on traditional empirically defined concepts such as positions in space and time mass energy or momentum instead the aim is to derive these concepts and their empirically determined relationships from a more primitive model it is postulated that there exist things which we call particles that influence one another in a discrete and directed fashion resulting in a partially ordered set of influence events we consider the problem of consistent quantification of the influence events observers are modeled as particle chains observer chains as if an observer were able to track a particle and quantify the influence events that the particle experiences from these quantified influence events we study consistent quantification of the universe of events based on the observer chains in this paper we both review and further develop the kinematics and dynamics of particles from the perspective of influence theory
|
[['influence', 'theory', 'is', 'a', 'foundational', 'theory', 'of', 'physics', 'that', 'is', 'not', 'based', 'on', 'traditional', 'empirically', 'defined', 'concepts', 'such', 'as', 'positions', 'in', 'space', 'and', 'time', 'mass', 'energy', 'or', 'momentum', 'instead', 'the', 'aim', 'is', 'to', 'derive', 'these', 'concepts', 'and', 'their', 'empirically', 'determined', 'relationships', 'from', 'a', 'more', 'primitive', 'model', 'it', 'is', 'postulated', 'that', 'there', 'exist', 'things', 'which', 'we', 'call', 'particles', 'that', 'influence', 'one', 'another', 'in', 'a', 'discrete', 'and', 'directed', 'fashion', 'resulting', 'in', 'a', 'partially', 'ordered', 'set', 'of', 'influence', 'events', 'we', 'consider', 'the', 'problem', 'of', 'consistent', 'quantification', 'of', 'the', 'influence', 'events', 'observers', 'are', 'modeled', 'as', 'particle', 'chains', 'observer', 'chains', 'as', 'if', 'an', 'observer', 'were', 'able', 'to', 'track', 'a', 'particle', 'and', 'quantify', 'the', 'influence', 'events', 'that', 'the', 'particle', 'experiences', 'from', 'these', 'quantified', 'influence', 'events', 'we', 'study', 'consistent', 'quantification', 'of', 'the', 'universe', 'of', 'events', 'based', 'on', 'the', 'observer', 'chains', 'in', 'this', 'paper', 'we', 'both', 'review', 'and', 'further', 'develop', 'the', 'kinematics', 'and', 'dynamics', 'of', 'particles', 'from', 'the', 'perspective', 'of', 'influence', 'theory']]
|
[-0.08547041489963432, 0.1635841604469793, -0.12106943492438983, 0.1088392927417949, -0.06480767377107949, -0.0834262682693442, 0.045826311135519444, 0.37010958424297635, -0.2739842226834629, -0.3105815957215699, 0.07836180823921625, -0.3075140594843436, -0.15927546929308006, 0.152887059385471, -0.0398663440704128, -0.0019777216903212203, 0.05135952425718477, 0.07007455275478688, -0.034482899397103625, -0.17745485851184356, 0.33256136542246617, 0.0827923581524232, 0.254931457425383, 0.01885546598123846, 0.14202225844182267, 0.03279012794963193, -0.05640689188965246, 0.08821816319375232, -0.14223109237647874, 0.09393471886491549, 0.20472891536214716, 0.16936618030409922, 0.26478674029099886, -0.4541891578875192, -0.21335706932397633, 0.12342864145561085, 0.13509513037097823, 0.08674814910310405, -0.05521487305592821, -0.28133186117395176, 0.03406909861837744, -0.17553671837675494, -0.1104754176982618, -0.012200889156453988, 0.03337487699343013, 0.02530616063884665, -0.20932669867156678, 0.07109573257288762, 0.069823801323965, 0.0659075186817677, -0.06908613725492803, -0.044128690912787406, -0.0055337937037738694, 0.14071152000476353, 0.08407812251470523, -0.0013671241044490175, 0.1797384755208169, -0.09803877169018393, -0.15264635735989682, 0.40153308200662013, -0.03557118334294926, -0.22274435654810976, 0.20106845248381716, -0.13193515910957518, -0.13142295437562582, 0.09062705441021252, 0.20758187782938603, 0.13199801110154527, -0.17671999278442038, 0.03981253042493572, -0.04488985707330239, 0.16433584710050905, 0.0257980622707975, 0.05286170503535828, 0.23836988965109862, 0.15374152362497837, 0.03392807831503935, 0.10935921445730831, -0.07123643377804886, -0.13445664705805382, -0.2918943750260809, -0.14524712105124415, -0.152043311723641, 0.010331634515325702, -0.03940967047627102, -0.16363210406444675, 0.3718701062222048, 0.20813317915769414, 0.21068431277360236, 0.03571060379474218, 0.24517302007063643, 0.0867985025678146, 0.017384683333833206, 0.05293831963987126, 0.24825020040711993, 0.1117725862906762, 0.07225245854200481, -0.17570460414288674, 0.11273438764385299, 0.04575369061974736]
|
1,803.09619
|
Reversibility of Extreme Relational Structures
|
A relational structure $\mathbb{X}$ is called reversible iff each bijective
homomorphism from $\mathbb{X}$ onto $\mathbb{X}$ is an isomorphism, and linear
orders are prototypical examples of such structures. One way to detect new
reversible structures of a given relational language $L$ is to notice that the
maximal or minimal elements of isomorphism-invariant sets of interpretations of
the language $L$ on a fixed domain $X$ determine reversible structures. We
isolate certain syntactical conditions providing that a consistent $L_{\infty
\omega }$-theory defines a class of interpretations having extreme elements on
a fixed domain and detect several classes of reversible structures. In
particular, we characterize the reversible countable ultrahomogeneous graphs.
|
math.LO
|
a relational structure mathbbx is called reversible iff each bijective homomorphism from mathbbx onto mathbbx is an isomorphism and linear orders are prototypical examples of such structures one way to detect new reversible structures of a given relational language l is to notice that the maximal or minimal elements of isomorphisminvariant sets of interpretations of the language l on a fixed domain x determine reversible structures we isolate certain syntactical conditions providing that a consistent l_infty omega theory defines a class of interpretations having extreme elements on a fixed domain and detect several classes of reversible structures in particular we characterize the reversible countable ultrahomogeneous graphs
|
[['a', 'relational', 'structure', 'mathbbx', 'is', 'called', 'reversible', 'iff', 'each', 'bijective', 'homomorphism', 'from', 'mathbbx', 'onto', 'mathbbx', 'is', 'an', 'isomorphism', 'and', 'linear', 'orders', 'are', 'prototypical', 'examples', 'of', 'such', 'structures', 'one', 'way', 'to', 'detect', 'new', 'reversible', 'structures', 'of', 'a', 'given', 'relational', 'language', 'l', 'is', 'to', 'notice', 'that', 'the', 'maximal', 'or', 'minimal', 'elements', 'of', 'isomorphisminvariant', 'sets', 'of', 'interpretations', 'of', 'the', 'language', 'l', 'on', 'a', 'fixed', 'domain', 'x', 'determine', 'reversible', 'structures', 'we', 'isolate', 'certain', 'syntactical', 'conditions', 'providing', 'that', 'a', 'consistent', 'l_infty', 'omega', 'theory', 'defines', 'a', 'class', 'of', 'interpretations', 'having', 'extreme', 'elements', 'on', 'a', 'fixed', 'domain', 'and', 'detect', 'several', 'classes', 'of', 'reversible', 'structures', 'in', 'particular', 'we', 'characterize', 'the', 'reversible', 'countable', 'ultrahomogeneous', 'graphs']]
|
[-0.18082417085610838, 0.09366186928426307, -0.04010160227815779, 0.08030560445633524, -0.1321612922628498, -0.14217681479025282, 0.05539058176427201, 0.4195172724024094, -0.39024985677404506, -0.17662513804982222, 0.07623592705382386, -0.2574416248936136, -0.12301571785586553, 0.17337998060481008, -0.10730740824661586, -0.0007296614919982429, 0.037921559408236785, 0.09339080414875357, -0.10354675981216133, -0.17909413828066428, 0.3589051695088065, -0.0751256364604177, 0.2285114175130455, -0.03222551536834184, 0.15816376462824783, -0.06730423340099459, -0.016807590257640014, 0.04930329019036847, -0.17822506534496327, 0.1349569578338766, 0.31126740830511135, 0.1626304224625511, 0.21760008709267978, -0.350124470986215, -0.1692814411527372, 0.18902702666467652, 0.04557468922685762, 0.024001435818203357, -0.014123310580990225, -0.26423587948786764, 0.14534044590611714, -0.12185198253126077, -0.0711023425375867, -0.09054750744978247, 0.11362747964009924, -0.004228268257992447, -0.2610383682301101, -0.07419733804615461, 0.1778198746033013, 0.1166093851261737, -0.02510301844339888, -0.056791808453436836, -0.044109773967098795, 0.07388130769370792, -0.095427747831223, 0.0453972913333619, 0.12496234994943974, -0.04856432386111679, -0.18588986940119626, 0.3962896659614448, -0.02520436146032979, -0.20803586202497892, 0.21714119871480847, -0.12201674698351198, -0.20407473088356332, 0.10827036516934212, 0.10379277415494523, 0.13608217358870325, -0.10096081787388649, 0.21323023075874858, -0.10852854062785518, 0.19946833762322674, 0.12394132197588542, 0.04438985165050429, 0.17932948395434134, 0.15485997093876577, 0.0922071186535693, 0.1733232767865905, 0.036121475158856726, -0.06137026319245122, -0.3650676864023619, -0.16008372535876367, -0.13159692173665566, 0.0875872120937719, -0.09398039922811188, -0.24961565612411163, 0.3573051454534508, 0.06747796432620885, 0.22227553908168426, 0.08116733827540334, 0.19443798257600306, 0.04087899113952551, 0.09268275552587409, 0.0442605991540301, 0.0450219728891685, 0.19466070836752583, -0.02643454512405508, -0.1213239987475802, 0.07702703741906246, 0.12105761475000039]
|
1,803.0962
|
Backbone decomposition of multitype superprocesses
|
In this paper, we provide a construction of the so-called backbone
decomposition for multitype supercritical superprocesses. While backbone
decompositions are fairly well-known for both continuous-state branching
processes and superprocesses in the one-type case, so far no such
decompositions or even description of prolific genealogies have been given for
the multitype cases. Here we focus on superprocesses, but by turning the
movement off, we get the prolific backbone decomposition for multitype
continuous-state branching processes as an easy consequence of our results.
|
math.PR
|
in this paper we provide a construction of the socalled backbone decomposition for multitype supercritical superprocesses while backbone decompositions are fairly wellknown for both continuousstate branching processes and superprocesses in the onetype case so far no such decompositions or even description of prolific genealogies have been given for the multitype cases here we focus on superprocesses but by turning the movement off we get the prolific backbone decomposition for multitype continuousstate branching processes as an easy consequence of our results
|
[['in', 'this', 'paper', 'we', 'provide', 'a', 'construction', 'of', 'the', 'socalled', 'backbone', 'decomposition', 'for', 'multitype', 'supercritical', 'superprocesses', 'while', 'backbone', 'decompositions', 'are', 'fairly', 'wellknown', 'for', 'both', 'continuousstate', 'branching', 'processes', 'and', 'superprocesses', 'in', 'the', 'onetype', 'case', 'so', 'far', 'no', 'such', 'decompositions', 'or', 'even', 'description', 'of', 'prolific', 'genealogies', 'have', 'been', 'given', 'for', 'the', 'multitype', 'cases', 'here', 'we', 'focus', 'on', 'superprocesses', 'but', 'by', 'turning', 'the', 'movement', 'off', 'we', 'get', 'the', 'prolific', 'backbone', 'decomposition', 'for', 'multitype', 'continuousstate', 'branching', 'processes', 'as', 'an', 'easy', 'consequence', 'of', 'our', 'results']]
|
[-0.06529515897127566, 0.12475096631551423, -0.07595096699660644, 0.09062522879539756, -0.06819417567458004, -0.11999654969549738, 0.10423229881125735, 0.3779429841437377, -0.25860603522742165, -0.16496584325795993, 0.16763110532483552, -0.23508764734724535, -0.14717443649715278, 0.1840677250715089, -0.05020888025755994, 0.03917845954420045, 0.09185759968240745, 0.005949266229072237, 0.10584678980521858, -0.18516549919731914, 0.3031895014399197, 0.0002536910615162924, 0.2727301692299079, 0.0553570433810819, 0.0762727900291793, 0.0415341678657569, -0.07298552799038589, 0.0073041253215478715, -0.16218792991712688, 0.08441383340395987, 0.23745751150418073, 0.11378189918759744, 0.23093770269479136, -0.41298625455237925, -0.16469263094277267, 0.18164266887470149, 0.23300643158727324, 0.13787226960703264, -0.043662541326193606, -0.29662525457970335, 0.03638708008220419, -0.1508434998424491, -0.13611106661264785, -0.0806945280986838, 0.10415566735900939, 0.06203688753812457, -0.2344395366788376, 0.04263581262202933, 0.147930608689785, 0.03105595936649479, -0.0017340704303933307, -0.1868067095754668, -0.037065711824106985, 0.1435179275023984, 0.014578037429600954, -0.055591136479051784, 0.15910667203133927, -0.13006607450952287, -0.18206615998060444, 0.36723703767638655, -0.041687990006175825, -0.23107667890726588, 0.25183704603405205, -0.13171090562827886, -0.3063788269821089, 0.11624526209197938, 0.2029602634254843, 0.16294893212616443, -0.16996289897942915, 0.06646054298544186, -0.06567222474841401, 0.009570478857494891, 0.10106779871857725, -0.02637443225394236, 0.10659678133088164, 0.23979251267155632, 0.08535559893207392, 0.1778661549644312, -0.010598124537500553, -0.18673855711240323, -0.2565706575915101, -0.15551292228956298, -0.07644194290041924, 0.11921458637807518, -0.11737396199587238, -0.23142034218180924, 0.30441376499366013, 0.0824573785852408, 0.25378827260574327, 0.17419530366314576, 0.2267422049306333, 0.12923382974695413, 0.012287681712768972, 0.02099238323280588, 0.17239773496985436, 0.19114511519728694, 0.12156718935293612, -0.0862070935079828, 0.16592468343442307, 0.11070420718751847]
|
1,803.09621
|
Learning the Multiple Traveling Salesmen Problem with Permutation
Invariant Pooling Networks
|
While there are optimal TSP solvers, as well as recent learning-based
approaches, the generalization of the TSP to the Multiple Traveling Salesmen
Problem is much less studied. Here, we design a neural network solution that
treats the salesmen, cities and depot as three different sets of varying
cardinalities. We apply a novel technique that combines elements from recent
architectures that were developed for sets, as well as elements from graph
networks. Coupled with new constraint enforcing output layers, a dedicated
loss, and a search method, our solution is shown to outperform all the
meta-heuristics of the leading solver in the field.
|
cs.LG stat.ML
|
while there are optimal tsp solvers as well as recent learningbased approaches the generalization of the tsp to the multiple traveling salesmen problem is much less studied here we design a neural network solution that treats the salesmen cities and depot as three different sets of varying cardinalities we apply a novel technique that combines elements from recent architectures that were developed for sets as well as elements from graph networks coupled with new constraint enforcing output layers a dedicated loss and a search method our solution is shown to outperform all the metaheuristics of the leading solver in the field
|
[['while', 'there', 'are', 'optimal', 'tsp', 'solvers', 'as', 'well', 'as', 'recent', 'learningbased', 'approaches', 'the', 'generalization', 'of', 'the', 'tsp', 'to', 'the', 'multiple', 'traveling', 'salesmen', 'problem', 'is', 'much', 'less', 'studied', 'here', 'we', 'design', 'a', 'neural', 'network', 'solution', 'that', 'treats', 'the', 'salesmen', 'cities', 'and', 'depot', 'as', 'three', 'different', 'sets', 'of', 'varying', 'cardinalities', 'we', 'apply', 'a', 'novel', 'technique', 'that', 'combines', 'elements', 'from', 'recent', 'architectures', 'that', 'were', 'developed', 'for', 'sets', 'as', 'well', 'as', 'elements', 'from', 'graph', 'networks', 'coupled', 'with', 'new', 'constraint', 'enforcing', 'output', 'layers', 'a', 'dedicated', 'loss', 'and', 'a', 'search', 'method', 'our', 'solution', 'is', 'shown', 'to', 'outperform', 'all', 'the', 'metaheuristics', 'of', 'the', 'leading', 'solver', 'in', 'the', 'field']]
|
[-0.08032225821015083, 0.017062777210727777, -0.054229536914441843, 0.05218566443522157, -0.08391721961134584, -0.1762010909543179, 0.026959391135611747, 0.39590250187101633, -0.30344496973522816, -0.3299852466846973, 0.10262921629911566, -0.3082803214743438, -0.211453563466871, 0.20705114100082306, -0.06736908557520498, 0.12227835485453506, 0.1005149472338876, 0.0010629322490479686, -0.05307476610028286, -0.22917663046570338, 0.3034293217086556, 0.014338132621038079, 0.30202490816556726, 0.023041113196770744, 0.1320261090237758, -0.026061242280325088, 0.018910167037998096, 0.08221157949929596, -0.06734085470859577, 0.12383913032429311, 0.256871801012629, 0.213083309748459, 0.3091325468134762, -0.4374118074774742, -0.236636213128372, 0.08021237799381413, 0.14692233275566804, 0.13081246191903137, -0.04407385547673053, -0.250575056198136, 0.09298817398911803, -0.1461481322386846, -0.03989100956477889, -0.07123953493146024, -0.01753068765473211, 0.06670956260531606, -0.28755532723325905, -0.013023437844534027, 0.02127180293681893, -0.018552782753278447, -0.06532609795155649, -0.2027179755104503, 0.03162389704819289, 0.12528653115513597, 0.04605634220055129, 0.0651910847772171, 0.055219876256052146, -0.09985304883010408, -0.18854465395313605, 0.38774494481005584, -0.05349214546529964, -0.20435630664861032, 0.21093104724394213, -0.0023181700830043543, -0.1274773863623712, 0.09465494675395808, 0.22463273570877454, 0.19593233123622225, -0.15215213800144226, 0.04118233937931496, -0.07849488022857078, 0.14323105025888966, 0.09364223232409816, 0.017007707963965023, 0.14738451040322237, 0.26739642510909845, 0.13787894297649364, 0.15976842181148507, -0.05609676586942387, -0.09950928072246842, -0.21396747576868125, -0.09785071319651485, -0.19163617641217823, -0.03785400610016013, -0.07860920780844351, -0.1797522922599167, 0.4025799994642782, 0.16809148514484248, 0.1771676059591003, 0.1096222583333602, 0.32155791951324975, 0.060507613709104235, 0.12427033264521915, 0.13645700570011493, 0.19058692299917634, 0.0881206236936303, 0.12133527439926742, -0.16544773895869788, 0.0554836303442901, 0.09774862026500672]
|
1,803.09622
|
BER measurements in the evaluation of operation correctness of VSAT
modem traffic interfaces
|
This paper presents using bit error rate (BER) measurements to evaluate
operation correctness of traffic (input-output) interfaces in modem of very
small aperture terminal (VSAT). Such functional tests are carried out, for
example, when purchasing communication equipment for armed forces. Generally,
available standards do not describe measurement procedures in this area. In
this case, accredited laboratories should develop dedicated assessment
methodologies. In this paper, we show the methodology for the VSAT modems,
which is based on the BER measurements.
|
cs.IT math.IT
|
this paper presents using bit error rate ber measurements to evaluate operation correctness of traffic inputoutput interfaces in modem of very small aperture terminal vsat such functional tests are carried out for example when purchasing communication equipment for armed forces generally available standards do not describe measurement procedures in this area in this case accredited laboratories should develop dedicated assessment methodologies in this paper we show the methodology for the vsat modems which is based on the ber measurements
|
[['this', 'paper', 'presents', 'using', 'bit', 'error', 'rate', 'ber', 'measurements', 'to', 'evaluate', 'operation', 'correctness', 'of', 'traffic', 'inputoutput', 'interfaces', 'in', 'modem', 'of', 'very', 'small', 'aperture', 'terminal', 'vsat', 'such', 'functional', 'tests', 'are', 'carried', 'out', 'for', 'example', 'when', 'purchasing', 'communication', 'equipment', 'for', 'armed', 'forces', 'generally', 'available', 'standards', 'do', 'not', 'describe', 'measurement', 'procedures', 'in', 'this', 'area', 'in', 'this', 'case', 'accredited', 'laboratories', 'should', 'develop', 'dedicated', 'assessment', 'methodologies', 'in', 'this', 'paper', 'we', 'show', 'the', 'methodology', 'for', 'the', 'vsat', 'modems', 'which', 'is', 'based', 'on', 'the', 'ber', 'measurements']]
|
[-0.1872484844790984, -0.005971062680871426, -0.06056174067662486, 0.03978815348376815, -0.032039675555085835, -0.20539132802735402, 0.12138355600859828, 0.4118553320346754, -0.17948384245834018, -0.310942956211069, 0.13148774596850707, -0.24747611117796808, -0.13436917112727614, 0.2632075064488439, -0.18233264267703966, 0.10077026483744289, 0.10593632679385474, 0.0035739189980528024, -0.04842220422446351, -0.2600090703632258, 0.25024320628446867, 0.1186325776661876, 0.345256342918058, 0.028508725057391427, 0.05583804231019148, 0.0030279308970121645, -0.0751613388722173, -0.021556862600477813, -0.15358724929038672, 0.08740069539156518, 0.38467660577838086, 0.16422526467049234, 0.28087207407372283, -0.45118980063714936, -0.16475654589130154, 0.054838235414869894, 0.1291569268678704, 0.0662174555517238, -0.06910912616655844, -0.2194101881748655, 0.08771769749000669, -0.23021318013720873, -0.052765808987749525, -0.06144964783393507, -0.03992756158614508, 0.055342890416519554, -0.27277830529580765, 0.01876962095899861, -0.04084797250696375, 0.15809079413036992, -0.01067039023353895, -0.09176427623422086, 0.08779023184523552, 0.16079951041043572, 0.027726380522893387, -0.026705702395425943, 0.1705575789902595, -0.06794023568529409, -0.08104900846882618, 0.36912824230009245, -0.01181097930264836, -0.21782314108796655, 0.1533543568611428, -0.12207015930333093, -0.16593174822039053, 0.0739977139319423, 0.24669501909255226, 0.06795583136933797, -0.24454810900434623, 0.018562767159523843, 0.0479241230678332, 0.21021830061851424, 0.056016188901790144, 0.030440899702614245, 0.14684647856327362, 0.204316701654557, 0.05025062282404662, 0.11716430727392435, -0.12137673104688808, -0.052786642815210394, -0.31361075113468534, -0.16095814793783275, -0.16231280363377043, 0.02622913966810808, 0.004987787862037179, -0.11038703889927909, 0.30786573097015485, 0.20101217792923504, 0.06274280779629568, 0.10476387631814173, 0.4142886058698538, 0.06623019730448251, 0.07711447933335093, 0.07815634571841057, 0.24280025713334355, 0.0295059303122188, 0.14151867572807625, -0.1717115352107094, 0.11197286108626595, 0.007407871676208098]
|
1,803.09623
|
A polynomial associated with rooted trees and specific posets
|
We investigate a trivariate polynomial associated with rooted trees. It
generalises a bivariate polynomial for rooted trees that was recently
introduced by Liu. We show that this polynomial satisfies a
deletion-contraction recursion and can be expressed as a sum over maximal
antichains. Several combinatorial quantities can be obtained as special values,
in particular the number of antichains, maximal antichains and cutsets. We
prove that two of the three possible bivariate specialisations characterise
trees uniquely up to isomorphism. One of these has already been established by
Liu, the other is new. For the third specialisation, we construct
non-isomorphic trees with the same associated polynomial.
We finally find that our polynomial can be generalised in a natural way to a
family of posets that we call $\mathcal{V}$-posets. These posets are obtained
recursively by either disjoint unions or adding a greatest/least element to
existing $\mathcal{V}$-posets.
|
math.CO
|
we investigate a trivariate polynomial associated with rooted trees it generalises a bivariate polynomial for rooted trees that was recently introduced by liu we show that this polynomial satisfies a deletioncontraction recursion and can be expressed as a sum over maximal antichains several combinatorial quantities can be obtained as special values in particular the number of antichains maximal antichains and cutsets we prove that two of the three possible bivariate specialisations characterise trees uniquely up to isomorphism one of these has already been established by liu the other is new for the third specialisation we construct nonisomorphic trees with the same associated polynomial we finally find that our polynomial can be generalised in a natural way to a family of posets that we call mathcalvposets these posets are obtained recursively by either disjoint unions or adding a greatestleast element to existing mathcalvposets
|
[['we', 'investigate', 'a', 'trivariate', 'polynomial', 'associated', 'with', 'rooted', 'trees', 'it', 'generalises', 'a', 'bivariate', 'polynomial', 'for', 'rooted', 'trees', 'that', 'was', 'recently', 'introduced', 'by', 'liu', 'we', 'show', 'that', 'this', 'polynomial', 'satisfies', 'a', 'deletioncontraction', 'recursion', 'and', 'can', 'be', 'expressed', 'as', 'a', 'sum', 'over', 'maximal', 'antichains', 'several', 'combinatorial', 'quantities', 'can', 'be', 'obtained', 'as', 'special', 'values', 'in', 'particular', 'the', 'number', 'of', 'antichains', 'maximal', 'antichains', 'and', 'cutsets', 'we', 'prove', 'that', 'two', 'of', 'the', 'three', 'possible', 'bivariate', 'specialisations', 'characterise', 'trees', 'uniquely', 'up', 'to', 'isomorphism', 'one', 'of', 'these', 'has', 'already', 'been', 'established', 'by', 'liu', 'the', 'other', 'is', 'new', 'for', 'the', 'third', 'specialisation', 'we', 'construct', 'nonisomorphic', 'trees', 'with', 'the', 'same', 'associated', 'polynomial', 'we', 'finally', 'find', 'that', 'our', 'polynomial', 'can', 'be', 'generalised', 'in', 'a', 'natural', 'way', 'to', 'a', 'family', 'of', 'posets', 'that', 'we', 'call', 'mathcalvposets', 'these', 'posets', 'are', 'obtained', 'recursively', 'by', 'either', 'disjoint', 'unions', 'or', 'adding', 'a', 'greatestleast', 'element', 'to', 'existing', 'mathcalvposets']]
|
[-0.137370557819071, 0.12215648723511602, -0.05243336215695674, 0.08982850664811169, -0.1328391389479097, -0.10807632691421204, 0.022423625541783922, 0.35054516971024197, -0.3710386106650606, -0.24507695617047037, 0.11876702858905623, -0.2431608557503456, -0.15869596226998478, 0.21421560986644234, -0.10242615060096862, 0.036943329708494094, 0.050662003645150784, 0.06184167186930615, -0.05561484143814439, -0.32328545236156037, 0.34185118480123206, -0.03127271608322216, 0.18075179663761484, 0.017988980653957067, 0.13163062717711968, -0.010017648089690495, -0.03769563628936843, 0.10792730047146408, -0.17691080932462086, 0.09744830895466529, 0.30042325278489496, 0.16189885468333381, 0.19989358671277546, -0.35873938243996967, -0.15775452928765, 0.23863831225099216, 0.17781043923359444, 0.06808766168575707, 0.010703831915274638, -0.21363521013542902, 0.11709240037050071, -0.2133260418346031, -0.12102652890205705, -0.10238299507433347, 0.03990875473982996, 0.07810905422653547, -0.2979754597658841, -0.021385612244309068, 0.09936908240892368, 0.057752698388801996, 0.041587331166437314, -0.1515106713523244, -0.047416822741933755, 0.05888670313560652, -0.03366758379534141, 0.029170209863524643, -0.0032321915579892747, -0.03474266028447117, -0.21553021342419892, 0.31951471215253024, -0.03943130592589447, -0.22264751857615633, 0.15789223668844315, -0.1341561071128499, -0.23370693912461615, 0.07907866166901219, 0.074796992272018, 0.1250171054208236, -0.14112137948169554, 0.11514111186407855, -0.18616389607166428, 0.0760849497327916, 0.19407021515272396, -0.019130998448529047, 0.15630586403790567, 0.08297031390629984, 0.08535423667820023, 0.22890262967503208, 0.029179494830498323, -0.05202570060735381, -0.2762236284936289, -0.14324312310719448, -0.1628539593422973, 0.03514854643802098, -0.1597646921385237, -0.19306747723880002, 0.38510460650427736, 0.10723098717536107, 0.20639044356619496, 0.16489842753830575, 0.19610033347271383, 0.12184180003982842, 0.1054717553168093, 0.06456036651473519, 0.13089307245677806, 0.16158676754328147, -0.05225850616685591, -0.11482580930912506, 0.09779932413571815, 0.2025885893159258]
|
1,803.09624
|
Fuzzy soft seperation axioms with sense of Ganguly and Saha
|
Tanay and Kandemir <cite>TK</cite> introduced the topological structure of
fuzzy soft sets. In 2013, Manatha and Das <cite>md</cite> defined seperation
axioms on fuzzy soft topological spaces. In this paper, we generalized form of
the seperation axioms.using fuzzy soft quasi-coincidence with sense of Ganguly
and Saha <cite>GS</cite>. By using this notions, we also give some basic
theorems of seperation axioms in classical topological spaces.
|
math.GM
|
tanay and kandemir citetkcite introduced the topological structure of fuzzy soft sets in 2013 manatha and das citemdcite defined seperation axioms on fuzzy soft topological spaces in this paper we generalized form of the seperation axiomsusing fuzzy soft quasicoincidence with sense of ganguly and saha citegscite by using this notions we also give some basic theorems of seperation axioms in classical topological spaces
|
[['tanay', 'and', 'kandemir', 'citetkcite', 'introduced', 'the', 'topological', 'structure', 'of', 'fuzzy', 'soft', 'sets', 'in', '2013', 'manatha', 'and', 'das', 'citemdcite', 'defined', 'seperation', 'axioms', 'on', 'fuzzy', 'soft', 'topological', 'spaces', 'in', 'this', 'paper', 'we', 'generalized', 'form', 'of', 'the', 'seperation', 'axiomsusing', 'fuzzy', 'soft', 'quasicoincidence', 'with', 'sense', 'of', 'ganguly', 'and', 'saha', 'citegscite', 'by', 'using', 'this', 'notions', 'we', 'also', 'give', 'some', 'basic', 'theorems', 'of', 'seperation', 'axioms', 'in', 'classical', 'topological', 'spaces']]
|
[-0.08658024964721076, 0.14739914103743754, -0.11183752189390361, 0.14679403667521132, -0.07693557397994612, -0.07150070718489587, 0.0784426416524054, 0.28790230051215204, -0.270947960005807, -0.2452983141452673, 0.06399586462066509, -0.2520505927802463, -0.2280949490211372, 0.12358360318467021, -0.21476519773049013, 0.09905079549311527, -0.08474181366701876, -0.002184511661263449, -0.08180054448478456, -0.27007082342918565, 0.4238854432478547, -0.056098705866523754, 0.24311585345172457, 0.05776595239461001, 0.10667286455697779, 0.10139149347586292, -0.06948249686476109, 0.1104103124401133, -0.23253897412048122, 0.18345566616127534, 0.23722940997270467, 0.13110881721201753, 0.20376545375438582, -0.38735958330133663, -0.13201152426024368, 0.06083702374183174, 0.02969187217864341, -0.07151976088737554, 0.039169551910682845, -0.33539924597633736, 0.12084678543864616, -0.20271588282360295, -0.08767347139239844, -0.16049123816524766, 0.029013125957655057, 0.0208351557874786, -0.18299099910759, 0.026701694931814148, 0.17237939585798553, 0.0797070369922689, -0.10445810383784451, -0.05582186283676752, 0.01299916346657223, -0.022630418126937002, -0.03956592864623027, 0.010877377453393169, 0.0447089693874919, -0.07275155563339857, -0.23152200205991644, 0.29425008604968234, 0.026629826270176897, -0.22720992312367475, 0.1766885789776487, -0.05798420122092856, -0.22818185919563153, 0.030664742483557866, 0.06029820601855006, 0.08982502689052906, -0.10238027842154095, 0.1977077817812512, -0.07148256547017288, 0.12118889823822039, 0.1682592828625015, 0.1245769465209118, 0.1274844887333789, 0.11352441177171256, -0.0014881075601026947, 0.20952030871662178, 0.019895364143719365, -0.12062456376276844, -0.32777650747448206, -0.14949588973208197, -0.1145904280877273, 0.022400142392143607, -0.08478848584517047, -0.25096838009942857, 0.33148736318772926, 0.09717182712276033, 0.1595912828841912, 0.0470982452721468, 0.2533448429354134, 0.10085741952726883, -0.0017491976032033563, 0.050413859475936205, 0.21542391606167907, 0.21803223312183814, 0.11676291483620714, -0.06053974133517061, -0.041288255381264856, 0.24148573794601752]
|
1,803.09625
|
Rotating planets in Newtonian gravity
|
Variational techniques have been used in applications of hydrodynamics in
special cases but an action that is general enough to deal with both potential
flows and solid-body flows, such as cylindrical Couette flow and rotating
planets, has been proposed only recently. This paper is one of a series that
aims to test and develop the new Action Principle. We study a model of rotating
planets, a compressible fluid in a stationary state of motion, under the
influence of a fixed or mutual gravitational field. The main problem is to
account for the shape and the velocity fields, given the size of the equatorial
bulges, the angular velocity at equator and the density profiles. The theory is
applied to the principal objects in the solar system, from Earth and Mars to
Saturn with fine details of its hexagonal flow and to Haumea with its odd
shape. With only 2 parameters the model gives a fair fit to the shapes and the
angular velocity field near the surface. Planetary rings are an unforeseen, but
a natural and inevitable feature of the dynamics; no cataclysmic event need be
invoked to justify them. The simple solutions that have been studied so far are
most suitable for the hard planets, and for them the predicted density profiles
are reasonable. The effect of precession was not taken into account, nor were
entropic forces, so far. There has not yet been a systematic search for truly
realistic solutions. The intention is to test the versatility of the action
principle; the indications are are very encouraging.
|
physics.gen-ph
|
variational techniques have been used in applications of hydrodynamics in special cases but an action that is general enough to deal with both potential flows and solidbody flows such as cylindrical couette flow and rotating planets has been proposed only recently this paper is one of a series that aims to test and develop the new action principle we study a model of rotating planets a compressible fluid in a stationary state of motion under the influence of a fixed or mutual gravitational field the main problem is to account for the shape and the velocity fields given the size of the equatorial bulges the angular velocity at equator and the density profiles the theory is applied to the principal objects in the solar system from earth and mars to saturn with fine details of its hexagonal flow and to haumea with its odd shape with only 2 parameters the model gives a fair fit to the shapes and the angular velocity field near the surface planetary rings are an unforeseen but a natural and inevitable feature of the dynamics no cataclysmic event need be invoked to justify them the simple solutions that have been studied so far are most suitable for the hard planets and for them the predicted density profiles are reasonable the effect of precession was not taken into account nor were entropic forces so far there has not yet been a systematic search for truly realistic solutions the intention is to test the versatility of the action principle the indications are are very encouraging
|
[['variational', 'techniques', 'have', 'been', 'used', 'in', 'applications', 'of', 'hydrodynamics', 'in', 'special', 'cases', 'but', 'an', 'action', 'that', 'is', 'general', 'enough', 'to', 'deal', 'with', 'both', 'potential', 'flows', 'and', 'solidbody', 'flows', 'such', 'as', 'cylindrical', 'couette', 'flow', 'and', 'rotating', 'planets', 'has', 'been', 'proposed', 'only', 'recently', 'this', 'paper', 'is', 'one', 'of', 'a', 'series', 'that', 'aims', 'to', 'test', 'and', 'develop', 'the', 'new', 'action', 'principle', 'we', 'study', 'a', 'model', 'of', 'rotating', 'planets', 'a', 'compressible', 'fluid', 'in', 'a', 'stationary', 'state', 'of', 'motion', 'under', 'the', 'influence', 'of', 'a', 'fixed', 'or', 'mutual', 'gravitational', 'field', 'the', 'main', 'problem', 'is', 'to', 'account', 'for', 'the', 'shape', 'and', 'the', 'velocity', 'fields', 'given', 'the', 'size', 'of', 'the', 'equatorial', 'bulges', 'the', 'angular', 'velocity', 'at', 'equator', 'and', 'the', 'density', 'profiles', 'the', 'theory', 'is', 'applied', 'to', 'the', 'principal', 'objects', 'in', 'the', 'solar', 'system', 'from', 'earth', 'and', 'mars', 'to', 'saturn', 'with', 'fine', 'details', 'of', 'its', 'hexagonal', 'flow', 'and', 'to', 'haumea', 'with', 'its', 'odd', 'shape', 'with', 'only', '2', 'parameters', 'the', 'model', 'gives', 'a', 'fair', 'fit', 'to', 'the', 'shapes', 'and', 'the', 'angular', 'velocity', 'field', 'near', 'the', 'surface', 'planetary', 'rings', 'are', 'an', 'unforeseen', 'but', 'a', 'natural', 'and', 'inevitable', 'feature', 'of', 'the', 'dynamics', 'no', 'cataclysmic', 'event', 'need', 'be', 'invoked', 'to', 'justify', 'them', 'the', 'simple', 'solutions', 'that', 'have', 'been', 'studied', 'so', 'far', 'are', 'most', 'suitable', 'for', 'the', 'hard', 'planets', 'and', 'for', 'them', 'the', 'predicted', 'density', 'profiles', 'are', 'reasonable', 'the', 'effect', 'of', 'precession', 'was', 'not', 'taken', 'into', 'account', 'nor', 'were', 'entropic', 'forces', 'so', 'far', 'there', 'has', 'not', 'yet', 'been', 'a', 'systematic', 'search', 'for', 'truly', 'realistic', 'solutions', 'the', 'intention', 'is', 'to', 'test', 'the', 'versatility', 'of', 'the', 'action', 'principle', 'the', 'indications', 'are', 'are', 'very', 'encouraging']]
|
[-0.10836628146375739, 0.10538796810606989, -0.12258440967425416, 0.07907224800654275, -0.11140759404506823, -0.1096846059679014, -0.02073513033850364, 0.37602299058362265, -0.22605595297077238, -0.31262271398996083, 0.10260383464493464, -0.2569207539682659, -0.11378248723660589, 0.18893343957872924, -0.07295456566385809, 0.08242341124835287, 0.06090434633245937, 0.03950971995693336, -0.033816438876706094, -0.22239703700928262, 0.2865486183260611, 0.07386951563363649, 0.21639602766336166, 0.028806063036800746, 0.09625192700507113, -0.05970499142887099, 0.006680665489434186, 0.06118291395661743, -0.13636574630176918, 0.0714721790611448, 0.20724902147979496, 0.09606789716053754, 0.2483751349161964, -0.4462792226438259, -0.24099033624021782, 0.08920190124249071, 0.11911908264430746, 0.13173900720022183, -0.06750120917405543, -0.25632631085369045, 0.08134874997321198, -0.1729055738235398, -0.159345679777465, -0.07028631297257808, 0.079079193353893, 0.02891930547627291, -0.2533827219139234, 0.05886665482774319, 0.09134491894537648, 0.08613089920750769, -0.10594700543614205, -0.08827783451180962, -0.041613069838075355, 0.14037930688643901, 0.09823110068484044, 0.02743484762356465, 0.12623809895824728, -0.12676124102634545, -0.05044151239219851, 0.44047012535292046, -0.037536818847284006, -0.20605983501913877, 0.2288653875602763, -0.17086757021024823, -0.10146780170016569, 0.1505901860709432, 0.17118061864171033, 0.13162925147068824, -0.15690882795724057, 0.06112221412337204, -0.04883368486311113, 0.15596018331991726, 0.0581869989409754, -0.013626391321913404, 0.28619865331322303, 0.1235462894641556, 0.06151958546816018, 0.10369544013835627, -0.15314058864930494, -0.09955605578630469, -0.2503479548202929, -0.13044782171690072, -0.15316512251936998, 0.007006125224238918, -0.056461916864076235, -0.1506610124161225, 0.378260012698006, 0.12724213291125647, 0.18637740231920466, 0.008581642216692368, 0.3023440887476498, 0.10481262032498512, 0.09245523605170812, 0.09996334562198143, 0.3083105082041584, 0.13823055365581297, 0.10435236732352728, -0.20500518522422054, 0.07002423879286174, 0.029051140333388664]
|
1,803.09626
|
Searching for a kinematic signature of the moderately metal-poor stars
in the Milky Way bulge using N-body simulations
|
Although there is consensus that metal-rich stars in the Milky Way bulge are
formed via secular evolution of the thin disc, the origin of their metal-poor
counterparts is still under debate. Two different origins have been invoked for
metal-poor stars: they might be classical bulge stars or stars formed via
internal evolution of a massive thick disc. We use N-body simulations to
calculate the kinematic signature given by the difference in the mean
Galactocentric radial velocity ($\Delta\rm V_{\rm GC}$) between metal-rich
stars ([Fe/H] $\ge$ 0) and moderately metal-poor stars (-1.0 $\le$ [Fe/H] $<$
0) in two models, one containing a thin disc and a small classical bulge
(B/D=0.1), and the other containing a thin disc and a massive centrally
concentrated thick disc. We reasonably assume that thin-disk stars in each
model may be considered as a proxy of metal-rich stars. Similarly, bulge stars
and thick-disc stars may be considered as a proxy of metal-poor stars. We
calculate $\Delta\rm V_{\rm GC}$ at different latitudes ($b=0^\circ$,
$-2^\circ$, $-4^\circ$,$-6^\circ$, $-8^\circ$ and $-10^\circ$) and longitudes
($l=0^\circ$, $\pm5^\circ$, $\pm10^\circ$ and $\pm15^\circ$) and show that the
$\Delta\rm V_{\rm GC}$ trends predicted by the two models are different. We
compare the predicted results with ARGOS data and APOGEE DR13 data and show
that moderately metal-poor stars are well reproduced with the co-spatial
stellar discs model, which has a massive thick disc. Our results give more
evidence against the scenario that most of the metal-poor stars are classical
bulge stars. If classical bulge stars exists, most of them probably have
metallicities [Fe/H] $<$ -1 dex, and their contribution to the mass of the
bulge should be a small percentage of the total bulge mass.
|
astro-ph.GA
|
although there is consensus that metalrich stars in the milky way bulge are formed via secular evolution of the thin disc the origin of their metalpoor counterparts is still under debate two different origins have been invoked for metalpoor stars they might be classical bulge stars or stars formed via internal evolution of a massive thick disc we use nbody simulations to calculate the kinematic signature given by the difference in the mean galactocentric radial velocity deltarm v_rm gc between metalrich stars feh ge 0 and moderately metalpoor stars 10 le feh 0 in two models one containing a thin disc and a small classical bulge bd01 and the other containing a thin disc and a massive centrally concentrated thick disc we reasonably assume that thindisk stars in each model may be considered as a proxy of metalrich stars similarly bulge stars and thickdisc stars may be considered as a proxy of metalpoor stars we calculate deltarm v_rm gc at different latitudes b0circ 2circ 4circ6circ 8circ and 10circ and longitudes l0circ pm5circ pm10circ and pm15circ and show that the deltarm v_rm gc trends predicted by the two models are different we compare the predicted results with argos data and apogee dr13 data and show that moderately metalpoor stars are well reproduced with the cospatial stellar discs model which has a massive thick disc our results give more evidence against the scenario that most of the metalpoor stars are classical bulge stars if classical bulge stars exists most of them probably have metallicities feh 1 dex and their contribution to the mass of the bulge should be a small percentage of the total bulge mass
|
[['although', 'there', 'is', 'consensus', 'that', 'metalrich', 'stars', 'in', 'the', 'milky', 'way', 'bulge', 'are', 'formed', 'via', 'secular', 'evolution', 'of', 'the', 'thin', 'disc', 'the', 'origin', 'of', 'their', 'metalpoor', 'counterparts', 'is', 'still', 'under', 'debate', 'two', 'different', 'origins', 'have', 'been', 'invoked', 'for', 'metalpoor', 'stars', 'they', 'might', 'be', 'classical', 'bulge', 'stars', 'or', 'stars', 'formed', 'via', 'internal', 'evolution', 'of', 'a', 'massive', 'thick', 'disc', 'we', 'use', 'nbody', 'simulations', 'to', 'calculate', 'the', 'kinematic', 'signature', 'given', 'by', 'the', 'difference', 'in', 'the', 'mean', 'galactocentric', 'radial', 'velocity', 'deltarm', 'v_rm', 'gc', 'between', 'metalrich', 'stars', 'feh', 'ge', '0', 'and', 'moderately', 'metalpoor', 'stars', '10', 'le', 'feh', '0', 'in', 'two', 'models', 'one', 'containing', 'a', 'thin', 'disc', 'and', 'a', 'small', 'classical', 'bulge', 'bd01', 'and', 'the', 'other', 'containing', 'a', 'thin', 'disc', 'and', 'a', 'massive', 'centrally', 'concentrated', 'thick', 'disc', 'we', 'reasonably', 'assume', 'that', 'thindisk', 'stars', 'in', 'each', 'model', 'may', 'be', 'considered', 'as', 'a', 'proxy', 'of', 'metalrich', 'stars', 'similarly', 'bulge', 'stars', 'and', 'thickdisc', 'stars', 'may', 'be', 'considered', 'as', 'a', 'proxy', 'of', 'metalpoor', 'stars', 'we', 'calculate', 'deltarm', 'v_rm', 'gc', 'at', 'different', 'latitudes', 'b0circ', '2circ', '4circ6circ', '8circ', 'and', '10circ', 'and', 'longitudes', 'l0circ', 'pm5circ', 'pm10circ', 'and', 'pm15circ', 'and', 'show', 'that', 'the', 'deltarm', 'v_rm', 'gc', 'trends', 'predicted', 'by', 'the', 'two', 'models', 'are', 'different', 'we', 'compare', 'the', 'predicted', 'results', 'with', 'argos', 'data', 'and', 'apogee', 'dr13', 'data', 'and', 'show', 'that', 'moderately', 'metalpoor', 'stars', 'are', 'well', 'reproduced', 'with', 'the', 'cospatial', 'stellar', 'discs', 'model', 'which', 'has', 'a', 'massive', 'thick', 'disc', 'our', 'results', 'give', 'more', 'evidence', 'against', 'the', 'scenario', 'that', 'most', 'of', 'the', 'metalpoor', 'stars', 'are', 'classical', 'bulge', 'stars', 'if', 'classical', 'bulge', 'stars', 'exists', 'most', 'of', 'them', 'probably', 'have', 'metallicities', 'feh', '1', 'dex', 'and', 'their', 'contribution', 'to', 'the', 'mass', 'of', 'the', 'bulge', 'should', 'be', 'a', 'small', 'percentage', 'of', 'the', 'total', 'bulge', 'mass']]
|
[-0.06244853293184686, 0.14577175490558147, -0.07861125816907252, 0.13615012875194507, -0.11678402094218564, -0.06418613094121872, 0.03647147186231074, 0.4208682327500349, -0.14806971814727404, -0.34552121249704565, -0.024856437605073695, -0.3064623306199523, 0.0137134979580395, 0.20746284658136532, -0.07297400969365866, -0.06588455272676952, 0.08495338805444277, -0.08768689480517403, -0.018828942793991926, -0.2946008455637169, 0.2879536574916069, -0.03715260610125299, 0.06334655063580791, -0.12545605619138148, 0.001378507158337539, -0.19201135968598726, -0.030261215179938673, -0.01163344303710039, -0.1784351434268075, -0.009492524912214848, 0.25240211999955064, 0.14017990803624403, 0.21984418336563225, -0.3534475851707793, -0.17077567160809998, 0.037256290441949426, 0.27439909862832085, 0.03660621938537944, -0.14504666579828204, -0.2099449864650537, 0.1299594988439892, -0.19475380076968363, -0.2266175531716914, 0.08412508322424307, 0.06832369298217096, 0.01721391635792282, -0.22276681950002242, 0.16774170104598082, 0.07578652606618924, 0.14615467551587033, -0.11312404934233536, -0.18586697341870806, -0.13354316480265332, 0.051464985005774046, 0.04137436319159763, 0.08596461281915817, 0.1935015062065245, -0.089759880483556, 0.023487725222957532, 0.4370353802474992, -0.1103106048267431, -0.020481904401255743, 0.2312499295140022, -0.23575030739085812, -0.1538609846373562, 0.02113172494397392, 0.1411904203048237, 0.17864686770302782, -0.1779721582865143, 0.034183873381719986, -0.04921192602371295, 0.1936453949123951, 0.08522426135704003, 0.02193008448303131, 0.37090187989230305, 0.07172758745118062, 0.02487992997709971, 0.004601748852872004, -0.2389857024015606, -0.09580225279860584, -0.17279739756604512, -0.10042149023620267, -0.0405440107769783, 0.06287048387983848, -0.19797696564728876, -0.13236029118443823, 0.2871281541299721, 0.06478565539164868, 0.2408702969241791, 0.04087213662864745, 0.32786068278476527, 0.07332046568927242, 0.14920403900714352, 0.19069013056238748, 0.3212162415356104, 0.2403380593432739, 0.057522881756494997, -0.2224449510789198, 0.12179025125731044, -0.0464162621990781]
|
1,803.09627
|
GreyCat: Efficient What-If Analytics for Data in Motion at Scale
|
Over the last few years, data analytics shifted from a descriptive era,
confined to the explanation of past events, to the emergence of predictive
techniques. Nonetheless, existing predictive techniques still fail to
effectively explore alternative futures, which continuously diverge from
current situations when exploring the effects of what-if decisions. Enabling
prescriptive analytics therefore calls for the design of scalable systems that
can cope with the complexity and the diversity of underlying data models. In
this article, we address this challenge by combining graphs and time series
within a scalable storage system that can organize a massive amount of
unstructured and continuously changing data into multi-dimensional data models,
called Many-Worlds Graphs. We demonstrate that our open source implementation,
GreyCat, can efficiently fork and update thousands of parallel worlds composed
of millions of timestamped nodes, such as what-if exploration.
|
cs.DB
|
over the last few years data analytics shifted from a descriptive era confined to the explanation of past events to the emergence of predictive techniques nonetheless existing predictive techniques still fail to effectively explore alternative futures which continuously diverge from current situations when exploring the effects of whatif decisions enabling prescriptive analytics therefore calls for the design of scalable systems that can cope with the complexity and the diversity of underlying data models in this article we address this challenge by combining graphs and time series within a scalable storage system that can organize a massive amount of unstructured and continuously changing data into multidimensional data models called manyworlds graphs we demonstrate that our open source implementation greycat can efficiently fork and update thousands of parallel worlds composed of millions of timestamped nodes such as whatif exploration
|
[['over', 'the', 'last', 'few', 'years', 'data', 'analytics', 'shifted', 'from', 'a', 'descriptive', 'era', 'confined', 'to', 'the', 'explanation', 'of', 'past', 'events', 'to', 'the', 'emergence', 'of', 'predictive', 'techniques', 'nonetheless', 'existing', 'predictive', 'techniques', 'still', 'fail', 'to', 'effectively', 'explore', 'alternative', 'futures', 'which', 'continuously', 'diverge', 'from', 'current', 'situations', 'when', 'exploring', 'the', 'effects', 'of', 'whatif', 'decisions', 'enabling', 'prescriptive', 'analytics', 'therefore', 'calls', 'for', 'the', 'design', 'of', 'scalable', 'systems', 'that', 'can', 'cope', 'with', 'the', 'complexity', 'and', 'the', 'diversity', 'of', 'underlying', 'data', 'models', 'in', 'this', 'article', 'we', 'address', 'this', 'challenge', 'by', 'combining', 'graphs', 'and', 'time', 'series', 'within', 'a', 'scalable', 'storage', 'system', 'that', 'can', 'organize', 'a', 'massive', 'amount', 'of', 'unstructured', 'and', 'continuously', 'changing', 'data', 'into', 'multidimensional', 'data', 'models', 'called', 'manyworlds', 'graphs', 'we', 'demonstrate', 'that', 'our', 'open', 'source', 'implementation', 'greycat', 'can', 'efficiently', 'fork', 'and', 'update', 'thousands', 'of', 'parallel', 'worlds', 'composed', 'of', 'millions', 'of', 'timestamped', 'nodes', 'such', 'as', 'whatif', 'exploration']]
|
[-0.10091790275542092, 0.08545274668208816, -0.07094073865343542, 0.07270167030305054, -0.13405034505515634, -0.14435204520807876, 0.09970837838345152, 0.36940680900314715, -0.32040358907269206, -0.3629594204180381, 0.1377834891217764, -0.282560374978108, -0.12632957497279515, 0.21305441247600623, -0.0885943679998437, 0.07173434798331822, 0.1270269168102566, -0.007357423068777493, -0.03309773454684011, -0.27057294821133837, 0.2790021505463622, 0.07004140612929512, 0.3015888428507263, 0.0037301613894455575, 0.08657395454151008, -0.01214929121060242, -0.07068127235192258, 0.037623555012567735, -0.06831775520672903, 0.19402492650217884, 0.33750100923011545, 0.23470857916125917, 0.3305646687855615, -0.4893954159308444, -0.23576739098986282, 0.11213006911224083, 0.18318003459888346, 0.08975302159139092, -0.040097705310258525, -0.2832922706147656, 0.048118972245206615, -0.19556136842926636, -0.0878342783629812, -0.15466150042330434, 0.018561627491555342, 0.0038875244071652345, -0.24327089509461075, 0.010052335941616227, 0.01426906225970015, 0.033018327342099786, 0.0006178422156474827, -0.06201377397519536, 0.03628958863726653, 0.14322220327213633, 0.027859431719715597, -0.0004862921332995243, 0.12710179947316647, -0.11978579945357257, -0.17700195903478957, 0.36710972039316614, -0.008358311277868994, -0.12793155290487715, 0.193838574735256, -0.06766249197329778, -0.16123343979501548, 0.11386506812756553, 0.25631499997175794, 0.06866570601500023, -0.19002086445503022, 0.056230553989093206, 0.011390989632619655, 0.19009294724759562, 0.03577381696189096, 0.029733414837905644, 0.2628061181098661, 0.2587430719200604, 0.03964842780260369, 0.09953800578574266, -0.02979663580738227, -0.1298928982954856, -0.22536369342603446, -0.11609497323276147, -0.1524448639007888, 0.013347021740628406, -0.08906560089149827, -0.16243489859077861, 0.3839410474688253, 0.24830939185887793, 0.1926192452528459, 0.051764769711607025, 0.3510327853454167, -0.005176172809168587, 0.11495181648848195, 0.12269626427886952, 0.13115627480831737, 0.0064056334393920705, 0.1690113817997318, -0.1481743751124561, 0.09464879126822137, -0.04010144934085581]
|
1,803.09628
|
Can accelerated expansion of the universe be due to spacetime vorticity?
|
We present here a general relativistic mechanism for accelerated cosmic
expansion and the Hubble's constant. It is shown that spacetime vorticity
coupled to the magnetic field density in galaxies causes the galaxies to recede
from one another at a rate equal to the Hubble's constant. We therefore predict
an oscillatory universe, with zero curvature, without assuming violation of
Newtonian gravity at large distances or invoking dark energy/dark matter
hypotheses. The value of the Hubble's constant, along with the scale of
expansion, as well as the high isotropy of CMB radiation are deduced from the
model.
|
astro-ph.CO astro-ph.HE gr-qc
|
we present here a general relativistic mechanism for accelerated cosmic expansion and the hubbles constant it is shown that spacetime vorticity coupled to the magnetic field density in galaxies causes the galaxies to recede from one another at a rate equal to the hubbles constant we therefore predict an oscillatory universe with zero curvature without assuming violation of newtonian gravity at large distances or invoking dark energydark matter hypotheses the value of the hubbles constant along with the scale of expansion as well as the high isotropy of cmb radiation are deduced from the model
|
[['we', 'present', 'here', 'a', 'general', 'relativistic', 'mechanism', 'for', 'accelerated', 'cosmic', 'expansion', 'and', 'the', 'hubbles', 'constant', 'it', 'is', 'shown', 'that', 'spacetime', 'vorticity', 'coupled', 'to', 'the', 'magnetic', 'field', 'density', 'in', 'galaxies', 'causes', 'the', 'galaxies', 'to', 'recede', 'from', 'one', 'another', 'at', 'a', 'rate', 'equal', 'to', 'the', 'hubbles', 'constant', 'we', 'therefore', 'predict', 'an', 'oscillatory', 'universe', 'with', 'zero', 'curvature', 'without', 'assuming', 'violation', 'of', 'newtonian', 'gravity', 'at', 'large', 'distances', 'or', 'invoking', 'dark', 'energydark', 'matter', 'hypotheses', 'the', 'value', 'of', 'the', 'hubbles', 'constant', 'along', 'with', 'the', 'scale', 'of', 'expansion', 'as', 'well', 'as', 'the', 'high', 'isotropy', 'of', 'cmb', 'radiation', 'are', 'deduced', 'from', 'the', 'model']]
|
[-0.12682904628424072, 0.18044754165901777, -0.11505241115626536, 0.09597697011317666, -0.12312701246456097, -0.11254342193715275, -0.035974593521831064, 0.2944768842897917, -0.26772080523599134, -0.31100357917970733, 0.03348070495688406, -0.25080403993396383, -0.017853066337441926, 0.15867025551729297, 0.022865030988070526, -0.013781999409394828, -0.04009191692855797, 0.07041278568366052, -0.024810141881339644, -0.24417368009147283, 0.34583726095917977, 0.14819549299580487, 0.22727676947159986, 0.00797245580899088, 0.14248955236061622, -0.10299807928110424, -0.025097248869899072, 0.05904097752155442, -0.1715363550297824, 0.02611644652083908, 0.14024343476875833, 0.08831438385440331, 0.24348969697020947, -0.41727643497288225, -0.24813384685273232, 0.12165974776113504, 0.1416671808563957, 0.15873153468005752, -0.06325889739183414, -0.2764355025107139, 0.03712230822267501, -0.15292139217306516, -0.19823375920716085, -0.004600450362225897, 0.018179587050537137, -0.018619723125409923, -0.25283472795823686, 0.19942418529750092, -0.010975833716312128, 0.01878133160307219, -0.10192232043237279, -0.06902271769450684, 0.023044760718843656, 0.045056356276434506, 0.1634620352464385, 0.08554305841067904, 0.16008088025019357, -0.17779609678117067, -0.03148887270669404, 0.4422123027377223, -0.1764218358322978, -0.12543586763602338, 0.1469208299819576, -0.21136060628157696, -0.11085273403870433, 0.09597859323073767, 0.11784282045831021, 0.08126660955971793, -0.11435290195145889, 0.098629219706881, 0.04361848838406762, 0.148679333052745, 0.1090921483002603, -0.002730712771881372, 0.3179892049220048, 0.05784363352546566, 0.061520908949406525, 0.04974034259978093, -0.09590741086163018, -0.04635793829924966, -0.37447591529865015, -0.14418331540042634, -0.20641033654346277, 0.11144083849105396, -0.19176303994777538, -0.1689935373739756, 0.31307386247147073, 0.10482165899225755, 0.19271633689732928, 0.07145747116913921, 0.3101915373515926, 0.09136653669717673, 0.07795380542397891, 0.11353022898302266, 0.34254457438854796, 0.1427671100258043, 0.12740607047698607, -0.22376035522473486, 0.03778803486278967, 0.02645092980298949]
|
1,803.09629
|
Stochastic models of multi-channel particulate transport with blockage
|
Networks of channels conveying particles are often subject to blockages due
to the limited carrying capacity of the individual channels. If the channels
are coupled, blockage of one causes an increase in the flux entering the
remaining open channels leading to a cascade of failures. Once all channels are
blocked no additional particle can enter the system. If the blockages are of
finite duration, however, the system reaches a steady state with an exiting
flux that is reduced compared to the incoming one. We propose a stochastic
model consisting of $N_c$ channels each with a blocking threshold of $N$
particles. Particles enter the system according to a Poisson process with the
entering flux of intensity $\Lambda$ equally distributed over the open
channels. Any particle in an open channel exits at a rate $\mu$ and a blocked
channel unblocks at a rate $\mu^*$. We present a method to obtain the exiting
flux in the steady state, and other properties, for arbitrary $N_c$ and $N$ and
we present explicit solutions for $N_c=2,3$. We apply these results to compare
the efficiency of conveying a particulate stream of intensity $\Lambda$ using
different channel configurations. We compare a single "robust" channel with a
large capacity with multiple "fragile" channels with a proportionately reduced
capacity. The "robust" channel is more efficient at low intensity, while
multiple, "fragile" channels have a higher throughput at large intensity. We
also compare $N_c$ coupled channels with $N_c$ independent channels, both with
threshold $N=2$. For $N_c=2$ if $\mu^*/\mu>1/4$, the coupled channels are
always more efficient. Otherwise the independent channels are more efficient
for sufficiently large $\Lambda$.
|
cond-mat.stat-mech
|
networks of channels conveying particles are often subject to blockages due to the limited carrying capacity of the individual channels if the channels are coupled blockage of one causes an increase in the flux entering the remaining open channels leading to a cascade of failures once all channels are blocked no additional particle can enter the system if the blockages are of finite duration however the system reaches a steady state with an exiting flux that is reduced compared to the incoming one we propose a stochastic model consisting of n_c channels each with a blocking threshold of n particles particles enter the system according to a poisson process with the entering flux of intensity lambda equally distributed over the open channels any particle in an open channel exits at a rate mu and a blocked channel unblocks at a rate mu we present a method to obtain the exiting flux in the steady state and other properties for arbitrary n_c and n and we present explicit solutions for n_c23 we apply these results to compare the efficiency of conveying a particulate stream of intensity lambda using different channel configurations we compare a single robust channel with a large capacity with multiple fragile channels with a proportionately reduced capacity the robust channel is more efficient at low intensity while multiple fragile channels have a higher throughput at large intensity we also compare n_c coupled channels with n_c independent channels both with threshold n2 for n_c2 if mumu14 the coupled channels are always more efficient otherwise the independent channels are more efficient for sufficiently large lambda
|
[['networks', 'of', 'channels', 'conveying', 'particles', 'are', 'often', 'subject', 'to', 'blockages', 'due', 'to', 'the', 'limited', 'carrying', 'capacity', 'of', 'the', 'individual', 'channels', 'if', 'the', 'channels', 'are', 'coupled', 'blockage', 'of', 'one', 'causes', 'an', 'increase', 'in', 'the', 'flux', 'entering', 'the', 'remaining', 'open', 'channels', 'leading', 'to', 'a', 'cascade', 'of', 'failures', 'once', 'all', 'channels', 'are', 'blocked', 'no', 'additional', 'particle', 'can', 'enter', 'the', 'system', 'if', 'the', 'blockages', 'are', 'of', 'finite', 'duration', 'however', 'the', 'system', 'reaches', 'a', 'steady', 'state', 'with', 'an', 'exiting', 'flux', 'that', 'is', 'reduced', 'compared', 'to', 'the', 'incoming', 'one', 'we', 'propose', 'a', 'stochastic', 'model', 'consisting', 'of', 'n_c', 'channels', 'each', 'with', 'a', 'blocking', 'threshold', 'of', 'n', 'particles', 'particles', 'enter', 'the', 'system', 'according', 'to', 'a', 'poisson', 'process', 'with', 'the', 'entering', 'flux', 'of', 'intensity', 'lambda', 'equally', 'distributed', 'over', 'the', 'open', 'channels', 'any', 'particle', 'in', 'an', 'open', 'channel', 'exits', 'at', 'a', 'rate', 'mu', 'and', 'a', 'blocked', 'channel', 'unblocks', 'at', 'a', 'rate', 'mu', 'we', 'present', 'a', 'method', 'to', 'obtain', 'the', 'exiting', 'flux', 'in', 'the', 'steady', 'state', 'and', 'other', 'properties', 'for', 'arbitrary', 'n_c', 'and', 'n', 'and', 'we', 'present', 'explicit', 'solutions', 'for', 'n_c23', 'we', 'apply', 'these', 'results', 'to', 'compare', 'the', 'efficiency', 'of', 'conveying', 'a', 'particulate', 'stream', 'of', 'intensity', 'lambda', 'using', 'different', 'channel', 'configurations', 'we', 'compare', 'a', 'single', 'robust', 'channel', 'with', 'a', 'large', 'capacity', 'with', 'multiple', 'fragile', 'channels', 'with', 'a', 'proportionately', 'reduced', 'capacity', 'the', 'robust', 'channel', 'is', 'more', 'efficient', 'at', 'low', 'intensity', 'while', 'multiple', 'fragile', 'channels', 'have', 'a', 'higher', 'throughput', 'at', 'large', 'intensity', 'we', 'also', 'compare', 'n_c', 'coupled', 'channels', 'with', 'n_c', 'independent', 'channels', 'both', 'with', 'threshold', 'n2', 'for', 'n_c2', 'if', 'mumu14', 'the', 'coupled', 'channels', 'are', 'always', 'more', 'efficient', 'otherwise', 'the', 'independent', 'channels', 'are', 'more', 'efficient', 'for', 'sufficiently', 'large', 'lambda']]
|
[-0.19538019365455087, 0.20122200593623138, -0.037373819076527225, 0.027113679499010866, 0.013474465364711146, -0.21281165260650958, 0.09563117270457437, 0.3620001640426749, -0.24416809799576192, -0.26394404002593275, 0.10172211026945258, -0.3047560551221561, -0.048303716304580475, 0.1526468035992491, -0.030044251962259183, 0.03889606695067678, 0.07955160101463321, 0.06662637273023858, -0.00968381784987842, -0.21847491214791212, 0.2929163378506067, 0.07664813316615568, 0.27625610624646185, 0.04196849032411821, 0.08840365480553387, 0.0036198100046688363, -0.01774844603314427, 0.003072002749526402, -0.10037073411171539, 0.04528543656360436, 0.2242152893672278, 0.0767809985998555, 0.22505801906880304, -0.44596302007388977, -0.2279217911400754, 0.11355900414508434, 0.1713042190503498, 0.11024939354050563, -0.018994783997242002, -0.23771314177562602, 0.11162381150087924, -0.16593104416063723, -0.11344894861006213, 0.008308817925756329, 0.03161168557712595, 0.027380663767600972, -0.3361240515400094, 0.07497496837436822, -0.002319943882304578, -0.019485996095890194, -0.014031805176259453, -0.14141257145337205, -0.006462828300623152, 0.16612875070209607, 0.027438915942823123, 0.005504623186980723, 0.13940261098741064, -0.16891387574737252, -0.07147811670105136, 0.32323170165026577, -0.06876029244904897, -0.23776570887425702, 0.20974817756809586, -0.12586770136129707, -0.07035064203167007, 0.23959489477592172, 0.19462402525001546, 0.09542384608035537, -0.1414257302819858, 0.027577329649281588, -0.015582554636412933, 0.18549417795476553, 0.05152046593005648, 0.09241704458063327, 0.2104233703344975, 0.171723444043225, 0.08787747062405017, 0.1786239369239619, -0.1164764202331399, -0.10838269694701179, -0.29890986069199765, -0.12818222470272275, -0.1278119600162031, 0.03484969086347873, -0.06429171312635032, -0.12229350632241437, 0.32584279675155753, 0.13986545562689043, 0.22044953783593702, 0.0723230387724026, 0.3143946045284508, 0.12699086480162583, 0.05632187184372931, 0.12801442695568307, 0.18810348828209436, 0.137306303622553, 0.08675744925769587, -0.20418724348015002, 0.032236319111716996, -0.05846287163671191]
|
1,803.0963
|
Metric Learning with Dynamically Generated Pairwise Constraints for Ear
Recognition
|
Ear recognition task is known as predicting whether two ear images belong to
the same person or not. In this paper, we present a novel metric learning
method for ear recognition. This method is formulated as a pairwise constrained
optimization problem. In each training cycle, this method selects the nearest
similar and dissimilar neighbors of each sample to construct the pairwise
constraints, and then solve the optimization problem by the iterated Bregman
projections. Experiments are conducted on AMI, USTB II and WPUT databases. The
results show that the proposed approach can achieve promising recognition rates
in ear recognition, and its training process is much more efficient than the
other competing metric learning methods.
|
cs.CV cs.LG
|
ear recognition task is known as predicting whether two ear images belong to the same person or not in this paper we present a novel metric learning method for ear recognition this method is formulated as a pairwise constrained optimization problem in each training cycle this method selects the nearest similar and dissimilar neighbors of each sample to construct the pairwise constraints and then solve the optimization problem by the iterated bregman projections experiments are conducted on ami ustb ii and wput databases the results show that the proposed approach can achieve promising recognition rates in ear recognition and its training process is much more efficient than the other competing metric learning methods
|
[['ear', 'recognition', 'task', 'is', 'known', 'as', 'predicting', 'whether', 'two', 'ear', 'images', 'belong', 'to', 'the', 'same', 'person', 'or', 'not', 'in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'metric', 'learning', 'method', 'for', 'ear', 'recognition', 'this', 'method', 'is', 'formulated', 'as', 'a', 'pairwise', 'constrained', 'optimization', 'problem', 'in', 'each', 'training', 'cycle', 'this', 'method', 'selects', 'the', 'nearest', 'similar', 'and', 'dissimilar', 'neighbors', 'of', 'each', 'sample', 'to', 'construct', 'the', 'pairwise', 'constraints', 'and', 'then', 'solve', 'the', 'optimization', 'problem', 'by', 'the', 'iterated', 'bregman', 'projections', 'experiments', 'are', 'conducted', 'on', 'ami', 'ustb', 'ii', 'and', 'wput', 'databases', 'the', 'results', 'show', 'that', 'the', 'proposed', 'approach', 'can', 'achieve', 'promising', 'recognition', 'rates', 'in', 'ear', 'recognition', 'and', 'its', 'training', 'process', 'is', 'much', 'more', 'efficient', 'than', 'the', 'other', 'competing', 'metric', 'learning', 'methods']]
|
[-0.03682595594085518, -0.02830419553494131, -0.05867682393170423, 0.07738957793233502, -0.11405616130277112, -0.21919066135284934, 0.012744549400726887, 0.45460903248539913, -0.2879889737814665, -0.3100876335876885, 0.10291583984272203, -0.2745541589301046, -0.2163505905123243, 0.17693079787994492, -0.15001917824249816, 0.0645291788880042, 0.15835631985284454, 0.10173254029674304, -0.06249690389571091, -0.31474594035194264, 0.25852887221268034, 0.019626315452393378, 0.3358694401481566, 0.010832760285854608, 0.12356017327758374, -0.02748644636390177, -0.017959106883436843, 0.020710795186460018, -0.06891858745357159, 0.18223148199041617, 0.31760117498453, 0.23168252593510458, 0.3475280974798643, -0.3457077731551295, -0.18805709033197648, 0.12763449731875454, 0.16071561652210517, 0.09813415301074316, -0.03126586695489587, -0.3218968270350718, 0.0948604031734437, -0.1293587050786628, 0.02722297393641359, -0.09328939789708972, -0.013944623353135949, -0.04281929639579208, -0.312260393275636, 0.04342861243456535, 0.09866743648491867, 0.05215564199832377, -0.08341186422212804, -0.12203827979638837, 0.056610420648310636, 0.1582383365676579, 0.0643878486864835, 0.07782509340275381, 0.13703925802418543, -0.1345930421401889, -0.17171768563577217, 0.4055500830028642, -0.03165543451761042, -0.22520650641967518, 0.2267084708017809, -0.030565301648567657, -0.1468599842324316, 0.08258693713719982, 0.23015322773675392, 0.19912184447234682, -0.2118339479003135, -0.008856428344524256, -0.07844146276480174, 0.1399997737896335, 0.06593417352577252, -0.03931658474627782, 0.15350773702753154, 0.20439533065366852, 0.11852595118201666, 0.17541667698465102, -0.13398170961813816, -0.04868415980557869, -0.1836443507859299, -0.09200791316945944, -0.23670346067740103, -0.062359998185006135, -0.10615103683793112, -0.14692616547449483, 0.38631468595987234, 0.18560096346731256, 0.1915421727373525, 0.10140952022393813, 0.357963285635452, 0.03932140929297217, 0.10057146899634972, 0.0929609005971862, 0.2170835111483193, 0.008368347295316624, 0.064344839625027, -0.214343666501746, 0.08386987865994777, 0.11698313935047334]
|
1,803.09631
|
Sparse Recovery over Graph Incidence Matrices
|
Classical results in sparse recovery guarantee the exact reconstruction of
$s$-sparse signals under assumptions on the dictionary that are either too
strong or NP-hard to check. Moreover, such results may be pessimistic in
practice since they are based on a worst-case analysis. In this paper, we
consider the sparse recovery of signals defined over a graph, for which the
dictionary takes the form of an incidence matrix. We derive necessary and
sufficient conditions for sparse recovery, which depend on properties of the
cycles of the graph that can be checked in polynomial time. We also derive
support-dependent conditions for sparse recovery that depend only on the
intersection of the cycles of the graph with the support of the signal.
Finally, we exploit sparsity properties on the measurements and the structure
of incidence matrices to propose a specialized sub-graph-based recovery
algorithm that outperforms the standard $\ell_1$-minimization approach.
|
cs.IT cs.SI eess.SP math.IT
|
classical results in sparse recovery guarantee the exact reconstruction of ssparse signals under assumptions on the dictionary that are either too strong or nphard to check moreover such results may be pessimistic in practice since they are based on a worstcase analysis in this paper we consider the sparse recovery of signals defined over a graph for which the dictionary takes the form of an incidence matrix we derive necessary and sufficient conditions for sparse recovery which depend on properties of the cycles of the graph that can be checked in polynomial time we also derive supportdependent conditions for sparse recovery that depend only on the intersection of the cycles of the graph with the support of the signal finally we exploit sparsity properties on the measurements and the structure of incidence matrices to propose a specialized subgraphbased recovery algorithm that outperforms the standard ell_1minimization approach
|
[['classical', 'results', 'in', 'sparse', 'recovery', 'guarantee', 'the', 'exact', 'reconstruction', 'of', 'ssparse', 'signals', 'under', 'assumptions', 'on', 'the', 'dictionary', 'that', 'are', 'either', 'too', 'strong', 'or', 'nphard', 'to', 'check', 'moreover', 'such', 'results', 'may', 'be', 'pessimistic', 'in', 'practice', 'since', 'they', 'are', 'based', 'on', 'a', 'worstcase', 'analysis', 'in', 'this', 'paper', 'we', 'consider', 'the', 'sparse', 'recovery', 'of', 'signals', 'defined', 'over', 'a', 'graph', 'for', 'which', 'the', 'dictionary', 'takes', 'the', 'form', 'of', 'an', 'incidence', 'matrix', 'we', 'derive', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'sparse', 'recovery', 'which', 'depend', 'on', 'properties', 'of', 'the', 'cycles', 'of', 'the', 'graph', 'that', 'can', 'be', 'checked', 'in', 'polynomial', 'time', 'we', 'also', 'derive', 'supportdependent', 'conditions', 'for', 'sparse', 'recovery', 'that', 'depend', 'only', 'on', 'the', 'intersection', 'of', 'the', 'cycles', 'of', 'the', 'graph', 'with', 'the', 'support', 'of', 'the', 'signal', 'finally', 'we', 'exploit', 'sparsity', 'properties', 'on', 'the', 'measurements', 'and', 'the', 'structure', 'of', 'incidence', 'matrices', 'to', 'propose', 'a', 'specialized', 'subgraphbased', 'recovery', 'algorithm', 'that', 'outperforms', 'the', 'standard', 'ell_1minimization', 'approach']]
|
[-0.1170816392165749, 0.031065695323564322, -0.08897875973393451, 0.051869650836236625, -0.0770715136584915, -0.12021800535348283, 0.054701120110247796, 0.4053998378500955, -0.27606031341695114, -0.25258612600856856, 0.21127834735671058, -0.197538063102338, -0.21264341640228737, 0.17266043287236243, -0.10965183479807097, 0.05312403166436986, 0.10714991571228594, 0.09212864816949498, -0.1247922231368274, -0.28358403665842075, 0.2853978781271981, 0.04091602527498178, 0.2611572097170435, 0.026830363637139407, 0.08180748653073464, 0.05505156036058109, -0.02165975156702637, 0.023115223652782072, -0.10700372774381196, 0.10597729779403554, 0.26228754796495996, 0.2346519130371409, 0.22009979638953578, -0.48078207304216414, -0.17058439191736996, 0.15955888899043202, 0.09911366344161637, 0.09760894795898858, -0.03938489810209594, -0.25392144992437266, 0.15415621168866805, -0.09108808588982904, -0.03144615895612395, -0.09685907812872009, -0.04405335393058111, 0.037763015826373064, -0.3711074726095532, 0.0661350426609765, 0.09276662860065699, 0.01992822332588369, -0.05338746104198062, -0.11093187482855346, 0.05980648559658495, 0.09587251362614078, 0.02629978936472557, -0.034011562426625556, 0.09307829893277066, -0.12029628838852609, -0.09721183063213598, 0.36737901196266487, -0.05930315476582283, -0.21081410524473615, 0.18336825779868826, -0.11669107963496896, -0.17501337032714118, 0.12964661742165073, 0.22484129562348842, 0.10950366512356782, -0.11492776629644165, 0.09077811618064441, -0.10640292083972121, 0.16608204181650527, 0.08162556142444173, 0.0566705386329774, 0.10068947586473333, 0.13526891182776388, 0.1356369816803386, 0.11256305451189129, -0.07156222214609742, -0.01837573735336837, -0.29144874504968293, -0.08874193471074997, -0.23803339130564094, -0.0022656739161553956, -0.15260766387884409, -0.19592514467004635, 0.4306936588358415, 0.17798223999713242, 0.2022419489460857, 0.10657666528386969, 0.2927215741564558, 0.11250887442841068, 0.028963040256687785, 0.10907511045033597, 0.2222751497405849, 0.1487951985949472, 0.01785610701131502, -0.18956664142402987, 0.13610949109416864, 0.06408293146882461]
|
1,803.09632
|
Big Data Challenges in Genome Informatics
|
In recent years, we have witnessed a dramatic data explosion in genomics,
thanks to the improvement in sequencing technologies and the drastically
decreasing costs. We are entering the era of millions of available genomes.
Notably, each genome can be composed of billions of nucleotides stored as plain
text files in GigaBytes (GBs). It is undeniable that those genome data impose
unprecedented data challenges for us. In this article, we briefly discuss the
big data challenges associated with genomics in recent years.
|
q-bio.OT cs.CE
|
in recent years we have witnessed a dramatic data explosion in genomics thanks to the improvement in sequencing technologies and the drastically decreasing costs we are entering the era of millions of available genomes notably each genome can be composed of billions of nucleotides stored as plain text files in gigabytes gbs it is undeniable that those genome data impose unprecedented data challenges for us in this article we briefly discuss the big data challenges associated with genomics in recent years
|
[['in', 'recent', 'years', 'we', 'have', 'witnessed', 'a', 'dramatic', 'data', 'explosion', 'in', 'genomics', 'thanks', 'to', 'the', 'improvement', 'in', 'sequencing', 'technologies', 'and', 'the', 'drastically', 'decreasing', 'costs', 'we', 'are', 'entering', 'the', 'era', 'of', 'millions', 'of', 'available', 'genomes', 'notably', 'each', 'genome', 'can', 'be', 'composed', 'of', 'billions', 'of', 'nucleotides', 'stored', 'as', 'plain', 'text', 'files', 'in', 'gigabytes', 'gbs', 'it', 'is', 'undeniable', 'that', 'those', 'genome', 'data', 'impose', 'unprecedented', 'data', 'challenges', 'for', 'us', 'in', 'this', 'article', 'we', 'briefly', 'discuss', 'the', 'big', 'data', 'challenges', 'associated', 'with', 'genomics', 'in', 'recent', 'years']]
|
[-0.09951413486492072, 0.08643955007241463, 0.0005262357407008056, 0.03744710383959758, -0.06698300753846581, -0.07943386004455848, 0.04628739531301422, 0.3853827761716129, -0.3102634781856596, -0.3599935175669897, 0.1477088086180573, -0.36799497682785176, -0.12089609527201564, 0.22989794997969804, -0.1535908031783262, 0.05379912112322119, 0.2441673939127797, -0.007089279160869343, -0.007854682873405608, -0.35490219610064855, 0.24457515738214608, 0.05370131927185956, 0.2937454395513568, 0.01353329412041255, 0.0494223970770376, -0.0559260697783755, -0.10242957758636755, -0.042423771470095274, -0.14028959951615377, 0.21553474297907985, 0.3700942310884043, 0.2743927732995355, 0.3223920763537782, -0.5294064112973434, -0.18574518437876744, 0.13110984865300082, 0.19585682923710088, 0.15825453587738728, -0.0951776549473037, -0.24018136129059173, 0.07190708676065652, -0.20312089952467768, -0.07448120721052458, -0.07170212702009321, 0.07178336756740823, 0.03337452715883652, -0.15670622933518003, 0.08644918337993232, -0.06731557335566592, 0.09727998828101489, 0.0028153243086611233, -0.12644552912586082, 0.013393998950903799, 0.16279647498748, 0.13860198494656312, 0.06947449212433932, 0.11637966887289543, -0.1389563102648812, -0.13775913451832753, 0.3677950995617811, -0.0366976953651986, -0.03987209994437886, 0.15416862993834562, -0.1301800527115479, -0.24582472232595823, 0.1255788218781904, 0.19270433141579738, 0.002269872705693598, -0.19103352335730084, 0.10896509147556728, 0.052256543241027326, 0.17982924897453667, 0.11796293961873025, 0.06518822856661347, 0.19067998964017557, 0.2772663289998704, -0.0100340630289995, 0.11282128210461204, -0.09246419342651527, -0.09188628169121565, -0.18959179077941327, -0.17584214245693552, -0.15709455953451035, 0.029458903868533212, -0.09125748613578365, -0.11875833335252088, 0.36997032784109496, 0.21314455714812616, 0.2077638282315564, -0.01987556450896793, 0.27127954880074584, -0.03892280480588706, 0.20196488712350896, 0.021592189885537932, 0.1257553667097387, 0.011092482876308539, 0.21893247791255513, -0.10157932024334132, 0.0769159864479055, -0.10210565270649062]
|
1,803.09633
|
Direct Proofs of the Fundamental Theorem of Calculus for the Omega
Integral
|
When introduced in a 2018 article in the American Mathematical Monthly, the
omega integral was shown to be an extension of the Riemann integral. Although
results for continuous functions such as the Fundamental Theorem of Calculus
follow immediately, a much more satisfying approach would be to provide direct
proofs not relying on the Riemann integral. This note provides those proofs.
|
math.CA
|
when introduced in a 2018 article in the american mathematical monthly the omega integral was shown to be an extension of the riemann integral although results for continuous functions such as the fundamental theorem of calculus follow immediately a much more satisfying approach would be to provide direct proofs not relying on the riemann integral this note provides those proofs
|
[['when', 'introduced', 'in', 'a', '2018', 'article', 'in', 'the', 'american', 'mathematical', 'monthly', 'the', 'omega', 'integral', 'was', 'shown', 'to', 'be', 'an', 'extension', 'of', 'the', 'riemann', 'integral', 'although', 'results', 'for', 'continuous', 'functions', 'such', 'as', 'the', 'fundamental', 'theorem', 'of', 'calculus', 'follow', 'immediately', 'a', 'much', 'more', 'satisfying', 'approach', 'would', 'be', 'to', 'provide', 'direct', 'proofs', 'not', 'relying', 'on', 'the', 'riemann', 'integral', 'this', 'note', 'provides', 'those', 'proofs']]
|
[-0.07504255667057198, 0.02894696009874072, -0.18818023930847025, 0.12087576278912214, -0.18536723218858242, -0.08971467015023032, 0.0224600942650189, 0.3085268839728087, -0.24317601191966484, -0.26431118408218024, 0.1518289980595, -0.2096457195856298, -0.1637478662771173, 0.29402566309824274, -0.13349639233589794, 0.006655860319733619, 0.05992822886134187, 0.04263876994421783, -0.05785104898968711, -0.2676966695425411, 0.2866831087390892, 0.02461720728315413, 0.20981646293463807, 0.11650476443270842, 0.07695661475105832, 0.0372498048391814, -0.10072994648168485, -0.02411428028717637, -0.15195829453102003, 0.1485917278022195, 0.29027096085483206, 0.10754051526697973, 0.29143508765846493, -0.4636942983139306, -0.1790936253964901, 0.10331242370108763, 0.09966537381211917, 0.030816592904739083, 0.020781295498939773, -0.2926579094414289, 0.06923903150794407, -0.1417168974255522, -0.16773416850094994, -0.05513011490305265, 0.029913100142342348, 0.012576936945940058, -0.25514066103690614, 0.03892192823501925, 0.11777317570522428, 0.09020092512946576, -0.07219147357779244, -0.12949149352498351, 0.030755582397493222, 0.05220671008040275, 0.07105462827409308, 0.08665543506698062, 0.04404454453227421, -0.049801395022465535, -0.11801369370271762, 0.3613833129250755, -0.041904071384730436, -0.2552019970025867, 0.157776000443846, -0.1207134252258887, -0.19091860617821416, 0.08786830470586816, 0.08898411138604084, 0.13626350418198854, -0.17515503066946014, 0.10082778740519037, -0.11137600669947763, 0.13471288069461781, 0.12099389884000024, 0.011528691478694479, 0.16359424277519186, 0.10426867162653555, 0.10354267037473619, 0.11608861048395434, 0.009877290037305404, -0.10545824364138147, -0.3463095350811879, -0.2313025828450918, -0.17680603195913136, 0.10602512347225759, -0.03693762221907188, -0.19685047824702148, 0.3364186986039082, 0.12477071354320894, 0.10318909836933017, 0.12879042671993374, 0.24372748223831878, 0.20466148884152063, 0.0640944069561859, 0.04996367339044809, 0.19393984538813433, 0.14332412004781267, 0.14490239295021942, -0.07105712171954413, 0.04641993112551669, 0.1493273528913657]
|
1,803.09634
|
Partial control of chaos: how to avoid undesirable behaviors with small
controls in presence of noise
|
The presence of a nonattractive chaotic set, also called chaotic saddle, in
phase space implies the appearance of a finite time kind of chaos that is known
as transient chaos. For a given dynamical system in a certain region of phase
space with transient chaos, trajectories eventually abandon the chaotic region
escaping to an external attractor, if no external intervention is done on the
system. In some situations, this attractor may involve an undesirable behavior,
so the application of a control in the system is necessary to avoid it. Both,
the nonattractive nature of transient chaos and eventually the presence of
noise may hinder this task. Recently, a new method to control chaos called
\emph{partial control} has been developed. The method is based on the existence
of a set, called the safe set, that allows to sustain transient chaos by only
using a small amount of control. The surprising result is that the trajectories
can be controlled by using an amount of control smaller than the amount of
noise affecting it. We present here a broad survey of results of this control
method applied to a wide variety of dynamical systems. We also review here all
the variations of the partial control method that have been developed so far.
In all the cases various systems of different dimensionality are treated in
order to see the potential of this method. We believe that this method is a
step forward in controlling chaos in presence of disturbances.
|
nlin.CD
|
the presence of a nonattractive chaotic set also called chaotic saddle in phase space implies the appearance of a finite time kind of chaos that is known as transient chaos for a given dynamical system in a certain region of phase space with transient chaos trajectories eventually abandon the chaotic region escaping to an external attractor if no external intervention is done on the system in some situations this attractor may involve an undesirable behavior so the application of a control in the system is necessary to avoid it both the nonattractive nature of transient chaos and eventually the presence of noise may hinder this task recently a new method to control chaos called emphpartial control has been developed the method is based on the existence of a set called the safe set that allows to sustain transient chaos by only using a small amount of control the surprising result is that the trajectories can be controlled by using an amount of control smaller than the amount of noise affecting it we present here a broad survey of results of this control method applied to a wide variety of dynamical systems we also review here all the variations of the partial control method that have been developed so far in all the cases various systems of different dimensionality are treated in order to see the potential of this method we believe that this method is a step forward in controlling chaos in presence of disturbances
|
[['the', 'presence', 'of', 'a', 'nonattractive', 'chaotic', 'set', 'also', 'called', 'chaotic', 'saddle', 'in', 'phase', 'space', 'implies', 'the', 'appearance', 'of', 'a', 'finite', 'time', 'kind', 'of', 'chaos', 'that', 'is', 'known', 'as', 'transient', 'chaos', 'for', 'a', 'given', 'dynamical', 'system', 'in', 'a', 'certain', 'region', 'of', 'phase', 'space', 'with', 'transient', 'chaos', 'trajectories', 'eventually', 'abandon', 'the', 'chaotic', 'region', 'escaping', 'to', 'an', 'external', 'attractor', 'if', 'no', 'external', 'intervention', 'is', 'done', 'on', 'the', 'system', 'in', 'some', 'situations', 'this', 'attractor', 'may', 'involve', 'an', 'undesirable', 'behavior', 'so', 'the', 'application', 'of', 'a', 'control', 'in', 'the', 'system', 'is', 'necessary', 'to', 'avoid', 'it', 'both', 'the', 'nonattractive', 'nature', 'of', 'transient', 'chaos', 'and', 'eventually', 'the', 'presence', 'of', 'noise', 'may', 'hinder', 'this', 'task', 'recently', 'a', 'new', 'method', 'to', 'control', 'chaos', 'called', 'emphpartial', 'control', 'has', 'been', 'developed', 'the', 'method', 'is', 'based', 'on', 'the', 'existence', 'of', 'a', 'set', 'called', 'the', 'safe', 'set', 'that', 'allows', 'to', 'sustain', 'transient', 'chaos', 'by', 'only', 'using', 'a', 'small', 'amount', 'of', 'control', 'the', 'surprising', 'result', 'is', 'that', 'the', 'trajectories', 'can', 'be', 'controlled', 'by', 'using', 'an', 'amount', 'of', 'control', 'smaller', 'than', 'the', 'amount', 'of', 'noise', 'affecting', 'it', 'we', 'present', 'here', 'a', 'broad', 'survey', 'of', 'results', 'of', 'this', 'control', 'method', 'applied', 'to', 'a', 'wide', 'variety', 'of', 'dynamical', 'systems', 'we', 'also', 'review', 'here', 'all', 'the', 'variations', 'of', 'the', 'partial', 'control', 'method', 'that', 'have', 'been', 'developed', 'so', 'far', 'in', 'all', 'the', 'cases', 'various', 'systems', 'of', 'different', 'dimensionality', 'are', 'treated', 'in', 'order', 'to', 'see', 'the', 'potential', 'of', 'this', 'method', 'we', 'believe', 'that', 'this', 'method', 'is', 'a', 'step', 'forward', 'in', 'controlling', 'chaos', 'in', 'presence', 'of', 'disturbances']]
|
[-0.1730253116474772, 0.11409204859038273, -0.12217447335907142, 0.04275047032742248, -0.05195235876100404, -0.09938047043884135, 0.06764939905581425, 0.31840414209101275, -0.28767532086075875, -0.2708559338355019, 0.14183460369478074, -0.2222869310595157, -0.20525619181500254, 0.227145975398622, -0.0931408672272798, 0.06896504815287736, 0.040738114060796034, 0.033247191102567075, -0.008384181107917079, -0.22354170303715734, 0.3162349735443689, 0.02896398790370749, 0.23641359393522904, 0.011615886400472753, 0.10887785511927642, -0.02333465419728689, 0.014495219898467162, 0.04854714736200326, -0.08540202465780883, 0.07123746364282406, 0.20613722178647864, 0.12098683480283826, 0.3414306237913516, -0.3921364651650799, -0.2542094447018046, 0.1512967998109644, 0.165136675318532, 0.14540016006830395, -0.06465582824597249, -0.2850635474357678, 0.10085719250551216, -0.1688512318663071, -0.16588512904067731, -0.11434639613429198, 0.03364312395225374, 0.021233830892727994, -0.2554588755621214, 0.04237324484619217, 0.08076479751640475, 0.06095188568460242, -0.04504951147424361, -0.007680305489338934, -0.0017172562483489058, 0.14047850087589148, 0.013940128879336527, 0.026769168408616085, 0.12523644948948404, -0.11963457926176488, -0.1062630244416698, 0.35297714958005416, -0.049346350173154675, -0.20240465726475326, 0.22523664472985785, -0.1431424332773123, -0.13873391247031336, 0.18471338362575565, 0.18436297807386334, 0.11758890031285736, -0.17458429879375867, 0.05786473972090919, -0.023071208056442593, 0.18113876770117454, 0.036842575055376, 0.047861751373762224, 0.1793255767927562, 0.18431202810903896, 0.1173254282541611, 0.1591663965159476, -0.07920290591214232, -0.12443221994314571, -0.30024019945793007, -0.11877393053882584, -0.16843656088719713, 0.026234293563709574, -0.04617220256245952, -0.19686363781707322, 0.39552539999083597, 0.20411356863831834, 0.19356554334279985, -0.021035254439719174, 0.27757240279900786, 0.1237317092286076, 0.04522082894584354, 0.04983058856700414, 0.25367210587469996, 0.07745871382138254, 0.11653841026127339, -0.23085020014027857, 0.11244731257118437, 0.0459584961379213]
|
1,803.09635
|
Autonomous decision-making against induced seismicity in deep fluid
injections
|
The rise in the frequency of anthropogenic earthquakes due to deep fluid
injections is posing serious economic, societal, and legal challenges to
geo-energy and waste-disposal projects. We propose an actuarial approach to
mitigate this risk, first by defining an autonomous decision-making process
based on an adaptive traffic light system (ATLS) to stop risky injections, and
second by quantifying a "cost of public safety" based on the probability of an
injection-well being abandoned. The ATLS underlying statistical model is first
confirmed to be representative of injection-induced seismicity, with examples
taken from past reservoir stimulation experiments (mostly from Enhanced
Geothermal Systems, EGS). Then the decision strategy is formalized: Being
integrable, the model yields a closed-form ATLS solution that maps a risk-based
safety standard or norm to an earthquake magnitude not to exceed during
stimulation. Finally, the EGS levelized cost of electricity (LCOE) is
reformulated in terms of null expectation, with the cost of abandoned
injection-well implemented. We find that the price increase to mitigate the
increased seismic risk in populated areas can counterbalance the heat credit.
However this "public safety cost" disappears if buildings are based on
earthquake-resistant designs or if a more relaxed risk safety standard or norm
is chosen.
|
physics.geo-ph physics.data-an
|
the rise in the frequency of anthropogenic earthquakes due to deep fluid injections is posing serious economic societal and legal challenges to geoenergy and wastedisposal projects we propose an actuarial approach to mitigate this risk first by defining an autonomous decisionmaking process based on an adaptive traffic light system atls to stop risky injections and second by quantifying a cost of public safety based on the probability of an injectionwell being abandoned the atls underlying statistical model is first confirmed to be representative of injectioninduced seismicity with examples taken from past reservoir stimulation experiments mostly from enhanced geothermal systems egs then the decision strategy is formalized being integrable the model yields a closedform atls solution that maps a riskbased safety standard or norm to an earthquake magnitude not to exceed during stimulation finally the egs levelized cost of electricity lcoe is reformulated in terms of null expectation with the cost of abandoned injectionwell implemented we find that the price increase to mitigate the increased seismic risk in populated areas can counterbalance the heat credit however this public safety cost disappears if buildings are based on earthquakeresistant designs or if a more relaxed risk safety standard or norm is chosen
|
[['the', 'rise', 'in', 'the', 'frequency', 'of', 'anthropogenic', 'earthquakes', 'due', 'to', 'deep', 'fluid', 'injections', 'is', 'posing', 'serious', 'economic', 'societal', 'and', 'legal', 'challenges', 'to', 'geoenergy', 'and', 'wastedisposal', 'projects', 'we', 'propose', 'an', 'actuarial', 'approach', 'to', 'mitigate', 'this', 'risk', 'first', 'by', 'defining', 'an', 'autonomous', 'decisionmaking', 'process', 'based', 'on', 'an', 'adaptive', 'traffic', 'light', 'system', 'atls', 'to', 'stop', 'risky', 'injections', 'and', 'second', 'by', 'quantifying', 'a', 'cost', 'of', 'public', 'safety', 'based', 'on', 'the', 'probability', 'of', 'an', 'injectionwell', 'being', 'abandoned', 'the', 'atls', 'underlying', 'statistical', 'model', 'is', 'first', 'confirmed', 'to', 'be', 'representative', 'of', 'injectioninduced', 'seismicity', 'with', 'examples', 'taken', 'from', 'past', 'reservoir', 'stimulation', 'experiments', 'mostly', 'from', 'enhanced', 'geothermal', 'systems', 'egs', 'then', 'the', 'decision', 'strategy', 'is', 'formalized', 'being', 'integrable', 'the', 'model', 'yields', 'a', 'closedform', 'atls', 'solution', 'that', 'maps', 'a', 'riskbased', 'safety', 'standard', 'or', 'norm', 'to', 'an', 'earthquake', 'magnitude', 'not', 'to', 'exceed', 'during', 'stimulation', 'finally', 'the', 'egs', 'levelized', 'cost', 'of', 'electricity', 'lcoe', 'is', 'reformulated', 'in', 'terms', 'of', 'null', 'expectation', 'with', 'the', 'cost', 'of', 'abandoned', 'injectionwell', 'implemented', 'we', 'find', 'that', 'the', 'price', 'increase', 'to', 'mitigate', 'the', 'increased', 'seismic', 'risk', 'in', 'populated', 'areas', 'can', 'counterbalance', 'the', 'heat', 'credit', 'however', 'this', 'public', 'safety', 'cost', 'disappears', 'if', 'buildings', 'are', 'based', 'on', 'earthquakeresistant', 'designs', 'or', 'if', 'a', 'more', 'relaxed', 'risk', 'safety', 'standard', 'or', 'norm', 'is', 'chosen']]
|
[-0.0827956530895593, 0.07760149324122281, -0.06284246325868509, 0.1016391887766245, -0.07918760298568871, -0.12729821662351334, 0.09202129761064329, 0.3571501534729812, -0.252991458492896, -0.27636935875856694, 0.17110460197742663, -0.2894406268641967, -0.13123395477935249, 0.1970280502771613, -0.21334601384251542, 0.046854802788974546, 0.05033193775644699, 0.0196193944622004, 0.02236894395405825, -0.2773316027218543, 0.2593649010925275, 0.10976627550538529, 0.30049508921898055, 0.05847919919556871, 0.10079100061947308, -0.027838485543847147, -0.014491967756520794, 0.018699598181200663, -0.07746868053627903, 0.12915427444656333, 0.2965942849069066, 0.19592204318770698, 0.38517561921677024, -0.46313821019355167, -0.2152332907744213, 0.15552599662098765, 0.060876682898768984, 0.03372860269875448, -0.0057083055844018, -0.30277516877941174, 0.0285333057618868, -0.22925377773005784, -0.1104673191079313, -0.056076665313046704, -0.022297167705285566, -0.0033006101430240135, -0.280769201881281, 0.054613011544714346, 0.01628061426448223, 0.09626997757544645, -0.0668402381334934, -0.1054926209023328, -0.05998383492192964, 0.12611474949472282, 0.11006526686668218, -0.0013930150808780886, 0.19437450669662662, -0.14877097606511167, -0.13629928777071157, 0.3682278079249579, -0.029041226540713755, -0.15482191026052364, 0.13573718759994569, -0.0618716289610938, -0.1006580327959136, 0.1277801215609046, 0.23650181190513997, 0.032583521057361946, -0.21356920300942087, 0.009639288017048607, 0.031409926176042366, 0.17999460639974543, 0.06288085841290537, -0.02615447410354727, 0.19094178690719082, 0.2158758822233253, 0.13596244490724632, 0.12877932179156035, -0.05365388423862109, -0.11693096642392044, -0.2672736423483752, -0.12156383262961604, -0.14441157368698262, 0.04666909461574852, -0.0684674856942009, -0.1556695416472497, 0.33661359447755457, 0.1829340938750544, 0.10693799957306575, 0.06476981688192421, 0.33933156873723586, 0.14316322895957484, 0.0794061225426105, 0.10130115124737825, 0.2163785824086517, 0.019678094847963106, 0.10933674838797179, -0.19265829759830555, 0.14853209828881106, 0.027836363298155982]
|
1,803.09636
|
Dual addition formulas: the case of continuous $q$-ultraspherical and
$q$-Hermite polynomials
|
We settle the dual addition formula for continuous $q$-ultraspherical
polynomials as an expansion in terms of special $q$-Racah polynomials for which
the constant term is given by the linearization formula for the continuous
$q$-ultraspherical polynomials. In a second proof we derive the dual addition
formula from the Rahman--Verma addition formula for these polynomials by using
the self-duality of the polynomials. We also consider the limit case of
continuous $q$-Hermite polynomials.
|
math.CA
|
we settle the dual addition formula for continuous qultraspherical polynomials as an expansion in terms of special qracah polynomials for which the constant term is given by the linearization formula for the continuous qultraspherical polynomials in a second proof we derive the dual addition formula from the rahmanverma addition formula for these polynomials by using the selfduality of the polynomials we also consider the limit case of continuous qhermite polynomials
|
[['we', 'settle', 'the', 'dual', 'addition', 'formula', 'for', 'continuous', 'qultraspherical', 'polynomials', 'as', 'an', 'expansion', 'in', 'terms', 'of', 'special', 'qracah', 'polynomials', 'for', 'which', 'the', 'constant', 'term', 'is', 'given', 'by', 'the', 'linearization', 'formula', 'for', 'the', 'continuous', 'qultraspherical', 'polynomials', 'in', 'a', 'second', 'proof', 'we', 'derive', 'the', 'dual', 'addition', 'formula', 'from', 'the', 'rahmanverma', 'addition', 'formula', 'for', 'these', 'polynomials', 'by', 'using', 'the', 'selfduality', 'of', 'the', 'polynomials', 'we', 'also', 'consider', 'the', 'limit', 'case', 'of', 'continuous', 'qhermite', 'polynomials']]
|
[-0.1335986583237199, 0.06296956877454447, -0.07553758696936395, 0.052592084481569844, -0.08993658269553081, -0.11652513629203473, 0.025214130585284336, 0.24867382754936165, -0.29744212868947373, -0.16403993705044623, 0.15029743825679348, -0.22013140378344426, -0.20508466531401096, 0.20971202466677388, -0.07838481502013578, 0.046097117165724434, -0.013619525263598864, 0.05176408808894348, -0.14241494866007048, -0.2723661091455353, 0.3500395882874727, 0.01189184386242667, 0.17706280398735966, 0.04756860198804002, 0.1554286667969132, 0.02338001038204285, -0.027973116638705782, -0.10805006028301474, -0.1565293576500878, 0.10315840622491163, 0.24840866400779266, 0.10569423123978186, 0.21159214094497156, -0.3693710336920576, -0.09776346174919087, 0.1882314865031968, 0.16754238342569358, 0.05293835216856467, -0.01148503993138455, -0.22760019564420741, 0.02017057202823892, -0.2036494481363806, -0.22697299687812725, -0.10944900982270854, 0.027605220722709444, 0.10106215337156385, -0.32525256465094676, 0.0648005894765737, 0.12007199878385966, 0.0865175529261646, -0.06177555208863771, -0.12586187584784583, 0.042047270688403776, 0.05425328308500457, 0.029471438555249377, 0.03599908061163581, -0.022529185999292826, -0.11616397433090901, -0.12079705333040244, 0.3647207770010699, -0.09085923101267089, -0.2753482226120389, 0.02611286540016316, -0.1645468001294395, -0.2025590460828465, 0.07493894473831776, 0.09511606828512056, 0.19812045292253944, -0.10267214774005655, 0.14761937328654787, -0.14892118864193343, 0.04200734639121895, 0.18049867567268835, 0.02909501481369354, 0.12430472405411411, -0.06576800376068855, 0.02478473959490657, 0.2752373423157395, 0.031361924774566854, -0.12471376513333424, -0.375479315718015, -0.21508353173840736, -0.21376006201287542, 0.03700682944685653, -0.21525363391940144, -0.18354800926602405, 0.3835467778254246, 0.06652482113112575, 0.16319174819585422, 0.18053612021385165, 0.23025094528777013, 0.2710304802428742, 0.03245179751631466, 0.01900354779554882, 0.1435877268836982, 0.22590129892004357, 0.09403946032018765, -0.16026132423607836, 0.04625466004337953, 0.28184596562515135]
|
1,803.09637
|
Connections between Minkowski and Cosmological Correlation Functions
|
We show how cosmological correlation functions of massless fields can be
rewritten in terms of Minkowski correlation functions, by extracting
symmetry-breaking operators from the cosmological correlators. This technique
simplifies some cosmological calculations. Also, known properties of Minkowski
correlation functions can be translated to non-trivial properties of
cosmological correlations. To illustrate this idea, inflation to Minkowski and
matter bounce to Minkowski relations are presented for the interactions of
general single field inflation. And a Minkowski recursion relation is
translated to a novel relation for inflation.
|
hep-th astro-ph.CO
|
we show how cosmological correlation functions of massless fields can be rewritten in terms of minkowski correlation functions by extracting symmetrybreaking operators from the cosmological correlators this technique simplifies some cosmological calculations also known properties of minkowski correlation functions can be translated to nontrivial properties of cosmological correlations to illustrate this idea inflation to minkowski and matter bounce to minkowski relations are presented for the interactions of general single field inflation and a minkowski recursion relation is translated to a novel relation for inflation
|
[['we', 'show', 'how', 'cosmological', 'correlation', 'functions', 'of', 'massless', 'fields', 'can', 'be', 'rewritten', 'in', 'terms', 'of', 'minkowski', 'correlation', 'functions', 'by', 'extracting', 'symmetrybreaking', 'operators', 'from', 'the', 'cosmological', 'correlators', 'this', 'technique', 'simplifies', 'some', 'cosmological', 'calculations', 'also', 'known', 'properties', 'of', 'minkowski', 'correlation', 'functions', 'can', 'be', 'translated', 'to', 'nontrivial', 'properties', 'of', 'cosmological', 'correlations', 'to', 'illustrate', 'this', 'idea', 'inflation', 'to', 'minkowski', 'and', 'matter', 'bounce', 'to', 'minkowski', 'relations', 'are', 'presented', 'for', 'the', 'interactions', 'of', 'general', 'single', 'field', 'inflation', 'and', 'a', 'minkowski', 'recursion', 'relation', 'is', 'translated', 'to', 'a', 'novel', 'relation', 'for', 'inflation']]
|
[-0.15113437785545275, 0.16041492765015436, -0.16857752509185092, 0.21144465165672868, -0.11595478001150436, -0.10511116529371411, -0.06342786268907644, 0.3057087123937284, -0.27727681810834576, -0.2614869281117405, 0.03031779702896962, -0.270134059601419, -0.15762228713858695, 0.16203664371555315, 0.00411404910985203, 0.06603183108381927, -0.029295024073993165, -0.01601160925236486, -0.1423336434998505, -0.285966259516066, 0.37567845495816854, 0.04627319872157559, 0.23997014695556745, 0.03692355661076449, 0.06886411993764341, -0.02542877147373344, -0.025864291329136386, 0.044648794135788365, -0.15034405552294283, 0.09406812088785782, 0.21493883555134138, 0.17696433787101082, 0.1758349716297484, -0.41694493815746336, -0.24040703043075545, 0.12226789225297537, 0.1876854407878238, 0.1445703824671606, -0.034919826014499576, -0.30334459790693863, 0.018238300779124812, -0.13636711625648396, -0.1122518361025002, -0.16122189740694703, -0.016392996222878407, -0.042874531232796255, -0.2587481586822486, 0.13356849011498048, -0.02511891185366992, -0.028436350933545674, -0.056467342717085214, -0.05644759098816264, -0.03352011410780029, 0.07469608068710104, 0.09786914902949884, 0.0656738023029729, 0.12783675776084974, -0.1502241686186088, -0.12408724673150573, 0.4037637005094439, -0.11972981258960706, -0.2595261891727291, 0.08823148272044602, -0.18038971757050604, -0.15335639888819838, 0.037609570127512724, 0.14491169425171047, 0.08555955646027412, -0.1966698745520608, 0.15726373947663455, 0.019451698920290385, 0.13825065068279704, 0.12112295216814216, 0.07333747976961258, 0.3021818366389544, 0.04383954562113753, -0.008221628327321793, 0.1579493235247875, 0.06685139951739638, -0.10091383706423498, -0.39995912134292577, -0.14253645107826396, -0.17918908470753758, 0.06743106721634311, -0.1898793116308211, -0.20933762864608849, 0.38878828371387153, 0.15075575113518253, 0.15358683362137526, 0.11046862012396257, 0.23669536289803328, 0.12230805743907001, 0.07749417629314675, 0.019654398203697167, 0.26945191285457915, 0.15520718428888358, 0.08726026687682384, -0.1823875200962426, -0.05539837670845112, 0.12052225615341394]
|
1,803.09638
|
On the Limitation of Local Intrinsic Dimensionality for Characterizing
the Subspaces of Adversarial Examples
|
Understanding and characterizing the subspaces of adversarial examples aid in
studying the robustness of deep neural networks (DNNs) to adversarial
perturbations. Very recently, Ma et al. (ICLR 2018) proposed to use local
intrinsic dimensionality (LID) in layer-wise hidden representations of DNNs to
study adversarial subspaces. It was demonstrated that LID can be used to
characterize the adversarial subspaces associated with different attack
methods, e.g., the Carlini and Wagner's (C&W) attack and the fast gradient sign
attack.
In this paper, we use MNIST and CIFAR-10 to conduct two new sets of
experiments that are absent in existing LID analysis and report the limitation
of LID in characterizing the corresponding adversarial subspaces, which are (i)
oblivious attacks and LID analysis using adversarial examples with different
confidence levels; and (ii) black-box transfer attacks. For (i), we find that
the performance of LID is very sensitive to the confidence parameter deployed
by an attack, and the LID learned from ensembles of adversarial examples with
varying confidence levels surprisingly gives poor performance. For (ii), we
find that when adversarial examples are crafted from another DNN model, LID is
ineffective in characterizing their adversarial subspaces. These two findings
together suggest the limited capability of LID in characterizing the subspaces
of adversarial examples.
|
cs.LG cs.CR cs.CV stat.ML
|
understanding and characterizing the subspaces of adversarial examples aid in studying the robustness of deep neural networks dnns to adversarial perturbations very recently ma et al iclr 2018 proposed to use local intrinsic dimensionality lid in layerwise hidden representations of dnns to study adversarial subspaces it was demonstrated that lid can be used to characterize the adversarial subspaces associated with different attack methods eg the carlini and wagners cw attack and the fast gradient sign attack in this paper we use mnist and cifar10 to conduct two new sets of experiments that are absent in existing lid analysis and report the limitation of lid in characterizing the corresponding adversarial subspaces which are i oblivious attacks and lid analysis using adversarial examples with different confidence levels and ii blackbox transfer attacks for i we find that the performance of lid is very sensitive to the confidence parameter deployed by an attack and the lid learned from ensembles of adversarial examples with varying confidence levels surprisingly gives poor performance for ii we find that when adversarial examples are crafted from another dnn model lid is ineffective in characterizing their adversarial subspaces these two findings together suggest the limited capability of lid in characterizing the subspaces of adversarial examples
|
[['understanding', 'and', 'characterizing', 'the', 'subspaces', 'of', 'adversarial', 'examples', 'aid', 'in', 'studying', 'the', 'robustness', 'of', 'deep', 'neural', 'networks', 'dnns', 'to', 'adversarial', 'perturbations', 'very', 'recently', 'ma', 'et', 'al', 'iclr', '2018', 'proposed', 'to', 'use', 'local', 'intrinsic', 'dimensionality', 'lid', 'in', 'layerwise', 'hidden', 'representations', 'of', 'dnns', 'to', 'study', 'adversarial', 'subspaces', 'it', 'was', 'demonstrated', 'that', 'lid', 'can', 'be', 'used', 'to', 'characterize', 'the', 'adversarial', 'subspaces', 'associated', 'with', 'different', 'attack', 'methods', 'eg', 'the', 'carlini', 'and', 'wagners', 'cw', 'attack', 'and', 'the', 'fast', 'gradient', 'sign', 'attack', 'in', 'this', 'paper', 'we', 'use', 'mnist', 'and', 'cifar10', 'to', 'conduct', 'two', 'new', 'sets', 'of', 'experiments', 'that', 'are', 'absent', 'in', 'existing', 'lid', 'analysis', 'and', 'report', 'the', 'limitation', 'of', 'lid', 'in', 'characterizing', 'the', 'corresponding', 'adversarial', 'subspaces', 'which', 'are', 'i', 'oblivious', 'attacks', 'and', 'lid', 'analysis', 'using', 'adversarial', 'examples', 'with', 'different', 'confidence', 'levels', 'and', 'ii', 'blackbox', 'transfer', 'attacks', 'for', 'i', 'we', 'find', 'that', 'the', 'performance', 'of', 'lid', 'is', 'very', 'sensitive', 'to', 'the', 'confidence', 'parameter', 'deployed', 'by', 'an', 'attack', 'and', 'the', 'lid', 'learned', 'from', 'ensembles', 'of', 'adversarial', 'examples', 'with', 'varying', 'confidence', 'levels', 'surprisingly', 'gives', 'poor', 'performance', 'for', 'ii', 'we', 'find', 'that', 'when', 'adversarial', 'examples', 'are', 'crafted', 'from', 'another', 'dnn', 'model', 'lid', 'is', 'ineffective', 'in', 'characterizing', 'their', 'adversarial', 'subspaces', 'these', 'two', 'findings', 'together', 'suggest', 'the', 'limited', 'capability', 'of', 'lid', 'in', 'characterizing', 'the', 'subspaces', 'of', 'adversarial', 'examples']]
|
[-0.07312537000618549, 0.03811857733403353, -0.004387343128311258, 0.10015959025064519, -0.05374056252524329, -0.22872899088881982, 0.06336239515747243, 0.4102520098484763, -0.23921241724945025, -0.3074940023576452, 0.08571860542604519, -0.27126671010131037, -0.23221965205575368, 0.20342263215090356, -0.1842142048775607, 0.10225191100690405, 0.06955354278500292, -0.029206524320507368, -0.03029604558380845, -0.30141664046152195, 0.38227546612338786, 0.06814933881416207, 0.3084433866095123, -0.00702480145857796, 0.09240484832858359, -0.08807855311388972, -0.0025642772829069676, -0.025081441274310633, -0.06915698542208207, 0.13453782051892102, 0.3076689502427629, 0.17343648885223037, 0.32845281073043703, -0.4155583576597635, -0.21592213423669482, 0.09266757350234152, 0.11191740721551469, 0.15054594956562195, -0.0627477977682556, -0.3921452607887173, 0.12409732619484715, -0.169474802255739, -0.007354540551461062, -0.1652880718059006, -0.022573630314193738, 0.01562123144982446, -0.26762723285609913, 0.002876781430140644, 0.1478321686617632, 0.10503562038438846, -0.048667580345916804, -0.10617239503540297, -0.0391564804674081, 0.11760696863884997, 0.059484091335884975, 0.009933402882753283, 0.13250958128805154, -0.14794846031435052, -0.11585297807938084, 0.2906754315306333, -0.06651929462468703, -0.2242124015499286, 0.2428533651287333, -0.01927653313343169, -0.12913446436021297, 0.08690086847116936, 0.2624508895404361, 0.1103101827993139, -0.10516609555231554, 0.040915761519340996, -0.00492316310958557, 0.14602575461251335, 0.08236543664333491, -0.00776008780575493, 0.11091465551577942, 0.2126258832359578, 0.06072113348636776, 0.16927389683850672, -0.16410839617918066, -0.06869151778219638, -0.22355122616496478, -0.05667767506002367, -0.184935234069996, -0.007565636969921948, -0.08813895904221708, -0.12097220050930543, 0.40537477293344515, 0.22763071117190264, 0.2470823894345283, 0.09551126515386554, 0.3339384150040309, -0.0009715519664646353, 0.048066700642699044, 0.13405617545087578, 0.2631498222619078, 0.05887882884035737, 0.030106245594122335, -0.14641040408739694, 0.1254320474798131, 0.005488626206818136]
|
1,803.09639
|
On the multipacking number of grid graphs
|
In 2001, Erwin introduced broadcast domination in graphs. It is a variant of
classical domination where selected vertices may have different domination
powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted
$\gamma_b(G)$. The dual of this problem is called multipacking: a multipacking
is a set $M$ of vertices such that for any vertex $v$ and any positive integer
$r$, the ball of radius $r$ around $v$ contains at most $r$ vertices of $M$ .
The maximum size of a multipacking in a graph $G$ is denoted mp(G). Naturally
mp(G) $\leq \gamma_b(G)$. Earlier results by Farber and by Lubiw show that
broadcast and multipacking numbers are equal for strongly chordal graphs. In
this paper, we show that all large grids (height at least 4 and width at least
7), which are far from being chordal, have their broadcast and multipacking
numbers equal.
|
cs.DM math.CO
|
in 2001 erwin introduced broadcast domination in graphs it is a variant of classical domination where selected vertices may have different domination powers the minimum cost of a dominating broadcast in a graph g is denoted gamma_bg the dual of this problem is called multipacking a multipacking is a set m of vertices such that for any vertex v and any positive integer r the ball of radius r around v contains at most r vertices of m the maximum size of a multipacking in a graph g is denoted mpg naturally mpg leq gamma_bg earlier results by farber and by lubiw show that broadcast and multipacking numbers are equal for strongly chordal graphs in this paper we show that all large grids height at least 4 and width at least 7 which are far from being chordal have their broadcast and multipacking numbers equal
|
[['in', '2001', 'erwin', 'introduced', 'broadcast', 'domination', 'in', 'graphs', 'it', 'is', 'a', 'variant', 'of', 'classical', 'domination', 'where', 'selected', 'vertices', 'may', 'have', 'different', 'domination', 'powers', 'the', 'minimum', 'cost', 'of', 'a', 'dominating', 'broadcast', 'in', 'a', 'graph', 'g', 'is', 'denoted', 'gamma_bg', 'the', 'dual', 'of', 'this', 'problem', 'is', 'called', 'multipacking', 'a', 'multipacking', 'is', 'a', 'set', 'm', 'of', 'vertices', 'such', 'that', 'for', 'any', 'vertex', 'v', 'and', 'any', 'positive', 'integer', 'r', 'the', 'ball', 'of', 'radius', 'r', 'around', 'v', 'contains', 'at', 'most', 'r', 'vertices', 'of', 'm', 'the', 'maximum', 'size', 'of', 'a', 'multipacking', 'in', 'a', 'graph', 'g', 'is', 'denoted', 'mpg', 'naturally', 'mpg', 'leq', 'gamma_bg', 'earlier', 'results', 'by', 'farber', 'and', 'by', 'lubiw', 'show', 'that', 'broadcast', 'and', 'multipacking', 'numbers', 'are', 'equal', 'for', 'strongly', 'chordal', 'graphs', 'in', 'this', 'paper', 'we', 'show', 'that', 'all', 'large', 'grids', 'height', 'at', 'least', '4', 'and', 'width', 'at', 'least', '7', 'which', 'are', 'far', 'from', 'being', 'chordal', 'have', 'their', 'broadcast', 'and', 'multipacking', 'numbers', 'equal']]
|
[-0.22077801331620792, 0.17228542823175869, -0.021679878273400767, 0.0022322135070210387, -0.09477941842813944, -0.17697185519761566, 0.01953486231846157, 0.3309250537177612, -0.25348077157977966, -0.3263401422649622, 0.11255591557329071, -0.3459119396155764, -0.12176745896195543, 0.09061734590133459, -0.10954536717577741, -0.03235348721500486, 0.06784029276078117, 0.11968983507972082, 0.059235978386252476, -0.2890542581552993, 0.27606166317609365, -0.022122267749288986, 0.13136879520988543, 0.061926511485643425, 0.07619463915711847, 0.023888503474279725, 0.0006281831715223861, 0.10260925148132033, -0.1926608811108022, 0.04924378629757798, 0.24154846815970438, 0.1921914150392444, 0.28906279792045725, -0.3167745451218095, -0.15373848503423404, 0.206096615282626, 0.09991860762479361, -0.038376385179862124, 0.04772187859976086, -0.1751369114660112, 0.18767125495420448, -0.13853465991480082, -0.04660430107022844, 0.10520449219881718, 0.15958530074306604, 0.009737083232351418, -0.3159179840108444, -0.012366727543272206, 0.06110876620393889, 0.04135115564447538, 0.09261306054279979, -0.2169273925174413, -0.06177628690473221, 0.0357798820249094, -0.08463759174538327, 0.08977442752682314, -0.009042309715958504, -0.10183828288251695, -0.14092302385974548, 0.36119842691154314, -0.031091406812955594, -0.1204069234655592, 0.12170208847342893, -0.14446566134434322, -0.1443809859133486, 0.1425039732989309, 0.13134032581643812, 0.20232789417054375, -0.08790754153039948, 0.16040739842554042, -0.13317071530598634, 0.10035774187457844, 0.16571126819813045, 0.019668859118146115, 0.10896463277267998, 0.11333643917379708, 0.1690340938688866, 0.1651513677684526, -0.012244127061346482, 0.03056004215031862, -0.30175611272068886, -0.10023710019886493, -0.28249166290484495, 0.07210332401225279, -0.16375575683768115, -0.14316827018327755, 0.38047167592007536, 0.07324889140436426, 0.1966953516159014, 0.11072755987226064, 0.2258294226553548, 0.07652637559593382, 0.05359336954605733, 0.23476289271473372, 0.12351158171378333, 0.18372772112809893, -0.009045868810137797, -0.15926785523810522, 0.02121482963256281, 0.12311008324011646]
|
1,803.0964
|
Sturm-Liouville and Carroll: at the heart of the Memory Effect
|
For a plane gravitational wave whose profile is given, in Brinkmann coordinates, by a $2\times2$ symmetric traceless matrix $K(U)$, the matrix Sturm-Liouville equation $\ddot{P}=KP$ plays a multiple and central r\^ole: (i) it determines the isometries, (ii) it appears as the key tool for switching from Brinkmann to BJR coordinates and vice versa, (iii) it determines the trajectories of particles initially at rest. All trajectories can be obtained from trivial "Carrollian" ones by a suitable action of the (broken) Carrollian isometry group.
|
gr-qc hep-th math-ph math.MP
|
for a plane gravitational wave whose profile is given in brinkmann coordinates by a 2times2 symmetric traceless matrix ku the matrix sturmliouville equation ddotpkp plays a multiple and central role i it determines the isometries ii it appears as the key tool for switching from brinkmann to bjr coordinates and vice versa iii it determines the trajectories of particles initially at rest all trajectories can be obtained from trivial carrollian ones by a suitable action of the broken carrollian isometry group
|
[['for', 'a', 'plane', 'gravitational', 'wave', 'whose', 'profile', 'is', 'given', 'in', 'brinkmann', 'coordinates', 'by', 'a', '2times2', 'symmetric', 'traceless', 'matrix', 'ku', 'the', 'matrix', 'sturmliouville', 'equation', 'ddotpkp', 'plays', 'a', 'multiple', 'and', 'central', 'role', 'i', 'it', 'determines', 'the', 'isometries', 'ii', 'it', 'appears', 'as', 'the', 'key', 'tool', 'for', 'switching', 'from', 'brinkmann', 'to', 'bjr', 'coordinates', 'and', 'vice', 'versa', 'iii', 'it', 'determines', 'the', 'trajectories', 'of', 'particles', 'initially', 'at', 'rest', 'all', 'trajectories', 'can', 'be', 'obtained', 'from', 'trivial', 'carrollian', 'ones', 'by', 'a', 'suitable', 'action', 'of', 'the', 'broken', 'carrollian', 'isometry', 'group']]
|
[-0.1771890008356422, 0.15689585963264108, -0.08263940486358479, 0.054323263368860356, -0.10828436081646942, -0.18076507924706675, -0.02697911161085358, 0.3219852713868022, -0.27303689549444243, -0.23128939573653043, 0.116371969114698, -0.2670623523939867, -0.15418381053314079, 0.12955259011359885, -0.016503087198361754, -0.006864932470489293, 0.007914080278715119, 0.07495361698092892, -0.10687108068232191, -0.13449390936875716, 0.3627875528123695, 0.0451849480625242, 0.25920851606642825, -0.06578615242033266, 0.13483345367567381, 0.07219108872814103, -0.02938704304397106, 0.010560596264258492, -0.05074739526899066, 0.028577278653392567, 0.24128382965573109, 0.1262484407852753, 0.20288943811319768, -0.38260220002848655, -0.15988723235204816, 0.11436941701103934, 0.16302023050375283, 0.09198707040632144, -0.05240855854935944, -0.3279630439370521, 0.034940608113538475, -0.12937310754787176, -0.20906816818751395, -0.021793048269501014, 0.07918401779606939, -0.0191827376067522, -0.24037589485524222, 0.08260668948059902, 0.08104648200096562, 0.016471774387173354, -0.07341659085359424, -0.06547007818007841, -0.08585213022888638, 0.12573160651372745, 0.02806586413353216, 0.05983802825503517, 0.14488729918375612, -0.08596220841282047, -0.03094234840827994, 0.4374188925983617, -0.06176434851549857, -0.27460384463192894, 0.09801067434600555, -0.14034943817532622, -0.09622652404359541, 0.14477915421593934, 0.09002439522882924, 0.1391977410123218, -0.10653833879714511, 0.15251709404838037, -0.0434657336152668, 0.10936755142029142, 0.11805834425613285, -0.03580234244000167, 0.24116506624850445, 0.023759291030000896, 0.07490969629725441, 0.11426263972971355, 0.010963220521807671, -0.10308527318411506, -0.35153436361651985, -0.1682745839934796, -0.18183218493068126, 0.1104022147022988, -0.14005700662928575, -0.1344926445497549, 0.3829494332079776, 0.006870366976363585, 0.16294272066443227, 0.0015721210496849381, 0.20556368812685832, 0.11022395533509552, 0.05891428883769549, 0.10439510278520174, 0.21795376954833046, 0.1815057965068263, 0.0887926876777783, -0.2108499974827282, 0.0002831091987900436, 0.15783180987054948]
|
1,803.09641
|
Unsupervised Separation of Transliterable and Native Words for Malayalam
|
Differentiating intrinsic language words from transliterable words is a key
step aiding text processing tasks involving different natural languages. We
consider the problem of unsupervised separation of transliterable words from
native words for text in Malayalam language. Outlining a key observation on the
diversity of characters beyond the word stem, we develop an optimization method
to score words based on their nativeness. Our method relies on the usage of
probability distributions over character n-grams that are refined in step with
the nativeness scorings in an iterative optimization formulation. Using an
empirical evaluation, we illustrate that our method, DTIM, provides significant
improvements in nativeness scoring for Malayalam, establishing DTIM as the
preferred method for the task.
|
cs.CL
|
differentiating intrinsic language words from transliterable words is a key step aiding text processing tasks involving different natural languages we consider the problem of unsupervised separation of transliterable words from native words for text in malayalam language outlining a key observation on the diversity of characters beyond the word stem we develop an optimization method to score words based on their nativeness our method relies on the usage of probability distributions over character ngrams that are refined in step with the nativeness scorings in an iterative optimization formulation using an empirical evaluation we illustrate that our method dtim provides significant improvements in nativeness scoring for malayalam establishing dtim as the preferred method for the task
|
[['differentiating', 'intrinsic', 'language', 'words', 'from', 'transliterable', 'words', 'is', 'a', 'key', 'step', 'aiding', 'text', 'processing', 'tasks', 'involving', 'different', 'natural', 'languages', 'we', 'consider', 'the', 'problem', 'of', 'unsupervised', 'separation', 'of', 'transliterable', 'words', 'from', 'native', 'words', 'for', 'text', 'in', 'malayalam', 'language', 'outlining', 'a', 'key', 'observation', 'on', 'the', 'diversity', 'of', 'characters', 'beyond', 'the', 'word', 'stem', 'we', 'develop', 'an', 'optimization', 'method', 'to', 'score', 'words', 'based', 'on', 'their', 'nativeness', 'our', 'method', 'relies', 'on', 'the', 'usage', 'of', 'probability', 'distributions', 'over', 'character', 'ngrams', 'that', 'are', 'refined', 'in', 'step', 'with', 'the', 'nativeness', 'scorings', 'in', 'an', 'iterative', 'optimization', 'formulation', 'using', 'an', 'empirical', 'evaluation', 'we', 'illustrate', 'that', 'our', 'method', 'dtim', 'provides', 'significant', 'improvements', 'in', 'nativeness', 'scoring', 'for', 'malayalam', 'establishing', 'dtim', 'as', 'the', 'preferred', 'method', 'for', 'the', 'task']]
|
[-0.03294848582905149, -0.029073962032335473, -0.09720481658123631, 0.08942522177888922, -0.12469024994962774, -0.11465829268790188, 0.09241554182253581, 0.40757253529108334, -0.29097163790952313, -0.28964785336871196, 0.03485561737098393, -0.2831566301133253, -0.16057054843934895, 0.24249389047571665, -0.13228800836785704, 0.038699571529518716, 0.11545931410242234, 0.06548372296764787, -0.07268789296648341, -0.26093975244197104, 0.31852739648708034, 0.012445820602629564, 0.32297428433610276, 0.009465705067644605, 0.13208824113027845, 0.024763961563678046, -0.0723916083178689, -0.07682066623418204, -0.05823743409970136, 0.20568282515185562, 0.34204953135222, 0.2310386394651244, 0.33201228600176697, -0.34867303113791004, -0.16288684057566313, 0.039580497313785344, 0.15022271453295793, 0.12093631058428601, -0.05214229044689904, -0.3255662716496571, 0.081369524168477, -0.1504972567699388, 0.05076083277436633, -0.10269517251249172, 0.012507948628832808, 0.0013799688045298105, -0.2553661650219784, 0.060493181987080424, 0.12225621971260525, 0.12440755956732066, -0.055054148895031386, -0.17709735123259304, 0.08748562903085773, 0.1649388686292269, 0.06252226113615789, 0.06747658670245282, 0.10578646928286262, -0.13603668945915667, -0.19667331409533467, 0.40196305822449185, -0.06395625959323571, -0.23635721035235752, 0.17100254369825454, -0.00893934217149771, -0.19218864069790043, 0.0647551408284797, 0.19451656181826793, 0.11727222529099843, -0.12186508647174435, 0.024738397654784694, -0.04602232680087332, 0.22650384340039662, 0.10290912407310268, -0.012725594535931549, 0.19935843148073018, 0.26838432021636877, 0.013916417272283441, 0.13686917587677924, -0.08021724736111947, -0.06376513439865239, -0.2540938128857354, -0.19881330005488712, -0.1716696251991444, -0.06179365549294229, -0.12748286912250703, -0.18268940475175932, 0.4049342845245141, 0.2200455513589117, 0.14336809347820492, 0.1297385752019761, 0.2767672994198789, 0.0477961677722056, 0.08279368740226249, 0.03608227222158565, 0.07725960456053273, 0.01240104117092833, 0.08905267334580257, -0.18005780259196738, 0.11898254016331866, 0.13087926751447726]
|
1,803.09642
|
Active Colloidal Molecules
|
Like ordinary molecules are composed of atoms, colloidal molecules consist of
several species of colloidal particles tightly bound together. If one of these
components is self-propelled or swimming, novel "active colloidal molecules"
emerge. Active colloidal molecules exist on various levels such as
"homonuclear", "heteronuclear" and "polymeric" and possess a dynamical function
moving as propellers, spinners or rotors. Self-assembly of such active
complexes has been studied a lot recently and this perspective article
summarizes recent progress and gives an outlook to future developments in the
rapidly expanding field of active colloidal molecules.
|
cond-mat.soft
|
like ordinary molecules are composed of atoms colloidal molecules consist of several species of colloidal particles tightly bound together if one of these components is selfpropelled or swimming novel active colloidal molecules emerge active colloidal molecules exist on various levels such as homonuclear heteronuclear and polymeric and possess a dynamical function moving as propellers spinners or rotors selfassembly of such active complexes has been studied a lot recently and this perspective article summarizes recent progress and gives an outlook to future developments in the rapidly expanding field of active colloidal molecules
|
[['like', 'ordinary', 'molecules', 'are', 'composed', 'of', 'atoms', 'colloidal', 'molecules', 'consist', 'of', 'several', 'species', 'of', 'colloidal', 'particles', 'tightly', 'bound', 'together', 'if', 'one', 'of', 'these', 'components', 'is', 'selfpropelled', 'or', 'swimming', 'novel', 'active', 'colloidal', 'molecules', 'emerge', 'active', 'colloidal', 'molecules', 'exist', 'on', 'various', 'levels', 'such', 'as', 'homonuclear', 'heteronuclear', 'and', 'polymeric', 'and', 'possess', 'a', 'dynamical', 'function', 'moving', 'as', 'propellers', 'spinners', 'or', 'rotors', 'selfassembly', 'of', 'such', 'active', 'complexes', 'has', 'been', 'studied', 'a', 'lot', 'recently', 'and', 'this', 'perspective', 'article', 'summarizes', 'recent', 'progress', 'and', 'gives', 'an', 'outlook', 'to', 'future', 'developments', 'in', 'the', 'rapidly', 'expanding', 'field', 'of', 'active', 'colloidal', 'molecules']]
|
[-0.14234677031585066, 0.29683964682764064, -0.02183094977114636, -0.05908563438352648, -0.024403077785621632, -0.1878356820875574, -0.057154848597557435, 0.4076125154701563, -0.21257894105472408, -0.32665182046776453, 0.017606610149544264, -0.3045958350975435, -0.17024661497734897, 0.11875347407780341, -0.00034272728058008046, 0.061421525050568714, 0.02009139696051684, -0.0467748192272016, 0.05927506241701789, -0.19647556138071384, 0.20445011258841708, 0.01410879612808208, 0.21965321406189883, 0.04290787103985037, 0.1451062580780382, -0.009968866670893117, 0.06835754805725518, 0.02267920182490783, -0.1790874322545638, 0.1867157878395129, 0.2510702324990224, 0.030910523140107046, 0.23512634110974742, -0.5349879051343753, -0.251316501976152, 0.12287499497716244, 0.23253187914583628, 0.15462114534210952, -0.17337205546913198, -0.26493776011393294, -0.05132071762332938, -0.15786787420530435, -0.15509062002484614, -0.1009905109959808, 0.07332682697189419, 0.17177986567532952, -0.16310843314648002, 0.042797078767402484, 0.06705145681485442, 0.12219329215176813, -0.07135004090186167, -0.15245489609826887, 0.01863184641755012, 0.10242888841593822, 0.05879659418548856, 0.02144995784632616, 0.32837648688211707, -0.15173869415002128, -0.11849096923002175, 0.4213572400775585, -0.01678458687588368, -0.17099602268957584, 0.33709604752628686, -0.08116763941994817, -0.18279219925874374, 0.18438287047607885, 0.20256191781711774, 0.14922112804980806, -0.143423752408925, 0.02119807618322199, -0.09058028740992585, 0.15587218339135359, 0.08955780158310638, 0.07931076594024569, 0.33128720333103784, 0.229723951032201, 0.029096792776257204, 0.17429395213436621, -0.03408118076161942, -0.1707784573644768, -0.12611918864710317, -0.22448748851432926, -0.16109788335429934, 0.028347141181047145, -0.006153066181398641, -0.17721244344835754, 0.3162671195670635, 0.008977052382741041, 0.17244919207315523, -0.04130907857196999, 0.2320622894708272, -0.04019452408621354, 0.026026481455499, -0.030392815257872935, 0.2797412264805574, 0.1458039993834733, 0.07854716072196734, -0.17220320678405607, 0.03442395280580968, 0.04219858395127621]
|
1,803.09643
|
On the Orderability Problem and the Interval Topology
|
The class of LOTS (linearly ordered topological spaces, i.e. spaces equipped
with a topology generated by a linear order) contains many important spaces,
like the set of real numbers, the set of rational numbers and the ordinals.
Such spaces have rich topological properties, which are not necessarily
hereditary. The Orderability Problem, a very important question on whether a
topological space admits a linear order which generates a topology equal to the
topology of the space, was given a general solution by J. van Dalen and E.
Wattel, in 1973. In this article we first investigate the role of the interval
topology in van Dalen's and Wattel's characterization of LOTS, and we then
examine ways to extend this model to transitive relations that are not
necessarily linear orders.
|
math.GN
|
the class of lots linearly ordered topological spaces ie spaces equipped with a topology generated by a linear order contains many important spaces like the set of real numbers the set of rational numbers and the ordinals such spaces have rich topological properties which are not necessarily hereditary the orderability problem a very important question on whether a topological space admits a linear order which generates a topology equal to the topology of the space was given a general solution by j van dalen and e wattel in 1973 in this article we first investigate the role of the interval topology in van dalens and wattels characterization of lots and we then examine ways to extend this model to transitive relations that are not necessarily linear orders
|
[['the', 'class', 'of', 'lots', 'linearly', 'ordered', 'topological', 'spaces', 'ie', 'spaces', 'equipped', 'with', 'a', 'topology', 'generated', 'by', 'a', 'linear', 'order', 'contains', 'many', 'important', 'spaces', 'like', 'the', 'set', 'of', 'real', 'numbers', 'the', 'set', 'of', 'rational', 'numbers', 'and', 'the', 'ordinals', 'such', 'spaces', 'have', 'rich', 'topological', 'properties', 'which', 'are', 'not', 'necessarily', 'hereditary', 'the', 'orderability', 'problem', 'a', 'very', 'important', 'question', 'on', 'whether', 'a', 'topological', 'space', 'admits', 'a', 'linear', 'order', 'which', 'generates', 'a', 'topology', 'equal', 'to', 'the', 'topology', 'of', 'the', 'space', 'was', 'given', 'a', 'general', 'solution', 'by', 'j', 'van', 'dalen', 'and', 'e', 'wattel', 'in', '1973', 'in', 'this', 'article', 'we', 'first', 'investigate', 'the', 'role', 'of', 'the', 'interval', 'topology', 'in', 'van', 'dalens', 'and', 'wattels', 'characterization', 'of', 'lots', 'and', 'we', 'then', 'examine', 'ways', 'to', 'extend', 'this', 'model', 'to', 'transitive', 'relations', 'that', 'are', 'not', 'necessarily', 'linear', 'orders']]
|
[-0.16577096019939677, 0.14646756092637278, -0.046812703857592085, 0.09353243779746921, -0.10840189152177636, -0.08246252048624361, 0.03053528664073324, 0.33476823056495286, -0.31152589328405333, -0.2553247396183026, 0.10673304604710936, -0.2806935863402801, -0.18490979723571763, 0.20470701454669177, -0.08437042259062238, 0.02689971587416239, 0.012780870644118243, 0.07049898205824741, -0.07431360831431197, -0.28954856074983026, 0.4097238633917963, -0.033907107399337416, 0.23579592762701404, 0.015232710084476606, 0.10434870269505413, 0.016871238637495997, -0.029849821031547902, 0.11680737999409846, -0.18353137429984623, 0.14981053923199908, 0.27833922012762086, 0.07481612155698543, 0.28569192141748784, -0.3636754675791031, -0.19213948801644448, 0.17350466410076715, 0.07154111489353085, 0.030597206649968657, -0.01685219436668132, -0.26698725691776937, 0.12159177594878749, -0.16185015167452288, -0.08928351274623376, -0.1112253825725397, 0.07300715749644167, 0.019432823563645767, -0.22523030799972574, -0.050724109657472226, 0.1446501816645628, 0.05469990837410456, -0.049573094894488655, -0.03566896871046534, -0.04449011183275682, 0.10909330453042214, -0.01880815787793599, 0.049633710002488785, 0.023945037133582845, -0.08794710234094343, -0.14050115870947882, 0.4027300036353309, -0.009271774829054872, -0.23853687926127418, 0.2087614383828652, -0.154508928261031, -0.15143267849906977, 0.09955384503156553, 0.13754259526154133, 0.12209870271210567, -0.06547133497348646, 0.18135902173324994, -0.09852816275963598, 0.14755759854816142, 0.0787354207150941, 0.06961860605070701, 0.18748136635915172, 0.13148393315770399, 0.11602522275832716, 0.14392246764410682, 0.014914535760228349, -0.06703555949573685, -0.3069419480587651, -0.15631788134256877, -0.1597815907552717, 0.08570613039915859, -0.04054072153957076, -0.24105839925719713, 0.40537791474290735, 0.07622793013214822, 0.20994925421730773, 0.043162251294522384, 0.2145739046637181, 0.059884285514774864, 0.017312463372945786, 0.061648163062376464, 0.15659713638734404, 0.15075145425403688, 0.044687989921256055, -0.12741480702988622, 0.06402430574341518, 0.1573395647214559]
|
1,803.09644
|
Effect of thresholds on the width of three-body resonances
|
It has been recently reported an intriguing theoretical result of a narrow
three-body resonance with a large available phase space. The resonance was
reported in the $N\Lambda\Lambda-\Xi NN$ system near the $\Xi d$ threshold,
having a very small width in spite of the open $N\Lambda\Lambda$ channel lying
around 23 MeV below the $\Xi NN$ channel. We use first-order perturbation
theory as a plausible argument to explain this behavior. We apply our result to
realistic local interactions. Other systems involving several thresholds are
likely to follow the same behavior.
|
nucl-th hep-ph
|
it has been recently reported an intriguing theoretical result of a narrow threebody resonance with a large available phase space the resonance was reported in the nlambdalambdaxi nn system near the xi d threshold having a very small width in spite of the open nlambdalambda channel lying around 23 mev below the xi nn channel we use firstorder perturbation theory as a plausible argument to explain this behavior we apply our result to realistic local interactions other systems involving several thresholds are likely to follow the same behavior
|
[['it', 'has', 'been', 'recently', 'reported', 'an', 'intriguing', 'theoretical', 'result', 'of', 'a', 'narrow', 'threebody', 'resonance', 'with', 'a', 'large', 'available', 'phase', 'space', 'the', 'resonance', 'was', 'reported', 'in', 'the', 'nlambdalambdaxi', 'nn', 'system', 'near', 'the', 'xi', 'd', 'threshold', 'having', 'a', 'very', 'small', 'width', 'in', 'spite', 'of', 'the', 'open', 'nlambdalambda', 'channel', 'lying', 'around', '23', 'mev', 'below', 'the', 'xi', 'nn', 'channel', 'we', 'use', 'firstorder', 'perturbation', 'theory', 'as', 'a', 'plausible', 'argument', 'to', 'explain', 'this', 'behavior', 'we', 'apply', 'our', 'result', 'to', 'realistic', 'local', 'interactions', 'other', 'systems', 'involving', 'several', 'thresholds', 'are', 'likely', 'to', 'follow', 'the', 'same', 'behavior']]
|
[-0.16878100325642476, 0.124894017414036, -0.07863380995795838, 0.11298186048710097, -0.04331051152976947, -0.1710567449797587, 0.0669624377778014, 0.3580883352578371, -0.22136049721143797, -0.3231938340829621, 0.04474340572393896, -0.30507282189082824, -0.10910341941119953, 0.14165510150507607, 0.018831643436489433, 0.07947623290806666, 0.05603958562487501, 0.08618091687228231, -0.0392276999465693, -0.18499525084063925, 0.3022009036075538, 0.04638470839923141, 0.20527654892668643, 0.09539391424228576, 0.01131358697753528, -0.014347277498729098, 0.07215962081815748, -0.029085490767290046, -0.1641331959526515, 0.06435475241521309, 0.2300068975677821, 0.029602014585451662, 0.24830860082573933, -0.3438525039103182, -0.22289058816587104, 0.09019493619943487, 0.16148379085125167, 0.14815320221482423, -0.03589494907746798, -0.29627808591286686, 0.10521345510115397, -0.15820897111519314, -0.1971726687518002, -0.04586335812192196, 0.05828094293481146, -0.018725786020915056, -0.2570826468411191, 0.08350608008646074, 0.07081026554471631, 0.06000038240661566, -0.05320707413678368, -0.15538115153790333, 0.044169782085515474, 0.08571933997773576, 0.04636700907936213, 0.07987339305959043, 0.11695440045033378, -0.08782302498636047, -0.07799382052844626, 0.33638243175957394, -0.07060616240494125, -0.10864590431413688, 0.23269216799921216, -0.16681039552793078, -0.1365692612458149, 0.17804716508996127, 0.15456535449872413, 0.09928927419107707, -0.13692092497019503, 0.07556990686076126, -0.05097941665685382, 0.18935664490951845, 0.06638908531281283, 0.03793951146433066, 0.15200767263598824, 0.19660618371629937, -0.00028414843368461764, 0.10529423314588272, -0.10779193767357147, -0.13933054898362393, -0.2967966753861, -0.04739007428716654, -0.1576367079644282, 0.03717173899700544, -0.030785316943951035, -0.12905751043481045, 0.3310923872611903, 0.12265383679320736, 0.3012738887049343, 0.0021071059110135525, 0.2374496685458754, 0.12746298218402882, 0.09851537110690756, 0.03590328101839485, 0.3170664567800089, 0.15717797604357375, 0.11468539186271615, -0.18580555768105492, 0.053540899225607, -0.019570107743058396]
|
1,803.09645
|
Teaching Light Polarization by Putting Art and Physics Together
|
Light Polarization has many technological applications and its discovery was
crucial to reveal the transverse nature of the electromagnetic waves. However,
despite its fundamental and practical importance, in high school this property
of light is often neglected. This is a pity not only for its conceptual
relevance, but also because polarization gives the possibility to perform many
beautiful experiments with low cost materials. Moreover, the treatment of this
matter lends very well to an interdisciplinary approach, between art, biology
and technology, which usually makes things more interesting to students. For
these reasons we have developed a laboratory on light polarization for high
school and undergraduate students. They can see beautiful pictures when
birefringent materials are set between two crossed polarizing filters. The
colourful images remind them of those ones of abstract painting or alien
landscapes. With this multidisciplinary teaching method students are more
engaged and participative and also the learning process of the respective
physics concepts is more effective.
|
physics.ed-ph physics.optics
|
light polarization has many technological applications and its discovery was crucial to reveal the transverse nature of the electromagnetic waves however despite its fundamental and practical importance in high school this property of light is often neglected this is a pity not only for its conceptual relevance but also because polarization gives the possibility to perform many beautiful experiments with low cost materials moreover the treatment of this matter lends very well to an interdisciplinary approach between art biology and technology which usually makes things more interesting to students for these reasons we have developed a laboratory on light polarization for high school and undergraduate students they can see beautiful pictures when birefringent materials are set between two crossed polarizing filters the colourful images remind them of those ones of abstract painting or alien landscapes with this multidisciplinary teaching method students are more engaged and participative and also the learning process of the respective physics concepts is more effective
|
[['light', 'polarization', 'has', 'many', 'technological', 'applications', 'and', 'its', 'discovery', 'was', 'crucial', 'to', 'reveal', 'the', 'transverse', 'nature', 'of', 'the', 'electromagnetic', 'waves', 'however', 'despite', 'its', 'fundamental', 'and', 'practical', 'importance', 'in', 'high', 'school', 'this', 'property', 'of', 'light', 'is', 'often', 'neglected', 'this', 'is', 'a', 'pity', 'not', 'only', 'for', 'its', 'conceptual', 'relevance', 'but', 'also', 'because', 'polarization', 'gives', 'the', 'possibility', 'to', 'perform', 'many', 'beautiful', 'experiments', 'with', 'low', 'cost', 'materials', 'moreover', 'the', 'treatment', 'of', 'this', 'matter', 'lends', 'very', 'well', 'to', 'an', 'interdisciplinary', 'approach', 'between', 'art', 'biology', 'and', 'technology', 'which', 'usually', 'makes', 'things', 'more', 'interesting', 'to', 'students', 'for', 'these', 'reasons', 'we', 'have', 'developed', 'a', 'laboratory', 'on', 'light', 'polarization', 'for', 'high', 'school', 'and', 'undergraduate', 'students', 'they', 'can', 'see', 'beautiful', 'pictures', 'when', 'birefringent', 'materials', 'are', 'set', 'between', 'two', 'crossed', 'polarizing', 'filters', 'the', 'colourful', 'images', 'remind', 'them', 'of', 'those', 'ones', 'of', 'abstract', 'painting', 'or', 'alien', 'landscapes', 'with', 'this', 'multidisciplinary', 'teaching', 'method', 'students', 'are', 'more', 'engaged', 'and', 'participative', 'and', 'also', 'the', 'learning', 'process', 'of', 'the', 'respective', 'physics', 'concepts', 'is', 'more', 'effective']]
|
[-0.04862401654589452, 0.14741942411482278, -0.12139905232397265, 0.09750167103365524, -0.18703741063773865, -0.171715858143479, 0.01999418172727591, 0.4208580247776688, -0.24463923744719662, -0.37326389683539385, 0.06416615480396007, -0.2814728781440348, -0.20575315280489437, 0.23632957208381802, -0.10196691317448639, 0.01292469563532281, 0.06394050503369281, -1.873041549990387e-05, -0.03559522059893985, -0.26351487100410453, 0.26453275337255905, 0.07844435981893619, 0.3096899380951347, 0.08972927082019548, 0.09080651132448476, 0.012235624509213387, -0.04371838941115816, -0.015614895905666757, -0.053856819024625815, 0.1672566755668922, 0.3561270007711349, 0.15205426818292891, 0.33699793366527875, -0.4215264236847372, -0.1827535332420712, 0.08314164833651867, 0.10001356494774069, 0.11705626058465445, -0.09020919754942688, -0.279980172813173, 0.01694671898998273, -0.12760075412210334, -0.12057267807924874, -0.11518089614483475, 0.0322881747841097, -0.013611934075290162, -0.1645199415429917, -0.0031191042099812847, 0.05309334747074465, 0.11757522831383929, -0.002779248887350865, -0.14760089028368956, 0.0010686667472030382, 0.13037277502831476, 0.07249923423280406, 0.0035182697882981235, 0.12254067311801438, -0.2083082452032762, -0.11536655540844577, 0.431169546056984, 0.04880257307862242, -0.1583400164956356, 0.27683233231622373, -0.1618767676248256, -0.11058545646802434, 0.11168613062831778, 0.17507124469987462, 0.09095552972539507, -0.1503606287338046, 0.046043322924795446, 0.0060074037283588694, 0.1276177355738462, 0.0700321641308402, 0.0619182345917179, 0.2684374587235492, 0.18512532484143646, 0.009784715297725637, 0.07780253225000305, -0.009943668509624113, -0.05951247278472069, -0.24183388805579184, -0.1855204753989922, -0.1534879267532027, 0.024995513651435815, -0.031165939366313886, -0.13579986979760253, 0.37705840359576653, 0.1759452504902469, 0.10300636014742952, -0.02864877725497427, 0.30186783665873157, 0.04432617267822545, 0.05006908431192333, 0.037872408308768236, 0.24937152786402958, 0.12746714028887124, 0.18626561665427196, -0.12427750002569372, 0.08326588394764647, -0.037363921628010006]
|
1,803.09646
|
On Existence and Uniqueness of Formal Power Series Solutions of
Algebraic Ordinary Differential Equations
|
Given an algebraic ordinary differential equation (AODE), we propose a
computational method to determine when a truncated power series can be extended
to a formal power series solution. If a certain regularity condition on the
given AODE or on the initial values is fulfilled, we compute all of the
solutions. Moreover, when the existence is confirmed, we present the algebraic
structure of the set of all formal power series solutions.
|
cs.SC
|
given an algebraic ordinary differential equation aode we propose a computational method to determine when a truncated power series can be extended to a formal power series solution if a certain regularity condition on the given aode or on the initial values is fulfilled we compute all of the solutions moreover when the existence is confirmed we present the algebraic structure of the set of all formal power series solutions
|
[['given', 'an', 'algebraic', 'ordinary', 'differential', 'equation', 'aode', 'we', 'propose', 'a', 'computational', 'method', 'to', 'determine', 'when', 'a', 'truncated', 'power', 'series', 'can', 'be', 'extended', 'to', 'a', 'formal', 'power', 'series', 'solution', 'if', 'a', 'certain', 'regularity', 'condition', 'on', 'the', 'given', 'aode', 'or', 'on', 'the', 'initial', 'values', 'is', 'fulfilled', 'we', 'compute', 'all', 'of', 'the', 'solutions', 'moreover', 'when', 'the', 'existence', 'is', 'confirmed', 'we', 'present', 'the', 'algebraic', 'structure', 'of', 'the', 'set', 'of', 'all', 'formal', 'power', 'series', 'solutions']]
|
[-0.17475421567048346, -0.021528773992447115, -0.12487627549895218, 0.057976759428025354, -0.13158838776871562, -0.09904805283461299, 0.01563020393451942, 0.28396165746131113, -0.32641180511564016, -0.24185846796525376, 0.15774708097201906, -0.2640756902417966, -0.1201997553829902, 0.20082319361224238, -0.0619714956464512, 0.0729022716889241, 0.04258015584865851, 0.09455948466035936, -0.08158188224104898, -0.278584894215289, 0.35830166575365835, -0.016132581579898084, 0.24112644311306733, 0.006060449479679976, 0.14622775837779045, -0.051929960985268864, 0.0009855747755084718, 0.05524957988943372, -0.1614886036275753, 0.10927965954345252, 0.24310175880257573, 0.1336360554743026, 0.28294219236621365, -0.4195543607430799, -0.1411753695724266, 0.13634486629161985, 0.11562913673530732, 0.08142803990215595, -0.027695490429843112, -0.210524529378329, 0.1673195619136095, -0.18810416436088936, -0.16854821292550437, -0.14101589399256875, -0.0007675191387534142, 0.05860708192256944, -0.31892711845908445, 0.02269905475633485, 0.039570569592927186, 0.06797035888635687, -0.10813337609704052, -0.05508427814513977, 0.01189427224786154, 0.05696271720558538, 0.005993877384545547, -0.05540011192538909, 0.03674239944001394, -0.11139037388243846, -0.05464617559420211, 0.35677729339471886, -0.05729666490141036, -0.2597639547128763, 0.12318968214094639, -0.1560351944129382, -0.14971072009897657, 0.11971901457623711, 0.11901020776214344, 0.1502077956950026, -0.10899377410325022, 0.12226995228390608, -0.06769158435719354, 0.1882950252853334, 0.07908265058483396, -0.04534311153526817, 0.14182958493807485, 0.1125890452348228, 0.0827736707537302, 0.1407524442682708, -0.0023888620281858103, -0.05728473111188837, -0.35717425188049673, -0.13938364097682227, -0.15302725349486407, 0.12316501666459122, -0.10089516430827124, -0.20086517685226032, 0.4276835267298988, 0.09140322549002511, 0.19365750652338778, 0.1104289550899661, 0.27974242589968656, 0.26466348225637504, -0.021203909275521127, 0.08507600652852229, 0.161211402288505, 0.11655059327437942, 0.07024251527286002, -0.18534639896824956, 0.06230591891466507, 0.13525092404867922]
|
1,803.09647
|
Ion Diffusion and Acceleration in Plasma Turbulence
|
Particle transport, acceleration and energisation are phenomena of major
importance for both space and laboratory plasmas. Despite years of study, an
accurate theoretical description of these effects is still lacking. Validating
models with self-consistent, kinetic simulations represents today a new
challenge for the description of weakly-collisional, turbulent plasmas. We
perform two-dimensional (2D) hybrid-PIC simulations of steady-state turbulence
to study the processes of diffusion and acceleration. The chosen plasma
parameters allow to span different systems, going from the solar corona to the
solar wind, from the Earth's magnetosheath to confinement devices. To describe
the ion diffusion, we adapted the Nonlinear Guiding Center (NLGC) theory to the
2D case. Finally, we investigated the local influence of coherent structures on
particle energisation and acceleration: current sheets play an important role
if the ions Larmor radii are on the order of the current sheets size. This
resonance-like process leads to the violation of the magnetic moment
conservation, eventually enhancing the velocity-space diffusion.
|
physics.plasm-ph
|
particle transport acceleration and energisation are phenomena of major importance for both space and laboratory plasmas despite years of study an accurate theoretical description of these effects is still lacking validating models with selfconsistent kinetic simulations represents today a new challenge for the description of weaklycollisional turbulent plasmas we perform twodimensional 2d hybridpic simulations of steadystate turbulence to study the processes of diffusion and acceleration the chosen plasma parameters allow to span different systems going from the solar corona to the solar wind from the earths magnetosheath to confinement devices to describe the ion diffusion we adapted the nonlinear guiding center nlgc theory to the 2d case finally we investigated the local influence of coherent structures on particle energisation and acceleration current sheets play an important role if the ions larmor radii are on the order of the current sheets size this resonancelike process leads to the violation of the magnetic moment conservation eventually enhancing the velocityspace diffusion
|
[['particle', 'transport', 'acceleration', 'and', 'energisation', 'are', 'phenomena', 'of', 'major', 'importance', 'for', 'both', 'space', 'and', 'laboratory', 'plasmas', 'despite', 'years', 'of', 'study', 'an', 'accurate', 'theoretical', 'description', 'of', 'these', 'effects', 'is', 'still', 'lacking', 'validating', 'models', 'with', 'selfconsistent', 'kinetic', 'simulations', 'represents', 'today', 'a', 'new', 'challenge', 'for', 'the', 'description', 'of', 'weaklycollisional', 'turbulent', 'plasmas', 'we', 'perform', 'twodimensional', '2d', 'hybridpic', 'simulations', 'of', 'steadystate', 'turbulence', 'to', 'study', 'the', 'processes', 'of', 'diffusion', 'and', 'acceleration', 'the', 'chosen', 'plasma', 'parameters', 'allow', 'to', 'span', 'different', 'systems', 'going', 'from', 'the', 'solar', 'corona', 'to', 'the', 'solar', 'wind', 'from', 'the', 'earths', 'magnetosheath', 'to', 'confinement', 'devices', 'to', 'describe', 'the', 'ion', 'diffusion', 'we', 'adapted', 'the', 'nonlinear', 'guiding', 'center', 'nlgc', 'theory', 'to', 'the', '2d', 'case', 'finally', 'we', 'investigated', 'the', 'local', 'influence', 'of', 'coherent', 'structures', 'on', 'particle', 'energisation', 'and', 'acceleration', 'current', 'sheets', 'play', 'an', 'important', 'role', 'if', 'the', 'ions', 'larmor', 'radii', 'are', 'on', 'the', 'order', 'of', 'the', 'current', 'sheets', 'size', 'this', 'resonancelike', 'process', 'leads', 'to', 'the', 'violation', 'of', 'the', 'magnetic', 'moment', 'conservation', 'eventually', 'enhancing', 'the', 'velocityspace', 'diffusion']]
|
[-0.10822711827357218, 0.18815896192880913, -0.015282445711001187, 0.08504031798063899, -0.03621295120720339, -0.05242413890996028, -0.04444470331536995, 0.34192716290207603, -0.27313679212680725, -0.2946226860557188, 0.02252665347024751, -0.25137929859717784, -0.0667299613433218, 0.22658137300588144, 0.01687086950191827, 0.05328699892174594, 0.06951999440465029, -0.04686600129308674, -0.016959991772464607, -0.16027756684601213, 0.27196229862408783, 0.17023434326689266, 0.27804899061853183, 0.05647809556508555, 0.08916656958245778, -0.05631495864849679, -0.009565105346396943, 0.02549381959056806, -0.183686559815295, 0.09529317281676067, 0.18268806003786117, 0.03858735442862999, 0.2533411597891982, -0.5225765252090944, -0.2736349519330395, 0.017401766880780836, 0.16672666786150872, 0.11635739545491111, -0.08636323463457601, -0.22595510665692767, 0.0252516242038883, -0.1445595733570878, -0.1504127764646104, -0.06336859077630753, 0.031312593534482715, 0.04228581442450515, -0.27898575822952426, 0.10441232130780251, 0.0609909308974077, 0.05606899072144982, -0.10471496272279919, -0.07794852189784515, -0.010505613621141573, 0.13004752629454236, 0.07942242191679322, -0.005489477378064236, 0.21799606265046315, -0.14831562185088243, -0.08024598416117833, 0.4353151673073821, -0.024351678302001703, -0.15122327852929365, 0.23321095763711566, -0.21433222531989404, -0.09461010789021236, 0.14082580373351333, 0.20513228532162647, 0.08839430841853065, -0.13518574387365598, 0.04511322369474823, -0.022128595849734884, 0.09639304426850628, 0.02546839590797413, 0.012558145268784859, 0.26212262519918195, 0.21680971075592068, 0.037856790275442635, 0.05644482898511526, -0.1342667102595626, -0.1204442488857769, -0.2784228399454887, -0.15841938123057958, -0.11651016748952385, 0.05865554388813657, -0.05499787460622095, -0.18701125785732006, 0.3925559340056645, 0.22896806269153197, 0.13578125888693937, -0.06052348979076819, 0.29197113628239857, 0.11476658618731919, 0.009607971209702613, 0.08533910159139504, 0.28332559000464935, 0.1922764564463515, 0.15148742769732834, -0.2732105959999623, 0.045006782364666084, 0.07328852518208183]
|
1,803.09648
|
Tunable Snell's law for spin waves in heterochiral magnetic films
|
Thin ferromagnetic films with an interfacially induced DMI exhibit nontrivial
asymmetric dispersion relations that lead to unique and useful magnonic
properties. Here we derive an analytical expression for the magnon propagation
angle within the micromagnetic framework and show how the dispersion relation
can be approximated with a comprehensible geometrical interpretation in the
k-space of the propagation of spin waves. We further explore the refraction of
spin waves at DMI interfaces in heterochiral magnetic films, after deriving a
generalized Snell's law tunable by an in-plane magnetic field, that yields
analytical expressions for critical incident angles. The found asymmetric
Brewster angles at interfaces of regions with different DMI strengths,
adjustable by magnetic field, support the conclusion that heterochiral
ferromagnetic structures are an ideal platform for versatile spin-wave guides.
|
cond-mat.mtrl-sci
|
thin ferromagnetic films with an interfacially induced dmi exhibit nontrivial asymmetric dispersion relations that lead to unique and useful magnonic properties here we derive an analytical expression for the magnon propagation angle within the micromagnetic framework and show how the dispersion relation can be approximated with a comprehensible geometrical interpretation in the kspace of the propagation of spin waves we further explore the refraction of spin waves at dmi interfaces in heterochiral magnetic films after deriving a generalized snells law tunable by an inplane magnetic field that yields analytical expressions for critical incident angles the found asymmetric brewster angles at interfaces of regions with different dmi strengths adjustable by magnetic field support the conclusion that heterochiral ferromagnetic structures are an ideal platform for versatile spinwave guides
|
[['thin', 'ferromagnetic', 'films', 'with', 'an', 'interfacially', 'induced', 'dmi', 'exhibit', 'nontrivial', 'asymmetric', 'dispersion', 'relations', 'that', 'lead', 'to', 'unique', 'and', 'useful', 'magnonic', 'properties', 'here', 'we', 'derive', 'an', 'analytical', 'expression', 'for', 'the', 'magnon', 'propagation', 'angle', 'within', 'the', 'micromagnetic', 'framework', 'and', 'show', 'how', 'the', 'dispersion', 'relation', 'can', 'be', 'approximated', 'with', 'a', 'comprehensible', 'geometrical', 'interpretation', 'in', 'the', 'kspace', 'of', 'the', 'propagation', 'of', 'spin', 'waves', 'we', 'further', 'explore', 'the', 'refraction', 'of', 'spin', 'waves', 'at', 'dmi', 'interfaces', 'in', 'heterochiral', 'magnetic', 'films', 'after', 'deriving', 'a', 'generalized', 'snells', 'law', 'tunable', 'by', 'an', 'inplane', 'magnetic', 'field', 'that', 'yields', 'analytical', 'expressions', 'for', 'critical', 'incident', 'angles', 'the', 'found', 'asymmetric', 'brewster', 'angles', 'at', 'interfaces', 'of', 'regions', 'with', 'different', 'dmi', 'strengths', 'adjustable', 'by', 'magnetic', 'field', 'support', 'the', 'conclusion', 'that', 'heterochiral', 'ferromagnetic', 'structures', 'are', 'an', 'ideal', 'platform', 'for', 'versatile', 'spinwave', 'guides']]
|
[-0.20950472799992736, 0.20947812775950067, -0.07832955439678496, 0.02151406225600531, -0.15074810564577107, -0.13976859983559403, 0.00598248132755832, 0.4691964334083928, -0.2735391360585622, -0.28817304058207405, -0.047300589672337835, -0.23125824308584605, -0.1599811437906557, 0.24797980701883457, 0.10200367125290787, 0.0036926916800439358, -0.043479515211878435, -0.07823423786266219, -0.0706541540954883, -0.08207668711076535, 0.2783176038998164, 0.006487947240996632, 0.3369287565786628, 0.0949330571743231, 0.061147992417866746, 0.03411737388916432, 0.12435529758185444, 0.047402160681991115, -0.2080049660150493, 0.06959497833362085, 0.24666644647044855, -0.08833772125875666, 0.11847288252431012, -0.494051093220829, -0.19722872920009116, -0.04741122971274077, 0.16855177806232066, 0.15795298319564954, -0.0993116621412189, -0.3151426389813423, 0.05310903765660312, -0.13969909263929972, -0.21427807837931645, -0.10420794481234182, 0.016242888314457284, 0.004293771686091546, -0.2721293081232857, 0.06745801910310836, 0.08413515918812389, 0.11928985221681022, -0.07672056469268032, -0.1009925403225694, -0.0890428098436031, 0.05791698728081963, 0.05156499970545401, 0.019141963594371363, 0.12669034876550236, -0.13287252188468027, -0.12945542172602717, 0.3139371533863365, -0.03767617593800265, -0.18137999610709293, 0.10582045408054477, -0.15017105934038272, 0.0007314493709672538, 0.16492426715835573, 0.1468578064518552, 0.06950532097032429, -0.15190751867605343, 0.05157231563048083, -0.018474787724063923, 0.17692758056468197, 0.09755777880468125, 0.046941654643021705, 0.31429926073917797, 0.14188226618312505, 0.026848427493066068, 0.15328149992643694, -0.09502593378466184, -0.011523840778935996, -0.25074395996570176, -0.15019254117376274, -0.1769063400505628, 0.023952803785158766, -0.17419398647140794, -0.19534939191200668, 0.37406759524518357, 0.16463490588856594, 0.10967708799973248, 0.007087823890504383, 0.2650639011657664, 0.12881543473266657, 0.046930228724026135, 0.062101822547865886, 0.30512933616363813, 0.20706288639219508, 0.12502427703882513, -0.25687441505151726, 0.0968897511354751, -0.014068976813365542]
|
1,803.09649
|
Entropy in the interior of a Kerr black hole
|
Christodoulou and Rovelli have shown that the maximal interior volume of a
Schwarzschild black hole linearly grows with time. Recently, their conclusion
has been extended to the Reissner{-}Nordstr$\ddot{\text{o}}$m and Kerr black
holes. Meanwhile, the entropy of interior volume in a Schwarzschild black hole
has also been calculated. Here, a new method calculating the entropy of
interior volume of the black hole is given and it can be used in more general
cases. Using this method, the entropy associated with the volume of a Kerr
black hole is calculated and it is found that the entropy is proportional to
the Bekenstein-Hawking entropy in the early stage of black hole evaporation.
Using the differential form, the entropy of interior volume in a Schwarzschild
black hole is recalculated. It is shown that the proportionality coefficient
between the entropy and the Bekenstein-Hawking entropy is half of that given in
the previous literature. Moreover, the black hole information paradox is
brought up again and discussed.
|
gr-qc hep-ph
|
christodoulou and rovelli have shown that the maximal interior volume of a schwarzschild black hole linearly grows with time recently their conclusion has been extended to the reissnernordstrddottextom and kerr black holes meanwhile the entropy of interior volume in a schwarzschild black hole has also been calculated here a new method calculating the entropy of interior volume of the black hole is given and it can be used in more general cases using this method the entropy associated with the volume of a kerr black hole is calculated and it is found that the entropy is proportional to the bekensteinhawking entropy in the early stage of black hole evaporation using the differential form the entropy of interior volume in a schwarzschild black hole is recalculated it is shown that the proportionality coefficient between the entropy and the bekensteinhawking entropy is half of that given in the previous literature moreover the black hole information paradox is brought up again and discussed
|
[['christodoulou', 'and', 'rovelli', 'have', 'shown', 'that', 'the', 'maximal', 'interior', 'volume', 'of', 'a', 'schwarzschild', 'black', 'hole', 'linearly', 'grows', 'with', 'time', 'recently', 'their', 'conclusion', 'has', 'been', 'extended', 'to', 'the', 'reissnernordstrddottextom', 'and', 'kerr', 'black', 'holes', 'meanwhile', 'the', 'entropy', 'of', 'interior', 'volume', 'in', 'a', 'schwarzschild', 'black', 'hole', 'has', 'also', 'been', 'calculated', 'here', 'a', 'new', 'method', 'calculating', 'the', 'entropy', 'of', 'interior', 'volume', 'of', 'the', 'black', 'hole', 'is', 'given', 'and', 'it', 'can', 'be', 'used', 'in', 'more', 'general', 'cases', 'using', 'this', 'method', 'the', 'entropy', 'associated', 'with', 'the', 'volume', 'of', 'a', 'kerr', 'black', 'hole', 'is', 'calculated', 'and', 'it', 'is', 'found', 'that', 'the', 'entropy', 'is', 'proportional', 'to', 'the', 'bekensteinhawking', 'entropy', 'in', 'the', 'early', 'stage', 'of', 'black', 'hole', 'evaporation', 'using', 'the', 'differential', 'form', 'the', 'entropy', 'of', 'interior', 'volume', 'in', 'a', 'schwarzschild', 'black', 'hole', 'is', 'recalculated', 'it', 'is', 'shown', 'that', 'the', 'proportionality', 'coefficient', 'between', 'the', 'entropy', 'and', 'the', 'bekensteinhawking', 'entropy', 'is', 'half', 'of', 'that', 'given', 'in', 'the', 'previous', 'literature', 'moreover', 'the', 'black', 'hole', 'information', 'paradox', 'is', 'brought', 'up', 'again', 'and', 'discussed']]
|
[-0.0923560246872512, 0.0761541705331183, -0.10673377927159891, 0.11030567166089895, -0.04327503816166427, -0.12716732380504253, 0.012832582501869184, 0.2583403804543195, -0.17281979148683604, -0.269029601776856, 0.12383600133980507, -0.385999246040592, -0.08981243980815634, 0.21855707230279223, -0.11426294098782819, 0.0812043643076322, -0.016146123567887118, 0.11475367049570195, -0.11428249558084644, -0.27007188426796347, 0.3603771949594375, 0.12051958463853225, 0.2518490505142836, 0.06373886486107949, 0.11279013765743003, -0.04872443582280539, 0.009282314247684553, 0.14053931779279766, -0.18353986582460494, 0.09302769965725019, 0.19869846704241353, 0.1608240728470264, 0.2359627245052252, -0.35529680659528823, -0.25411444596829824, 0.05655482268775813, 0.11140531025012024, 0.16810854962095617, -0.12640439423566932, -0.21040960911195725, 0.09873591553186997, -0.26184315866266844, -0.135939111886546, -0.02610833407379687, 0.12901007428299635, -0.07122925495787058, -0.17720598952728323, 0.15114217733043916, 0.08495692571741528, -0.12968664113577688, -0.10469671339960769, -0.020748629370791603, -0.10779045645031146, 0.08843481303774751, 0.14833994938526301, 0.0562421085916867, 0.16608641175553202, -0.015753883971774484, -0.08874270317610353, 0.3144733079709113, -0.04173212221794529, -0.19444523337151623, 0.14006124250518043, -0.28578157200317944, -0.036676576198078695, 0.14128914259781594, 0.10634665155666881, 0.22385801370255648, -0.1729136478215878, 0.13298497635769307, -0.011054076281288872, 0.1888290288101416, 0.14699426540755667, 0.04067622016773385, 0.3411879182443954, 0.11366832782805432, 0.008503538103104802, 0.19572911927280073, -0.07360844137765525, -0.10780732909042853, -0.2693885236280039, -0.20651916223650915, -0.22104418401722797, 0.08523710214794847, -0.16628068074223848, -0.1632535319255112, 0.2846605013066437, 0.07137995916855289, 0.18433106734592003, -0.02737787335936446, 0.2549241577316252, 0.13700259859033395, 0.05837736050452804, 0.13516304654913255, 0.3478864674223587, 0.14648828848148696, 0.15502861563581974, -0.2727158041088842, 0.013234238052973524, 0.14614942991902352]
|
1,803.0965
|
Visual-Inertial Teach and Repeat for Aerial Inspection
|
Industrial facilities often require periodic visual inspections of key
installations. Examining these points of interest is time consuming,
potentially hazardous or require special equipment to reach. MAVs are ideal
platforms to automate this expensive and tedious task. In this work we present
a novel system that enables a human operator to teach a visual inspection task
to an autonomous aerial vehicle by simply demonstrating the task using a
handheld device. To enable robust operation in confined, GPS-denied
environments, the system employs the Google Tango visual-inertial mapping
framework as the only source of pose estimates. In a first step the operator
records the desired inspection path and defines the inspection points. The
mapping framework then computes a feature-based localization map, which is
shared with the robot. After take-off, the robot estimates its pose based on
this map and plans a smooth trajectory through the way points defined by the
operator. Furthermore, the system is able to track the poses of other robots or
the operator, localized in the same map, and follow them in real-time while
keeping a safe distance.
|
cs.RO
|
industrial facilities often require periodic visual inspections of key installations examining these points of interest is time consuming potentially hazardous or require special equipment to reach mavs are ideal platforms to automate this expensive and tedious task in this work we present a novel system that enables a human operator to teach a visual inspection task to an autonomous aerial vehicle by simply demonstrating the task using a handheld device to enable robust operation in confined gpsdenied environments the system employs the google tango visualinertial mapping framework as the only source of pose estimates in a first step the operator records the desired inspection path and defines the inspection points the mapping framework then computes a featurebased localization map which is shared with the robot after takeoff the robot estimates its pose based on this map and plans a smooth trajectory through the way points defined by the operator furthermore the system is able to track the poses of other robots or the operator localized in the same map and follow them in realtime while keeping a safe distance
|
[['industrial', 'facilities', 'often', 'require', 'periodic', 'visual', 'inspections', 'of', 'key', 'installations', 'examining', 'these', 'points', 'of', 'interest', 'is', 'time', 'consuming', 'potentially', 'hazardous', 'or', 'require', 'special', 'equipment', 'to', 'reach', 'mavs', 'are', 'ideal', 'platforms', 'to', 'automate', 'this', 'expensive', 'and', 'tedious', 'task', 'in', 'this', 'work', 'we', 'present', 'a', 'novel', 'system', 'that', 'enables', 'a', 'human', 'operator', 'to', 'teach', 'a', 'visual', 'inspection', 'task', 'to', 'an', 'autonomous', 'aerial', 'vehicle', 'by', 'simply', 'demonstrating', 'the', 'task', 'using', 'a', 'handheld', 'device', 'to', 'enable', 'robust', 'operation', 'in', 'confined', 'gpsdenied', 'environments', 'the', 'system', 'employs', 'the', 'google', 'tango', 'visualinertial', 'mapping', 'framework', 'as', 'the', 'only', 'source', 'of', 'pose', 'estimates', 'in', 'a', 'first', 'step', 'the', 'operator', 'records', 'the', 'desired', 'inspection', 'path', 'and', 'defines', 'the', 'inspection', 'points', 'the', 'mapping', 'framework', 'then', 'computes', 'a', 'featurebased', 'localization', 'map', 'which', 'is', 'shared', 'with', 'the', 'robot', 'after', 'takeoff', 'the', 'robot', 'estimates', 'its', 'pose', 'based', 'on', 'this', 'map', 'and', 'plans', 'a', 'smooth', 'trajectory', 'through', 'the', 'way', 'points', 'defined', 'by', 'the', 'operator', 'furthermore', 'the', 'system', 'is', 'able', 'to', 'track', 'the', 'poses', 'of', 'other', 'robots', 'or', 'the', 'operator', 'localized', 'in', 'the', 'same', 'map', 'and', 'follow', 'them', 'in', 'realtime', 'while', 'keeping', 'a', 'safe', 'distance']]
|
[-0.131213982969356, 0.028453012178577198, -0.07617339894029848, 0.0002886628908984488, -0.112004937520823, -0.1819891273356225, 0.08412307035438092, 0.4260375111327408, -0.26023363416517603, -0.33891738253494713, 0.12752217103729763, -0.2624436644642151, -0.16659842735916044, 0.222260252481545, -0.18148045933300722, 0.12333296729198412, 0.1433744087279384, 0.04135802484835451, -0.03932697463952338, -0.1822104486714861, 0.27007138125816954, 0.04658620917711761, 0.2580743831642201, 0.012697544091969062, 0.15917157079743524, 0.03401935873408451, -0.03799930560876038, -0.04707919120497211, -0.027146107724202114, 0.15179259248088275, 0.3113723725299013, 0.17023653411904777, 0.3123137135391628, -0.4459233274319152, -0.1610277613004482, 0.09576927212009391, 0.12542137250762078, 0.04905160539068136, -0.02388515509860122, -0.3779228844799559, 0.07181610989868224, -0.1640121610679107, -0.11386434942081976, -0.08052692217908425, 0.019160230344879393, -0.00682470840096276, -0.2760598892976878, -0.024600180027246808, 0.008919447301444727, 0.09339443858005314, -0.050763178244103056, 0.008036395170018284, 0.0026265273401357607, 0.267644864331421, -0.006607439980631455, 0.07664238512854211, 0.2215632862884905, -0.15742726198315632, -0.10007788732325315, 0.42701044508032293, 0.01962022159076894, -0.2085001157888071, 0.1980909191829012, -0.06644604360559882, -0.11223769018832365, 0.1106801666546998, 0.1914861272544439, 0.1527000452735196, -0.20226071479206115, 0.03217960117442024, -0.0027979716122691523, 0.17421208489582193, 0.018643588824041563, -0.024582121534241812, 0.21275078980745205, 0.21658261558925473, 0.1602866148612561, 0.10741016205547212, -0.0797609371686284, -0.051898659729820225, -0.24441338110814007, -0.17275126427984355, -0.17271068184662547, -0.017103733250340602, -0.04512474734131923, -0.15861101319503518, 0.3775704915754955, 0.21537240147694695, 0.19787715699630348, 0.059729787148405177, 0.38818903916903025, 0.05957499509300079, 0.100568285937728, 0.08029482462970207, 0.16769769742718102, -0.04691452835166213, 0.15980522033196545, -0.1787656590123999, 0.07531887268733399, 0.08725881453098823]
|
1,803.09651
|
Conservation law of energy-momentum in general relativity
|
We explain the necessity of application of semi-metric in general relativity.
A detailed discussion on the energy-momentum conservation in the general
relativity is presented using the mathematical tool of semi-metric. By means of
the general covariant spacetime translation transformation, the most general
covariant conservation law of energy-momentum is obtained, which is valid for
any coordinates and overcomes the flaws of the expressions of Einstain, Landau
and Moller.
|
gr-qc
|
we explain the necessity of application of semimetric in general relativity a detailed discussion on the energymomentum conservation in the general relativity is presented using the mathematical tool of semimetric by means of the general covariant spacetime translation transformation the most general covariant conservation law of energymomentum is obtained which is valid for any coordinates and overcomes the flaws of the expressions of einstain landau and moller
|
[['we', 'explain', 'the', 'necessity', 'of', 'application', 'of', 'semimetric', 'in', 'general', 'relativity', 'a', 'detailed', 'discussion', 'on', 'the', 'energymomentum', 'conservation', 'in', 'the', 'general', 'relativity', 'is', 'presented', 'using', 'the', 'mathematical', 'tool', 'of', 'semimetric', 'by', 'means', 'of', 'the', 'general', 'covariant', 'spacetime', 'translation', 'transformation', 'the', 'most', 'general', 'covariant', 'conservation', 'law', 'of', 'energymomentum', 'is', 'obtained', 'which', 'is', 'valid', 'for', 'any', 'coordinates', 'and', 'overcomes', 'the', 'flaws', 'of', 'the', 'expressions', 'of', 'einstain', 'landau', 'and', 'moller']]
|
[-0.14120607252213327, 0.06258551752420538, -0.10663203547962687, 0.1338284201337956, -0.13959574913888267, -0.1107071516823701, -0.018537980659554403, 0.24629131916233085, -0.176428789211169, -0.2571672163903713, 0.027390242762383863, -0.23230175106701526, -0.136683859636612, 0.16280608979815786, -0.09271432332355868, 0.07790616323472932, 0.007320867276355399, 0.0012928964922938383, -0.11314225321014722, -0.18262232058314662, 0.4082601786852165, 0.08709152689147176, 0.2949837045320733, 0.06492934031694224, 0.15932073414495046, 0.05864588306708769, -0.10058341430725926, 0.05113646515052427, -0.11935148973046153, 0.1181174122559076, 0.22846876467564003, 0.16527455982357037, 0.21610960832825213, -0.4175996304186287, -0.20118618161050658, 0.004048425168024771, 0.05758149622741974, 0.17002048224711677, -0.05732670081444226, -0.2891894146574266, 0.056424533877747526, -0.17519474548823905, -0.19850613600856654, -0.14330344254884755, 0.03757581244589704, -0.03998300011241526, -0.21461270261330134, 0.12622701682547896, 0.10303796936447422, 0.07638059016034911, -0.09506859213367781, -0.0760815871604295, 0.005977776550659628, 0.07822036590060276, 0.09841984213739069, 0.02341548156585883, 0.0884117023088038, -0.0845846425191584, -0.08005617945596125, 0.5010008930482648, -0.03213291688624657, -0.2975268339964025, 0.11033883453770117, -0.157853888735796, -0.1714141813078613, 0.04332840561189435, 0.08252169283558473, 0.1597627844952733, -0.21402588856378288, 0.16895821715782708, -0.024616999205935634, 0.06665875548214624, 0.11076932143645757, -0.005951902501031079, 0.18715872939069275, 0.08078959019798221, 0.025832214223390274, 0.08051474423458178, 0.022299543012526225, -0.14905313834209333, -0.4756296881629775, -0.21538239209489388, -0.19199459150320652, 0.07219490916891531, -0.13954341926419697, -0.11116288538852875, 0.3761681467294693, 0.1154267297860122, 0.04930690611063531, 0.09610101951914134, 0.2869983265867852, 0.1608220966617492, 0.0619377013803883, 0.05860410466310427, 0.27220833628918184, 0.19863278547541774, 0.11074033712925897, -0.18793879002050468, 0.00391286094390759, 0.11589681111614812]
|
1,803.09652
|
Redox potential replica exchange molecular dynamics at constant pH in
AMBER: Implementation and validation
|
Redox processes are important in chemistry, with applications in biomedicine,
chemical analysis, among others. As many redox experiments are also performed
at a fixed value of pH, having an efficient computational method to support
experimental measures at both constant redox potential and pH is very
important. Such computational techniques have the potential to validate
experimental observations performed under these conditions and to provide
additional information unachievable experimentally such as an atomic level
description of macroscopic measures. We present the implementation of discrete
redox and protonation states methods for constant redox potential Molecular
Dynamics (CEMD), for coupled constant pH and constant redox potential MD
(C(pH,E)MD), and for Replica Exchange MD along the redox potential dimension
(E-REMD) on the AMBER software package. Validation results are presented for a
small system that contains a single heme group: N-acetylmicroperoxidase-8
(NAcMP8) axially connected to a histidine peptide. The methods implemented
allow one to make standard redox potential (Eo) predictions with the same
easiness and accuracy as pKa predictions using the constant pH molecular
dynamics and pH-REMD methods currently available on AMBER. In our simulations,
we can correctly describe, in agreement also with theoretical predictions, the
following behaviors: when a redox-active group is reduced, the pKa of a near
pH-active group increases because it becomes easier for a proton to be
attached; equivalently, when a pH-active group is protonated, the Eo of an
adjacent redox-active group rises. Furthermore, our results also show that
E-REMD is able to achieve faster statistical convergence than CEMD or
C(pH,E)MD. Moreover, computational benchmarks using our methodologies show
high-performance of GPU accelerated calculations in comparison to conventional
CPU calculations.
|
physics.chem-ph
|
redox processes are important in chemistry with applications in biomedicine chemical analysis among others as many redox experiments are also performed at a fixed value of ph having an efficient computational method to support experimental measures at both constant redox potential and ph is very important such computational techniques have the potential to validate experimental observations performed under these conditions and to provide additional information unachievable experimentally such as an atomic level description of macroscopic measures we present the implementation of discrete redox and protonation states methods for constant redox potential molecular dynamics cemd for coupled constant ph and constant redox potential md cphemd and for replica exchange md along the redox potential dimension eremd on the amber software package validation results are presented for a small system that contains a single heme group nacetylmicroperoxidase8 nacmp8 axially connected to a histidine peptide the methods implemented allow one to make standard redox potential eo predictions with the same easiness and accuracy as pka predictions using the constant ph molecular dynamics and phremd methods currently available on amber in our simulations we can correctly describe in agreement also with theoretical predictions the following behaviors when a redoxactive group is reduced the pka of a near phactive group increases because it becomes easier for a proton to be attached equivalently when a phactive group is protonated the eo of an adjacent redoxactive group rises furthermore our results also show that eremd is able to achieve faster statistical convergence than cemd or cphemd moreover computational benchmarks using our methodologies show highperformance of gpu accelerated calculations in comparison to conventional cpu calculations
|
[['redox', 'processes', 'are', 'important', 'in', 'chemistry', 'with', 'applications', 'in', 'biomedicine', 'chemical', 'analysis', 'among', 'others', 'as', 'many', 'redox', 'experiments', 'are', 'also', 'performed', 'at', 'a', 'fixed', 'value', 'of', 'ph', 'having', 'an', 'efficient', 'computational', 'method', 'to', 'support', 'experimental', 'measures', 'at', 'both', 'constant', 'redox', 'potential', 'and', 'ph', 'is', 'very', 'important', 'such', 'computational', 'techniques', 'have', 'the', 'potential', 'to', 'validate', 'experimental', 'observations', 'performed', 'under', 'these', 'conditions', 'and', 'to', 'provide', 'additional', 'information', 'unachievable', 'experimentally', 'such', 'as', 'an', 'atomic', 'level', 'description', 'of', 'macroscopic', 'measures', 'we', 'present', 'the', 'implementation', 'of', 'discrete', 'redox', 'and', 'protonation', 'states', 'methods', 'for', 'constant', 'redox', 'potential', 'molecular', 'dynamics', 'cemd', 'for', 'coupled', 'constant', 'ph', 'and', 'constant', 'redox', 'potential', 'md', 'cphemd', 'and', 'for', 'replica', 'exchange', 'md', 'along', 'the', 'redox', 'potential', 'dimension', 'eremd', 'on', 'the', 'amber', 'software', 'package', 'validation', 'results', 'are', 'presented', 'for', 'a', 'small', 'system', 'that', 'contains', 'a', 'single', 'heme', 'group', 'nacetylmicroperoxidase8', 'nacmp8', 'axially', 'connected', 'to', 'a', 'histidine', 'peptide', 'the', 'methods', 'implemented', 'allow', 'one', 'to', 'make', 'standard', 'redox', 'potential', 'eo', 'predictions', 'with', 'the', 'same', 'easiness', 'and', 'accuracy', 'as', 'pka', 'predictions', 'using', 'the', 'constant', 'ph', 'molecular', 'dynamics', 'and', 'phremd', 'methods', 'currently', 'available', 'on', 'amber', 'in', 'our', 'simulations', 'we', 'can', 'correctly', 'describe', 'in', 'agreement', 'also', 'with', 'theoretical', 'predictions', 'the', 'following', 'behaviors', 'when', 'a', 'redoxactive', 'group', 'is', 'reduced', 'the', 'pka', 'of', 'a', 'near', 'phactive', 'group', 'increases', 'because', 'it', 'becomes', 'easier', 'for', 'a', 'proton', 'to', 'be', 'attached', 'equivalently', 'when', 'a', 'phactive', 'group', 'is', 'protonated', 'the', 'eo', 'of', 'an', 'adjacent', 'redoxactive', 'group', 'rises', 'furthermore', 'our', 'results', 'also', 'show', 'that', 'eremd', 'is', 'able', 'to', 'achieve', 'faster', 'statistical', 'convergence', 'than', 'cemd', 'or', 'cphemd', 'moreover', 'computational', 'benchmarks', 'using', 'our', 'methodologies', 'show', 'highperformance', 'of', 'gpu', 'accelerated', 'calculations', 'in', 'comparison', 'to', 'conventional', 'cpu', 'calculations']]
|
[-0.0636461584489475, 0.0744328612082998, -0.061017446089969125, 0.02547445216634881, -0.014000286310261418, -0.19530676099604408, 0.056679521904817905, 0.4393220794271649, -0.23264214843006212, -0.3060500173244712, 0.0655459581866189, -0.27649876810502, -0.12292450579883199, 0.23254791125695784, -0.013132881685412785, 0.051368750238343495, 0.10893974444592487, 0.03008555191446749, -0.04291109004711765, -0.2143244181701899, 0.19981937812706238, 0.1021044385665035, 0.26430689470568136, 0.11424789377582953, 0.07204808299285323, -0.044614813185627246, 0.02320337830050018, 0.013344806070302346, -0.12595652356228743, 0.1319620624674636, 0.2749969866451656, 0.05652415386469702, 0.2522992551824901, -0.4659967212685088, -0.21574021472916902, 0.0494952952162572, 0.11551157840574522, 0.1176134537997504, -0.0770630687935451, -0.2361099122655253, 0.08738095455941954, -0.15305721964109545, -0.12938765604897265, -0.13995483114570018, 0.02470715685031023, 0.04334075180019519, -0.27522294750877535, 0.06353643353991914, -0.058165740548423675, 0.08741995469659572, -0.08703784148259334, -0.16310082900549047, -0.03217400815753021, 0.12918990128876662, 0.033822930356588704, 0.0490762619307317, 0.23146592921310272, -0.08848534738669775, -0.11253678076720053, 0.40397538029220564, -0.08751121475461685, -0.20830616095805427, 0.2488216322290805, -0.07209528878136257, -0.16063660366134447, 0.1340743835118433, 0.12483357515884563, 0.08595462070503669, -0.1381505486640453, 0.06430066228765713, 0.025919991684355593, 0.19074175787309922, 0.03758604463204279, -0.017936174718324906, 0.14015540290739417, 0.1957097593749072, 0.02582670667803442, 0.0891146675452081, -0.04827928485199015, -0.11460403099840204, -0.2542090686705945, -0.19278620912281927, -0.1587965921110784, 0.02255741154455558, -0.0874685521590972, -0.12765192137056486, 0.34843970441562666, 0.14368851530020912, 0.13506506665342655, 0.029217709295132177, 0.3126378060361847, 0.036950135345899235, 0.06316870534449613, 0.06102588295651412, 0.20038485360131492, 0.10706160145328027, 0.07116266397051801, -0.2524175036120113, 0.07204770276236326, 0.005734403235043666]
|
1,803.09653
|
Limiting curvature mimetic gravity and its relation to Loop Quantum
Cosmology
|
Considering as usual that the underlying geometry of our universe is well
described by the spatially flat Friedmann-Lemaitre-Robertson-Walker line
element, we review how the background of holonomy corrected Loop Quantum
Cosmology (LQC) could be obtained as a simple modified version of the mimetic
gravity. We also analyze the scalar and tensor perturbations of this modified
mimetic model, from which we find that at the level of tensor perturbations it
is indistinguishable from General Relativity while at the level of scalar
perturbations, the modified mimetic model, which has the same background as
LQC, does not exhibit the same properties as LQC in the so-called deformed
algebra approach.
|
gr-qc
|
considering as usual that the underlying geometry of our universe is well described by the spatially flat friedmannlemaitrerobertsonwalker line element we review how the background of holonomy corrected loop quantum cosmology lqc could be obtained as a simple modified version of the mimetic gravity we also analyze the scalar and tensor perturbations of this modified mimetic model from which we find that at the level of tensor perturbations it is indistinguishable from general relativity while at the level of scalar perturbations the modified mimetic model which has the same background as lqc does not exhibit the same properties as lqc in the socalled deformed algebra approach
|
[['considering', 'as', 'usual', 'that', 'the', 'underlying', 'geometry', 'of', 'our', 'universe', 'is', 'well', 'described', 'by', 'the', 'spatially', 'flat', 'friedmannlemaitrerobertsonwalker', 'line', 'element', 'we', 'review', 'how', 'the', 'background', 'of', 'holonomy', 'corrected', 'loop', 'quantum', 'cosmology', 'lqc', 'could', 'be', 'obtained', 'as', 'a', 'simple', 'modified', 'version', 'of', 'the', 'mimetic', 'gravity', 'we', 'also', 'analyze', 'the', 'scalar', 'and', 'tensor', 'perturbations', 'of', 'this', 'modified', 'mimetic', 'model', 'from', 'which', 'we', 'find', 'that', 'at', 'the', 'level', 'of', 'tensor', 'perturbations', 'it', 'is', 'indistinguishable', 'from', 'general', 'relativity', 'while', 'at', 'the', 'level', 'of', 'scalar', 'perturbations', 'the', 'modified', 'mimetic', 'model', 'which', 'has', 'the', 'same', 'background', 'as', 'lqc', 'does', 'not', 'exhibit', 'the', 'same', 'properties', 'as', 'lqc', 'in', 'the', 'socalled', 'deformed', 'algebra', 'approach']]
|
[-0.08331111315110663, 0.11521797017897216, -0.15088732260332074, 0.12789878965342277, -0.07601427309707089, -0.1744900568924352, -0.11288966213238759, 0.2937766233555762, -0.24558633393695894, -0.2706214662054817, 0.05821827838509256, -0.21842809727872317, -0.16437853979965988, 0.12115738427108329, -0.07668236198501205, -0.029442942222439736, 0.004487420747469549, 0.07059425250890683, -0.08126407561665576, -0.2298343176997425, 0.39294549387018635, 0.1610666791818386, 0.25478541974927177, -0.03391798318117716, 0.10535117711010829, -0.07181855102667128, -0.018175262531687348, 0.11225763783913176, -0.1104700740583006, 0.039648478383962765, 0.18488984331084998, 0.10983040022119037, 0.18954891261627088, -0.4007901897970236, -0.2899381157652176, 0.10761677884971196, 0.12479174093185168, 0.20229291115702955, -0.05166815737051503, -0.3130565762765846, 0.07018720456135441, -0.1851417736242578, -0.17638845047210608, -0.05999324274389952, -0.053530551282302385, -0.09457277213190331, -0.16293320684026014, 0.11743249987303675, 0.0413436826048331, -0.039647693121981506, -0.06172391339336997, -0.0831717144333283, -0.0645139737116208, 0.06947686888259959, 0.04810774027598354, -0.00450979990012645, 0.15664429822058049, -0.10909393847313763, -0.07261668836460712, 0.45317063847873007, -0.1869308514243765, -0.2222624814647408, 0.08707897056702454, -0.15024419509550943, -0.14184325893919142, 0.023476138735137316, 0.09864557102182002, 0.1085077613187989, -0.13421821161085423, 0.21232827352795075, 0.0025923798071607104, 0.13193804009835114, 0.09024331664868612, 0.0420605293370757, 0.254774470470916, 0.0888483009722857, 0.007856662710249986, 0.10763516073883402, -0.009114371617061068, -0.1566348632815171, -0.43151779024738746, -0.1305327911175928, -0.14553560569381588, 0.06875285895704401, -0.152595146765514, -0.24153038193823173, 0.41157631905977876, 0.13408524164367677, 0.1200851368034733, 0.052695015289399, 0.2895985017091317, 0.09807492517712438, 0.08330360590480268, 0.06979472616265686, 0.31260351834045547, 0.15909623015751043, 0.09253890480393684, -0.23853174809208316, -0.05680054274194364, 0.07970190771310678]
|
1,803.09654
|
Bifurcation sets and global monodromies of Newton non-degenerate
polynomials on algebraic sets
|
Let $S\subset \mathbb{C}^n$ be a non-singular algebraic set and $f \colon
\mathbb{C}^n \to \mathbb{C}$ be a polynomial function. It is well-known that
the restriction $f|_S \colon S \to \mathbb{C}$ of $f$ on $S$ is a locally
trivial fibration outside a finite set $B(f|_S) \subset \mathbb{C}.$ In this
paper, we give an explicit description of a finite set $T_\infty(f|_S) \subset
\mathbb{C}$ such that $B(f|_S) \subset K_0(f|_S) \cup T_\infty(f|_S),$ where
$K_0(f|_S)$ denotes the set of critical values of the $f|_S.$ Furthermore,
$T_\infty(f|_S)$ is contained in the set of critical values of certain
polynomial functions provided that the $f|_S$ is Newton non-degenerate at
infinity. Using these facts, we show that if $\{f_t\}_{t \in [0, 1]}$ is a
family of polynomials such that the Newton polyhedron at infinity of $f_t$ is
independent of $t$ and the $f_t|_S$ is Newton non-degenerate at infinity, then
the global monodromies of the $f_t|_S$ are all isomorphic.
|
math.AG
|
let ssubset mathbbcn be a nonsingular algebraic set and f colon mathbbcn to mathbbc be a polynomial function it is wellknown that the restriction f_s colon s to mathbbc of f on s is a locally trivial fibration outside a finite set bf_s subset mathbbc in this paper we give an explicit description of a finite set t_inftyf_s subset mathbbc such that bf_s subset k_0f_s cup t_inftyf_s where k_0f_s denotes the set of critical values of the f_s furthermore t_inftyf_s is contained in the set of critical values of certain polynomial functions provided that the f_s is newton nondegenerate at infinity using these facts we show that if f_t_t in 0 1 is a family of polynomials such that the newton polyhedron at infinity of f_t is independent of t and the f_t_s is newton nondegenerate at infinity then the global monodromies of the f_t_s are all isomorphic
|
[['let', 'ssubset', 'mathbbcn', 'be', 'a', 'nonsingular', 'algebraic', 'set', 'and', 'f', 'colon', 'mathbbcn', 'to', 'mathbbc', 'be', 'a', 'polynomial', 'function', 'it', 'is', 'wellknown', 'that', 'the', 'restriction', 'f_s', 'colon', 's', 'to', 'mathbbc', 'of', 'f', 'on', 's', 'is', 'a', 'locally', 'trivial', 'fibration', 'outside', 'a', 'finite', 'set', 'bf_s', 'subset', 'mathbbc', 'in', 'this', 'paper', 'we', 'give', 'an', 'explicit', 'description', 'of', 'a', 'finite', 'set', 't_inftyf_s', 'subset', 'mathbbc', 'such', 'that', 'bf_s', 'subset', 'k_0f_s', 'cup', 't_inftyf_s', 'where', 'k_0f_s', 'denotes', 'the', 'set', 'of', 'critical', 'values', 'of', 'the', 'f_s', 'furthermore', 't_inftyf_s', 'is', 'contained', 'in', 'the', 'set', 'of', 'critical', 'values', 'of', 'certain', 'polynomial', 'functions', 'provided', 'that', 'the', 'f_s', 'is', 'newton', 'nondegenerate', 'at', 'infinity', 'using', 'these', 'facts', 'we', 'show', 'that', 'if', 'f_t_t', 'in', '0', '1', 'is', 'a', 'family', 'of', 'polynomials', 'such', 'that', 'the', 'newton', 'polyhedron', 'at', 'infinity', 'of', 'f_t', 'is', 'independent', 'of', 't', 'and', 'the', 'f_t_s', 'is', 'newton', 'nondegenerate', 'at', 'infinity', 'then', 'the', 'global', 'monodromies', 'of', 'the', 'f_t_s', 'are', 'all', 'isomorphic']]
|
[-0.19045046829971773, 0.08061087354626266, -0.05715505662695344, -0.03227047178340305, -0.08385627417150757, -0.12325262058012444, 0.020482574429780503, 0.29630136318376354, -0.349607781683705, -0.10935876619006539, 0.09807810002118991, -0.3261896874787735, -0.12173107701257385, 0.19350688593975943, -0.09445412342661413, -0.0020134670449147834, 0.01599143770170109, 0.13147839239702142, -0.08605166335975559, -0.29302492304865657, 0.36259915981570195, -0.11911911911748607, 0.16569884158670903, 0.0317305614433155, 0.1293931427809153, -0.04580847858933025, 0.07004553242747126, -0.019347363211021856, -0.18921612308743, 0.03316699516766801, 0.2850632630336773, 0.15971749266805246, 0.26574618652029414, -0.3251299053559015, -0.08914482829578478, 0.26736446837412897, 0.15068846294206792, -0.052398910220905114, 0.04619002521021998, -0.20008828827854375, 0.16489364425491157, -0.10676891453532053, -0.16703311303180868, -0.07796280907531236, 0.11031935305880575, 0.05213473293095313, -0.33673962824897646, -0.02477671827735572, 0.06801911728649304, 0.10770269421025597, -0.025720392263911922, -0.12101078097274977, -0.07513086508542043, 0.0493287717473918, -0.029190418758461702, 0.20874694849139658, 0.08795901531803196, -0.03317413121534126, -0.015667057618627262, 0.36235165850476136, -0.05904533751630064, -0.26044842679182, 0.09588640276663776, -0.22977280104853984, -0.1418290537653555, 0.14853546386905786, 0.07848348803175935, 0.1765269814894117, -0.04182899132499407, 0.25799836636729667, -0.1437785549282, 0.0962715334262988, 0.1148369166646795, -0.03534963977169888, 0.13601890544503414, 0.06996223430695205, 0.08796255934084284, 0.10862266310683355, 0.016685217363229986, 0.02121402960720247, -0.4562682875167129, -0.12542008649686287, -0.19268352010945694, 0.1847012987296129, -0.14371991224149402, -0.1920945183791477, 0.3739616203282414, 0.05836320988320071, 0.2508553487152375, 0.11756640144399014, 0.21158208602975154, 0.09225742702888212, 0.018761871896427255, 0.08622467889418375, 0.06512793317308714, 0.10364763385391441, -0.05800607470024762, -0.14910378896406498, 0.001995272073766281, 0.1679089621994002]
|
1,803.09655
|
BAGAN: Data Augmentation with Balancing GAN
|
Image classification datasets are often imbalanced, characteristic that
negatively affects the accuracy of deep-learning classifiers. In this work we
propose balancing GAN (BAGAN) as an augmentation tool to restore balance in
imbalanced datasets. This is challenging because the few minority-class images
may not be enough to train a GAN. We overcome this issue by including during
the adversarial training all available images of majority and minority classes.
The generative model learns useful features from majority classes and uses
these to generate images for minority classes. We apply class conditioning in
the latent space to drive the generation process towards a target class. The
generator in the GAN is initialized with the encoder module of an autoencoder
that enables us to learn an accurate class-conditioning in the latent space. We
compare the proposed methodology with state-of-the-art GANs and demonstrate
that BAGAN generates images of superior quality when trained with an imbalanced
dataset.
|
cs.CV cs.LG stat.ML
|
image classification datasets are often imbalanced characteristic that negatively affects the accuracy of deeplearning classifiers in this work we propose balancing gan bagan as an augmentation tool to restore balance in imbalanced datasets this is challenging because the few minorityclass images may not be enough to train a gan we overcome this issue by including during the adversarial training all available images of majority and minority classes the generative model learns useful features from majority classes and uses these to generate images for minority classes we apply class conditioning in the latent space to drive the generation process towards a target class the generator in the gan is initialized with the encoder module of an autoencoder that enables us to learn an accurate classconditioning in the latent space we compare the proposed methodology with stateoftheart gans and demonstrate that bagan generates images of superior quality when trained with an imbalanced dataset
|
[['image', 'classification', 'datasets', 'are', 'often', 'imbalanced', 'characteristic', 'that', 'negatively', 'affects', 'the', 'accuracy', 'of', 'deeplearning', 'classifiers', 'in', 'this', 'work', 'we', 'propose', 'balancing', 'gan', 'bagan', 'as', 'an', 'augmentation', 'tool', 'to', 'restore', 'balance', 'in', 'imbalanced', 'datasets', 'this', 'is', 'challenging', 'because', 'the', 'few', 'minorityclass', 'images', 'may', 'not', 'be', 'enough', 'to', 'train', 'a', 'gan', 'we', 'overcome', 'this', 'issue', 'by', 'including', 'during', 'the', 'adversarial', 'training', 'all', 'available', 'images', 'of', 'majority', 'and', 'minority', 'classes', 'the', 'generative', 'model', 'learns', 'useful', 'features', 'from', 'majority', 'classes', 'and', 'uses', 'these', 'to', 'generate', 'images', 'for', 'minority', 'classes', 'we', 'apply', 'class', 'conditioning', 'in', 'the', 'latent', 'space', 'to', 'drive', 'the', 'generation', 'process', 'towards', 'a', 'target', 'class', 'the', 'generator', 'in', 'the', 'gan', 'is', 'initialized', 'with', 'the', 'encoder', 'module', 'of', 'an', 'autoencoder', 'that', 'enables', 'us', 'to', 'learn', 'an', 'accurate', 'classconditioning', 'in', 'the', 'latent', 'space', 'we', 'compare', 'the', 'proposed', 'methodology', 'with', 'stateoftheart', 'gans', 'and', 'demonstrate', 'that', 'bagan', 'generates', 'images', 'of', 'superior', 'quality', 'when', 'trained', 'with', 'an', 'imbalanced', 'dataset']]
|
[0.01421966189956105, 0.04257258511931267, -0.029057207261055908, 0.09811428665688064, -0.11559352245894354, -0.17356468320842958, 0.0023761248706696218, 0.4859628279337147, -0.27753595937505965, -0.3543805230753465, 0.02599815723889401, -0.2725530684888113, -0.16625889525405013, 0.1868614350748717, -0.18830570048959888, 0.044219109170363854, 0.156074158372295, 0.004772804575916004, -0.054911959906196184, -0.3176716519590005, 0.3501775625369655, 0.052682454860300425, 0.3931963269367514, -0.03410438810093891, 0.14685806320142625, -0.055897486694594656, 0.007546050080266975, -0.017774130618152827, -0.015085819626534467, 0.17551977299278815, 0.3210421964751194, 0.169549597610857, 0.3294435235134157, -0.3865562855897334, -0.2223941287253952, 0.12338609065260463, 0.10457421846425273, 0.14033108036640887, -0.04962995491809393, -0.3258223868843993, 0.09563131564478046, -0.15877006882989167, 0.019660773402667486, -0.18432890100485877, -0.058618408905954766, -0.011779408242894125, -0.3259519619598435, 0.030761274734149444, 0.09258153468593892, 0.016951484324398056, -0.08856597742778342, -0.07133134486366238, -0.01777299167588353, 0.17561666585208893, 0.025335026478930846, 0.06741760183600772, 0.09321583498030238, -0.21026375322507368, -0.10509555487449737, 0.3502697138390785, -0.07933619243699132, -0.21723173282499075, 0.20224015801307438, -0.04597757444185699, -0.1397519510680022, 0.1273997760246564, 0.24036116599247498, 0.14235203105006242, -0.13596771163317053, -0.02184968069937993, -0.06147042218667624, 0.17981613217696749, 0.0081721781565489, -0.029857585394142457, 0.15935964041995823, 0.24659506205138093, 0.0204652132178913, 0.2134365676863169, -0.18351267375076977, -0.042484381331455885, -0.20886483218445873, -0.09914143195431664, -0.21525424731435916, 0.010539067784209436, -0.05135252404984965, -0.16112478079257497, 0.4197763826935583, 0.284299281139033, 0.2546274161041283, 0.08739364279071557, 0.30922290352766946, 0.0030932318561416646, 0.1248964841646336, 0.10333420870350611, 0.15448563458435488, 0.014003801526776796, 0.08616599931316013, -0.15652153060002716, 0.11220750439093267, 0.03355632548301712]
|
1,803.09656
|
Uniaxial anisotropy and enhanced magnetostriction of CoFe$_2$O$_4$
induced by reaction under uniaxial pressure with SPS
|
In this study, we have compared magnetic and magnetostrictive properties of
polycrystalline CoFe$_2$O$_4$ pellets, produced by three different methods,
focusing on the use of Spark Plasma Sintering (SPS). This technique allows a
very short heat treatment stage while a uniaxial pressure is applied. SPS was
utilized to sinter cobalt ferrite but also to make the reaction and the
sintering (reactive sintering) of the same ceramic composition. Magnetic and
magnetostrictive measurements show that the reactive sintering with SPS induces
a uniaxial anisotropy, while it is not the case with a simple sintering
process. The induced anisotropy is then expected to be a consequence of the
reaction under uniaxial pressure. This anisotropy enhanced the magnetostrictive
properties of the sample, where a maximum longitudinal magnetostriction of
$-229$~ppm is obtained. This process can be a promising alternative to the
magnetic-annealing because of the short processing time required (22 minutes).
|
cond-mat.mtrl-sci
|
in this study we have compared magnetic and magnetostrictive properties of polycrystalline cofe_2o_4 pellets produced by three different methods focusing on the use of spark plasma sintering sps this technique allows a very short heat treatment stage while a uniaxial pressure is applied sps was utilized to sinter cobalt ferrite but also to make the reaction and the sintering reactive sintering of the same ceramic composition magnetic and magnetostrictive measurements show that the reactive sintering with sps induces a uniaxial anisotropy while it is not the case with a simple sintering process the induced anisotropy is then expected to be a consequence of the reaction under uniaxial pressure this anisotropy enhanced the magnetostrictive properties of the sample where a maximum longitudinal magnetostriction of 229ppm is obtained this process can be a promising alternative to the magneticannealing because of the short processing time required 22 minutes
|
[['in', 'this', 'study', 'we', 'have', 'compared', 'magnetic', 'and', 'magnetostrictive', 'properties', 'of', 'polycrystalline', 'cofe_2o_4', 'pellets', 'produced', 'by', 'three', 'different', 'methods', 'focusing', 'on', 'the', 'use', 'of', 'spark', 'plasma', 'sintering', 'sps', 'this', 'technique', 'allows', 'a', 'very', 'short', 'heat', 'treatment', 'stage', 'while', 'a', 'uniaxial', 'pressure', 'is', 'applied', 'sps', 'was', 'utilized', 'to', 'sinter', 'cobalt', 'ferrite', 'but', 'also', 'to', 'make', 'the', 'reaction', 'and', 'the', 'sintering', 'reactive', 'sintering', 'of', 'the', 'same', 'ceramic', 'composition', 'magnetic', 'and', 'magnetostrictive', 'measurements', 'show', 'that', 'the', 'reactive', 'sintering', 'with', 'sps', 'induces', 'a', 'uniaxial', 'anisotropy', 'while', 'it', 'is', 'not', 'the', 'case', 'with', 'a', 'simple', 'sintering', 'process', 'the', 'induced', 'anisotropy', 'is', 'then', 'expected', 'to', 'be', 'a', 'consequence', 'of', 'the', 'reaction', 'under', 'uniaxial', 'pressure', 'this', 'anisotropy', 'enhanced', 'the', 'magnetostrictive', 'properties', 'of', 'the', 'sample', 'where', 'a', 'maximum', 'longitudinal', 'magnetostriction', 'of', '229ppm', 'is', 'obtained', 'this', 'process', 'can', 'be', 'a', 'promising', 'alternative', 'to', 'the', 'magneticannealing', 'because', 'of', 'the', 'short', 'processing', 'time', 'required', '22', 'minutes']]
|
[-0.08467076954242962, 0.22579922323225887, -0.11195473533516125, -0.04410146905374986, -0.09232301203211626, -0.10303846613823117, 0.025354221209206364, 0.4426279130255009, -0.29318530075748656, -0.2895328603828183, 0.059921199301179576, -0.256236876056703, -0.043497101048828216, 0.2066802177911989, 0.03230889051683716, 0.04404262953822117, 0.03303575155266619, -0.04114568747996867, -0.04521615488431905, -0.2421800494291722, 0.22588980009525336, 0.10286509770205182, 0.3563351617357531, 0.09286146995349351, 0.0555847203098498, -0.02303357949894381, 0.09122853014631184, 0.06943379062019497, -0.13963462936363658, 0.05275860742643033, 0.22848897442299795, -0.019009777089138025, 0.20324866276989867, -0.4480556149124327, -0.21929918531771306, 0.04001011022112586, 0.06983207869815633, 0.11558336575531443, -0.10245927396943545, -0.18270926396818377, 0.10198956093965815, -0.13049750898840962, -0.08912321648697231, -0.04361117544740282, -0.04657464124379562, 0.02829080109950155, -0.3160289063613367, 0.06411311501401828, 0.10528524890680427, 0.10694731424165356, -0.09467440093843058, -0.12937898131191627, -0.04930822157880643, 0.0170751343370526, 0.09746597638785989, 0.04951123923992973, 0.23162185740364077, -0.07326821128388385, -0.054998048323929516, 0.4040136951041388, -0.04474253555225743, -0.09176631429447578, 0.18580722564284305, -0.14415338030247787, -0.0987146307447261, 0.15798792778839962, 0.16694023286666512, 0.1368082142728088, -0.22629688661285005, 0.03229474318514975, 0.055110192587403774, 0.1965433968380875, 0.11941790742102776, -0.050460615231154055, 0.15194578063381198, 0.25121483928035504, 0.010723617066258004, 0.23715403882324226, -0.0710870904922876, 0.030319384807212788, -0.22100317361276153, -0.19055152368582004, -0.16257190307068242, 0.0793098170804617, -0.11255172448254343, -0.17067910818109563, 0.3455872510892007, 0.14030215569505822, 0.16800071505774333, -0.0518076850094839, 0.2777169488396469, 0.06655779960516424, 0.0988882912202393, 0.035454925221319385, 0.24220936914736574, 0.16271088279659984, 0.18393427674118037, -0.2875901700463146, 0.16753023068609457, -0.030343247727341167]
|
1,803.09657
|
Progress in structure recovery from low dose exposures: Mixed molecular
adsorption, exploitation of symmetry and reconstruction from the minimum
signal level
|
We investigate the recovery of structures from large-area, low dose exposures
that distribute the dose over many identical copies of an object. The
reconstruction is done via a maximum likelihood approach that does neither
require to identify nor align the individual particles. We also simulate small
molecular adsorbates on graphene and demonstrate the retrieval of images with
atomic resolution from \add{large area and} extremely low dose raw data. Doses
as low as 5 $e^{-}/$\AA$^{2}$ are sufficient if all symmetries (translations,
rotations and mirrors) of the supporting membrane are exploited to retrieve the
structure of individual adsorbed molecules. We compare different optimization
schemes, consider mixed molecules and adsorption sites, and requirements on the
amount of data. We further demonstrate that the maximum likelihood approach is
only count limited by requiring at least three independent counts per
entity.Finally, we demonstrate that the approach works with real experimental
data and in presence of aberrations.
|
cond-mat.mtrl-sci
|
we investigate the recovery of structures from largearea low dose exposures that distribute the dose over many identical copies of an object the reconstruction is done via a maximum likelihood approach that does neither require to identify nor align the individual particles we also simulate small molecular adsorbates on graphene and demonstrate the retrieval of images with atomic resolution from addlarge area and extremely low dose raw data doses as low as 5 eaa2 are sufficient if all symmetries translations rotations and mirrors of the supporting membrane are exploited to retrieve the structure of individual adsorbed molecules we compare different optimization schemes consider mixed molecules and adsorption sites and requirements on the amount of data we further demonstrate that the maximum likelihood approach is only count limited by requiring at least three independent counts per entityfinally we demonstrate that the approach works with real experimental data and in presence of aberrations
|
[['we', 'investigate', 'the', 'recovery', 'of', 'structures', 'from', 'largearea', 'low', 'dose', 'exposures', 'that', 'distribute', 'the', 'dose', 'over', 'many', 'identical', 'copies', 'of', 'an', 'object', 'the', 'reconstruction', 'is', 'done', 'via', 'a', 'maximum', 'likelihood', 'approach', 'that', 'does', 'neither', 'require', 'to', 'identify', 'nor', 'align', 'the', 'individual', 'particles', 'we', 'also', 'simulate', 'small', 'molecular', 'adsorbates', 'on', 'graphene', 'and', 'demonstrate', 'the', 'retrieval', 'of', 'images', 'with', 'atomic', 'resolution', 'from', 'addlarge', 'area', 'and', 'extremely', 'low', 'dose', 'raw', 'data', 'doses', 'as', 'low', 'as', '5', 'eaa2', 'are', 'sufficient', 'if', 'all', 'symmetries', 'translations', 'rotations', 'and', 'mirrors', 'of', 'the', 'supporting', 'membrane', 'are', 'exploited', 'to', 'retrieve', 'the', 'structure', 'of', 'individual', 'adsorbed', 'molecules', 'we', 'compare', 'different', 'optimization', 'schemes', 'consider', 'mixed', 'molecules', 'and', 'adsorption', 'sites', 'and', 'requirements', 'on', 'the', 'amount', 'of', 'data', 'we', 'further', 'demonstrate', 'that', 'the', 'maximum', 'likelihood', 'approach', 'is', 'only', 'count', 'limited', 'by', 'requiring', 'at', 'least', 'three', 'independent', 'counts', 'per', 'entityfinally', 'we', 'demonstrate', 'that', 'the', 'approach', 'works', 'with', 'real', 'experimental', 'data', 'and', 'in', 'presence', 'of', 'aberrations']]
|
[-0.07343320145690502, 0.10253002637172597, -0.02504974866485936, 0.03474205588975034, -0.011888455839408875, -0.14157378860443032, 0.058687444305166155, 0.4565463296118999, -0.2272456459288529, -0.37719252540561177, 0.08780682930838467, -0.3039450054400719, -0.09594134530896359, 0.16967139150572302, -0.09212324727989184, 0.02317936011377547, 0.08929715687159023, -0.00014475920868899997, -0.050627540309457174, -0.28020366845689965, 0.24501091503575695, 0.07630249040338817, 0.3248184976174227, 0.040648066963775445, 0.13644861168268718, 0.03224554095079735, -0.019213505008026658, 0.00771282666875362, -0.09320544380942303, 0.1351689281848989, 0.2428894423185879, 0.12958459242518747, 0.21187161205605223, -0.4728759140426281, -0.2056848412464004, 0.08954824928675571, 0.12369915172332685, 0.11739306671282389, -0.0467856759236713, -0.21828782571567185, 0.07967789775391904, -0.10880953877783012, -0.06367944918796357, -0.10113903830896738, -0.03854881796943674, 0.06827607899029182, -0.2570619443794806, 0.0697497411366574, -0.01663041553122535, 0.08247365548600437, -0.08535082386994122, -0.10872051974714753, -0.044855265923456955, 0.13307449783842334, 0.030726862384550174, -0.014642103470474382, 0.18223949928061675, -0.11573741059428419, -0.08614416121061416, 0.3873426054898124, -0.032046036440066546, -0.19090048256861483, 0.19898441639996833, -0.1642369259173838, -0.11616115720517584, 0.1984267265242118, 0.16888905953789354, 0.14661112768206772, -0.13472501956740543, 0.021743312268478848, -0.0017253749038174048, 0.23537057985382892, 0.111179913931695, 0.019905629367786365, 0.190913043955291, 0.1389664930397732, 0.06760274038779793, 0.1499058252548949, -0.17678970050366732, -0.023833649987729903, -0.26085302345579703, -0.16318434794689685, -0.21862898094886438, 0.02382426027897292, -0.07715459820234698, -0.13833762360924243, 0.3343291993396694, 0.16842223793555727, 0.20244127953887586, 0.04188085648062445, 0.32091035929527256, 0.02815289735667495, 0.1028614069160149, 0.03461133132707453, 0.1849910990997599, 0.08548561743173073, 0.028650098341992187, -0.20320963165441516, 0.07222544675030364, -0.03926832471730425]
|
1,803.09658
|
Theory of Strain-Induced Confinement in Transition Metal Dichalcogenide
Monolayers
|
Recent experimental studies of out-of-plane straining geometries of
transition metal dichalchogenide (TMD) monolayers have demonstrated sufficient
band gap renormalisation for device application such as single photon emitters.
Here, a simple continuum-mechanical plate-theory approach is used to estimate
the topography of TMD monolayers layered atop nanopillar arrays. From such
geometries, the induced conduction band potential and band gap renormalisation
is given, demonstrating a curvature of the potential that is independent of the
height of the deforming nanopillar. Additionally, with a semi-classical WKB
approximation, the expected escape rate of electrons in the strain potential
may be calculated as a function of the height of the deforming nanopillar. This
approach is in accordance with experiment, supporting recent findings
suggesting that increasing nanopillar height decreases the linewidth of the
single photon emitters observed at the tip of the pillar, and predicting the
shift in photon energy with nanopillar height for systems with consistent
topography.
|
cond-mat.mes-hall
|
recent experimental studies of outofplane straining geometries of transition metal dichalchogenide tmd monolayers have demonstrated sufficient band gap renormalisation for device application such as single photon emitters here a simple continuummechanical platetheory approach is used to estimate the topography of tmd monolayers layered atop nanopillar arrays from such geometries the induced conduction band potential and band gap renormalisation is given demonstrating a curvature of the potential that is independent of the height of the deforming nanopillar additionally with a semiclassical wkb approximation the expected escape rate of electrons in the strain potential may be calculated as a function of the height of the deforming nanopillar this approach is in accordance with experiment supporting recent findings suggesting that increasing nanopillar height decreases the linewidth of the single photon emitters observed at the tip of the pillar and predicting the shift in photon energy with nanopillar height for systems with consistent topography
|
[['recent', 'experimental', 'studies', 'of', 'outofplane', 'straining', 'geometries', 'of', 'transition', 'metal', 'dichalchogenide', 'tmd', 'monolayers', 'have', 'demonstrated', 'sufficient', 'band', 'gap', 'renormalisation', 'for', 'device', 'application', 'such', 'as', 'single', 'photon', 'emitters', 'here', 'a', 'simple', 'continuummechanical', 'platetheory', 'approach', 'is', 'used', 'to', 'estimate', 'the', 'topography', 'of', 'tmd', 'monolayers', 'layered', 'atop', 'nanopillar', 'arrays', 'from', 'such', 'geometries', 'the', 'induced', 'conduction', 'band', 'potential', 'and', 'band', 'gap', 'renormalisation', 'is', 'given', 'demonstrating', 'a', 'curvature', 'of', 'the', 'potential', 'that', 'is', 'independent', 'of', 'the', 'height', 'of', 'the', 'deforming', 'nanopillar', 'additionally', 'with', 'a', 'semiclassical', 'wkb', 'approximation', 'the', 'expected', 'escape', 'rate', 'of', 'electrons', 'in', 'the', 'strain', 'potential', 'may', 'be', 'calculated', 'as', 'a', 'function', 'of', 'the', 'height', 'of', 'the', 'deforming', 'nanopillar', 'this', 'approach', 'is', 'in', 'accordance', 'with', 'experiment', 'supporting', 'recent', 'findings', 'suggesting', 'that', 'increasing', 'nanopillar', 'height', 'decreases', 'the', 'linewidth', 'of', 'the', 'single', 'photon', 'emitters', 'observed', 'at', 'the', 'tip', 'of', 'the', 'pillar', 'and', 'predicting', 'the', 'shift', 'in', 'photon', 'energy', 'with', 'nanopillar', 'height', 'for', 'systems', 'with', 'consistent', 'topography']]
|
[-0.12815217942236953, 0.14071925818426348, -0.03856130738136352, -0.008032690588347364, -0.01316412200138673, -0.1401004334036636, 0.05695469359611005, 0.4436085821698176, -0.24720464479771986, -0.30923463571691673, -0.01975325092395155, -0.29371712571822556, -0.13323692155372188, 0.21993511400166774, 0.019283673260360956, 0.056261853144219734, 0.028825168614275753, -0.0741061397715653, -0.06784000811823362, -0.13396577944591542, 0.29800876152807937, 0.08158287796623155, 0.33897239363896065, 0.13406434851454807, 0.060397016787714, 0.006964571831822895, 0.07466425454312772, 0.03369728124844248, -0.15210476904562925, 0.09696276303405729, 0.2274511461239933, -0.08630986463700635, 0.21972242305242776, -0.43811130903711254, -0.23706359334365035, -0.012907068996733967, 0.14168951197233576, 0.15456794175138108, -0.0828754844006476, -0.26903669494235477, 0.04443782928005961, -0.13383370240050174, -0.17908689461885982, 0.009543428869430451, -0.0005309817192907251, 0.038498447642696006, -0.23701692623517556, 0.09105910515200172, 0.01104190786550409, 0.04537357640571442, -0.060494211474246024, -0.1003332115278498, -0.11289583718452616, 0.06638136373179646, 0.061891266057305286, 0.06701878450057726, 0.23602859733388729, -0.11066835487867711, -0.11818826566106522, 0.34999380668237706, -0.07732283821541991, -0.0995465384658751, 0.12743424504546874, -0.17855068671535826, -0.02158346032448763, 0.15817297204403868, 0.11757530085429949, 0.0908795804810404, -0.09407188927742259, 0.07848156911661636, -0.011926230821358477, 0.18569576573220625, 0.09608547213087296, 0.0341050491258877, 0.2556148230507595, 0.24186049346130767, 0.030698497328069688, 0.1215642806347272, -0.12390507711410123, -0.030778229374113498, -0.2726662785499263, -0.18096737368282356, -0.25103081168369357, 0.08539691055193543, -0.1178051983777843, -0.21613181632437162, 0.4058181276894956, 0.10390174203597621, 0.1755819116975337, 0.017684391590347827, 0.26305119473574645, 0.14380573712081504, 0.11871292931183973, -0.011021228821931763, 0.27067330194599676, 0.1678286280761154, 0.09010478457898502, -0.23171002046992664, 0.04331924661762712, -0.0248185593303568]
|
1,803.09659
|
A multilayer backpropagation saliency detection algorithm and its
applications
|
Saliency detection is an active topic in the multimedia field. Most previous
works on saliency detection focus on 2D images. However, these methods are not
robust against complex scenes which contain multiple objects or complex
backgrounds. Recently, depth information supplies a powerful cue for saliency
detection. In this paper, we propose a multilayer backpropagation saliency
detection algorithm based on depth mining by which we exploit depth cue from
three different layers of images. The proposed algorithm shows a good
performance and maintains the robustness in complex situations. Experiments'
results show that the proposed framework is superior to other existing saliency
approaches. Besides, we give two innovative applications by this algorithm,
such as scene reconstruction from multiple images and small target object
detection in video.
|
cs.CV
|
saliency detection is an active topic in the multimedia field most previous works on saliency detection focus on 2d images however these methods are not robust against complex scenes which contain multiple objects or complex backgrounds recently depth information supplies a powerful cue for saliency detection in this paper we propose a multilayer backpropagation saliency detection algorithm based on depth mining by which we exploit depth cue from three different layers of images the proposed algorithm shows a good performance and maintains the robustness in complex situations experiments results show that the proposed framework is superior to other existing saliency approaches besides we give two innovative applications by this algorithm such as scene reconstruction from multiple images and small target object detection in video
|
[['saliency', 'detection', 'is', 'an', 'active', 'topic', 'in', 'the', 'multimedia', 'field', 'most', 'previous', 'works', 'on', 'saliency', 'detection', 'focus', 'on', '2d', 'images', 'however', 'these', 'methods', 'are', 'not', 'robust', 'against', 'complex', 'scenes', 'which', 'contain', 'multiple', 'objects', 'or', 'complex', 'backgrounds', 'recently', 'depth', 'information', 'supplies', 'a', 'powerful', 'cue', 'for', 'saliency', 'detection', 'in', 'this', 'paper', 'we', 'propose', 'a', 'multilayer', 'backpropagation', 'saliency', 'detection', 'algorithm', 'based', 'on', 'depth', 'mining', 'by', 'which', 'we', 'exploit', 'depth', 'cue', 'from', 'three', 'different', 'layers', 'of', 'images', 'the', 'proposed', 'algorithm', 'shows', 'a', 'good', 'performance', 'and', 'maintains', 'the', 'robustness', 'in', 'complex', 'situations', 'experiments', 'results', 'show', 'that', 'the', 'proposed', 'framework', 'is', 'superior', 'to', 'other', 'existing', 'saliency', 'approaches', 'besides', 'we', 'give', 'two', 'innovative', 'applications', 'by', 'this', 'algorithm', 'such', 'as', 'scene', 'reconstruction', 'from', 'multiple', 'images', 'and', 'small', 'target', 'object', 'detection', 'in', 'video']]
|
[-0.04028207052408928, -0.03785902284911454, -0.06210018413126348, 0.03883093317704005, -0.09216153985940881, -0.1759785417009205, -0.04104997183387769, 0.49531336045296365, -0.21556840251263742, -0.3396465150219756, 0.0765875901185697, -0.27447178184745774, -0.2472223124125101, 0.2002595739961121, -0.1752487674107655, 0.10710667835871479, 0.13322288002969035, 0.0609696940218489, -0.02809061859443318, -0.2740213024935069, 0.29528123038190024, 0.040944488133273775, 0.36925820545894245, 0.031697304051880155, 0.13264027274788298, -0.017877032340038568, -0.09184132641812245, 0.027473619140143835, -0.0541266644077921, 0.173688638757965, 0.34217727284938576, 0.2173738685744484, 0.2569342878977618, -0.4135309505847193, -0.28826475512581845, 0.04902023728185844, 0.1275093496886022, 0.11835094643268554, -0.11119339729174821, -0.3939707697849841, 0.09777778291872012, -0.125442752712256, 0.05948494530973896, -0.128528909652584, -0.024181143174158228, -0.05691754579029587, -0.2680817676535357, 0.04410468850044474, 0.07640301873494361, 0.08112794939323419, -0.05226903688913632, -0.10275690987398248, 0.06548829041346307, 0.1658193414163355, 0.014722345182822356, 0.0384473777366727, 0.15591691593985044, -0.24975535404237528, -0.1605587479050061, 0.3633122886230628, -0.06032394552828684, -0.22934815634582792, 0.25401190564885073, -0.009260206273005854, -0.17282135530577733, 0.15859591688269808, 0.2112266153562814, 0.1863163967899445, -0.13104487927217456, -0.014938836351164707, -0.07200115300234287, 0.17619731558877375, 0.06137923918281411, 0.008520430258114732, 0.2216713839649944, 0.24033704544267348, 0.0844028783256128, 0.12783929811661027, -0.21874006477282232, -0.03786203425167309, -0.16332651291234088, -0.10440294417522607, -0.18056369317890775, -0.05811971449093694, -0.10444227769391634, -0.1434970809697857, 0.4277315005254481, 0.2909715661869174, 0.2395475507890355, 0.06326050744880171, 0.4381840135000886, 0.0015510434337380912, 0.09107548938763718, 0.05806941456431823, 0.19099372397777775, -0.011921620751250415, 0.10710271836573919, -0.11422671799007203, 0.0827153887648526, 0.09741480638190443]
|
1,803.0966
|
The Delta-calculus: syntax and types
|
We present the Delta-calculus, an explicitly typed lambda-calculus with
strong pairs, projections and explicit type coercions. The calculus can be
parametrized with different intersection type theories T, e.g. the
Coppo-Dezani, the Coppo-Dezani-Salle', the Coppo-Dezani-Venneri and the
Barendregt-Coppo-Dezani ones, producing a family of Delta-calculi with related
intersection type systems. We prove the main properties like Church-Rosser,
unicity of type, subject reduction, strong normalization, decidability of type
checking and type reconstruction. We state the relationship between the
intersection type assignment systems a` la Curry and the corresponding
intersection type systems a` la Church by means of an essence function
translating an explicitly typed Delta-term into a pure lambda-term one. We
finally translate a Delta-term with type coercions into an equivalent one
without them; the translation is proved to be coherent because its essence is
the identity. The generic Delta-calculus can be parametrized to take into
account other intersection type theories as the ones in the Barendregt et al.
book.
|
cs.LO
|
we present the deltacalculus an explicitly typed lambdacalculus with strong pairs projections and explicit type coercions the calculus can be parametrized with different intersection type theories t eg the coppodezani the coppodezanisalle the coppodezanivenneri and the barendregtcoppodezani ones producing a family of deltacalculi with related intersection type systems we prove the main properties like churchrosser unicity of type subject reduction strong normalization decidability of type checking and type reconstruction we state the relationship between the intersection type assignment systems a la curry and the corresponding intersection type systems a la church by means of an essence function translating an explicitly typed deltaterm into a pure lambdaterm one we finally translate a deltaterm with type coercions into an equivalent one without them the translation is proved to be coherent because its essence is the identity the generic deltacalculus can be parametrized to take into account other intersection type theories as the ones in the barendregt et al book
|
[['we', 'present', 'the', 'deltacalculus', 'an', 'explicitly', 'typed', 'lambdacalculus', 'with', 'strong', 'pairs', 'projections', 'and', 'explicit', 'type', 'coercions', 'the', 'calculus', 'can', 'be', 'parametrized', 'with', 'different', 'intersection', 'type', 'theories', 't', 'eg', 'the', 'coppodezani', 'the', 'coppodezanisalle', 'the', 'coppodezanivenneri', 'and', 'the', 'barendregtcoppodezani', 'ones', 'producing', 'a', 'family', 'of', 'deltacalculi', 'with', 'related', 'intersection', 'type', 'systems', 'we', 'prove', 'the', 'main', 'properties', 'like', 'churchrosser', 'unicity', 'of', 'type', 'subject', 'reduction', 'strong', 'normalization', 'decidability', 'of', 'type', 'checking', 'and', 'type', 'reconstruction', 'we', 'state', 'the', 'relationship', 'between', 'the', 'intersection', 'type', 'assignment', 'systems', 'a', 'la', 'curry', 'and', 'the', 'corresponding', 'intersection', 'type', 'systems', 'a', 'la', 'church', 'by', 'means', 'of', 'an', 'essence', 'function', 'translating', 'an', 'explicitly', 'typed', 'deltaterm', 'into', 'a', 'pure', 'lambdaterm', 'one', 'we', 'finally', 'translate', 'a', 'deltaterm', 'with', 'type', 'coercions', 'into', 'an', 'equivalent', 'one', 'without', 'them', 'the', 'translation', 'is', 'proved', 'to', 'be', 'coherent', 'because', 'its', 'essence', 'is', 'the', 'identity', 'the', 'generic', 'deltacalculus', 'can', 'be', 'parametrized', 'to', 'take', 'into', 'account', 'other', 'intersection', 'type', 'theories', 'as', 'the', 'ones', 'in', 'the', 'barendregt', 'et', 'al', 'book']]
|
[-0.11541650564041143, 0.0397440891538281, -0.06732696517370641, 0.11541210926137864, -0.12374949310906232, -0.1708667715638876, 0.032639295275245485, 0.2792933894259234, -0.34769097172344726, -0.27096439446943504, 0.09931556234369054, -0.25933787362184374, -0.10485966549254953, 0.1660211510118097, -0.12458634177688509, -0.045714071145048364, 0.023999759998793405, 0.032825649658528466, -0.07187537260120734, -0.2411332770778487, 0.369887245905896, -0.04414954347846409, 0.26482230484640845, 0.0018191962130367756, 0.06783512897023078, 0.051185313498911755, -0.0007910263057177265, 0.07102077028714121, -0.09774051025509835, 0.12876257311164713, 0.21666133200439314, 0.1795388599531725, 0.23445304992919166, -0.4151672194401423, -0.1503812918967257, 0.1322444924991578, 0.10565375247553069, 0.09906102183585365, -0.0021700594294816254, -0.31837761402130127, 0.08101533938509722, -0.18224969395436347, -0.11904569779833157, -0.060978117355455955, 0.02970041333697736, 0.03998947521128381, -0.2192185559372107, -0.009220047496880095, 0.16049832570832223, 0.06131373149032394, -0.07835464002331718, -0.08482482199712346, -0.028576066660073896, 0.09563403185767431, -0.011049723026032248, 0.018689818950369953, 0.03304240675177425, -0.0860416771347324, -0.13578641997572655, 0.3548360580279647, -0.061994138635151706, -0.20668555883069833, 0.19903150531152883, -0.02959024203941226, -0.15448543176054955, 0.07012877985058973, 0.08638219685138514, 0.12039250940084457, -0.11799141698206464, 0.1284317105030641, -0.03758086214462916, 0.18109819810759897, 0.08593342707026749, 0.03514300594727198, 0.1960498703426371, 0.12644024919718505, 0.0022584245245282847, 0.13867485786749362, 0.01110178677966663, -0.07539077767597822, -0.34680200193077326, -0.19735769550626478, -0.07355545483374347, 0.06291047810635064, -0.0780693692904121, -0.17210057507734747, 0.35803688384592536, 0.060141199969997006, 0.17197451883306106, 0.08882689617729435, 0.22941406985744833, 0.15131043317494913, 0.08360356776354214, 0.04968027121232202, 0.15590966668600836, 0.12230902195287248, 0.07003096434947413, -0.17850302268440524, 0.07222889571916312, 0.1913015382240216]
|
1,803.09661
|
Influence of stellar structure, evolution and rotation on the tidal
damping of exoplanetary spin-orbit angles
|
It is debated whether close-in giant planets can form in-situ and if not,
which mechanisms are responsible for their migration. One of the observable
tests for migration theories is the current value of the angle between the
stellar equatorial plane and the orbital plane, called the obliquity. After the
main migration mechanism has ended, the obliquity and the semi-major axis keep
on evolving due to the combined effects of tides and magnetic braking. The
observed correlation between effective temperature and measured projected
obliquity in known short-period systems has been taken as evidence of such
mechanisms being at play. Our aim is to produce an improved model for the tidal
evolution of the obliquity, including all the components of the dynamical tide
for circular misaligned systems. This model takes into account the strong
variations in structure and rotation of stars during their evolution, and their
consequences for the efficiency of tidal dissipation. We use an analytical
formulation for the frequency-averaged dissipation in convective layers for
each mode, depending only on global stellar parameters and rotation. For
typical hot-Jupiters orbital configurations, the obliquity is generally damped
on a much shorter timescale than the semi-major axis. The final outcome of
tidal evolution is also very sensitive to the initial conditions, with
Jupiter-mass planets being either quickly destroyed or brought on more distant
orbit, depending on the initial ratio of planetary orbital momentum to stellar
spin momentum. However we find that everything else being the same, the
evolution of the obliquity around low-mass stars with a thin convective zone is
not slower than around those with a thicker convective zone. On the contrary,
we find that more massive stars, remaining faster rotator throughout their
main-sequence, produce more efficient dissipation.
|
astro-ph.EP astro-ph.SR
|
it is debated whether closein giant planets can form insitu and if not which mechanisms are responsible for their migration one of the observable tests for migration theories is the current value of the angle between the stellar equatorial plane and the orbital plane called the obliquity after the main migration mechanism has ended the obliquity and the semimajor axis keep on evolving due to the combined effects of tides and magnetic braking the observed correlation between effective temperature and measured projected obliquity in known shortperiod systems has been taken as evidence of such mechanisms being at play our aim is to produce an improved model for the tidal evolution of the obliquity including all the components of the dynamical tide for circular misaligned systems this model takes into account the strong variations in structure and rotation of stars during their evolution and their consequences for the efficiency of tidal dissipation we use an analytical formulation for the frequencyaveraged dissipation in convective layers for each mode depending only on global stellar parameters and rotation for typical hotjupiters orbital configurations the obliquity is generally damped on a much shorter timescale than the semimajor axis the final outcome of tidal evolution is also very sensitive to the initial conditions with jupitermass planets being either quickly destroyed or brought on more distant orbit depending on the initial ratio of planetary orbital momentum to stellar spin momentum however we find that everything else being the same the evolution of the obliquity around lowmass stars with a thin convective zone is not slower than around those with a thicker convective zone on the contrary we find that more massive stars remaining faster rotator throughout their mainsequence produce more efficient dissipation
|
[['it', 'is', 'debated', 'whether', 'closein', 'giant', 'planets', 'can', 'form', 'insitu', 'and', 'if', 'not', 'which', 'mechanisms', 'are', 'responsible', 'for', 'their', 'migration', 'one', 'of', 'the', 'observable', 'tests', 'for', 'migration', 'theories', 'is', 'the', 'current', 'value', 'of', 'the', 'angle', 'between', 'the', 'stellar', 'equatorial', 'plane', 'and', 'the', 'orbital', 'plane', 'called', 'the', 'obliquity', 'after', 'the', 'main', 'migration', 'mechanism', 'has', 'ended', 'the', 'obliquity', 'and', 'the', 'semimajor', 'axis', 'keep', 'on', 'evolving', 'due', 'to', 'the', 'combined', 'effects', 'of', 'tides', 'and', 'magnetic', 'braking', 'the', 'observed', 'correlation', 'between', 'effective', 'temperature', 'and', 'measured', 'projected', 'obliquity', 'in', 'known', 'shortperiod', 'systems', 'has', 'been', 'taken', 'as', 'evidence', 'of', 'such', 'mechanisms', 'being', 'at', 'play', 'our', 'aim', 'is', 'to', 'produce', 'an', 'improved', 'model', 'for', 'the', 'tidal', 'evolution', 'of', 'the', 'obliquity', 'including', 'all', 'the', 'components', 'of', 'the', 'dynamical', 'tide', 'for', 'circular', 'misaligned', 'systems', 'this', 'model', 'takes', 'into', 'account', 'the', 'strong', 'variations', 'in', 'structure', 'and', 'rotation', 'of', 'stars', 'during', 'their', 'evolution', 'and', 'their', 'consequences', 'for', 'the', 'efficiency', 'of', 'tidal', 'dissipation', 'we', 'use', 'an', 'analytical', 'formulation', 'for', 'the', 'frequencyaveraged', 'dissipation', 'in', 'convective', 'layers', 'for', 'each', 'mode', 'depending', 'only', 'on', 'global', 'stellar', 'parameters', 'and', 'rotation', 'for', 'typical', 'hotjupiters', 'orbital', 'configurations', 'the', 'obliquity', 'is', 'generally', 'damped', 'on', 'a', 'much', 'shorter', 'timescale', 'than', 'the', 'semimajor', 'axis', 'the', 'final', 'outcome', 'of', 'tidal', 'evolution', 'is', 'also', 'very', 'sensitive', 'to', 'the', 'initial', 'conditions', 'with', 'jupitermass', 'planets', 'being', 'either', 'quickly', 'destroyed', 'or', 'brought', 'on', 'more', 'distant', 'orbit', 'depending', 'on', 'the', 'initial', 'ratio', 'of', 'planetary', 'orbital', 'momentum', 'to', 'stellar', 'spin', 'momentum', 'however', 'we', 'find', 'that', 'everything', 'else', 'being', 'the', 'same', 'the', 'evolution', 'of', 'the', 'obliquity', 'around', 'lowmass', 'stars', 'with', 'a', 'thin', 'convective', 'zone', 'is', 'not', 'slower', 'than', 'around', 'those', 'with', 'a', 'thicker', 'convective', 'zone', 'on', 'the', 'contrary', 'we', 'find', 'that', 'more', 'massive', 'stars', 'remaining', 'faster', 'rotator', 'throughout', 'their', 'mainsequence', 'produce', 'more', 'efficient', 'dissipation']]
|
[-0.16057794106870954, 0.19203828864643072, -0.07670831404904133, 0.09714778214407137, -0.1128157264577519, -0.06080724563523147, 0.026426262567800125, 0.36093567377895835, -0.21681684332393242, -0.32580357789993286, 0.08010483516845852, -0.21916614703245854, -0.06806133539955082, 0.23546252790103225, -0.030522262764146976, -0.006454629705924737, 0.10616632088969805, -0.01327865511963242, -0.05777367127634454, -0.2370864738975733, 0.3016934614211909, 0.07670674800735963, 0.11387386938981843, -0.0251320818439126, 0.04486983622906305, -0.04064628585780922, 0.021800556293026987, -0.0492461564934306, -0.15437002922188728, 0.01440422645598454, 0.14232464516065654, 0.08445970046889495, 0.24007831540105767, -0.44309756542441614, -0.1829032041524586, 0.05509034997514008, 0.17554075514505568, 0.08497922272266199, -0.0276513179665607, -0.21772653741533296, 0.06107388765698201, -0.18775610062538794, -0.1895090460429058, -0.009208671440035432, 0.1269727465680294, -0.009296693581385178, -0.26058260821410567, 0.11577665651413171, 0.10992985609377603, 0.11200716499598665, -0.14067352728166602, -0.12285286110352006, -0.1459077744810074, 0.09819834295807309, 0.10259671270144743, 0.05605172075233177, 0.18608192153103453, -0.09441814655642303, -0.018143269772388105, 0.4171539698367971, -0.059334601930305854, -0.13721361192139356, 0.23924009553565267, -0.2188970075989665, -0.09332380422407337, 0.13858890026366633, 0.19796206388589843, 0.12818962692266755, -0.12681222482719215, -0.02364257455296945, 0.03028945006070691, 0.1836615912146507, 0.07035924960091187, 0.03273973232707041, 0.3772060984712944, 0.15348986683274504, 0.0662691714970973, 0.051180591860279574, -0.1774740935909856, -0.11390459803423207, -0.17191042344559704, -0.09784770818557917, -0.12577668220047805, 0.04072311706207856, -0.09691387220620783, -0.14513190297998096, 0.3638286080905808, 0.1585816306981111, 0.18454349727141098, 0.017923900252616587, 0.3263251383445765, 0.10858102862216663, 0.12922076902172544, 0.13969479289003892, 0.3493612889625263, 0.15872357616103008, 0.08870619674067201, -0.29393394374566384, 0.1693227498432654, -0.020658350261255055]
|
1,803.09662
|
Invariant Properties of Fatou Set, Julia Set and Escaping Set of
Holomorphic Semigroup
|
In this paper, we prove that escaping set of transcendental semigroup is
S-forward invariant. We also prove that if holomorphic semigroup is abelian,
then Fatou set, Julia set and escaping set are S-completely invariant. We see
certain cases and conditions that the holomorphic semigroup dynamics exhibits
same dynamical behavior just like the classical complex dynamics. Frequently,
we also examine certain amount of connection and contrast between classical
complex dynamics and holomorphic semigroup dynamics.
|
math.DS
|
in this paper we prove that escaping set of transcendental semigroup is sforward invariant we also prove that if holomorphic semigroup is abelian then fatou set julia set and escaping set are scompletely invariant we see certain cases and conditions that the holomorphic semigroup dynamics exhibits same dynamical behavior just like the classical complex dynamics frequently we also examine certain amount of connection and contrast between classical complex dynamics and holomorphic semigroup dynamics
|
[['in', 'this', 'paper', 'we', 'prove', 'that', 'escaping', 'set', 'of', 'transcendental', 'semigroup', 'is', 'sforward', 'invariant', 'we', 'also', 'prove', 'that', 'if', 'holomorphic', 'semigroup', 'is', 'abelian', 'then', 'fatou', 'set', 'julia', 'set', 'and', 'escaping', 'set', 'are', 'scompletely', 'invariant', 'we', 'see', 'certain', 'cases', 'and', 'conditions', 'that', 'the', 'holomorphic', 'semigroup', 'dynamics', 'exhibits', 'same', 'dynamical', 'behavior', 'just', 'like', 'the', 'classical', 'complex', 'dynamics', 'frequently', 'we', 'also', 'examine', 'certain', 'amount', 'of', 'connection', 'and', 'contrast', 'between', 'classical', 'complex', 'dynamics', 'and', 'holomorphic', 'semigroup', 'dynamics']]
|
[-0.16361189282066385, 0.1102806649000292, -0.09173388049845964, 0.14549743207860213, -0.12321350037146517, -0.0991488368739046, -0.003367506841551775, 0.33176605162066475, -0.4006471697857577, -0.15685729043636942, 0.110083483207092, -0.3191412109094606, -0.22867402990519162, 0.2114464514692065, -0.06894607731783894, 0.06729991756982996, 0.08075765604284448, 0.07547970463744771, -0.058553177745304476, -0.23176020861301624, 0.4511680253846964, -0.08029842897462593, 0.18228784114332267, 0.06593727805769779, 0.12408028044541117, -0.05172209890270737, -0.0016743546273087111, -0.025212822916318416, -0.1594379813012521, 0.0387887353025062, 0.2191332422432975, 0.14520026410890507, 0.2411439499725968, -0.4158713303794953, -0.15613185341509295, 0.26507634373093153, 0.14310582607827135, -0.04339447788054675, -0.015015343696036389, -0.23844313511336354, 0.10458826717041747, -0.11773050642362468, -0.19103147006842872, -0.17849422651539806, 0.09664391492768912, 0.03947397010256602, -0.24093351169476207, 0.021285489928731565, 0.147511655023292, 0.14102662916124706, -0.03555934718141044, 0.014690577905152885, -0.10644881715866882, 0.05766524656505232, 0.0018648303271284405, 0.03978707350488805, 0.19280223476267616, -0.05034980656985771, -0.07191351644406227, 0.3179165573764435, -0.0763118895292151, -0.24326643185086652, 0.23968696646707158, -0.2597384862601757, -0.19761490907756166, 0.13559955334566323, 0.09074536899865514, 0.1178116629746231, -0.13665260518835465, 0.1967741595548381, -0.18107843123586245, 0.1087595166664728, 0.09746561705423387, 0.03828064831708309, 0.10129293430806466, 0.0780094979908055, 0.09406318183509554, 0.18974201634368845, 0.04872263831571794, -0.13902988389764034, -0.3567535584582619, -0.14349390243665433, -0.09490194124445109, 0.16317232330919992, -0.0699953142624073, -0.2124415068218196, 0.42294099898090665, 0.16177573348034802, 0.15673518768498595, 0.126164288220691, 0.1885876378149424, 0.10731660065152616, -0.05906158462691475, 0.1354672524710776, 0.12035700348271451, 0.12700201930399513, -0.022198916714586004, -0.17634593076925253, 0.004338081781817994, 0.17835523692799182]
|
1,803.09663
|
On negative association of some finite point processes on general state
spaces, extended version
|
We study negative association (NA) for mixed sampled point processes and show
that NA holds for such processes if the random number of points of them
fulfills ULC property. We connect NA property of point processes with dcx
dependence ordering and show some consequences of it for mixed sampled and
determinantal point processes. Some applications illustrate general theory.
|
math.PR
|
we study negative association na for mixed sampled point processes and show that na holds for such processes if the random number of points of them fulfills ulc property we connect na property of point processes with dcx dependence ordering and show some consequences of it for mixed sampled and determinantal point processes some applications illustrate general theory
|
[['we', 'study', 'negative', 'association', 'na', 'for', 'mixed', 'sampled', 'point', 'processes', 'and', 'show', 'that', 'na', 'holds', 'for', 'such', 'processes', 'if', 'the', 'random', 'number', 'of', 'points', 'of', 'them', 'fulfills', 'ulc', 'property', 'we', 'connect', 'na', 'property', 'of', 'point', 'processes', 'with', 'dcx', 'dependence', 'ordering', 'and', 'show', 'some', 'consequences', 'of', 'it', 'for', 'mixed', 'sampled', 'and', 'determinantal', 'point', 'processes', 'some', 'applications', 'illustrate', 'general', 'theory']]
|
[-0.08756339022536473, 0.1484652003273368, -0.05493640239703758, 0.12463280693467321, -0.029361690852213008, -0.17957647706799465, 0.11654788413655078, 0.4003173352765112, -0.33294837048341486, -0.1750732272188982, 0.044117260563733246, -0.31081472003254396, -0.20693778612747274, 0.1506356081828989, -0.014765858032002017, 0.0028954348607181475, 0.05629226167140336, -0.0025062459071391614, -0.04201384336318307, -0.23206468934899774, 0.37384967365430605, -0.024922308030313457, 0.25403860280418705, 0.07953176869818106, 0.106832585161038, 0.04982522226356227, -0.02895030707666843, 0.04268441845036658, -0.11449194000946089, 0.025485618285842816, 0.2363964954053919, 0.1582227672996192, 0.23269375280782195, -0.38556497255019073, -0.24462003292162612, 0.1607127767859091, 0.06255366406724627, 0.045828421824964986, -0.1232347674828408, -0.2079853182658553, 0.1458808897737542, -0.06307604815008054, -0.23109854815592026, -0.09774579338986299, 0.048105027486473835, 0.09474955623214744, -0.35210367789941616, 0.022610537964722205, 0.11255594501914136, 0.10658216125588736, -0.032404617807860005, -0.20154949818569204, -0.033253149643283464, 0.08525412663785291, 0.012844121364619711, -0.07616992798585702, 0.11726658602630527, -0.08716012563171058, -0.14627295260815398, 0.36287878816626196, -0.02101743057498644, -0.1615179362867413, 0.21824556047996058, -0.18987276562457456, -0.23398522202102146, 0.10390317838253646, 0.14232971615675868, 0.12090807795074993, -0.12215558905154467, 0.1333079065109908, -0.027279247754606707, 0.07561893065024472, 0.0962048318108608, 0.1110680345054475, 0.1429872464003234, 0.10927993627586241, 0.08764904018908996, 0.09842342163982062, -0.056698502583834666, -0.14733633977071992, -0.3333179491796884, -0.21284695761278272, -0.15407257051817302, 0.057151777950789906, -0.12741481695762746, -0.16643858004104475, 0.2757431033412637, 0.17817220252794053, 0.2260334511159052, 0.05410154398273805, 0.16446364859263574, 0.11127488160955495, -0.0402440986885079, 0.06936575376011174, 0.11258417708851429, 0.15913175245554284, 0.049925339897966076, -0.15149972680956125, 0.10566565872908666, 0.041293853990219793]
|
1,803.09664
|
On mixed Hessians and the Lefschetz properties
|
We introduce a new type of Hessian matrix, that we call Mixed Hessian. The
mixed Hessian is used to compute the rank of a multiplication map by a power of
a linear form in a standard graded Artinian Gorenstein algebra. In particular
we recover the main result of \cite{MW} for identifying Strong Lefschetz
elements, generalizing it also for Weak Lefschetz elements. This criterion is
also used to give a new proof that Boolean algebras have the Strong Lefschetz
Property (SLP). We also construct new examples of Artinian Gorenstein algebras
presented by quadrics that does not satisfy the Weak Lefschetz Property (WLP);
we construct minimal examples of such algebras and we give bounds, depending on
the degree, for their existence. Artinian Gorenstein algebras presented by
quadrics were conjectured to satisfy WLP in \cite{MN1,MN2}, and in a previous
paper we construct the first counter-examples (see \cite{GZ}).
|
math.AC math.AG
|
we introduce a new type of hessian matrix that we call mixed hessian the mixed hessian is used to compute the rank of a multiplication map by a power of a linear form in a standard graded artinian gorenstein algebra in particular we recover the main result of citemw for identifying strong lefschetz elements generalizing it also for weak lefschetz elements this criterion is also used to give a new proof that boolean algebras have the strong lefschetz property slp we also construct new examples of artinian gorenstein algebras presented by quadrics that does not satisfy the weak lefschetz property wlp we construct minimal examples of such algebras and we give bounds depending on the degree for their existence artinian gorenstein algebras presented by quadrics were conjectured to satisfy wlp in citemn1mn2 and in a previous paper we construct the first counterexamples see citegz
|
[['we', 'introduce', 'a', 'new', 'type', 'of', 'hessian', 'matrix', 'that', 'we', 'call', 'mixed', 'hessian', 'the', 'mixed', 'hessian', 'is', 'used', 'to', 'compute', 'the', 'rank', 'of', 'a', 'multiplication', 'map', 'by', 'a', 'power', 'of', 'a', 'linear', 'form', 'in', 'a', 'standard', 'graded', 'artinian', 'gorenstein', 'algebra', 'in', 'particular', 'we', 'recover', 'the', 'main', 'result', 'of', 'citemw', 'for', 'identifying', 'strong', 'lefschetz', 'elements', 'generalizing', 'it', 'also', 'for', 'weak', 'lefschetz', 'elements', 'this', 'criterion', 'is', 'also', 'used', 'to', 'give', 'a', 'new', 'proof', 'that', 'boolean', 'algebras', 'have', 'the', 'strong', 'lefschetz', 'property', 'slp', 'we', 'also', 'construct', 'new', 'examples', 'of', 'artinian', 'gorenstein', 'algebras', 'presented', 'by', 'quadrics', 'that', 'does', 'not', 'satisfy', 'the', 'weak', 'lefschetz', 'property', 'wlp', 'we', 'construct', 'minimal', 'examples', 'of', 'such', 'algebras', 'and', 'we', 'give', 'bounds', 'depending', 'on', 'the', 'degree', 'for', 'their', 'existence', 'artinian', 'gorenstein', 'algebras', 'presented', 'by', 'quadrics', 'were', 'conjectured', 'to', 'satisfy', 'wlp', 'in', 'citemn1mn2', 'and', 'in', 'a', 'previous', 'paper', 'we', 'construct', 'the', 'first', 'counterexamples', 'see', 'citegz']]
|
[-0.1421151917128192, -0.027418909877721036, -0.08468546136119566, 0.13454123866871337, -0.10482821315592089, -0.22463452544102405, -0.047353780487311314, 0.33634571358887155, -0.3479699491607872, -0.1653520478443666, 0.10480008429320126, -0.22177982547674963, -0.1787971260801114, 0.15083261859974453, -0.17955459122565556, -0.007029343396425247, 0.04782103683324889, 0.0321475739095855, -0.12292566685611708, -0.34455767037653057, 0.420284599401187, -0.018665941604706165, 0.19186225733426693, 0.10203158567900529, 0.1428655238000988, 0.027628625612836202, 0.0004727798579195579, 0.03502743566812543, -0.20355364858652944, 0.12365682707457165, 0.2983145907495197, 0.12897038935533875, 0.20788944112071833, -0.399371417734277, -0.06710953171645011, 0.23900755992406733, 0.11568808200658409, 0.05338438183323226, -0.08441550965613027, -0.19873312120879447, 0.17178153376916416, -0.1974671940260015, -0.1738536380918475, -0.14234667734594664, 0.029264867345646182, 0.035468778020207335, -0.2770609154978155, 0.007920914216632987, 0.13607097553232542, 0.15144574250765405, -0.039701846506368446, -0.07472412644110464, -0.04168825868478084, 0.014036987344832061, -0.06070868224491711, -0.04749815126594443, 0.06770476456601303, -0.06611854882122806, -0.1562688612538696, 0.31995725198616304, -0.029203587449383693, -0.2181633286099959, 0.12930011712104225, -0.12658061191498243, -0.20305985487977993, 0.1068797630943371, 0.07213187200779264, 0.145231359452864, -0.0565012180852098, 0.17315340105857752, -0.18789530629487514, 0.07974763928873503, 0.12528370211382847, 0.014625117263733898, 0.09086158242519501, 0.061374336932101974, 0.09940872125334099, 0.1619407426096968, 0.03764400780819669, 0.02907127136416681, -0.3820289988982511, -0.2183594211831793, -0.13088025653839008, 0.13642603679817786, -0.09990643262126404, -0.18846012909743623, 0.4340325861605913, 0.1480536643754352, 0.17120964009106368, 0.15305040197095254, 0.2290433608369993, 0.0611935603543074, 0.09804536793478667, 0.04902217033078204, 0.19426722533128166, 0.267056915446647, 0.03435117553698121, -0.07305425856184293, 0.009968868217437522, 0.2678583206875914]
|
1,803.09665
|
Underactuated Hand Design Using Mechanically Realizable Manifolds
|
Hand synergies, or joint coordination patterns, have become an effective tool
for achieving versatile robotic grasping with simple hands or planning
algorithms. Here we propose a method to determine the hand synergies such that
they can be physically implemented in an underactuated fashion. Given a
kinematic hand model and a set of desired grasps, our algorithm optimizes a
Mechanically Realizable Manifold designed to be achievable by a physical
underactuation mechanism, enabling the resulting hand to achieve the desired
grasps with few actuators. Furthermore, in contrast to existing methods for
determining synergies which are only concerned with hand posture, our method
explicitly optimizes the stability of the target grasps. We implement this
method in the design of a three-finger single-actuator hand as an example, and
evaluate its effectiveness numerically and experimentally.
|
cs.RO
|
hand synergies or joint coordination patterns have become an effective tool for achieving versatile robotic grasping with simple hands or planning algorithms here we propose a method to determine the hand synergies such that they can be physically implemented in an underactuated fashion given a kinematic hand model and a set of desired grasps our algorithm optimizes a mechanically realizable manifold designed to be achievable by a physical underactuation mechanism enabling the resulting hand to achieve the desired grasps with few actuators furthermore in contrast to existing methods for determining synergies which are only concerned with hand posture our method explicitly optimizes the stability of the target grasps we implement this method in the design of a threefinger singleactuator hand as an example and evaluate its effectiveness numerically and experimentally
|
[['hand', 'synergies', 'or', 'joint', 'coordination', 'patterns', 'have', 'become', 'an', 'effective', 'tool', 'for', 'achieving', 'versatile', 'robotic', 'grasping', 'with', 'simple', 'hands', 'or', 'planning', 'algorithms', 'here', 'we', 'propose', 'a', 'method', 'to', 'determine', 'the', 'hand', 'synergies', 'such', 'that', 'they', 'can', 'be', 'physically', 'implemented', 'in', 'an', 'underactuated', 'fashion', 'given', 'a', 'kinematic', 'hand', 'model', 'and', 'a', 'set', 'of', 'desired', 'grasps', 'our', 'algorithm', 'optimizes', 'a', 'mechanically', 'realizable', 'manifold', 'designed', 'to', 'be', 'achievable', 'by', 'a', 'physical', 'underactuation', 'mechanism', 'enabling', 'the', 'resulting', 'hand', 'to', 'achieve', 'the', 'desired', 'grasps', 'with', 'few', 'actuators', 'furthermore', 'in', 'contrast', 'to', 'existing', 'methods', 'for', 'determining', 'synergies', 'which', 'are', 'only', 'concerned', 'with', 'hand', 'posture', 'our', 'method', 'explicitly', 'optimizes', 'the', 'stability', 'of', 'the', 'target', 'grasps', 'we', 'implement', 'this', 'method', 'in', 'the', 'design', 'of', 'a', 'threefinger', 'singleactuator', 'hand', 'as', 'an', 'example', 'and', 'evaluate', 'its', 'effectiveness', 'numerically', 'and', 'experimentally']]
|
[-0.08421957410428149, 0.04687170703925858, -0.10925856394442235, 0.03021041863667051, -0.13818083392834524, -0.23683200581217534, 0.05585593217983842, 0.4505670430662576, -0.250348922178091, -0.3462865424080519, 0.11671704877062439, -0.1946889680584718, -0.21194519457276328, 0.24688742890975846, -0.09734340341674397, 0.08743012589502541, 0.07596748432590061, 0.04584066911775153, -0.03508482841266414, -0.23278509140800452, 0.26590238898279495, 0.05812659944058396, 0.2683421581732546, 0.032270471992887906, 0.18771652808209183, -0.020034220048046336, 0.037304882131138584, 0.04466263786525815, -0.08351350781487099, 0.17183350363029604, 0.2888632645699545, 0.15529538038026658, 0.2899053528526565, -0.4119693747566089, -0.16674230414355407, 0.10033832938643172, 0.14916928991806344, 0.1372529289656086, -0.04996560852305265, -0.307968158791482, 0.08050444158652681, -0.16251341362658422, -0.12754191477506538, -0.15111227057059295, -0.039485788245656295, 0.013147240464604693, -0.3056564626022009, -0.04501516073764833, 0.02218574249127414, 0.05536782888520975, -0.09535120184682455, -0.05835384180682013, 0.012773416261552484, 0.1955478001436859, 0.0003739502226380864, 0.02347477699368028, 0.19134856304435743, -0.13785162464904488, -0.16119875758931812, 0.4095244101481512, 0.013632104194130079, -0.2628132571844617, 0.2154702772058954, -0.0412263452562911, -0.12593335703240882, 0.07806915860419394, 0.2014255385947763, 0.18577853521856014, -0.16316455748892622, 0.014596170623462967, -0.004516428745773737, 0.19786788988130866, 0.029780912989735953, 0.00121940487952088, 0.18982189789130643, 0.22750840900880576, 0.12580681389817983, 0.14010470302127942, -0.07858769242375274, -0.04462528812655364, -0.23193038567478652, -0.12646164563011553, -0.16159984574187547, -0.06494904795908951, -0.057867841165375467, -0.12519497375251376, 0.3845051099633565, 0.20947973804788944, 0.1902328912874509, 0.07837768098852393, 0.39100212142511737, 0.04929097334400012, 0.061200658539746655, 0.07395254196126189, 0.25765256480553944, -0.008645180210805847, 0.05471014848808409, -0.22816289140973822, 0.09699811665268498, 0.03802156022061354]
|
1,803.09666
|
Ground state solutions of inhomogeneous Bethe equations
|
The distribution of Bethe roots, solution of the inhomogeneous Bethe
equations, which characterize the ground state of the periodic XXX Heisenberg
spin-$\frac{1}{2}$ chain is investigated. Numerical calculations shows that,
for this state, the new inhomogeneous term does not contribute to the Baxter
T-Q equation in the thermodynamic limit. Different families of Bethe roots are
identified and their large N behaviour are conjectured and validated.
|
math-ph hep-th math.MP
|
the distribution of bethe roots solution of the inhomogeneous bethe equations which characterize the ground state of the periodic xxx heisenberg spinfrac12 chain is investigated numerical calculations shows that for this state the new inhomogeneous term does not contribute to the baxter tq equation in the thermodynamic limit different families of bethe roots are identified and their large n behaviour are conjectured and validated
|
[['the', 'distribution', 'of', 'bethe', 'roots', 'solution', 'of', 'the', 'inhomogeneous', 'bethe', 'equations', 'which', 'characterize', 'the', 'ground', 'state', 'of', 'the', 'periodic', 'xxx', 'heisenberg', 'spinfrac12', 'chain', 'is', 'investigated', 'numerical', 'calculations', 'shows', 'that', 'for', 'this', 'state', 'the', 'new', 'inhomogeneous', 'term', 'does', 'not', 'contribute', 'to', 'the', 'baxter', 'tq', 'equation', 'in', 'the', 'thermodynamic', 'limit', 'different', 'families', 'of', 'bethe', 'roots', 'are', 'identified', 'and', 'their', 'large', 'n', 'behaviour', 'are', 'conjectured', 'and', 'validated']]
|
[-0.2166054906847421, 0.1481371678528376, -0.03870144146912935, 0.0889740378188435, -0.08602049120236188, -0.11017240167711861, -0.011706156528816791, 0.2891383997630328, -0.25783954735925363, -0.22106146506848745, 0.07736883822690288, -0.32811742464400595, -0.06666300820143078, 0.1392320741979347, 0.09805291107477387, 0.07952630905492697, 0.07859089416160714, 0.0742285613232525, -0.11560544452731847, -0.2547895942698233, 0.3097162491758354, -0.007795511715812609, 0.3139291056286311, 0.023856239393353462, 0.11243287062097806, 0.0007444298753398471, 0.07900062439148314, -0.02616398796089925, -0.19080976439420283, 0.07411362545826705, 0.24480720460996963, 0.03633376388461329, 0.1349338771251496, -0.4439790207252372, -0.16982202374492772, 0.10993330433120718, 0.22625546932977159, 0.14866871247613744, 0.05873945065832231, -0.30827963510819245, 0.019284815249193343, -0.214741697156569, -0.28034577624930535, -0.11421815871290164, 0.003515112941386178, 0.08011770341545343, -0.2276945489938953, 0.11755862351128599, 0.07376688358635874, 0.07072243317350058, -0.12376972143101739, -0.20038143188867252, -0.05454486649250612, 0.11971127279684879, 0.033977476130530704, -0.04587695448572049, -0.004051322081068065, -0.11633676813653437, -0.09395781041530427, 0.31311621668282896, -0.0040383006853517145, -0.22974514011730207, 0.13474236769798154, -0.14487097374512814, -0.13489650562405586, 0.13841029474860989, 0.06432148200110532, 0.09242137693217956, -0.21371521230321378, 0.16375108175816422, -0.08432726751016162, 0.1501088865334168, 0.030777344218222424, -0.054656277257890906, 0.135624518210534, 0.0596738384811033, -0.023180017626145855, 0.19336406758520752, 0.016683216352248564, -0.2293951509927865, -0.2821818775846623, -0.13392535003367811, -0.26110149439409724, 0.1185086416046488, -0.11288733223000236, -0.25847279844310833, 0.3477557893493213, 0.16056110670753299, 0.13415276072191773, 0.04300083022280887, 0.11786045677581569, 0.1683121263195062, -0.014436336674407357, 0.09133265809089153, 0.19035096408697427, 0.20867517858278006, 0.059608456314890645, -0.3092854917704244, 0.04579264544281614, 0.15233880176674575]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.