パッケージングの今と未来9. Pypa Python Packaging Authority パッケージング関連の重要なツールをメンテナンス する非公式なグループ なぜかリポジトリがgithubとbitbucketにわかれてい る github pip virtualenv bitbucket setuptools pypi distlib
Stalin
Stalin is an aggressively optimizing Scheme compiler. It is the most highly optimizing Scheme compiler, and in fact one of the most highly optimizing compilers of any sort for any language. Stalin is publicly & freely available, licensed under the GNU GPL. It was written by Jeffrey M. Siskind. In detail, Stalin is a whole-program compiler that uses advanced flow analysis & closure conversion techn
Introduction to cython
DynamicFusion is a method for reconstructing and tracking non-rigid scenes in real-time by extending KinectFusion. It uses a volumetric truncated signed distance function (TSDF) to integrate depth maps from multiple viewpoints into a global reconstruction. Live depth frames are aligned to a dense surface prediction generated by raycasting the TSDF. This closes the loop between mapping and localiza
文庫でここまで読める、フランス現代思想の９０冊
今年の２月に、岩波文庫の青帯で西洋思想がどこまで読めるかというリストを作った。 ここまで読める、連れて歩ける→岩波文庫青帯で読める西洋思想の基本書７０冊 読書猿Classic: between / beyond readers それから、その時（青帯故に）落っこちた社会科学系の古典について（岩波文庫に限定せず）文庫でどこまで読めるかというリストを先週作ってみた。 文庫でここまで読める、社会科学の古典１５０冊 読書猿Classic: between / beyond readers そうしたら、なんとなく予想はしてたのだが、「フランス現代思想が入ってない」というクレームが来た。 誰かがとっくにやっているような気がしたのだけれど、そうでもないようなのでリスト化してみる。 「フランス」現代思想なので、フランクフルト学派やガダマーやサイードはご遠慮願った。 カンギレム（1904 - 1995）のよ
半自動でNeoBundleLazy autoloadの設定をするプラグイン作りました - cafegale(LeafCage備忘録)
この記事は Vim Advent Calendar 2012 286日目の記事です。 :NeoBundleLazy に autoload機能が搭載されたのは、このAdventCalendarが始まって間もなくのことでした。 「立て！立つんだビムー！」 - sorry, unimplemented neobundle.vim の遅延処理で Vim の起動を高速化する - C++でゲームプログラミング これはVimの鈍重な立ち上がりに喘いでいたプラグイン重層派が、Vim本来の軽量な立ち上がりに立ち返り、スパルタンに対する反攻の狼煙を上げるかのように見えました。 しかしLazy autoloadを手に沸き上がる重装派に、恐るべき困難が待ち構えていたのです。 [設定がすごく面倒くさい] NeoBundleLazy設定の書式 NeoBundleLazy <リポジトリ名>, {'autoload':
Devsの常識、DBAは非常識
1. MySQL Admin が見た Devs の常識、 DBA は非常識 2013/09/14 yoku0825@MyNA PHP Conference 2013 2. ＼こんにちは！／ ● yoku0825 ● とある企業の DBA ● MySQL 歴 5 年くらい ● オラクれない ● ポスグれない ● 嫁の夫 ● せがれの父 ● 日本 MySQL ユーザ会 (MyNA) のスベり担当 3. ＼しゃべること！／ ● 日常的に MySQL のソースコードに触れる変態 DBA がフツーの Devs に投げた愛のマサカリ集 ( のつもり ) ● ウチの開発言語は PHP > Java >> Ruby らしいです ● ウチでは DBA がサーバーの構築、 Devs が設計・ テーブル構築・運営、 DBA はトラブルシュートや改 善提案 ( 運用 ) 、というサイクルで回しています。
CSS Image Orientation Lands in Firefox 26 - Psychic Core Dump
It’s never been easier to share your digital photos on the web, thanks to modern smartphones and digital cameras. For web developers, however, dealing with user-generated digital images can be far from simple. A significant mismatch exists between the web, where the orientation of an image is determined by how its pixels are stored, and digital photography, which increasingly relies on metadata to
Conal Elliott » Optimizing CCCs
In the post Overloading lambda, I gave a translation from a typed lambda calculus into the vocabulary of cartesian closed categories (CCCs). This simple translation leads to unnecessarily complex expressions. For instance, the simple lambda term, “λ ds → (λ (a,b) → (b,a)) ds”, translated to a rather complicated CCC term: apply ∘ (curry (apply ∘ (apply ∘ (const (,) △ (id ∘ exr) ∘ exr) △ (id ∘ exl)
Kent M. Pitman Answers On Lisp And Much More - Slashdot
A few weeks ago, you asked Kent M. Pitman about Lisp, Scheme, standards, and other things -- He's answered your questions below, at length. At such length, in fact, that only the first eleven of his answers are shown below -- expect more shortly! Thanks, Kent. 1) (just one thing (I) want to (know))? by An Anonymous Coward (( What ( (is) with (all) ) of (the) ()s? ) Hmmm? ) Kent M. Pitman: This que
The Trie Data Structure: A Neglected Gem | Toptal®
From the very first days in our lives as programmers, we’ve all dealt with data structures: Arrays, linked lists, trees, sets, stacks and queues are our everyday companions, and the experienced programmer knows when and why to use them. In this article we’ll see how an oft-neglected data structure, the trie, really shines in application domains with specific features, like word games. Word Games a
Conal Elliott » From Haskell to hardware via cartesian closed categories
Since fall of last year, I’ve been working at Tabula, a Silicon Valley start-up developing an innovative programmable hardware architecture called “Spacetime”, somewhat similar to an FPGA, but much more flexible and efficient. I met the founder, Steve Teig, at a Bay Area Haskell Hackathon in February of 2011. He described his Spacetime architecture, which is based on the geometry of the same name,
The Feynman Lectures on Physics
Caltech's Division of Physics, Mathematics and Astronomy and The Feynman Lectures Website are pleased to present this online edition of Now, anyone with internet access and a web browser can enjoy reading2 a high quality up-to-date copy of Feynman's legendary lectures. This edition has been designed for ease of reading on devices of any size or shape; text, figures and equations can all be zoomed
Building Clojure services at scale - Joseph Wilk
At SoundCloud I’ve been experimenting over the last year with how we build the services that power a number of heavily loaded areas across our site. All these services have been built in Clojure with bits of Java tacked on the sides. Here are some of my personal thoughts on how to build Clojure services: Netflix or Twitter At some-point when you require a sufficient level of scaling you turn to th
Debugging Optimized Code–New in Visual Studio 2012
Forecast for randomascii: programming, tech topics, with a chance of unicycling For years (decades?) one of the most requested features in Visual C++ has been better support for debugging optimized code. Visual Studio’s debug information is so limited that in a program that consists just of main(argc, argv) the VS debugger can’t accurately display argc and argv in an optimized build. All I wanted
How is Docker different from a virtual machine?
I keep rereading the Docker documentation to try to understand the difference between Docker and a full VM. How does it manage to provide a full filesystem, isolated networking environment, etc. without being as heavy? Why is deploying software to a Docker image (if that's the right term) easier than simply deploying to a consistent production environment?
プログラマの為の数学勉強会
2013年 プログラマの為の数学勉強会 資料 第1回:イントロダクション 第2回:浮動小数点数・極限・微分 第3回:微分法の応用・多変数関数の微分法 第4回:微分法の応用(続き)・方程式の数値解法 第5回:微分方程式の数値解法・積分法 第6回:数値積分法・積分法の応用 第7回:行列・ベクトル・ガウス消去法 第8回:行列式・逆行列・連立一次方程式の直接解法 第9回:線型空間・線型写像・固有値固有ベクトル(その1) 第10回:線型変換・固有値固有ベクトル(その2)・内積空間 第11回:連立一次方程式の反復解法・二次形式・多変数関数の極値・重積分 第12回:確率論入門 第13回:情報量・エントロピー・重要な確率分布・大数の法則・中心極限定理 第14回:擬似乱数の生成法・推定 第15回:検定 第16回:検定の続き, 回帰分析 第17回:回帰分析の続き 第18回:ベイズ統計
Machine Learning :: Cosine Similarity for Vector Space Models (Part III) | Terra Incognita
Machine Learning :: Cosine Similarity for Vector Space Models (Part III) * It has been a long time since I wrote the TF-IDF tutorial (Part I and Part II) and as I promissed, here is the continuation of the tutorial. Unfortunately I had no time to fix the previous tutorials for the newer versions of the scikit-learn (sklearn) package nor to answer all the questions, but I hope to do that in a close
Machine Learning :: Text feature extraction (tf-idf) – Part II | Pyevolve
Machine Learning :: Text feature extraction (tf-idf) – Part II Read the first part of this tutorial: Text feature extraction (tf-idf) – Part I. This post is a continuation of the first part where we started to learn the theory and practice about text feature extraction and vector space model representation. I really recommend you to read the first part of the post series in order to follow this se
Machine Learning :: Text feature extraction (tf-idf) – Part I | Pyevolve
Machine Learning :: Text feature extraction (tf-idf) – Part I Short introduction to Vector Space Model (VSM) In information retrieval or text mining, the term frequency – inverse document frequency (also called tf-idf), is a well know method to evaluate how important is a word in a document. tf-idf are is a very interesting way to convert the textual representation of information into a Vector Spa
Conquering Folds - School of Haskell | School of Haskell
Interactive code snippets not yet available for SoH 2.0, see our Status of of School of Haskell 2.0 blog post I've been posting a lot about comonads lately, mostly for working with folds of various flavors over lists. This time I want to take a different tack and use the tools we've been building to perform certain computations over arbitrary polynomial data types in parallel with arbitrary cuts o
A Very General Method of Computing Shortest Paths
This post is a literate Haskell file. To follow along, cut and paste the entire text of this post into a file called StarSemiring.lhs and load it up in GHCi. > module StarSemiring where I would like to introduce you to a very general algorithm that I like to call the Gauss-Jordan-Floyd-Warshall-McNaughton-YamadaGauss-Jordan-Floyd-Warshall-Kleene algorithm. With this simple algorithm (an algorithm
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Programming AWS with Python
Pythonユーザのための構成管理入門 #pyconapac
実践 C 拡張モジュール開発
GitHub - cofinalsubnets/witch_house: or, Lisp: the MUD
http://www.socallinuxexpo.org/sites/default/files/presentations/scalelinuxperformance-130224171331-phpapp01.pdf
Using Python to find occurrences of Friday the�13th - Stacks
Zipper and other Function Objects
GitHub - chriskiehl/pyrobot: A pure python windows automation library loosely modeled after Java's Robot Class.
Conal Elliott » Overloading lambda
GitHub - newsomc/pacman-cljs: HTML 5 Pac-Man written in ClojureScript.
Ramanujan's nested radical
Blog DevInterface | All our articles
GitHub - UlfNorell/insane: Toy typechecker for Insanely Dependent Types
Rock Paper Scissors with core.async — Martin Janiczek
HaskellとScalaの型システムとforall