[B! ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ][math] TaKUMAã®ãƒ

TaKUMA id:TaKUMA

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨mathã«é–¢ã™ã‚‹TaKUMAã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (17)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

å›ºæœ‰å€¤ãƒ»å›ºæœ‰ãƒ™ã‚¯ãƒˆãƒ«ã£ã¦ä½•ã«ä½¿ã†ã®ï¼Ÿ
ãµã¨ã€å›ºæœ‰å€¤ãƒ»å›ºæœ‰ãƒ™ã‚¯ãƒˆãƒ«ã£ã¦ä½•ãŒãã‚“ãªã«å¬‰ã—ã„ã®ã‹ï¼Ÿä½•ã®å½¹ã«ç«‹ã¤ã®ã‹ï¼Ÿã¨æ€ã£ã¦ã„ã‚ã„ã‚èª¿ã¹ã¦ã„ãŸã€‚ï¼ˆå¯¾è§’åŒ–ã—ã¦ã¹ãä¹—è¨ˆç®—ãŒé€Ÿãã§ãã¾ã™ã ã‘ã ã¨ã€ã¡ã‚‡ã£ã¨å‹‰å¼·ã™ã‚‹å‹•æ©Ÿã¥ã‘ã¨ã—ã¦ã¯å¼±ã„ã€‚ã€‚ï¼‰ãã†ã„ãˆã°ã€ä¸€å¹´å‰ãã‚‰ã„ã«èªã‚“ã page rankã®è«–æ–‡ã«å›ºæœ‰å€¤ãƒ»å›ºæœ‰ãƒ™ã‚¯ãƒˆãƒ«ãŒä½¿ã‚ã‚Œã¦ã„ãŸã®ã‚’æ€ã„å‡ºã—ãŸã®ã§ã€ã“ã‚Œã‚’ã¡ã‚‡ã“ã£ã¨ç´¹ä»‹ã€‚ï¼ˆè§£é‡ˆã«é–“é•ã„ãªã©ã‚ã‚Šã¾ã—ãŸã‚‰ã€ã”æŒ‡æ‘˜ãã ã•ã„ã€‚ï¼‰ ã¾ãšã€page rankã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦ã€‚ã“ã‚Œã¯ã€ã„ã‚ãšã¨çŸ¥ã‚ŒãŸgoogleã®æ¤œç´¢å‡¦ç†ã«ãŠã„ã¦ä¸å¿ƒçš„ãªå½¹å‰²ã‚’æžœãŸã™å‡¦ç†ã§ã™ã€‚page rankã®åŸºæœ¬çš„ãªè€ƒãˆæ–¹ã¯ã€â€ãŸãã•ã‚“ãƒªãƒ³ã‚¯ã‚’å¼µã‚‰ã‚Œã¦ã„ã‚‹ã‚µã‚¤ãƒˆã»ã©é‡è¦ãªã‚µã‚¤ãƒˆã§ã‚ã‚‹â€ã¨ã„ã†ã“ã¨ã§ã™ã€‚ã¤ã¾ã‚Šã€ãŸãã•ã‚“ãƒªãƒ³ã‚¯ã‚’å¼µã‚‰ã‚Œã¦ã„ã‚‹ã‚µã‚¤ãƒˆãŒæ¤œç´¢ã§ä¸Šä½ã«ç¾ã‚Œã¾ã™ã€‚åŠ ãˆã¦ã€åŒã˜ãƒªãƒ³ã‚¯ã‚’å¼µã‚‰ã‚Œã¦ã„ã‚‹ã§ã‚‚ã€é‡è¦ãªãƒšãƒ¼ã‚¸/äººæ°—ã®ã‚ã‚‹ãƒšãƒ¼ã‚¸ã‹ã‚‰ãƒªãƒ³ã‚¯ã‚’å¼µã‚‰ã‚Œã¦ã„ã‚‹ã®ã‹ã€é‡è¦ã§ãªã„/äººæ°—ã§ãª
TaKUMA 2012/07/07
ã©ã‚“ã ã‘Aã§ã‹ã„ã‚“ã‚„ã‚...

è«–æ–‡

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

math

Google
ãƒªãƒ³ã‚¯
Algorithm that Solves 3-SAT in Polynomial Time
The question of whether the complexity class P is equal to the complexity class NP has been a seemingly intractable probl em for over 4 decades. It has been clear that if an algorithm existed that would solve the probl ems in the NP class in polynomial time then P would equal NP. However, no one has yet been able to create that algorithm or to successfully prove that such an algorithm cannot exist.
TaKUMA 2011/10/11
[P=NP?]"The algorithm that will be presented in this paper runs in polynomial time and solves the 3-satisfiability or 3-SAT problem, which has been proven to be NP-complete, thus indicating that P = NP."

SAT

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

math

Logic
ãƒªãƒ³ã‚¯
ã‚¢ã‚½ã‚·ã‚¨ãƒ¼ã‚·ãƒ§ãƒ³åˆ†æžï¼ˆã‚ãã—ãˆãƒ¼ã—ã‚‡ã‚“ã¶ã‚“ã›ãï¼‰
POSãƒ‡ãƒ¼ã‚¿ï¼ˆæ³¨1ï¼‰ãªã©ã®å·¨å¤§ãªãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã‹ã‚‰ã€ä¾¡å€¤ã‚ã‚‹ã‚¢ã‚½ã‚·ã‚¨ãƒ¼ã‚·ãƒ§ãƒ³ãƒ»ãƒ«ãƒ¼ãƒ«ï¼ˆæ³¨2ï¼‰ã‚’æŠ½å‡ºã™ã‚‹ãƒ‡ãƒ¼ã‚¿ãƒžã‚¤ãƒ‹ãƒ³ã‚°ï¼ˆæ³¨3ï¼‰ãƒ»ãƒ†ã‚¯ãƒ‹ãƒƒã‚¯ã€‚ãƒžãƒ¼ã‚±ãƒƒãƒˆãƒã‚¹ã‚±ãƒƒãƒˆåˆ†æžï¼ˆæ³¨4ï¼‰ã«åˆ©ç”¨ã•ã‚Œã‚‹ã€‚ ã‚¢ã‚½ã‚·ã‚¨ãƒ¼ã‚·ãƒ§ãƒ³ãƒ»ãƒ«ãƒ¼ãƒ«æŠ½å‡ºï¼ˆassociation rule extractionï¼‰ã€ã‚¢ã‚½ã‚·ã‚¨ãƒ¼ã‚·ãƒ§ãƒ³ãƒ»ãƒ«ãƒ¼ãƒ«ãƒ»ãƒžã‚¤ãƒ‹ãƒ³ã‚°ï¼ˆassociation rule miningï¼‰ã€ã‚¢ã‚½ã‚·ã‚¨ãƒ¼ã‚·ãƒ§ãƒ³ãƒ»ãƒ«ãƒ¼ãƒ«ç™ºè¦‹ï¼ˆassociation rule discoveryï¼‰ãªã©ã¨ã‚‚ã„ã†ã€‚ å°å£²æ¥ã®POSã‚·ã‚¹ãƒ†ãƒ ã§ã¯ã€æ—¥ã€…å¤§é‡ã®ãƒˆãƒ©ãƒ³ã‚¶ã‚¯ã‚·ãƒ§ãƒ³ãƒ‡ãƒ¼ã‚¿ãŒç”Ÿã¿å‡ºã•ã‚Œã¦ã„ã‚‹ã€‚ã“ã®ä¸ã«ã¯ã€ã€Œãƒ‘ãƒ³ã¨ãƒã‚¿ãƒ¼ã‚’è³¼å…¥ã—ãŸå–å¼•ã®90ï¼…ãŒãƒŸãƒ«ã‚¯ã‚‚è³¼å…¥ã—ã¦ã„ã‚‹ã€ã¨ã„ã£ãŸæ³•å‰‡ãŒç§˜ã‚ã‚‰ã‚Œã¦ã„ã‚‹ãŒã€ä¸è¦æ¨¡ã®å°å£²åº—èˆ—ã§ã‚‚å•†å“ã‚¢ã‚¤ãƒ†ãƒ æ•°ã¯æ•°åƒã‹ã‚‰æ•°ä¸‡ã«åŠã³ã€ãã®çµ„ã¿åˆã‚ã›ï¼ˆã‚¢ã‚½ã‚·ã‚¨ãƒ¼ã‚·ãƒ§ãƒ³ãƒ»ãƒ«ãƒ¼ãƒ«ï¼‰ã¯ç„¡æ•°ã«ã‚ã‚‹ã€‚ãã®ãŸã‚ã€ã©ã®çµ„ã¿åˆã‚ã›ãŒä¾¡å€¤ã‚ã‚‹æ³•å‰‡ã§ã‚
TaKUMA 2011/09/06
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

Analysis

math
ãƒªãƒ³ã‚¯
åŠ›å¦ãƒ¢ãƒ‡ãƒ« (ã‚°ãƒ©ãƒ•æç”»ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ) - Wikipedia
åŠ›å¦ãƒ¢ãƒ‡ãƒ«ã«ã‚ˆã‚‹ã€wiki ãƒšãƒ¼ã‚¸ã®ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã®å¯è¦–åŒ–ã€‚ï¼ˆè¾ºã¯ãƒªãƒ³ã‚¯ã‚’è¡¨ã™ï¼‰ åŠ›å¦ãƒ¢ãƒ‡ãƒ«ï¼ˆã‚ŠããŒããƒ¢ãƒ‡ãƒ«ï¼‰ã«ã‚ˆã‚‹ã‚°ãƒ©ãƒ•æç”»ï¼ˆåŠ›æŒ‡å‘ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ï¼‰ã¯ã€ã‚°ãƒ©ãƒ•ã‚’ç¾Žã—ãæç”»ã™ã‚‹ãŸã‚ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®ä¸€ã¤ã§ã‚ã‚‹ã€‚ ã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ã€ã‚°ãƒ©ãƒ•ã®ãƒŽãƒ¼ãƒ‰ã‚’2æ¬¡å…ƒç©ºé–“ã‚„3æ¬¡å…ƒç©ºé–“ã«é…ç½®ã—ã¦ã€è¾ºã®é•·ã•ã‚’ã»ã¼ç‰ã—ã„é•·ã•ã«ã—ã€ã‚°ãƒ©ãƒ•ã®è¾ºãŒã§ãã‚‹ã ã‘äº¤å·®ã—ãªã„ã‚ˆã†ã«ã™ã‚‹ã“ã¨ã‚’ç›®çš„ã«ã—ã¦ã„ã‚‹ã€‚ ã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã¯ã€ã‚°ãƒ©ãƒ•ã®é ‚ç‚¹ã¨è¾ºã«ä»®æƒ³çš„ãªåŠ›ã‚’å‰²ã‚Šå½“ã¦ã€åŠ›å¦çš„ã‚¨ãƒãƒ«ã‚®ãƒ¼ã®ä½Žã„å®‰å®šçŠ¶æ…‹ã‚’æŽ¢ã™ã“ã¨ã§ã€ã“ã®ç›®çš„ã‚’é”æˆã—ã¦ã„ã‚‹ã€‚ã‚‚ã£ã¨ã‚‚ç›´æˆªçš„ãªãƒ¢ãƒ‡ãƒ«ã§ã¯ã€ãã‚Œãžã‚Œã®è¾ºã‚’ãƒ•ãƒƒã‚¯ã®æ³•å‰‡ã«ã—ãŸãŒã†ã°ãã¨ã¿ãªã—ã€ãã‚Œãžã‚Œã®é ‚ç‚¹ã‚’ã‚¯ãƒ¼ãƒãƒ³ã®æ³•å‰‡ã«ã—ãŸãŒã†é›»è·ã‚’ã‚‚ã¤ç²’åã¨ã¿ãªã™ã€‚ ãã—ã¦ã€ãã®åŠ›å¦ç³»ã®æŒ™å‹•ã‚’ã‚·ãƒŸãƒ¥ãƒ¬ãƒ¼ãƒˆã—ã€å¼¾æ€§åŠ›ã‚„é™é›»æ°—åŠ›ãŒç²’åã‚’è¿‘ã¥ã‘ãŸã‚Šé ã–ã‘ãŸã‚Šã™ã‚‹ã‚ˆã†ã™ã‚’è¨ˆç®—ã™ã‚‹ã€‚ç²’åãŒå®‰å®šãªé…ç½®ã«ãªã‚Šã€ä½ç½®ãŒå¤‰åŒ–ã—ãªããªã‚‹ã¾
TaKUMA 2011/08/28
Force Directed Graph Layout.

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

math

Programming
ãƒªãƒ³ã‚¯
ã‚¨ãƒƒã‚·ãƒ£ãƒ¼ã£ã½ã„çµµã‚’ç”Ÿæˆã™ã‚‹ã€Œã‚¨ãƒƒã‚·ãƒ£ãƒ¼ãã‚“ã€ã‚’ä½œã£ã¦ã¿ãŸã€‚
ã‚¨ãƒƒã‚·ãƒ£ãƒ¼ã£ã¦ã„ã†ç”»å®¶ã¯çŸ¥ã£ã¦ã„ã¾ã™ã‹ï¼Ÿåˆ†ã‹ã‚“ãªã„äººã®ãŸã‚ã«èª¬æ˜Žã—ã¾ã™ã¨ã€ã“ã‚“ãªæ„Ÿã˜ã®ãµã—ãŽãƒ¼ãªçµµã‚’æ›¸ã„ã¦ã„ã‚‹äººã§ã™ã€‚åå‰ã¯çŸ¥ã‚‰ãªãã¦ã‚‚ä¸€åº¦ã¯è¦‹ãŸã“ã¨ãŒã‚ã‚‹ã®ã§ã¯ãªã„ã§ã—ã‚‡ã†ã‹ã€‚ ãã‚Œã§ãªã‚“ã§ã™ãŒã€é©å½“ãªç”»åƒã‹ã‚‰ãªã‚“ã‹ã‚¨ãƒƒã‚·ãƒ£ãƒ¼ã£ã½ã„ãµã—ãŽãªç”»åƒã‚’ç”Ÿæˆã™ã‚‹ãƒ•ã‚£ãƒ«ã‚¿ã€Œã‚¨ãƒƒã‚·ãƒ£ãƒ¼ãã‚“ï¼ˆä»®ç§°ï¼‰ã€ã‚’Python Imaging Library(PIL)ã§ä½œã£ã¦ã¿ã¾ã—ãŸã€‚ã“ã‚Œã‚’ä½¿ãˆã°ã©ã‚“ãªç”»åƒã‚‚ã‚¨ãƒƒã‚·ãƒ£ãƒ¼ã£ã½ã„ä¸–ç•Œã«ã”æ‹›å¾…ã§ã™ã€‚ã‚½ãƒ¼ã‚¹ã¯è¿‘ã€…å…¬é–‹ã—ã¾ã™ã€‚ è¿½è¨˜(09/24) ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ã‚’ã‚¢ãƒƒãƒ—ãƒãƒ¼ãƒ‰ã—ã¾ã—ãŸã€‚subversionã§ç®¡ç†ã•ã‚Œã¦ã¾ã™ã®ã§ã€ svn checkout http://svn.coderepos.org/share/lang/python/escher Somewhere ã§ãƒã‚§ãƒƒã‚¯ã‚¢ã‚¦ãƒˆã—ã¦ãã ã•ã„ã€‚ ãŸã¨ãˆã°ã€ã“ã‚“ãªæ„Ÿã˜ã®ã‚¤ãƒ©ã‚¹ãƒˆã«ã‚¨ãƒƒã‚·ãƒ£ãƒ¼ãã‚“ã‚’é©ç”¨ã•ã›ã¦ã¿ã‚‹ã¨â€¦ ã“ã‚“ãª
TaKUMA 2011/08/24
art

math

Python

Programming

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
The mathematics behind the Droste effect. This article uses jsMath which requires Java.
The mathematics behind the Droste effect. This article uses jsMath which requires Java.Posted on 2008-12-26 21:20 A logarithmic image transf ormation Jos Leys AbstractÂ : An image transf ormation method, first used by the artist M.C. Escher, and described by Lenstra et al. is generalized for use in a graphics program. Figure 1: Escher's "Printgallery"[1] In 1956, Maurits Cornelis Escher completed a d
TaKUMA 2011/08/24
art

math

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
Prime numbers - HaskellWiki
In mathematics, amongst the natural numbers greater than 1, a prime number (or a prime) is such that has no divisors other than itself (and 1). This means that it cannot be represented as a product of any two of such numbers. Prime Number Resources At Wikipedia: Prime Numbers Sieve of Eratosthenes HackageDB packages: arithmoi: Various basic number theoretic functions; efficient array-based sieves,
TaKUMA 2011/08/16
Haskell

Programming

Tips

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

math
ãƒªãƒ³ã‚¯
Non-negative Matrix Factorizationï¼ˆéžè² å€¤è¡Œåˆ—å› ååˆ†è§£ï¼‰ - ã‚ã‚‰ã³ãæ—¥è¨˜
ã“ã®è¨˜äº‹ã¯ abicky.net ã® NMF: Non-negative Matrix Factorizationï¼ˆéžè² å€¤è¡Œåˆ—å› ååˆ†è§£ï¼‰ ã«ç§»è¡Œã—ã¾ã—ãŸ
TaKUMA 2011/02/12
math

NMF

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
ãƒãƒ©ãƒ¼ãƒ‰ãƒ»ãƒãƒ¼ç´ å› æ•°åˆ†è§£æ³• - Wikipedia
ãƒãƒ©ãƒ¼ãƒ‰ãƒ»ãƒãƒ¼ç´ å› æ•°åˆ†è§£æ³•ï¼ˆè‹±: Pollard's rho algorithmï¼‰ã¯ã€ç‰¹æ®Šç”¨é€”ã®ç´ å› æ•°åˆ†è§£ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€‚1975å¹´ã€ã‚¸ãƒ§ãƒ³ãƒ»ãƒãƒ©ãƒ¼ãƒ‰ï¼ˆè‹±èªž: John Pollardï¼‰ãŒç™ºæ˜Žã—ãŸã€‚åˆæˆæ•°ã‚’ç´ å› æ•°ã«åŠ¹çŽ‡çš„ã«åˆ†è§£ã™ã‚‹ã€‚ ä¸€èˆ¬ã«ç´ å› æ•°åˆ†è§£ã¯ã€å¯¾è±¡ã®æ•° n ã«ã¤ã„ã¦ã€ãã®å¹³æ–¹æ ¹ä»¥ä¸‹ã®å…¨ã¦ã®ç´ æ•°ã«ã¤ã„ã¦ n ã‚’å‰²ã£ã¦ã¿ã‚‹ã€‚ã—ã‹ã—ã€ã“ã‚Œã¯ n ãŒå¤§ãã„å ´åˆã«å¯¾è±¡ã¨ãªã‚‹å…¨ã¦ã®ç´ æ•°ãŒæ˜Žã‚‰ã‹ã§ãªã„ã¨ã„ã†å•é¡ŒãŒç”Ÿã˜ã‚‹ã€‚ãƒãƒ©ãƒ¼ãƒ‰ãƒ»ãƒãƒ¼ç´ å› æ•°åˆ†è§£æ³•ã¯ã€ãã®ã‚ˆã†ãªå ´åˆã«å¤§ããªç´ å› æ•°ã‚’ç¢ºçŽ‡çš„ã«æŽ¢ã™ä¹±æŠžã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã‚ã‚‹ã€‚ ã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ãƒ•ãƒã‚¤ãƒ‰ã®å¾ªç’°æ¤œå‡ºæ³•ã«åŸºã¥ã„ã¦ãŠã‚Šã€ã¾ãŸ2ã¤ã®æ•° x ã¨ y ãŒ p ã§å‰²ã‚Šåˆ‡ã‚Œã‚‹ã«ã¯ã€ãƒ©ãƒ³ãƒ€ãƒ ã« å€‹ã®æ•°ã‚’é¸ã‚“ã ã¨ãåŠåˆ†ä»¥ä¸Šã®ç¢ºçŽ‡ã§å…±ã«å‰²ã‚Šåˆ‡ã‚Œã‚‹ã¨ã„ã†è¦³æ¸¬çµæžœã«åŸºã¥ã„ã¦ã„ã‚‹ï¼ˆèª•ç”Ÿæ—¥ã®ãƒ‘ãƒ©ãƒ‰ãƒƒã‚¯ã‚¹ã‚’å‚ç…§ï¼‰ã€‚p ãŒç´ å› æ•°åˆ†è§£ã—ãŸã„ n ã®ç´ å› æ•°ã§ã‚ã‚‹ã¨ãã€p ã§ ã‚‚
TaKUMA 2010/10/23
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

math
ãƒªãƒ³ã‚¯
About - Project Euler
About Project Euler What is Project Euler? Project Euler is a series of challenging mathematical/computer programming probl ems that will require more than just mathematical insights to solve. Although mathematics will help you arrive at elegant and efficient methods, the use of a computer and programming skills will be required to solve most probl ems. The motivation for starting Project Euler, and
TaKUMA 2010/10/05
Programming

math

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

Euler

å•é¡Œé›†
ãƒªãƒ³ã‚¯
ãƒžãƒ«ã‚³ãƒ•éŽç¨‹ - Wikipedia
ã“ã®è¨˜äº‹ã¯æ¤œè¨¼å¯èƒ½ãªå‚è€ƒæ–‡çŒ®ã‚„å‡ºå…¸ãŒå…¨ãç¤ºã•ã‚Œã¦ã„ãªã„ã‹ã€ä¸ååˆ†ã§ã™ã€‚ å‡ºå…¸ã‚’è¿½åŠ ã—ã¦è¨˜äº‹ã®ä¿¡é ¼æ€§å‘ä¸Šã«ã”å”åŠ›ãã ã•ã„ã€‚ï¼ˆã“ã®ãƒ†ãƒ³ãƒ—ãƒ¬ãƒ¼ãƒˆã®ä½¿ã„æ–¹ï¼‰ å‡ºå…¸æ¤œç´¢?:Â "ãƒžãƒ«ã‚³ãƒ•éŽç¨‹"Â â€“Â ãƒ‹ãƒ¥ãƒ¼ã‚¹Â Â· æ›¸ç±Â Â· ã‚¹ã‚«ãƒ©ãƒ¼Â Â· CiNiiÂ Â· J-STAGEÂ Â· NDLÂ Â· dlib.jpÂ Â· ã‚¸ãƒ£ãƒ‘ãƒ³ã‚µãƒ¼ãƒÂ Â· TWL (2018å¹´1æœˆ) ãƒžãƒ«ã‚³ãƒ•éŽç¨‹ï¼ˆãƒžãƒ«ã‚³ãƒ•ã‹ã¦ã„ã€è‹±: Markov processï¼‰ã¨ã¯ã€ãƒžãƒ«ã‚³ãƒ•æ€§ã‚’ã‚‚ã¤ç¢ºçŽ‡éŽç¨‹ã®ã“ã¨ã‚’ã„ã†ã€‚ã™ãªã‚ã¡ã€æœªæ¥ã®æŒ™å‹•ãŒç¾åœ¨ã®å€¤ã ã‘ã§æ±ºå®šã•ã‚Œã€éŽåŽ»ã®æŒ™å‹•ã¨ç„¡é–¢ä¿‚ã§ã‚ã‚‹ã¨ã„ã†æ€§è³ªã‚’æŒã¤ç¢ºçŽ‡éŽç¨‹ã§ã‚ã‚‹ã€‚ ã“ã®ã‚ˆã†ãªéŽç¨‹ã¯ä¾‹ãˆã°ã€ç¢ºçŽ‡çš„ã«ã—ã‹è¨˜è¿°ã§ããªã„ç‰©ç†ç¾è±¡ã®æ™‚é–“ç™ºå±•ã®æ§˜åã«è¦‹ã‚‰ã‚Œã‚‹ã€‚ãªãœãªã‚‰ã€ç²’åã®å°†æ¥ã®æŒ™å‹•ã¯ç¾åœ¨ã®æŒ™å‹•ã«ã‚ˆã£ã¦ã®ã¿æ±ºå®šã•ã‚Œã‚‹ãŒã€ã“ã®æ€§è³ªã¯ç³»ã®ç²’åæ•°ãŒå¤šããªã‚Šç¢ºçŽ‡è«–çš„ãªè§£æžã‚’å¿…è¦ã¨ã™ã‚‹çŠ¶æ…‹ã«ã‚‚å¼•ãç¶™ãŒã‚Œã‚‹ã‹ã‚‰ã§ã‚ã‚‹ã€‚ ãƒã‚·ã‚¢äºº
TaKUMA 2010/10/04
ç¢ºç«‹

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

math

Wikipedia
ãƒªãƒ³ã‚¯
ãªãœé–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯é‡è¦ã‹
John Hughes, Institutionen fÃ¶r Datavetenskap, Chalmers Tekniska HÃ¶gskola, 41296 GÃ¶teborg, SWEDEN. [email protected] ã“ã®æ—¥æœ¬èªžè¨³ã¯åŽŸè‘—è€…ã®æ‰¿è«¾ã‚’å¾—ã¦å±±ä¸‹ãŒã“ã“ã«å…¬é–‹ã™ã‚‹ã‚‚ã®ã§ã™ã€‚ ã“ã®è¨³æ–‡ã«ã¤ã„ã¦ã®ã€å¾¡æŒ‡æ‘˜ãªã©ã¯å±±ä¸‹ä¼¸å¤«(nobsun .at. sampou.org)ã¾ã§ãŠããŒã„ ã„ãŸã—ã¾ã™ã€‚ ç¿»è¨³æœ€çµ‚æ›´æ–°æ—¥ : 2011-09-17 åŽŸæ–‡ "Why Functional Programming Matters" æ—¥æœ¬èªžè¨³PostScript ã“ã®è«–æ–‡ã¯1984å¹´ä»¥æ¥ä½•å¹´ã‚‚ã®ã‚ã„ã Chalmerså¤§å¦ã®ãƒ¡ãƒ¢ã¨ã—ã¦å›žè¦§ã•ã‚ŒãŸã€‚ 1989å¹´ã¨1990å¹´ã«å¹¾åˆ†ã‹æ”¹è¨‚ã‚’ã—ãŸã®ãŒ[Hug89]ã¨ [Hug90]ã§ã‚ã‚‹ã€‚ã“ã®ç‰ˆã¯ã‚‚ã¨ã®Chalmerå¤§å¦ã®ãƒ¡ãƒ¢ ã®nroffåŽŸç¨¿ã‚’ã‚‚ã¨ã«
TaKUMA 2010/09/24
Programming

math

Haskell

è«–æ–‡

å¤§å¦

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
Project Euler - PukiWiki
Project Euler â€ ãƒ—ãƒã‚°ãƒ©ãƒ ã§è§£ãæ•°å¦ã®å•é¡Œé›†ã§ã™ã€‚ å…¬å¼ã‚µã‚¤ãƒˆ é©å½“ã«å’Œè¨³ã—ã¦ã¾ã™ã€‚æˆ‘ã“ãã¯ã¨æ€ã†äººã¯ãƒ©ã‚¤ã‚»ãƒ³ã‚¹ã‚’ç¢ºèªã—ãŸä¸Šã§è‡ªç”±ã«æ›¸ã„ã¦ãã ã•ã„ã€‚ â†‘
TaKUMA 2010/09/05
math

Programming

å•é¡Œé›†

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

wiki
ãƒªãƒ³ã‚¯
ã‚¨ã‚ã‚¹ãƒ‘ãƒ¼ãƒˆã‚·ã‚¹ãƒ†ãƒ - Wikipedia
ã“ã®è¨˜äº‹ã¯æ¤œè¨¼å¯èƒ½ãªå‚è€ƒæ–‡çŒ®ã‚„å‡ºå…¸ãŒå…¨ãç¤ºã•ã‚Œã¦ã„ãªã„ã‹ã€ä¸ååˆ†ã§ã™ã€‚ å‡ºå…¸ã‚’è¿½åŠ ã—ã¦è¨˜äº‹ã®ä¿¡é ¼æ€§å‘ä¸Šã«ã”å”åŠ›ãã ã•ã„ã€‚ï¼ˆã“ã®ãƒ†ãƒ³ãƒ—ãƒ¬ãƒ¼ãƒˆã®ä½¿ã„æ–¹ï¼‰ å‡ºå…¸æ¤œç´¢?:Â "ã‚¨ã‚ã‚¹ãƒ‘ãƒ¼ãƒˆã‚·ã‚¹ãƒ†ãƒ "Â â€“Â ãƒ‹ãƒ¥ãƒ¼ã‚¹Â Â· æ›¸ç±Â Â· ã‚¹ã‚«ãƒ©ãƒ¼Â Â· CiNiiÂ Â· J-STAGEÂ Â· NDLÂ Â· dlib.jpÂ Â· ã‚¸ãƒ£ãƒ‘ãƒ³ã‚µãƒ¼ãƒÂ Â· TWL (2012å¹´2æœˆ) ã‚¨ã‚ã‚¹ãƒ‘ãƒ¼ãƒˆã‚·ã‚¹ãƒ†ãƒ ï¼ˆè‹±èªž: expert systemï¼‰ã¨ã¯ã€äººå·¥çŸ¥èƒ½ç ”ç©¶ã‹ã‚‰ç”Ÿã¾ã‚ŒãŸã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã‚·ã‚¹ãƒ†ãƒ ã§ã€äººé–“ã®å°‚é–€å®¶ï¼ˆã‚¨ã‚ã‚¹ãƒ‘ãƒ¼ãƒˆï¼‰ã®æ„æ€æ±ºå®šèƒ½åŠ›ã‚’ã‚¨ãƒŸãƒ¥ãƒ¬ãƒ¼ãƒˆã™ã‚‹ã‚‚ã®ã§ã‚ã‚‹[1]ã€‚å°‚é–€å®¶ã®ã‚ˆã†ã«çŸ¥è˜ã«ã¤ã„ã¦ã®æŽ¨è«–ã«ã‚ˆã£ã¦è¤‡é›‘ãªå•é¡Œã‚’è§£ãã‚ˆã†è¨è¨ˆã•ã‚Œã¦ãŠã‚Šã€é€šå¸¸ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ã‚ˆã†ã«ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢é–‹ç™ºè€…ãŒè¨å®šã—ãŸæ‰‹ç¶šãã«å¾“ã†ã‚ã‘ã§ã¯ãªã„[2][3][4]ã€‚1970å¹´ä»£ã«äººå·¥çŸ¥èƒ½ã®ç ”ç©¶è€…ã«ã‚ˆã£ã¦é–‹ç™ºã•ã‚Œã€1980å¹´ä»£ã«ã‚ãŸã£ã¦å•†æ¥çš„ã«é©ç”¨ã•ã‚Œ
TaKUMA 2010/08/23
Programming

math

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

AI
ãƒªãƒ³ã‚¯
YouTube - ï¼’æ¬¡å…ƒãƒ•ãƒ¼ãƒªã‚¨å¤‰æ›ï¼é€†å¤‰æ›ãƒ‡ãƒ¢ Two-dimensional Fourier Transform
ï¼’æ¬¡å…ƒãƒ•ãƒ¼ãƒªã‚¨å¤‰æ›ï¼é€†å¤‰æ›ã‚’èª¬æ˜Žã™ã‚‹ãƒ“ãƒ‡ã‚ªã§ã™ã€‚æ•°å¼ã¯ç„¡ã—ã€‚ã“ã®ãƒ“ãƒ‡ã‚ªã¯ã‚‚ã£ã¨é•·ã„ï¼’ï¼—åˆ†ã®è¦–è¦šã¨è„³ã«é–¢ã™ã‚‹é«˜æ ¡ç”Ÿå‘ã‘ã‚»ãƒŸãƒŠãƒ¼ã‹ã‚‰å–ã‚Šã¾ã—ãŸã€‚å…ƒãƒ•ã‚¡ã‚¤ãƒ«ã¯ä»¥ä¸‹ã®URLã«ã‚ã‚Šã¾ã™ï¼š http://ohzawa-lab.bpe.es.osaka-u.ac.jp/ ã“ã®ãƒ“ãƒ‡ã‚ªã§ä½¿ã£ã¦ã„ã‚‹Matlab scriptã¯ä»¥ä¸‹ã®ãƒªãƒ³ã‚¯ã«ã‚ã‚Šã¾ã™ï¼š http://visiome.neuroinf.jp/modules/xoonips/detail.php?it em_id=6448 This short video explains two-dimensional Fourier transf orm and inverse transf orm using an interactive Matlab script, which is available from the above URL.
TaKUMA 2010/08/09
math

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

å‹•ç”»
ãƒªãƒ³ã‚¯
ãƒ‰ãƒãƒãƒ¼å›³ - Wikipedia
å‡ºå…¸ã¯åˆ—æŒ™ã™ã‚‹ã ã‘ã§ãªãã€è„šæ³¨ãªã©ã‚’ç”¨ã„ã¦ã©ã®è¨˜è¿°ã®æƒ…å ±æºã§ã‚ã‚‹ã‹ã‚’æ˜Žè¨˜ã—ã¦ãã ã•ã„ã€‚ è¨˜äº‹ã®ä¿¡é ¼æ€§å‘ä¸Šã«ã”å”åŠ›ã‚’ãŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚ï¼ˆ2021å¹´1æœˆï¼‰ ã“ã®è¨˜äº‹ã§ç¤ºã•ã‚Œã¦ã„ã‚‹å‡ºå…¸ã«ã¤ã„ã¦ã€è©²å½“ã™ã‚‹è¨˜è¿°ãŒå…·ä½“çš„ã«ãã®æ–‡çŒ®ã®ä½•ãƒšãƒ¼ã‚¸ã‚ã‚‹ã„ã¯ã©ã®ç« ç¯€ã«ã‚ã‚‹ã®ã‹ã€ç‰¹å®šãŒæ±‚ã‚ã‚‰ã‚Œã¦ã„ã¾ã™ã€‚ ã”å˜çŸ¥ã®æ–¹ã¯åŠ ç†ã‚’ãŠé¡˜ã„ã—ã¾ã™ã€‚ï¼ˆ2021å¹´1æœˆï¼‰ ãƒ‰ãƒãƒãƒ¼ä¸‰è§’å½¢åˆ†å‰²ã®ä¸€ä¾‹ ãƒ‰ãƒãƒãƒ¼å›³ï¼ˆãƒ‰ãƒãƒãƒ¼ãšã€è‹±èªž: Delaunay diagramï¼‰ã‚ã‚‹ã„ã¯ãƒ‰ãƒãƒãƒ¼ä¸‰è§’å½¢åˆ†å‰²ï¼ˆãƒ‰ãƒãƒãƒ¼ã•ã‚“ã‹ã£ã‘ã„ã¶ã‚“ã‹ã¤ã€éœ²: Ñ‚Ñ€Ð¸Ð°Ð½Ð³ÑƒÐ»ÑÑ†Ð¸Ñ Ð”ÐµÐ»Ð¾Ð½Ðµ, è‹±: Delaunay triangulationï¼‰ã¯ã€è·é›¢ç©ºé–“å†…ã«é›¢æ•£çš„ã«åˆ†å¸ƒã—ãŸç‚¹ã®é›†åˆã«å¯¾ã—å¾—ã‚‰ã‚Œã‚‹ã€ãã‚Œã‚‰ã‚’ã‚ã‚‹æ–¹æ³•ã«å¾“ã„è¾ºã§çµã‚“ã å›³å½¢ã§ã‚ã‚‹ã€‚ è¨ˆç®—å¹¾ä½•å¦ã‚ã‚‹ã„ã¯é›¢æ•£å¹¾ä½•å¦ã«ãŠã‘ã‚‹ä»£è¡¨çš„ãªè€ƒå¯Ÿå¯¾è±¡ã®1ã¤ã§ã‚ã‚‹ã€‚åç§°ã¯è€ƒæ¡ˆè€…ã§ã‚ã‚‹ãƒã‚·ã‚¢ã®æ•°å¦è€…ã€ãƒœãƒªã‚¹ãƒ»ãƒ‰ãƒãƒ
TaKUMA 2010/03/17
math

æ•°å¦

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
ãƒœãƒãƒŽã‚¤å›³ - Wikipedia
ã“ã®è¨˜äº‹ã¯æ¤œè¨¼å¯èƒ½ãªå‚è€ƒæ–‡çŒ®ã‚„å‡ºå…¸ãŒå…¨ãç¤ºã•ã‚Œã¦ã„ãªã„ã‹ã€ä¸ååˆ†ã§ã™ã€‚ å‡ºå…¸ã‚’è¿½åŠ ã—ã¦è¨˜äº‹ã®ä¿¡é ¼æ€§å‘ä¸Šã«ã”å”åŠ›ãã ã•ã„ã€‚ï¼ˆã“ã®ãƒ†ãƒ³ãƒ—ãƒ¬ãƒ¼ãƒˆã®ä½¿ã„æ–¹ï¼‰ å‡ºå…¸æ¤œç´¢?:Â "ãƒœãƒãƒŽã‚¤å›³"Â â€“Â ãƒ‹ãƒ¥ãƒ¼ã‚¹Â Â· æ›¸ç±Â Â· ã‚¹ã‚«ãƒ©ãƒ¼Â Â· CiNiiÂ Â· J-STAGEÂ Â· NDLÂ Â· dlib.jpÂ Â· ã‚¸ãƒ£ãƒ‘ãƒ³ã‚µãƒ¼ãƒÂ Â· TWL (2011å¹´10æœˆ) ãƒœãƒãƒŽã‚¤å›³ã®ä¸€ä¾‹ å€‹ã€…ã®è‰²åˆ†ã‘ãŒä¸€ã¤ã®é ˜åŸŸã‚’è¡¨ã™ ãƒœãƒãƒŽã‚¤å›³ï¼ˆãƒœãƒãƒŽã‚¤ãšã€è‹±: Voronoi diagramï¼‰ã¯ã€ã‚ã‚‹è·é›¢ç©ºé–“ä¸Šã®ä»»æ„ã®ä½ç½®ã«é…ç½®ã•ã‚ŒãŸè¤‡æ•°å€‹ã®æ¯ç‚¹ï¼ˆè‹±: siteã€ã‚µã‚¤ãƒˆï¼‰ã«å¯¾ã—ã¦ã€åŒä¸€è·é›¢ç©ºé–“ä¸Šã®ä»–ã®ç‚¹ãŒã©ã®æ¯ç‚¹ã«è¿‘ã„ã‹ã«ã‚ˆã£ã¦é ˜åŸŸåˆ†ã‘ã•ã‚ŒãŸå›³ã®ã“ã¨ã§ã‚ã‚‹ã€‚ç‰¹ã«äºŒæ¬¡å…ƒãƒ¦ãƒ¼ã‚¯ãƒªãƒƒãƒ‰å¹³é¢ã®å ´åˆã€é ˜åŸŸã®å¢ƒç•Œç·šã¯ã€å„ã€…ã®æ¯ç‚¹ã®äºŒç‰åˆ†ç·šã®ä¸€éƒ¨ã«ãªã‚‹ã€‚æ¯ç‚¹ã®ä½ç½®ã®ã¿ã«ã‚ˆã£ã¦åˆ†å‰²ãƒ‘ã‚¿ãƒ¼ãƒ³ãŒæ±ºå®šã•ã‚Œã‚‹ãŸã‚ã€æ¯ç‚¹ã«è¦å‰‡æ€§ã‚’æŒãŸã›ã‚Œã°ç¾Žã—ã„å›³å½¢ã‚’ç”Ÿã¿å‡ºã™
TaKUMA 2010/03/17
math

æ•°å¦

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
1