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
f10f3fa8d2201cc76feec2bc28166bb8cd9e7101	frank "pud" glass (february 10, 1884 – march	frank "pud" glass (february 10, 1884 – march 2, 1965) was a scottish - canadian professional ice hockey player who played in various professional and amateur leagues, including the national hockey association and eastern canada amateur hockey association. he was a member of the montreal wanderers ' stanley cup champion...	wikipedia
824ba453510340315973649c94ac63932d6e6096	fumigaclavine a dimethylallyltransferase is an enzyme with systematic	fumigaclavine a dimethylallyltransferase is an enzyme with systematic name dimethylallyl-diphosphate:fumigaclavine a dimethylallyltransferase. this enzyme catalyses the following chemical reaction fumigaclavine c is an ergot alkaloid produced by some fungi of the trichocomaceae family.	wikipedia
80d336fc5a033dda6748f41255123181cf2427cb	fumigaclavine a dimethylallyltransferase (ec 2.5.1.100, fgapt1) is an	fumigaclavine a dimethylallyltransferase (ec 2.5.1.100, fgapt1) is an enzyme with systematic name dimethylallyl-diphosphate:fumigaclavine a dimethylallyltransferase. this enzyme catalyses the following chemical reaction	wikipedia
e3f3e58d4798a68aabb407cf13f215800f560dc2	john edward convey was a canadian ice hockey	john edward convey was a canadian ice hockey left winger. he played in the nhl for the new york americans between 1931 and 1933. the rest of his career, which lasted from 1929 to 1941, was spent in various minor leagues. he was born in toronto, ontario.	wikipedia
37131f6151fd68c715688dad387f33856e406d78	john edward convey (december 16, 1909 – february	john edward convey (december 16, 1909 – february 22, 1969) was a canadian ice hockey left winger. he played in the nhl for the new york americans between 1931 and 1933. the rest of his career, which lasted from 1929 to 1941, was spent in various minor leagues. he was born in toronto, ontario.	wikipedia
5e4112d241ba9296a205b1181ce73cbf3eeb7e26	checking whether a pattern (or a transaction) supports	checking whether a pattern (or a transaction) supports a given subgraph is an np-complete problem, since it is an np-complete instance of the subgraph isomorphism problem. furthermore, due to combinatorial explosion, according to lei et al., "mining all frequent subtree patterns becomes infeasible for a large and dense...	wikipedia
ceb1d94179139de57ecee2eef2cf84ed0b35661a	domains in which frequent subtree mining is useful	domains in which frequent subtree mining is useful tend to involve complex relationships between data entities: for instance, the analysis of xml documents often requires frequent subtree mining. another domain where this is useful is the web usage mining problem: since the actions taken by users when visiting a web si...	wikipedia
e6c2534a48765886428a5282e0b6b746cdce69a2	treeminer performs depth first candidate generation using scope-list	treeminer performs depth first candidate generation using scope-list representation of sub-trees to facilitate faster support counting. a k-sub-tree s can be representation by a triplet (t,m,s) where t is the tree id the sub-tree comes from, m is the prefix match label, and s the scope of the last node in s. depending ...	wikipedia
401033143b746bf60a8466637bd3fd257621dbf7	frequent sub-tree patterns follow the anti-monotone property. in	frequent sub-tree patterns follow the anti-monotone property. in other words, the support of a k-sub-tree is less than or equal to the support of its (k-1)-sub-trees. only super patterns of known frequent patterns can possibly be frequent. by utilizing this property, k-sub-trees candidates can be generated based on fre...	wikipedia
bdb83cc7c35b8a33adf50c9b71d757ec339bb5f9	the scope of a node a is given	the scope of a node a is given by a pair of numbers {\displaystyle } where l and r are the minimum and maximum node index in the sub-tree rooted at a. in other words, l is the index of a, and r is the index of the rightmost leaf among the descendants of a. as such the index of any descendant of a must lie in the scope ...	wikipedia
77d4041827147dab4a013ae36c98e39ea56cf0b1	two k-sub-trees are said to be in the	two k-sub-trees are said to be in the same prefix equivalence class if the string representation of them are identical up to the (k-1)-th node. in other words, all elements in a prefix equivalence class only differ by the last node. for example, two trees with string representation a b -1 c -1 and a b -1 d -1 are in th...	wikipedia
d7b6ec22900b3e103094814ec405457a98ac01bd	there are several different ways of encoding a	there are several different ways of encoding a tree structure. treeminer uses string representations of trees for efficient tree manipulation and support counting. initially the string is set to ∅ {\displaystyle \varnothing }. starting from the root of the tree, node labels are added to the string in depth-first search...	wikipedia
2029c4f75bda9a05e5bcd4fe5b7e6650f2c46436	the support of a sub-tree is the number	the support of a sub-tree is the number of trees in a database that contains the sub-tree. a sub-tree is frequent if its support is not less than a user-specified threshold (often denoted as minsup). the goal of treeminer is to find all embedded sub-trees that have support at least the minimum support.	wikipedia
e94e7628b451c714bede6fd338601825749ecbe0	a sub-tree s = (v s, e s)	a sub-tree s = (v s, e s) {\displaystyle s=(v_{s},e_{s})} is an embedded sub-tree of t = (v, e) {\displaystyle t=(v,e)} if and only if v s ⊆ v {\displaystyle v_{s}\subseteq v} and two endpoint nodes of any edge in s are on the same path from the root to a leaf node in t. in other words, for any node a and b in s, if no...	wikipedia
ef94af720b43a244dd6bad33c91bf6ecb2b69192	a sub-tree s = (v s, e s)	a sub-tree s = (v s, e s) {\displaystyle s=(v_{s},e_{s})} is an induced sub-tree of t = (v, e) {\displaystyle t=(v,e)} if and only if v s ⊆ v {\displaystyle v_{s}\subseteq v} and e s ⊆ e {\displaystyle e_{s}\subseteq e}. in other words, any two nodes in s that are directly connected by an edge is also directly connecte...	wikipedia
68a357c166d39306d381e8f88e085cc5db298dbe	in 2002, mohammed j. zaki introduced treeminer, an	in 2002, mohammed j. zaki introduced treeminer, an efficient algorithm for solving the frequent subtree mining problem, which used a "scope list" to represent tree nodes and which was contrasted with patternmatcher, an algorithm based on pattern matching.	wikipedia
d6c2f1fdfc18dd6edc761c01ce2907db1608bb28	frequent subtree mining is the problem of trying	frequent subtree mining is the problem of trying to find all of the patterns whose "support" is over a certain user-specified level, where "support" is calculated as the number of trees in a database which have at least one subtree isomorphic to a given pattern.	wikipedia
a2cb821611c4da9221e979ca4f37ab82685a3fd3	in computer science, frequent subtree mining is the	in computer science, frequent subtree mining is the problem of finding all patterns in a given database whose support (a metric related to its number of occurrences in other subtrees) is over a given threshold. it is a more general form of the maximum agreement subtree problem.	wikipedia
e6f0837e52c7d29a47bb71d29445a41d60fe7bd0	in mathematics, harnack's inequality is an inequality relating	in mathematics, harnack's inequality is an inequality relating the values of a positive harmonic function at two points, introduced by a. harnack (1887). harnack's inequality is used to prove harnack's theorem about the convergence of sequences of harmonic functions. j. serrin (1955), and j. moser (1961, 1964) generali...	wikipedia
23abd4d2cee1c790a52edad4a024af57980e1ddb	let k {\displaystyle k} be compactly contained in	let k {\displaystyle k} be compactly contained in m {\displaystyle {\mathcal {m}}} and choose τ ∈ (0, t) {\displaystyle \tau \in (0,t)}. then there exists a constant c > 0 (depending only on k, τ {\displaystyle \tau }, t − τ {\displaystyle t-\tau }, and the coefficients of l {\displaystyle {\mathcal {l}}}) such that, f...	wikipedia
526b31248132015497cb67755b1712a837b03b67	with smooth and bounded coefficients and a positive	with smooth and bounded coefficients and a positive definite matrix (a i j) {\displaystyle (a_{ij})}. suppose that u (t, x) ∈ c 2 ((0, t) × m) {\displaystyle u(t,x)\in c^{2}((0,t)\times {\mathcal {m}})} is a solution of	wikipedia
23767507b597b9c7a4ce9bd43f4ef3c16787b32d	for every twice differentiable, harmonic and nonnegative function	for every twice differentiable, harmonic and nonnegative function u (x) {\displaystyle u(x)}. the constant c {\displaystyle c} is independent of u {\displaystyle u}; it depends only on the domains Ω {\displaystyle \omega } and ω {\displaystyle \omega }.	wikipedia
7f28eacf100466ee3db0f23b4a88939f40399bb2	for general domains Ω {\displaystyle \omega } in	for general domains Ω {\displaystyle \omega } in r n {\displaystyle \mathbf {r} ^{n}} the inequality can be stated as follows: if ω {\displaystyle \omega } is a bounded domain with ω ¯ ⊂ Ω {\displaystyle {\bar {\omega }}\subset \omega }, then there is a constant c {\displaystyle c} such that	wikipedia
a65c44972d201e57263e7093ca7b8afa9fc4504e	harnack's inequality applies to a non-negative function f	harnack's inequality applies to a non-negative function f defined on a closed ball in r with radius r and centre x. it states that, if f is continuous on the closed ball and harmonic on its interior, then for every point x with \| x − x \| = r < r,	wikipedia
68a78565c20719d6e41e3e4a326de7d44200ce9c	in mathematics, harnack's inequality is an inequality relating	in mathematics, harnack's inequality is an inequality relating the values of a positive harmonic function at two points, introduced by a. harnack (1887). harnack's inequality is used to prove harnack's theorem about the convergence of sequences of harmonic functions. j. serrin (1955), and j. moser (1961, 1964) generali...	wikipedia
5efa779b2470bc69ed9e4286c44ce6d02eff99eb	on april 3, 1911, jackson participated in a	on april 3, 1911, jackson participated in a conference at the hotel thorndike, in boston encouraging closer co-operation between electric vehicle manufacturers and central station managers in the boston area. the conference was organized by the boston edison company and jackson promised the support of the department of...	wikipedia
bb17e6abe3a9a4bc1765df21cd4be42b48128ee9	jackson headed the department of electrical engineering of	jackson headed the department of electrical engineering of the massachusetts institute of technology (mit) from 1907 to 1935. he was proponent of student and faculty involvement with industry. jackson established research as a part of engineering education at mit and coordinated it with practical experience in industri...	wikipedia
88fa22503169a82605328ed5063ff26ab9f54901	after two years teaching electrical engineering at cornell	after two years teaching electrical engineering at cornell university he moved to the university of wisconsin in 1891 as the first professor of electrical engineering, heading the department of electrical engineering. he specialized in alternating currents and associated machinery alongside technical issues involved in...	wikipedia
bdb6b480d6595c336f36d96855716eb5ec79e46a	dugald was born into a quaker family in	dugald was born into a quaker family in kennett square, pennsylvania. his parents were josiah and mary price jackson. his younger brother, john price jackson, co-wrote some books with him and also had a career as an electrical engineer, academic, civil servant and soldier. he attended the hill school in pottstown befor...	wikipedia
f57589e75ff9af909eb282e17e64abf257bfe4d7	dugald caleb jackson (february 13, 1865 – july	dugald caleb jackson (february 13, 1865 – july 1, 1951) was an american electrical engineer. he received the ieee edison medal for "outstanding and inspiring leadership in engineering education and in the field of generation and distribution of electric power".	wikipedia
d67b044028284ce38e44866ac5a44335033109d8	it is unclear how influential branca’s work was.	it is unclear how influential branca’s work was. but it was known that robert hooke owned a copy of branca’s work. in 1789, giuseppe maria soli of modena republished branca's manual of architecture.	wikipedia
f7954574baa5277662f3efda6ccf968e68481698	branca communicated with benedetto castelli and references his	branca communicated with benedetto castelli and references his work in the last chapter of the manuale, a chapter about rivers. castelli, often considered to be the founder of the field of hydrodynamics, wrote to branca urging him to defend himself against naïve or interested parties such as the venetians who had rejec...	wikipedia
367690550f01acf6710ada7f48fbb47d15083bfe	branca's manuale d’architettura, published in 1629, was a	branca's manuale d’architettura, published in 1629, was a practical guide for planning and construction and is considered the first "pocket" architectural handbook. branca's experience as an architect was due to his posting as superintendent of works of the sacra casa in loreto, to which he was appointed by the duke of...	wikipedia
1ea923cfbc19104526a9daa7b41dfaff423c028a	branca's so-called steam engine appears as the 25th	branca's so-called steam engine appears as the 25th plate in le machine. it comprises a wheel with flat vanes like a paddlewheel, shown being rotated by steam produced in a closed vessel and directed at the vanes through a pipe (and hence would be more appropriately called a steam turbine). branca suggested that it mig...	wikipedia
e391661b9998e7a69b9a0f3a063bb4ffdf99ddb4	unlike earlier authors, branca did not claim to	unlike earlier authors, branca did not claim to be the creator of many of the machines and in one instance is even uncertain over how the machine in question is supposed to work. in the words of historian alex keller, his machines "look like armchair inventions which seldom ever had any three-dimensional working counte...	wikipedia
891802d4ac69dc44bb559b9bcd50b59006dfe500	branca designed many different mechanical inventions, a collection	branca designed many different mechanical inventions, a collection of which he dedicated to cenci, the governor of loreto, ancona. these were later published in book form at rome in 1629, under the title le machine. the work contains 63 engravings with descriptions in italian and latin and was an example of the theater...	wikipedia
f613ee82552becab05396f2c22220d7f728422dc	branca was born on 22 april 1571 in	branca was born on 22 april 1571 in sant'angelo in lizzola. from 1616 branca was employed at the sacra casa (virgin’s holy house) in loreto. he was made a citizen of rome in 1622. he died on 24 january 1645 in loreto.	wikipedia
a6c7724a0dc53e2f7e17b32edf6e90990396aff3	elizabeth cascio is an applied economist and currently	elizabeth cascio is an applied economist and currently a professor of economics who holds the dewalt h. 1921 and marie h. ankeny professorship in economic policy at dartmouth college. her research interests are in labor economics and public economics, and focus on the economic impact of policies affecting education in ...	wikipedia
0ab3a5e31c98eaecdf396d3a71f6fe06757dc4b3	the article “who needs a fracking education? the	the article “who needs a fracking education? the educational response to low-skill biased technological change” written by elizabeth u. cascio and ayushi narayan talks about the technological breakthrough of fracking. fracking is a technique used by many in the oil industry. the process requires you to insert a large t...	wikipedia
7485a3ef23767327bdb108d0e3fc9df763dbc920	in collaboration with economist diane whitmore schanzenbach, elizabeth	in collaboration with economist diane whitmore schanzenbach, elizabeth u.cascio writes a paper under the national bureau of economics about the “pre-school for all” initiative which would thereby increase the number of 4 year olds attending more pre-school. the increase of quality and participation in public pre-school...	wikipedia