-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
41 changed files
with
93 additions
and
78 deletions.
There are no files selected for viewing
Binary file not shown.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Binary file not shown.
Binary file not shown.
Binary file not shown.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Binary file not shown.
Binary file not shown.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,13 +1,14 @@ | ||
<!doctype html><html lang=zh-cn><head><meta name=generator content="Hugo 0.135.0"><meta charset=UTF-8><meta name=description content="self-reflections of Zhenfei Yang"><meta name=viewport content="width=device-width,initial-scale=1"><meta http-equiv=X-UA-Compatible content="IE=edge"><style type=text/css>body{font-family:monospace}</style><title>Seeking Complexity</title> | ||
<!doctype html><html lang=zh-cn><head><meta name=generator content="Hugo 0.136.4"><meta charset=UTF-8><meta name=description content="self-reflections of Zhenfei Yang"><meta name=viewport content="width=device-width,initial-scale=1"><meta http-equiv=X-UA-Compatible content="IE=edge"><style type=text/css>body{font-family:monospace}</style><title>Seeking Complexity</title> | ||
<link rel=stylesheet href=../../css/style.css><link rel=alternate type=application/rss+xml href=../../index.xml title="Seeking Complexity"></head><body><header><script defer src=https://worker.yangzhenfei.com/a.js></script><script defer>window.dataLayer=window.dataLayer||[];function gtag(){dataLayer.push(arguments)}gtag("js",new Date),gtag("config","G-JHXS14NDHV")</script>========================<br>== <a href=https://www.yangzhenfei.com/>Seeking Complexity</a> ==<br>========================<div style=float:right></div><br><p><nav><a href=../../><b>Start</b></a>. | ||
<a href=../../posts/><b>Posts</b></a>. | ||
<a href=../../tags/><b>Tags</b></a>. | ||
<a href=../../about/><b>About</b></a>.</nav></p></header><main><article><h1><a href=https://www.yangzhenfei.com/posts/20211213123003-double_entry_bookkeeping/>double-entry_bookkeeping</a></h1><b><time>2021-12-13 12:30:00</time></b> | ||
<a href=../../tags/public/>PUBLIC</a><div><p>\[income + expenses + equity + liability = 0\]</p><a href=https://www.yangzhenfei.com/posts/20211213123003-double_entry_bookkeeping/>Read more...</a></div></article><article><h1><a href=https://www.yangzhenfei.com/posts/20211202120838-declarative_programming/>declarative_programming</a></h1><b><time>2021-12-02 12:08:00</time></b> | ||
<a href=../../tags/public/>PUBLIC</a><div><p>过程式和声明式的范式对比,出现在很多地方,这里罗列一些。</p><table><thead><tr><th style=text-align:left>declarative</th><th style=text-align:left>imperative</th></tr></thead><tbody><tr><td style=text-align:left>Lisp</td><td style=text-align:left>C</td></tr><tr><td style=text-align:left>TensorFlow</td><td style=text-align:left>PyTorth</td></tr><tr><td style=text-align:left>Nix</td><td style=text-align:left>Apt/Pacman</td></tr><tr><td style=text-align:left>SQL</td><td style=text-align:left>ORM</td></tr><tr><td style=text-align:left>CMake/Makefile</td><td style=text-align:left>build.sh</td></tr><tr><td style=text-align:left>Halide</td><td style=text-align:left>OpenMP/thread pool</td></tr><tr><td style=text-align:left>Symbolic Diff (symforce)</td><td style=text-align:left>Automatic Diff (JAX/Jet)</td></tr><tr><td style=text-align:left>DP for loop</td><td style=text-align:left>DP recursive with cache (used in transformer inference)</td></tr><tr><td style=text-align:left>Eigen Lazy Evaluation</td><td style=text-align:left>OpenBLAS</td></tr></tbody></table></div></article><article><h1><a href=https://www.yangzhenfei.com/posts/20211130195311-low_latency_audio/>low latency audio</a></h1><b><time>2021-11-30 19:53:00</time></b> | ||
<a href=../../tags/public/>PUBLIC</a><div><p>过程式和声明式的范式对比,出现在很多地方,这里罗列一些。</p><table><thead><tr><th>declarative</th><th>imperative</th></tr></thead><tbody><tr><td>Lisp</td><td>C</td></tr><tr><td>TensorFlow</td><td>PyTorth</td></tr><tr><td>Nix</td><td>Apt/Pacman</td></tr><tr><td>SQL</td><td>ORM</td></tr><tr><td>CMake/Makefile</td><td>build.sh</td></tr><tr><td>Halide</td><td>OpenMP/thread pool</td></tr><tr><td>Symbolic Diff (symforce)</td><td>Automatic Diff (JAX/Jet)</td></tr><tr><td>DP for loop</td><td>DP recursive with cache (used in transformer inference)</td></tr><tr><td>Eigen Lazy Evaluation</td><td>OpenBLAS</td></tr></tbody></table></div></article><article><h1><a href=https://www.yangzhenfei.com/posts/20211130195311-low_latency_audio/>low latency audio</a></h1><b><time>2021-11-30 19:53:00</time></b> | ||
<a href=../../tags/public/>PUBLIC</a><div><p>当我们讨论元宇宙的时候,能不能先把线上讨论的音频延迟问题解决。。。</p><p>这个问题解决是乐观的,因为我们通常认为影响延迟的部分(真实的网络延迟,中美做到200ms并不难,但是做到100ms几乎在物理上是不可能的)在这个问题里面并不占主要部分。</p><a href=https://www.yangzhenfei.com/posts/20211130195311-low_latency_audio/>Read more...</a></div></article><article><h1><a href=https://www.yangzhenfei.com/posts/20211115121752-tools/>tools</a></h1><b><time>2021-11-15 12:17:00</time></b> | ||
<a href=../../tags/public/>PUBLIC</a><div><p>这里记录能帮助尽快接近singularity的方法。</p><p>一般来说,学习曲线陡峭~=能形成累计优势:</p><ul><li>一次学习, <strong>终生</strong> 受用<ul><li>不与非开放平台绑定</li></ul></li><li>越用越熟练,上限高,不会浪费时间投入</li></ul><a href=https://www.yangzhenfei.com/posts/20211115121752-tools/>Read more...</a></div></article><article><h1><a href=https://www.yangzhenfei.com/posts/20211115110725-zettelkasten/>zettelkasten</a></h1><b><time>2021-11-15 11:07:00</time></b> | ||
<a href=../../tags/public/>PUBLIC</a><div><h2 id=tl-dr>TL;DR</h2><p>如果尝试把这个网状的事实,用树结构去记录,并且线性地讲述出来。</p><p>并遭遇挫败。</p><p>可以试试用网的结构开始。</p><a href=https://www.yangzhenfei.com/posts/20211115110725-zettelkasten/>Read more...</a></div></article><div><a href=../../page/4/>Previous Page</a> | ||
<a href=../../tags/public/>PUBLIC</a><div><h2 id=tl-dr>TL;DR</h2><p>如果尝试把这个网状的事实,用树结构去记录,并且线性地讲述出来。</p><p>并遭遇挫败。</p><p>可以试试用网的结构开始。</p><a href=https://www.yangzhenfei.com/posts/20211115110725-zettelkasten/>Read more...</a></div></article><article><h1><a href=https://www.yangzhenfei.com/posts/20211125114728-%E5%A4%8D%E6%9D%82%E9%97%AE%E9%A2%98%E5%86%B3%E7%AD%96%E6%96%B9%E6%B3%95%E8%AE%BA/>计划经济不在了,我很想他</a></h1><b><time>0001-01-01 00:00:00</time></b> | ||
<a href=../../tags/public/>PUBLIC</a><div><p>有⼀些复杂的多约束问题需要决策,从过去来看,过于复杂的问题由于种种原因,经常陷⼊低效的讨论。</p><p>最近受⼀些事情启发,发现了决策⽅法论的⼀个可能的探索⽅向:计划经济与线性规划。</p><a href=https://www.yangzhenfei.com/posts/20211125114728-%E5%A4%8D%E6%9D%82%E9%97%AE%E9%A2%98%E5%86%B3%E7%AD%96%E6%96%B9%E6%B3%95%E8%AE%BA/>Read more...</a></div></article><div><a href=../../page/4/>Previous Page</a> | ||
5 of 5</div></main><footer><p>© 2024 <a href=https://www.yangzhenfei.com/><b>Seeking Complexity</b></a>. | ||
<a href=https://github.com/dvorak0><b>Github</b></a>. | ||
<a href=https://twitter.com/dvorak0><b>Twitter</b></a>.</p></footer></body></html> |
Oops, something went wrong.