Split (1)

train · 485k rows

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.

id stringlengths 40 40	title stringlengths 15 120	text stringlengths 41 3.14k	source stringclasses 2 values
55be7f5df0fed8cb36ed977b43fe356969b550a4	on 3 october 2019, fassnacht scored a late	on 3 october 2019, fassnacht scored a late goal deep into second-half stoppage time to give young boys a 2–1 home win over rangers in the europa league group stage. on 25 february 2021, he scored in young boys' 2–0 second-leg victory over bayer leverkusen in the europa league round of 32, securing passage into the roun...	wikipedia
f10a0996bda2373b5a1f31114ecc62b56bd65868	fassnacht was part of the young boys squad	fassnacht was part of the young boys squad that won the 2017–18 swiss super league, their first league title in 32 years. he played an important role for the club during the title winning season, scoring 11 league goals.	wikipedia
9b87bc5ea67d0156ca16c8b8f763441e18367f2d	gaëtan haas is a swiss professional ice hockey	gaëtan haas is a swiss professional ice hockey centre who currently serves as captain of ehc biel of the national league (nl). haas previously played in the national hockey league (nhl) with the edmonton oilers. he won one nl title with sc bern in 2019.	wikipedia
955885cbbfb27ffd6d069c21816eb963a6698107	undrafted, haas, in the following off-season, used his	undrafted, haas, in the following off-season, used his nhl out clause with sc bern to sign a one-year, entry-level contract with the edmonton oilers of the nhl on 1 july 2019. haas made the oilers' opening night roster, playing in his first nhl game on 3 october. he went on to score his first nhl goal on 5 november aga...	wikipedia
b47db0453c6416f2c75d035a3f75c2e5c5cefd56	in the midst of the 2016–17 season, his	in the midst of the 2016–17 season, his eighth professional season with ehc biel, on 10 november 2016, he agreed to a three-year contract with sc bern worth chf 1.2 million. the contract started from the 2017–18 season and ran through the 2019–20 season. in his first season with sc bern, haas drew attention from the ca...	wikipedia
d27c4abfc00a825f25ccb73760aa12f47eb36b97	gaëtan haas (born 31 january 1992) is a	gaëtan haas (born 31 january 1992) is a swiss professional ice hockey centre who currently serves as captain of ehc biel of the national league (nl). haas previously played in the national hockey league (nhl) with the edmonton oilers. he won one nl title with sc bern in 2019.	wikipedia
999874686478502f58205ccfea9b9c6ca10a7e44	the play-off round of the 2013–14 uefa europa	the play-off round of the 2013–14 uefa europa league was played from 22 to 29 august 2013, to decide 31 of the 48 places in the group stage. all times were cest (utc+2).	wikipedia
dd2eecc48a245f4e48f5dd5e8f4a7a9592157b9d	3–3 on aggregate. az won on away goals.	3–3 on aggregate. az won on away goals. the match was abandoned after 59 minutes due to a fire at the stadium, and was resumed on 30 august 2013, 11:00, from the point of abandonment.	wikipedia
b3c251e5887a420a08f46bd9f8807291a0d2ef3e	a total of 62 teams played in the	a total of 62 teams played in the play-off round: 18 teams which entered in this round, the 29 winners of the third qualifying round, and the 15 losers of the champions league third qualifying round. the draw was held on 9 august 2013.	wikipedia
42e23f9fbc0a59e6da24774963dd21af43a795e7	a total of 62 teams were involved in	a total of 62 teams were involved in the qualifying phase and play-off round (including 15 losers of the champions league third qualifying round which entered the play-off round). the 31 winners of the play-off round advanced to the group stage to join the 7 automatic qualifiers and 10 losers of the champions league pl...	wikipedia
3ffacde4c4edf57c99e78cd960d917c801b87945	teams were seeded based on their uefa club	teams were seeded based on their uefa club coefficients at the beginning of the season, with the teams divided into seeded and unseeded pots. a seeded team was drawn against an unseeded team, with the order of legs in each tie decided randomly. prior to the draws, uefa may form "groups" in accordance with the principle...	wikipedia
282e44bb1685cae65e38f114257c74958af9d6d9	in the play-off round, each tie was played	in the play-off round, each tie was played over two legs, with each team playing one leg at home. the team that scored more goals on aggregate over the two legs advanced to the next round. if the aggregate score was level, the away goals rule was applied, i.e., the team that scored more goals away from home over the tw...	wikipedia
cbee9f65a0165465b4ab6fbac8ea7c7f29070e84	in cryptography, rc2 (also known as arc2) is	in cryptography, rc2 (also known as arc2) is a symmetric-key block cipher designed by ron rivest in 1987. "rc" stands for "ron's code" or "rivest cipher"; other ciphers designed by rivest include rc4, rc5, and rc6. the development of rc2 was sponsored by lotus, who were seeking a custom cipher that, after evaluation by...	wikipedia
cc915d286fd74c8ea7660046b8f46c3e21f74799	rc2 is a 64-bit block cipher with a	rc2 is a 64-bit block cipher with a variable size key. its 18 rounds are arranged as a source-heavy unbalanced feistel network, with 16 rounds of one type (mixing) punctuated by two rounds of another type (mashing). a mixing round consists of four applications of the mix transformation, as shown in the diagram.	wikipedia
3ce546558e8748d848d1edfa05defb492f700ec5	initially, the details of the algorithm were kept	initially, the details of the algorithm were kept secret — proprietary to rsa security — but on 29 january 1996, source code for rc2 was anonymously posted to the internet on the usenet forum sci.crypt. mentions of codeview and softice (popular debuggers) suggest that it had been reverse engineered. a similar disclosur...	wikipedia
88e68fca3a114263b5e91b4d5aa11a4c2de755f6	the development of rc2 was sponsored by lotus,	the development of rc2 was sponsored by lotus, who were seeking a custom cipher that, after evaluation by the nsa, could be exported as part of their lotus notes software. the nsa suggested a few changes, which rivest incorporated. after further negotiations, the cipher was approved for export in 1989. along with rc4, ...	wikipedia
ccd120f2878e46b5d6d59f8b4f48d70a6d9ee6fe	in cryptography, rc2 (also known as arc2) is	in cryptography, rc2 (also known as arc2) is a symmetric-key block cipher designed by ron rivest in 1987. "rc" stands for "ron's code" or "rivest cipher"; other ciphers designed by rivest include rc4, rc5, and rc6.	wikipedia
69f1c02d3f6094fef3da51d6b01ae8b0c7cf65db	he joined czech club bohemians 1905 in 2014,	he joined czech club bohemians 1905 in 2014, becoming their first colombian player. he scored his first league goal for bohemians in august 2014, striking in a 3–2 away win against příbram.	wikipedia
c1f80cefa46c23f1253bfee8ed702f372645364e	he arrived in spain in 2007, initially on	he arrived in spain in 2007, initially on mallorca. mosquera played in the copa del rey for alcoyano against real madrid in 2012, although his team lost 4–1. he played for cd olímpic de xàtiva in the 2013–14 season.	wikipedia
c2d8b6a31044e3a546ec8a189890f379180afaa7	upgma is a simple agglomerative (bottom-up) hierarchical clustering	upgma is a simple agglomerative (bottom-up) hierarchical clustering method. it also has a weighted variant, wpgma, and they are generally attributed to sokal and michener. note that the unweighted term indicates that all distances contribute equally to each average that is computed and does not refer to the math by whi...	wikipedia
97058e90dfbf50692d585ea8627bc25f584ee778	a trivial implementation of the algorithm to construct	a trivial implementation of the algorithm to construct the upgma tree has o (n 3) {\displaystyle o(n^{3})} time complexity, and using a heap for each cluster to keep its distances from other cluster reduces its time to o (n 2 log n) {\displaystyle o(n^{2}\log n)}. fionn murtagh presented an o (n 2) {\displaystyle o(n^{...	wikipedia
4f98cf4ee6e252f38cf66d79ebf62e4066073fa6	alternative linkage schemes include single linkage clustering, complete	alternative linkage schemes include single linkage clustering, complete linkage clustering, and wpgma average linkage clustering. implementing a different linkage is simply a matter of using a different formula to calculate inter-cluster distances during the distance matrix update steps of the above algorithm. complete...	wikipedia
000b5e8222b2e1d8132f1e247ae0f5ffd8377b27	δ (a, r) = δ (b, r) =	δ (a, r) = δ (b, r) = δ (e, r) = δ (c, r) = δ (d, r) = 16.5 {\displaystyle \delta (a,r)=\delta (b,r)=\delta (e,r)=\delta (c,r)=\delta (d,r)=16.5}	wikipedia
04d3d1fc1045e2e91d5008fcb70846a24504bf0e	δ (w, r) = δ ((c, d), r)	δ (w, r) = δ ((c, d), r) − δ (c, w) = 16.5 − 14 = 2.5 {\displaystyle \delta (w,r)=\delta ((c,d),r)-\delta (c,w)=16.5-14=2.5}	wikipedia
d6afc5a14ce901b2c33d273371c05f457fef6623	δ (v, r) = δ (((a, b), e),	δ (v, r) = δ (((a, b), e), r) − δ (e, v) = 16.5 − 11 = 5.5 {\displaystyle \delta (v,r)=\delta (((a,b),e),r)-\delta (e,v)=16.5-11=5.5}	wikipedia
1a1d8eaeed37c92ad8551234e116427dc5dd69c3	δ (((a, b), e), r) = δ ((c,	δ (((a, b), e), r) = δ ((c, d), r) = 33 / 2 = 16.5 {\displaystyle \delta (((a,b),e),r)=\delta ((c,d),r)=33/2=16.5}	wikipedia
a842935b607e8de3818d5352bc45e1bea4252910	let r {\displaystyle r} denote the (root) node	let r {\displaystyle r} denote the (root) node to which ((a, b), e) {\displaystyle ((a,b),e)} and (c, d) {\displaystyle (c,d)} are now connected.the branches joining ((a, b), e) {\displaystyle ((a,b),e)} and (c, d) {\displaystyle (c,d)} to r {\displaystyle r} then have lengths:	wikipedia
0f36c05e9d4d033593f840d5085bc1c74154afa6	d 4 ((c, d), ((a, b), e)) =	d 4 ((c, d), ((a, b), e)) = (d 3 (c, ((a, b), e)) × 1 + d 3 (d, ((a, b), e)) × 1) / (1 + 1) = (30 × 1 + 36 × 1) / 2 = 33 {\displaystyle d_{4}((c,d),((a,b),e))=(d_{3}(c,((a,b),e))\times 1+d_{3}(d,((a,b),e))\times 1)/(1+1)=(30\times 1+36\times 1)/2=33}	wikipedia
bfefacbfa05f3964fda5af6562cea0453372eb90	let w {\displaystyle w} denote the node to	let w {\displaystyle w} denote the node to which c {\displaystyle c} and d {\displaystyle d} are now connected.the branches joining c {\displaystyle c} and d {\displaystyle d} to w {\displaystyle w} then have lengths δ (c, w) = δ (d, w) = 28 / 2 = 14 {\displaystyle \delta (c,w)=\delta (d,w)=28/2=14} (see the final dend...	wikipedia
21bdf5184e59a84997f9910db9b11d2c180428b7	here, d 3 (c, d) = 28 {\displaystyle	here, d 3 (c, d) = 28 {\displaystyle d_{3}(c,d)=28} is the smallest value of d 3 {\displaystyle d_{3}}, so we join elements c {\displaystyle c} and d {\displaystyle d}.	wikipedia
e81eb8f26ac4795761de015f28f3732345bb0a2f	proportional averaging therefore gives equal weight to the	proportional averaging therefore gives equal weight to the initial distances of matrix d 1 {\displaystyle d_{1}}. this is the reason why the method is unweighted, not with respect to the mathematical procedure but with respect to the initial distances.	wikipedia
b21be483b41060f2c39c015731c394d87a1249cf	d 3 (((a, b), e), d) = (d	d 3 (((a, b), e), d) = (d 2 ((a, b), d) × 2 + d 2 (e, d) × 1) / (2 + 1) = (32.5 × 2 + 43 × 1) / 3 = 36 {\displaystyle d_{3}(((a,b),e),d)=(d_{2}((a,b),d)\times 2+d_{2}(e,d)\times 1)/(2+1)=(32.5\times 2+43\times 1)/3=36}	wikipedia
f3e395017c4a3f93fc2dd4a6330d2a830b6f107c	thanks to this proportional average, the calculation of	thanks to this proportional average, the calculation of this new distance accounts for the larger size of the (a, b) {\displaystyle (a,b)} cluster (two elements) with respect to e {\displaystyle e} (one element). similarly:	wikipedia
4655380b2ab300b9b579d0b8096a845f5951c262	d 3 (((a, b), e), c) = (d	d 3 (((a, b), e), c) = (d 2 ((a, b), c) × 2 + d 2 (e, c) × 1) / (2 + 1) = (25.5 × 2 + 39 × 1) / 3 = 30 {\displaystyle d_{3}(((a,b),e),c)=(d_{2}((a,b),c)\times 2+d_{2}(e,c)\times 1)/(2+1)=(25.5\times 2+39\times 1)/3=30}	wikipedia
390cef3bbe7577f42b8e593bb66fbaf8520fcaee	we then proceed to update d 2 {\displaystyle	we then proceed to update d 2 {\displaystyle d_{2}} into a new distance matrix d 3 {\displaystyle d_{3}} (see below), reduced in size by one row and one column because of the clustering of (a, b) {\displaystyle (a,b)} with e {\displaystyle e}. bold values in d 3 {\displaystyle d_{3}} correspond to the new distances, ca...	wikipedia
c31082c80f1d76c10bd00767d9e2fb6d954cc079	we deduce the missing branch length: δ (u,	we deduce the missing branch length: δ (u, v) = δ (e, v) − δ (a, u) = δ (e, v) − δ (b, u) = 11 − 8.5 = 2.5 {\displaystyle \delta (u,v)=\delta (e,v)-\delta (a,u)=\delta (e,v)-\delta (b,u)=11-8.5=2.5} (see the final dendrogram)	wikipedia
63d33f9d46e4ab8d0193b45e10f0bcf3d177fd8c	let v {\displaystyle v} denote the node to	let v {\displaystyle v} denote the node to which (a, b) {\displaystyle (a,b)} and e {\displaystyle e} are now connected. because of the ultrametricity constraint, the branches joining a {\displaystyle a} or b {\displaystyle b} to v {\displaystyle v}, and e {\displaystyle e} to v {\displaystyle v} are equal and have the...	wikipedia
53a6a560d907d8260fd9885d78c17a63d8b50f1b	here, d 2 ((a, b), e) = 22	here, d 2 ((a, b), e) = 22 {\displaystyle d_{2}((a,b),e)=22} is the smallest value of d 2 {\displaystyle d_{2}}, so we join cluster (a, b) {\displaystyle (a,b)} and element e {\displaystyle e}.	wikipedia
4afa63c51f86c9868e874cfc815c57ecf8e6f276	d 2 ((a, b), e) = (d 1	d 2 ((a, b), e) = (d 1 (a, e) + d 1 (b, e)) / 2 = (23 + 21) / 2 = 22 {\displaystyle d_{2}((a,b),e)=(d_{1}(a,e)+d_{1}(b,e))/2=(23+21)/2=22}	wikipedia
e9211a3cb1c7717eebe8f4eb5814c645cb0e288f	d 2 ((a, b), d) = (d 1	d 2 ((a, b), d) = (d 1 (a, d) + d 1 (b, d)) / 2 = (31 + 34) / 2 = 32.5 {\displaystyle d_{2}((a,b),d)=(d_{1}(a,d)+d_{1}(b,d))/2=(31+34)/2=32.5}	wikipedia