User contributions for Etone
Jump to navigation
Jump to search
6 November 2023
- 06:1406:14, 6 November 2023 diff hist +57 General Circulation(Fall 2023) →Course Slides
- 06:1206:12, 6 November 2023 diff hist +1,087 N Assignment 3, Fall 2023 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(\dfrac{z}{H}-\dfrac{1}{2})</math>的情况下，哈德莱环流内的风场、温度场、环流的空间范围等将怎样随纬度和外力强迫的强度而变化。如果将外力强迫的空间分布改为<math>\dfrac{\Theta_E(\phi,z)}{\Theta_o}=1-\Delta_H(\sin \phi -\frac{1}{2})+\Delta_v(\dfra..." current
- 06:1106:11, 6 November 2023 diff hist +59 General Circulation(Fall 2023) →Assignments
- 06:0506:05, 6 November 2023 diff hist +1,137 N Namelist Assignment 2 2023 Created page with "姓名 学号 魏斯诚 201830012 潘云逸 201830049 李宜卓 201830062 王若骥 201830143 吴佳根 201830196 王奕 201840022 张顺伟 201840065 范禹韬 201840173 谭金林 201840222 张宁萌 201840254 武越 201840285 谢卫宏 201850142 艾真珍 502023280001 曹珩 502023280003 岑琦胜 502023280004 陈石 502023280006 成柯蒙 502023280007 丁思聪 502023280010 樊浩然 502023280011 费照轩 502023..." current
- 06:0006:00, 6 November 2023 diff hist +1 General Circulation(Fall 2023) →Assignments
- 05:5905:59, 6 November 2023 diff hist +55 General Circulation(Fall 2023) →Assignments
31 October 2023
- 10:0110:01, 31 October 2023 diff hist 0 高级算法 (Fall 2023) →Lecture Notes
- 10:0110:01, 31 October 2023 diff hist +10 高级算法 (Fall 2023) →Lecture Notes
29 October 2023
24 October 2023
- 12:3412:34, 24 October 2023 diff hist +1,130 N Namelist Assignment 1 2023 Created page with "姓名 学号 魏斯诚 201830012 潘云逸 201830049 李宜卓 201830062 王若骥 201830143 吴佳根 201830196 王奕 201840022 张顺伟 201840065 范禹韬 201840173 谭金林 201840222 张宁萌 201840254 武越 201840285 谢卫宏 201850142 樊浩然 501023280011 温康 501023280041 艾真珍 502023280001 曹珩 502023280003 岑琦胜 502023280004 陈石 502023280006 成柯蒙 502023280007 丁思聪 502023280010..." current
- 12:3012:30, 24 October 2023 diff hist +55 General Circulation(Fall 2023) →Assignments
- 03:2203:22, 24 October 2023 diff hist −57 高级算法 (Fall 2023)/Problem Set 1 No edit summary
21 October 2023
- 07:5407:54, 21 October 2023 diff hist +5 高级算法 (Fall 2023) →Lecture Notes
- 07:5207:52, 21 October 2023 diff hist +267 高级算法 (Fall 2023) →Lecture Notes
- 07:5107:51, 21 October 2023 diff hist +16,764 N 高级算法 (Fall 2023)/Dimension Reduction Created page with "= Metric Embedding= A '''metric space''' is a pair <math>(X,d)</math>, where <math>X</math> is a set and <math>d</math> is a '''metric''' (or '''distance''') on <math>X</math>, i.e., a function :<math>d:X^2\to\mathbb{R}_{\ge 0}</math> such that for any <math>x,y,z\in X</math>, the following axioms hold: # (identity of indiscernibles) <math>d(x,y)=0\Leftrightarrow x=y</math> # (symmetry) <math>d(x,y)=d(y,x)</math> # (triangle inequality) <math>d(x,z)\le d(x,y)+d(y,z)</ma..." current
- 07:5107:51, 21 October 2023 diff hist +338 高级算法 (Fall 2023) →Lecture Notes
20 October 2023
- 00:5700:57, 20 October 2023 diff hist +16 General Circulation(Fall 2023) →Assignments Tag: Visual edit
15 October 2023
- 08:1508:15, 15 October 2023 diff hist +5 高级算法 (Fall 2023)/Hashing and Sketching →Apply the mean trick to the \min-sketch current
- 08:1408:14, 15 October 2023 diff hist 0 高级算法 (Fall 2023)/Hashing and Sketching →Apply the mean trick to the \min-sketch
- 08:1408:14, 15 October 2023 diff hist +9 高级算法 (Fall 2023)/Hashing and Sketching →Apply the mean trick to the \min-sketch
- 08:1308:13, 15 October 2023 diff hist +32 高级算法 (Fall 2023)/Hashing and Sketching →Apply the mean trick to the \min-sketch
- 08:1208:12, 15 October 2023 diff hist −28 高级算法 (Fall 2023)/Hashing and Sketching →Apply the mean trick to the \min-sketch
- 08:1108:11, 15 October 2023 diff hist −103 高级算法 (Fall 2023)/Hashing and Sketching →Distinct Elements
- 08:1008:10, 15 October 2023 diff hist −1,086 高级算法 (Fall 2023)/Hashing and Sketching →Uniform Hash Assumption (UHA)
- 08:1008:10, 15 October 2023 diff hist +15 高级算法 (Fall 2023)/Hashing and Sketching →Flajolet-Martin algorithm
- 08:0808:08, 15 October 2023 diff hist +14 高级算法 (Fall 2023)/Hashing and Sketching →The Min-Sketch
- 08:0708:07, 15 October 2023 diff hist −9 高级算法 (Fall 2023)/Hashing and Sketching →An estimator by hashing
- 08:0508:05, 15 October 2023 diff hist −113 高级算法 (Fall 2023)/Hashing and Sketching No edit summary
- 08:0008:00, 15 October 2023 diff hist −43 高级算法 (Fall 2023)/Hashing and Sketching →Set Membership
- 07:5807:58, 15 October 2023 diff hist +4,712 高级算法 (Fall 2023)/Hashing and Sketching →Perfect Hashing
- 07:5107:51, 15 October 2023 diff hist −5,607 高级算法 (Fall 2023)/Hashing and Sketching →Set Membership
- 07:5007:50, 15 October 2023 diff hist −393 高级算法 (Fall 2023)/Hashing and Sketching →Collision number
- 07:4907:49, 15 October 2023 diff hist −7 高级算法 (Fall 2023)/Hashing and Sketching →Birthday problem fro pairwise independent hashing
- 07:4807:48, 15 October 2023 diff hist +34 高级算法 (Fall 2023)/Hashing and Sketching →Collision number
- 07:4707:47, 15 October 2023 diff hist +5 高级算法 (Fall 2023)/Hashing and Sketching →Universal Hashing
- 07:4607:46, 15 October 2023 diff hist −20 高级算法 (Fall 2023)/Hashing and Sketching →Birthday Problem and Hash Collision
- 07:4607:46, 15 October 2023 diff hist +41 高级算法 (Fall 2023)/Hashing and Sketching →Birthday Problem
- 07:4407:44, 15 October 2023 diff hist −3,931 高级算法 (Fall 2023)/Hashing and Sketching →Occupancy Problem
- 07:4407:44, 15 October 2023 diff hist −9,003 高级算法 (Fall 2023)/Hashing and Sketching →Coupon Collector
- 07:4407:44, 15 October 2023 diff hist +77 高级算法 (Fall 2023)/Hashing and Sketching No edit summary
- 07:3907:39, 15 October 2023 diff hist +25,719 高级算法 (Fall 2023)/Hashing and Sketching No edit summary
- 07:3807:38, 15 October 2023 diff hist +38,918 N 高级算法 (Fall 2023)/Hashing and Sketching 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 October 2023
- 05:5805:58, 11 October 2023 diff hist +2,522 N Assignment 2, Fall 2023 Created page with "<font color="red" size="2">请在题目一和题目二中任选一题作为本章的作业题目。另外的一题可作为选做题。</font> ==Question 1== 假设在大气层顶（TOA），在多年全年平均的情况下，入射的太阳辐射随纬度的分布满足 <math>Q=Q_o \cdot s(x)</math>, <math>s(x)=s_o \cdot P_o(x)+ s_2 \cdot P_2(x)</math>， 其中，<math>P_o(x)=1</math>, <math>P_2(x)=\frac{1}{2}(3x^2-1)</math>, <math>s_o=1</math>, <math>s_2=-0.473</ma..." current
- 05:5405:54, 11 October 2023 diff hist +66 General Circulation(Fall 2023) →Assignments
10 October 2023
- 10:5310:53, 10 October 2023 diff hist +41,013 N 高级算法 (Fall 2023)/Concentration of measure Created page with "=Chernoff Bound= Suppose that we have a fair coin. If we toss it once, then the outcome is completely unpredictable. But if we toss it, say for 1000 times, then the number of HEADs is very likely to be around 500. This phenomenon, as illustrated in the following figure, is called the '''concentration''' of measure. The Chernoff bound is an inequality that characterizes the concentration phenomenon for the sum of independent trials. File:Coinflip.png|border|450px|cent..." current
- 10:5310:53, 10 October 2023 diff hist +10,715 N 高级算法 (Fall 2023)/Conditional expectations 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> \mathbf{E}[Y\mid \mathcal{E}]=\sum_{y}y\Pr[Y=y\mid\mathcal{E}]. </math> In particular, if the event <math>\mathcal{E}</math> is <math>X=a</math>, the conditional expectation :<math> \mathbf{E}[Y\mid X=a] </math> defines a function :<math> f(a)=\mathbf{E}[Y\mid X=a]. </math> Thus, <math>\mathbf{E}[Y\mid..." current
- 10:5110:51, 10 October 2023 diff hist +229 高级算法 (Fall 2023) →Lecture Notes