【初音ミク】ひねくれリンゴ【オリジナル曲】食べてはいけない、禁断の果実作曲：透 作詞：椿過去の作品→mylist/38702741透 twitter→https://twitter.com/tooru34568椿 twitter→https://twitter.com/tubaki345off vocal→http://piapro.jp/t/m0XD
An Exegesis of Yoneda Structures | The n-Category Café
Guest post by Alexander Campbell We want to develop category theory in a general 2-category, in order to both generalise and clarify our understanding of category theory. The key to this endeavour is to express the basic notions of the theory of categories in a natural 2-categorical language. In this way we are continuing a theme present in previous posts from the Kan Extension Seminar, wherein mo
冗長性が低く重要度の高いパターンの抽出(1) - sfchaos's blog
パターンマイニングはデータマイニングを代表する手法の一つで，特にアソシエーションルールを適用した「ビールとおむつ」などの例が有名です． 最近は，Rなどのデータ分析ツールでもAprioriやEclat(頻出パターンマイニング), CSPADE(系列パターンマイニング)等のアルゴリズムを実行するライブラリが提供されており，パターンマイニングを実行することの障壁は比較的低くなっています． パターンマイニングでは，一般的に膨大な数のパターンが抽出されます．この事象はアイテムの組み合わせや順列の数が膨大になることに起因しており，少量のトランザクションから大量のパターンが抽出されることも決して珍しくありません*1．このような背景の下，パターンマイニングで抽出されたパターンから重要なパターンを抽出することは，大きな技術的課題の一つだと言えるでしょう． 抽出したパターンは膨大な数に 以上で説明したことを実
分散テスト実行システムRRRSpecをリリースしました - クックパッド開発者ブログ
技術部アルバイトの鈴木(@draftcode)です。 クックパッドが内部向けに開発・運用を行ってきた、分散テスト実行システムRRRSpecをオープンソースとして公開しました。RRRSpecは時間のかかる自動テストを分散処理することで、全体のテスト時間の短縮を狙うアプリケーションです。現在クックパッドでは17000を超えるテスト項目があり、マシン一台でテストを実行すると完了まで数時間かかります。このテストを60並列程度の分散処理で行うことで、平均8分から9分程度で完了できるようになりました。また、Amazon EC2のスポットインスタンスを利用することにより、大幅なコスト削減も同時に達成しました。 https://github.com/cookpad/rrrspec 分散テスト実行とは アプリケーションが大きくなるにつれて、自動テストの数も大きくなっていきます。クックパッドでは、非常に多くの
WTF, HTML and CSS?
Reasons HTML and CSS might make you say what the fuck. A curated list of commonly frustrating HTML and CSS quandaries, miscues, and dilemmas. Created by @mdo. Contents Declare a doctype Box model math Rem units and Mobile Safari Floats first Floats and clearing Floats and computed height Floated are block level Vertical margins often collapse Styling table rows Firefox and <input> buttons Firefox
Algorithms Discover Build Order From Hell
This is mad. Over on StarCraft 2 forum Teamliquid, a poster who goes by Lomilar has been talking about a program he’s coded called EvolutionChamber. It uses genetic algorithms to find powerful build orders, meaning his program takes a population of build orders, kills off the useless ones, and has the most successful ones reproduce asexually to create a new population, which tests itself again, an
Reddit - Dive into anything
What are some resources for learning theory which can relate to Haskell? Type theory, category theory, etc I have a joint bachelors in CS and math, and I've taken courses on group theory, ring theory, programming languages, and cryptography. As such, I'm confident I have the background to jump in to some theory. I could just grab a category theory book and start reading, but since I'm mostly inter
Simple recommendation system written in Ruby
I'm looking for new job; so yesterday I went through my old Rails projects, trying to describe them for my updated CV. I found interesting old project where I wrote recommendation system. Nothing fancy, just simple tag based recommendation for blog articles. I decided to extract some of the code and blog about it. Algorithm used for recommendation is based on Jaccard Index and is also known as the
backdoorCTF 2014 Write-up - kusano-k’s blog
backdoorCTFにチームsuperflipとして参加した。2630点21位。サクサク解けて面白かった。フラグは見つけたフラグのMD5ハッシュを投稿するものが多かったので、一応答えにもMD5ハッシュを付けている。指定された問題以外にもCSSとかに隠しフラグがあったらしい。 Crypto 10 画像ファイルが問題。末尾にzipファイルが付いている。解凍すると画像が出てくる。この画像も末尾にzipファイルが付いている。 6307834008eb8edbe18c7a20ee4a909d Crypto 100 公開鍵と暗号化したファイルが渡されて復号する問題。220bitのRSAなので正攻法で解ける。 >openssl rsa -pubin -text < id.pub Public-Key: (220 bit) Modulus: 0c:09:e7:ec:78:f2:f8:ad:a9:95:3
cr.yp.to: 2014.03.23: How to design an elliptic-curve signature system
Newer (Access-K): 2014.04.11: NIST's cryptographic standardization process: The first step towards improvement is to admit previous failures. #standardization #nist #des #dsa #dualec #nsa Older (Access-J): 2014.02.13: A subfield-logarithm attack against ideal lattices: Computational algebraic number theory tackles lattice-based cryptography.
Emacs support for debugging Haskell
One odd thing about the Haskell community is that we don’t use debuggers. We don’t even use stack traces. I think for several reasons: Haskell code goes wrong less often. Due to that, people are content with once in a while sticking in printf statements. Lazy evaluation is known to make debugging tricky. Haskell has no decent editor support for debugging. It’s at least my experience that when my H
What is the optimal algorithm for the game 2048?
I have recently stumbled upon the game 2048. You merge similar tiles by moving them in any of the four directions to make "bigger" tiles. After each move, a new tile appears at random empty position with a value of either 2 or 4. The game terminates when all the boxes are filled and there are no moves that can merge tiles, or you create a tile with a value of 2048. One, I need to follow a well-def
BLAKE2: “Harder, Better, Faster, Stronger” Than MD5 - Least Authority
Blog » BLAKE2: “Harder, Better, Faster, Stronger” Than MD5 Best read while listening to Daft Punk: Harder, Better, Faster, Stronger Why use BLAKE2 instead of Skein, Keccak (SHA-3), MD5, or SHA-1 as a secure hash function? BLAKE was the best-rated hash function in the SHA-3 competition NIST, in the final report of the SHA-3 competition, said this about the finalists (which included BLAKE, Keccak, S
Playing with asyncio
Lately I’ve been playing with asyncio, a new package being introduced in Python 3.4 for rebooted asynchronous IO support in the standard library. It’s very nice, and despite there being no documentation apart from the PEP at the moment, I’ve found it quite straight forward to work with. I thought I’d share some examples and compare it to my experiences with Gevent and Twisted. While Gevent and Twi
実践・最強最速のアルゴリズム勉強会 第三回講義資料(ワークスアプリケーションズ & AtCoder)
最小カットを使って「燃やす埋める問題」を解く方法について、問題とソースコードつきで、まとめました。ニコニコ生放送「TopCoderでプログラムしてみた」2000回記念放送の資料です。
Julia vs. Python: Monte Carlo Simulations of Bitcoin Options | Justin
I was introduced to Julia recently after hearing of Stefan Karpinski while attending HackerSchool. Julia is marketed as a super fast high performance scientific computing language that can reach speeds close to native C code. After attending a conference for Python quants in NYC and heard Dr. Yves J. Hilpisch speak on the speed of Python for financial analytics I decided to put Julia up against th
ŷhat | Predicting customer churn with scikit-learn
Customer Churn "Churn Rate" is a business term describing the rate at which customers leave or cease paying for a product or service. It's a critical figure in many businesses, as it's often the case that acquiring new customers is a lot more costly than retaining existing ones (in some cases, 5 to 20 times more expensive). Understanding what keeps customers engaged, therefore, is incredibly valua
Type Providers From the First Floor - Mavnn's blog
This post follows on directly from my previous post Type Providers from the Ground Up. I highly recommend that you read that first, and check out the relevant example code from GitHub. It's also a bit epic… grab yourself a coffee before you start. So we have a working type provider now. Unfortunately, we're missing out on at least two major features that your new type provider will almost certainl
Explain Git with D3
We are going to skip instructing you on how to add your files for commit in this explanation. Let's assume you already know how to do that. If you don't, go read some other tutorials. Pretend that you already have your files staged for commit and enter git commit as many times as you like in the terminal box. git branch name will create a new branch named "name". Creating branches just creates a n
Functional image processing in D | CyberShadow's blog
I’ve recently completed an overhaul of the graphics package of my D library. The goals for the overhaul were inspired by D’s std.algorithm and std.range modules: Present everything as small, composable components Avoid implicit copying and prefer lazy evaluation Use templates for efficient code From its first iteration, all components of the image processing package were templated by the color typ
ビットごとの秘法と技法 から
最も右のビットの位置を知る法 TAOCP 7.1.3はbitwise tricks and techniques(ビットごとの秘法と技法)で楽しい話題が満載だ. このブログで以前取り上げたビットスワップもそこにある. 今回の話は計算機にある語xの最も右にある1のビットの位置を計算するもので, x = 0なら1のビットはないから, エラーか不定とするか無限大とするかだが, その辺はどうでもいいのでx≠0 の場合を考える. xに対してこの位置をρ(x)で表すので, 位置を求めるアルゴリズムをρ関数という. ρは右(right)のRに対応するギリシア語のアルファベット(小文字)である. これに対し最も左のビットはTAOCPではleftのLのギリシア語のλという. λはLisp屋にはちょっと困る命名だ. 二進法での計算に慣れている人は, 最も右の1のビットを取り出すのが簡単なことは知っている. x
ビットごとの秘法と技法 から
最も左のビットの位置を知る法 二進法で表したxの最も左の1のビットの位置λ(x)は, 2を底とする対数lgがあれば簡単だ. λ(x)=⌊lg (x)⌋ たしかに (lg 1) => 0 (lg 2) => 1. (lg 3) => 1.5849625007211563 (lg 4) => 2. (lg 5) => 2.321928094887362 (lg 6) => 2.584962500721156 (lg 7) => 2.807354922057604 (lg 8) => 3. になっている. TAOCPでの最初の方法は浮動小数点演算命令による. FLOTU y,ROUND_DOWN,x; SUB y,y,fone; SR lam,y,52 ここで fone=#3ff0000000000000. これでうまく行く理由だが, MMIXの浮動小数点はIEEE/ANSI standard
Monoid Morphisms, Products, and Coproducts - Higher Order
Today I want to talk about relationships between monoids. These can be useful to think about when we’re developing libraries involving monoids, and we want to express some algebraic laws among them. We can then check these with automated tests, or indeed prove them with algebraic reasoning. This post kind of fell together when writing notes on chapter 10, “Monoids”, of Functional Programming in Sc
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Periodic phenomena
http://www.cs.ox.ac.uk/ralf.hinze/Kan.pdf
simple-genetic-algorithm
Linux女子部 iptables復習編
Constant propagation
Using ASCIIPlots.jl | Leah Hanson
Editing binaries
Peter Kacherginsky – Medium
Ruby on Rails Hacking Guide
正規表現入門 星の高さを求めて
GitHub - edkolev/erlang-motions.vim: Motions and text objects for erlang!
Getting acquainted with Clojure zippers - josf.info
Gamasutra: Amir Fassihi's Blog - "0 – 60 fps in 14 days!" What we learned trying to optimize our game using Unity3D.
GitHub - nosir/obelisk.js: Build pixel isometric graphics with HTML5 canvas
Datalicious Notebookmania – My favorite 7 IPython Notebooks
https://gobuild.io/