Proposal for monoidal category classes in the base Haskell library Introduction and rationale Why more category classes in base? Because monoidal categories are a very common abstraction under the guise of many things: for example, every arrow (and generalised arrow) is a monoidal category; and every Cartesian category (that is, with products) is also a monoidal category. Additional structures whi
Conrad Barski’s Land of Lisp develops a simple board game from chapter 15 onwards, as an example of using functional-style programming in Common Lisp. The game, Dice of Doom, uses a hexagonally-tiled board where two or more players occupy various cells on the board and can attack each other subject to some rules. In this series we’ll rewrite the game using Haskell. The source code for this can be
Reflecting strictness in Haskell types In GHC, from the operational point of view, the type Int does not indicate a bit pattern somewhere in memory that represents an integer. What it indicates is either an integer bit pattern or a “thunk” (a delayed computation) which can be “forced” (run). When and if the computation terminates the thunk will be overwritten with the integer bit pattern that it p
Summary: I've just released a new version of Shake, with a --demo feature and an underlying continuation monad. I want to release v1.0 in the near future. I've just released a new version of the Shake build system, version 0.13.3. While the version number is only 0.0.1 higher, the changelog lists a large number of improvements. In particular, two changes are: The Action monad is now based on conti
Think back to the first piece of code you wrote. It was probably some form of “Hello World.” Do you remember the joy and fascination you felt? The rush of commanding what felt like magic? The sudden realization of potentiality? Let’s revisit that time by implementing a simple language that supports Hello World. Over time, it will grow to be a Python interpreter. We will slowly implement larger and
Interactive code snippets not yet available for SoH 2.0, see our Status of of School of Haskell 2.0 blog post Like the term "monad", "monoid" can be a bit intimidating: Why would I want to think about math while I'm doing real world programming?!? One answer is that thinking in terms of monoids can be very beneficial to parallelism and efficient data structures. Using the Monoid interface in Haske
Author’s note: this article used to be called “What Every Computer Programmer Should Know About Floating Point, part 1”. Some people noted that this was perhaps too similar to the name of the existing article “What Every Computer Scientist Should Know About Floating Point”. Since I have a bunch of other articles called “X Demystified”, I thought I’d rename this one to remove confusion. The subject
Forecast for randomascii: programming, tech topics, with a chance of unicycling This post is a more carefully thought out and peer reviewed version of a floating-point comparison article I wrote many years ago. This one gives solid advice and some surprising observations about the tricky subject of comparing floating-point numbers. A compilable source file with license is available. We’ve finally
テクスチャマッピングに変革をもたらす「Ptex法」とは? 無駄なメモリ消費を減らす技術の正体に迫る ライター:西川善司 竹重雅也氏(Developer Technology Engineer,NVIDIA) テクスチャマッピングの世界に「Ptex」と呼ばれる新たな手法が登場して,注目を集め始めている。先頃行われたCEDEC 2014でも,NVIDIAの竹重雅也氏が「リアルタイムレンダリングにおけるPtex手法について」と題した講演を行い,この新しい手法の利点と課題を説明した。そこで本稿では,竹重氏による講演の概要をレポートしたい。 テクスチャマッピング技術が抱える問題とは? CGの世界に限ったことではないが,長らく使われてきた手法が必ずしも良いものだとは限らない。優れた方法が別にあると分かっていたとしても,ハードウェア性能の限界などによって「その手法しか選べない」ということはままある。そし
Introducing Ariadne: F# library for Gaussian processes 15 September 2014 For my academic research, I recently wrote a library in F# for fitting basic Gaussian process regression that I used to model time-series gene expression data. I am releasing the code publicly as an Ariadne package. In its current state, you can use the library to model various time-series data. Gaussian processes are probabi
Alex Payne wrote an excellent essay called Thoughts on Five Years of Emerging Languages. It called to mind something I wrote a while ago for a limited audience that I never got around to turning into a public form. Thanks to Manuel Chakravarty for the link and the inspiration. For those who read my blog for Cocoa (and recently Swift) discussion, you may be surprised that most of my professional wo
Improved OCaml Memcached client with Core and Async 17 Sep 2014 In the previous blog post, we implemented a simple OCaml library for talking to Memcached with the binary protocol using bitstring. The code uses the baked-in standard library and synchronous IO (blocking), so a lot of time will be wasted waiting for IO. The standard library replacement Core offers cooperative threading with callbacks
Using Intel.com Search You can easily search the entire Intel.com site in several ways. Brand Name: Core i9 Document Number: 123456 Code Name: Emerald Rapids Special Operators: “Ice Lake”, Ice AND Lake, Ice OR Lake, Ice* Quick Links You can also try the quick links below to see results for most popular searches. Product Information Support Drivers & Software
Sections Sections Principal Component Analysis PCA and linear dimensionality reduction Nonlinear dimensionality reduction Kernel functions and the kernel trick Gaussian radial basis function (RBF) Kernel PCA Implementing the RBF kernel PCA step-by-step 1. Computation of the kernel (similarity) matrix. 2. Eigendecomposition of the kernel matrix. Examples of RBF Kernel PCA Half-moon shapes Linear PC
Rust 1.0 is on its way! We have nailed down a concrete list of features and are hard at work on implementing them. We plan to ship the 1.0 beta around the end of the year. If all goes well, this will go on to become the 1.0 release after the beta period. After 1.0 is released, future 1.x releases will be backwards compatible, meaning that existing code will continue to compile unmodified (modulo c
Learning Vim in 2014 was a series of posts I wrote in July & August 2014 documenting a process for newcomers to learn Vim. It was inspired by my own experience learning Vim, running into many out of date resources and online resources that gave me just a quick list of tips, plugins or commands. This is a “point in time” snapshot of one man’s advice on how to learn Vim. It is by no means comprehens
サイトの構築。作品の販売。ブログの投稿。この他にもさまざまな機能があります。 ログイン サイトをはじめよう 非公開サイト このサイトは現在プライベート設定になっています。
What are transducers? Using transducers is easy enough—but how do they work underneath the hood? This article explores transducers by ignoring transducers. Instead we will examine two ordinary functions, map and filter. We’ll play with them and scrutinize them. And we’ll marvel at the power of higher-order functions as we apply abstractions. And perhaps, if we’re lucky, we’ll bump into transducers
はじめに S. Wang & C. D. Manning, Baselines and Bigrams: Simple, Good Sentiment and Topic Classificatioin Naive Bayes素性を利用したSVM(NBSVM)なるものを試してみる。 SVM with NB features(NBSVM) Log-count ratio r = log( (p / ||p||_1) / (q / ||q||_1) ) 正例カウントベクトル p = α + Σ_{i:y_i=1} f_i 負例カウントベクトル q = α + Σ_{i:y_i=-1} f_i f_i : 各事例iにおける素性ベクトル α : スムージング用パラメータ モデル w' = (1-β) * w~ + β * w w~ : ||w||_1 / |V| β : 補間パラメータ(0〜1)
I was rather impressed with the impressions and feedback I received for my Opinion phrases prototype - code repository here. So yesterday, I have decided to rewrite my previous post on topic prediction for short reviews using Latent Dirichlet Analysis and its implementation in gensim. I have previously worked with topic modeling for my MSc thesis but there I used the Semilar toolkit and a looot of
ヤフー株式会社は、2023年10月1日にLINEヤフー株式会社になりました。LINEヤフー株式会社の新しいブログはこちらです。LINEヤフー Tech Blog こんにちは。システム統括本部 データソリューション本部の宮崎です。 最近ディープラーニングと呼ばれる技術の話題を耳にすることが増えてきました。 この記事ではディープラーニングの手法を実装し画像認識系の用途で便利に使えるCaffeというツールの使い方を紹介します。 Caffeの概要 Caffeは、C++で実装されGPUに対応した高速なディープラーニングのライブラリです。 大規模画像認識のコンテストILSVRCで2012年にトップとなった畳込みニューラルネットワークの画像分類モデル[1]がすぐに利用できるようになっています。 Caffeは、カリフォルニア大学バークレー校のコンピュータビジョンおよび機械学習に関する研究センターであるBV
August 7, 2013 Pipes and Filters Pipelines are an extremely useful (and surprisingly underused) architectural pattern in modern software engineering. The concept of using pipes and filters to control the flow of data through software has been around since the 1970s, when the first Unix shells were created. If you’ve ever used the pipe (“|”) character in a terminal emulator, you’ve made use of the
So you've developed a machine learning algorithm! Awesome, but now what? This blog post will show how to deploy a machine learning model into a production environment. Now you can get some use out of all those models you've spent so much time fine tuning! Deploying models? Why bother? Before we get to the fun part of putting a ML algorithm into production, lets quickly take stock of a few things.
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く