確　　率　　　　人

How to check the battery's status on the terminal (Linux)

See this page of askubuntu: https://askubuntu.com/questions/69556/how-do-i-check-the-batterys-status-via-the-terminal

確率論的野鳥（2023/10/9現在）

自分の.emacsの野鳥設定部分のうち数学記号部分のみを記しておく．ただし，多分に確率論風．

(setq YaTeX-math-sign-alist-private
 '(
;;;   ("q"         "Q"          "(Q)")
;;;   ("z"         "Z"          "ZZ")
;;;   ("t"         "text"          "text")
   ("bb"        "mathbb"        "\mathbb{}")
   ("mb"        "mathbf"        "\mathbf{}")
   ("mc"        "mathcal"       "\mathcal{}")
   ("qu"        "quad"          "__")
   ("qq"        "qquad"         "____")
   ("ls"        "varlimsup"     "___\nlim")
   ("li"        "varliminf"     "lim\n---")
   ("il"        "varinjlim"     "lim\n-->")
   ("pl"        "varprojlim"    "lim\n<--")
   ("ae"        "textrm{ a.e. }"  "a.e.")
   ("as"        "textrm{ a.s. }"  "a.s.")
   ("qe"        "textrm{ q.e. }"  "q.e.")
   ("st"        "textrm{ s.t. }"  "s.t.")
   ("capa"      "textrm{Cap}"   "Cap")
   ("supp"      "textrm{supp }" "supp ")
   ("Li"        "lim"           "lim")
   ("limi"      "liminf"        "liminf")
   ("lims"      "limsup"        "limsup")
   ("pi"        "prod"          "Π")
   ("U"         "bigcup"        "∪")
   ("UU"        "bigcap"        "∩")
   ("/o"        "emptyset"      "Φ")
   ("bigop"     "bigoplus"      "_\n(+)~")
   ("bigot"     "bigotimes"     "_\n(x)\n ~")
   ))

When you would like to search all pdf documents under the particular directory (e.g. "~/pqr") for the pdf file containing the sequence "abcd", you should use the command pdfgrep on terminal.

0. Download and install pdfgrep. If you use Arch Linux, then you should type as follows.

$ sudo pacman -S pdfgrep

1. Move to the directory "pqr".

$ mv ~/pqr

2. Use pdfgrep.

$ pdfgrep -nHm 10 abcd ./*.pdf

Xfce@Archlinux@ThinkPadX220iで外部接続キーボード(HHKB for Mac)のキーアサインがずれる件について

1. 左上のメニューから，設定>キーボード>レイアウト

2. 「システムのデフォルトを使用する」をオフにし，

3. 自分が外部接続したキーボードを選ぶ．

来年の県民手帳

タイトルの件，千葉県にしました．

Haruhi-sama gave us a hard problem...

The Haruhi problem is to find the shortest string containing all permutations of \( n \) symbols. If \( n = 2 \), then the Haruhi problem is easy: the shortest string is "121" or "212". However, if \( n \geq 3 \), then the problem is messy.

See also:
Superpermutation - Wikipedia.