Squash Compression Benchmark
The Squash library is an abstraction layer for compression algorithms, making it trivial to switch between them… or write a benchmark which tries them all, which is what you see here! The Squash Compression Benchmark currently consists of {{datasets.length|number}} datasets, each of which is tested against {{plugins.length}} plugins containing {{codecs.length|number}} codecs at every compression l
Is Redlock safe? - <antirez>
antirez 3536 days ago. 413480 views. Martin Kleppmann, a distributed systems researcher, yesterday published an analysis of Redlock (http://redis.io/topics/distlock), that you can find here: http://martin.kleppmann.com/2016/02/08/how-to-do-distributed-locking.html Redlock is a client side distributed locking algorithm I designed to be used with Redis, but the algorithm orchestrates, client side, a
How to do distributed locking — Martin Kleppmann’s blog
Published by Martin Kleppmann on 08 Feb 2016. As part of the research for my book, I came across an algorithm called Redlock on the Redis website. The algorithm claims to implement fault-tolerant distributed locks (or rather, leases [1]) on top of Redis, and the page asks for feedback from people who are into distributed systems. The algorithm instinctively set off some alarm bells in the back of
Binary search with modern processors
第16回 StringBeginners ã§ã®ç™ºè¡¨è³‡æ–™
FLoCã¨ã¯ãªã«ã‹ - ã¼ã¡ã¼ã¡æ—¥è¨˜
1. ã¯ã˜ã‚ã« Google ãŒChrome/89よりトライアルを開始ã—ã¦ã„ã‚‹FLoC (Federated Learning of Cohorts)技術ã«å¯¾ã—ã¦ã€ç¾åœ¨å¤šãã®æ‰¹åˆ¤ãŒé›†ã¾ã£ã¦ã„ã¾ã™ã€‚ 批判ã®å†…容ã¯æ§˜ã€…ãªè¦³ç‚¹ã‹ã‚‰ã®ã‚‚ã®ãŒå¤šã„ã§ã™ãŒã€ä»¥å‰ã‚ˆã‚Š Privacy Sandbox ã«å¯¾ã—ã¦å¦å®šçš„ãªè¦‹è§£ã‚’示ã—ã¦ããŸEFFã®æ‰¹åˆ¤ã€ŒGoogle Is Testing Its Controversial New Ad Targeting Tech in Millions of Browsers. Here’s What We Know.ã€ãŒä¸€ç•ªã¾ã¨ã¾ã£ã¦ã„ã‚‹ã‚‚ã®ã ã¨æ€ã„ã¾ã™ã€‚ ã“ã‚Œã¾ã§ Privacy Sandbox 技術ã«é–¢ã‚ã£ã¦ããŸèº«ã¨ã—ã¦ã¯ã€å„種æ案ã®ä¸ã§FLoCã¯ç‰¹ã«ãƒ¦ãƒ¼ã‚¶ã¸ã®æ³¨æ„ãŒæœ€ã‚‚å¿…è¦ãªã‚‚ã®ã ã¨æ€ã£ã¦ã„ã¾ã—ãŸã€‚ã—ã‹ã—ã€ã“ã‚Œã¾ã§ã®ãƒ‰ç›´çƒãªGoogleã®é€²ã‚æ–¹ã«ã‚ˆã£ã¦ã€FLoCã®ãƒˆãƒ©
New Algorithm Breaks Speed Limit for Solving Linear Equations
Grade school math students are likely familiar with teachers admonishing them not to just guess the answer to a problem. But a new proof establishes that, in fact, the right kind of guessing is sometimes the best way to solve systems of linear equations, one of the bedrock calculations in math. As a result, the proof establishes the first method capable of surpassing what had previously been a har
é«˜é€Ÿé€†å¹³æ–¹æ ¹(fast inverse square root)ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 解説 - 滴了庵日録
é«˜é€Ÿé€†å¹³æ–¹æ ¹ã¨ã¯ï¼Ÿ C言語ã®ã‚³ãƒ¼ãƒ‰ 検証 アルゴリズムã®è¦ç‚¹ [1] é€†å¹³æ–¹æ ¹ã®è¨ˆç®—を対数・指数ã®è¨ˆç®—ã«ç½®ãæ›ãˆã‚‹ [2] 浮動å°æ•°ç‚¹åž‹ã®å†…部表ç¾ã‚’利用ã—ãŸå¯¾æ•°ãƒ»æŒ‡æ•°ã®è¿‘似計算 [2.1] 対数ã®è¿‘ä¼¼ [2.2] σã®æœ€é©å€¤ [2.3] æ•´æ•°åž‹ã§ã®è§£é‡ˆ [2.4] é€†å¹³æ–¹æ ¹ã®è¨ˆç®—ã¨ãƒžã‚¸ãƒƒã‚¯ãƒŠãƒ³ãƒãƒ¼0x5F3759DF [3] ニュートン法ã«ã‚ˆã‚‹åŽæŸã§ç²¾åº¦ã‚¢ãƒƒãƒ— 感想 é«˜é€Ÿé€†å¹³æ–¹æ ¹ã¨ã¯ï¼Ÿ é«˜é€Ÿé€†å¹³æ–¹æ ¹(fast inverse square root)ã¨ã¯ã€å¹³æ–¹æ ¹ã®é€†æ•° を高速ã«è¨ˆç®—ã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã™ã€‚å¹³æ–¹æ ¹ã®é€†æ•°ã¯é€†å¹³æ–¹æ ¹ã¨ã‚‚呼ã°ã‚Œã¾ã™ã€‚é€†å¹³æ–¹æ ¹ã¯ãƒ™ã‚¯ãƒˆãƒ«ã®æ£è¦åŒ–ãªã©ã«ç”¨ã„られるã®ã§ã€ã“れを高速ã«è¨ˆç®—ã§ãるアルゴリズムã«ã¯å¤§ããªã”利益ãŒã‚ã‚Šã¾ã™ã€‚ å‚照： Fast inverse square root - Wikipedia C言語ã®ã‚³ãƒ¼ãƒ‰ é«˜é€Ÿé€†å¹³æ–¹æ ¹ã®é–¢æ•°ã‚’示ã—ã¾ã™ã€‚0x5F375
分散åˆæ„アルゴリズムRaft ã‚’ TLA+ ã§æ¤œè¨¼ã™ã‚‹ - 俺㮠Colimit を越ãˆã¦ã‚†ã‘
ã¯ã˜ã‚㫠分散åˆæ„アルゴリズムRaft ã¨ã¯ 分散åˆæ„アルゴリズムã¨ã¯ Raft ã®ç‰¹å¾´ Raft ãŒæº€ãŸã™æ€§è³ª Election Safety Leader Append-Only Log Matching Leader Completeness State Machine Safety TLA+ ã¨ã¯ TLA+ ã«ã‚ˆã‚‹ Raft ã®å½¢å¼çš„仕様 TLA+ ã«ã‚ˆã‚‹ Raft ã®æ¤œè¨¼æ–¹æ³• TLA+ Toolbox ã®ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ« æ–°è¦ Spec ã®ä½œæˆ Model ã®ä½œæˆã¨å®Ÿè¡Œ 補足: コマンドラインã§ã®æ¤œè¨¼ Raft ã®æ‹¡å¼µã«ã¤ã„㦠Leadership Transfer Membership Change Log Compaction Client Interaction ãŠã‚ã‚Šã« Raft ç†è§£åº¦ã‚’調ã¹ã‚‹ã‚¯ã‚¤ã‚º å‚考資料 Raft ã«é–¢ã™ã‚‹è³‡æ–™ TLA+ ã«é–¢ã™ã‚‹è³‡æ–™ ã¯ã˜ã‚ã« ã“ã®
ãƒã‚¯ãƒ“シンã«ã‚‚ã‚ã‹ã‚‹å…¨æ–‡æ¤œç´¢ - Qiita
高速ãªå…¨æ–‡æ¤œç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã‚ã‚‹FM-indexã«ã¤ã„ã¦è§£èª¬ã™ã‚‹ã€‚ç†è§£ã—ãŒãŸã„点や間é•ã£ã¦ã„る点ãŒã‚ã‚Œã°æ˜¯éžã‚³ãƒ¡ãƒ³ãƒˆã§æŒ‡æ‘˜ã—ã¦ã»ã—ã„。 æ¦‚è¦ FM-indexã¯ãƒªãƒ‹ã‚¢ãªæ–‡å—列ã«å¯¾ã—ã¦æ¤œç´¢ã‚’ã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã€ä¸»ã«ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨BWT(ãŠã‚ˆã³LF mapping)ã¨ã„ã†äºŒã¤ã®ã‚¢ã‚¤ãƒ‡ã‚¢ã‹ã‚‰æˆã‚Šç«‹ã£ã¦ã„る。BWTã¯Burrows-Wheeler変æ›ã®ã“ã¨ã§ã€æ–‡å—列を特殊ãªä¸¦ã³é †ã«å¤‰æ›ã™ã‚‹ã¨ã„ã†å¯é€†é–¢æ•°ã§ã‚る。BWTã•ã‚ŒãŸæ–‡å—åˆ—ã‚’ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ å›ºæœ‰ã®æ“作をã™ã‚‹ã“ã¨ã§ã€ã‚¯ã‚¨ãƒªæ–‡å—列ã®é•·ã•ã«æ¯”例ã—ãŸçŸã„時間ã§æ–‡å—列を探ã—出ã™ã®ãŒFM-indexã 。 ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«é–¢ã—ã¦ã¯FM-indexã§å¿…è¦ã¨ãªã‚‹äºŒã¤ã®é–¢æ•°ã ã‘説明ã—ã¦ã€è©³ç´°ã¯æ¬¡ã®æ©Ÿä¼šã«è²ã‚‹ã¨ã™ã‚‹ã€‚ã•ã¦ã€äºŒã¤ã®é–¢æ•°ã¯ã¨ã‚‚ã«æ–‡å—列ã®ã‚ã‚‹ä½ç½®ã‚ˆã‚Šå‰ã®éƒ¨åˆ†ã«å«ã¾ã‚Œã¦ã„ã‚‹æ–‡å—ã®æ•°ã‚’æ•°ãˆä¸Šã’ã‚‹ã¨ã„ã†ã‚‚ã®ã§rank()ã¨rankLessTha
Bloom Filters by Example
A Bloom filter is a data structure designed to tell you, rapidly and memory-efficiently, whether an element is present in a set. The price paid for this efficiency is that a Bloom filter is a probabilistic data structure: it tells us that the element either definitely is not in the set or may be in the set. The base data structure of a Bloom filter is a Bit Vector. Here's a small one we'll use to
Neil Fraser: Writing: Differential Synchronization
by Neil Fraser, January 2009 Read this as a DocEng paper. Watch this as a Google Tech Talk. Keeping two or more copies of the same document synchronized with each other in real-time is a complex challenge. This paper describes the differential synchronization algorithm. Differential synchronization offers scalability, fault-tolerance, and responsive collaborative editing across an unreliable netwo
Persistent data structure - Wikipedia
Toggle Techniques for preserving previous versions subsection
文法圧縮入門：超高速テã‚スト処ç†ã®ãŸã‚ã®ãƒ‡ãƒ¼ã‚¿åœ§ç¸®ï¼ˆNLP2014ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ï¼‰
言語処ç†å¦ä¼šç¬¬ï¼’ï¼å›žå¹´æ¬¡å¤§ä¼šï¼ˆ2014/3）ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«è¬›ç¾©è³‡æ–™ã§ã™ã€‚ - è¦æ—¨ - 文法圧縮ã¨ã¯ï¼Œå…¥åŠ›ãƒ†ã‚ストをよりコンパクトãªæ–‡è„ˆè‡ªç”±æ–‡æ³•ï¼ˆCFG）ã«å¤‰æ›ã™ã‚‹åœ§ç¸®æ³•ã®ç·ç§°ã§ã‚る． 文法圧縮ã®å¼·ã¿ã¯åœ§ç¸®ãƒ†ã‚ストを展開ã™ã‚‹ã“ã¨ç„¡ã，検索ç‰ã®ãƒ†ã‚スト処ç†ã‚’効率よãè¡Œãˆã‚‹ç‚¹ã«ã‚る． é©šãã¹ãã“ã¨ã«ãã®å‡¦ç†é€Ÿåº¦ã¯ï¼Œå…ƒãƒ†ã‚スト上ã§ã®åŒã˜å‡¦ç†ã‚’ç†è«–çš„ã«ï¼Œæ™‚ã«ã¯å®Ÿéš›ã«ã‚‚凌駕ã™ã‚‹ï¼Ž ã¾ãŸè¿‘年，ウェブアーカイブやãƒã‚°ï¼Œã‚²ãƒŽãƒ é…列ç‰ã®å¤§è¦æ¨¡å®Ÿãƒ‡ãƒ¼ã‚¿ã‚’高効率ã«åœ§ç¸®ã§ãã‚‹ã“ã¨ã§æ³¨ç›®ã‚’集ã‚ã¦ã„る． ã—ã‹ã—ãªãŒã‚‰ï¼Œæ–‡æ³•åœ§ç¸®ã«ã¤ã„ã¦ã®åˆå¦è€…å‘ã‘ã®è§£èª¬è³‡æ–™ã¯ã¾ã ã¾ã å°‘ãªã„． ãã“ã§æœ¬ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã§ã¯ï¼Œæ–‡æ³•åœ§ç¸®ã®æ´å²çš„背景ã‹ã‚‰æœ€æ–°å‹•å‘ã¾ã§ã‚’幅広ã紹介ã™ã‚‹ï¼Ž 具体的ã«ã¯æ–‡æ³•å¤‰æ›ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ，圧縮テã‚スト上ã§ã®æ–‡å—列パターン検索，文法圧縮ã«åŸºã¥ãçœãƒ¡ãƒ¢ãƒªãƒ‡ãƒ¼ã‚¿æ§‹é€ ç‰ã®è§£èª¬ã‚’è¡Œã†ï¼Ž
Fluentdã¨Redisを使ã£ãŸãƒ©ãƒ³ã‚ング機能ã®å®Ÿè£… | SmartNews開発者ブãƒã‚°
ゴクãƒã®å¤§å¹³ã§ã™ã€‚ã”ãã‚ã†ã•ã¾ã§ã™ã€‚ Redisã¯é«˜é€Ÿã§ã€ã‹ã¤ãƒ‡ãƒ¼ã‚¿ã®æ°¸ç¶šåŒ–ã‚„ã€è¤‡æ•°ã®ãƒ‡ãƒ¼ã‚¿åž‹ã«ã‚ˆã‚‹ã‚¹ãƒˆã‚¢(list,set,sorted setç‰ï¼‰ã‚‚対応ã—ã¦ãŠã‚Šã€æ©Ÿèƒ½çš„ãŒè±Šå¯Œã¨ã„ã†ã“ã¨ã‹ã‚‰æ„›ç”¨è€…ã®å¤šã„KVS実装ã®ä¸€ã¤ã ã¨æ€ã„ã¾ã™ã€‚ 特ã«ç§ã®ã‚ˆã†ãªã‚¢ãƒ—リケーションエンジニアã®äººé–“ã«ã¨ã£ã¦ã¯ãƒ‡ãƒ¼ã‚¿åž‹ã®ãƒãƒªã‚¨ãƒ¼ã‚·ãƒ§ãƒ³ã®è±Šå¯Œã•ãŒä¾¿åˆ©ã•ã‚’æ„Ÿã˜ã‚‹éƒ¨åˆ†ã§ã€ãŸã¨ãˆã°listを用ã„ã¦ã‚¿ã‚¤ãƒ ライン的ãªæƒ…å ±ã‚„å±¥æ´æƒ…å ±ã®ç®¡ç†ã€sorted setを用ã„ã¦ãƒ©ãƒ³ã‚ãƒ³ã‚°æƒ…å ±ã®ç®¡ç†ã€ãªã©ã®ã‚ˆã†ã«ã‚¢ãƒ—リケーションã®éœ€è¦ã®å¤šãã«RedisãŒå¯¾å¿œã™ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚ ã“れらã®æƒ…å ±ã‚’ç™»éŒ²ã™ã‚‹éš›ã®ãƒ•ãƒãƒ¼ã¨ã—ã¦ã¯è‡ªä½œã®ã‚¢ãƒ—リケーションã‹ã‚‰ç›´æŽ¥ã€ã¨ã„ã†ã‚±ãƒ¼ã‚¹ãŒå¤šã„ã¨æ€ã„ã¾ã™ãŒã€ã›ã£ã‹ãFluentdã®ã‚ˆã†ãªä¾¿åˆ©ãªlog collector実装ãŒã‚ã‚‹ã®ã§ã€Fluentdã¨Redisを組ã¿åˆã‚ã›ã‚‹äº‹ã§ã‚«ã‚¸ãƒ¥ã‚¢ãƒ«ã«æƒ…å ±ã®è“„ç©ã‚’è¡Œã„ãŸã„
Chordアルゴリズムã«ã‚ˆã‚‹DHT入門
Chordアルゴリズムã®è§£èª¬ãƒšãƒ¼ã‚¸ã§ã™ã€‚ 掲載コンテンツã¸ã®ãƒªãƒ³ã‚¯å…ˆã‚’変更ã™ã‚‹å¯èƒ½æ€§ãŒã‚ã‚‹ã®ã§ã€ãƒ–ックマークやリンクã¯ã€ã“ã®ãƒšãƒ¼ã‚¸ã«ãŠé¡˜ã„ã—ã¾ã™ã€‚ Chordã¯ã€DHT（Distributed Hash Table）ã¨å‘¼ã°ã‚Œã‚‹ç¨®é¡žã®Peer-to-Peerアルゴリズムã§ã™ã€‚ 特ã«ã€æ§‹é€ 化オーãƒãƒ¬ã‚¤ï¼ˆStructured Overlay Network）ã¨å‘¼ã°ã‚Œã‚‹ãƒ«ãƒ¼ãƒ†ã‚£ãƒ³ã‚°æ‰‹æ³•ã«ç‰¹å¾´ãŒã‚ã‚Šã¾ã™ã€‚ 解説スライドã§ã¯ã€ãã‚‚ãã‚‚DHTã¨ã¯ä½•ãªã®ã‹ã¨ã„ã†åˆæ©çš„ãªã“ã¨ã‹ã‚‰ã€successorã‚„predecessorã€finger tableã¨å‘¼ã°ã‚Œã‚‹Chordã®æœ‰åãªçµŒè·¯è¡¨ã®è§£èª¬ã‚„ã€å¤šãã®è§£èª¬ã§ã¯ã‚ã¾ã‚Šè§¦ã‚Œã‚‰ã‚Œã‚‹ã“ã¨ãŒãªã„ã‘ã‚Œã©ã‚‚ãã‚ã‚ã¦é‡è¦ã§ã‚ã‚‹ã€ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã®æ§‹ç¯‰æ–¹æ³•ï¼ˆjoin・stabilize）ã«ã¤ã„ã¦ã‚‚詳細ã«è§£èª¬ã—ã¦ã„ã¾ã™ã€‚ スライドã®ãƒšãƒ¼ã‚¸æ•°ã¯å¤šã„ã§ã™ãŒã€ï¼‘ページ当ãŸã‚Šå¹³å‡æ•°ç§’ã§èªã‚ã‚‹ã¯
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
GitHub - ulid/spec: The canonical spec for ulid
Raft
近似最近å‚探索ã®æœ€å‰ç·š
HMM, MEMM, CRF ã¾ã¨ã‚ - ã‚らã³ã日記
http://labs.cybozu.co.jp/blog/kazuho/archives/2008/06/friends_timeline.php
{{#tags}}- {{label}}
{{/tags}}