Datasets:

PeytonT
/

full_paper_training_chunks_1m

id string	text string	target string	paper_id string	title string	categories string	year int32	offset int64	chunk_index int32	chunk_chars int32	chunk_overlap int32	source_dataset string
1001.0115:0:0	Title: Developing Artificial Herders Using Jason Abstract: This paper gives an overview of a proposed strategy for the "Cows and Herders" scenario given in the Multi-Agent Programming Contest 2009. The strategy is to be implemented using the Jason platform, based on the agent-oriented programming language Agent-Speak....	elegate targets to each of the herders – including himself. ? Contact: jv@imm.dtu.dk 1 Our system was designed using the Prometheus methodology as a guideline. By this we mean that we have adapted relevant concepts from the methodology, while not following it too strictly (as stated in [3]). It has allowed us to qui...	1001.0115	Developing Artificial Herders Using Jason	cs.MA	2,010	0	0	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.0115:2700:1	elegate targets to each of the herders – including himself. ? Contact: jv@imm.dtu.dk 1 Our system was designed using the Prometheus methodology as a guideline. By this we mean that we have adapted relevant concepts from the methodology, while not following it too strictly (as stated in [3]). It has allowed us to qui...	logic programming, but allows us to develop imperative extensions as well. The use of custom architectures in Jason allows us to implement a local simulation, as described in [1]. This eases the testing, as it can be done much faster. As reference implementation we have used an implementation of the 2008 contest made b...	1001.0115	Developing Artificial Herders Using Jason	cs.MA	2,010	2,700	1	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.0115:5400:2	logic programming, but allows us to develop imperative extensions as well. The use of custom architectures in Jason allows us to implement a local simulation, as described in [1]. This eases the testing, as it can be done much faster. As reference implementation we have used an implementation of the 2008 contest made b...	eat use of a clustering algorithm. The algorithm works be examining the surroundings of each cow; adjacent cows are grouped together. The strategy for herding the cows will be taken care of by the leading agent. The team leader will coordinate the herding, ensuring that the cows are fleeing the right way and that an ag...	1001.0115	Developing Artificial Herders Using Jason	cs.MA	2,010	5,400	2	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.0115:8100:3	eat use of a clustering algorithm. The algorithm works be examining the surroundings of each cow; adjacent cows are grouped together. The strategy for herding the cows will be taken care of by the leading agent. The team leader will coordinate the herding, ensuring that the cows are fleeing the right way and that an ag...	o long time to compute, since the duration of a turn is limited. At the time of writing this article our implementation is complete. However, the contest has been postponed until after the deadline of the article, so we are unable to discuss the results. We have managed to play a single training match against another t...	1001.0115	Developing Artificial Herders Using Jason	cs.MA	2,010	8,100	3	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:0:0	Title: Toward a Compositional Theory of Leftist Grammars and Transformations Abstract: Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as word transformers as a tool toward rigorous analyses of...	s expressive since they can only recognize regular languages. Then Jurdziński showed a PSPACE lower bound for accessibility in leftist grammars [Jur07], before improving this to a nonprimitive-recursive lower bound [Jur08]. Jurdziński’s results rely on encoding classical computational structures (linear-boun- ded aut...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	0	0	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:2700:1	s expressive since they can only recognize regular languages. Then Jurdziński showed a PSPACE lower bound for accessibility in leftist grammars [Jur07], before improving this to a nonprimitive-recursive lower bound [Jur08]. Jurdziński’s results rely on encoding classical computational structures (linear-boun- ded aut...	lized version of the completeness of greedy derivations. Sections 4 introduces leftist transformers and their sequential compositions. Section 5 specializes on the “simple” transformers that we use in Section 6 for our encoding of 3SAT. Finally Section 7 shows that so-called “anchored” transformers are closed under the...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	2,700	1	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:5400:2	lized version of the completeness of greedy derivations. Sections 4 introduces leftist transformers and their sequential compositions. Section 5 specializes on the “simple” transformers that we use in Section 6 for our encoding of 3SAT. Finally Section 7 shows that so-called “anchored” transformers are closed under the...	]). Leftist grammars are not context-free (deletions are contextual), or even context- sensitive (deletions are not length-preserving). For our purposes, we consider them as string rewrite systems, more precisely semi-Thue systems. Writing Σg for Σ ∪ {g}, the rules of P define a 1-step rewrite relation in the standard ...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	5,400	2	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:8100:3	]). Leftist grammars are not context-free (deletions are contextual), or even context- sensitive (deletions are not length-preserving). For our purposes, we consider them as string rewrite systems, more precisely semi-Thue systems. Writing Σg for Σ ∪ {g}, the rules of P define a 1-step rewrite relation in the standard ...	“has type τ” when τG is a sub-graph of τ. Thus a “type” is just a restriction on what are the allowed symbols and rules between them. Types are often given schematically, grouping symbols that play a similar role into a single vertex. For insertion: Σ g deletion: Fig. 1. Universal type (schematically). example, Fig. ...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	8,100	3	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:10800:4	“has type τ” when τG is a sub-graph of τ. Thus a “type” is just a restriction on what are the allowed symbols and rules between them. Types are often given schematically, grouping symbols that play a similar role into a single vertex. For insertion: Σ g deletion: Fig. 1. Universal type (schematically). example, Fig. ...	ufficient). Every derivation π has an equiv- alent greedy derivation π′ . Proof. With a derivation π of the form u0 ⇒r1 ,p1 u1 ⇒r2 ,p2 u2 · · · ⇒rn ,pn un , we associate def its measure µ(π) = hn, p1 , . . . , pn i, a (n + 1)-tuple of numbers. Measures are linearly ordered with the lexicographic ordering, giving rise ...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	10,800	4	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:13500:5	ufficient). Every derivation π has an equiv- alent greedy derivation π′ . Proof. With a derivation π of the form u0 ⇒r1 ,p1 u1 ⇒r2 ,p2 u2 · · · ⇒rn ,pn un , we associate def its measure µ(π) = hn, p1 , . . . , pn i, a (n + 1)-tuple of numbers. Measures are linearly ordered with the lexicographic ordering, giving rise ...	= B ∪C contains the “working” symbols, A D g Fig. 2. Type of leftist transformers. A consequence of the restrictions imposed on LTr’s is the following: Fact 4.1 A∗ D∗ is an invariant in any LTr G = (A, D, P, g). With G = (A, B,C, P, g), we associate a transformation (a relation between words) RG ⊆ A∗ × C∗ defined b...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	13,500	5	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:16200:6	= B ∪C contains the “working” symbols, A D g Fig. 2. Type of leftist transformers. A consequence of the restrictions imposed on LTr’s is the following: Fact 4.1 A∗ D∗ is an invariant in any LTr G = (A, D, P, g). With G = (A, B,C, P, g), we associate a transformation (a relation between words) RG ⊆ A∗ × C∗ defined b...	the insertion rules. The insertion relation IG ⊆ Σ∗ × Σ∗ associated with an insertion grammar G = def (Σ, P, g) is defined by u IG v ⇔ ug ⇒∗G vg. Obviously, IG ⊆ ⊑Σ . Observe that IG is not necessarily a leftist transformation since it does not require any separation between in- put and output symbols. A simple leftis...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	16,200	6	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:18900:7	the insertion rules. The insertion relation IG ⊆ Σ∗ × Σ∗ associated with an insertion grammar G = def (Σ, P, g) is defined by u IG v ⇔ ug ⇒∗G vg. Obviously, IG ⊆ ⊑Σ . Observe that IG is not necessarily a leftist transformation since it does not require any separation between in- put and output symbols. A simple leftis...	iva- tion u ⇒n v (respectively, a derivation u ⇒≤n v of non-exact length at most n) between given u and v. These questions are among the simplest reachability questions and, since we consider that the input n is given in unary,2 they are obviously in NP for leftist grammars (and all semi-Thue systems). 2 It is natural ...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	18,900	7	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:21600:8	iva- tion u ⇒n v (respectively, a derivation u ⇒≤n v of non-exact length at most n) between given u and v. These questions are among the simplest reachability questions and, since we consider that the input n is given in unary,2 they are obviously in NP for leftist grammars (and all semi-Thue systems). 2 It is natural ...	V j ∪V j′ , so that Σ is partitioned in levels with Σ = j=0 W j . With each x j ∈ X we associate two intermediary LTr’s: def def G⊤j = (W j−1 , ∅,V j , Pj , g), G⊥j = (W j−1 , ∅,V j′ , P′j , g) with sets of rules Pj and P′j . The rules for G⊤j are given in Fig. 5: some deletion rules are conditional, depending on whet...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	21,600	8	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:24300:9	V j ∪V j′ , so that Σ is partitioned in levels with Σ = j=0 W j . With each x j ∈ X we associate two intermediary LTr’s: def def G⊤j = (W j−1 , ∅,V j , Pj , g), G⊥j = (W j−1 , ∅,V j′ , P′j , g) with sets of rules Pj and P′j . The rules for G⊤j are given in Fig. 5: some deletion rules are conditional, depending on whet...	erations for the composition of the LTr’s, can be carried out in logarithmic space. ⊓ ⊔ 6.2 Correctness of the Reduction j j j j We say that a word u is j-clean if it has exactly m symbols and if u[i] ∈ {Ti , T ′ i ,Ui ,U ′ i } for all i = 1, . . . , m. It is ⊤-homogeneous (resp. ⊥-homogeneous) if it does not contain ...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	24,300	9	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:27000:10	erations for the composition of the LTr’s, can be carried out in logarithmic space. ⊓ ⊔ 6.2 Correctness of the Reduction j j j j We say that a word u is j-clean if it has exactly m symbols and if u[i] ∈ {Ti , T ′ i ,Ui ,U ′ i } for all i = 1, . . . , m. It is ⊤-homogeneous (resp. ⊥-homogeneous) if it does not contain ...	two assumptions on Φ that are no loss of generality. First we require that no clause Ci contains both a literal and its negation, hence no Ci is tautologically def valid. Then u0 = U10 · · ·Um0 codes the empty valuation θ0 . Second, we require that Φ is only satisfiable with bn = ⊤ (which can be easily ensured by addin...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	27,000	10	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:29700:11	two assumptions on Φ that are no loss of generality. First we require that no clause Ci contains both a literal and its negation, hence no Ci is tautologically def valid. Then u0 = U10 · · ·Um0 codes the empty valuation θ0 . Second, we require that Φ is only satisfiable with bn = ⊤ (which can be easily ensured by addin...	′′n \| = m (it respects θ) and u′′n ⊑ un , we deduce that u′′n = un . Finally, θ \|= Φ since u′′n respects θ and u′′n = un = T1n · · · Tmn . ⊓ ⊔ Corollary 6.9. µ-Minimality of a derivation is coNP-hard. Proof (Sketch). We define G′Φ by taking GΦ , adding k extra symbols a1 , . . . , ak , and adding the following two se...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	29,700	11	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:32400:12	′′n \| = m (it respects θ) and u′′n ⊑ un , we deduce that u′′n = un . Finally, θ \|= Φ since u′′n respects θ and u′′n = un = T1n · · · Tmn . ⊓ ⊔ Corollary 6.9. µ-Minimality of a derivation is coNP-hard. Proof (Sketch). We define G′Φ by taking GΦ , adding k extra symbols a1 , . . . , ak , and adding the following two se...	et b1 , b2 6∈ A ∪C. The ALTr Rb2 ,b1 = (C, b2 , b1 , A, PR , g) with def g ai , ai a j , ai b1 PR = for all i, j = 1, . . . , n ai ci , b 1 b2 is called a renamer (of C to A), and often shortly written R. Observe that R : C ⊢ A is indeed an ALTr. It further satisfies SR = ≈ . ⊑ .h̄. We shall now glue an ALTr G : A ...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	32,400	12	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:35100:13	et b1 , b2 6∈ A ∪C. The ALTr Rb2 ,b1 = (C, b2 , b1 , A, PR , g) with def g ai , ai a j , ai b1 PR = for all i, j = 1, . . . , n ai ci , b 1 b2 is called a renamer (of C to A), and often shortly written R. Observe that R : C ⊢ A is indeed an ALTr. It further satisfies SR = ≈ . ⊑ .h̄. We shall now glue an ALTr G : A ...	ols. Let H = (Σ, PH , g) be the LGr such that and PH = P′ ∪ PR′ . Essentially, H is a union of the two wrapping ALTr’s. (See Fig. 7 in App. E.2 for a schematic description). Note that H is not a LTr since it does not respect any distinc- tion between input, intermediary, and output symbols. Lemma 7.4 (See App. E.3). Le...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	35,100	13	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:37800:14	ols. Let H = (Σ, PH , g) be the LGr such that and PH = P′ ∪ PR′ . Essentially, H is a union of the two wrapping ALTr’s. (See Fig. 7 in App. E.2 for a schematic description). Note that H is not a LTr since it does not respect any distinc- tion between input, intermediary, and output symbols. Lemma 7.4 (See App. E.3). Le...	e the modularity is essen- tial not so much for building complex grammars. Rather, it is essential for proving their correctness by a divide-and-conquer approach, in the way we proved the correctness of our encoding of 3SAT instances in Section 6. As another direction for future work, we would like to mention that the ...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	37,800	14	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:40500:15	e the modularity is essen- tial not so much for building complex grammars. Rather, it is essential for proving their correctness by a divide-and-conquer approach, in the way we proved the correctness of our encoding of 3SAT instances in Section 6. As another direction for future work, we would like to mention that the ...	π′ <µ π. ⊓ ⊔ In the rest of this section, we consider a generic transformation π of the form u0 ⇒r1 ,p1 u1 ⇒r2 ,p2 u2 · · · ⇒rn ,pn un in the context of some LGr G = (Σ, P, g). Lemma A.4. A µ-minimal derivation is leftmost. Proof. Assume π is not leftmost. Then it contains a step ui−1 = w1 aw2 ⇒ w′1 aw2 = ui where w1 i...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	40,500	15	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:43200:16	π′ <µ π. ⊓ ⊔ In the rest of this section, we consider a generic transformation π of the form u0 ⇒r1 ,p1 u1 ⇒r2 ,p2 u2 · · · ⇒rn ,pn un in the context of some LGr G = (Σ, P, g). Lemma A.4. A µ-minimal derivation is leftmost. Proof. Assume π is not leftmost. Then it contains a step ui−1 = w1 aw2 ⇒ w′1 aw2 = ui where w1 i...	rted and necessarily v = ε. We obtain uRG1 .RG2 v by observing that uRG1 ε (as witnessed by π) and that εRG2 ε (true of all leftist transformations). 2. Otherwise, we isolate the first G2 step and write π under the form 1π π2 z }\| { z }\| { ug ⇒G1 wg ⇒G2 w′ g ⇒∗G1 .G2 ug. ∗ Necessarily, w ∈ A∗1 D∗1 (Fact 4.1) and, sinc...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	43,200	16	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:45900:17	rted and necessarily v = ε. We obtain uRG1 .RG2 v by observing that uRG1 ε (as witnessed by π) and that εRG2 ε (true of all leftist transformations). 2. Otherwise, we isolate the first G2 step and write π under the form 1π π2 z }\| { z }\| { ug ⇒G1 wg ⇒G2 w′ g ⇒∗G1 .G2 ug. ∗ Necessarily, w ∈ A∗1 D∗1 (Fact 4.1) and, sinc...	ed as h′ (1) = 1 and h′ (i + 1) = h(i). ⊓ ⊔ E Proofs for Section 7 g kept A ∪ {b1 } D kept mirror replace A′ ∪ {b′1 } D′ r {b′1 } clean clean b-rules b-rules 1 2 Fig. 6. A schematic type for FG, 1 , 2 . iv Technical appendix, not for the proceedings version. E.1 Proof of Lemma 7.2 1. We first prove, by indu...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	45,900	17	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:48600:18	ed as h′ (1) = 1 and h′ (i + 1) = h(i). ⊓ ⊔ E Proofs for Section 7 g kept A ∪ {b1 } D kept mirror replace A′ ∪ {b′1 } D′ r {b′1 } clean clean b-rules b-rules 1 2 Fig. 6. A schematic type for FG, 1 , 2 . iv Technical appendix, not for the proceedings version. E.1 Proof of Lemma 7.2 1. We first prove, by indu...	not for the proceedings version. v g kept kept kept A ∪ {b1 } D kept mirror mirror replace clean A′ ∪ {b′1 } D′ r {b′1 } clean clean b-rules b-rules 1 b-rules 2 Fig. 7. Type of HG . Proof. We only prove the first invariant, the other two rely on similar arguments. Let w = u.l. .v with l ∈ A ∪ D and ∈ Σ . The i...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	48,600	18	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:51300:19	not for the proceedings version. v g kept kept kept A ∪ {b1 } D kept mirror mirror replace clean A′ ∪ {b′1 } D′ r {b′1 } clean clean b-rules b-rules 1 b-rules 2 Fig. 7. Type of HG . Proof. We only prove the first invariant, the other two rely on similar arguments. Let w = u.l. .v with l ∈ A ∪ D and ∈ Σ . The i...	tion is at the head of X or inside it), – 2 : • 2 1 leads to LCA (since necessarily in this case n1 = 0, n2 = 1, n3 = 0, n4 > 0, and n5 > 0), • 2 a′ , a′ ∈ A′ ∪ b′1 stays in LAC , – some letter x ∈ A ∪ b1 in Y : • x a or x a, a ∈ A ∪ b1 stays in LAC , • x a′ , a′ ∈ A′ ∪ b′1 stays in LAC if inserted at the head of Y , i...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	51,300	19	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:54000:20	tion is at the head of X or inside it), – 2 : • 2 1 leads to LCA (since necessarily in this case n1 = 0, n2 = 1, n3 = 0, n4 > 0, and n5 > 0), • 2 a′ , a′ ∈ A′ ∪ b′1 stays in LAC , – some letter x ∈ A ∪ b1 in Y : • x a or x a, a ∈ A ∪ b1 stays in LAC , • x a′ , a′ ∈ A′ ∪ b′1 stays in LAC if inserted at the head of Y , i...	one 1 , at least one of the two is deleted. Since Σ∗ .( 1 + 2 ).Σ∗ is an invariant, if the leftmost 1 is not deleted, the word will stay in 1 .Σ∗ .( 1 + 2 ).Σ∗ . So there is a subderivation of the form 1 .X.y.Z ′′ .g ⇒r0 1 .X.y.Z ′ .T.a.g ⇒r1 2 .x.g ⇒r2 1 .x′ .g ⇒r3 1 .β.T.g viii Technical appendix, not for the proce...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	54,000	20	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:56700:21	one 1 , at least one of the two is deleted. Since Σ∗ .( 1 + 2 ).Σ∗ is an invariant, if the leftmost 1 is not deleted, the word will stay in 1 .Σ∗ .( 1 + 2 ).Σ∗ . So there is a subderivation of the form 1 .X.y.Z ′′ .g ⇒r0 1 .X.y.Z ′ .T.a.g ⇒r1 2 .x.g ⇒r2 1 .x′ .g ⇒r3 1 .β.T.g viii Technical appendix, not for the proce...	nd the first step is in 1 .(A′ + b′1)+ .(A + b1)+ . Next, we notice that since from a step 2 .(D′ rb′1 )+ .(Drb1 )+ ⇒ 2 .(D′ rb′1 )+ .(Dr b1 ) .A (included) to a step 1 .(A′ + b′1 )+ .(A + b1 )+ ⇒ 1 .(A′ + b′1 )+ .(A + b1 )+ .(D r + b1 ) (excluded) there are only letters from 1 + A′ + A + b1 + b′1 + g active and g onl...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	56,700	21	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5047:59400:22	nd the first step is in 1 .(A′ + b′1)+ .(A + b1)+ . Next, we notice that since from a step 2 .(D′ rb′1 )+ .(Drb1 )+ ⇒ 2 .(D′ rb′1 )+ .(Dr b1 ) .A (included) to a step 1 .(A′ + b′1 )+ .(A + b1 )+ ⇒ 1 .(A′ + b′1 )+ .(A + b1 )+ .(D r + b1 ) (excluded) there are only letters from 1 + A′ + A + b1 + b′1 + g active and g onl...	ä′ ¨1 , for ä′ ∈ Ä′ ∪ b¨′1 , ¨1 o1 , o1 ˙2 . We let the reader check that these rules ensure the satisfaction of (T1 -spec). def ... We further define T2 = (Ä ∪ Ä′ ∪ {b¨1 , b¨′1 , ¨1 }, {o1 , o2 }, A , o1 , o2 , P2 , g) with the fol- lowing set of rules: ... ... ... all g ai , for ai ∈ A , ... ... ... ... ... all ...	1001.5047	Toward a Compositional Theory of Leftist Grammars and Transformations	cs.FL	2,012	59,400	22	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5275:0:0	Title: An Agent-Based Modeling for Pandemic Influenza in Egypt Abstract: Pandemic influenza has great potential to cause large and rapid increases in deaths and serious illness. The objective of this paper is to develop an agent-based model to simulate the spread of pandemic influenza (novel H1N1) in Egypt. The propos...	creates the entire populations and their dynamics measure the effectiveness of different control strategies to through incorporating social structures, heterogeneous intervene the pandemic spread. connectivity patterns, and meta-population grouping at the scale of the single individual [3]. Keywords In this paper we pr...	1001.5275	An Agent-Based Modeling for Pandemic Influenza in Egypt	cs.MA cs.CY	2,010	0	0	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5275:2700:1	creates the entire populations and their dynamics measure the effectiveness of different control strategies to through incorporating social structures, heterogeneous intervene the pandemic spread. connectivity patterns, and meta-population grouping at the scale of the single individual [3]. Keywords In this paper we pr...	es spread has resulted in several attempts However, mathematical models had not taken into account to model and predict the pattern of many different spatial and temporal factors such as variable population communicable diseases through a population [5]. The structure, and dynamics of daily individuals' interactions ea...	1001.5275	An Agent-Based Modeling for Pandemic Influenza in Egypt	cs.MA cs.CY	2,010	2,700	1	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1
1001.5275:5400:2	es spread has resulted in several attempts However, mathematical models had not taken into account to model and predict the pattern of many different spatial and temporal factors such as variable population communicable diseases through a population [5]. The structure, and dynamics of daily individuals' interactions ea...	ge extra tracking of the N = S (t ) + I (t ) + R(t ) (1) effect of the social interactions of individual entities [1]. Upon contact with an infected a susceptible individual Agent-based model consists of a population of agents, an environment, and set of rules managing agents' behavior contracts the disease with probab...	1001.5275	An Agent-Based Modeling for Pandemic Influenza in Egypt	cs.MA cs.CY	2,010	5,400	2	3,000	300	/arxiv/huggingface/paper_text_1m_dedup_v1

End of preview. Expand in Data Studio

No dataset card yet

Downloads last month: 33