[B! math] kenzan8000のブックマーク

kenzan8000 id:kenzan8000

mathに関するkenzan8000のブックマーク (40)

Episode #4: Algebraic Data Types
kenzan8000 2021/03/02
Algebraic Data Types make the data combination much simpler and less number of cases.

swift

programming

data structure

math
リンク
Slippy map tilenames - OpenStreetMap Wiki
This article describes the file naming conventions for the Slippy Map application. Tiles are 256 × 256 pixel PNG files Each zoom level is a directory, each column is a subdirectory, and each tile in that column is a file Filename(url) format is /zoom/x/y.png The slippy map expects tiles to be served up at URLs following this scheme, so all tile server URLs look pretty similar.
kenzan8000 2021/01/03
conversion between map tile and bounding box.

map

algorithm

math
リンク
Programming Anime: Floyd's Algorithm Explained
kenzan8000 2020/07/06
floyd's algorithm

data structure

algorithm

math

computer science
リンク
Gift Wrapping Algorithm (Convex Hull)
kenzan8000 2020/06/08
Gift wrapping algorithm is an algorithm finding points wrapping all the population of random distributed points.

math

algorithm

convex hull
リンク
Proving Pick's Theorem | Infinite Series
kenzan8000 2020/05/28
Pick's Theorem represents the area of polygon whose vertices are on the integer lattice is given by the formula Area = i + b/2 - 1. (i: number of lattice in the polygon, b: number of vertices on the edges)

pick's theorem

algorithm

math
リンク
What is a Bipartite Graph? | Graph Theory
kenzan8000 2020/05/20
Bigraph (aka BIpartite Graph) is a graph that can divide the nodes into two sets the every node edge connects from set A to set B.

bigraph

graph

data structure

algorithm

math

computer science
リンク
Fourier Series
kenzan8000 2020/05/02
math

fourier transform
リンク
【大学数学】フーリエ変換の気持ち【解析学】
文理融合のボケ動画の内容に関する質問はコメント欄へどうぞ。また、今までの質問についての回答をまとめたQ&Aは固定コメントにあります ---------------------------------------------------------------------------------------------------------------- 『フーリエ変換』について詳しいおすすめの参考書はこちら「マンガでわかるフーリエ解析」 https://amzn.to/2J3bNJz →美少女見てるうちに読み終わる。(なのに内容がすばらしいです) 「フーリエ解析 (理工系の数学入門コース 6)」 https://amzn.to/2IgkTl0 →しっかり勉強する人はこれ。解析学特有の数学的に込み入った話をうまく避けながら一通りフーリエ解析学を勉強することができる -------
kenzan8000 2020/05/02
math

fourier transform
リンク
フーリエ変換でわかること
ちょっと背伸びした解説。何かあれば教えてください。グラフはこちら↓ https://www.geogebra.org/m/tkbv7ygk 式変形チャンネルでは、いろいろな数学を勉強するために、毎日動画をアップしています。
kenzan8000 2020/05/02
math

fourier transform

euler formula

additional theorem

odd function

even function
リンク
オイラーの公式、オイラーの等式
kenzan8000 2020/05/02
math

euler formula
リンク
加法定理（証明）
kenzan8000 2020/05/02
math

additional theorem
リンク
Fermat primality test
kenzan8000 2020/04/29
repeating random primary test many times makes the result PROBABLY right. a^(p-1) mod p = 1 is always satisfied if p is prime. (a is a random number.) use the calculation for the test. the number of steps doesn't result in so many times but you can know if the number is PROBABLY prime or not.

math

statistics

computer science

algorithm

test
リンク
Summary (what's next?) | Journey into cryptography | Computer Science | Khan Academy
kenzan8000 2020/04/28
RSA -> easy to generate public key by two prime numbers multiplications but hard to reverse.also, hard to generate two random prime numbers. there is always limitation of computation time and memory use.

cryptography

rsa

math

computer science

algorithm
リンク
Primality test with sieve | Journey into cryptography | Computer Science | Khan Academy
kenzan8000 2020/04/28
Trial division using sieve helps you decrease number of trials by traversing only prime numbers (using Sieve of Eratosthenes) but there is still memory usage issue because the list of prime numbers is too large.

math

algorithm

data structure

computer science
リンク
Sieve of Eratosthenes | Journey into cryptography | Computer Science | Khan Academy
kenzan8000 2020/04/28
Sieve of Eratosthenes is a simple and elegant algorithm that allows us to generate a list of primes of N.

math

algorithm

computer science
リンク
The Euclidean Algorithm (article) | Khan Academy
kenzan8000 2020/04/27
Euclidean Algorithm is an efficient algorithm calculating largest integer that divides both A and B. GCD(A,B) = GCD(B,R), GCD(A,0)=A, A = B⋅Q + R; e.g. A=78, B=36, 78 = 36 * 2 + 6, GCD(78,36)=GCD(36,6); A=36, B=6, 36 = 6 * 6 + 0, GCD(36,6)=GCD(6,0); A=6, B=0, GCD(6,0)=6; GCD(78,36) = 6

math

algorithm

computer science
リンク
Fast modular exponentiation (article) | Khan Academy
kenzan8000 2020/04/26
How can we calculate A^B mod C quickly for any B? e.g. 5^117 mod 19; 117 = 0b1110101; 117 = 2^6+2^5+2^4+2^2+2^0 = 64+32+16+4+1; 5^117 = (5^64+5^32+5^16+5^4+5^1); 5^117 mod 19 = (5^1*5^4*5^16*5^32*5^64) mod 19;

math

algorithm

computer science

binary
リンク
Modular exponentiation (article) | Khan Academy
kenzan8000 2020/04/26
use divide and conquer strategy for making calculation faster. e.g. 2^90 = 2^50 * 2^40; congruence modulo: A≡B (mod C), equivalence: A mod C=B mod C, (A + B) mod C = (A mod C + B mod C) mod C, (A * B) mod C = (A mod C * B mod C) mod C, A^B mod C = ( (A mod C)^B ) mod C

math

algorithm

computer science
リンク
Diffie-hellman key exchange | Journey into cryptography | Computer Science | Khan Academy
kenzan8000 2020/04/25
encryption used shared private key and public keys and discrete logarithm problem. easy to perform between Alice and Bob but hard for Eve to reverse because so many numbers of trial are needed to reverse.

cryptography

computer science

information

discrete logarithm

math
リンク
Android OpenGLES 2 ray picking from touch coordinates, unprojecting calculation slightly off
kenzan8000 2019/08/15
Intersection test for ray picking

android

java

opengl

math
リンク
1 2 次のページ

お知らせ

もっと読む

公式Twitter

@HatenaBookmark
リリース、障害情報などのサービスのお知らせ
@hatebu
最新の人気エントリーの配信

キーボードショートカット一覧

j次のブックマーク

k前のブックマーク

lあとで読む

eコメント一覧を開く

oページを開く

設定を変更しましたx