changed 3 years ago  
Linked with GitHub

22 winter break

tags: winter, ``

Author: JimmyYS

簡介說明

$ youtube-dl --version
2021.04.01 
unm/gradreq/CS%20PhD%203rd%20Sheet%20Feb%2017.pdf
tw0 courses from each category below

SYSTEMS
Course # Required B- or better 
CS 554: Compiler Construction 3
CS 585: Computer Networks 3
CS 587: Advanced Operating Systems 3

THEORY
CS 500: Introduction to the Theory of Computation 3
CS 550: Programming Languages and Systems 3
CS 561: Algorithms/Data Structure 3

EMPIRICAL METHODS
CS 530: Geometric and Probabilistic Methods in CS 3
CS 533: Experimental Methods in Computer Science 3

LANGUAGE REQUIREMENT
At least one of the following:
CS 550: Programming Languages and Systems 3
CS 554: Compiler Construction 3
CS 558: Software Foundations 3

golang review

$ youtube-dl --version
2021.04.01

c review

	 	-	 
[DIR]	android_hardware_intel/	2022-01-13 13:10	-	 
[DIR]	android_tools_leeco_msm8996/	2022-01-14 11:36	-	 
Apache/2.4.29 (Ubuntu) Server at www.cs.unm.edu Port 443

  • Paul Deitel, Harvey Deitel - C How to Program. With an Introduction to C++-Pearson International (2016)

    • 7.12 Pointers to Functions
      • A pointer to a function contains the address of the function in memory. In Chapter 6, we saw that an array name is really the address in memory of the first element of the array. Similarly, a function name is really the starting address in memory of the code that performs the function’s task. Pointers to functions can be passed to functions, returned from functions, stored in arrays and assigned to other function pointers.
    • 20.7 (Optional) Polymorphism, Virtual Functions and Dynamic Binding “Under the Hood”
      • C++ makes polymorphism easy to program. It’s certainly possible to program for polymorphism in non-object-oriented languages such as C, but doing so requires complex and potentially dangerous pointer manipulations. This section discusses how C++ can implement polymorphism, virtual functions and dynamic binding internally. This will give you a solid understanding of how these capabilities really work. More importantly, it will help you appreciate the overhead of polymorphism—in terms of additional memory consumption and processor time.

  • https://www.cprogramming.com/tutorial/function-pointers.html

    • Function Pointer Syntax
    • Using Polymorphism and Virtual Functions Instead of Function Pointers

  • https://www.geeksforgeeks.org/function-pointer-in-c/amp/

dyn programming

$ youtube-dl --version
2021.04.01

react-static

$ youtube-dl --version
2021.04.01

Project Animal Crossing (?)

$ youtube-dl --version
2021.04.01
  • [?q=動物森林&] https://zh.wikipedia.org/wiki/動物森友會_(遊戲)
  • [?q=動物森友會+女工程師&] Lucy Chang／矽谷資深女工程師. 2020/07/29 … 從《動物森友會》和《FF7 Remake》，看遊戲產業的逆勢爆發.
  • [?q=動物森友會+女設計師&]
  • [?q=動物森友會+任天堂設計師&] https://ccc.technews.tw/2020/04/18/how-nintendo-make-animal-crossing/
    • 後來，系列製作人江口勝也基於這個企劃雛形，萌生做「讓大家一起玩的遊戲」的想法：「在一個廣闊的場景，構建 RPG 風格的世界，然後讓多名玩家進入，每個玩家遊玩的結果，會影響到其他玩家。」
    • 2006 年稍晚，京極彩第一次加入《動森》製作組，負責 Wii 新作《動物森友會 城市大家庭》的台詞設計。
    • 為 3DS 製作《動森》新作《走出戶外 動物森友會》的時候，京極彩升任聯合監督，與更側重系統程式的毛呂功一起，負責統籌新作開發。
    • 京極彩就是 Nintendo EAD 的第一位女性設計師，Wii 時代加入《動森》系列後她發現，當團隊成員男女比例更平衡時，有創意的點子更容易迸發。所以女性視角的設計理念，對這個系列的變革也有關鍵推動作用。
  • $ cat lecture-16-complexity-p-np-np-completeness-reductions.eHZifpgyH_4.srt | grep -i -e "dimen" -B 2
  • $ cat ../6006-11F/lecture-23-computational-complexity.moPtwq_cVH8.srt | grep -i -e "shortest" -B 1
    • 00:50:53,500 But in 3D, shortest paths is NP-complete.

21F review

$ youtube-dl --version
2021.04.01

CS 533

00:06:01,260
And, in a year from now when
almost all of the formulas
have been wiped out from your
memory, you still have the
basic concepts. 


unm/21F/533ExprMethod/caption $ grep -ir -e markov
lec.20.100821.srt.txt:have hidden Markov
lec.20.100821.srt.txt:see Markov models,
lec.20.100821.srt.txt:Markov models and
lec.08.srt.new.txt:Markov chains,
lec.08.srt.new.txt:Markov chains.

Lectures:
11/12	(F):	Markov	Chains
11/15	(M):	Markov	Chains	and	Poisson	Processes	(PAPERS	ASSIGNED:	due	12/6)
Prerecorded	lecture:	Experimental	Algorithmics	(available	on	11/15,	quiz)
11/17	(W):	Monte	Carlo	Simulations	
11/19	(F):	Time	Performance	(feedback	on	Project	2)
11/22	(M):	More	on	Time	Performance	(PROJECT	3	ASSIGNED:	due	12/14	midnight)
11/24	(W):	Solution	Quality	+	Optimization	Problems
11/29	(M):	More	on	Solution	Quality
12/1	(W):	Tuning	Algorithms	and	Code
12/3	(F):	Validation,	Verification	and	Benchmarking
Prerecorded	lecture:	Human-Computer	Interaction	experiments	(last	week,	quiz)
12/6 – 12/10	(last	week	of	classes):	Presentations	(zoom)

CS 454/554 Compiler Construction

Tuesdays and Thursdays, 2:00–3:15, in MECH 208.
2.18 Real Stuff: RISC-V Instructions
The instruction set most similar to MIPS also originated in academia.

CS 510 Mobile Computing

We have another question: is collision detection possible?
Do we have to figure out a way to detect collision?

15週;chihiro

22S preview

585
Title: Computer Networks
03:30 PM - 04:45 PM
Electrical & Comp Engineering | Room 118
,
,
591
ST: Computational Fabrication
01/17/2022 - 05/14/2022
09:30 AM - 10:45 AM
Science Math Learning Center | Room 356
,
,
580
Title: The Specification of Software Systems
will cover the specification of sequential and concurrent systems.
04:00 PM - 06:30 PM
Centennial Engineering Center | Room 1032
,
,
592
Title: Colloquium
02:00 PM - 03:00 PM

22S 592 Fab

$ youtube-dl --version
2021.04.01

22S 585 Computer Networks

- What did you do yesterday?
- What are you going to do today?
- Are there any blockers?

MIT6_02F12_ps7.pdf
  • Introduction to this week's Python tasks. This lab uses WSim, a simple packet-level network simulator for a shared medium network. You will be writing a small amount of code to develop various MAC protocols and measure how they perform under different conditions. Much of your work will be on experimenting with various parameters and explaining what you observe. The amount of new code you have to write is rather small. In each experiment, all the nodes run the same MAC protocol. The simulator executes a set of steps every time slot; time increments by 1 each slot. You can run the python programs for this lab using python from the terminal command line, e.g., python PS7_???.py. This lab may not work well in IDLE (you can use IDLE to edit files, but running them may not work as expected).

circuit vs packet swithing

  • Walpole, Ronald E._ Myers, Raymond H._ Myers, Sharon L._ Ye, Keying - Probability & statistics for engineers & scientists-Pearson (2017)
    • Chapter 5 Some Discrete Probability Distributions
    • 5.1 Introduction and Motivation
    • 5.2 Binomial and Multinomial Distributions
      • The number X of successes in n Bernoulli trials is called a binomial random variable.
    • 8.4 Sampling Distribution of Means and the Central Limit Theorem
      • The first important sampling distribution to be considered is that of the mean X¯.
      • Central Limit Theorem: If X¯ is the mean of a random sample of size n taken from a population with mean μ and finite variance σ2 , then the limiting form of the distribution of Z = X¯ − μ σ/√n , as n → ∞, is the standard normal distribution n(z;0, 1).
  • http://www.eecs.umich.edu/courses/eecs489/w07/hw2solution.pdf
  • echo "Enter m3u8 link:";read link;echo "Enter output filename:";read filename;ffmpeg -i "$link" -bsf:a aac_adtstoasc -vcodec copy -c copy -crf 50 $filename.mp4
  • chmod -R o+rx public_html/

caption/6041-10F/

lecture-1-probability-models-and-axioms.j9WZyLZCBzs.srt
lecture-10-continuous-bayes-rule-derived-distributions.H_k1w3cfny8.srt
lecture-11-derived-distributions-convolution-correlation.l4NoMKEHQwM.srt
lecture-12-iterated-expectations-sum-of-a-random-number-of-random-variables.P7a4bjE6Crk.srt
lecture-13-bernoulli-process.gMTiAeE0NCw.srt
lecture-14-poisson-process-i.jsqSScywvMc.srt
lecture-15-poisson-process-ii.XsYXACeIklU.srt
lecture-16-markov-chains-i.IkbkEtOOC1Y.srt
lecture-17-markov-chains-ii.ZulMqrvP-Pk.srt
lecture-18-markov-chains-iii.HIMxdWDLEK8.srt
lecture-19-weak-law-of-large-numbers.3eiio3Tw7UQ.srt
lecture-2-conditioning-and-bayes-rule.TluTv5V0RmE.srt
lecture-20-the-central-limit-theorem.Tx7zzD4aeiA.srt
lecture-21-bayesian-statistical-inference-i.1jDBM9UM9xk.srt
lecture-22-bayesian-statistical-inference-ii.XtNXQJkgkhI.srt
lecture-23-classical-statistical-inference-i.4UJc0S8APm4.srt
lecture-24-classical-inference-ii.tBUHRpFZy0s.srt
lecture-25-classical-inference-iii-course-overview.rYefUsYuEp0.srt
lecture-3-independence.19Ql_Q3l0GA.srt
lecture-4-counting.6oV3pKLgW2I.srt
lecture-5-discrete-variables-probability-expectations.3MOahpLxj6A.srt
lecture-6-discrete-random-variable-examples-joint-pmfs.-qCEoqpwjf4.srt
lecture-7-multiple-variables-expectations-independence.EObHWIEKGjA.srt
lecture-8-continuous-random-variables.mHfn_7ym6to.srt
lecture-9-multiple-continuous-random-variables.CadZXGNauY0.srt

caption/stat110/

[TXT]	Lecture-6-Monty-Hall,-Simpson-s-Paradox.fDcjhAKuhqQ.srt.txt	2021-11-20 23:25	44K	 
[TXT]	Lecture-29-Law-of-Large-Numbers-and-Central-Limit-Theorem.OprNqnHsVIA.srt.txt	2021-11-20 23:15	40K	 
Apache/2.4.29 (Ubuntu) Server at www.cs.unm.edu Port 443

caption/6033S05/

Lecture-04-Naming.zm2VP0kHl1M.srt
Lecture-05-Fault-isolation-with-clients-and-servers.RmdAWsvcsZw.srt
Lecture-06-Virtualization--virtual-memory.TPeKtQykujI.srt
Lecture-07-Virtual-processors--threads-and-coordination.vMJshx7SO6Y.srt
Lecture-08-Performance.RR6DHXgT_5E.srt
Lecture-09-Introduction-to-networks.uKYAcK2JXo0.srt
Lecture-10-Layering-and-link-layer.r0o9DJmvYNg.srt
Lecture-11-Network-layer--routing.kIErDkOepts.srt
Lecture-12-End-to-end-layer.Z2ENBilJWN0.srt
Lecture-13-Congestion-control.HxOA8HrVzPg.srt
Lecture-14-Distributed-naming.PcPSF8kdgAQ.srt
Lecture-15-Reliability.Tpnla9TdOyY.srt
Lecture-16-Atomicity-concepts.Oo4iCE48xCc.srt
Lecture-17-Recoverability.s_fjGI6PSI8.srt
Lecture-18-Isolation.9500J3lgu6U.srt
Lecture-19-Transactions-and-consistency.BOR5n_nP1ps.srt
Lecture-20-Multi-site-atomicity.o-orfTyTXow.srt
Lecture-21-Security-introduction.SCpzazvhXaU.srt
Lecture-22-Authentication.xEgcKKE9GmA.srt
Lecture-23-Authorization-and-confidentiality.mBd1nntUgHc.srt
Lecture-24-Advanced-authentication.BmjKER_e7-s.srt
Lecture-25-Complex--trusted-systems.TXgH4G81iH0.srt

caption/MIT18_650F16/srt/

lecture-01-Introduction-to-Statistics.VPZD_aij8H0.srt
lecture-02-Introduction-to-Statistics-cont.C_W1adH-NVE.srt
lecture-03-Parametric-Inference.TSkDZbGS94k.srt
lecture-04-Parametric-Inference-cont-Maxi.rLlZpnT02ZU.srt
lecture-05-Maximum-Likelihood-Estimation-cont.0Va2dOLqUfM.srt
lecture-06-Maximum-Likelihood-Estimation-cont-Method-of-M.JTbZP0yt9qc.srt
lecture-07-Parametric-Hypothesis-Testing.phbw9r1iUDI.srt
lecture-08-Parametric-Hypothesis-Testing-cont.4HRhg4eUiMo.srt
lecture-09-Parametric-Hypothesis-Testing-cont.QXkOaifVfW4.srt
lecture-11-Parametric-Hypothesis-Testing-cont-Testing-Goodn.a66tfLdr6oY.srt
lecture-12-Testing-Goodness-of-Fit-cont.vMaKx9fmJHE.srt
lecture-13-Regression.yP1S37BiEsQ.srt
lecture-14-Regression-cont.JBIz7UadY5M.srt
lecture-15-Regression-cont.V4xOdtqic3o.srt
lecture-17-Bayesian-Statistics.bFZ-0FH5hfs.srt
lecture-18-Bayesian-Statistics-cont.k2inA31Gups.srt
lecture-19-Principal-Component-Analysis.WW3ZJHPwvyg.srt
lecture-20-Principal-Component-Analysis-cont.a1ZCeFpeW0o.srt
lecture-21-Generalized-Linear-Models.X-ix97pw0xY.srt
lecture-22-Generalized-Linear-Models-cont.mc1y8m9-hOM.srt
lecture-23-Generalized-Linear-Models-cont.OYcdw5vOgIc.srt
lecture-24-Generalized-Linear-Models-cont.lWW54ts9Ubo.srt

22S 580

580
Title: The Specification of Software Systems
will cover the specification of sequential and concurrent systems.
04:00 PM - 06:30 PM
Centennial Engineering Center | Room 1032

?q=is+agile+just+hacking+around&

,
, news.ycombinator.com/item?id=9672370
, news.ycombinator.com/item?id=5406384
, darkreading.com/endpoint/lean-mean-agile-hacking-machine
, agiledevelopment.org/agile-talk/115-what-a-hack-is-kanban
,
Thereby, forgetting the core of Agility, change.
,
, leadershiptribe.com/blog/why-do-developers-dislike-agile
,
People also ask
Why do developers hate agile?
Search for: Why do developers hate agile?
Is agile going away?
Why is agile not SAFe?
Is agile the future?
Is agile just micromanagement?
,
, news.ycombinator.com/item?id=5406384
, ?q=is+agile+just+hacking+around&
,

22S 592 colloquim

592
Title: Colloquium
02:00 PM - 03:00 PM

22F preview

$ youtube-dl --version
2021.04.01
Select a repo