# New pages

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)

- 00:32, 14 November 2019 Assignment 4, Fall 2019 (hist) [2,363 bytes] Etone (talk | contribs) (Created page with "==Question1: A generalized E-P flux== 在第四章中，我们从准地转近似下的纬向平均风场、温度场的趋势方程出发，定义了E-P通量。但是该定...")
- 23:14, 13 November 2019 计算复杂性 (Fall 2019)/Assignment 6 (hist) [592 bytes] TCSseminar (talk | contribs) (Created page with "<br/> Chapter 7. <br/> Exercise 7.1, 7.3, 7.5, 7.6, 7.9. <font color=red><strong>文件名请使用自己的学号+姓名，学号放在最前面</strong></font> <br/> 请...")
- 09:32, 12 November 2019 高级算法 (Fall 2019)/Problem Set 3 (hist) [5,571 bytes] Etone (talk | contribs) (Created page with "'''Note: in this problem set, problem 1 and 2 are mandatory. For problem 3 to 5, you are only required to solve arbitrary two of them. (But you are also welcome to hand in sol...")
- 05:55, 12 November 2019 组合数学 (Fall 2019)/Extremal graph theory (hist) [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...")
- 19:54, 5 November 2019 计算复杂性 (Fall 2019)/作业5已提交名单 (hist) [441 bytes] TCSseminar (talk | contribs) (Created page with " {| class="wikitable" | 161140077 || 张昕渊 |}")
- 11:54, 3 November 2019 Namelist Assignment2 2019 (hist) [809 bytes] Etone (talk | contribs) (Created page with "学号 姓名 DZ1928004 刘尹成 MG1928002 陈旭 MG1928003 邓煜恒 MG1928005 龚丹毅 MG1928006 冀雅琴 MG1928007 康志杰 MG192...")
- 08:38, 31 October 2019 计算复杂性 (Fall 2019)/Assignment 5 (hist) [645 bytes] TCSseminar (talk | contribs) (Created page with "<br/> Chapter 6. <br/> Exercise 6.3, 6.4, 6.12, 6.14, 6.15. <font color=red><strong>文件名请使用自己的学号+姓名，学号放在最前面</strong></font> 请将...")
- 05:22, 29 October 2019 高级算法 (Fall 2019)/Greedy and Local Search (hist) [33,826 bytes] Etone (talk | contribs) (Created page with "= Set cover = Given <math>m</math> subsets <math>S_1,S_2,\ldots,S_m\subseteq U</math> of a universe <math>U</math> of size <math>n=|U|</math>, a <math>C\subseteq\{1,2,\ldots,m...")
- 01:40, 29 October 2019 组合数学 (Fall 2019)/Problem Set 3 (hist) [0 bytes] Haimin (talk | contribs) (Created page with "<font color="red" size=5>Under Construction</font> == Problem 1 == Let <math>L = L(K_{m,n})</math> be the laplacian matrix of the complete bipartite graph <math>K_{mn}</math>...")
- 23:54, 27 October 2019 计算复杂性 (Fall 2019)/作业4已提交名单 (hist) [525 bytes] TCSseminar (talk | contribs) (Created page with " {| class="wikitable" | DZ1833022 || 王国华 |}")
- 05:52, 27 October 2019 Assignment 3, Fall 2019 (hist) [1,087 bytes] Etone (talk | contribs) (Created page with "Held-Hou(1980) 讨论了当外部强迫的经向分布呈二次勒让德多项式，即<math>\dfrac{\Theta_E(\phi,z)}{\Theta_o}=1-\dfrac{2}{3}\Delta_H P_2(\sin \phi)+\Delta_v(...")
- 07:29, 24 October 2019 计算复杂性 (Fall 2019)/Assignment 4 (hist) [511 bytes] TCSseminar (talk | contribs) (Created page with "Chapter 5. <br/> Exercise 5.2, 5.5, 5.6, 5.12. 请将作业的电子版本(pdf、扫描或拍照)发送到助教处([mailto:liu.mingmou@smail.nju.edu.cn liu.mingmou@smail.nj...")
- 08:59, 23 October 2019 组合数学 (Fall 2019)/The probabilistic method (hist) [27,129 bytes] Etone (talk | contribs) (Created page with "== The Probabilistic Method == The probabilistic method provides another way of proving the existence of objects: instead of explicitly constructing an object, we define a pro...")
- 08:33, 23 October 2019 组合数学 (Fall 2019)/作业2已提交名单 (hist) [1,416 bytes] Haimin (talk | contribs) (Created page with "邮件提交名单如下： {| class="wikitable" |- | 161180076 |- | 161220017 |- | 161220010 |- | 161220020 |- | 161220070 |- | 161240004 |- | 161240031 |- | 161240059 |- | 1...")
- 12:20, 22 October 2019 高级算法 (Fall 2019)/Problem Set 2 (hist) [8,783 bytes] TCSseminar (talk | contribs) (Created page with "*作业电子版于2019/10/8 23:59 之前提交到邮箱 <font color=blue>njuadvalg@163.com</font> *每道题目的解答都要有<font color="red" size=5>完整的解题过...")
- 04:27, 22 October 2019 General Circulation(Fall 2019) (hist) [11,679 bytes] Etone (talk | contribs) (Created page with "{{Infobox |name = Infobox |bodystyle = |title = 大气环流 <br> General Circulation of the Atmosphere |titlestyle = |image = File:Yang_2014_3...")
- 03:35, 22 October 2019 计算复杂性 (Fall 2019)/作业3已提交名单 (hist) [582 bytes] TCSseminar (talk | contribs) (Created page with " {| class="wikitable" | mf1933074 || 乔裕哲 |}")
- 01:43, 22 October 2019 Namelist Assignment1 2019 (hist) [831 bytes] Etone (talk | contribs) (Created page with "学号 姓名 DZ1928004 刘尹成 MG1928002 陈旭 MG1928003 邓煜恒 MG1928005 龚丹毅 MG1928006 冀雅琴 MG1928007 康志杰 MG192...")
- 16:14, 21 October 2019 Assignment 2, Fall 2019 (hist) [2,522 bytes] Etone (talk | contribs) (Created page with "<font color="red" size="2">请在题目一和题目二中任选一题作为本章的作业题目。另外的一题可作为选做题。</font> ==Question #1== 在第二章中...")
- 16:11, 21 October 2019 Assignment 1, Fall 2019 (hist) [2,623 bytes] Etone (talk | contribs) (Created page with "==Question #1== 请使用多年（>20年）的NCEP/NCAR月平均再分析资料，画出各季节（至少画出冬夏两季）纬向平均温度场、纬向平均纬向风...")
- 15:58, 21 October 2019 大气环流 (Fall 2019) (hist) [10,695 bytes] Etone (talk | contribs) (Created page with "{{Infobox |name = Infobox |bodystyle = |title = 大气环流 <br> General Circulation of the Atmosphere |titlestyle = |image = File:Yang_2014_3...")
- 08:14, 16 October 2019 组合数学 (Fall 2019)/Existence problems (hist) [14,440 bytes] Etone (talk | contribs) (Created page with "== Existence by Counting == === Shannon's circuit lower bound=== This is a fundamental problem in in Computer Science. A '''boolean function''' is a function in the form <mat...")
- 05:46, 15 October 2019 组合数学 (Fall 2019)/Problem Set 2new (hist) [1,081 bytes] Haimin (talk | contribs) (Created page with "<font color="red" size=5>Under Construction</font> == Problem 1 == 假设我们班上有<math>n+2</math>个人，其中两个人是DNA完全相同的双胞胎。我们收上<...")
- 18:32, 14 October 2019 组合数学 (Fall 2019)/Problem Set 2 (hist) [2,155 bytes] Haimin (talk | contribs) (Created page with "<font color="red" size=5>Under Construction</font> == Problem 1 == 假设我们班上有n+2个人，其中两个人是DNA完全相同的双胞胎。我们收上n+2份作业...")
- 07:40, 14 October 2019 高级算法 (Fall 2019)/Dimension Reduction (hist) [16,764 bytes] Etone (talk | contribs) (Created page with "= The Johnson-Lindenstrauss Theorem = Consider a problem as follows: We have a set of <math>n</math> points in a high-dimensional Euclidean space <math>\mathbf{R}^d</math>. We...")
- 07:15, 14 October 2019 高级算法 (Fall 2019)/Conditional expectations (hist) [10,715 bytes] Etone (talk | contribs) (Created page with "= Conditional Expectations = The '''conditional expectation''' of a random variable <math>Y</math> with respect to an event <math>\mathcal{E}</math> is defined by :<math> \mat...")
- 07:14, 14 October 2019 高级算法 (Fall 2019)/Conditional expectation (hist) [3,753 bytes] Etone (talk | contribs) (Created page with "= Conditional Expectations = The '''conditional expectation''' of a random variable <math>Y</math> with respect to an event <math>\mathcal{E}</math> is defined by :<math> \mat...")
- 07:11, 14 October 2019 组合数学 (Fall 2019)/Cayley's formula (hist) [17,231 bytes] Etone (talk | contribs) (Created page with "== Cayley's Formula == We now present a theorem of the number of labeled trees on a fixed number of vertices. It is due to [http://en.wikipedia.org/wiki/Arthur_Cayley Cayley]...")
- 03:30, 11 October 2019 计算复杂性 (Fall 2019)/Assignment 3 (hist) [772 bytes] TCSseminar (talk | contribs) (Created page with "Chapter 4. Exercise 4.2, 4.3, 4.5, 4.9, 4.11, 4.7 (bonus), 4.12 (bonus). 请将作业的电子版本(pdf、扫描或拍照)发送到助教处([mailto:liu.mingmou@smail.nju....")
- 06:15, 8 October 2019 组合数学 (Fall 2019)/Pólya's theory of counting (hist) [19,696 bytes] Etone (talk | contribs) (Created page with "== Principle of Inclusion-Exclusion == Let <math>A</math> and <math>B</math> be two finite sets. The cardinality of their union is :<math>|A\cup B|=|A|+|B|-{\color{Blue}|A\cap...")
- 05:52, 8 October 2019 高级算法 (Fall 2019)/Concentration of measure (hist) [41,012 bytes] Etone (talk | contribs) (Created page with "= Conditional Expectations = The '''conditional expectation''' of a random variable <math>Y</math> with respect to an event <math>\mathcal{E}</math> is defined by :<math> \mat...")
- 21:49, 7 October 2019 计算复杂性 (Fall 2019)/作业2已提交名单 (hist) [660 bytes] TCSseminar (talk | contribs) (Created page with "截止2019.10.8 00:00，作业2已提交名单如下 {| class="wikitable" | 161140077 || 张昕渊 |}")
- 14:06, 5 October 2019 组合数学 (Fall 2019)/作业1已提交名单 (hist) [1,428 bytes] Haimin (talk | contribs) (Created page with "课堂提交名单如下： {| class="wikitable" |- | 161120169 |- | 161150037 |- | 161160037 |- | 161180011 |- | 161180076 |- | 161190005 |- | 161190005 |- | 161210005 |- | 1...")
- 06:15, 30 September 2019 组合数学 (Fall 2019)/Sieve methods (hist) [33,970 bytes] Etone (talk | contribs) (Created page with "== Principle of Inclusion-Exclusion == Let <math>A</math> and <math>B</math> be two finite sets. The cardinality of their union is :<math>|A\cup B|=|A|+|B|-{\color{Blue}|A\cap...")
- 05:25, 26 September 2019 计算复杂性 (Fall 2019)/作业1已提交名单 (hist) [685 bytes] TCSseminar (talk | contribs) (Created page with "截止2019.9.26 12:00，作业1已提交名单如下 {| class="wikitable" | MG1933011 || 杜卓轩 |- | MG1933029 || 蒋松儒 |- | MG1933090 || 张铖 |- | MF1933042 || 江...")
- 05:20, 26 September 2019 计算复杂性 (Fall 2019)/Assignment 2 (hist) [388 bytes] TCSseminar (talk | contribs) (Created page with "Chapter 3. Exercise 3.3, 3.6 请将作业的电子版本(pdf、扫描或拍照)发送到助教处([mailto:liu.mingmou@smail.nju.edu.cn liu.mingmou@smail.nju.edu.cn])，文...")
- 04:38, 24 September 2019 高级算法 (Fall 2019)/Balls into bins (hist) [11,376 bytes] Etone (talk | contribs) (Created page with "=Balls into Bins= Consider throwing <math>m</math> balls into <math>n</math> bins uniformly and independently at random. This is equivalent to a random mapping <math>f:[m]\to[...")
- 10:47, 23 September 2019 高级算法 (Fall 2019)/Problem Set 1 (hist) [6,294 bytes] Haimin (talk | contribs) (Created page with "<font color="red" size=5>Under construction</font> *每道题目的解答都要有<font color="red" size=5>完整的解题过程</font>。中英文不限。 == Problem 1 == M...")
- 12:58, 21 September 2019 量子计算的算法与物理实现研讨会 (hist) [13,474 bytes] Qinminglong (talk | contribs) (Created page with "==时间地点 == *'''<font size=4> 2019年10月19、20日: 9 am--5 pm.</font>''' * <font size=4> 南京大学 计算机科学与技术系 （南京大学仙林校区常州...")
- 03:53, 20 September 2019 Quantum (hist) [24,921 bytes] Qinminglong (talk | contribs) (Created page with "==时间地点 == *'''<font size=4> 2019年10月19、20日: 9 am--5 pm.</font>''' * <font size=4> 南京大学 计算机科学与技术系 （南京大学仙林校区常州...")
- 13:12, 17 September 2019 计算复杂性 (Fall 2019)/Assignment 1 (hist) [265 bytes] TCSseminar (talk | contribs) (Created page with "Chapter 2. Exercise 2.15, 2.16, 2.17, 2.18, 2.29, 2.6 (bonus), 2.13 (bonus). 请将作业的电子版本(pdf、扫描或拍照)发送到助教处([mailto:liu.mingmou@smail...")
- 12:49, 16 September 2019 组合数学 (Fall 2019)/Problem Set 1 (hist) [2,708 bytes] Haimin (talk | contribs) (Created page with "== To be constructed == *每道题目的解答都要有<font color="red" size=5>完整的解题过程</font>。中英文不限。 == Problem 1 == 箱子里有<math>m</math>...")
- 05:52, 16 September 2019 高级算法 (Fall 2019)/Basic tail inequalities (hist) [5,755 bytes] Etone (talk | contribs) (Created page with "=Markov's Inequality= One of the most natural information about a random variable is its expectation, which is the first moment of the random variable. Markov's inequality dr...")
- 05:52, 16 September 2019 高级算法 (Fall 2019)/Hashing and Sketching (hist) [25,717 bytes] Etone (talk | contribs) (Created page with "=Distinct Elements= Consider the following problem of '''counting distinct elements''': Suppose that <math>\Omega</math> is a sufficiently large universe. *'''Input:''' a sequ...")
- 13:18, 6 September 2019 高级算法 (Fall 2019)/Fingerprinting (hist) [30,540 bytes] Etone (talk | contribs) (Created page with "=Polynomial Identity Testing (PIT) = The '''Polynomial Identity Testing (PIT)''' is such a problem: given as input two polynomials, determine whether they are identical. It p...")
- 13:16, 6 September 2019 高级算法 (Fall 2019)/Finite Field Basics (hist) [6,210 bytes] Etone (talk | contribs) (Created page with "=Field= Let <math>S</math> be a set, '''closed''' under binary operations <math>+</math> (addition) and <math>\cdot</math> (multiplication). It gives us the following algebrai...")
- 13:15, 6 September 2019 组合数学 (Fall 2019)/Generating functions (hist) [24,916 bytes] Etone (talk | contribs) (Created page with "== Generating Functions == In Stanley's magnificent book ''Enumerative Combinatorics'', he comments the generating function as "the most useful but most difficult to understan...")
- 06:07, 2 September 2019 计算复杂性 (Fall 2019) (hist) [6,114 bytes] TCSseminar (talk | contribs) (Created page with "{{Infobox |name = Infobox |bodystyle = |title = <font size=3>计算复杂性 <br>Computational Complexity</font> |titlestyle = |image = |images...")
- 00:57, 2 September 2019 组合数学 (Fall 2019)/Basic enumeration (hist) [39,712 bytes] Etone (talk | contribs) (Created page with "== Basic Enumeration == The three basic rules for enumeration are: *'''The sum rule''': for any '''''disjoint''''' finite sets <math>S</math> and <math>T</math>, the cardinal...")
- 00:56, 2 September 2019 组合数学 (Fall 2019)/Course materials (hist) [1,449 bytes] Etone (talk | contribs) (Created page with "== Textbooks == {|border="2" cellspacing="4" cellpadding="3" rules="all" style="margin:1em 1em 1em 0; border:solid 1px #AAAAAA; border-collapse:collapse;empty-cells:show;" |[...")