GitHub - rmm5t/liquidmetal: :sweat_drops::metal: A mimetic poly-alloy of the Quicksilver scoring algorithm, essentially LiquidMetal. </Schwarzenegger Voice>You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert
Luhnアルゴリズム- Wikipedia
Luhnアルゴリズム（Luhn algorithm, ルーン・アルゴリズム）ã¯ã€æ§˜ã€…ãªè˜åˆ¥ç•ªå·ã®èªè¨¼ã«ä½¿ã‚ã‚Œã¦ã„ã‚‹å˜ç´”ãªãƒã‚§ãƒƒã‚¯ã‚µãƒ æ–¹å¼ã€‚MOD-10アルゴリズムã¨ã‚‚。クレジットカード番å·ã€IMEI番å·ã€en:National Provider Identifier（アメリカã§ã®åŒ»ç™‚æ©Ÿé–¢ã®è˜åˆ¥ç•ªå·ï¼‰ã€ã‚«ãƒŠãƒ€ç¤¾ä¼šä¿é™ºç•ªå·ï¼ˆSocial Insurance Number）ãªã©ã§ä½¿ã‚ã‚Œã¦ã„る。IBMã®ç§‘å¦è€… ãƒãƒ³ã‚¹ãƒ»ãƒ”ーター・ルーン（英語版） ãŒ1954å¹´1月6æ—¥ã«ç‰¹è¨±ã‚’申請ã—ã€1960å¹´8月23æ—¥ã«ç™ºåŠ¹ã—ãŸ[1]。 アルゴリズムã¯ãƒ‘ブリックドメインã«ãªã£ã¦ãŠã‚Šã€ä»Šæ—¥ã§ã¯åºƒã利用ã•ã‚Œã¦ã„る。ISO/IEC 7812-1[2] ã«è©³ç´°ã«è¨˜ã•ã‚Œã¦ã„る。暗å·å¦çš„ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã¨ã—ã¦ã¯ä½¿ãˆãªã„。 記入ミスやタイプミスを検出ã™ã‚‹ãŸã‚ã®ã‚‚ã®ã§ã€ã‚¯ãƒ¬ã‚¸ãƒƒãƒˆãƒžã‚¹ã‚¿ãƒ¼ã«ã‚ˆã‚‹æ‚ªæ„ã‚る攻撃を防ãã‚‚ã®ã§ã¯ãªã„。多ãã®ã‚¯ãƒ¬
Things that amuse me
Quicksort in Haskell Quicksort is a commonly used example of how succinct Haskell programming can be. It usually looks something likes this: qsort :: (Ord a Bool) => [a] -> [a] qsort [] = [] qsort (x:xs) = qsort (filter (<= x) xs) ++ [x] ++ qsort (filter (> x) xs) The problem with this function is that it's not really Quicksort. Viewed through sufficently blurry glasses (or high abstraction altitu
「フカシギã®æ•°ãˆæ–¹ã€ã®å•é¡Œã‚’解ã„ã¦ã¿ãŸ
先日ã€ã€Œã€Žãƒ•ã‚«ã‚·ã‚®ã®æ•°ãˆæ–¹ã€ ãŠããˆã•ã‚“ã¨ã„ã£ã—ã‚‡ï¼ ã¿ã‚“ãªã§æ•°ãˆã¦ã¿ã‚ˆã†ï¼ã€ã¨ã„ã†å‹•ç”»ã‚’見ãŸã€‚æ ¼å状ã®ãƒžã‚¹ã®å·¦ä¸Šã‹ã‚‰å³ä¸‹ã¾ã§ã®çµŒè·¯ãŒä½•é€šã‚Šã‚ã‚‹ã®ã‹ã‚’調ã¹ã¦ã€æ ¼åãŒå¤šããªã‚Œã°ãªã‚‹ã»ã©çµ„ã¿åˆã‚ã›ã®æ•°ãŒçˆ†ç™ºçš„ã«å¢—ãˆã‚‹ã“ã¨ã‚’æ•™ãˆã¦ãれる動画ã 。ã“ã‚Œã¯è‡ªå·±å›žé¿æ©è¡Œ(Self-avoiding walk)ã¨å‘¼ã°ã‚Œã¦ã„ã‚‹å•é¡Œã‚‰ã—ã„。 ã“ã‚Œã ã‘èžã„ã¦ã‚‚ãã‚Œã»ã©ã‚¤ãƒ³ãƒ‘クトã¯ãªã„ã®ã ãŒã€å‹•ç”»ã«å‡ºã¦ãã‚‹ãŠããˆã•ã‚“ã®çµŒè·¯ã‚’調ã¹ã‚ã’る執念ãŒã‚‚ã®å‡„ãã€ãƒãƒƒãƒˆä¸Šã§ã‚‚çµæ§‹ãªè©±é¡Œã«ãªã£ã¦ã„る。執念ã¨è¨€ã†ã‚ˆã‚Šã‚‚ç‹‚æ°—ã«è¿‘ã„。ã—ã‹ã—ã€è©±é¡Œã«ãªã£ãŸå‰²ã«ã¯å‹•ç”»å†…ã§è¨€åŠã•ã‚Œã¦ã„る高速ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ を実装ã—ãŸã¨ã„ã†è©±ã‚’èžã‹ãªã‹ã£ãŸã®ã§ã€è‡ªåˆ†ã§ç¢ºã‹ã‚ã‚‹ã“ã¨ã«ã—ãŸã€‚ å‹•ç”»ã®ãŠããˆã•ã‚“ã¯æ·±ã•å„ªå…ˆæŽ¢ç´¢ã«ã‚ˆã‚‹ãƒ—ãƒã‚°ãƒ©ãƒ を使ã£ã¦ã„ã‚‹ã¨æ€ã‚れるãŒã€ãã‚Œã ã¨ã‚¹ãƒ‘コンを使ã£ã¦ã‚‚10×10マスã®æ ¼åを解ãã®ã«25万年も掛ã‹ã£ã¦ã—ã¾ã†ã€‚ãã“ã§ã€é«˜é€ŸåŒ–ã®ãŸã‚
20分ã§ã‚ã‹ã‚‹Purely Functional Data Structures (PDF)
20分ã§ã‚ã‹ã‚‹ Purely Functional Data Structures k.inaba (http://www.kmonos.net/) Apr. 4, 2010 ã‚らã™ã˜ イ ミ ュ ー ã‚¿ ブ ル デ ー ã‚¿ 構 é€ ã¯ é… ã„ Immutable Object ã ã‘ã§ä½œã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã“ã®æœ¬ã® 内 容を 全速力㧠布教ã™ã‚‹ ãŠé¡Œï¼šã‚ュー (Queue) • FIFO (First-In First-Out) • pushBack(e) ã§ãƒ‡ãƒ¼ã‚¿eを入れる • popFront() ã§å–り出ã›ã‚‹ • 入れãŸé †ã«å‡ºã¦ãã‚‹ • 以上 ç ´å£Šçš„ã‚ュー Immutable Object ã§ãªã„ 打倒ã™ã¹ã目標 代 å…¥ 手続ãåž‹ã§ã‚ˆãã‚ã‚‹ interface Queue<E> { void pushBack(E e); E popFront(); } よãã‚る実装 1 2 3 ・ 4 ・
Open Data Structures
Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Data structures presented in the book include stacks, queues, deques, and lists implemented as arrays and linked-lists; space-efficient implementations of lists; skip lists; hash tables and hash codes; binary search
NP完全å•é¡Œã‚’解ãDNAコンピュータ
ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ç ”究室 担当教官　å‚本直志准教授 03KC091　藤原久敬 目次 ç¬¬ä¸€ç« .ã¯ã˜ã‚ã« ç¬¬äºŒç« .準備 NP完全 グラフ å¤šé …å¼æ™‚é–“ å¤šé …å¼æ™‚é–“ã§è§£ã‘ãªã„å•é¡Œã®æ§‹é€ ã¨NP P=NPå•é¡Œ å¸°ç€ NP完全(NPã®æ€§è³ª) P=NPå•é¡Œã®ç¾çŠ¶ DNA DNAã®æ§‹æˆ DNAé–“ã®çµåˆ DNAã®å®Ÿé¨“装置 ç¬¬ä¸‰ç« .æœ¬ç ”ç©¶ã®å†…容 Leonard M.Adleman Molecular computation of solution to combinational problemã®ãƒ¬ãƒ“ュー è¦ç´„ 有å‘ãƒãƒŸãƒ«ãƒˆãƒ³ãƒ‘スå•é¡Œ Adlemanã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¾ã¨ã‚ A Sticker-Based Model for DNA Computation ã®ãƒ¬ãƒ“ュー è¦ç´„ æƒ…å ±ã®è¡¨ç¾æ–¹æ³• 基本演算 最å°è¢«è¦†å•é¡Œ stickers modelを使ã£ãŸã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 基本演算ã®å®Ÿè£… åˆæœŸåŒ–ã¨è§£ã®æ¤œå‡º stickers ma
Mesh Compression In Dream Zoo | Zynga Engineering
For many 2D games, a common method of providing character animation is by using a series of static images or sprite-sheets. Dream Zoo, Zynga’s newest mobile game (available soon for iOS and Android) required a different approach. In Dream Zoo, players collect, breed and care for animals in their very own zoo with thousands of animal varieties possible – from rainbow giraffes to polka dot lions. (W
Red Blob Games: Polygonal Map Generation for Games
Here’s the result: These biomes look good in the map generation demo, but each game will have its own needs. Realm of the Mad God[26] for example ignores these biomes and uses its own (based on elevation and moisture). 8 Noisy Edges#For some games, the polygonal maps are sufficient. However, in other games I want to hide the polygon structure. The main way I do that is to replace the polygon bord
ランã‚ングã®ã¤ãã‚Šã‹ãŸ:Kenn's Clairvoyance
é…ã‚Œã°ã›ãªãŒã‚‰ã€ã‚ã‘ã¾ã—ã¦ãŠã‚ã§ã¨ã†ã”ã–ã„ã¾ã™ã€‚ 先週ã«ã¯ã€ãƒ™ã‚¤ã‚¨ãƒªã‚¢ã®å‹äººãŸã¡ãŒã‚„ã£ã¦ã„ã‚‹EchofonãŒPostUpã«è²·åŽã•ã‚Œã‚‹ãªã©ã€å¹¸å…ˆã®ã‚ˆã„æ–°å¹´ã®ã‚¹ã‚¿ãƒ¼ãƒˆã¨ãªã‚Šã¾ã—ãŸã€‚ ã•ã¦ã€æœ€è¿‘ホットãªãƒžãƒ¼ã‚±ãƒƒãƒˆã¨ã„ãˆã°ã‚½ãƒ¼ã‚·ãƒ£ãƒ«ã‚²ãƒ¼ãƒ ã§ã™ãŒã€ã‚²ãƒ¼ãƒ ã¨ã„ãˆã°ãƒªãƒ¼ãƒ€ãƒ¼ãƒœãƒ¼ãƒ‰ã€‚ãƒã‚¤ã‚¹ã‚³ã‚¢ã®ãƒ©ãƒ³ã‚ングã§å‹äººã‚„見知らã¬äººãŸã¡ã¨ç«¶ã†ã®ã¯ã€ãƒ“デオゲームãŒèª•ç”Ÿã—ãŸ1970年代ã‹ã‚‰æ¬ ã‹ã›ãªã„è¦ç´ ã§ã—ãŸã€‚ ã¨ã“ã‚ãŒã€ã‚¤ãƒ³ã‚¿ãƒ¼ãƒãƒƒãƒˆçµŒç”±ã§100万人è¦æ¨¡ã®ãƒ—レイヤーãŒã¤ãªãŒã‚‹ã‚ˆã†ã«ãªã£ã¦ããŸç¾åœ¨ã€ãã®å…¨ä½“をランã‚ングã¥ã‘ã™ã‚‹ã®ã¯ã€æŠ€è¡“çš„ã«ã‚‚大ããªãƒãƒ£ãƒ¬ãƒ³ã‚¸ã¨ãªã£ã¦ãã¾ã—ãŸã€‚ 今回ã¯ã€ãã®ãƒªãƒ¼ãƒ€ãƒ¼ãƒœãƒ¼ãƒ‰ã®ã¤ãã‚Šã‹ãŸã«ã¤ã„ã¦ã€ã¼ãらã®ä½œã£ã¦ã„るソーシャルゲーム・プラットフォームã§ã‚ã‚‹Pankiaã®é‹ç”¨ã§å¾—られãŸçŸ¥è¦‹ã‚’共有ã—ãŸã„ã¨æ€ã„ã¾ã™ã€‚ 自分ã®é †ä½ã‚’知る方法 リーダーボードã®åŸºæœ¬çš„ãªè€ƒãˆæ–¹ã¯ã‚·ãƒ³ãƒ—ルã§ã€ãã‚Œã¯ã¤ã¾ã‚Šã€Œãƒ¦
Mersenne Twister: A random number generator (since 1997/10)
English Version News: MTToolBox ã‚’GitHubã§å…¬é–‹ã—ã¾ã—ãŸã€‚(2013/10/04) TinyMTをリリースã—ã¾ã—ãŸã€‚ (2011/06/20) MTGPをリリースã—ã¾ã—ãŸã€‚(2009/11/17) SIMD-oriented Fast Mersenne Twister (SFMT) をリリースã—ã¾ã—ãŸã€‚ SFMTã¯ã‚ªãƒªã‚¸ãƒŠãƒ«ã®Mersenne Twisterより約二å€é€Ÿã〠よりよã„å‡ç‰åˆ†å¸ƒç‰¹æ€§ã‚’æŒã¡ã€é›¶è¶…éŽåˆæœŸçŠ¶æ…‹ã‹ã‚‰ã®å›žå¾©ã‚‚高速ã§ã™ã€‚ SFMTã®ãƒšãƒ¼ã‚¸ã‚’見ã¦ãã ã•ã„。 (2007/1/31) ãŠé¡˜ã„：使ã†æ™‚ã«emailを一通下ã•ã‚Œã°ã€ 今後ã®æ”¹è‰¯ã®ã¯ã’ã¿ã«ãªã‚Šã¾ã™ã€‚ ã©ã‚“ãªã•ã•ã„ãªå•é¡Œç‚¹ã§ã‚‚ã€è¦‹ã¤ã‘次第御連絡下ã•ã„。 m-mat ï¼ math.sci.hiroshima-u.ac.jp (ã“ã®ãƒ¡ãƒ¼ãƒ«ã‚¢ãƒ‰ãƒ¬ã‚¹ã¯ スペースを抜ã„ã¦æ‰‹ã§æ‰“ã¡ç›´ã—ã¦ãã ã•ã„)
yebo blog: クヌース教授ã¯é–“é•ã£ã¦ã„ãŸ
2010/06/15 クヌース教授ã¯é–“é•ã£ã¦ã„㟠Slashdotã«ã‚ˆã‚Œã°ã€ã“ã®æ•°åå¹´é–“ã€ã‚¯ãƒŒãƒ¼ã‚¹æ•™æŽˆã‚’ã¯ã˜ã‚ã¨ã™ã‚‹ã‚³ãƒ³ãƒ”ュータ科å¦è€…ãŒæœ€é©ã¨ã—ã¦ããŸã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’10å€é«˜é€Ÿã«ã™ã‚‹æ–¹æ³•ã‚’Poul-Henning Kamp (PHK) ã¨ã„ã†ãƒãƒƒã‚«ãƒ¼ãŒè¦‹ä»˜ã‘ãŸã¨ã„ã†ã€‚ãã®è«–文タイトルã¯ã€ŒYou're Doing It Wrong (ã‚ãªãŸé”ã®ã‚„ã£ã¦ã„る事ã¯é–“é•ã£ã¦ã„ã‚‹)ã€ã§ã€ACM Queueã«æŽ²è¼‰ã•ã‚Œã¦ã„る。別ã«ã‚¯ãƒŒãƒ¼ã‚¹æ•™æŽˆã®è€ƒãˆãŒé–“é•ã£ã¦ã„ã‚‹ã‚ã‘ã§ã¯ãªãã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ çš„ã«ã¯æ£ã—ã„ãŒã€å®Ÿç”¨ãƒ¬ãƒ™ãƒ«ã§ã¯ã€OSã«ã¯ä»®æƒ³ãƒ¡ãƒ¢ãƒªãŒã‚ã‚Šã€VMã¨å¹²æ¸‰ã—ãªã„よã†ã«ã™ã‚Œã°ç°¡å˜ã«é«˜æ€§èƒ½ãªã‚·ã‚¹ãƒ†ãƒ ãŒä½œã‚Œã‚‹ã€‚従æ¥ã®è€ƒãˆæ–¹ã¯ãƒ¢ãƒ€ãƒ³ãªè¨ˆç®—機を考慮ã«å…¥ã‚Œã¦ã„ãªã„ã®ã§ã€ç¾å®Ÿçš„ã«ã¯ä¸é©åˆã‚’èµ·ã“ã—ã¦ã„る。具体的ã«ã¯ãƒ’ープã«Bツリーã®è¦ç´ ã‚’å–り込んã Bヒープã¨ã„ã†ãƒ‡ãƒ¼ã‚¿æ§‹é€ を使ã†ã“ã¨ã§ã€ãƒã‚¤ãƒŠãƒªãƒ’ープã®10å€ã®ãƒ‘フォーマンスを
Efficient Running Median using an Indexable Skiplist « Python recipes « ActiveState Code
Efficient Running Median using an Indexable Skiplist (Python recipe) by Raymond Hettinger Maintains sorted data as new elements are added and old one removed as a sliding window advances over a stream of data. Also gives fast indexed access to value. Running time per median update is proportional to the log of the window size. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
Skip list - Wikipedia
In computer science, a skip list (or skiplist) is a probabilistic data structure that allows average complexity for search as well as average complexity for insertion within an ordered sequence of elements. Thus it can get the best features of a sorted array (for searching) while maintaining a linked list-like structure that allows insertion, which is not possible with a static array. Fast search
Google App Engineã§ãƒ©ãƒ³ã‚ングやページングを実ç¾ã™ã‚‹ - $koherent->diary
昨日一昨日ã€Google App Engine (GAE)ã«é–¢ã™ã‚‹æ—¥æœ¬æœ€å¤§ã®å‹‰å¼·ä¼šï¼ˆã ã¨æ€ã†ï¼‰appengine ja night #7 (ajn7)ãŒè¡Œã‚ã‚Œã¾ã—ãŸã€‚ ãã®ä¸ã§ã€Žãƒ©ãƒ³ã‚ングå•é¡Œã€ãŒè©±é¡Œã«ä¸ŠãŒã‚Šã¾ã—ãŸã€‚『ランã‚ングå•é¡Œã€ã¨ã¯ã€ä½•å万件もã®ç‚¹æ•°ã®ãƒ‡ãƒ¼ã‚¿ãŒã‚ã‚‹ã¨ãã«ã€App Engine上ã§ã€ã€Œâ—¯ç‚¹ã¯ä½•ä½ã§ã™ã€ã¨é«˜é€Ÿã«æ±‚ã‚ã‚‹ã“ã¨ã¯é›£ã—ã„ã€ã¨ã„ã†å•é¡Œã§ã™ã€‚（◯ページ目を表示ã€ã¨ã„ã†ãƒšãƒ¼ã‚¸ãƒ³ã‚°ã‚‚ã“ã‚Œã¨åŒã˜ç¨®é¡žã®å•é¡Œã«ãªã‚Šã¾ã™ã€‚） ajn7ã§ã¯ã€Œä¸Šä½ã§ãªã„é™ã‚Šæ£ç¢ºãªé †ä½ã¯å¿…è¦ãªã„ã®ã§ã¯ãªã„ã‹ã€ã¨ã„ã†è©±ã«ãªã‚Šã¾ã—ãŸãŒã€Skiplistを用ã„ãŸæ¤œç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ を使ãˆã°æ£ç¢ºã‹ã¤é«˜é€Ÿã«é †ä½ã‚’求ã‚ã‚‹ã“ã¨ãŒã§ãã‚‹ã®ã§ã¯ãªã„ã‹ã¨æ€ã„ã€å®Ÿè£…＆検証ã—ã¦ã¿ã¾ã—ãŸã€‚ ランã‚ãƒ³ã‚°ï¼ˆé †ä½å–得）ã®ãƒ‡ãƒ¢ 下記ページã§é †ä½å–å¾—ã®ãƒ‡ãƒ¢ã‚’å‹•ã‹ã—ã¦ã„ã¾ã™ã€‚スコア（点数）を入力ã™ã‚‹ã¨é †ä½ã¨å–å¾—ã«ã‹ã‹ã£ãŸæ™‚é–“ãŒè¡¨ç¤ºã•ã‚Œã¾ã™ï¼ˆæ™‚
ãã®ï¼˜ 4分木空間分割を最é©åŒ–ã™ã‚‹ï¼
ホーム＜ゲームã¤ãã‚ーï¼ï¼œè¡çªåˆ¤å®šç·¨ 2Dè¡çªç·¨ ãã®ï¼˜ 4分木空間分割を最é©åŒ–ã™ã‚‹ï¼ï¼ˆç†å±ˆç·¨ï¼‰ ゲーム空間ã«ç½®ã„ãŸã‚ªãƒ–ジェクトをç·å½“ã‚Šã§è¡çªåˆ¤å®šã™ã‚‹äº‹ã¯ã¯ã£ãã‚Šã¨éžåŠ¹çŽ‡ã ã¨è¨€ãˆã¾ã™ã€‚ã¡ã‚‡ã£ã¨è¨ˆç®—ã—ã¦ã¿ã¾ã—ょã†ã€‚60FPSã®ã‚²ãƒ¼ãƒ ã®1フリップ約16.6ミリ秒ã®å†…è¡çªåˆ¤å®šã«10%ã®æ™‚間余裕（1.66ミリ秒）を与ãˆã‚‰ã‚ŒãŸã¨ã—ã¾ã™ã€‚ã‚‚ã—1000回ã®è¡çªåˆ¤å®šã«1ミリ秒ã‹ã‹ã‚‹ãªã‚‰ï¼ˆ1000回/msec）ã€åˆ¤å®šå›žæ•°ã¯1660回以下ã«æŠ‘ãˆãªã„ã¨é–“ã«åˆã„ã¾ã›ã‚“。ç·å½“ã‚Šã ã¨ã“ã‚Œã¯58オブジェクトãらã„ã§é™ç•Œã§ã™ã€‚判定時間ãŒ200回/msecãªã‚‰ã‚ªãƒ–ジェクトã¯ãŸã£ãŸ18個ã§é™ç•Œã€‚ã“ã‚Œã¯ã©ã†è€ƒãˆã¦ã‚‚節約ãŒç„¡ã„ã¨ã‚²ãƒ¼ãƒ ã«ãªã‚Šã¾ã›ã‚“。 オブジェクトã®å…¨ã¦ã®ä½ç½®ãŒæ±ºã¾ã£ãŸæ™‚ã€è‡ªåˆ†ã¨ã¶ã¤ã‹ã‚‹å¯èƒ½æ€§ãŒã‚ã‚‹ã®ã¯è‡ªåˆ†ã®å‘¨ã‚Šã®ã‚ªãƒ–ジェクトã ã‘ã§ã™ã€‚é ã„所ã«ã‚る物ã¯åˆ¤å®šã™ã‚‹å¿…è¦ã™ã‚‰ã‚ã‚Šã¾ã›ã‚“。ãã“ã§ã€Œç©ºé–“ã‚’ã‚る程度制é™ã—ã¦ãã®ä¸
ã™ã”ã„乱数生æˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 「xorshift〠- Pashango’s Blog
ã¿ãªã•ã‚“ã€ã“ã‚“ã«ã¡ã¯ã€ä»Šå›žã¯ä¹±æ•°ã®è©±ã§ã™ã€‚ 特ã«è¤‡æ•°æ©Ÿç¨®ã§ã®ã‚³ãƒ³ã‚·ãƒ¥ãƒ¼ãƒžæ©Ÿã§ã‚²ãƒ¼ãƒ を開発をã—ã¦ã„ã‚‹ã¨ã€æ©Ÿç¨®é–“ã§ä¹±æ•°å€¤ã‚’統一ã™ã‚‹ãŸã‚ã«ä¹±æ•°ç”Ÿæˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ を自作ã—ã¾ã™ã‚ˆã。 ãã“ã§ã‚ˆã使ã‚れるアルゴリズムãŒã€Œç·šå½¢åˆåŒæ³•ã€ã§ã™ã€å†…容ã¯è‡³ã£ã¦ç°¡å˜ã§ã€ä»¥ä¸‹ã®æ¼¸åŒ–å¼ã‚’使ã„ã¾ã™ã€‚ A,B,Mã¯å®šæ•°ã§ã€ã©ã®å€¤ãŒå…¥ã‚‹ã‹ã¯å‡¦ç†ç³»ä¾å˜ã§ã™ã€‚ 例ãˆã°Unixãªã©ã®å‡¦ç†ç³»ã§ã¯A=1103515245,B=12345,M=2147483647ãªã©ãŒå…¥ã‚Šã¾ã™ã€‚ C言語ã§ã™ã¨ä»¥ä¸‹ã®ã‚ˆã†ã«ãªã‚Šã¾ã™ã€‚ static unsigned int x=1; void srand(unsigned int s) { x=s; } unsigned int rand() { x=x*1103515245UL+12345UL; return x&2147483647UL; } ã“ã®ã€Œç·šå½¢åˆåŒæ³•ã€ã¯è¨ˆç®—ãŒç°¡å˜ã§é«˜é€Ÿã§ã™ã‹ã‚‰ã€ã„ã‚ã„ã‚ãªç’°
é™ã‹ãªæ³¨ç›®ã‚’集ã‚る圧縮アルゴリズム「LZMAã€
GNUプãƒã‚¸ã‚§ã‚¯ãƒˆã®é…布アーカイブãªã©ã‚’ä¸å¿ƒã«ã€LZMAを用ã„ãŸåœ§ç¸®å½¢å¼ã‚’ç›®ã«ã™ã‚‹æ©Ÿä¼šãŒå¢—ãˆã¦ããŸã€‚組ã¿è¾¼ã¿ç”¨é€”ãªã©ã¸ã®æ´»ç”¨ã‚‚期待ã•ã‚Œã‚‹ã“ã®åœ§ç¸®å½¢å¼ã‚’紹介ã—よã†ã€‚ 2001å¹´ã«é–‹ç™ºã•ã‚ŒãŸå¯é€†åœ§ç¸®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 「LZMAã€ï¼ˆLempel-Ziv-Markov chain-Algorithm）ãŒé™ã‹ãªæ³¨ç›®ã‚’集ã‚ã¦ã„る。LZMAã¨ã„ãˆã°ã€é«˜ã„圧縮率を備ãˆã€Windowsアーカイãƒã€Œ7-Zipã€ã«æŽ¡ç”¨ã•ã‚Œã¦ã„ã‚‹ã“ã¨ã§ã‚‚知られる。 ZIPã‚„LHAãªã©ã€ãƒ•ã‚¡ã‚¤ãƒ«ã®ã‚¢ãƒ¼ã‚«ã‚¤ãƒ–ã¨åœ§ç¸®ãŒçµ±åˆã•ã‚Œã¦ã„ã‚‹Windowsç”±æ¥ã®ãƒ—ãƒã‚°ãƒ©ãƒ ã¨ã¯ç•°ãªã‚Šã€UNIXã‚„Linuxã§ã¯ä¼çµ±çš„ã«ã‚¢ãƒ¼ã‚«ã‚¤ãƒ–ã¨åœ§ç¸®ãŒå€‹ã€…ã®ã‚³ãƒžãƒ³ãƒ‰ã¨ã—ã¦ç”¨æ„ã•ã‚Œã¦ãŠã‚Šã€ãれらを組ã¿åˆã‚ã›ã¦åˆ©ç”¨ã™ã‚‹ã“ã¨ã«ãªã‚‹ã€‚ç¾åœ¨ã§ã¯ã€ã‚¢ãƒ¼ã‚«ã‚¤ãƒ–ãŒtarã€åœ§ç¸®ã«ã¯GNU zip（.gz）やbzip2（.bz2）ãŒä½µç”¨ã•ã‚Œã‚‹ã“ã¨ãŒå¤šã„。 .gzã‚„.bz2ã‚’ã—ã®ã圧縮率ãŒç‰¹
ランã‚ング
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
python-stdnum: Collection of parser functions for standard numbers
Playing Go with Clojure - Zach Tellman
{{#tags}}- {{label}}
{{/tags}}