User contributions for Etone
Jump to navigation
Jump to search
5 October 2022
- 02:5102:51, 5 October 2022 diff hist +2,704 N Assignment 2, Fall 2022 Created page with "<font color="red" size="2">请在题目一和题目二中任选一题作为本章的作业题目。另外的一题可作为选做题。</font> ==Question 1== 假设在大气层顶(TOA),在多年全年平均的情况下,入射的太阳辐射随纬度的分布满足 <math>\begin{align} Q&=Q_o \cdot s(x), \\ s(x)&=s_o \cdot P_o(x)+ s_2 \cdot P_2(x), \end{align}</math> 其中,<math>P_o(x)=1</math>, <math>P_2(x)=\frac{1}{2}(3x^2-1)</math>, <math>s_o=1</math>, <..."
- 02:4902:49, 5 October 2022 diff hist +66 General Circulation(Fall 2022) →Assignments
- 02:4702:47, 5 October 2022 diff hist −99 Main Page No edit summary
4 October 2022
- 13:5913:59, 4 October 2022 diff hist +1 高级算法 (Fall 2022) →Lecture Notes
- 13:5813:58, 4 October 2022 diff hist +185 高级算法 (Fall 2022) →Lecture Notes
- 13:5813:58, 4 October 2022 diff hist +59 高级算法 (Fall 2022) →Lecture Notes
3 October 2022
- 15:5615:56, 3 October 2022 diff hist −1 高级算法 (Fall 2022) →Lecture Notes
- 15:5515:55, 3 October 2022 diff hist −5 高级算法 (Fall 2022) →Lecture Notes
- 15:5415:54, 3 October 2022 diff hist +217 高级算法 (Fall 2022) →Lecture Notes
- 15:5115:51, 3 October 2022 diff hist +97 高级算法 (Fall 2022) →Lecture Notes
- 15:4915:49, 3 October 2022 diff hist +5,755 N 高级算法 (Fall 2022)/Basic tail inequalities 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 draws a tail bound for a random variable from its expectation. {{Theorem |Theorem (Markov's Inequality)| :Let <math>X</math> be a random variable assuming only nonnegative values. Then, for all <math>t>0</math>, ::<math>\begin{align} \Pr[X\ge t]\le \frac{\mathbf{E}[X]}{t}. \end{align}</math> }} {{Proo..." current
- 15:4815:48, 3 October 2022 diff hist +25,717 N 高级算法 (Fall 2022)/Hashing and Sketching 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 sequence of (not necessarily distinct) elements <math>x_1,x_2,\ldots,x_n\in\Omega</math>; *'''Output:''' an estimation of the total number of distinct elements <math>z=|\{x_1,x_2,\ldots,x_n\}|</math>. A straightforward way of solving this problem is to maintain a dictionary data structure, which costs..." current
- 15:4715:47, 3 October 2022 diff hist +1 高级算法 (Fall 2022)/Limited independence →2-universal hash families current
- 15:4515:45, 3 October 2022 diff hist +8,181 高级算法 (Fall 2022)/Balls into bins No edit summary current
- 15:4515:45, 3 October 2022 diff hist +1 高级算法 (Fall 2022)/Balls into bins →2-universal hash families
- 15:3915:39, 3 October 2022 diff hist +13,598 高级算法 (Fall 2022)/Balls into bins No edit summary
- 15:3815:38, 3 October 2022 diff hist +5,762 高级算法 (Fall 2022)/Balls into bins →Coupon Collector
- 15:3615:36, 3 October 2022 diff hist +157 高级算法 (Fall 2022) →Lecture Notes
30 September 2022
29 September 2022
- 04:1504:15, 29 September 2022 diff hist +9 Assignment 1, Fall 2022 →下载区 current
- 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