- 「あっさり・アッサリ」| ① easily/readily/quickly/flatly (refuse) ② lightly (seasoned food, applied make-up, etc.)/plainly/simply
- 「あべこべ」| ① contrary/opposite/inverse/reverse/back-to-front
- 「あやふや」| ① uncertain/indefinite/vague/ambiguous/equivocal/dubious/doubtful/non-committal
- 「イジイジ・いじいじ」| ① hesitantly/timidly/diffidently
- 「いそいそ・イソイソ」| ① cheerfully/joyously/joyfully/happily/lightheartedly/excitedly/eagerly
- 「イチャイチャ・いちゃいちゃ」| ① making out/necking/getting handsy/canoodling/being lovey-dovey/getting affectionate (with each other)/romantic play/fondling
- 「うじうじ・ウジウジ」| ① indecisively/hesitantly/irresolutely/wishy-washily
- 「うじゃうじゃ・ウジャウジャ」| ① in swarms/in clusters ② tediously/slowly
- 「うずうず・ウズウズ」| ① itching to do something/impatient/sorely tempted/eager
- 「うぞうぞ」| ① irrepressibly aroused (esp. sexually)/stimulated
| #!/usr/bin/env node | |
| const fs = require('fs'); | |
| const path = require('path'); | |
| const readline = require('readline'); | |
| async function findJsonlFile(uuid) { | |
| const projectsDir = path.expandUser('~/.claude/projects'); | |
| function searchDir(dir) { |
| % Copyright (C) 2004 Daniel Gunyan | |
| % | |
| % This program is free software; you can redistribute it and/or modify it under | |
| % the terms of the GNU General Public License as published by the Free Software | |
| % Foundation; either version 3 of the License, or (at your option) any later | |
| % version. | |
| % | |
| % This program is distributed in the hope that it will be useful, but WITHOUT | |
| % ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| % FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more |
| import unittest | |
| import numpy as np | |
| import numpy.linalg as linalg | |
| def makeUnit(x): | |
| """Normalize entire input to norm 1. Not what you want for 2D arrays!""" | |
| return x / linalg.norm(x) |
Get the following:
- a Crunchyroll account (though they let you watch/download some videos without an account, at 480p),
- the latest youtube-dl (
brew upgrade youtube-dl), - your browser’s user agent,
- your Crunchyroll cookies (cookie.txt export for Chrome is handy) into a
cookies.txtfile.
Then,
| #include <math.h> | |
| extern float RNOR; // Normal random variable | |
| extern float UNI; // Uniform random variable | |
| float rgama(float a) { | |
| float d, c, x, v, u; | |
| d = a - 1. / 3.; | |
| c = 1. / sqrt(9. * d); | |
| for (;;) { |
I’m not very familiar with the aviation jargon (see FAA’s ADS-B FAQ), but ADS-B is a next-gen system where aircraft are equipped with transponders that periodically broadcast their own positions and receive the reports from both other aircraft (direct air-to-air) as well as air-traffic control (ATC) ground transmitters.
There are two separate ADS-B radio bands: the commercial aviation (CA) is at 1090 MHz while the general aviation (GA) is at 978 MHz. If I can be permitted a gross generalization—the former corresponds to big commercial jets and the latter to small private aircraft.
Because ADS-B is designed to democratize airspace situational awareness (in contrast to the older setup, like from films, where a central air-traffic controller is coordinating all these aircraft that can’t see each other), we can buy cheap RF receivers to pick up and decode the messages being broadcast by aircraft and ground towers to get our own picture of the
| Emoji | en | fr | es | zh | ja | ar | id |
|---|---|---|---|---|---|---|---|
| 🏟 | stadium | stade | estadio | 体育馆 | 競技場 | إِسْتادِ | stadion |
| 🏛 | classical building | monument classique | edificio clásico | 古典建筑 | 歴史的な建物 | مَبْنَى أَثَرَيَّ | bangunan klasik |
| 🏗 | building construction | construction d’un bâtiment | construcción | 施工 | 建設中 | إِنْشاءاتٍ | konstruksi bangunan |
| 🧱 | brick | brique | ladrillo | 砖 | れんが | طَوَّبَهُ | batu bata |
| 🪨 | rock | rocher | piedra | 岩yán< |
| from numpy import linalg as la | |
| import numpy as np | |
| def nearestPD(A): | |
| """Find the nearest positive-definite matrix to input | |
| A Python/Numpy port of John D'Errico's `nearestSPD` MATLAB code [1], which | |
| credits [2]. |
| """ | |
| Overlap-save approach to fast-convolution. | |
| This script shows how to use | |
| - one long FFT, | |
| - several short FFTs (overlap-save, or overlap-discard), | |
| - and `numpy.convolve` | |
| to achieve the same end: linear convolution. (I don't like overlap-add so that's not included.) |