User contributions for Etone
Jump to navigation
Jump to search
29 September 2022
- 02:5602:56, 29 September 2022 diff hist +21 General Circulation(Fall 2022) No edit summary
28 September 2022
- 13:3913:39, 28 September 2022 diff hist +7 General Circulation(Fall 2022) →Course Slides
- 13:3813:38, 28 September 2022 diff hist +71 General Circulation(Fall 2022) →Course Slides
- 13:3713:37, 28 September 2022 diff hist +21 General Circulation(Fall 2022) →Course Slides
26 September 2022
- 08:5408:54, 26 September 2022 diff hist +175 General Circulation(Fall 2022) →Assignments
- 08:5308:53, 26 September 2022 diff hist 0 General Circulation(Fall 2022) →Assignments
- 08:3308:33, 26 September 2022 diff hist +407 General Circulation(Fall 2022) →Course Slides
- 08:2808:28, 26 September 2022 diff hist +3 Assignment 1, Fall 2022 →Bonus Question
- 08:2808:28, 26 September 2022 diff hist +228 Assignment 1, Fall 2022 No edit summary
- 08:1308:13, 26 September 2022 diff hist +6 Assignment 1, Fall 2022 →On the netcdf file
- 08:0908:09, 26 September 2022 diff hist −17 Assignment 1, Fall 2022 →下载区
- 08:0808:08, 26 September 2022 diff hist +2,560 N Assignment 1, Fall 2022 Created page with "==Question #1== 请使用多年（>20年）的NCEP/NCAR月平均再分析资料，画出各季节（至少画出冬夏两季）纬向平均温度场、纬向平均纬向风场的高度－纬度剖面分布，并简述其分布特征和季节变化特征。 ==Question #2== 请使用多年（>20年）的NCEP/NCAR月平均再分析资料，画出各季节（至少画出冬夏两季）温度场、纬向风场在各高度（850、500、100 hPa， 对于温度场请再画..."
- 08:0708:07, 26 September 2022 diff hist −24 General Circulation(Fall 2021) No edit summary current
- 08:0508:05, 26 September 2022 diff hist +5,196 General Circulation(Fall 2022) No edit summary
- 08:0408:04, 26 September 2022 diff hist +1,062 General Circulation(Fall 2022) No edit summary
- 08:0308:03, 26 September 2022 diff hist +2,249 N General Circulation(Fall 2022) Created page with "{{Infobox |name = Infobox |bodystyle = |title = 大气环流 <br> General Circulation of the Atmosphere |titlestyle = |headerstyle = background:#ccf; |labelstyle = background:#ddf; |datastyle = |header1 =Instructor |label1 = |data1 = |header2 = |label2 = |data2 = 张洋 |header3 = |label3 = Email |data3 = yangzhang@nju.edu.cn |header4 = |label4= office |data4= 仙林大气楼 B410 |header5 = Class |label5 = |data5 = |hea..."
- 08:0208:02, 26 September 2022 diff hist +99 Main Page No edit summary Tag: Visual edit: Switched
21 September 2022
- 11:4811:48, 21 September 2022 diff hist +15,811 N 高级算法 (Fall 2022)/Limited independence Created page with "= <math>k</math>-wise independence = Recall the definition of independence between events: {{Theorem |Definition (Independent events)| :Events <math>\mathcal{E}_1, \mathcal{E}_2, \ldots, \mathcal{E}_n</math> are '''mutually independent''' if, for any subset <math>I\subseteq\{1,2,\ldots,n\}</math>, ::<math>\begin{align} \Pr\left[\bigwedge_{i\in I}\mathcal{E}_i\right] &= \prod_{i\in I}\Pr[\mathcal{E}_i]. \end{align}</math> }} Similarly, we can define independence between..."
- 11:4811:48, 21 September 2022 diff hist +75 高级算法 (Fall 2022) →Lecture Notes
- 11:4711:47, 21 September 2022 diff hist +11,376 N 高级算法 (Fall 2022)/Balls into bins 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[n]</math>. Needless to say, random mapping is an important random model and may have many applications in Computer Science, e.g. hashing. We are concerned with the following three questions regarding the balls into bins model: * birthday problem: the probability that every bin contains at most one..."
- 11:4711:47, 21 September 2022 diff hist +61 高级算法 (Fall 2022) →Lecture Notes
- 11:4611:46, 21 September 2022 diff hist 0 高级算法 (Fall 2022) →Lecture Notes
- 11:4611:46, 21 September 2022 diff hist −122 高级算法 (Fall 2022) →Lecture Notes
- 11:4611:46, 21 September 2022 diff hist +371 高级算法 (Fall 2022) →Lecture Notes
18 September 2022
- 12:2312:23, 18 September 2022 diff hist +14 高级算法 (Fall 2022) No edit summary
- 12:2212:22, 18 September 2022 diff hist 0 高级算法 (Fall 2022) →Course info
14 September 2022
- 05:2005:20, 14 September 2022 diff hist +2 高级算法 (Fall 2022) →Lecture Notes
- 05:2005:20, 14 September 2022 diff hist +123 高级算法 (Fall 2022) →Lecture Notes
- 05:1905:19, 14 September 2022 diff hist +66 高级算法 (Fall 2022) →Lecture Notes
- 05:1805:18, 14 September 2022 diff hist +61 高级算法 (Fall 2022) →Lecture Notes
13 September 2022
- 08:0708:07, 13 September 2022 diff hist −71 高级算法 (Fall 2022) →Lecture Notes
- 05:4305:43, 13 September 2022 diff hist +6,210 N 高级算法 (Fall 2022)/Finite Field Basics 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 algebraic structures if the corresponding set of axioms are satisfied. {|class="wikitable" !colspan="7"|Structures !Axioms !Operations |- |rowspan="9" style="background-color:#ffffcc;text-align:center;"|'''''field''''' |rowspan="8" style="background-color:#ffffcc;text-align:center;"|'''''commutative<br>rin..." current
- 05:4305:43, 13 September 2022 diff hist +30,540 N 高级算法 (Fall 2022)/Fingerprinting 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 plays a fundamental role in ''Identity Testing'' problems. First, let's consider the univariate ("one variable") case: * '''Input:''' two polynomials <math>f, g\in\mathbb{F}[x]</math> of degree <math>d</math>. * Determine whether <math>f\equiv g</math> (<math>f</math> and <math>g</math> are identica..." current
- 05:4205:42, 13 September 2022 diff hist +73 高级算法 (Fall 2022) →Lecture Notes
- 05:4205:42, 13 September 2022 diff hist +134 高级算法 (Fall 2022) →Lecture Notes
6 September 2022
- 09:1109:11, 6 September 2022 diff hist 0 高级算法 (Fall 2022) →Lecture Notes
- 09:0909:09, 6 September 2022 diff hist +184 高级算法 (Fall 2022) →Lecture Notes
5 September 2022
- 07:3107:31, 5 September 2022 diff hist +17,328 N 高级算法 (Fall 2022)/Probability Basics Created page with "=Probability Space= The axiom foundation of probability theory is laid by [http://en.wikipedia.org/wiki/Andrey_Kolmogorov Kolmogorov], one of the greatest mathematician of the 20th century, who advanced various very different fields of mathematics. {{Theorem|Definition (Probability Space)| A '''probability space''' is a triple <math>(\Omega,\Sigma,\Pr)</math>. *<math>\Omega</math> is a set, called the '''sample space'''. *<math>\Sigma\subseteq 2^{\Omega}</math> is the..." current
- 07:3107:31, 5 September 2022 diff hist +71 高级算法 (Fall 2022) →Lecture Notes
- 07:3107:31, 5 September 2022 diff hist +44,285 N 高级算法 (Fall 2022)/Min-Cut and Max-Cut Created page with "= Graph Cut = Let <math>G(V, E)</math> be an undirected graph. A subset <math>C\subseteq E</math> of edges is a '''cut''' of graph <math>G</math> if <math>G</math> becomes ''disconnected'' after deleting all edges in <math>C</math>. Let <math>\{S,T\}</math> be a '''bipartition''' of <math>V</math> into nonempty subsets <math>S,T\subseteq V</math>, where <math>S\cap T=\emptyset</math> and <math>S\cup T=V</math>. A cut <math>C</math> is specified by this bipartition as..." current
- 07:3007:30, 5 September 2022 diff hist +126 高级算法 (Fall 2022) →Lecture Notes
1 September 2022
- 05:0605:06, 1 September 2022 diff hist 0 Main Page No edit summary
30 August 2022
- 15:5815:58, 30 August 2022 diff hist −1 Main Page →Home Pages for Courses and Seminars
- 15:5815:58, 30 August 2022 diff hist +40 Main Page →Home Pages for Courses and Seminars
- 15:5815:58, 30 August 2022 diff hist −32 Main Page →Home Pages for Courses and Seminars
- 15:5715:57, 30 August 2022 diff hist +42 Main Page →Home Pages for Courses and Seminars
- 15:5615:56, 30 August 2022 diff hist −1 Main Page →Home Pages for Courses and Seminars
- 15:5615:56, 30 August 2022 diff hist −25 Main Page →Home Pages for Courses and Seminars
- 15:5615:56, 30 August 2022 diff hist 0 Main Page →Home Pages for Courses and Seminars
- 15:5515:55, 30 August 2022 diff hist −44 Main Page →Home Pages for Courses and Seminars