[B! algorithm] tanishiking24ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

tanishiking24 id:tanishiking24

algorithmã«é–¢ã™ã‚‹tanishiking24ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (12)

${{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}}

Task Queue ã¨ Token Bucket ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ - addsict's blog
GAE ã® Task Queue (Push Queue) ã¯ Queue ã«å…¥ã‚Œã‚‰ã‚ŒãŸã‚¿ã‚¹ã‚¯ã‚’å…¨ã¦ä¸€æ°—ã«å®Ÿè¡Œã™ã‚‹ã®ã§ã¯ãªãã€ã‚ã‚‰ã‹ã˜ã‚è¨å®šã—ã¦ãŠã„ãŸå®Ÿè¡Œãƒ¬ãƒ¼ãƒˆã«å¾“ã£ã¦ã€ãƒãƒƒã‚¯ã‚¨ãƒ³ãƒ‰ã® App Engine ã‚¤ãƒ³ã‚¹ã‚¿ãƒ³ã‚¹ã«ãƒªã‚¯ã‚¨ã‚¹ãƒˆã‚’æŠ•ã’ã¦ãã‚Œã¾ã™ã€‚ã“ã®å®Ÿè¡Œãƒ¬ãƒ¼ãƒˆåˆ¶å¾¡ã®ãƒ™ãƒ¼ã‚¹ã¨ãªã£ã¦ã„ã‚‹ã®ãŒ Token Bucket ã¨ã„ã†ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã™ã€‚ ä»Šå›žã¯ãã® Token Bucket ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã€Task Queue ã®è¨å®šå€¤ã§ã‚ã‚‹ bucket_size rate max_concurrent_requests ã«ã©ã®ã‚ˆã†ãªé–¢é€£æ€§ãŒã‚ã‚‹ã‹ã€ã¾ã¨ã‚ã¦ã¿ãŸã„ã¨æ€ã„ã¾ã™ã€‚ Token Bucket ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ Token Bucket ã¯ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã«æµã‚Œã‚‹ãƒˆãƒ©ãƒ•ã‚£ãƒƒã‚¯ã‚’ä¸€å®šé‡ä»¥ä¸‹ã«ãªã‚‹ã‚ˆã†ã«èª¿æ•´ã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã‚ã‚Šã€Amazon EBS ã® IOPS ã®ãƒãƒ¼ã‚¹ãƒˆåˆ¶å¾¡ ã‚„ Amazon A
tanishiking24 2020/03/17
algorithm
ãƒªãƒ³ã‚¯
ã™ã”ã„Trie - Qiita
ã€Œtoã€ãŒã‚ãƒ¼ã§ã€Œ7ã€ãŒãƒãƒªãƒ¥ãƒ¼ã§ã™ã€‚ã“ã‚Œã‚’ trie ã§è¡¨ã™ã¨ä¸‹å›³ã®ã‚ˆã†ã«ãªã‚Šã¾ã™ã€‚ Trie - Wikipediaã‚ˆã‚Šå¼•ç”¨ ãƒŽãƒ¼ãƒ‰ã®ä¸ã«æ›¸ã‹ã‚Œã¦ã„ã‚‹ã€Œteaã€ã‚„ã€Œinã€ãŒã‚ãƒ¼ã§ã‚ã‚Šã€ãƒŽãƒ¼ãƒ‰ã®ä¸‹ã«æ›¸ã‹ã‚Œã¦ã„ã‚‹ã€Œ3ã€ã‚„ã€Œ5ã€ãŒã‚ãƒ¼ã«å¯¾å¿œã™ã‚‹å€¤ã§ã™ã€‚ ã‚ã‚‹ãƒŽãƒ¼ãƒ‰ã®ã‚ãƒ¼ã¯ã€ãã®è¦ªãƒŽãƒ¼ãƒ‰ã®ã‚ãƒ¼ã«ã€è¦ªãƒŽãƒ¼ãƒ‰ã‹ã‚‰ä¼¸ã³ã‚‹æœ‰å‘è¾ºã«æ›¸ã‹ã‚Œã¦ã„ã‚‹æ–‡å—ã‚’ã€ä»˜ã‘è¶³ã—ãŸæ–‡å—åˆ—ã§ã™ã€‚å®Ÿéš›ã«ã¯ã€ãƒŽãƒ¼ãƒ‰ã«ã¯ç›´æŽ¥ã‚ãƒ¼ãŒä¿å˜ã•ã‚Œãšã€ãã®ãƒŽãƒ¼ãƒ‰ã«åˆ°é”ã™ã‚‹ã¾ã§ã®è¾ºã®ãƒ©ãƒ™ãƒ«ã®åˆ—ãŒã‚ãƒ¼ã«ãªã£ã¦ã¾ã™ã€‚ æŽ¥é è¾žãŒãƒŽãƒ¼ãƒ‰ã¨å¯¾å¿œã™ã‚‹ã®ã§ prefix tree ã¨ã‚‚å‘¼ã°ã‚Œã¾ã™ã€‚ è¨ˆç®—é‡ è¨ˆç®—é‡ã¯è‰²ã€…ãªè¡¨ç¾ã‚’ã™ã‚‹ã“ã¨ãŒå¯èƒ½ã§ã™ãŒã€ãƒŽãƒ¼ãƒ‰ã®åˆ†å²ã¯é«˜ã€…ã‚¢ãƒ«ãƒ•ã‚¡ãƒ™ãƒƒãƒˆã®ç¨®é¡žæ•°ãªã®ã§ã“ã‚Œã‚’å®šæ•°ã¨ã™ã‚Œã°ã€$ m $ã‚’æ–‡å—åˆ—ã®é•·ã•ã¨ã—ã¦ä»¥ä¸‹ã®æ“ä½œãŒ$ O(m) $ã§å‡ºæ¥ã¾ã™ã€‚ï¼ˆã‚¢ãƒ«ãƒ•ã‚¡ãƒ™ãƒƒãƒˆã®ç¨®é¡žæ•°ã‚’è€ƒæ…®ã™ã‚‹ã¨$\log$ãŒä»˜ãã¾ã™ã€‚ï¼‰ æ–‡å—åˆ—ã®æ¤œç´¢
tanishiking24 2019/12/16
algorithm
ãƒªãƒ³ã‚¯
codebuff.pdf
tanishiking24 2019/11/07
ã‚ã¨ã§èªã‚€

paper

algorithm
ãƒªãƒ³ã‚¯
éžè² å€¤è¡Œåˆ—å› ååˆ†è§£ - äº€å²¡å¼˜å’Œ
7â€“3â€“1 NTT 3â€“1 Graduate School of Information Science and Techno logy, The University of Tokyo, 7â€“3â€“1 Hongo, Bunkyo-ku, Tokyo, Japan NTT Communication Science Laboratories, Nippon Telegraph and Tele- phone Corporation, 3â€“1 Morinosato Wakamiya, Atsugi, Kanagawa, Japan E-mail: [email protected], kameoka.hirokazu@lab.ntt.co.jp (multivariate analysis) (dimension- ality reduction) (signal decom
tanishiking24 2018/10/12
algorithm

machine-learning
ãƒªãƒ³ã‚¯
å¤šè…•ãƒãƒ³ãƒ‡ã‚£ãƒƒãƒˆã«ã‚ˆã‚‹è¡¨ç¤ºã‚³ãƒ³ãƒ†ãƒ³ãƒ„ã®æœ€é©åŒ– - ã‚¯ãƒƒã‚¯ãƒ‘ãƒƒãƒ‰é–‹ç™ºè€…ãƒ–ãƒã‚°
ã“ã‚“ã«ã¡ã¯ã€‚æŠ€è¡“éƒ¨æ¤œç´¢ã‚°ãƒ«ãƒ¼ãƒ—ã®åŽŸå³¶ã§ã™ã€‚ ä¸Šã®ç”»åƒã¯ã€ã‚¹ãƒžãƒ¼ãƒˆãƒ•ã‚©ãƒ³ï¼ˆãƒ–ãƒ©ã‚¦ã‚¶ç‰ˆï¼‰ã§è¦‹ãŸã‚¯ãƒƒã‚¯ãƒ‘ãƒƒãƒ‰ã®æ¤œç´¢çµæžœãƒšãƒ¼ã‚¸ã§ã™ã€‚ãƒ¬ã‚·ãƒ”ã ã‘ã§ãªãã€ãƒ‹ãƒ¥ãƒ¼ã‚¹ã‚‚è¡¨ç¤ºã•ã‚Œã¦ã„ã¾ã™ãã€‚çŒ®ç«‹ã‚„æŽ²ç¤ºæ¿ã®ã‚¹ãƒ¬ãƒƒãƒ‰ãªã©ãŒè¡¨ç¤ºã•ã‚Œã‚‹ã“ã¨ã‚‚ã‚ã‚Šã¾ã™ã€‚ ã‚¯ãƒƒã‚¯ãƒ‘ãƒƒãƒ‰ã§ã¯ã€æ¤œç´¢çµæžœãƒšãƒ¼ã‚¸ã«è¡¨ç¤ºã™ã‚‹ã‚³ãƒ³ãƒ†ãƒ³ãƒ„ã‚’ã‚¯ã‚¨ãƒªãªã©ã«å¿œã˜ã¦æœ€é©åŒ–ã—ã¦ã„ã¾ã™ã€‚æœ€é©åŒ–ã¯ã€è†¨å¤§ãªãƒã‚°ãƒ‡ãƒ¼ã‚¿ã¨æœ€æ–°ã®æ©Ÿæ¢°å¦ç¿’ã‚’ç”¨ã„ã‚‹ã“ã¨ã§ã€å®Ÿç¾ã—ã¦ã„ã¾ã™ã€‚ã“ã®ã‚¨ãƒ³ãƒˆãƒªã§ã¯ã€ã‚¯ãƒƒã‚¯ãƒ‘ãƒƒãƒ‰ã«ãŠã‘ã‚‹ã‚³ãƒ³ãƒ†ãƒ³ãƒ„æœ€é©åŒ–ã®è£å´ã‚’ç´¹ä»‹ã—ã¾ã™ã€‚ æœ€é©åŒ–ã®èƒŒæ™¯ ã‚¹ãƒžãƒ¼ãƒˆãƒ•ã‚©ãƒ³ã®æ™®åŠã«ä¼´ã£ã¦ã€ãƒ¦ãƒ¼ã‚¶ãŒåˆ©ç”¨ã™ã‚‹ãƒ—ãƒ©ãƒƒãƒˆãƒ•ã‚©ãƒ¼ãƒ ã¯ PC ã‹ã‚‰ãƒ¢ãƒã‚¤ãƒ«ã«ã‚·ãƒ•ãƒˆã—ã¤ã¤ã‚ã‚Šã¾ã™ã€‚ã‚¯ãƒƒã‚¯ãƒ‘ãƒƒãƒ‰ã«ãŠã‘ã‚‹ãƒ¢ãƒã‚¤ãƒ«åˆ©ç”¨è€…ã®å‰²åˆã‚‚ã€ã“ã“ 2 å¹´ã§ 10% ä»¥ä¸Šå¢—åŠ ã—ã¾ã—ãŸã€‚æœ€è¿‘ã§ã¯ã€60% ä»¥ä¸Šã®ãƒ¦ãƒ¼ã‚¶ãŒãƒ¢ãƒã‚¤ãƒ«ã‹ã‚‰ã‚¢ã‚¯ã‚»ã‚¹ã—ã¦ã„ã¾ã™ã€‚ ãƒ¦ãƒ¼ã‚¶ã®åˆ©ç”¨å½¢æ…‹ãŒå¤‰åŒ–ã™ã‚Œã°ã€æ¤œç´¢çµæžœãƒšãƒ¼ã‚¸ã‚‚ãã®å¤‰åŒ–ã«å¯¾
tanishiking24 2018/04/18
algorithm

machine-learning
ãƒªãƒ³ã‚¯
ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æ¥µã‚ã‚‹ï¼ ã€œ ãªãœã‚½ãƒ¼ãƒˆã‚’å¦ã¶ã®ã‹ ã€œ - Qiita
NTT ãƒ‡ãƒ¼ã‚¿æ•°ç†ã‚·ã‚¹ãƒ†ãƒ ã§ãƒªã‚µãƒ¼ãƒãƒ£ãƒ¼ã‚’ã—ã¦ã„ã‚‹å¤§æ§» (é€šç§°ã€ã‘ã‚“ã¡ã‚‡ã‚“) ã§ã™ã€‚ ä»Šå›žã¯ã‚½ãƒ¼ãƒˆã«ã¤ã„ã¦è¨˜ã—ã¾ã™ã€‚ 0. ã¯ã˜ã‚ã« ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’å¦ã¶ã¨ä¸€ç•ªæœ€åˆã«ã€Œç·šå½¢æŽ¢ç´¢ã€ã‚„ã€Œã‚½ãƒ¼ãƒˆã€ãŒå‡ºã¦æ¥ã¾ã™ã€‚ã“ã‚Œã‚‰ã®ãƒ†ãƒ¼ãƒžã¯å¿œç”¨æƒ…å ±æŠ€è¡“è€…è©¦é¨“ãªã©ã§ã‚‚é »å‡ºã®ãƒ†ãƒ¼ãƒžã§ã‚ã‚Šã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã® Hello World ã¨ã‚‚å‘¼ã¶ã¹ãã‚‚ã®ã§ã™ã€‚ ç‰¹ã«ã‚½ãƒ¼ãƒˆã¯ã€ è¨ˆç®—é‡ã®æ”¹å–„ ($O(n^2)$ ã‹ã‚‰ $O(n\log{n})$ ã¸) åˆ†å‰²çµ±æ²»æ³• ãƒ’ãƒ¼ãƒ—ã€ãƒã‚±ãƒƒãƒˆãªã©ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ä¹±æŠžã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®æ€æƒ³ ã¨ã„ã£ãŸæ§˜ã€…ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ æŠ€æ³•ã‚’å¦ã¶ã“ã¨ãŒã§ãã‚‹ãŸã‚ã€å¤§å¦ã®æŽˆæ¥ã§ã‚‚ã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ é–¢é€£ã®å…¥é–€æ›¸ç±ã§ã‚‚ã€ä½•ç¨®é¡žã‚‚ã®ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒè©³ç´°ã«è§£èª¬ã•ã‚Œã‚‹å‚¾å‘ã«ã‚ã‚Šã¾ã™ã€‚æœ¬è¨˜äº‹ã§ã‚‚ã€æ§˜ã€…ãªã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ä¸€é€šã‚Šè§£èª¬ã—ã¦ã¿ã¾ã—ãŸã€‚ ã—ã‹ã—ãªãŒã‚‰æ§˜ã€…ãªç¨®é¡žã®ã‚½ãƒ¼ãƒˆã‚’å‹‰å¼·ã™ã‚‹ã®ã‚‚ã‚ˆã„ãŒã€ã€Œã‚½ãƒ¼ãƒˆã®ä½¿ã„æ–¹ã€ã‚„
tanishiking24 2018/04/06
algorithm
ãƒªãƒ³ã‚¯
Using Bloom Filters
Using Bloom Filters Apr 8, 2004 by Maciej Ceglowski Anyone who has used Perl for any length of time is familiar with the lookup hash, a handy idiom for doing existence tests: foreach my $e ( @things ) { $lookup{$e}++ } sub check { my ( $key ) = @_; print "Found $key!" if exists( $lookup{ $key } ); } As useful as the lookup hash is, it can become unwieldy for very large lists or in cases where the
tanishiking24 2017/12/31
perl

blockchain

algorithm
ãƒªãƒ³ã‚¯
ãƒãƒƒã‚·ãƒ¥æœ¨ - Wikipedia
ãƒã‚¤ãƒŠãƒªãƒãƒƒã‚·ãƒ¥æœ¨ã®ä¾‹ æš—å·ç†è«–ãŠã‚ˆã³è¨ˆç®—æ©Ÿç§‘å¦ã«ãŠã„ã¦ã€ãƒãƒƒã‚·ãƒ¥æœ¨(Hash tree, ãƒãƒƒã‚·ãƒ¥ãƒ„ãƒªãƒ¼)ã¾ãŸã¯ãƒžãƒ¼ã‚¯ãƒ«æœ¨(Merkle tree)ã¨ã¯ã€å…¨ã¦ã®è‘‰ãƒŽãƒ¼ãƒ‰ã«ãƒ‡ãƒ¼ã‚¿ãƒ–ãƒãƒƒã‚¯ã®ãƒãƒƒã‚·ãƒ¥å€¤ãŒãƒ©ãƒ™ãƒ«ä»˜ã‘ã•ã‚Œã€å†…éƒ¨ãƒŽãƒ¼ãƒ‰ã«ã¯ã€ãã®åãƒŽãƒ¼ãƒ‰ã®ãƒ©ãƒ™ãƒ«ã®ãƒãƒƒã‚·ãƒ¥å€¤ãŒãƒ©ãƒ™ãƒ«ä»˜ã‘ã•ã‚Œã¦ã„ã‚‹æœ¨æ§‹é€ ã§ã‚ã‚‹ã€‚ãƒãƒƒã‚·ãƒ¥æœ¨ã‚’ä½¿ç”¨ã™ã‚‹ã¨ã€å¤§è¦æ¨¡ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®å†…å®¹ã‚’ã€åŠ¹çŽ‡çš„ã‹ã¤å®‰å…¨ã«æ¤œè¨¼ã™ã‚‹ã“ã¨ãŒã§ãã‚‹ã€‚ã“ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¯ãƒãƒƒã‚·ãƒ¥ãƒªã‚¹ãƒˆã¨ãƒãƒƒã‚·ãƒ¥ãƒã‚§ã‚¤ãƒ³ã®çµ„ã¿åˆã‚ã›ã§ã§ãã¦ã„ã‚‹ã€‚ ç‰¹ã«ã€ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã«Tigerã‚’ä½¿ç”¨ã—ãŸã‚‚ã®ã¯Tiger Treeã¾ãŸã¯Tiger Treeãƒãƒƒã‚·ãƒ¥ã¨ã‚‚å‘¼ã°ã‚Œã‚‹ã€‚ ãƒãƒƒã‚·ãƒ¥æœ¨ã¯ã€å˜ç‹¬ã¾ãŸã¯è¤‡æ•°ã®ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã§ä¿å˜ãƒ»å‡¦ç†ãƒ»è»¢é€ã•ã‚Œã‚‹ä»»æ„ã®ãƒ‡ãƒ¼ã‚¿ã®æ¤œè¨¼å‡¦ç†ã«åˆ©ç”¨ã§ãã‚‹ã€‚ç¾åœ¨ã®ä¸»ãªç”¨é€”ã¨ã—ã¦ã¯ã€Peer to Peerãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã«ãŠã„ã¦ä»–ã®ãƒ”ã‚¢ã‹ã‚‰å—ä¿¡ã—ãŸãƒ‡ãƒ¼ã‚¿ãƒ–ãƒãƒƒã‚¯ãŒç ´æã—ãŸã‚Šæ”¹
tanishiking24 2017/12/27
algorithm

blockchain
ãƒªãƒ³ã‚¯
Bingæ¤œç´¢ã®è£å´â€•BitFunnelã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ - Hatena Developer Blog
ã¯ã¦ãªã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã® id:takuya-a ã§ã™ã€‚ ã“ã®è¨˜äº‹ã§ã¯ã€Microsoft ã®æ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³ Bing ã§æŽ¡ç”¨ã•ã‚ŒãŸ BitFunnel ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ç´¹ä»‹ã—ã¾ã™ã€‚ æ˜¨å¹´ã®ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã‚¢ãƒ‰ãƒ™ãƒ³ãƒˆã‚«ãƒ¬ãƒ³ãƒ€ãƒ¼ã§ã¯ã€æ–‡å—åˆ—æ¤œç´¢ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å…¨èˆ¬ã«ã¤ã„ã¦ç´¹ä»‹ã—ã¾ã—ãŸï¼ˆæ–‡å—åˆ—ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®å¦ã³ã‹ãŸ - Hatena Developer Blogï¼‰ã€‚ä»Šå¹´ã¯ãã®ãªã‹ã§ã‚‚ã€ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ï¼ˆç´¢å¼•ï¼‰ã‚’ä½¿ã£ãŸå…¨æ–‡æ¤œç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦ã®ãŠè©±ã«ãªã‚Šã¾ã™ã€‚ ã“ã®è¨˜äº‹ã®å‰åŠã¯å…¨æ–‡æ¤œç´¢ã®å…¥é–€ã«ã‚‚ãªã£ã¦ã„ã¾ã™ã®ã§ã€æ¤œç´¢æŠ€è¡“ã«ãªã˜ã¿ãŒãªã„æ–¹ã«ã‚‚æ¥½ã—ã‚“ã§ã„ãŸã ã‘ã‚‹ã®ã§ã¯ãªã„ã§ã—ã‚‡ã†ã‹ã€‚ é€†ã«ã€ã€Œãã‚“ãªã®ã‚‚ã†çŸ¥ã£ã¦ã‚‹ã‚ˆï¼ã€ã¨ã„ã†æ–¹ã¯ã€æœ¬é¡Œã§ã‚ã‚‹ã€ŒBitFunnel ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®è©³ç´°ã€ã‹ã‚‰ç›®ã‚’é€šã—ã¦ã„ãŸã ã‘ã‚Œã°ã¨æ€ã„ã¾ã™ã€‚ ã“ã®è¨˜äº‹ã¯ã€ã¯ã¦ãª ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ Advent Calendar 2017ã®21æ—¥ç›®ã®
tanishiking24 2017/12/22
algorithm
ãƒªãƒ³ã‚¯
GC - GCã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ è©³ç´°è§£èª¬ - livedoor Wikiï¼ˆã‚¦ã‚£ã‚ï¼‰
GCã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ è©³ç´°è§£èª¬ æ—¥æœ¬èªžã®è³‡æ–™ãŒã™ããªã„GCã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦è©³ç´°ã«è§£èª¬ã—ã¾ã™ ãƒˆãƒƒãƒ—ãƒšãƒ¼ã‚¸ãƒšãƒ¼ã‚¸ä¸€è¦§ãƒ¡ãƒ³ãƒãƒ¼ç·¨é›† GC æœ€çµ‚æ›´æ–°ï¼š author_nariÂ 2010å¹´03æœˆ14æ—¥(æ—¥) 20:47:11å±¥æ´ Tweet ã“ã®WikiãŒç›®æŒ‡ã™æ‰€ GCã¨ã¯ï¼Ÿ GCã‚’å¦ã¶å‰ã«çŸ¥ã£ã¦ãŠãäº‹ å®Ÿè¡Œæ™‚ãƒ¡ãƒ¢ãƒªæ§‹é€ åŸºæœ¬ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ç·¨ Reference Counter Mark&Sweep Copying å¿œç”¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ç·¨ IncrementalGC ä¸–ä»£åˆ¥GC ã‚¹ãƒŠãƒƒãƒ—ã‚·ãƒ§ãƒƒãƒˆåž‹GC LazySweep TwoFinger Lisp2 Partial Mark and Sweep -Cycle Collection- Mostly Parallel GC train gc MostlyCopyingGC(Bartlett 1989) TreadmillGC(Barker 1992) è£œè¶³
tanishiking24 2017/05/01
algorithm
ãƒªãƒ³ã‚¯
Burrows Wheeler Transform ã¨ Suffix Array - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
,. -â€'''''""Â¨Â¨Â¨ãƒ½ (.ï¼¿ï¼¿_,,,... -ï½§ã‚¡ï¾Œ|ã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€€ã‚â€¦ã‚ã‚Šã®ã¾ã¾ ä»Šæ—¥ã€€èµ·ã“ã£ãŸäº‹ã‚’è©±ã™ãœï¼ |i i|ã€€ ã€€ }!ã€€}} /ï¼| |lï½¤{ã€€ ã€€j}ã€€/,,ï½¨//ï½œã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€ŽBWT ã«ã¤ã„ã¦èª¿ã¹ã¦ã„ãŸã‚‰ Suffix Array ã®ãƒ©ã‚¤ãƒ–ãƒ©ãƒªãŒã§ãã¦ã„ãŸã€ i|:!ãƒ¾ï½¤_ï¾‰ï¼ u {:}//ï¾ |ï¾˜ u' }ã€€ ,ï¾‰ã€€_,!V,ï¾Š | ï¼Â´fãƒˆï½¤_{ï¾™{,ã‚£'ï½…ï¾—ã€€, ï¾€äººã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€€ãªâ€¦ã€€ä½•ã‚’è¨€ã£ã¦ã‚‹ã®ã‹ã€€ã‚ã‹ã‚‰ããƒ¼ã¨æ€ã†ãŒ /' ã€€ ãƒ¾|å®€| {Â´,)âŒ’`/ |<ãƒ½ï¾„iã‚ã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€€ãŠã‚Œã‚‚ä½•ã‚’ã•ã‚ŒãŸã®ã‹ã‚ã‹ã‚‰ãªã‹ã£ãŸâ€¦ ,ï¾žã€€ ï¼ )ãƒ½ iLï¾š ã€€u' |ã€€| ãƒ¾ï½Œï¾„ï¾Šã€‰ |ï¼_ï¼ã€€ ï¾Š !ãƒ‹âŠ‡ã€€'ï¼:} ã€€V:::::ãƒ½ã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€€é ãŒã©ã†ã«ã‹ãªã‚Šãã†ã ã£ãŸâ€¦ /ï¼ äºŒäºŒäºŒ7'T'' ï¼u'ã€€__ /:::::::/ï½€ãƒ½ /'
tanishiking24 2016/11/20
algorithm
ãƒªãƒ³ã‚¯
Burrows Wheeler Transformã¨LF mapping - Preferred Networks Research & Development
æœ€è¿‘ã‚ªãƒ¼ãƒ—ãƒ³ã‚¦ã‚©ãƒ¼ã‚¿ãƒ¼ãƒ€ã‚¤ãƒãƒ¼ã®ãƒ©ã‚¤ã‚»ãƒ³ã‚¹ã‚’å–ã‚Šã¾ã—ãŸã€‚å¾³æ°¸ã§ã™ã€‚ ä»Šæ—¥ã¯Burrows Wheeler Transf ormï¼ˆBWå¤‰æ›ã‚‚ã—ãã¯BWTï¼‰ã®é€†å¤‰æ›ã«ãŠã„ã¦ç”¨ã„ã‚‰ã‚Œã‚‹LF mappingã‚’èª¬æ˜Žã—ã¾ã™ã€‚ BWTã¯ãƒ‡ãƒ¼ã‚¿åœ§ç¸®ã®å‰å‡¦ç†ãªã©ã«ä½¿ã‚ã‚Œã‚‹ãƒ†ã‚¯ãƒ‹ãƒƒã‚¯ã§ã™ã€‚Burrows Wheeler Transf ormã¯ã¨ã¦ã‚‚ç°¡å˜ã§ã‚ã‹ã‚Šã‚„ã™ã„ï¼ˆé«˜é€Ÿãªå®Ÿè£…ã¯è¤‡é›‘ã§ã™ãŒâ€¦â€¦ï¼‰ã®ã§ã™ãŒã€é€†å¤‰æ›ã§ç”¨ã„ã‚‰ã‚Œã‚‹LF mappingã¯ã€å®Ÿè£…ã¯ç°¡å˜ãªã‚‚ã®ã®ã€ãªãœãã‚Œã§ã‚ˆã„ã®ã‹ã¯å°‘ã—ã‚ã‹ã‚Šã«ãã„ã¨ã“ã‚ãŒã‚ã‚Šã¾ã™ã€‚ã¾ãŸã€ç§ã¯ã“ã‚Œã¾ã§ã€LF mappingãŒãªãœã‚ã‚Œã§ã†ã¾ãã„ãã®ã‹ã€ã‚ã‹ã‚Šã‚„ã™ã„èª¬æ˜Žã‚’æ—¥æœ¬èªžã§ã‚‚è‹±èªžã§ã‚‚è¦‹ãŸè¨˜æ†¶ãŒã‚ã‚Šã¾ã›ã‚“ã€‚ãã“ã§ä»Šå›žã¯LF mappingã‚’ä¸å¿ƒã«èª¬æ˜Žã—ã¾ã™ã€‚ãªãŠä½™è«‡ã§ã™ãŒã€BTWã®Michael Burrowsã¯ç¾åœ¨ã¯Googleå‹¤å‹™ã§ã€Chubbyã‚„BigTableãªã©ã®ã‚½ãƒ•
tanishiking24 2016/11/20
algorithm
ãƒªãƒ³ã‚¯
1