Just found that open-source apps on my phone app page are more than two times the number of closed-source apps.
| GitHub | https://github.com/Willie169 |
Willie Shen
@willie_shen
- 16 Followers
- 169 Following
- 198 Posts
nixCraft 🐧Microsoft’s open source tools were hacked to steal passwords of AI developers. Microsoft has suspended access to dozens of its open source GitHub projects after hackers breached them to inject password-stealing malware. The affected projects primarily include tools for Azure cloud services and AI development apps like Claude Code, Gemini's CLI, and VS Code
https://cloudsmith.com/blog/miasma-worms-path-of-destruction
\DeclareDocumentCommand\thera{}{\theta}
\DeclareDocumentCommand\lamdba{}{\lambda}
\DeclareDocumentCommand\lqmbda{}{\lambda}
\DeclareDocumentCommand\lqmdba{}{\lambda}
\DeclareDocumentCommand\lamdba{}{\lambda}
\DeclareDocumentCommand\lqmbda{}{\lambda}
\DeclareDocumentCommand\lqmdba{}{\lambda}
(3/3)
\[\mu(t)=e^{\int\lambda\dd{t}}=e^{\lambda t}\]
\[e^{\lambda t}p_{n+1}(t)=\int\frac{\lambda(\lambda t)^n}{n!}\dd{t}=\frac{(\lambda t)^{n+1}}{(n+1)!}\]
\[p_{n+1}(t)=\frac{(\lambda t)^{n+1}e^{-\lambda t}}{(n+1)!}\]
\[\mu(t)=e^{\int\lambda\dd{t}}=e^{\lambda t}\]
\[e^{\lambda t}p_{n+1}(t)=\int\frac{\lambda(\lambda t)^n}{n!}\dd{t}=\frac{(\lambda t)^{n+1}}{(n+1)!}\]
\[p_{n+1}(t)=\frac{(\lambda t)^{n+1}e^{-\lambda t}}{(n+1)!}\]
(2/3)
\[p_1'(t)=-\lambda p_1(t)+\lambda e^{-\lambda t}\]
\[\mu(t)=e^{\int\lambda\dd{t}}=e^{\lambda t}\]
\[e^{\lambda t}p_1(t)=\lambda t\]
\[p_1(t)=\lambda te^{-\lambda t}\]
Assume
\[p_k(t)=\frac{(\lambda t)^ke^{-\lambda t}}{k!}.\]
Prove by mathematical induction. It holds for $k=0$ and $1$. Suppose it holds for $k\in\bbZ\cap[0,n]$. For $k=n+1$,
\[p_{n+1}'(t)=-\lambda p_{n+1}(t)+\frac{\lambda(\lambda t)^ne^{-\lambda t}}{n!}\]
\[p_1'(t)=-\lambda p_1(t)+\lambda e^{-\lambda t}\]
\[\mu(t)=e^{\int\lambda\dd{t}}=e^{\lambda t}\]
\[e^{\lambda t}p_1(t)=\lambda t\]
\[p_1(t)=\lambda te^{-\lambda t}\]
Assume
\[p_k(t)=\frac{(\lambda t)^ke^{-\lambda t}}{k!}.\]
Prove by mathematical induction. It holds for $k=0$ and $1$. Suppose it holds for $k\in\bbZ\cap[0,n]$. For $k=n+1$,
\[p_{n+1}'(t)=-\lambda p_{n+1}(t)+\frac{\lambda(\lambda t)^ne^{-\lambda t}}{n!}\]
(1/3)
Let $N(t)$ denotes the number of events occuring in $[0,t]$, and let $p_k(t)=P(N(t)=k)$.
\[\lim_{h\to0^+}p_0(h)=1\]
\[\lim_{h\to0^+}\frac{p_1(h)}{h}=\lambda\]
\[\lim_{h\to0^+}\frac{p_k(h)}{h}=0,\quad k\in\bbZ\cap[2,\infty)\]
\[\ba
p_k'(t)&=\lim_{h\to0}\frac{p_k(t+h)-p_k(t)}{h}\\
&=\frac{p_k(t)(1-\lambda h)+p_{k-1}(t)(\lambda h)-p_k(t)}{h}\\
&=-\lambda p_k(t)+\lambda p_{k-1}(t)
\ea\]
\[p_0'(t)=-\lambda p_0(t)\]
\[p_0(t)=e^{-\lambda t}\]
Let $N(t)$ denotes the number of events occuring in $[0,t]$, and let $p_k(t)=P(N(t)=k)$.
\[\lim_{h\to0^+}p_0(h)=1\]
\[\lim_{h\to0^+}\frac{p_1(h)}{h}=\lambda\]
\[\lim_{h\to0^+}\frac{p_k(h)}{h}=0,\quad k\in\bbZ\cap[2,\infty)\]
\[\ba
p_k'(t)&=\lim_{h\to0}\frac{p_k(t+h)-p_k(t)}{h}\\
&=\frac{p_k(t)(1-\lambda h)+p_{k-1}(t)(\lambda h)-p_k(t)}{h}\\
&=-\lambda p_k(t)+\lambda p_{k-1}(t)
\ea\]
\[p_0'(t)=-\lambda p_0(t)\]
\[p_0(t)=e^{-\lambda t}\]
不知道KDE錢包有沒有正常點了，不過應該是我當時不會用，反正作為KDE Plasma支持者這是我唯一disable掉裝gnome-keyring代替的部件
赫然意識到我在桌面上dump無數.desktop好像真的點過的也沒幾個，常用的都在工具列了，少用的通常也是搜尋，或許該考慮清空桌面然後放個wallpaper