第 1 章 Parrot

简介:

parrot - A virtual machine for dynamic languages

$ sudo apt-get install parrot

		





原文出处:Netkiller 系列 手札
本文作者:陈景峯
转载请与作者联系,同时请务必标明文章原始出处和作者信息及本声明。

目录
相关文章
Say No to Palindromes
题意: 给出一个字符串,长度为n,而且都是又a,b,c三个字符构成的,然后有m个询问 每个询问给出l r,问要想这个区间内不存在回文子串,至少要改多少个字符 结论: 一共会有六种情况
101 0
|
机器学习/深度学习 算法框架/工具 TensorFlow
(转) AdversarialNetsPapers
  本文转自:https://github.com/zhangqianhui/AdversarialNetsPapers AdversarialNetsPapers The classical Papers about adversarial nets The First pap...
1388 0
Generate Parentheses
Generate Parentheses 给定一个数字n,生成符合要求的n对括号 Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
745 0
回文树(回文自动机) - URAL 1960 Palindromes and Super Abilities
  Palindromes and Super Abilities Problem's Link:  http://acm.timus.ru/problem.aspx?space=1&num=1960   Mean:  给你一个长度为n的字符串S,输出S的各个前缀中回文串的数量。
944 0
[Papers]NSE, $u$, Lorentz space [Bjorland-Vasseur, JMFM, 2011]
$$\bex \int_0^T\frac{\sen{\bbu}_{L^{q,\infty}}^p}{\ve+\ln \sex{e+\sen{\bbu}_{L^\infty}}}\rd s
619 0
[Papers]NSE, $u$, Lorentz space [Bosia-Pata-Robinson, JMFM, 2014]
$$\bex \bbu\in L^p(0,T;L^{q,\infty}),\quad \frac{2}{p}+\frac{3}{q}=1,\quad 3
769 0
[Papers]MHD, $\pi$, Lorentz space [Suzuki, DCDSA, 2011]
$$\bex \sen{\pi}_{L^{s,\infty}(0,T;L^{q,\infty}(\bbR^3))} +\sen{{\bf b}}_{L^{\gamma,\infty}(0,T;L^{\tt,\infty}(\bbR^3))}^2\leq \ve_*, \eex$$ with $$\...
738 0
[Papers]NSE, $u_3$, Lebesgue space [Cao-Titi, IUMJ, 2008]
$$\bex u_3\in L^p(0,T;L^q(\bbR^3)),\quad \frac{2}{p}+\frac{3}{q}=\frac{2}{3}+\frac{2}{3q},\quad \frac{7}{2}
850 0
[Papers]NSE, $\p_3u$, Lebesgue space [Penel-Pokorny, AM, 2004]
$$\bex \p_3\bbu\in L^p(0,T;L^q(\bbR^3)),\quad \frac{2}{p}+\frac{3}{q}=\frac{3}{2},\quad 2\leq q\leq \infty. \eex$$
649 0
[Papers]NSE, $u_3$, Lebesgue space [Zhou-Pokorny, Nonlinearity, 2009]
$$\bex u_3\in L^p(0,T;L^q(\bbR^3)),\quad \frac{2}{p}+\frac{3}{q}=\frac{3}{4}+\frac{1}{2q},\quad \frac{10}{3}
581 0