id stringlengths 40 40 | title stringlengths 15 120 | text stringlengths 41 3.14k | source stringclasses 2
values |
|---|---|---|---|
9ebc91de356b8deeaecea727e713f60f4fa27776 | alemaz teshale samuel (also known as alemaz samuel | alemaz teshale samuel (also known as alemaz samuel or almaz samuel; born 5 july 1999) is an ethiopian middle-distance runner. she was the 2018 world junior champion in the women's 1500 metres. | wikipedia |
406636fd47583ea400d75a28ff1019f2ddd5add9 | beatriz leonor silveira barbuy is a brazilian astrophysicist. | beatriz leonor silveira barbuy is a brazilian astrophysicist. she was described in 2009 by Época magazine as one of the 100 most influential brazilians. she is a professor at the instituto de astronomia, geofísica e ciências atmosféricas (iag) at the university of são paulo, vice-president of the international astronom... | wikipedia |
de926b4cb5e81b755c22da35f10cd380acdbef11 | in 2009, she was one of five winners | in 2009, she was one of five winners of the l'oréal-unesco awards for women in science, awarded for her work in physics on 5 march at a ceremony at unesco headquarters in paris. she subsequently returned to brazil to take up the post of professor at the university of são paulo. | wikipedia |
e59b70f5e90145d0abedd7911e2cabfaa9615842 | between 2001 and 2005, she played an important | between 2001 and 2005, she played an important role in the international program on the formation of the first stars, led by the european southern observatory (eso). this program obtained detailed information about the chemical composition of stars formed more than 10 billion years ago. she was elected president of the... | wikipedia |
6146fe2249bf24227b904298a38ebe3160fb3fe2 | in 1978, barbuy moved to france and began | in 1978, barbuy moved to france and began her doctoral research in roger cayrel 's group at the paris observatory. her thesis focused on the elements carbon, nitrogen and oxygen in stars with ages between zero and 12 billion years, in research which allowed reconstruction of the evolution of the quantities of these ele... | wikipedia |
4f0949f097f9164ad630a29d9b36e33489119b7a | barbuy completed undergraduate and master's degrees at the | barbuy completed undergraduate and master's degrees at the university of são paulo in the early 1970s. when she considered writing a thesis in astrophysics at the time of the brazilian military government in the 1970s, it was not possible to do it in brazil: classmates and faculty at the university of são paulo were be... | wikipedia |
406636fd47583ea400d75a28ff1019f2ddd5add9 | beatriz leonor silveira barbuy is a brazilian astrophysicist. | beatriz leonor silveira barbuy is a brazilian astrophysicist. she was described in 2009 by Época magazine as one of the 100 most influential brazilians. she is a professor at the instituto de astronomia, geofísica e ciências atmosféricas (iag) at the university of são paulo, vice-president of the international astronom... | wikipedia |
924aa1fd2cbe85d35c54b00618ff3d55492b920b | mumbai city began the season on 5 october | mumbai city began the season on 5 october 2015 against pune city, with the opening game of their league campaign. for 2nd season, nicolas anelka was announced as the marquee player as well as the manager of the club, replacing englishman peter reid. mumbai city finished their season at 6th position in isl 2015. | wikipedia |
80f2c2897eb758c932372789642a5ed5a946b36a | the 2015 season is mumbai city 's 2nd | the 2015 season is mumbai city 's 2nd season in existence in the indian super league.mumbai city began the season on 5 october 2015 against pune city, with the opening game of their league campaign. for 2nd season, nicolas anelka was announced as the marquee player as well as the manager of the club, replacing englishm... | wikipedia |
5c82bd827372d934da71933dc8172af75cb37afb | preußen münster also takes part in the 2012–13 | preußen münster also takes part in the 2012–13 edition of the westphalia cup, having reached the second round against dsc wanne-eickel after a 5–0 win over tus hiltrup in the first round. in the round of 16, they defeated fc brünninghausen with 8–0 and progressed to the quarter-final where they won against sportfreunde... | wikipedia |
fb3cfaef56a12d27ba3c6c1d4e20fdb5160255c3 | the club also took part in the 2012–13 | the club also took part in the 2012–13 edition of the dfb-pokal, the german cup, where it reached the second round and will face bundesliga side fc augsburg next. the club had knocked out bundesliga club werder bremen in the first round with a 4–2 victory. | wikipedia |
bd85f9e2bdded74278d135cafcc1bebc7e921330 | andrey rzhetsky is the edna k. papazian professor | andrey rzhetsky is the edna k. papazian professor of medicine and professor of human genetics at the university of chicago, where he is also co-chief of the section of computational biomedicine and biomedical data science. born in kazakhstan, rzhetsky was recruited to pennsylvania state university by masatoshi nei in 1... | wikipedia |
a0753fb70e92b0be72c5063433d01da8ea5d05d6 | andrey rzhetsky is the edna k. papazian professor | andrey rzhetsky is the edna k. papazian professor of medicine and professor of human genetics at the university of chicago, where he is also co-chief of the section of computational biomedicine and biomedical data science. born in kazakhstan, rzhetsky was recruited to pennsylvania state university (penn state) by masat... | wikipedia |
89ba95b93471c31e6e9c0fcb964ba35e91c90915 | in mathematical optimization, affine scaling is an algorithm | in mathematical optimization, affine scaling is an algorithm for solving linear programming problems. specifically, it is an interior point method, discovered by soviet mathematician i. i. dikin in 1967 and reinvented in the u.s. in the mid-1980s. | wikipedia |
85e4186bf3cd8858886584d465f915f373712254 | while easy to state, affine scaling was found | while easy to state, affine scaling was found hard to analyze. its convergence depends on the step size, β. for step sizes β ≤ 2 / 3, vanderbei's variant of affine scaling has been proven to converge, while for β > 0.995, an example problem is known that converges to a suboptimal value. other variants of the algorithm ... | wikipedia |
99d1e55da09d1f22cbf15bd334271473b54c1a64 | phase i, the initialization, solves an auxiliary problem | phase i, the initialization, solves an auxiliary problem with an additional variable u and uses the result to derive an initial point for the original problem. let x be an arbitrary, strictly positive point; it need not be feasible for the original problem. the infeasibility of x is measured by the vector | wikipedia |
4bfe4fb843270dde069d7ee1dfe8537f92082528 | formally, the iterative method at the heart of | formally, the iterative method at the heart of affine scaling takes as inputs a, b, c, an initial guess x > 0 that is strictly feasible (i.e., ax = b), a tolerance ε and a stepsize β. it then proceeds by iterating | wikipedia |
ed2a578fec0a42496bc327df8c4bbcdf592ef882 | these problems are solved using an iterative method, | these problems are solved using an iterative method, which conceptually proceeds by plotting a trajectory of points strictly inside the feasible region of a problem, computing projected gradient descent steps in a re-scaled version of the problem, then scaling the step back to the original problem. the scaling ensures ... | wikipedia |
e3c04e2aa8a1014b82364e6e098dedf1c1d20221 | several groups then independently came up with a | several groups then independently came up with a variant of karmarkar's algorithm. e. r. barnes at ibm, a team led by r. j. vanderbei at at&t, and several others replaced the projective transformations that karmarkar used by affine ones. after a few years, it was realized that the "new" affine scaling algorithms were i... | wikipedia |
bb5682adbdd0be3bda02a009325febd63a9508e3 | affine scaling has a history of multiple discovery. | affine scaling has a history of multiple discovery. it was first published by i. i. dikin at energy systems institute of russian academy of sciences (siberian energy institute, ussr academy of sc. at that time) in the 1967 doklady akademii nauk sssr, followed by a proof of its convergence in 1974. dikin's work went lar... | wikipedia |
89ba95b93471c31e6e9c0fcb964ba35e91c90915 | in mathematical optimization, affine scaling is an algorithm | in mathematical optimization, affine scaling is an algorithm for solving linear programming problems. specifically, it is an interior point method, discovered by soviet mathematician i. i. dikin in 1967 and reinvented in the u.s. in the mid-1980s. | wikipedia |
49a77900942a08ba228e9172ed03b20e3afe65b5 | william lloyd benson was a canadian professional ice | william lloyd benson was a canadian professional ice hockey centreman who played two nhl seasons with the new york americans, and brooklyn americans. he was born in winnipeg, manitoba. benson was the last surviving former player of the new york americans. | wikipedia |
c68a6342321726a9b53c2967096ec3f5c5cb51c3 | william lloyd benson (july 29, 1920 – february | william lloyd benson (july 29, 1920 – february 8, 2012) was a canadian professional ice hockey centreman who played two nhl seasons with the new york americans, and brooklyn americans. he was born in winnipeg, manitoba. | wikipedia |
4b24bb027b1dab50302123f910a643176e4e2f97 | aldehyde dehydrogenase 7 family, member a1, also known | aldehyde dehydrogenase 7 family, member a1, also known as aldh7a1 or antiquitin, is an enzyme that in humans is encoded by the aldh7a1 gene. the protein encoded by this gene is a member of subfamily 7 in the aldehyde dehydrogenase gene family. these enzymes are thought to play a major role in the detoxification of alde... | wikipedia |
03e119fb8cc60f073de375bda1de588d694873fc | mutations in this gene cause pyridoxine-dependent epilepsy, which | mutations in this gene cause pyridoxine-dependent epilepsy, which involves a combination of various seizure types that do not respond to standard anticonvulsants, but are treatable via administration of pyridoxine hydrochloride. these pyridoxine-dependent seizures have been linked to the failure to oxidize α-aasa in pa... | wikipedia |
e6cdd275f13a7831191028c7ee061407ea0bd765 | antiquitin function and subcellular localization are closely linked, | antiquitin function and subcellular localization are closely linked, as it functions in detoxification in the cytosol, lysine catabolism in the mitochondrion, and cell cycle progression in the nucleus. in particular, antiquitin localizes to the mitochondria in kidney and liver to contribute to the synthesis of betaine,... | wikipedia |
05b246b5bc7cbed79fd83037a4714e1e461b6baf | as a member of subfamily 7 of the | as a member of subfamily 7 of the aldehyde dehydrogenase gene family, antiquitin performs nad (p)+-dependent oxidation of aldehydes generated by alcohol metabolism, lipid peroxidation, and other cases of oxidative stress, to their corresponding carboxylic acids. in addition, antiquitin plays a role in protecting cells ... | wikipedia |
105bffdf06b84c858745ad903963147fe3a0cfaf | the protein encoded by this gene can localize | the protein encoded by this gene can localize to the cytosol, mitochondria, or nucleus depending on the inclusion of certain localization sequences. the n-terminal mitochondrial targeting sequence is responsible for mitochondrial localization, while the nuclear localization signal and nuclear export signal are necessar... | wikipedia |
4b24bb027b1dab50302123f910a643176e4e2f97 | aldehyde dehydrogenase 7 family, member a1, also known | aldehyde dehydrogenase 7 family, member a1, also known as aldh7a1 or antiquitin, is an enzyme that in humans is encoded by the aldh7a1 gene. the protein encoded by this gene is a member of subfamily 7 in the aldehyde dehydrogenase gene family. these enzymes are thought to play a major role in the detoxification of alde... | wikipedia |
0cc93e2551c01bf92147bd3370046f800299a70e | the 2019 season was djurgårdens if's 119th in | the 2019 season was djurgårdens if's 119th in existence, their 64th season in allsvenskan and their 19th consecutive season in the league. they competed in allsvenskan and the 2018–19 and 2019–20 editions of the svenska cupen. djurgården secured their 12th league title, and the first in 14 years, with a 2–2 draw away a... | wikipedia |
6bb3605a68f694a18523257baf4e823e60abdd0d | djurgården secured their 12th league title, and the | djurgården secured their 12th league title, and the first in 14 years, with a 2–2 draw away at ifk norrköping in the last league game of the season after being down 0–2 at half-time, in a league battle that also featured malmö ff and hammarby if all the way to the final day. | wikipedia |
be536aa1de288269ec677449a4f709a6f2e943af | the 2019 season was djurgårdens if's 119th in | the 2019 season was djurgårdens if's 119th in existence, their 64th season in allsvenskan and their 19th consecutive season in the league. they competed in allsvenskan and the 2018–19 and 2019–20 editions of the svenska cupen. | wikipedia |
ef5615be521c4b955c542963de823a2e6166ec5a | bayesian model reduction is a method for computing | bayesian model reduction is a method for computing the evidence and posterior over the parameters of bayesian models that differ in their priors. a full model is fitted to data using standard approaches. hypotheses are then tested by defining one or more 'reduced' models with alternative priors, which usually – in the ... | wikipedia |
1473c6cbe3af213ac25e340a18aa8e3bf1862039 | bayesian model reduction has been used to explain | bayesian model reduction has been used to explain functions of the brain. by analogy to its use in eliminating redundant parameters from models of experimental data, it has been proposed that the brain eliminates redundant parameters of internal models of the world while offline (e.g. during sleep). | wikipedia |
52ea50e84f6848eb23b500793092b8222d4bc52d | bayesian model reduction was subsequently generalised and applied | bayesian model reduction was subsequently generalised and applied to other forms of bayesian models, for example parametric empirical bayes (peb) models of group effects. here, it is used to compute the evidence and parameters for any given level of a hierarchical model under constraints (empirical priors) imposed by t... | wikipedia |
b43b5f3316382813e6be176c57fc47ce2ca083a0 | bayesian model reduction was initially developed for use | bayesian model reduction was initially developed for use in neuroimaging analysis, in the context of modelling brain connectivity, as part of the dynamic causal modelling framework (where it was originally referred to as post-hoc bayesian model selection). dynamic causal models (dcms) are differential equation models o... | wikipedia |
f173b373e79016d0d7799e115623841de83899c7 | the larger this ratio, the greater the evidence | the larger this ratio, the greater the evidence for the full model, which included the parameter as a free parameter. conversely, the stronger the evidence for the reduced model, the more confident we can be that the parameter did not contribute. note this method is not specific to comparing 'switched on' or 'switched ... | wikipedia |
e602fb57630ccf1c51a3d67e8b69fc5bebb516f1 | to assess whether the parameter contributed to the | to assess whether the parameter contributed to the model evidence, i.e. whether we learnt anything about this parameter, an alternative 'reduced' model is specified in which the parameter has a prior with a much smaller variance: e.g. p ~ 0 = n (0, 0.001 2) {\displaystyle {\tilde {p}}_{0}=n(0,0.001^{2})}. this is illus... | wikipedia |
323c8c1146395b01ee8f93f0514bde06492e619a | consider a model with a parameter θ {\displaystyle | consider a model with a parameter θ {\displaystyle \theta } and gaussian prior p (θ) = n (0, 0.5 2) {\displaystyle p(\theta)=n(0,0.5^{2})}, which is the normal distribution with mean zero and standard deviation 0.5 (illustrated in the figure, left). this prior says that without any data, the parameter is expected to ha... | wikipedia |
13b4887f05e5e18b80f046dbfd8a0c94ff3d5c9e | the free energy of the full model f | the free energy of the full model f {\displaystyle f} is an approximation (lower bound) on the log model evidence: f ≈ ln p (y) {\displaystyle f\approx \ln {p(y)}} that is optimised explicitly in variational bayes (or can be recovered from sampling approximations). the reduced model's free energy f ~ {\displaystyle {\t... | wikipedia |
6d2d49fa29a55a9eef8b82698284d978da9ca45c | where the tilde symbol (~) indicates quantities relating | where the tilde symbol (~) indicates quantities relating to the reduced model and subscript zero – such as μ 0 {\displaystyle \mu _{0}} – indicates parameters of the priors. for convenience we also define precision matrices, which are the inverse of each covariance matrix: | wikipedia |
bdb6568c5164c4436976d295830aea5e51cef377 | the objective of bayesian model reduction is to | the objective of bayesian model reduction is to compute the posterior p ~ (θ ∣ y) {\displaystyle {\tilde {p}}(\theta \mid y)} and evidence p ~ (y) {\displaystyle {\tilde {p}}(y)} of the reduced model from the posterior p (θ ∣ y) {\displaystyle p(\theta \mid y)} and evidence p (y) {\displaystyle p(y)} of the full model.... | wikipedia |
6a64df65367bdb0ece9ffa632b66ba510d70ee2d | the second line of equation 1 is the | the second line of equation 1 is the model evidence, which is the probability of observing the data given the model. in practice, the posterior cannot usually be computed analytically due to the difficulty in computing the integral over the parameters. therefore, the posteriors are estimated using approaches such as mc... | wikipedia |
8922b86392c7b1ba3ee9f9d2f7a6756f2692738d | consider some model with parameters θ {\displaystyle \theta | consider some model with parameters θ {\displaystyle \theta } and a prior probability density on those parameters p (θ) {\displaystyle p(\theta)}. the posterior belief about θ {\displaystyle \theta } after seeing the data p (θ ∣ y) {\displaystyle p(\theta \mid y)} is given by bayes rule: | wikipedia |
2689fafe039ffcc0cb105a3e787c0b3addddb2f2 | bayesian model reduction is a method for computing | bayesian model reduction is a method for computing the evidence and posterior over the parameters of bayesian models that differ in their priors. a full model is fitted to data using standard approaches. hypotheses are then tested by defining one or more 'reduced' models with alternative (and usually more restrictive) ... | wikipedia |
73a54f4e99189c4880aa44286ebe0ac7b82c3ef1 | the 2019 bill beaumont county championship division 2 | the 2019 bill beaumont county championship division 2 was the 18th version of the competition that is part of the annual english rugby union county championship organised by the rfu for the tier 2 english counties. each county drew its players from rugby union clubs from the third tier and below of the english rugby un... | wikipedia |
5fb0f32b820551749583e76c17caa731756d774d | promotion and relegation occurs every two seasons, with | promotion and relegation occurs every two seasons, with accumulated points taken into consideration. at the end of the 2017–18 season, durham (north) and hampshire (south) were promoted to division 1, replacing east midlands (north) and surrey (south) who dropped down into division 2. cumbria and north midlands were re... | wikipedia |
23d0f43b703ad403f5d0263556be2559bfac908c | the competition format is two regional group stages | the competition format is two regional group stages divided into north and south with four teams in each group. this means that two teams in the pool had two home games, while the other two had just one. the rfu have taken fixtures from the previous year into account so that county sides that only played one home game ... | wikipedia |
89f13879fec9c26df88a56189c56199bf09987c7 | at the end of the group stage, leicestershire | at the end of the group stage, leicestershire were dominant in pool 1, winning all three games (albeit one which was a walkover), including an impressive win against a strong east midlands side, while surrey were equally impressive in topping pool 2, also winning three out of three. in the final, leicestershire finishe... | wikipedia |
518a3d9c9d013f26e10c1164bdd3d8e00140dab5 | the 2019 bill beaumont county championship division 2 | the 2019 bill beaumont county championship division 2 was the 18th version of the competition that is part of the annual english rugby union county championship organised by the rfu for the tier 2 english counties. each county drew its players from rugby union clubs from the third tier and below of the english rugby un... | wikipedia |
842f6f2629715f6760d4e8aae69afe909db2b517 | in theoretical computer science, the algorithmic lovász local | in theoretical computer science, the algorithmic lovász local lemma gives an algorithmic way of constructing objects that obey a system of constraints with limited dependence. given a finite set of bad events {a1, ..., an} in a probability space with limited dependence amongst the ais and with specific bounds on their ... | wikipedia |
814fa796c1c12388cbf3d9904150c8fd1a34b9d6 | the algorithm described above lends itself well to | the algorithm described above lends itself well to parallelization, since resampling two independent events a, b ∈ a {\displaystyle a,b\in {\mathcal {a}}}, i.e. vbl (a) ∩ vbl (b) = ∅ {\displaystyle \operatorname {vbl} (a)\cap \operatorname {vbl} (b)=\emptyset }, in parallel is equivalent to resampling a, b sequentially... | wikipedia |
0bc484311d24f7547a66a5652347bac4b72e154b | the algorithm is similar to walksat which is | the algorithm is similar to walksat which is used to solve general boolean satisfiability problems. the main difference is that in walksat, after the unsatisfied clause c is selected, a single variable in c is selected at random and has its value flipped (which can be viewed as selecting uniformly among only k {\displa... | wikipedia |
c971423f3a5df6271eec596f5a5947e8cbc7fe1f | it starts with a random truth value assignment | it starts with a random truth value assignment to the variables x,..., x sampled uniformly at random. while there exists a clause in Φ that is unsatisfied, it randomly picks an unsatisfied clause c in Φ and assigns a new truth value to all variables that appear in c chosen uniformly at random. once all clauses in Φ are... | wikipedia |
c745e8822539e3f2d8a3d4d026f94e29063a8c0d | now, define a bad event a for each | now, define a bad event a for each clause in Φ, where a is the event that clause j in Φ is unsatisfied by the current assignment. since each clause contains k literals (and therefore k variables) and since all variables are sampled uniformly at random, we can bound the probability of each bad event by | wikipedia |
60c6e4390da2cad8d57e38708c9eb26c0029116a | firstly, we truncate each clause in Φ to | firstly, we truncate each clause in Φ to contain exactly k literals. since each clause is a disjunction, this does not harm satisfiability, for if we can find a satisfying assignment for the truncated formula, it can easily be extended to a satisfying assignment for the original formula by reinserting the truncated lit... | wikipedia |
deeb49f1fb4782c3ed2eefd256663a0edc0b4423 | this statement can be proven easily using the | this statement can be proven easily using the symmetric version of the algorithmic lovász local lemma. let x,..., x be the set of mutually independent random variables p {\displaystyle {\mathcal {p}}} which are sampled uniformly at random. | wikipedia |
c452cab13bfd31e98beccaa250a35f2c34203d4e | let Φ be a cnf formula over variables | let Φ be a cnf formula over variables x,..., x, containing n clauses, and with at least k literals in each clause, and with each variable x appearing in at most 2 k k e {\displaystyle {\frac {2^{k}}{ke}}} clauses. then, Φ is satisfiable. | wikipedia |
e83a5f1070e5b86a26d7aab6e2135fa0ab989907 | moreover, the randomized algorithm described above resamples an | moreover, the randomized algorithm described above resamples an event a ∈ a {\displaystyle a\in {\mathcal {a}}} at most an expected 1 d {\displaystyle {\frac {1}{d}}} times before it finds such an evaluation. thus the expected total number of resampling steps and therefore the expected runtime of the algorithm is at mo... | wikipedia |
d2c1b7d3c95783bb746390113e4d56eb54162e7e | let p {\displaystyle {\mathcal {p}}} be a finite | let p {\displaystyle {\mathcal {p}}} be a finite set of mutually independent random variables and a {\displaystyle {\mathcal {a}}} be a finite set of events determined by these variables as before. if the above three conditions hold then there exists an assignment of values to the variables p {\displaystyle {\mathcal {... | wikipedia |
41e0a8778ba5f61908db4c53f66c3a3fddc21d91 | let p {\displaystyle {\mathcal {p}}} be a finite | let p {\displaystyle {\mathcal {p}}} be a finite set of mutually independent random variables in the probability space Ω. let a {\displaystyle {\mathcal {a}}} be a finite set of events determined by these variables. if there exists an assignment of reals x: a → (0, 1) {\displaystyle x:{\mathcal {a}}\to (0,1)} to the ev... | wikipedia |
332239fd84c06c6ba42a39444f0fa4d5df8b4493 | the algorithm then enters the main loop which | the algorithm then enters the main loop which is executed until all events in a {\displaystyle {\mathcal {a}}} are avoided, at which point the algorithm returns the current assignment. at each iteration of the main loop, the algorithm picks an arbitrary satisfied event a (either randomly or deterministically) and resam... | wikipedia |
3267d4a8eed26e1bf3e7bfda655376058faf82b1 | in the first step, the algorithm randomly initializes | in the first step, the algorithm randomly initializes the current assignment v for each random variable p ∈ p {\displaystyle p\in {\mathcal {p}}}. this means that an assignment v is sampled randomly and independently according to the distribution of the random variable p. | wikipedia |
f76d1074cbd08c58e7062c3f4b03bc7121c09424 | if the event a is true under an | if the event a is true under an evaluation (v p) p {\displaystyle (v_{p})_{\mathcal {p}}}, we say that (v p) p {\displaystyle (v_{p})_{\mathcal {p}}} satisfies a, otherwise it avoids a. | wikipedia |
69f13b4f654f76ab9dbbdb7e7281419be85efae2 | for any random variable p ∈ p, v | for any random variable p ∈ p, v p {\displaystyle p\in {\mathcal {p}},v_{p}} denotes the current assignment (evaluation) of p. an assignment (evaluation) to all random variables is denoted (v p) p {\displaystyle (v_{p})_{\mathcal {p}}}. | wikipedia |
4b3b90a56b85ef9c8782535c3a27b687c7b2620a | this bound is known to be tight. since | this bound is known to be tight. since the initial algorithm, work has been done to push algorithmic versions of the local lemma closer to this tight value. moser and tardos's recent work are the most recent in this chain, and provide an algorithm that achieves this tight bound. | wikipedia |
9016aff0b2c86d2c85a153897cd0f6f50d61165d | prior to the recent work of moser and | prior to the recent work of moser and tardos, earlier work had also made progress in developing algorithmic versions of the lovász local lemma. józsef beck in 1991 first gave proof that an algorithmic version was possible. in this breakthrough result, a stricter requirement was imposed upon the problem formulation than... | wikipedia |
565775594dafcd55953bde2ed8e4b3af203fc381 | under the assumption that all of the events | under the assumption that all of the events in a {\displaystyle {\mathcal {a}}} are determined by a finite collection of mutually independent random variables p {\displaystyle {\mathcal {p}}} in Ω, robin moser and gábor tardos proposed an efficient randomized algorithm that computes an assignment to the random variable... | wikipedia |
50d58e9ad58b96e4e017d24bcb621387dbb8dd3f | the lovász local lemma is non-constructive because it | the lovász local lemma is non-constructive because it only allows us to conclude the existence of structural properties or complex objects but does not indicate how these can be found or constructed efficiently in practice. note that random sampling from the probability space Ω is likely to be inefficient, since the pr... | wikipedia |
60f008bba5ae0a2b5df5030f4ba0908d2b837d9d | let a = { a 1, …, a | let a = { a 1, …, a n } {\displaystyle {\mathcal {a}}=\{a_{1},\ldots,a_{n}\}} be a finite set of events in the probability space Ω. for a ∈ a {\displaystyle a\in {\mathcal {a}}} let Γ (a) {\displaystyle \gamma (a)} denote a subset of a {\displaystyle {\mathcal {a}}} such that a {\displaystyle a} is independent from the... | wikipedia |
edda00cbf133a54591f526eaa231bd103b462da6 | the lovász local lemma is a powerful tool | the lovász local lemma is a powerful tool commonly used in the probabilistic method to prove the existence of certain complex mathematical objects with a set of prescribed features. a typical proof proceeds by operating on the complex object in a random manner and uses the lovász local lemma to bound the probability th... | wikipedia |
7f84159883682a473ae4b5365ffe2eb578941a74 | if the events { a,..., a } are | if the events { a,..., a } are determined by a finite collection of mutually independent random variables, a simple las vegas algorithm with expected polynomial runtime proposed by robin moser and gábor tardos can compute an assignment to the random variables such that all events are avoided. | wikipedia |
39c0260e34192753f8c87ecdb7b81ef0af06daa9 | given a finite set of bad events { | given a finite set of bad events { a,..., a } in a probability space with limited dependence amongst the a s and with specific bounds on their respective probabilities, the lovász local lemma proves that with non-zero probability all of these events can be avoided. however, the lemma is non-constructive in that it does... | wikipedia |
91f2bed8c3b00839916cfbbec4ee70dcab0f2f75 | the 2013 county championship plate, also known as | the 2013 county championship plate, also known as bill beaumont cup division 2, was the 12th version of the annual english rugby union, county championship organized by the rfu for the tier 2 english counties. each county drew its players from rugby union clubs from the third tier and below of the english rugby union l... | wikipedia |
a07d90a122e72afd9b1845ce18339f847d105ec3 | the competition format involved six teams divided into | the competition format involved six teams divided into two regional group stages of three teams each, divided into north and south, with each team playing each other once. the top side in each group went through to the final held at twickenham stadium on 26 may 2013. | wikipedia |
367be09b1946cad784f62eafb00806bf2a67c0e8 | both northumberland and north midlands would make an | both northumberland and north midlands would make an instant return to the 2014 bill beaumont cup as they won their respective pools, with north midlands having a more difficult time of it as they were run close by somerset. in the final at twickenham, northumberland proved to be a class apart, scoring six tries as the... | wikipedia |
5b17c49f341d9d0a2399b2666d19840bd679b72e | the 2013 county championship plate, also known as | the 2013 county championship plate, also known as bill beaumont cup division 2, was the 12th version of the annual english rugby union, county championship organized by the rfu for the tier 2 english counties. each county drew its players from rugby union clubs from the third tier and below of the english rugby union l... | wikipedia |
b4b57a3c8da0134ebbae98db3e6b014733d61e0e | the 2016–17 olympique lyonnais féminin season was the | the 2016–17 olympique lyonnais féminin season was the club's thirteenth season since fc lyon joined ol as its women's section. like the previous season, the team won all three competitions: the division 1 féminine, the coupe de france féminine and notably its fourth uefa women's champions league after it defeated paris... | wikipedia |
cf9e36997cf6eef5cc5f3164d592692063b2dec7 | on may 8, lyon sealed its 11th national | on may 8, lyon sealed its 11th national championship in a row with two games remaining, in a 9–0 win over soyaux. finally the team faced a triple showdown against paris saint-germain with two titles in dispute as well as psg's qualification for the next champions league as montpellier took the second place. after a 3–0... | wikipedia |
cee4a913eae795987e5dfbc0d1d49edd0f35c3ae | in the winter transfer window, lyon made three | in the winter transfer window, lyon made three signings. alex morgan was recruited on loan from nwsl's orlando pride, kadeisha buchanan arrived straight from college soccer, and josephine henning subsequently joined the team. lyon won all its first games in 2017, expanding its lead to a 6-point margin, before facing wo... | wikipedia |
bb0e349d78c896d9993da5d4b0ffb60511e22bb5 | from september to november, lyon won all first | from september to november, lyon won all first eight league games and first two champions league rounds against newcomer avaldsnes and zürich by wide scorelines. following a 2–1 win over 3rd place montpellier, lyon ended the year a 1–0 loss in its first game against paris saint-germain, which took the lead in the table... | wikipedia |
1d071744c4b9bb6b66a8a37f0faffec9ea889da7 | lyon had won in the 2015–16 season its | lyon had won in the 2015–16 season its second triple crown, including its fourth uefa women's champions league along with its fifth national double in a row. before the end of the season amandine henry had moved to the nwsl, while subsequently louisa necib retired and lotta schelin returned to the damallsvenskan. lyon ... | wikipedia |
b4b57a3c8da0134ebbae98db3e6b014733d61e0e | the 2016–17 olympique lyonnais féminin season was the | the 2016–17 olympique lyonnais féminin season was the club's thirteenth season since fc lyon joined ol as its women's section. like the previous season, the team won all three competitions: the division 1 féminine, the coupe de france féminine and notably its fourth uefa women's champions league after it defeated paris... | wikipedia |
5991c30e74333a55ff8f330aa82527af8c0eeffb | andreas j. heinrich is a physicist working with | andreas j. heinrich is a physicist working with scanning tunneling microscopy, quantum technology, nanoscience, spin excitation spectroscopy, and precise atom manipulation. he worked for ibm research in almaden for 18 years, during which time he developed nanosecond scanning tunneling microscopy which provided an impro... | wikipedia |
b0b70564332cc3bbfb9d5c5b336b615377935202 | he moved to south korea to become a | he moved to south korea to become a distinguished professor at ewha womans university and director of the institute for basic science center for quantum nanoscience in 2016. one of the long-term goals for the center is to fully control the quantum states of molecules and atoms on clean surfaces and near interfaces whic... | wikipedia |
91dac6b5a2687642e349639864623b9dc3411b0d | while exploring the limits of data storage, his | while exploring the limits of data storage, his team made a boy and his atom; the world's smallest stop-motion film as recognized by the guinness book of world records. their research showed that data storage could shrink from a standard of one million atoms, down to twelve. less than five years later, the team heinric... | wikipedia |
68857bf0ea9db7697cbb591e3be51034eeea3246 | desiring to leave göttingen and with a goal | desiring to leave göttingen and with a goal to work in ibm's almaden research center, he received a scholarship from the alexander von humboldt foundation to finance his move. the german magazine stern categorized heinrich's move overseas as part of germany's " brain drain ". after working in ibm almaden for several ye... | wikipedia |
67b0f41f14204dd33e9c2cbce78abbf6ced23c9f | he received his masters (diplom) and phd in | he received his masters (diplom) and phd in physics in 1994 and 1998, respectively, from the university of göttingen, germany. he was a research assistant from 1994 to 1998 under supervision of r. g. ulbrich. after obtaining a phd, he was a postdoc at ibm almaden with kavli prize laureate don eigler until 2001, in whic... | wikipedia |
120db83796f2ef91aebb5eb57240865e223d2060 | in 2016, he became a distinguished professor at | in 2016, he became a distinguished professor at ewha womans university in seoul, republic of korea and the founding director of the institute for basic science (ibs) center for quantum nanoscience. groundbreaking for the research center's research cooperation building occurred in 2018 and it was opened in 2019 during t... | wikipedia |
561771df93e40901a083aa2bea244b95e2382cf8 | andreas j. heinrich is a physicist working with | andreas j. heinrich is a physicist working with scanning tunneling microscopy, quantum technology, nanoscience, spin excitation spectroscopy, and precise atom manipulation. he worked for ibm research in almaden for 18 years, during which time he developed nanosecond scanning tunneling microscopy which provided an impro... | wikipedia |
09d748ea2f3bb0012e39b97255dda04e3cfffa5e | 2010 gb174 is a detached object, discovered on | 2010 gb174 is a detached object, discovered on 12 april 2010 on data taken at the canada france hawaii telescope as part of the next generation virgo cluster survey. it never gets closer than 48.5 au from the sun. its large eccentricity strongly suggests that it was gravitationally scattered onto its current orbit. it ... | wikipedia |
75cfe3499706251bd7eb240218708acad69d4164 | 2010 gb is a detached object, discovered on | 2010 gb is a detached object, discovered on 12 april 2010 on data taken at the canada france hawaii telescope as part of the next generation virgo cluster survey. it never gets closer than 48.5 au from the sun (about the outer edge of the kuiper belt). its large eccentricity strongly suggests that it was gravitationall... | wikipedia |
e8a27107d03424065e541d73366593fb79379961 | 7553 buie, provisional designation 1981 fg, is a | 7553 buie, provisional designation 1981 fg, is a nysa asteroid from the inner regions of the asteroid belt, approximately 3.5 kilometers in diameter. it was discovered on 30 march 1981, by american astronomer edward bowell at lowell's anderson mesa station near flagstaff, arizona. the stony s-type asteroid has a rotati... | wikipedia |
c02bd40d17d31b9442ef16cb66f25cec88bff8f9 | according to the survey carried out by the | according to the survey carried out by the neowise mission of nasa's wide-field infrared survey explorer, buie measures 3.4 kilometers in diameter and its surface has an albedo of 0.259, while the collaborative asteroid lightcurve link assumes a standard albedo for stony asteroids of 0.20 and calculates a diameter of 3... | wikipedia |
257d25853cf9e2c0c151462f759dc84353d9430e | in september 2012, a rotational lightcurve of buie | in september 2012, a rotational lightcurve of buie was obtained from photometric observations made at the palomar transient factory, california. in the r-band, it gave a rotation period of 4.2418 ± 0.0071 hours with a brightness variation of 0.51 magnitude, while in the sg-band the period was 4.2453 ± 0. hours with an ... | wikipedia |
0ebfb165f6da0390fba91ec659f332b1ed5a521c | this minor planet was named in honor of | this minor planet was named in honor of american marc william buie (born 1958), an astronomer at the discovering lowell observatory and a prolific discoverer of minor planets including several trans-neptunian objects. his contributions to planetary astronomy also include research on the moons of pluto and the developme... | wikipedia |
2502c129afc2c23582e67d5b72939e56a464fe03 | it orbits the sun in the inner main-belt | it orbits the sun in the inner main-belt at a distance of 2.0–2.7 au once every 3 years and 8 months (1,351 days; semi-major axis of 2.39 au). its orbit has an eccentricity of 0.15 and an inclination of 3 ° with respect to the ecliptic. a first precovery was taken at the palomar observatory in december 1950, extending ... | wikipedia |
fc8fb89856dc2700583f779c16a1360a64c65c2a | buie is a core member of the nysa | buie is a core member of the nysa family (405), also known as the herta family, located within the nysa–polana complex. it is one of the largest asteroid families of the asteroid belt and named after 44 nysa. | wikipedia |
a1e0b250c382e88f383d4054aa51d5f33ed61159 | 7553 buie (/ ˈ b uː iː /), | 7553 buie (/ ˈ b uː iː /), provisional designation 1981 fg, is a nysa asteroid from the inner regions of the asteroid belt, approximately 3.5 kilometers (2.2 miles) in diameter. it was discovered on 30 march 1981, by american astronomer edward bowell at lowell's anderson mesa station near flagstaff, arizona. the stony ... | wikipedia |
eba435dccbb768ed21888bd8401e4e6b07ca3901 | biomolecular engineering is the application of engineering principles | biomolecular engineering is the application of engineering principles and practices to the purposeful manipulation of molecules of biological origin. biomolecular engineers integrate knowledge of biological processes with the core knowledge of chemical engineering in order to focus on molecular level solutions to issue... | wikipedia |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.