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
6fb02bd743e66abd37807cd5a6ac9f217d070e8e	theorem: for any class of functions h {\displaystyle	theorem: for any class of functions h {\displaystyle h\,\!} and any dataset d ⊂ { 0, 1 } k {\displaystyle d\subset \{0,1\}^{k}\,\!} such that	wikipedia
9047ad0f3ad151b6a05fac97956180c4c3efd071	in this section we show that it is	in this section we show that it is possible to release a dataset which is useful for concepts from a polynomial vc-dimension class and at the same time adhere to ε {\displaystyle \varepsilon \,\!} -differential privacy as long as the size of the original dataset is at least polynomial on the vc-dimension of the concept...	wikipedia
dfa9eea4a454dfe19d08b3ef3f8cfc0f1d9addb2	informally, it means that with high probability the	informally, it means that with high probability the query q h {\displaystyle q_{h}\,\!} will behave in a similar way on the original dataset d {\displaystyle d\,\!} and on the synthetic dataset d ^ {\displaystyle {\widehat {d}}\,\!}. consider a common problem in data mining. assume there is a database d {\displaystyle ...	wikipedia
ee92f0ee6f6a56fc0dddf87f53ba1419b35f1e8c	definition (usefulness): a mechanism a {\displaystyle {\mathcal {a}}\,\!}	definition (usefulness): a mechanism a {\displaystyle {\mathcal {a}}\,\!} is (α, δ) {\displaystyle (\alpha,\delta)\,\!} -useful for queries in class h {\displaystyle h\,\!} with probability 1 − δ {\displaystyle 1-\delta \,\!}, if ∀ h ∈ h {\displaystyle \forall h\in h\,\!} and every dataset d {\displaystyle d\,\!}, for ...	wikipedia
7c8356f8168d36991629cd87076bfa32d00e687b	definition (global sensitivity): the global sensitivity of a	definition (global sensitivity): the global sensitivity of a query q {\displaystyle q\,\!} is its maximum difference when evaluated on two neighbouring datasets d 1, d 2 ∈ d n {\displaystyle d_{1},d_{2}\in {\mathcal {d}}^{n}\,\!}:	wikipedia
0fa64e61e18f75d123fc6f7b88c244653e5623bc	we can assume μ (a) {\displaystyle \mu (a)\,\!}	we can assume μ (a) {\displaystyle \mu (a)\,\!} for a ⊆ r {\displaystyle a\subseteq {\mathcal {r}}\,\!} to be less than or equal to one in all the computations, because we can always normalize with μ (r) {\displaystyle \mu ({\mathcal {r}})\,\!}.	wikipedia
316253183c074c7a2b2adc5d0d77b186b324bce0	proof: it follows from the previous lemma that	proof: it follows from the previous lemma that the probability of the score being at least o p t − 2 t {\displaystyle opt-2t\,\!} is 1 − exp (− ε t) / μ (s t) {\displaystyle 1-\exp(-\varepsilon t)/\mu (s_{t})\,\!}. by hypothesis, t ≥ ln (o p t t μ (s t)) / ε {\displaystyle t\geq \ln \left({\frac {opt}{t\mu (s_{t})}}\ri...	wikipedia
7bc268ce5de928cf3cec3963591a9444bc1b2ae7	theorem (accuracy): for those values of t ≥	theorem (accuracy): for those values of t ≥ ln (o p t t μ (s t)) / ε {\displaystyle t\geq \ln \left({\frac {opt}{t\mu (s_{t})}}\right)/\varepsilon \,\!}, we have e ≥ o p t − 3 t {\displaystyle e\geq opt-3t\,\!}.	wikipedia
8ca131b6b04d2e49c86d5569d870a4276d03eb92	proof: the probability p (s ¯ 2 t)	proof: the probability p (s ¯ 2 t) {\displaystyle p({\bar {s}}_{2t})\,\!} is at most p (s ¯ 2 t) / p (s t) {\displaystyle p({\bar {s}}_{2t})/p(s_{t})\,\!}, as the denominator can be at most one. since both the probabilities have the same normalizing term so,	wikipedia
c09eb43474a041dc29310aa7aca23036ac90eebf	lemma: let s t = { r: q	lemma: let s t = { r: q (d, r) > o p t − t } {\displaystyle s_{t}=\{r:q(d,r)>opt-t\}\,\!} and s ¯ 2 t = { r: q (d, r) ≤ o p t − 2 t } {\displaystyle {\bar {s}}_{2t}=\{r:q(d,r)\leq opt-2t\}\,\!}, we have p (s ¯ 2 t) {\displaystyle p({\bar {s}}_{2t})\,\!} is at most exp (− ε t) / μ (s t) {\displaystyle \exp(-\varepsilon ...	wikipedia
2f240dde7679f1fb17fe257ca1cd55ce6be5e5f1	we would ideally want the random draws of	we would ideally want the random draws of r {\displaystyle r\,\!} from the mechanism e q ε (d) {\displaystyle {\mathcal {e}}_{q}^{\varepsilon }(d)\,\!} to nearly maximize q (d, r) {\displaystyle q(d,r)\,\!}. if we consider max r q (d, r) {\displaystyle \max _{r}q(d,r)\,\!} to be o p t {\displaystyle opt\,\!} then we ca...	wikipedia
0bf76cc2579dbf0cf8cae856ffe42a66701a8c35	now, if a single change in d {\displaystyle	now, if a single change in d {\displaystyle d\,\!} changes q {\displaystyle q\,\!} by at most Δ q {\displaystyle \delta q\,\!} then the numerator can change at most by a factor of e ε Δ q {\displaystyle e^{\varepsilon \delta q}\,\!} and the denominator minimum by a factor of e − ε Δ q {\displaystyle e^{-\varepsilon \de...	wikipedia
af69a74de0f6ccc044f9c4e6174b4d9410b65a05	theorem (differential privacy): e q ε (d) {\displaystyle	theorem (differential privacy): e q ε (d) {\displaystyle {\mathcal {e}}_{q}^{\varepsilon }(d)\,\!} gives (2 ε Δ q) {\displaystyle (2\varepsilon \delta q)\,\!} -differential privacy.	wikipedia
11b45d22d106c2cdacef6964d873d167bd499e5c	this definition implies the fact that the probability	this definition implies the fact that the probability of returning an r {\displaystyle r\,\!} increases exponentially with the increase in the value of q (d, r) {\displaystyle q(d,r)\,\!}. ignoring the base measure μ {\displaystyle \mu \,\!} then the value r {\displaystyle r\,\!} which maximizes q (d, r) {\displaystyle...	wikipedia
17efceb9f201499a0b69eab0a565158034bc245f	in very generic terms, a privacy mechanism maps	in very generic terms, a privacy mechanism maps a set of n {\displaystyle n\,\!} inputs from domain d {\displaystyle {\mathcal {d}}\,\!} to a range r {\displaystyle {\mathcal {r}}\,\!}. the map may be randomized, in which case each element of the domain d {\displaystyle {\mathcal {d}}\,\!} corresponds to a probability ...	wikipedia
95a472c2eab58337d8256031711e6a8d278164fd	in very generic terms, a privacy mechanism maps	d, r) {\displaystyle q(d,r)\,\!} is approximately maximized. to achieve this, set up the mechanism e q ε (d) {\displaystyle {\mathcal {e}}_{q}^{\varepsilon }(d)\,\!} as follows: definition: for any function q: (d n × r) → r {\displaystyle q:({\mathcal {d}}^{n}\times {\mathcal {r}})\rightarrow \mathbb {r} \,\!}, and a b...	wikipedia
80a1cd7dfd4d45d8e16926a13d7c1fa1dcd54426	most of the initial research in the field	most of the initial research in the field of differential privacy revolved around real-valued functions which have relatively low sensitivity to change in the data of a single individual and whose usefulness is not hampered by small additive perturbations. a natural question is what happens in the situation when one wa...	wikipedia
2276fa34b034586a3c19970d03e0b3b1bfd885e9	the exponential mechanism is a technique for designing	the exponential mechanism is a technique for designing differentially private algorithms. it was developed by frank mcsherry and kunal talwar in 2007. their work was recognized as a co-winner of the 2009 pet award for outstanding research in privacy enhancing technologies.	wikipedia
8ef9e66b4a3090b5b1217db18b3f1d4dd004a7c1	ernest edward galpin (1858–1941), was a botanist and	ernest edward galpin (1858–1941), was a botanist and banker born in the cape colony. he left some 16,000 sheets to the national herbarium in pretoria and was dubbed "the prince of collectors" by general smuts. galpin discovered half a dozen genera and many hundreds of new species. numerous species are named after him s...	wikipedia
80136bef1e994fbfc4393bdd822be35830696647	he was a life member of the linnean	he was a life member of the linnean society and joined the s. afr. assoc. for the adv. of science a year after its founding. vol. 13 of flowering plants of south africa was dedicated to him, and the university of south africa conferred an honorary doctorate on him.	wikipedia
dabcf92739975928ff3b57f63ec206856ec7fbc5	in 1917 he retired to his farm mosdene	in 1917 he retired to his farm mosdene on the springbok flats near naboomspruit north of pretoria. here he became inspired to start collecting again. following the lead of dr. i.b. pole evans, he started an intensive botanical study of the countryside surrounding his farm. despite failing eyesight, he was taught to dri...	wikipedia
20a26fbe8f269f0611cc7f3cbef30bd1ecb71ee9	in 1907, in the company of prof. hhw	in 1907, in the company of prof. hhw pearson, he undertook a trip to south west africa to study welwitschia, making stops at port nolloth, lüderitz bay, swakopmund, welwitsch station and following the swakop river to haikamkab. in 1910 he and his wife departed lourenço marques for kenya and uganda, collecting in the ab...	wikipedia
f09dcd6d40a835a013344644d6c57049cdd84396	in 1892 galpin was transferred to queenstown, where	in 1892 galpin was transferred to queenstown, where he was to remain until his retirement in 1917. by now his herbarium specimens had grown to about 1500 in number. he made extensive collecting trips to mountains in the eastern cape, including great winterberg, katberg, stormberg and andriesberg. in 1904 his wife accom...	wikipedia
94229d5e488d8cfe7e60c3c4c966760ad0b17b4d	one of seven sons born in grahamstown to	one of seven sons born in grahamstown to henry carter galpin, watchmaker and jeweller, and georgina maria luck, ernest galpin started his education at the local st. andrew's college. due to his father's ill-health, ernest left school at 14 to assist with the business. a short spell of active service on the frontier fol...	wikipedia
8ef9e66b4a3090b5b1217db18b3f1d4dd004a7c1	ernest edward galpin (1858–1941), was a botanist and	ernest edward galpin (1858–1941), was a botanist and banker born in the cape colony. he left some 16,000 sheets to the national herbarium in pretoria and was dubbed "the prince of collectors" by general smuts. galpin discovered half a dozen genera and many hundreds of new species. numerous species are named after him s...	wikipedia
85845ba021e370072ffe1d2523545edbbdc02cfa	gabriel a. wainer is a canadian/argentinian computer scientist	gabriel a. wainer is a canadian/argentinian computer scientist known for his work in modeling and simulation. he is a professor in the department of systems and computer engineering at carleton university in ottawa, canada. he is the head of the advanced real-time simulation lab, located at carleton university's centre...	wikipedia
9d4c1b5ff6aae96fa771b9bbcc71e659cb3b5e8c	wainer is a fellow of the scs, society	wainer is a fellow of the scs, society for modeling and simulation international (2016) "for fundamental contributions to discrete-event simulation". he obtained many other awards for his research publications and service. he is one of the few recipients of the scs mcleod founder's award for distinguished service to th...	wikipedia
1dacc1786ab8258f2ff84dd589aee7757e6497bb	prof. wainer is a co-founder of modeling and	prof. wainer is a co-founder of modeling and simulation conferences: simutools, annsim (scs/ieee/acm), the symposium on theory of modeling and simulation (scs/acm/ieee), and symposium on simulation in architecture and urban design - simaud (scs/acm/ieee). he was vice-president conferences and vice-president publication...	wikipedia
25daa750517ed2f3e0621ad650156693c368ad89	he contributed to the field of modeling and	he contributed to the field of modeling and simulation (m&s), introducing cell-devs, a formalism to build discrete-event cellular models. the formalism and tools were used to define numerous models in different areas: environmental sciences, biomedical, pedestrian flow, systems engineering, architecture and constructio...	wikipedia
30253119f4ecdd9c85a3699599e555c5b0ea1bf5	around 1993 he built the first real-time version	around 1993 he built the first real-time version of an open-source operating system, namely (rt- minix). the kernel was extended to include real-time scheduling, schedulability analysis for predictability, semaphores with priority inversion mechanisms, real-time task fault-tolerant models, majority voting and a new os ...	wikipedia
66855f592ecff17a172a3ee8d52f5438ed0f16ab	in july 2000, he joined the department of	in july 2000, he joined the department of systems and computer engineering at carleton university (ottawa, canada). he held visiting positions at the university of arizona, lsis (cnrs), université paul cézanne, university of nice sophia-antipolis, inria sophia-antipolis, university of bordeaux, university of buenos air...	wikipedia
e619d99d025fb5cdd02675e78382613a124d71ba	wainer graduated in 1993 as a licenciado in	wainer graduated in 1993 as a licenciado in computer science from the university of buenos aires. he completed his ph.d. in software engineering in 1998 at aix-marseille university / university of buenos aires.	wikipedia
b69086d5f8c68b4023e63ff3b774ac4c865d3a22	he is the head of the advanced real-time	he is the head of the advanced real-time simulation lab, located at carleton university 's centre for advanced simulation and visualization (v-sim). he is known for his research in discrete-event simulation, in the cell-devs specification, a variant of discrete event system specification (devs).	wikipedia
2b4477459ea8eaedb6db9ace1f80a132ce5395ec	gabriel a. wainer (gabriel wainer) is a canadian/argentinian	gabriel a. wainer (gabriel wainer) is a canadian/argentinian computer scientist known for his work in modeling and simulation. he is a professor in the department of systems and computer engineering at carleton university in ottawa, canada.	wikipedia
a8dc229daf5ffbc693ebb99493ab71810d73b011	gülru necipoğlu is a turkish american professor of	gülru necipoğlu is a turkish american professor of islamic art/architecture. she has been the aga khan professor and director of the aga khan program for islamic architecture at harvard university since 1993, where she started teaching as assistant professor in 1987. she received her harvard ph.d. in the department of ...	wikipedia
b1fce38015830398f818728c15422abbf84eecc0	necipoğlu’s name was given to a new lecture	necipoğlu’s name was given to a new lecture hall of the art history department of akdeniz university, turkey in 2012. in 2014, she was mentioned among the 91 most influential women in the history of the turkish republic on its 91st anniversary celebration. she was invited by his highness the aga khan to serve as a memb...	wikipedia
7edfd0d0f5423bfe35a8089ddc763bd36bff1e42	most recently, necipoğlu co-edited with two major historians	most recently, necipoğlu co-edited with two major historians cemal kafadar and cornell fleischer, treasures of knowledge: an inventory of the ottoman palace library, 1502/3- 1503/4 (brill, 2019). this two-volume work focuses on a fascinating manuscript preserved in the library of the hungarian academy of sciences in bu...	wikipedia
7481822acebecec1c2fada76a34f6332d9754a51	necipoğlu co-edited with f. barry flood a companion	necipoğlu co-edited with f. barry flood a companion to islamic art and architecture, (wiley blackwell companions to art history, 2 vols., 2017). with over fifty commissioned essays, it has become an essential handbook for professors, students, and enthusiasts. the volumes are organized according to a new chronological-...	wikipedia
33bc3ff0156690985308f04389f20da1c401ed99	necipoğlu has been the editor of the journal	necipoğlu has been the editor of the journal muqarnas: an annual on the visual cultures of the islamic world since 1993, vols. 10-37 (brill), and its supplements. her edited books on diverse subjects include, histories of ornament: from global to local (princeton, 2016) co-edited with alina payne. this volume was haile...	wikipedia
9a61e28f0dacfe9bab6623d6f6080bc8b755f89c	necipoğlu’s 2005 book (reaktion, second edn. 2011), the	necipoğlu’s 2005 book (reaktion, second edn. 2011), the age of sinan: architectural culture in the ottoman empire received the albert hourani book award (honorable mention), and the fuat köprülü book prize of turkish studies association. its expanded turkish translation, sinan Çağı: osmanlı İmparatorluğu'nda mimari kül...	wikipedia