New pages
Jump to navigation
Jump to search
18 August 2025
- 08:1608:16, 18 August 2025 数据科学基础 (Fall 2025) (hist | edit) [11,451 bytes] Liumingmou (talk | contribs) (Created page with "{{Infobox |name = Infobox |bodystyle = |title = <font size=3>'''数据科学基础'''<br> Foundations of Data Science |titlestyle = |image = |imagestyle = |caption = |captionstyle = |headerstyle = background:#ccf; |labelstyle = background:#ddf; |datastyle = |header1 =Instructor |label1 = |data1 = |header2 = |label2 = |data5 = '''刘明谋''' |header6 = |label6 = Email |data6 = lmm@nju.edu.cn |header7 = |label...")
18 July 2025
- 20:5120:51, 18 July 2025 高级算法 (Spring 2025)/大作业 (hist | edit) [2,233 bytes] Liumingmou (talk | contribs) (Created page with "至多四人一组，从以下论文中选择一篇，撰写一篇 review，中英文不限。你需要尽可能详细地解释：该论文解决了什么问题，该问题为什么重要（或者提出了什么技术，该技术为什么重要），该问题有什么相关研究（包括该论文提到的，和没提到的，以及在该论文发表之后的新的相关研究），为了解决该问题该论文提出了什么技术，该技术背后的直觉是什么，...")
19 June 2025
- 10:1310:13, 19 June 2025 组合数学 (Spring 2025)/第四次作业提交名单 (hist | edit) [1,410 bytes] Gispzjz (talk | contribs) (Created page with "如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 211220166 || 王诚昊 |- | 211830008 || 缪天顺 |- | 221180133 || 黄可唯 |- | 221220002 || 沈均文 |- | 221220022 || 颜树 |- | 221220029 || 陈俊翰 |- | 221220034 || 王旭 |- | 221220095 || 曾凡俊 |- | 221220104 || 刘宇平 |- | 221220111 || 于源智 |- | 221220123 || 董立伟 |- | 221240035 || 李想 |- | 221240073 || 李恒济 |- | 221300016 ||...")
6 June 2025
- 02:3102:31, 6 June 2025 组合数学 (Fall 2025)/Matching theory (hist | edit) [34,076 bytes] Etone (talk | contribs) (Created page with "== Systems of Distinct Representatives (SDR)== A '''system of distinct representatives (SDR)''' (also called a '''transversal''') for a sequence of (not necessarily distinct) sets <math>S_1,S_2,\ldots,S_m</math> is a sequence of <font color=red>''distinct''</font> elements <math>x_1,x_2,\ldots,x_m</math> such that <math>x_i\in S_i</math> for all <math>i=1,2,\ldots,m</math>. === Hall's marriage theorem === If the sets <math>S_1,S_2,\ldots,S_m</math> have a system of dist...")
5 June 2025
- 07:5007:50, 5 June 2025 高级算法 (Spring 2025)/作业二 (hist | edit) [4,884 bytes] Liumingmou (talk | contribs) (Created page with "*每道题目的解答都要有完整的解题过程，中英文不限。 *我们推荐大家使用LaTeX, markdown等对作业进行排版。 *没有条件的同学可以用纸笔完成作业之后拍照。 # 课程中介绍的 tabulation hashing 被称为 simple tabulation hashing。 tabulation hashing 还有不少别的扩展和强化。尝试调查并介绍其中一些，并尝试解释该 tabulation hashing 克服了其他 tabulation hashing 的什么问题，尝试...")
4 June 2025
- 06:0906:09, 4 June 2025 计算方法Numerical method (Spring 2025)/Homework7 提交名单 (hist | edit) [1,291 bytes] Houzhe (talk | contribs) (Created page with " 如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 221220090 || 周思桥 |- | 221240002 || 季悦宁 |- | 221240040 || 郑雯琪 |- | 231098068 || 戎昱 |- | 231098091 || 刘棣文 |- | 231098166 || 陈展 |- | 231200035 || 葛翰飞 |- | 231220006 || 陆华均 |- | 231220036 || 周楚函 |- | 231220065 || 劳汉显 |- | 231220071 || 吴江涛 |- | 231220122 || 安琦煜 |- | 231220166 || 苏易 |- | 231220171 ||...")
- 04:5404:54, 4 June 2025 组合数学 (Spring 2025)/Problem Set 4 (hist | edit) [2,371 bytes] Gispzjz (talk | contribs) (Created page with "== Problem 1 == Recall that the smallest number <math>R(k,\ell)</math> satisfying the condition in the Ramsey theory is called the '''Ramsey number'''. Prove that: * <math>R(4,3)\leq 9</math>. (Hint: Proof by contradiction. Color the edges of <math>K_9</math> in red and blue, and assume that there are no red triangles and no blue <math>4</math>-cliques. Try to determine the number of red and blue edges adjacent to each vertex.) * <math>R(4,4)\leq 18</math>. ==Problem 2...")
3 June 2025
- 11:4711:47, 3 June 2025 组合数学 (Spring 2025)/第三次作业提交名单 (hist | edit) [1,520 bytes] Gispzjz (talk | contribs) (Created page with "如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 211220166 || 王诚昊 |- | 211830008 || 缪天顺 |- | 221180133 || 黄可唯 |- | 221220002 || 沈均文 |- | 221220022 || 颜树 |- | 221220029 || 陈俊翰 |- | 221220034 || 王旭 |- | 221220052 || 周宇轩 |- | 221220095 || 曾凡俊 |- | 221220104 || 刘宇平 |- | 221220109 || 肖琰 |- | 221220111 || 于源智 |- | 221220123 || 董立伟 |- | 221240035 ||...")
- 11:4111:41, 3 June 2025 组合数学 (Spring 2025)/第二次作业提交名单 (hist | edit) [1,520 bytes] Gispzjz (talk | contribs) (Created page with "如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 211220166 || 王诚昊 |- | 211830008 || 缪天顺 |- | 221180133 || 黄可唯 |- | 221220002 || 沈均文 |- | 221220022 || 颜树 |- | 221220029 || 陈俊翰 |- | 221220034 || 王旭 |- | 221220052 || 周宇轩 |- | 221220095 || 曾凡俊 |- | 221220109 || 肖琰 |- | 221220111 || 于源智 |- | 221220123 || 董立伟 |- | 221240035 || 李想 |- | 221240065 || 何...")
25 May 2025
- 11:1911:19, 25 May 2025 组合数学 (Fall 2025)/Ramsey theory (hist | edit) [26,029 bytes] Etone (talk | contribs) (Created page with "== Ramsey's Theorem == === Ramsey's theorem for graph === {{Theorem|Ramsey's Theorem| :Let <math>k,\ell</math> be positive integers. Then there exists an integer <math>R(k,\ell)</math> satisfying: :If <math>n\ge R(k,\ell)</math>, for any coloring of edges of <math>K_n</math> with two colors red and blue, there exists a red <math>K_k</math> or a blue <math>K_\ell</math>. }} {{Proof| We show that <math>R(k,\ell)</math> is finite by induction on <math>k+\ell</math>. For the...")
- 11:1811:18, 25 May 2025 组合数学 (Fall 2025)/Extremal set theory (hist | edit) [51,460 bytes] Etone (talk | contribs) (Created page with "== Sunflowers == An set system is a '''sunflower''' if all its member sets intersect at the same set of elements. {{Theorem|Definition (sunflower)| : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size <math>r</math> with a '''core''' <math>C\subseteq X</math> if ::<math>\forall S,T\in\mathcal{F}</math> that <math>S\neq T</math>, <math>S\cap T=C</math>. }} Note that we do not require the core to be nonempty, thus a family of disjoint sets is...")
21 May 2025
- 07:2107:21, 21 May 2025 计算方法Numerical method (Spring 2025)/Homework6 提交名单 (hist | edit) [1,323 bytes] Kvrmnks (talk | contribs) (Created page with " 如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 221220090 || 周思桥 |- | 221240002 || 季悦宁 |- | 221240040 || 郑雯琪 |- | 231098068 || 戎昱 |- | 231098091 || 刘棣文 |- | 231098166 || 陈展 |- | 231200035 || 葛翰飞 |- | 231220036 || 周楚函 |- | 231220065 || 劳汉显 |- | 231220067 || 黄裕书琪 |- | 231220071 || 吴江涛 |- | 231220122 || 安琦煜 |- | 231220166 || 苏易 |- | 231220171 |...")
18 May 2025
- 08:4108:41, 18 May 2025 概率论与数理统计 (Spring 2025)/第四次作业提交名单 (hist | edit) [1,367 bytes] Zouzongrui (talk | contribs) (Created page with " 如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 231240009 || 陈心怡 |- | 231240055 || 魏全烨 |- | 231240005 || 王甚易 |- | 231840058 || 王润希 |- | 231200035 || 葛翰飞 |- | 231840166 || 赵少凡 |- | 231240056 || 靳濡搏 |- | 231880394 || 翟笑晨 |- | 231098046 || 李方泽 |- | 231840242 || 李昊凌 |- | 231240018 || 渠翔凯 |- | 231240015 || 邱文宣 |- | 231220001 || 陈梓睿 |- | 23123...")
12 May 2025
- 01:2701:27, 12 May 2025 概率论与数理统计 (Spring 2025)/Bounded Difference Method (hist | edit) [11,832 bytes] Liuexp (talk | contribs) (Created page with "==The Bounded Difference Method== Combining Azuma's inequality with the construction of Doob martingales, we have the powerful ''Bounded Difference Method'' for concentration of measures. We start by recalling the Azuma's inequality. {{Theorem |Azuma's Inequality (general version)| :Let <math>Y_0,Y_1,\ldots</math> be a martingale with respect to the sequence <math>X_0,X_1,\ldots</math> such that, for all <math>k\ge 1</math>, ::<math> |Y_{k}-Y_{k-1}|\le c_k, </math> :Then...")
8 May 2025
- 07:4407:44, 8 May 2025 计算理论之美 (Summer 2025) (hist | edit) [6,167 bytes] Hlx (talk | contribs) (Created page with "{{Infobox |name = Infobox |headerstyle = background:#4D72BE; |labelstyle = background:#DAE1F0; |header1 = <font size=3, color=white>计算理论之美</font> |label2 = {{Nowrap|负责人}} |data2 = 黄棱潇 ([mailto:huanglingxiao@nju.edu.cn huanglingxiao@nju.edu.cn]) |label4 = 时间 |data4 = 2025.6.30 — 2024.7.3 |label5 = 地点 |data5 = {{Nowrap|南京大学仙林校区计算机系楼111报告厅}} |belowstyle = background:#DAE1F0; |below = }}...")
7 May 2025
- 06:3906:39, 7 May 2025 计算方法Numerical method (Spring 2025)/Homework5 提交名单 (hist | edit) [1,352 bytes] Houzhe (talk | contribs) (Created page with " 如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 221220090 || 周思桥 |- | 221240002 || 季悦宁 |- | 221240040 || 郑雯琪 |- | 231098068 || 戎昱 |- | 231098091 || 刘棣文 |- | 231098166 || 陈展 |- | 231200035 || 葛翰飞 |- | 231220036 || 周楚函 |- | 231220065 || 劳汉显 |- | 231220067 || 黄裕书琪 |- | 231220071 || 吴江涛 |- | 231220122 || 安琦煜 |- | 231220166 || 苏易 |- | 231220171 |...")
- 06:3806:38, 7 May 2025 计算方法 Numerical method (Spring 2025)/Homework5 提交名单 (hist | edit) [1,352 bytes] Houzhe (talk | contribs) (Created page with " 如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 221220090 || 周思桥 |- | 221240002 || 季悦宁 |- | 221240040 || 郑雯琪 |- | 231098068 || 戎昱 |- | 231098091 || 刘棣文 |- | 231098166 || 陈展 |- | 231200035 || 葛翰飞 |- | 231220036 || 周楚函 |- | 231220065 || 劳汉显 |- | 231220067 || 黄裕书琪 |- | 231220071 || 吴江涛 |- | 231220122 || 安琦煜 |- | 231220166 || 苏易 |- | 231220171 |...")
6 May 2025
- 16:0116:01, 6 May 2025 组合数学 (Spring 2025)/Problem Set 3 (hist | edit) [2,840 bytes] Gispzjz (talk | contribs) (Created page with "probability and computing 6.17 (page 166) extremal comb 4.17 == Problem 1 == Use the Lovász Local Lemma to show that, if <math> 4\binom{k}{2}\binom{n}{k-2}2^{1-\binom{k}{2}} \leq 1 </math>, then it is possible to color the edges of <math>K_n</math> with two colors so that it has no monochromatic <math>K_k</math> subgraph. == Problem 2 == Let <math>G = (V, E)</math> be an undirected graph and suppose each <math>v \in V</math> is associated with a set <math>S(v)</math...")
27 April 2025
- 12:5312:53, 27 April 2025 概率论与数理统计 (Spring 2025)/Problem Set 4 (hist | edit) [11,916 bytes] Zouzongrui (talk | contribs) (Created page with "*每道题目的解答都要有完整的解题过程，中英文不限。 *我们推荐大家使用LaTeX, markdown等对作业进行排版。 *Bonus problem为附加题（选做）。 == Assumption throughout Problem Set 4== <p>Without further notice, we are working on probability space <math>(\Omega,\mathcal{F},\mathbf{Pr})</math>.</p> <p>Without further notice, we assume that the expectation of random variables are well-defined.</p> <p>The term <math>\log</math> u...")
23 April 2025
- 02:0202:02, 23 April 2025 计算方法 Numerical method (Spring 2025)/Homework4 提交名单 (hist | edit) [1,381 bytes] Kvrmnks (talk | contribs) (Created page with " 如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 221220090 || 周思桥 |- | 221240040 || 郑雯琪 |- | 231098068 || 戎昱 |- | 231098091 || 刘棣文 |- | 231098166 || 陈展 |- | 231200035 || 葛翰飞 |- | 231220006 || 陆华均 |- | 231220036 || 周楚函 |- | 231220065 || 劳汉显 |- | 231220067 || 黄裕书琪 |- | 231220071 || 吴江涛 |- | 231220122 || 安琦煜 |- | 231220166 || 苏易 |- | 231220171 |...")
21 April 2025
- 11:5111:51, 21 April 2025 高级算法 (Spring 2025)/作业一 (hist | edit) [1,672 bytes] Liumingmou (talk | contribs) (Created page with "*每道题目的解答都要有完整的解题过程，中英文不限。 *我们推荐大家使用LaTeX, markdown等对作业进行排版。 *没有条件的同学可以用纸笔完成作业之后拍照。 # 解释 Morris’ counter 背后的直觉。尝试应用 <math>(1+\alpha)^{-X}</math> 的思路得到更好的结果。 # 尝试把 median-trick 用到 FM 算法上，并分析你的算法的正确性和复杂度。 # 尝试分析 HyperLogLog 的正确性。 # 尝...")
- 08:0208:02, 21 April 2025 组合数学 (Fall 2025)/Extremal graph theory (hist | edit) [18,939 bytes] Etone (talk | contribs) (Created page with "== Forbidden Cliques == Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" === Mantel's theorem === We consider a typical extremal problem for graphs: the largest possible number of edges of '''triangle-free''' graphs, i.e. graphs contains no <math>K_3</math>. {{Theorem|Theorem (Mantel 1907)| :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <m...")
- 06:1306:13, 21 April 2025 概率论与数理统计 (Spring 2025)/第三次作业提交名单 (hist | edit) [1,339 bytes] Zouzongrui (talk | contribs) (Created page with " 如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 231240038 || 肖金宇 |- | 231240002 || 余孟凡 |- | 231200035 || 葛翰飞 |- | 231880394 || 翟笑晨 |- | 231240055 || 魏全烨 |- | 231880320 || 尹铁越 |- | 231880123 || 陆博文 |- | 231840166 || 赵少凡 |- | 231840242 || 李昊凌 |- | 231098046 || 李方泽 |- | 231840058 || 王润希 |- | 231240021 || 陈奕帆 |- | 231240018 || 渠翔凯 |- | 23124...")