chunk_uid stringlengths 40 40 | chunk_type stringclasses 2
values | chunk_index int64 0 6.71k | total_chunks int64 1 6.71k | section_title stringlengths 1 157 | embed_text stringlengths 1 83.3k | spans dict | paper_doi stringlengths 0 63 | paper_id_arxiv stringlengths 9 16 | title stringlengths 7 245 | authors listlengths 1 768 | categories listlengths 1 7 | year int64 2k 2.02k | language stringclasses 2
values | discipline stringclasses 8
values | dense_vector listlengths 1.02k 1.02k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
6b8aaa3a16daf1881ecfc19fc8c7d5b8ac4bdd8c | subsection | 15 | 21 | Non-isoplanatism and large field imaging | The image is clipped so that only the central disk of radius Ma remains (see Fig. REF ).
The simulations of Fig. REF show that, for rapidely varying
object fields, light is observed outside the central disk of radius Ma.
More complex effects are exhibited, but clipping do not occur anymore. In many applications of
cohe... | {
"cite_spans": []
} | 10.1016/j.optcom.2008.10.058 | 0807.1718 | Coherent imaging of extended objects | [
"E. Brainis",
"C. Muldoon",
"L. Brandt",
"A. Kuhn"
] | [
"physics.optics"
] | 2,008 | en | Physics | [
-0.05725456029176712,
-0.007771024480462074,
-0.03665390610694885,
-0.02597208507359028,
0.002615138655528426,
0.024507148191332817,
0.024949681013822556,
0.05609481781721115,
0.00512345926836133,
-0.014496756717562675,
-0.02243182435631752,
0.001360978465527296,
0.006122972350567579,
0.04... |
23f182b5ef24fbc3ee85c5cbd34cd68b5bd14ddb | subsection | 16 | 21 | Isoplanatic imaging through a thin
lens | In Sec. , we claimed that
isoplanatic imaging is possible with a thin lens
when the object lies on the spherical surface \mathcal {S}_o and
the image is observed on the spherical surface \mathcal {S}_i.
Let's examine this statement more closely.Referring to Fig. REF , simple Gaussian Optics arguments suggest
that if th... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 978,
"openalex_id": "",
"raw": "E. Hecht, Optics Fourth Ed., Addison Wesley, San Francisco, 2002",
"source_ref_id": "d5aabe8294a12d3f1eb89620b9c9e07804dabef9",
"start": 885
},
{
"arxiv_id": "",
"doi... | 10.1016/j.optcom.2008.10.058 | 0807.1718 | Coherent imaging of extended objects | [
"E. Brainis",
"C. Muldoon",
"L. Brandt",
"A. Kuhn"
] | [
"physics.optics"
] | 2,008 | en | Physics | [
-0.045383475720882416,
0.01945660077035427,
-0.01632828451693058,
-0.015824703499674797,
0.02324110083281994,
-0.0085685346275568,
-0.03262605145573616,
-0.01347465068101883,
0.011200898326933384,
0.033083852380514145,
-0.012559046037495136,
0.008240442723035812,
0.01776273362338543,
0.053... |
87a52fb5b38759038e6f672be6091a29e4110b24 | subsection | 17 | 21 | Isoplanatic imaging through a thin
lens | This
lens must act as a pure phase-correction transparency.
Similarly, on the image side, a thin lens of focal length z_i
placed just after (or before) the image plane can be used to
project the image from S_i onto \mathcal {I}.
From a broader point of view, any spherical field distribution in
the object space of a cen... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 618,
"openalex_id": "",
"raw": "G. Bonnet, Ann. Télécommunic. 33 (1978) 143-165",
"source_ref_id": "9aa7e832b1e2d836592ebacb2483873716052b21",
"start": 530
},
{
"arxiv_id": "",
"doi": "",
"end... | 10.1016/j.optcom.2008.10.058 | 0807.1718 | Coherent imaging of extended objects | [
"E. Brainis",
"C. Muldoon",
"L. Brandt",
"A. Kuhn"
] | [
"physics.optics"
] | 2,008 | en | Physics | [
-0.05471397191286087,
0.0039822496473789215,
0.003072511637583375,
0.004184413701295853,
0.017897237092256546,
0.003085861913859844,
-0.008010271936655045,
0.029096359387040138,
0.009253771975636482,
0.008086560294032097,
-0.04620019719004631,
0.0050464714877307415,
0.015509412623941898,
0... |
3c30158098059df151118e7a48ce448457f85b64 | subsection | 18 | 21 | Experimental investigation | The theoretical discussion of Secs. and
relies on two strong approximations: the paraxial approximation and
the thin lens approximation. One may wonder whether our analysis is
robust enough to be applied to systems containing powerful lenses,
which are usually thick and have a high numerical aperture. The
following e... | {
"cite_spans": []
} | 10.1016/j.optcom.2008.10.058 | 0807.1718 | Coherent imaging of extended objects | [
"E. Brainis",
"C. Muldoon",
"L. Brandt",
"A. Kuhn"
] | [
"physics.optics"
] | 2,008 | en | Physics | [
-0.07897623628377914,
0.002868534065783024,
-0.03744352236390114,
-0.028624307364225388,
-0.0006565777002833784,
0.0006746967555955052,
-0.003002042882144451,
0.011359700001776218,
0.0035971112083643675,
-0.0023631074000149965,
-0.012114978395402431,
0.03295762464404106,
0.015357337892055511... |
22a486ac73235c70087c1221acda7fff5d29de54 | subsection | 19 | 21 | Experimental investigation | REF , the lens size was
varied while the object size was kept constant. Here, the lens is always the
same, but the square size is varied instead. For this reason, the ring pattern
is the same for every picture in the left column of Fig. REF . When the
SLM is illuminated with a spherical wave converging on L_{1} (isopla... | {
"cite_spans": []
} | 10.1016/j.optcom.2008.10.058 | 0807.1718 | Coherent imaging of extended objects | [
"E. Brainis",
"C. Muldoon",
"L. Brandt",
"A. Kuhn"
] | [
"physics.optics"
] | 2,008 | en | Physics | [
-0.06342504918575287,
-0.03183461353182793,
-0.027469944208860397,
-0.02498238906264305,
-0.003292578039690852,
0.007405439391732216,
0.010545406490564346,
0.025043433532118797,
-0.006066279485821724,
-0.016085179522633553,
-0.021685995161533356,
0.012132558971643448,
-0.016222529113292694,
... |
1b89100cc67efafacd776e4057df36daa57a072f | subsection | 20 | 21 | Conclusion | In general, even diffraction-limited imaging systems distort the phase of the processed fields.
This is of no relevence when used with incoherent light, but has a tremendous effect on coherent
imaging. In combination with Fraunhofer diffraction from the finite instrumental aperture, the phase
distortion leads to a seve... | {
"cite_spans": []
} | 10.1016/j.optcom.2008.10.058 | 0807.1718 | Coherent imaging of extended objects | [
"E. Brainis",
"C. Muldoon",
"L. Brandt",
"A. Kuhn"
] | [
"physics.optics"
] | 2,008 | en | Physics | [
-0.02596951089799404,
0.002101821592077613,
-0.038145579397678375,
-0.01800471358001232,
0.008605643175542355,
-0.032927267253398895,
0.0008792556473053992,
0.019027015194296837,
0.007873248308897018,
0.031554024666547775,
-0.03591787815093994,
-0.020919036120176315,
-0.033537596464157104,
... |
ea1611bd18f99a82da5233fb27938a8d390b906c | abstract | 0 | 10 | Abstract | This note is an appendix to a preprint by E. Hellmann. We give a complete
classification of simple objects of the category of vector spaces D over K =
Fpbar((u)) equipped with an endomorphism phi whose image generates D and that
are semi-linear with respect to the ring morphism sending u to u^b (b > 1 is an
integer) an... | {
"cite_spans": []
} | 0807.1719 | Sur la classification de quelques phi-modules simples | [
"Xavier Caruso"
] | [
"math.NT"
] | 2,008 | en | Mathematics | [
-0.058673154562711716,
-0.01801689900457859,
-0.03225040063261986,
0.019786551594734192,
0.024988722056150436,
-0.03447772562503815,
0.04826881363987923,
0.015453953295946121,
0.016399802640080452,
0.02736859954893589,
-0.041678380221128464,
0.012067203409969807,
0.02959592267870903,
0.047... | |
278db8d4a7a081747061dc785219c81a7a316aea | subsection | 1 | 10 | Body | Sur la classification de quelques \phi -modules simples
Xavier CarusoDans cet appendice, on détermine les \phi -modules étales simples sur
\bar{F}_p((u)) dans une situation légèrement plus générale que celle
étudiée dans l'article (). On fixe p un nombre premier
et on pose k = \bar{\mathbb {F}}_p et pour tout q, puissa... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 234,
"openalex_id": "",
"raw": "E. Hellmann, On the structure of some moduli spaces of finite flat group schemes, preprint",
"source_ref_id": "e9994956c724f73267eba3b2a1e78d697e1c5f58",
"start": 0
}
]
} | 0807.1719 | Sur la classification de quelques phi-modules simples | [
"Xavier Caruso"
] | [
"math.NT"
] | 2,008 | en | Mathematics | [
-0.018627727404236794,
0.029703674837946892,
-0.03453986719250679,
-0.013143151067197323,
-0.015523106791079044,
-0.07823340594768524,
0.04006258398294449,
0.014104287140071392,
0.019360022619366646,
0.040977951139211655,
0.0018946200143545866,
-0.02761358581483364,
0.012311692349612713,
0... | |
71c17f5d2f80a22449fc1cc90a311e3781a15b15 | subsection | 2 | 10 | Body | \bullet
\phi (e_{d-1}) = a u^n e_0.D(d,n) = K e_0 \oplus K e_1 \oplus \cdots \oplus K e_{d-1} ;\phi (e_i) = e_{i+1} pour i \in \lbrace 0, \ldots , d-2\rbrace .\phi (e_{d-1}) = a u^n e_0.On définit également D(d,n) = D(d,n,1).On commence par déterminer des familles d'isomorphismes entre les
différents D(d,n,a).Lemme 1 ... | {
"cite_spans": []
} | 0807.1719 | Sur la classification de quelques phi-modules simples | [
"Xavier Caruso"
] | [
"math.NT"
] | 2,008 | en | Mathematics | [
-0.01995481364428997,
-0.0028185411356389523,
-0.05431126803159714,
-0.020031092688441277,
-0.025614779442548752,
-0.012921810150146484,
0.044944100081920624,
-0.011815751902759075,
0.007761476561427116,
0.010511365719139576,
-0.010145222768187523,
-0.01044271420687437,
-0.02347894385457039,... | |
b32646a24dc7f21a930ea00a1cb5867f56e698e1 | subsection | 3 | 10 | Body | (ii)
Si \sigma est l'identité et si t est premier avec p, on a :
D(d,n,a) \simeq D(d^{\prime },n^{\prime },a^{\prime }_1) \oplus D(d^{\prime },n^{\prime },a^{\prime }_2) \oplus \cdots \oplus \simeq D(d^{\prime },n^{\prime },a^{\prime }_t)
où les a^{\prime }_i sont les racines t-ièmes de a.
(iii)
Si \sigma est l'identit... | {
"cite_spans": []
} | 0807.1719 | Sur la classification de quelques phi-modules simples | [
"Xavier Caruso"
] | [
"math.NT"
] | 2,008 | en | Mathematics | [
0.00230581546202302,
0.0008491846965625882,
-0.03338378295302391,
-0.016020553186535835,
-0.024915775284171104,
-0.023206917569041252,
0.0692087933421135,
0.010932120494544506,
0.02709762193262577,
0.026929788291454315,
-0.0037362221628427505,
0.005408843979239464,
-0.047420840710401535,
-... | |
adfcfb51ee2338a1024791bec67611d941f8e958 | subsection | 4 | 10 | Body | Comme par ailleurs, il est clair que à \alpha fixé,
la famille des f_i(\alpha ) est libre, on en déduit que les sous-objets
F(\alpha ) = K f_0(\alpha ) \oplus \cdots \oplus K f_{d-1}(\alpha ) sont
tous isomorphes à D(d^{\prime },n^{\prime }). Il suffit donc pour conclure de montrer que
t d'entre eux sont en somme direc... | {
"cite_spans": []
} | 0807.1719 | Sur la classification de quelques phi-modules simples | [
"Xavier Caruso"
] | [
"math.NT"
] | 2,008 | en | Mathematics | [
-0.0030489310156553984,
0.009716917760670185,
-0.051589664071798325,
0.016718590632081032,
0.018198246136307716,
-0.016016898676753044,
0.06455572694540024,
0.011288098990917206,
0.04146088287234306,
0.0068300627171993256,
-0.03340667113661766,
-0.021462643519043922,
-0.032735489308834076,
... | |
7e48e6a1be0de53787517cfd7c01fe625ccedc25 | subsection | 5 | 10 | Body | Pour tous
entiers i \in \lbrace 0, \ldots , d^{\prime }-1\rbrace et j \in \lbrace 0, \ldots , p-1\rbrace , on
pose :et on définit D_m comme le sous-K-espace vectoriel de D(d,n)
engendré par les f_{i,j} avec 0 \leqslant i < d^{\prime } et 0 \leqslant j < m.
À nouveau l'utilisation des déterminants de Vandermonde assure ... | {
"cite_spans": []
} | 0807.1719 | Sur la classification de quelques phi-modules simples | [
"Xavier Caruso"
] | [
"math.NT"
] | 2,008 | en | Mathematics | [
-0.020459827035665512,
-0.003867685329169035,
-0.03878365457057953,
-0.018049197271466255,
-0.02332816831767559,
-0.011076684109866619,
0.020536111667752266,
0.013288970105350018,
0.017637254670262337,
0.026394855231046677,
-0.001007924904115498,
0.00047559369704686105,
-0.019864797592163086... | |
32b699b7eebe1dc868b013df37670d79dd53018d | subsection | 6 | 10 | Body | De plus, ils sont deux à deux non isomorphes.Pour simplifier la preuve, on suppose dans la suite a=1, laissant au
lecteur l'exercice (facile) d'adapter les arguments au cas général.Notons \ell = \ell (r) et considérons n tel que \frac{n}{p^\ell -1}
représente r. Soit D un sous-objet non nul de D(r), et soit x =
\lambda... | {
"cite_spans": []
} | 0807.1719 | Sur la classification de quelques phi-modules simples | [
"Xavier Caruso"
] | [
"math.NT"
] | 2,008 | en | Mathematics | [
-0.038114260882139206,
0.02017095685005188,
-0.02866961434483528,
-0.01637173816561699,
-0.01730247028172016,
-0.0027235369198024273,
0.05123606324195862,
0.015822453424334526,
0.012099523097276688,
0.02229180745780468,
-0.008941135369241238,
-0.019438577815890312,
-0.018340008333325386,
0... | |
2b56c13754d9f8164db0c4a09e4c801427c6ecd3 | subsection | 7 | 10 | Body | Pour
cela, nous considérons D un objet simple de \text{\rm Mod}^\phi _{/K}, (e_1, \ldots ,
e_d) une base de D et G la matrice de \phi dans cette base,
i.e. l'unique matrice vérifiant l'égalité :On rappelle, à ce propos, la formule de changement de base qui
interviendra plusieurs fois dans la suite : si \mathcal {B}^{\p... | {
"cite_spans": []
} | 0807.1719 | Sur la classification de quelques phi-modules simples | [
"Xavier Caruso"
] | [
"math.NT"
] | 2,008 | en | Mathematics | [
-0.031467005610466,
0.017717357724905014,
-0.045628681778907776,
-0.015382512472569942,
0.030688723549246788,
-0.04776514321565628,
0.029879920184612274,
0.023729966953396797,
0.03198586031794548,
0.009415684267878532,
-0.03714388608932495,
-0.034793779253959656,
-0.008713704533874989,
0.0... | |
87cbbae453989b97f7e02e6fd7cb53a74351f2e7 | subsection | 8 | 10 | Body | En particulier, on peut supposer que G a tous ses coefficients
dans \mathbb {F}_q[[u]] pour un certain q. C'est ce que nous ferons par la
suite.Soit M le sous-\mathbb {F}_q[[u]]-module de D engendré par les e_i ; il
est libre de rang d. On définit deux suites récurrentes (x_i) et
(n_i) comme suit. On pose en premier li... | {
"cite_spans": []
} | 0807.1719 | Sur la classification de quelques phi-modules simples | [
"Xavier Caruso"
] | [
"math.NT"
] | 2,008 | en | Mathematics | [
-0.061085063964128494,
0.011838664300739765,
-0.047263119369745255,
-0.004172518849372864,
0.040214844048023224,
0.003594697453081608,
0.009626542218029499,
0.03939101845026016,
0.011121631599962711,
0.012815048918128014,
-0.03270888701081276,
-0.027628634124994278,
-0.021877119317650795,
... | |
f2e62c72e35b96e95b2e0cef3acf142536ec8be2 | subsection | 9 | 10 | Body | Ainsi la suite (z_i) converge vers un élément z \in M (car tous les
v_i sont positifs) vérifiant \phi ^\delta (z) = z. Par ailleurs, on a
z \equiv x \pmod {u}, ce qui assure qu'il est non nul. On a donc montré
le résultat intermédiaire important suivant :Théorème 7
Soit D un objet simple de \text{\rm Mod}^\phi _{/K}. ... | {
"cite_spans": []
} | 0807.1719 | Sur la classification de quelques phi-modules simples | [
"Xavier Caruso"
] | [
"math.NT"
] | 2,008 | en | Mathematics | [
-0.03554295748472214,
0.014034129679203033,
-0.03298020362854004,
0.006822569761425257,
-0.01847318559885025,
0.006704347673803568,
0.06492310017347336,
0.00906879361718893,
0.03719044104218483,
0.013851075433194637,
0.0024483453016728163,
-0.024422435089945793,
-0.026085175573825836,
-0.0... | |
de299db6b0647bdbbe4807feca6c6f7a47eb17f0 | abstract | 0 | 51 | Abstract | In this paper we consider the operator mapping problem for in-network stream
processing applications. In-network stream processing consists in applying a
tree of operators in steady-state to multiple data objects that are continually
updated at various locations on a network. Examples of in-network stream
processing in... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.011897165328264236,
-0.004910728428512812,
-0.06984147429466248,
0.032387152314186096,
0.029456740245223045,
0.003098299726843834,
0.014476537704467773,
0.02910570241510868,
0.027381032705307007,
0.052106380462646484,
-0.008982016704976559,
-0.04639818146824837,
0.04065946117043495,
-0.... | |
f137db2fe838b4b9d3720e51cc0088c05e226674 | subsection | 1 | 51 | Introduction | In this paper we consider the execution of applications structured as
trees of operators. The leaves of the tree correspond to basic data objects that are
spread over different servers in a
distributed network. Each internal node in the tree denotes the
aggregation and combination of the data from its children, which i... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 791,
"openalex_id": "",
"raw": "B. Badcock, S. Babu, M. Datar, R. Motwani, and J. Widom, “Models and issues in data stream systems,” in Proceedings of the Intl. Conf. on Very Large Data Bases, 2004, pp. 456–467.",
"source_re... | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.007850321009755135,
-0.008643745444715023,
-0.08404192328453064,
0.024687696248292923,
0.007342987693846226,
-0.0007114115287549794,
0.021788647398352623,
0.002883791457861662,
-0.011977652087807655,
0.0348801463842392,
-0.0011586662149056792,
-0.02979917824268341,
0.016539841890335083,
... | |
6010c5fa27069727e2148587b17e0a526ccebcc3 | subsection | 2 | 51 | Introduction | Our objective is to meet this constraint while
minimizing the “overall cost”, that is the amount of resources used to
achieve the throughput. For instance, the cost could be simply the total
number of compute servers, in the case when all servers are identical and
network bandwidth is assumed to be free.We study severa... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 1282,
"openalex_id": "",
"raw": "Y. E. Ioannidis, “Query optimization,” ACM Computing Surveys, vol. 28, no. 1, pp. 121–123, 1996.",
"source_ref_id": "3df8a5181767917f278f5a0f3e72dfc588a84ffd",
"start": 1150
},
... | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
0.0043900529853999615,
0.02468498982489109,
-0.03771402686834335,
0.04552534595131874,
0.021374331787228584,
0.013273140415549278,
0.02837705798447132,
0.0006998911267146468,
0.04403020814061165,
0.05800514668226242,
-0.009420878253877163,
-0.019513040781021118,
0.026042817160487175,
-0.01... | |
0e8eb705e800a8ee4e02f2c31a6ade583143a665 | subsection | 3 | 51 | Application model | We consider an application that can be represented as a set of
operators, \mathcal {N}.
These operators are organized as a binary tree, as
shown in Figure REF .
Operations are initially performed on basic objects, which are
made available and continuously updated at given locations in a
distributed network.
We denote t... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.012330787256360054,
0.004311197437345982,
-0.0709325522184372,
0.016420701518654823,
0.009286242537200451,
-0.004528664983808994,
0.01488698460161686,
-0.0014879354275763035,
0.010102699510753155,
0.030781187117099762,
-0.02229613997042179,
-0.0336349718272686,
-0.008523198775947094,
0.... | |
c2ac95eeddb4751c526a58eb8534fff6a4d2476e | subsection | 4 | 51 | Application model | In this paper we sometimes consider left-deep trees, i.e., binary
trees in which the right child of an operator is always a leaf. These
trees arise in practical settings , , and we show an
example of left-deep tree in Figure REF .
Here \mathit {Child}(i) and \mathit {Leaf}(i) have cardinal 1 for every operator
n_i but ... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 231,
"openalex_id": "",
"raw": "Y. E. Ioannidis, “Query optimization,” ACM Computing Surveys, vol. 28, no. 1, pp. 121–123, 1996.",
"source_ref_id": "3df8a5181767917f278f5a0f3e72dfc588a84ffd",
"start": 130
},
{
... | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.06211693584918976,
-0.02375148981809616,
-0.05946262553334236,
0.015613134019076824,
-0.0089239701628685,
0.007673088926821947,
0.030738120898604393,
0.020227666944265366,
0.01491142064332962,
0.01334781851619482,
-0.007783685345202684,
0.0011078689713031054,
0.03185170888900757,
0.0086... | |
c5c94d6ec2f314b0ef9981c921be3a4b2243db69 | subsection | 5 | 51 | Application model | The time required by each activity must be summed for all
operators to determine the processor's computation time.
We assume that a basic object can be duplicated, and thus be available
and updated at multiple servers. We assume that duplication of basic objects is
achieved in some out-of-band manner specific to the ta... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.01946551911532879,
-0.003428585594519973,
-0.06950227171182632,
0.033561237156391144,
0.0064490968361496925,
-0.013386357575654984,
0.008291151374578476,
-0.012272734194993973,
0.0015178832691162825,
0.017406078055500984,
-0.02611674554646015,
-0.021936845034360886,
0.02147919312119484,
... | |
7c11cdf1b04fbd0b853c810df7148b65d1bd3a13 | subsection | 6 | 51 | Application model | This
is expressed by the following constraint, in which the first term corresponds
to basic object downloads,
the second term corresponds to inter-node communications when a tree
node
is assigned to P_u and its parent node is assigned to another
processor, and the third term corresponds
to inter-node communications whe... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.038965098559856415,
-0.02759900689125061,
-0.06227703019976616,
0.004275633953511715,
0.023754369467496872,
0.0532146692276001,
0.017560230568051338,
0.008093573153018951,
0.008452100679278374,
0.038324326276779175,
-0.008276650682091713,
-0.030558768659830093,
0.02596656233072281,
-0.0... | |
471cf135b2bbe3676be3ce7353f7495b047a5c39 | subsection | 7 | 51 | Application model | The goal is then to use a subset of this platform so
that the prescribed throughput is achieved while minimizing a cost
function. Several cost functions can be envisioned, including the compute
capacity or the bandwidth capacity used by the application in steady state,
or a combination of the two. In the following, we ... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 2724,
"openalex_id": "",
"raw": "M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.",
"source_ref_id": "df2a881d9431cee11cf4d28c9af94ee44d3b... | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.012406102381646633,
-0.02720797061920166,
-0.059207476675510406,
0.028321925550699234,
-0.0012951635289937258,
-0.006275534629821777,
0.023209940642118454,
-0.009254982694983482,
0.03750824183225632,
0.04587053507566452,
-0.029680036008358,
-0.009033718146383762,
0.044375088065862656,
0... | |
79ed4059a84442a46cd157c5c545b27230081895 | subsection | 8 | 51 | Application model | Definition 1 The problem C-LDT-Hom (Constr-Hom-HomS-LDTree-HomA-NoComA) consists in
minimizing the number of processors used in the application execution. K is
the prescribed throughput that should not be violated.
C-LDT-Hom-Dec is the associated decision problem: given a number of
processors N, is there a mapping that... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 867,
"openalex_id": "",
"raw": "M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.",
"source_ref_id": "df2a881d9431cee11cf4d28c9af94ee44d3b6... | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.016971057280898094,
-0.005913924891501665,
-0.06428245455026627,
0.013781352899968624,
-0.004319073166698217,
-0.0016530373832210898,
0.017352599650621414,
-0.02943990007042885,
-0.009317293763160706,
0.010240628384053707,
-0.021213822066783905,
-0.015231218189001083,
0.020359164103865623... | |
62a2e9a4ce8118ce4af5c0b904d5396c410cdf5b | subsection | 9 | 51 | Application model | The size of
\mathfrak {I}_2 is clearly polynomial in the size of
\mathfrak {I}_1, since the size of the tree is bounded by 3nM.
We now show that instance \mathfrak {I}_1 has a solution if and only
if instance \mathfrak {I}_2 does.
Suppose first that \mathfrak {I}_1 has a solution. We map all
operators corresponding to ... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.026840494945645332,
0.0113984365016222,
-0.0695197805762291,
0.013069291599094868,
-0.016510184854269028,
-0.002317453268915415,
0.015434429049491882,
-0.051361627876758575,
0.008117761462926865,
0.024002330377697945,
-0.026108065620064735,
-0.016616998240351677,
-0.0010452381102368236,
... | |
9ca29cf1663fa5d982417277221f84f617aa7891 | subsection | 10 | 51 | Application model | We denote the cost of a processor in class c by cost_c. Each processor of class c has
computing speed s_c and network card bandwidth Bp_c. The link bandwidth between processors is
a constant bp, while the link between a server S_l and a processor
is bs_{l}. For each class, processors are
numbered from 1 to |\mathcal {N... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.03560889512300491,
-0.009619283489882946,
-0.07091265916824341,
0.023128999397158623,
0.006644247565418482,
-0.006922680418938398,
-0.0015723828691989183,
0.013280866667628288,
0.02036755532026291,
0.015363391488790512,
-0.000030036422685952857,
-0.0269431471824646,
0.05361167713999748,
... | |
8f293f103ae11baf85c0285d8ddcd5b7a0759458 | subsection | 11 | 51 | Application model | \forall i~~ \sum _{c,u} x_{i,c,u}=1: each operator is
placed on exactly one processor;
\forall c,u,k,l~~ d_{c,u,k,l} \le obj(k,l): object o_k
can be downloaded from S_l only if S_l holds o_k;
\forall c,u,k,l~~ d_{c,u,k,l} \le \sum _i x_{i,c,u}.leaf(i,k):
if there is no operaotr assigned to P_{c,u} that
requires objec... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.012087762355804443,
-0.0013316379627212882,
-0.10121974349021912,
-0.015285219065845013,
0.012087762355804443,
-0.0010034979786723852,
0.006959620863199234,
0.027777433395385742,
0.026190150529146194,
0.009294756688177586,
-0.011049924418330193,
-0.03540859743952751,
0.0438944511115551,
... | |
672b8f10b61cc5c447abb3d786c54379ea77bbf7 | subsection | 12 | 51 | Application model | Finally, we have to ensure that the required throughput is achieved and that
the various bandwidth capacities are not exceeded, following equations
(REF )-(REF ).
\forall c,u~~ \sum _{i} x_{i,c,u}.\rho \frac{w_i}{s_c} \le 1: the computation of each processor must
be fast enough so that the throughput is at least equal... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.033514026552438736,
-0.008698996156454086,
-0.04041217640042305,
0.011354479007422924,
0.00014367174298968166,
0.026875318959355354,
-0.005661977920681238,
0.0022758557461202145,
0.011613922193646431,
0.03491807356476784,
-0.012407515197992325,
-0.011011097580194473,
0.019092006608843803,... | |
5f53993a67b48d054e304544e4275b9475874b41 | subsection | 13 | 51 | Application model | We can further generalize the linear program to Non-Constr-Het, by adding
links of different bandwidths between processors. We just need to replace
bp by bp_{c,c^{\prime }} and bs_l by bs_{l,c} every
time they appear in the linear program in the previous section.
Altogether, we have provided integer linear program form... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.027440153062343597,
0.003395680570974946,
-0.036230769008398056,
0.05854305997490883,
0.011026423424482346,
0.034185729920864105,
0.004109155386686325,
-0.01329275406897068,
0.03122500143945217,
0.04148072004318237,
-0.04724956303834915,
-0.010850916616618633,
0.045418184250593185,
0.00... | |
fcd6e78ba62e5cd0b4c922f1ecc7c6beb4374bf2 | subsection | 14 | 51 | Application model | It picks the two operators that
have the largest communication requirements.
These two operators are grouped and assigned to the same processor,
thus saving the costly communication between both processors. There
are three cases to consider for this assignment: (i) both operators were
unassigned, in which case the heur... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.022172028198838234,
0.0004677985270973295,
-0.05526984855532646,
0.04428302124142647,
0.014740660786628723,
0.012077881023287773,
0.005741380620747805,
-0.02288922481238842,
-0.004654142539948225,
0.00826300960034132,
-0.038057152181863785,
-0.01522133406251669,
0.0239726472645998,
0.04... | |
fe7f99297e94e7e47b2715bddbbe4e168b53880e | subsection | 15 | 51 | Application model | The remaining internal operators are
assigned in the same mechanism as Comp-Greedy proceeds, i.e., in
decreasing order of w_i of the operators.
Object Download Heuristics
Once an operator placement heuristic has been executed, each al-operator is
mapped on a processor, which needs to download basic objects required by... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.047405093908309937,
0.0004604959976859391,
-0.04838189110159874,
0.04664197564125061,
0.0007979387301020324,
0.005109097342938185,
0.004945026244968176,
-0.025869812816381454,
0.0024038320407271385,
0.026800820603966713,
-0.017109179869294167,
-0.003470294177532196,
0.03244791924953461,
... | |
29feee103432daf5a06b207389eba633db8aa677 | subsection | 16 | 51 | Application model | Note that we do not
consider configurations designed for low power consumption, which
achieve possibly lower performance at higher costs.
[Table: Incremental costs for increases in processor performance ornetwork card bandwidth relative to a $7,548 base configuration (based on datafrom the Dell Inc. web site, as of ear... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 1951,
"openalex_id": "",
"raw": "“Source Code for the Heuristics.” [Online]. Available: http://graal.ens-lyon.fr/~vsonigo/code/query-streaming/",
"source_ref_id": "a73fb818b220bc4b2d24f24c463fd5d3e8c33f8d",
"start": 18... | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.04631495475769043,
-0.009862522594630718,
-0.06254655122756958,
-0.005633003078401089,
-0.005423243157565594,
-0.012478798627853394,
0.032036036252975464,
0.0023550300393253565,
0.0065368772484362125,
0.017009610310196877,
-0.04399615526199341,
-0.0028908709064126015,
0.011738918721675873... | |
db6678e9a17a3b7db81e51d63c2f2feb84ef9f68 | subsection | 17 | 51 | Application model | This
experiment uses the same parameters as the previous one. Up to a threshold
the \alpha parameter has no influence on the heuristics' performance
and the solution cost is linear. When \alpha reaches the threshold, the
solution cost of each heuristic increases until \alpha exceeds a second
threshold and no solution c... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.04750220105051994,
-0.01208148431032896,
-0.04951578006148338,
-0.019235797226428986,
0.0033655017614364624,
-0.026374856010079384,
0.022164642810821533,
0.006868293508887291,
0.006952192634344101,
0.007718726061284542,
-0.04875306040048599,
0.012508607469499111,
0.008496700786054134,
-... | |
80839ba39664d2e3221b77432bf104256df42d46 | subsection | 18 | 51 | Application model | Here once again, the solution found by the
heuristic for the operator mapping leads to the failure in the server
association process.
[Figure: Simulation with big basic objects and high downloadrates, increasing \alpha .]
Low download rates - small object sizes
The behavior of the heuristics when download rates are low... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.05331701040267944,
0.008171510882675648,
-0.06970581412315369,
0.004848734941333532,
0.02391177974641323,
-0.03586003929376602,
0.023820221424102783,
0.017792683094739914,
-0.025483516976237297,
0.02342347241938114,
-0.04181127995252609,
-0.003135845996439457,
0.00654636463150382,
0.002... | |
20e4bfce635f262317077b3a9a6cde5f328d8482 | subsection | 19 | 51 | Application model | We use Cplex 11 to solve our linear program. Unfortunately, the
LP is so enormous that, even when using only 5 possible groups of
processors and using tress with 30 operators, the LP file could not be
opened in Cplex. For trees with 20 operators, Cplex produces the optimal
solution, which consists in all cases in buyin... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 3677,
"openalex_id": "",
"raw": "V. Pandit and H. Ji, “Efficient in-network evaluation of multiple queries,” in HiPC, 2006, pp. 205–216.",
"source_ref_id": "bf483f445199aaa17a360fa4f7f7dfea6a401662",
"start": 3546
... | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.03617161139845848,
-0.002836876781657338,
-0.06690984964370728,
0.01724638044834137,
-0.0033176387660205364,
-0.019810443744063377,
0.008653714321553707,
-0.014674684964120388,
0.027899453416466713,
0.0049678729847073555,
-0.019215214997529984,
-0.003731628181412816,
0.020787229761481285,... | |
72ee7a686e70050b64b3256f8414b2977e5d52da | subsection | 20 | 51 | Application model | Such situations arise for instance in relational
database applications . | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 72,
"openalex_id": "",
"raw": "J. Chen, D. J. DeWitt, and J. F. Naughton, “Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries,” in Proceedings of ICDE, 2002.",
"source_ref_id... | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.016338078305125237,
0.028130175545811653,
-0.034354206174612045,
0.04192067310214043,
-0.0474429726600647,
0.04030364379286766,
0.03459828346967697,
0.04826674237847328,
0.0021585789509117603,
-0.027748800814151764,
-0.0014377814950421453,
-0.019633153453469276,
-0.01801612600684166,
0.... | |
0bcaafe1b9dcad63131fe49691275a75dab14284 | subsection | 21 | 51 | Problem Definitions | The overall objective of the operator-mapping problem is to ensure that a
prescribed throughput is achieved while minimizing a cost function. We
consider two broad cases. In the first case, the user must buy processors
(with various computing speed and network card bandwidth specifications)
and build the distributed ne... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.005800957325845957,
-0.026117658242583275,
-0.07444752752780914,
0.018810205161571503,
0.017681287601590157,
0.013272407464683056,
0.007734610233455896,
-0.008443997241556644,
0.028482282534241676,
0.05842910334467888,
-0.017803333699703217,
-0.024973483756184578,
0.050038501620292664,
... | |
0387f721d6a51d91ec40efa0aadd581d02416d2c | subsection | 22 | 51 | Complexity | Without surprise, most problem instances are NP-hard,
because downloading objects with
different rates on two identical servers is the same problem as
2-Partition . But from a theoretical point of view,
it is important to assess the complexity of the
simplest instance of the problem,
i.e., mapping a fully homogeneous l... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 164,
"openalex_id": "",
"raw": "M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.",
"source_ref_id": "df2a881d9431cee11cf4d28c9af94ee44d3b6... | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.027799060568213463,
-0.014830234460532665,
-0.05187530815601349,
0.016539068892598152,
0.0023839755449444056,
-0.009917338378727436,
0.03155239298939705,
-0.024640770629048347,
-0.026746297255158424,
0.019010774791240692,
-0.033352769911289215,
-0.03344431519508362,
0.011122675612568855,
... | |
57070c178a5f6f54a7b6b34e6bdd0ff7f5536d25 | subsection | 23 | 51 | Complexity | Because 3-Partition is NP-complete in the strong sense, we can encode
the 3n numbers in unary and assume that the size of \mathfrak {I}_1
is O(n + M), where M = \max _i \lbrace a_i\rbrace .We build the following instance \mathfrak {I}_2 of C-LDT-Hom-Dec:The object set is \mathcal {O}= \lbrace o_1,...,o_{3n}\rbrace , an... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.002963891252875328,
-0.0034883893094956875,
-0.06506065279245377,
-0.01427397783845663,
0.0018128561787307262,
-0.005344158969819546,
0.023039771243929863,
-0.038297899067401886,
-0.00008332367724506184,
0.004600325133651495,
-0.02670172229409218,
-0.009261682629585266,
0.0069233751855790... | |
6fda158e3ec8f8e4f3d34a51dc85eac4ca68f61b | subsection | 24 | 51 | Linear Programming Formulations | In this section, we formulate the Constr optimization problem
as an integer linear program (ILP). We deal with the most general
instance of the problem Constr-LAN.
Then we explain how to transform this integer linear program to formulate
the Non-Constr-Het problem. | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.016526807099580765,
0.009407918900251389,
0.013726558536291122,
0.02943694405257702,
-0.043277956545352936,
0.036288779228925705,
-0.0123760299757123,
-0.017045654356479645,
0.032076962292194366,
0.028185607865452766,
-0.040164873003959656,
0.0033267256803810596,
-0.0009833297226577997,
... | |
09bcb2af7183b258e200593fbcb9c16e8a4ff9e4 | subsection | 25 | 51 | ILP for | Constants – We first define the set of constant values that
define our problem. The application tree is defined via parameters par and leaf, and
the location of objects on servers is defined via parameter obj.
Other parameters are defined with the same notations as
previously introduced: \mathsf {\delta }_i, w_i for op... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.03955067694187164,
0.002601616783067584,
-0.07434062659740448,
0.01876826211810112,
-0.0007243137224577367,
-0.04641711339354515,
0.01747126691043377,
0.01925654150545597,
0.025283746421337128,
0.02865593135356903,
0.011718719266355038,
-0.02915946952998638,
0.030548015609383583,
-0.007... | |
95f58997ef03c26308d50c280d2ad78dc3b5a59a | subsection | 26 | 51 | ILP for | There are |\mathcal {N}|^4.|\mathcal {C}|^2 such variables.
used_{c,u} is a boolean variable equal to 1 if processor
P_{c,u} is used in the final mapping, i.e., there is at
least one operator mapped on this processor, and 0 otherwise. There are
|\mathcal {C}|.|\mathcal {N}| such variables.Constraints – Finally, we mus... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.022371144965291023,
0.016145069152116776,
-0.07733763009309769,
0.020066887140274048,
0.02214224450290203,
-0.01602298952639103,
0.006954740267246962,
0.014390170574188232,
0.01779314875602722,
0.015305769629776478,
-0.012032502330839634,
-0.032168056815862656,
0.04223965108394623,
-0.0... | |
4731360f0cd2738f62276fd1128fdf9d4a0f5d5c | subsection | 27 | 51 | ILP for | Instead, for all i,c,u,i^{\prime },c^{\prime },u^{\prime }, we write:y_{i,c,u,i^{\prime },c^{\prime },u^{\prime }} \le par(i,j); ~y_{i,c,u,i^{\prime },c^{\prime },u^{\prime }} \le x_{i,c,u}; ~y_{i,c,u,i^{\prime },c^{\prime },u^{\prime }} \le x_{i^{\prime },c^{\prime },u^{\prime }}: y is forced to
0 if one of the condit... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.014313729479908943,
0.019471555948257446,
-0.0739186629652977,
0.008247943595051765,
0.006302313879132271,
0.020997539162635803,
-0.013604147359728813,
0.026277443394064903,
0.01461892668157816,
0.057132840156555176,
-0.009636588394641876,
-0.03293073549866676,
0.023133916780352592,
-0.... | |
f5cc8ac26c784c1265d49d9d936c01fd28719245 | subsection | 28 | 51 | ILP for | Furthermore, we no longer
consider processor classes. However, we can simply assume that there is only one
processor of each class, and define |\mathcal {C}|=|\mathcal {P}|, the set of processors
of the platform. The number of processors of
class c is then limited to 1. As a result, all indices u in
the previous linear... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.030342312529683113,
-0.004061659332364798,
-0.033225517719984055,
0.056413207203149796,
0.019770557060837746,
-0.029686344787478447,
-0.018382346257567406,
0.009976808913052082,
0.029884660616517067,
0.007238525431603193,
-0.01952647604048252,
-0.019053569063544273,
0.027764208614826202,
... | |
ab339d7ee54e9c6acb65b3773a37cea254d17768 | subsection | 29 | 51 | Heuristics | In this section we propose several heuristics to solve the Constr operator-placement problem. Due to lack of space, we leave the development
of heuristics for the Non-Constr problem outside the scope of this
paper. We choose to focus on constructive scenarios because such scenarios
are relevant to practice and, to the ... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.026867041364312172,
-0.01978793367743492,
-0.027935009449720383,
0.07451370358467102,
0.005534366238862276,
0.029613247141242027,
0.004088794346898794,
-0.003993439953774214,
0.043145935982465744,
0.026531394571065903,
-0.03142879158258438,
-0.0017573806690052152,
0.03859943896532059,
-... | |
78dc8b2b251cb7083af24a486ba83539f40f6521 | subsection | 30 | 51 | Random | While there are some unassigned operators, the Random heuristic picks one of
these unassigned operators randomly, called op. It then purchases the
cheapest possible processor that is able to handle op while achieving the
required application throughput. If there is no such processor, then the
heuristic considers op alo... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.045709867030382156,
0.029522227123379707,
-0.01821681670844555,
0.04064455255866051,
-0.01658431999385357,
0.04296361282467842,
-0.014867912046611309,
0.009154179133474827,
0.00842184480279684,
0.02874412201344967,
-0.05614563077688217,
-0.023373670876026154,
0.029491713270545006,
0.029... | |
77d0714ee97715286ebf498162e1e489172875af | subsection | 31 | 51 | Comp-Greedy | The Comp-Greedy heuristic first sorts operators in non-increasing order of
w_i, i.e., most computationally demanding operators first. While
there are unassigned operators, the heuristic purchases the most expensive
processor available and assigns the most computationally demanding unassigned operator
to it. If this ope... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.0551774837076664,
0.014931186102330685,
-0.016296889632940292,
0.03674430027604103,
-0.014748075045645237,
0.01644948311150074,
0.0064012594521045685,
-0.005039370618760586,
-0.0038911113515496254,
0.030350668355822563,
-0.03781244531273842,
-0.015549185685813427,
0.008423111401498318,
... | |
84eeb2ebc7181a908c1dbe56df854d711351adba | subsection | 32 | 51 | Comm-Greedy | The Comm-Greedy heuristic attempts to group operators to reduce
communication costs. It picks the two operators that
have the largest communication requirements.
These two operators are grouped and assigned to the same processor,
thus saving the costly communication between both processors. There
are three cases to con... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.05804996192455292,
0.00197429396212101,
-0.03406086191534996,
0.022691980004310608,
0.011986920610070229,
0.016206378117203712,
-0.016084294766187668,
-0.007557635195553303,
0.015107640065252781,
0.018922701478004456,
-0.0533803291618824,
0.0013505314709618688,
0.02285984344780445,
0.00... | |
89d70d79a7ab8e0b73145b0a0cefc0c61a5d8ab0 | subsection | 33 | 51 | Object-Greedy | The Object-Greedy heuristic attempts to group operators that need the same
basic objects. Recall that an al-operator is an operator that requires at
least one basic object. The heuristic sorts all al-operators by the maximum
required download frequency of the basic objects they require, i.e., in
non-increasing order of... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.0420055091381073,
0.006685469765216112,
-0.050369974225759506,
0.02361283451318741,
-0.004041045904159546,
0.025703951716423035,
0.011814048513770103,
-0.012401699088513851,
-0.011928525753319263,
0.008387364447116852,
-0.05598699301481247,
-0.023780733346939087,
0.01688157394528389,
0.... | |
7bcdeb9e94d30d341faab2ea934974cc92fadab9 | subsection | 34 | 51 | Subtree-Bottom-Up | The Subtree-Bottom-Up heuristic first purchases as many most expensive
processors as there are al-operators and assigns each al-operator to a
distinct processor. The heuristic then tries to merge the operators with
their father on a single machine, in a bottom-up fashion (possibly leading
to the selling back of some pr... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.026779470965266228,
-0.001688975840806961,
-0.02598600462079048,
0.05722108855843544,
-0.020843734964728355,
0.01300063170492649,
0.025085726752877235,
0.02433803677558899,
0.009544477798044682,
0.01741047017276287,
-0.05871646851301193,
0.014991926029324532,
0.004337358754128218,
0.025... | |
0a82bf03830fc82947fa286af0c211af7b0616ad | subsection | 35 | 51 | Object-Grouping | For each basic object, this heuristic counts how many operators need this
basic object. This count is called the “popularity” of the basic object.
The al-operators are then sorted by non-increasing sum of the popularities
of the basic object they need. The heuristic starts by purchasing the most
expensive processor and... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.004445500206202269,
-0.008417830802500248,
-0.020849967375397682,
0.06923532485961914,
-0.004914853256195784,
0.03446502611041069,
0.0005056040827184916,
-0.010516565293073654,
0.0016980665968731046,
0.005773426499217749,
-0.041699934750795364,
-0.012607667595148087,
0.026360098272562027,... | |
897bd68015dfcb52851bc657597abc6c1b1da678 | subsection | 36 | 51 | Object-Availability | This heuristic takes into account the distribution of basic objects on
the servers. For each object k the number av_k of servers handling
object o_k is
calculated. Al-operators in turn are treated in increasing order of
av_k of the basic objects they need to download. The heuristic tries
to assign as many al-operators ... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.04184020310640335,
-0.009628434665501118,
-0.027496734634041786,
0.041046734899282455,
-0.019775675609707832,
0.030960530042648315,
0.017334233969449997,
-0.024048198014497757,
0.005344468168914318,
0.004497592803090811,
-0.03875788301229477,
0.0010109093273058534,
0.008705264888703823,
... | |
30991dd0aeae37aa766c2693c016214ed7b9cdb6 | subsection | 37 | 51 | Object Download Heuristics | Once an operator placement heuristic has been executed, each al-operator is
mapped on a processor, which needs to download basic objects required by
the operator. Thus, we need to specify from which server this download should
occur. Two server selection heuristics are proposed in order to define, for
each processor, t... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.02416021004319191,
-0.015010465867817402,
-0.052685435861349106,
0.05613471567630768,
-0.0009534163982607424,
0.007085519842803478,
0.018833670765161514,
-0.012431138195097446,
0.0040864790789783,
0.007829556241631508,
-0.012049580924212933,
-0.02741107903420925,
0.0358969122171402,
0.0... | |
94cdfc5241f915c526203ff74d682b2be0f2adff | subsection | 38 | 51 | Server-Selection-Random | This heuristic is only used in combination with Random.
Once Random has decided about the mapping of
operators onto processors, Server-Selection-Random associates randomly a
server to each basic object a processor has to download. | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.03773146867752075,
0.012500838376581669,
-0.0019537329208105803,
0.04881279915571213,
-0.025795381516218185,
0.008494159206748009,
0.0020434062462300062,
0.018224665895104408,
-0.01727832667529583,
0.01758359745144844,
-0.03715145215392113,
-0.013714290224015713,
0.04792751371860504,
0.... | |
ea723aaf93b87f51848f81e2eff81bb3f9baa3c7 | subsection | 39 | 51 | Server-Selection-Intelligent | This server selection heuristic is more sophisticated and is used in
combination with all operator placement heuristics except Random.
Server-Selection-Intelligent uses three loops: the first
loop assigns objects that are held in exclusivity, i.e., objects that
have to be downloaded from a specific server. If not all d... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.06328045576810837,
-0.01321139745414257,
-0.010900165885686874,
0.06822329014539719,
-0.009069487452507019,
-0.003916889429092407,
-0.0005253666313365102,
-0.03569823503494263,
-0.016216762363910675,
0.029794296249747276,
-0.005038180388510227,
0.005289898719638586,
0.016445597633719444,
... | |
a56bbd37599ea0b8678f11df4c134999f133a680 | subsection | 40 | 51 | Resource Cost Model | In order to instantiate our simulations with realistic models for resource
costs, we use information available from the Dell Inc. Web site. More
specifically, we use the prices for configurations of Intel's latest,
high-end, rack-mountable server (PowerEdge R900), as advertised on the Web
site as of early March 2008. D... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.027372999116778374,
-0.007762548979371786,
-0.036771975457668304,
0.0367414616048336,
-0.00588961923494935,
-0.023650025948882103,
0.009238768368959427,
0.026259157806634903,
0.03506307303905487,
0.0006665874389000237,
0.011855529621243477,
0.0015153181739151478,
0.001443795976229012,
0... | |
5a333b56298bb422550adc3db3fd22b1e1089d2e | subsection | 41 | 51 | Simulation Methodology | All our simulations use randomly generated binary operator trees with at
most N operators, which can be specified. All leaves correspond to basic
objects, and each basic object is chosen randomly among 15 different types.
For each of these 15 basic object types, we randomly choose a fixed size.
In simulations with smal... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.03502480685710907,
-0.027443217113614082,
-0.04966932535171509,
-0.004385727923363447,
-0.011364756152033806,
-0.012020708993077278,
0.05375758558511734,
0.008565518073737621,
0.0033503149170428514,
0.004812859930098057,
-0.00968673825263977,
0.0012956965947523713,
0.02199728600680828,
... | |
fcbdeb86c9c4767de3384d96fb46bc449ac04e59 | subsection | 42 | 51 | Results | We present hereafter results for several sets of experiments. Due to lack
of space we will only present the most significant figures, but the entire
set of figures can be found on the web . | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 189,
"openalex_id": "",
"raw": "“Source Code for the Heuristics.” [Online]. Available: http://graal.ens-lyon.fr/~vsonigo/code/query-streaming/",
"source_ref_id": "a73fb818b220bc4b2d24f24c463fd5d3e8c33f8d",
"start": 62
... | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.034151628613471985,
0.039492588490247726,
-0.04248352348804474,
0.00014425361587200314,
-0.02450737915933132,
0.00604673009365797,
-0.004707674961537123,
0.018388163298368454,
0.013779677450656891,
0.01230709906667471,
0.016938474029302597,
0.05694989860057831,
-0.012055310420691967,
0.... | |
8d3df7effbb45b9fd25f5555c9b35502348c0602 | subsection | 43 | 51 | High download rates - small object sizes | In a first set of simulations, we study the behavior of the heuristics when
download rates are high and object sizes small (5-30MB).
Figure REF shows the results, when the number of nodes N in
the tree varies, but the computation factor \alpha is fixed. As expected,
Random performs poorly and the platform chosen for an... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.04776855185627937,
-0.016222992911934853,
-0.05890946090221405,
-0.018893759697675705,
0.004540301393717527,
-0.017917022109031677,
0.03864216431975365,
0.004834085702896118,
0.008874572813510895,
0.01938212849199772,
-0.061809148639440536,
0.0012171060079708695,
0.0022453507408499718,
... | |
80f4ee84b1034c8bca8aecf337da46f6082bee03 | subsection | 44 | 51 | High download rates - big object sizes | The second set of experiments analyzes the heuristics' performance under
high download rates and big object sizes (450-530MB). As for small object
sizes, we plot two types of figures. Figure REF shows results
for a fixed \alpha and increasing number of operators. We see that for
trees bigger than 45 nodes, almost no fe... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.06940582394599915,
-0.017626149579882622,
-0.051367636770009995,
-0.01858757622539997,
0.0017587997717782855,
-0.014261157251894474,
0.026492636650800705,
0.009293788112699986,
0.006668941583484411,
0.01120137982070446,
-0.022921625524759293,
0.0023806747049093246,
0.015520168468356133,
... | |
4b2cbf9887d6bc1ad2a6b9c22dd9d9469db61b03 | subsection | 45 | 51 | Low download rates - small object sizes | The behavior of the heuristics when download rates are low, i.e.,
frequency = 1/50s, is almost the same as for high download rates. In
general the heuristics lead to the same operator mapping, but in some cases
the purchased processors have less powerful network cards
(Cf. Table REF ).
[Table: Influence of the download... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.05089961737394333,
-0.003570297034457326,
-0.05831485241651535,
0.03451287001371384,
0.01029893383383751,
-0.03838832303881645,
0.00099937804043293,
0.04165346547961235,
-0.011473774909973145,
0.02665516547858715,
-0.04961797222495079,
-0.011420372873544693,
0.010047182440757751,
0.0019... | |
8d0e0107344bf25c5d54b556bba40f58c7e9adf9 | subsection | 46 | 51 | Low download rates - big object sizes | In this case, low download rates slightly improve the success rate of the
heuristics (see Figure REF ). Indeed, because of the lower
download rates the links between servers and processors are less congested,
and hence the server association is feasible in more scenarios.
[Figure: Comparison between the simulations wit... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.04400530830025673,
-0.0028609554283320904,
-0.04397479072213173,
0.03195115178823471,
0.0016774735413491726,
-0.043669622391462326,
0.008956697769463062,
0.02871636301279068,
0.006355135701596737,
0.020781980827450752,
-0.05657825618982315,
-0.012084675952792168,
0.006698450073599815,
0... | |
6426605b1afc05ebd017d86c83bc6ad7dd9f69aa | subsection | 47 | 51 | Influence of download rates (frequency) on the solution | The third set of experiments studies the influence of download rates
on the solution. Remember the download rate of a basic object k is
computed by rate_k = frequency \times \delta _k.
A first results is that frequencies smaller than 1/10s has no
further influence on the solution. All heuristics will find the same
solu... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.06425648927688599,
-0.005106804426759481,
-0.07109098881483078,
0.003909241873770952,
0.020106850191950798,
-0.05311992019414902,
0.06932134181261063,
-0.008352428674697876,
0.009054184891283512,
-0.0016094633610919118,
-0.04533957690000534,
0.008901629596948624,
-0.005362335592508316,
... | |
2a2257ca54c0ec804e3044d775036d8ad8750967 | subsection | 48 | 51 | Comparison of the heuristics to a LP solution on a
homogeneous platform | This last set of experiments is dedicated to the evaluation of our
heuristics via a lower bound given by the solution of our integer
linear program.
We use Cplex 11 to solve our linear program. Unfortunately, the
LP is so enormous that, even when using only 5 possible groups of
processors and using tress with 30 operat... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.06420636922121048,
-0.015792202204465866,
-0.03326280415058136,
-0.00011479386739665642,
-0.006099452264606953,
-0.02441306784749031,
0.016768725588917732,
-0.006423688493669033,
0.02900577522814274,
-0.01605159230530262,
-0.0356430783867836,
0.013297492638230324,
0.020568009465932846,
... | |
84aada2b6b845e05e902dc626d96a1a6638a8467 | subsection | 49 | 51 | Summary | Our results show that all our more sophisticated heuristics perform better
than the simple random approach. Unfortunately, the object sensitive
heuristics, Object-Grouping and Object-Availability, do not show the
desired performance. We think that in some situations these heuristics
could lead to good performance, but ... | {
"cite_spans": []
} | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.049368541687726974,
0.016095122322440147,
-0.028116879984736443,
-0.008924783207476139,
-0.0110835125669837,
-0.037011150270700455,
0.021038077771663666,
0.000833837897516787,
0.011930222623050213,
0.006060461513698101,
-0.05132131651043892,
0.018490320071578026,
0.01627819426357746,
0.... | |
5fb8b0a6ac0851620b7d6bad95046080fb6fe183 | subsection | 50 | 51 | Conclusion | In this paper we have studied the problem of resource allocation for
in-network stream processing. We formalized several operator-placement
problems. We have focused more particularly on a “constructive” scenario
in which one aims at minimizing the cost of a platform that satisfies an
application throughput requirement... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 1327,
"openalex_id": "",
"raw": "V. Pandit and H. Ji, “Efficient in-network evaluation of multiple queries,” in HiPC, 2006, pp. 205–216.",
"source_ref_id": "bf483f445199aaa17a360fa4f7f7dfea6a401662",
"start": 1196
... | 0807.1720 | Resource Allocation Strategies for In-Network Stream Processing | [
"Anne Benoit",
"Henri Casanova",
"Veronika Rehn-Sonigo",
"Yves Robert"
] | [
"cs.DC"
] | 2,008 | en | Computer Science | [
-0.00416455278173089,
0.006075212731957436,
-0.0340181402862072,
0.03722164407372475,
-0.00029365436057560146,
-0.020029515027999878,
0.02399575710296631,
0.003499063430353999,
0.03282826766371727,
0.05500870943069458,
-0.02205839939415455,
-0.023583877831697464,
0.018915917724370956,
-0.0... | |
83e6878a4ed0a4d58aaea20b09c06d7f0f19642e | abstract | 0 | 12 | Abstract | After launch, the Advanced CCD Imaging Spectrometer (ACIS), a focal plane
instrument on the Chandra X-ray Observatory, suffered radiation damage from
exposure to soft protons during passages through the Earth's radiation belts.
An effect of the damage was to increase the charge transfer inefficiency (CTI)
of the front ... | {
"cite_spans": []
} | 10.1117/12.789750 | 0807.1721 | Physics of reverse annealing in high-resistivity Chandra ACIS CCDs | [
"C. E. Grant",
"B. LaMarr",
"G. Y. Prigozhin",
"S. E. Kissel",
"S. K. Brown",
"M. W. Bautz"
] | [
"astro-ph",
"physics.ins-det"
] | 2,008 | en | Physics | [
-0.03679932653903961,
-0.013921801000833511,
-0.0622171014547348,
0.032985132187604904,
0.0091388039290905,
-0.07250016182661057,
-0.013410699553787708,
0.008749756962060928,
0.021512042731046677,
0.02851489931344986,
-0.02122216485440731,
-0.0037932139821350574,
-0.0025459732860326767,
0.... |
593561b44b1a72ef446cceae58d52c244ba6d317 | subsection | 1 | 12 | INTRODUCTION | The Advanced CCD Imaging Spectrometer (ACIS), one of two focal plane science instruments on the Chandra X-ray Observatory, utilizes frame-transfer charge-coupled devices (CCDs) of two types, front- and back-illuminated (FI and BI). Soon after launch it was discovered that the FI CCDs had suffered radiation damage from ... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 456,
"openalex_id": "",
"raw": "Prigozhin, G. Y., Kissel, S. E., Bautz, M. W., Grant, C., LaMarr, B., Foster, R. F., and Ricker, G. R., “Characterization of the radiation damage in the Chandra x-ray CCDs,” in [X-ray and Gamma-Ray ... | 10.1117/12.789750 | 0807.1721 | Physics of reverse annealing in high-resistivity Chandra ACIS CCDs | [
"C. E. Grant",
"B. LaMarr",
"G. Y. Prigozhin",
"S. E. Kissel",
"S. K. Brown",
"M. W. Bautz"
] | [
"astro-ph",
"physics.ins-det"
] | 2,008 | en | Physics | [
-0.02170758694410324,
-0.010724127292633057,
-0.06791438907384872,
0.06687706708908081,
0.002484626369550824,
-0.07944702357053757,
-0.012020786292850971,
0.004275158978998661,
-0.011189399287104607,
0.033804647624492645,
-0.03087572380900383,
-0.012859799899160862,
0.002995662158355117,
0... |
1b2ee559da091de5a718b2f917c9e551e9f7247a | subsection | 2 | 12 | EXPERIMENTAL DETAILS | The ACIS CCDs are buried channel devices made of high-resistivity float zone silicon with a depletion depth of 50–75 \mu m. Each CCD is a framestore-transfer device with 1024 by 1026 pixels in the imaging and framestore arrays. The pixels in the imaging array are 24 \mu m square. The image-to-framestore transfer rate i... | {
"cite_spans": []
} | 10.1117/12.789750 | 0807.1721 | Physics of reverse annealing in high-resistivity Chandra ACIS CCDs | [
"C. E. Grant",
"B. LaMarr",
"G. Y. Prigozhin",
"S. E. Kissel",
"S. K. Brown",
"M. W. Bautz"
] | [
"astro-ph",
"physics.ins-det"
] | 2,008 | en | Physics | [
-0.031376585364341736,
-0.02759185992181301,
-0.07294750958681107,
0.009622051380574703,
0.031895458698272705,
-0.027317162603139877,
-0.0185420960187912,
0.020953333005309105,
0.015573835000395775,
0.044195812195539474,
-0.024295488372445107,
-0.009652572683990002,
0.01128549873828888,
0.... |
2be9d56307de1657be0228aeb358924d6e9752c2 | subsection | 3 | 12 | EXPERIMENTAL DETAILS | Parallel CTI was measured by fitting a linear function to the center pixel pulseheight as a function of row. Serial CTI is unaffected by the low-energy protons used here and was not measured.Three different irradiation/annealing profiles were used. In all cases, the CCDs were powered off during both irradiation and ann... | {
"cite_spans": []
} | 10.1117/12.789750 | 0807.1721 | Physics of reverse annealing in high-resistivity Chandra ACIS CCDs | [
"C. E. Grant",
"B. LaMarr",
"G. Y. Prigozhin",
"S. E. Kissel",
"S. K. Brown",
"M. W. Bautz"
] | [
"astro-ph",
"physics.ins-det"
] | 2,008 | en | Physics | [
-0.06278818100690842,
-0.01574280858039856,
-0.045947033911943436,
0.033072102814912796,
-0.025826137512922287,
-0.025978684425354004,
0.023690486326813698,
0.010617243126034737,
-0.018107280135154724,
0.02918216399848461,
-0.01940392702817917,
-0.011784223839640617,
0.009099404327571392,
... |
2265881f93436a3945c374bab6ade4a09f53fdcc | subsection | 4 | 12 | RESULTS | We then use our measured CTI to examine the properties of the reverse annealing. Before we can understand our results, however, we need to confront two sources of systematic error and either correct the CTI data or increase the error associated with each measurement to compensate. These error sources are due to variabl... | {
"cite_spans": []
} | 10.1117/12.789750 | 0807.1721 | Physics of reverse annealing in high-resistivity Chandra ACIS CCDs | [
"C. E. Grant",
"B. LaMarr",
"G. Y. Prigozhin",
"S. E. Kissel",
"S. K. Brown",
"M. W. Bautz"
] | [
"astro-ph",
"physics.ins-det"
] | 2,008 | en | Physics | [
-0.0501592792570591,
-0.004511741921305656,
-0.046803124248981476,
0.04799303412437439,
0.013020360842347145,
-0.06541453301906586,
0.0012270946754142642,
0.016475675627589226,
-0.008459039032459259,
0.02698654681444168,
-0.024927087128162384,
-0.037161801010370255,
-0.0031120721250772476,
... |
a4a10a251fbf74fdf49466997f944b5f3c0809d4 | subsection | 5 | 12 | Temperature Variation Corrections | Measured CTI is a function of temperature. Detrapping time constants decrease as the temperature increases so that different populations of traps can become more or less important. If the detrapping time constant drops below the pixel-to-pixel transfer time (40 \mu s for the ACIS imaging array) or becomes much longer t... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 707,
"openalex_id": "",
"raw": "Grant, C. E., Bautz, M. W., Kissel, S., LaMarr, B., and Prigozhin, G. Y., “Temperature dependence of charge transfer inefficiency in Chandra x-ray CCDs,” in [High Energy, Optical, and Infrared Detec... | 10.1117/12.789750 | 0807.1721 | Physics of reverse annealing in high-resistivity Chandra ACIS CCDs | [
"C. E. Grant",
"B. LaMarr",
"G. Y. Prigozhin",
"S. E. Kissel",
"S. K. Brown",
"M. W. Bautz"
] | [
"astro-ph",
"physics.ins-det"
] | 2,008 | en | Physics | [
-0.009444312192499638,
-0.04534490406513214,
-0.05578094720840454,
0.03725849837064743,
-0.016218584030866623,
-0.0936802551150322,
-0.010169037617743015,
-0.007571469992399216,
-0.007548584137111902,
0.021818039938807487,
-0.017378143966197968,
-0.05050189420580864,
0.0010699230479076505,
... |
83d95820604f558a435fc33cb304676caef9e879 | subsection | 6 | 12 | Post-Irradiation CTI Relaxation | An additional unexpected source of systematic error is that repeated CTI measurements immediately after irradiation, but before annealing, show clear “relaxation” or reduction of CTI during the first hour after irradiation. For most CCD quadrants, annealing took place many hours after irradiation, and multiple pre-anne... | {
"cite_spans": []
} | 10.1117/12.789750 | 0807.1721 | Physics of reverse annealing in high-resistivity Chandra ACIS CCDs | [
"C. E. Grant",
"B. LaMarr",
"G. Y. Prigozhin",
"S. E. Kissel",
"S. K. Brown",
"M. W. Bautz"
] | [
"astro-ph",
"physics.ins-det"
] | 2,008 | en | Physics | [
-0.037607621401548386,
0.002291332697495818,
-0.0648365169763565,
0.007837465032935143,
-0.016239654272794724,
-0.0858992263674736,
-0.005624353885650635,
0.024100013077259064,
-0.0003686927957460284,
0.009569795802235603,
-0.01746068149805069,
-0.046582166105508804,
-0.018620656803250313,
... |
f457bf061780456fd9a610001cb3207f2362172b | subsection | 7 | 12 | Anomalous Annealing Results | In this experiment, as in our previous experiment and the flight experience, room-temperature annealing increases the CTI of the CCDs. If we assume that the CTI increase due to annealing should be proportional to the CTI increase from the pre-anneal irradiation independent of dose, then we can define the ratio, R, such... | {
"cite_spans": []
} | 10.1117/12.789750 | 0807.1721 | Physics of reverse annealing in high-resistivity Chandra ACIS CCDs | [
"C. E. Grant",
"B. LaMarr",
"G. Y. Prigozhin",
"S. E. Kissel",
"S. K. Brown",
"M. W. Bautz"
] | [
"astro-ph",
"physics.ins-det"
] | 2,008 | en | Physics | [
-0.04813406243920326,
-0.0025906015653163195,
-0.05085057020187378,
0.013132327236235142,
-0.031285613775253296,
-0.056405674666166306,
-0.0031915141735225916,
0.05918322503566742,
0.0003026024787686765,
0.019137639552354813,
-0.003351757535710931,
-0.016924753785133362,
-0.04578382521867752... |
354f3354af93d3242813e5e3a361d1d8da26b2ef | subsection | 8 | 12 | Long Duration Annealing | A long duration anneal was done at the conclusion of the isochronal annealing (which will be discussed in Section REF ). The CCDs were annealed at a temperature of +30^\circ C for intervals of one hour, one hour again, six hours and finally over a hundred hours. Between each annealing interval, the temperature was low... | {
"cite_spans": []
} | 10.1117/12.789750 | 0807.1721 | Physics of reverse annealing in high-resistivity Chandra ACIS CCDs | [
"C. E. Grant",
"B. LaMarr",
"G. Y. Prigozhin",
"S. E. Kissel",
"S. K. Brown",
"M. W. Bautz"
] | [
"astro-ph",
"physics.ins-det"
] | 2,008 | en | Physics | [
-0.04009249061346054,
-0.029672713950276375,
-0.03838383033871651,
0.04415055736899376,
-0.028421729803085327,
-0.060413338243961334,
-0.012425925582647324,
0.041526541113853455,
-0.02628590539097786,
0.012715787626802921,
-0.0007027246174402535,
-0.037468474358320236,
-0.019741127267479897,... |
a2b5eb148f2aaf1762b8c242bac5f4daff67a029 | subsection | 9 | 12 | Multi-Temperature Isochronal Annealing | A multi-temperature isochronal annealing cycle was done to test the sensitivity of the annealing rate to temperature. After irradiation, the CCD was annealed for one hour intervals each at 0^\circ C, +10^\circ C, +20^\circ C, and +30^\circ C. The temperature was returned to –100^\circ C between each annealing inte... | {
"cite_spans": []
} | 10.1117/12.789750 | 0807.1721 | Physics of reverse annealing in high-resistivity Chandra ACIS CCDs | [
"C. E. Grant",
"B. LaMarr",
"G. Y. Prigozhin",
"S. E. Kissel",
"S. K. Brown",
"M. W. Bautz"
] | [
"astro-ph",
"physics.ins-det"
] | 2,008 | en | Physics | [
-0.06525041908025742,
-0.021317781880497932,
-0.027879446744918823,
0.04690827429294586,
-0.027345357462763786,
-0.08301269263029099,
-0.016343124210834503,
0.02096680924296379,
-0.03210638090968132,
0.004703798331320286,
-0.009728049859404564,
-0.051730334758758545,
-0.008736169897019863,
... |
01c1589933584977c307533511e57092ec038fc3 | subsection | 10 | 12 | DISCUSSION | In our initial experiment reported in Paper I, we found a substantial difference in the magnitude of the annealing-induced CTI between the ground and flight devices. Several explanations were proposed, such as differences in impurity concentrations between CCDs and in the energy spectrum of the irradiating particles. T... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 2019,
"openalex_id": "",
"raw": "Prigozhin, G. Y., Kissel, S. E., Bautz, M. W., Grant, C., LaMarr, B., Foster, R. F., and Ricker, G. R., “Characterization of the radiation damage in the Chandra x-ray CCDs,” in [X-ray and Gamma-Ray... | 10.1117/12.789750 | 0807.1721 | Physics of reverse annealing in high-resistivity Chandra ACIS CCDs | [
"C. E. Grant",
"B. LaMarr",
"G. Y. Prigozhin",
"S. E. Kissel",
"S. K. Brown",
"M. W. Bautz"
] | [
"astro-ph",
"physics.ins-det"
] | 2,008 | en | Physics | [
-0.02401074208319187,
-0.001973564038053155,
-0.05479452759027481,
0.0034894898999482393,
-0.006105653941631317,
-0.10104648023843765,
-0.004225524608045816,
0.0015502488240599632,
-0.0005463053821586072,
0.010434146970510483,
-0.02152424119412899,
-0.036824606359004974,
-0.01430118829011917... |
4b3f7aba77fe9c5d5777915109a0767bbfdb3af7 | subsection | 11 | 12 | CONCLUSION | We report the results of laboratory experiments of cold irradiation and room-temperature annealing on ACIS CCDs. Six CCDs were irradiated cold, at –100^\circ C, by low-energy protons with energies from 100 to 400 keV. The CCDs were then annealed at +30^\circ C in one of three annealing cycles. We used the fractional ... | {
"cite_spans": []
} | 10.1117/12.789750 | 0807.1721 | Physics of reverse annealing in high-resistivity Chandra ACIS CCDs | [
"C. E. Grant",
"B. LaMarr",
"G. Y. Prigozhin",
"S. E. Kissel",
"S. K. Brown",
"M. W. Bautz"
] | [
"astro-ph",
"physics.ins-det"
] | 2,008 | en | Physics | [
-0.03849349543452263,
-0.016300972551107407,
-0.038615599274635315,
0.026817236095666885,
-0.008753377944231033,
-0.07698699086904526,
-0.007456016261130571,
0.006677598692476749,
-0.018743066117167473,
0.02547408640384674,
-0.00626549543812871,
-0.02764144353568554,
-0.011287050321698189,
... |
c3ace64ba6b703af279d7343ce4fffd605386cf9 | abstract | 0 | 19 | Abstract | We study the stability and the modes of non -- isothermal coronal loop models
with different intensity values of the equilibrium twisted magnetic field.We
use an energy principle obtained via non -- equilibrium thermodynamic
arguments. The principle is expressed in terms of Hermitian operators and
allows to consider to... | {
"cite_spans": []
} | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.0076333219185471535,
-0.008552677929401398,
-0.023727767169475555,
-0.016708621755242348,
-0.04458684101700783,
-0.064942367374897,
0.02444494143128395,
-0.01063553337007761,
-0.011818107217550278,
0.02154572866857052,
0.009262221865355968,
-0.0329899899661541,
-0.00035834842128679156,
... |
414cfc6d92e893046b12dc5a19910967a0fbe46f | subsection | 1 | 19 | Variational principle | A crucial
requirement for any theoretical model of coronal structures
is to give account of the stability and evolution of far–from–equilibrium states which are responsible of the characteristic rich topology and dynamics of the solar corona.
This implies to
consider the coupling of thermal and mechanical equations.
Di... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 680,
"openalex_id": "",
"raw": "Bernstein I. B., 1958, PhRv, 109, 10",
"source_ref_id": "0a8bead6c4fb6cd508f87a94bb8347ba054521e9",
"start": 487
},
{
"arxiv_id": "",
"doi": "",
"end": 1363,
... | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
0.0015233897138386965,
0.024542123079299927,
-0.028006713837385178,
0.012324480339884758,
-0.004189560189843178,
-0.048076920211315155,
0.030509766191244125,
0.023977410048246384,
-0.007753357291221619,
0.003800366073846817,
-0.0006305326241999865,
-0.006204212084412575,
-0.01327075622975826... |
99164f6864e2c2db106b93fc5f9c1dbb6426ba6a | subsection | 2 | 19 | Solar coronal loops | MHD loop oscillations in the corona are known to be
strongly damped, mostly having decaying times of few periods
N_{p}\approx 2 - 7 \ periods. While thermal conduction, with the
contribution of
radiative cooling mechanisms, could be the main
cause of the damping of pure
MHD slow magnetoacoustic mode oscillations they a... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 565,
"openalex_id": "",
"raw": "Halberstadt G., Goedbloed J. P., 1994, A&A, 286, 275",
"source_ref_id": "287cb96458620aa75810584342f24aaf85713e85",
"start": 359
},
{
"arxiv_id": "",
"doi": "",
... | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.021664682775735855,
0.014959311112761497,
-0.051323939114809036,
-0.02758432924747467,
0.005683165043592453,
-0.03243599832057953,
-0.01417358499020338,
0.0187811441719532,
-0.0056183235719799995,
0.032588567584753036,
-0.0197270680218935,
-0.016431594267487526,
-0.028057290241122246,
0... |
555874b6a8291c1466fe259e98590484e3f1c52d | subsection | 3 | 19 | Solar coronal loops | They
found that pure Alfvén and pure slow modes are obtained as
singular limiting cases of cluster spectra of Alfvén–fast or
slow–fast modes, where the fast components are localized in a
photospheric boundary associated to the line–tied condition:
the coronal part of the
loop acting as a resonant cavity of large Alfvén... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 931,
"openalex_id": "",
"raw": "Goedbloed J. P., Halberstadt G., 1993, A&A, 280, 647",
"source_ref_id": "c86caa7121588da28b07ad17a02de073647a5ff2",
"start": 751
}
]
} | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.025063801556825638,
0.020639881491661072,
-0.019922900944948196,
0.005804489832371473,
-0.011509822681546211,
-0.02700117416679859,
0.020563606172800064,
0.012509019114077091,
0.00855799950659275,
0.02793172374367714,
0.005888391751796007,
0.007791440933942795,
-0.006750293541699648,
0.... |
e560a0448f05659dfdd94d99499b058e8b02e4d7 | subsection | 4 | 19 | The MHD stability criterion for coronal structures | Solar coronal conditions with large Reynolds numbers are well fitted by
ideal MHD plasma models (i.e. infinite electrical
conductivity \sigma \gg 1 leading to vanishing viscosity and
ohmic dissipation). Thus, the fundamental equations considered are the
mass conservation equation,
the perfect gas law or state equation ... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 2327,
"openalex_id": "",
"raw": "Costa A., González R., Sicardi Schifino A. C., 2004, A&A, 427, 353",
"source_ref_id": "22285ed112a822a561880f14b3b1613a2d7ce7af",
"start": 1209
}
]
} | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.016068022698163986,
0.06176957115530968,
-0.035706717520952225,
-0.009460754692554474,
-0.015594985336065292,
-0.0678732842206955,
0.010795941576361656,
0.0373242013156414,
0.012955130077898502,
0.016754690557718277,
-0.03077797032892704,
-0.015236392617225647,
-0.00857571605592966,
0.0... |
63228d3a588e01bd8013a0598a4afb7c2354bec4 | subsection | 5 | 19 | Application to an inhomogeneous loop model with non–vanishing helicity | On one hand, the azimuthal component of the loop perturbation is
believed to be one of the principle responsible of resonant
absorption and damping of ideal oscillations; on
the other, this component is associated to the storage of
magnetic energy in systems with non–vanishing helicity which
eventually is released by i... | {
"cite_spans": []
} | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.011464671231806278,
0.012250341475009918,
-0.012235085479915142,
0.017116915434598923,
-0.027490802109241486,
-0.05077102780342102,
0.007105350494384766,
-0.024226078763604164,
0.016552453860640526,
0.025538070127367973,
-0.03328797593712807,
-0.016033759340643883,
-0.000451473897555843,
... |
a1f443603a3bb642caa2baf26c40ecc4a29ba0f9 | subsection | 6 | 19 | Mechanical equilibrium | To determine an equilibrium configuration we assume
force–free equations. This assumption is justified for coronal conditions due to the fact that in plasmas with low
\mathcal {\beta } (gas pressure over the magnetic pressure) the
pressure gradient can be neglected in comparison to the Lorentz
force. For the chromosphe... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 625,
"openalex_id": "",
"raw": "Ruderman M.S., 2007, SoPh, 246, 119",
"source_ref_id": "c23414b1b67a967995f634e19b35fbe71da8bcac",
"start": 395
},
{
"arxiv_id": "",
"doi": "",
"end": 625,
... | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.03469327837228775,
0.028117727488279343,
-0.03853791579604149,
-0.016568558290600777,
0.009016591124236584,
-0.0177738219499588,
0.03936176747083664,
0.0354866161942482,
-0.010748203843832016,
0.0185824166983366,
0.005355031229555607,
0.010465958155691624,
-0.0031542812939733267,
0.0071... |
18ff6ed502e9e9b647bd5a0ede5c3c0027dab5b7 | subsection | 7 | 19 | Thermal equilibrium | The thermal equilibrium is obtained, as in Paper I, assuming L=0 in the balance energy equation
(eq. REF ) . The procedure
developed consists in obtaining the function of the temperature along the
arc element s by integrating eq. REF with the constraint L=0 and
replacing border conditions: the temperature at the bottom... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 1041,
"openalex_id": "",
"raw": "Priest E. R., 1982, ”Solar Magneto-hydrodynamics” (Boston:Publishing Company)",
"source_ref_id": "2a806f170c2470c287008ed3d8a4f938aa74c100",
"start": 382
},
{
"arxiv_id": ... | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
0.0482279509305954,
0.009332719258964062,
-0.06843485683202744,
0.03589624911546707,
-0.0038841816131025553,
-0.03385113924741745,
0.03916231915354729,
-0.01032475009560585,
0.01629982702434063,
0.014353920705616474,
-0.0030276014003902674,
-0.002651774324476719,
-0.022053604945540428,
0.0... |
970bdc69d332536c077b2e29a0227b453d864c15 | subsection | 8 | 19 | The perturbation | To calculate the stability and the structure of the modes the
general perturbation along the equilibrium magnetic field is
written\vec{\xi }=[\zeta _{r}(r,z)
\mathbf {e}_{t}+i \zeta _{\phi }(r,z) \mathbf {e}_{\phi }+\zeta _{z}(r,z) \mathbf {e}_{z}]e^{im\phi } \ \ T_{1}=T_{1}(r,z)e^{im\phi }with r=R.
The \phi dependence... | {
"cite_spans": []
} | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
0.002174515277147293,
0.014107645489275455,
-0.015099529176950455,
-0.020799048244953156,
0.00020707966177724302,
-0.04117082431912422,
0.04455849155783653,
-0.014145794324576855,
0.02704028971493244,
0.01294790394604206,
-0.010361375287175179,
-0.030870487913489342,
-0.000649016525130719,
... |
39eab1cef2907870cb5d8b94255d3fc94e6aa766 | subsection | 9 | 19 | Results and discussion | Convective motion of the photosphere is believed to provide the
energy that is storage in twisted magnetic coronal fields allowing
the presence of long–lived coronal structures until it is
released by instabilities (; ). On the
other hand, continuous spectra are generally associated to stability.
An accepted conjecture... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 220,
"openalex_id": "",
"raw": "Raadu M.A., Schmieder B., Mein N., Geesztelyi L., 1988, A&A, 197, 289",
"source_ref_id": "aeba585fb1a40c22966f909f7ad1f5914705738b",
"start": 0
},
{
"arxiv_id": "",
"... | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.04587950184941292,
-0.012774830684065819,
-0.017811503261327744,
-0.009020221419632435,
0.009684146381914616,
-0.03656928986310959,
0.007192519959062338,
-0.011729340068995953,
0.027671169489622116,
0.00906600896269083,
-0.00810446310788393,
-0.003764149034395814,
-0.02982320263981819,
... |
83c3f399bd987683500eaef436ccd038f47f28ea | subsection | 10 | 19 | Results and discussion | A matrix discrete eigenvalue problem subject to a
normalization constraint was obtained. From the resulting modes and the
generalized potential energy (eq. REF ): \delta ^{2}W_{p}\ge 0 the stability of each mode was determined.The coronal loop parameters used were: L=10^{10}cm (or L=100Mm),
T_{b}=10^{4}K T_{t}=10^{6}K ... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 926,
"openalex_id": "",
"raw": "Aschwanden, M. J. 2004, \"Physics of the Solar Corona\", (New York:Springer-Verlag).",
"source_ref_id": "b37502a7eb7bcec88345c1701ef697937c69a500",
"start": 789
},
{
"arxiv... | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.0023491918109357357,
0.010769671760499477,
-0.03810572251677513,
-0.03102763742208481,
-0.004179731011390686,
-0.021691886708140373,
0.04033287614583969,
0.000019783168681897223,
0.011936640366911888,
0.0197698213160038,
-0.023064792156219482,
-0.007017066236585379,
-0.004633551929146051,... |
eb3286d1d5da35011df445ca5ca222f66b8b67bb | subsection | 11 | 19 | Results and discussion | For B_{0}=10G and weak
and moderate helicity cases there are five different groups of periods
(P_{1}-P_{6};P_{7}-P_{10};P_{11}-P_{12};P_{13}-P_{14};P_{15}-
P_{18}) (see also Table 2). The clustering is more difficult to establish i.e., the
differences are less pronounced, with increasing magnetic field
intensity and la... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 1348,
"openalex_id": "",
"raw": "Freidberg, J.P, 1982, Reviews of Modern Physics, 54, 3",
"source_ref_id": "8c00192a504a96bd54c8e254a9bd5563c2fba31f",
"start": 1113
},
{
"arxiv_id": "",
"doi": "",
... | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.0132380286231637,
-0.0071340384893119335,
-0.025713058188557625,
-0.019776927307248116,
0.0218065045773983,
-0.02182176522910595,
0.04016425460577011,
0.025102658197283745,
0.035952500998973846,
0.02026524767279625,
-0.025713058188557625,
-0.021638644859194756,
-0.013077798299491405,
-0... |
b593464058e2a4eb64179b51234c6c6969b51b67 | subsection | 12 | 19 | Results and discussion | Table 2 (Second Panel) also shows the
intensity relationship between the cylindrical components.
In order to classify the modes and to compare
with the slow and fast
magnetoacoustic modes obtained in Paper I, we calculated the cylindrical
mode components and also the tangential and normal to the field
components
(\xi _... | {
"cite_spans": []
} | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.01861167512834072,
0.033470503985881805,
-0.018764231353998184,
-0.0178183913230896,
-0.007765035144984722,
-0.017803136259317398,
0.03807765617966652,
0.017070872709155083,
0.04399678111076355,
0.01624707691371441,
-0.028039557859301567,
-0.057085976004600525,
-0.00813116692006588,
-0.... |
83fb5866310c9d4c06a2ca0d49b39870e7b4c308 | subsection | 13 | 19 | Results and discussion | The \xi _{\parallel } and \xi _{\perp } components are in an inverted phase for real eigenvector modes and in phase for imaginary eigenvector modes.For moderate helicity the overall description is similar but all the cases having non vanishing
\xi _{\phi } component and all the periods in the resonant
line-tied continu... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 2703,
"openalex_id": "",
"raw": "Ruderman M.S., 2007, SoPh, 246, 119",
"source_ref_id": "c23414b1b67a967995f634e19b35fbe71da8bcac",
"start": 2354
},
{
"arxiv_id": "",
"doi": "",
"end": 2855,
... | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.029367493465542793,
-0.0006669663125649095,
-0.013646350242197514,
-0.012441138736903667,
-0.011136763729155064,
0.0012481184676289558,
0.03283056989312172,
0.040550027042627335,
0.0021625154186040163,
0.01166309043765068,
-0.030496425926685333,
-0.04396733269095421,
0.0011203507892787457... |
c6968508594c6d72f9f92eacf453721d8e747373 | subsection | 14 | 19 | Results and discussion | However, when the helicity is incremented to
b=0.5 even for the radius of R=0.01 the loop structure is unstable, thus, instability can be associated with the presence of helicity values larger than a critical one.Figure REF shows the general potential energy for P_{6} and
P_{7} in the weak and moderate cases. Note the ... | {
"cite_spans": []
} | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.009706689044833183,
0.010866607539355755,
-0.024251459166407585,
-0.017215637490153313,
-0.006318504922091961,
-0.034095507115125656,
0.02249632030725479,
0.042153891175985336,
0.007734064012765884,
0.004326802212744951,
-0.011957847513258457,
-0.023045755922794342,
-0.0009844048181548715... |
e0990dbad8aa09182c424aa483428c054c17fc69 | subsection | 15 | 19 | Results and discussion | Meanwhile all the "zoo" of the coronal seismology can be active and accessible to observations.
[Figure: Energy content of the sixth and seventh mode for B_{0}=10G. a) Total potential energy and b) magnetic potential energy respectively for the sixth mode P_{6}=1.23 \ min and for weak helicity. c) Total potential energ... | {
"cite_spans": []
} | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
0.00947654340416193,
0.019365111365914345,
-0.02553020417690277,
-0.03464050590991974,
-0.008431224152445793,
-0.06015545129776001,
0.0356781929731369,
0.0521286204457283,
-0.004192722029983997,
0.014481867663562298,
-0.0010796545539051294,
-0.003925669472664595,
0.02774292416870594,
-0.01... |
7741ea3141331e60aff0c22cd7210f0bb6622a28 | subsection | 16 | 19 | Appendix: Generalized potential energy terms | From the procedure described above and extensively exemplified in Paper I we
can obtain -laboriously but in a straightforward way- the explicit terms for the energy principle given in eq. REF :\delta ^{2} W_{p}= \delta ^{2} W_{c}+\delta ^{2} W_{m}+\delta ^{2} W_{hc}+\delta ^{2} W_{r}where the right side of the equation... | {
"cite_spans": []
} | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.0023218169808387756,
0.03183769807219505,
-0.01775035634636879,
-0.030860895290970802,
-0.033760782331228256,
-0.07735065370798111,
0.044841401278972626,
0.024145370349287987,
0.03550071269273758,
0.010950886644423008,
-0.004647449590265751,
-0.023580655455589294,
-0.023412765935063362,
... |
69a834a27c85686d8a459a97c0667721b597ba75 | subsection | 17 | 19 | Appendix: Generalized potential energy terms | \Delta \frac{d\rho _{0}}{ds}(\frac{\xi _{r}\xi _{\phi }}{R} -\frac{m}{R}
\xi _{\phi }\xi _{z}+\xi _{z}\frac{d\xi _{z}}{dz}) \right)The magnetic contribution is:\delta ^{2} W_{m}=C_{1}\left\lbrace \beta \Delta \left(\frac{m}{R}B_{\phi }B_{z}\xi _{r}
\xi _{\phi }-B_{\phi }B_{z}\frac{d\xi _{r}}{dz}\xi _{z}\right. \right.-... | {
"cite_spans": []
} | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.03024897538125515,
0.0013824071502313018,
-0.036823514848947525,
0.006620300468057394,
-0.04368788003921509,
-0.028464240953326225,
0.027182891964912415,
0.005060563795268536,
0.0541217178106308,
0.002482612617313862,
-0.013797377236187458,
0.022896476089954376,
0.0013881274498999119,
0... |
285152d08b21b0d70db6fff94bb863f7835ee45f | subsection | 18 | 19 | Appendix: Generalized potential energy terms | \left. +\frac{5}{2}T_{0}^{3/2}\frac{d^{2}T_{0}}{ds^{2}}\right)
+\frac{1}{\Delta ^{2}}T_{0}^{5/2}T_{1}\frac{d^{2}T_{1}}{dz^{2}}\right\rbraceThe new compressional contribution is expressed as:\delta ^{2} W_{c2}=-\beta \left(\frac{m}{R} \rho _{0}\xi _{\phi }T_{1}+\Delta \frac{d \rho _{0}}{ds}
\xi _{z}T_{1}+\rho _{0}\xi _{... | {
"cite_spans": []
} | 10.1051/0004-6361:20079052 | 0807.1722 | Stability and mode analysis of solar coronal loops using thermodynamic
irreversible energy principles II. Modes in twisted non--isothermal magnetic
field configurations | [
"A. Costa",
"R. Gonzalez"
] | [
"astro-ph"
] | 2,008 | en | Physics | [
-0.025999154895544052,
0.0018604882061481476,
-0.04287419095635414,
0.027555441483855247,
-0.011283083818852901,
-0.025419360026717186,
0.01280885562300682,
0.049190886318683624,
0.038205329328775406,
0.01830926351249218,
-0.038083266466856,
-0.019209468737244606,
0.002233348786830902,
0.0... |
b1732164e2d6b083dfb2d2309d252ff660115e2a | abstract | 0 | 20 | Abstract | We investigate experimentally the mixing dynamics in a channel flow with a
finite stirring region undergoing chaotic advection. We study the
homogenization of dye in two variants of an eggbeater stirring protocol that
differ in the extent of their mixing region. In the first case, the mixing
region is separated from th... | {
"cite_spans": []
} | 10.1063/1.3080680 | 0807.1723 | Open-flow mixing: Experimental evidence for strange eigenmodes | [
"Emmanuelle Gouillart",
"Olivier Dauchot",
"Jean-Luc Thiffeault",
"Stéphane Roux"
] | [
"nlin.CD"
] | 2,008 | en | Physics | [
-0.01677114889025688,
-0.03595343604683876,
-0.01965535804629326,
0.01748838648200035,
-0.009400389157235622,
-0.020036868751049042,
-0.025271175429224968,
0.005051183048635721,
-0.003458381863310933,
0.053350258618593216,
-0.018602393567562103,
-0.011353716254234314,
0.013940349221229553,
... |
65101e7401e2c6e218da741151641447518461be | subsection | 1 | 20 | Introduction | Many industrial situations require the mixing of very viscous fluids,
and involve mechanical stirring in order to achieve sufficient
homogeneity. We investigate here the mixing scenario of a
low-diffusivity dye in a free-surface open flow that crosses a
localized stirring region. Relevant applications concern continuou... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 738,
"openalex_id": "",
"raw": "H. Aref, “Stirring by chaotic advection,” J. Fluid Mech. 143, 1 (1984).",
"source_ref_id": "8940730c2dd56c7bc9f8c183e06ee1d2fc05b842",
"start": 601
},
{
"arxiv_id": "",
... | 10.1063/1.3080680 | 0807.1723 | Open-flow mixing: Experimental evidence for strange eigenmodes | [
"Emmanuelle Gouillart",
"Olivier Dauchot",
"Jean-Luc Thiffeault",
"Stéphane Roux"
] | [
"nlin.CD"
] | 2,008 | en | Physics | [
-0.0034942219499498606,
-0.026397395879030228,
-0.050719622522592545,
0.0103300791233778,
0.018218781799077988,
0.02243015728890896,
-0.0411372147500515,
-0.00179574778303504,
0.001323684467934072,
0.03237877041101456,
-0.0064009870402514935,
-0.01664714515209198,
0.0407710075378418,
0.003... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.