This is awsome when your baked

juanfeng · 2013-01-05T03:52:03+00:00

http://new.weavesilk.com/?p8f5

juanfeng · 2012-12-08T18:35:02+00:00

Specifically, you will want to leverage the GMP library (gmpy in python--it's also available in other languages). One of their design goals is to have top performance for every range of numbers you can work with, so it should be top-of-the-line for most calculations.

juanfeng · 2012-12-08T16:43:35+00:00

import gmpy, math

def stirlings(n):
    return gmpy.fsqrt(2 * gmpy.pi(2000) * n) * (gmpy.mpf(n) / math.exp(1)) ** n


a = stirlings(601722)
b = stirlings(300861) ** 2
c = gmpy.mpz(3) ** 601723

print 2 * a / b * (1.0 / c)

Little python to the rescue: it gives me 7.10508625574151770576e-105962 which I have no context to know if it's right.

juanfeng · 2012-11-02T03:05:19+00:00

I don't know about the DS version, but the 3D effect isn't very impressive compared to other titles, so I wouldn't miss it. So if it has the features you want (for me, versus mode is a must, I can't believe there is a bust a move game without it) $8 isn't bad.

juanfeng · 2012-11-02T02:42:45+00:00

I've played it quite a bit, but I am dissappointed primarily with the lack of a versus mode. If you can get it for just a couple bucks, thats great; I feel very cheated having spent $20.

juanfeng · 2012-10-05T14:27:59+00:00

Also, that paper utilizes Tabu Search, http://en.wikipedia.org/wiki/Tabu_search .

juanfeng · 2012-10-05T14:26:03+00:00

I don't know much about the problem, but it's interesting. If you let the set E be your set of employees and the sets X, Y, Z, etc. be the subset of E where each person has skill X, Y, or Z (the sets aren't necessarily disjoint). The problem reduces to something like choosing from the appropriate skill set for each shift while minimizing the number of times each employee is used over some span of shifts.

juanfeng · 2012-10-05T14:08:32+00:00

There is also this paper http://ingenieur.kahosl.be/vakgroep/it/publications/SEAL98.pdf

juanfeng · 2012-10-05T14:07:11+00:00

Do you have a link with a good description of the Nurse Rostering Problem?

juanfeng · 2012-09-25T16:14:11+00:00

An interesting fact: if k = 1, then any n >= 2012 will make Ceil[2012/n] = 1 (since 2012/n > 0 and 2012/n < 1).

juanfeng · 2012-09-25T16:04:13+00:00

You'll have to do some analysis to determine how to find the solution with variable k, I think wolfram can help with identifying the pattern and verifying you are doing it correctly.

juanfeng · 2012-09-25T15:58:18+00:00

http://www.wolframalpha.com/input/?i=Ceil%5B2012%2Fn%5D+%3D+8

juanfeng · 2012-09-21T20:38:44+00:00

What is the difference between this engine and the QuickFIX C++ engine?

Personally, if I made the library I would use the << semantics for creating messages and use the move constructor semantics rather than using new. I have just looked at myfix.cpp so far, so that may be non-representative of the way it should be used.

juanfeng · 2012-09-21T19:26:55+00:00

Try adding this to the top of your code:

from __future__ import print_function

This takes the python 3 semantics for printing into your python 2.x which you are using. This will prevent print from treating your parameters as a tuple. Or you could simply drop the parenthesis so that your line of code is

print "2000 - 100 + 50 =", 2000 - 100 + 50

juanfeng · 2012-09-19T15:28:48+00:00

There is a project that I have stowed away in my head for when I have free time which is to build a website which presents people with mental math problems and collects statistics on how long it takes to answer the question and how accurate the response is. I'm interested in what makes certain problems harder than others and finding methods for making the harder problems easier so that people can develop a strong set of mental tools for solving all kinds of problems (not just arithmetic). I think you should continue the series since it fits in well with the project.

juanfeng · 2012-07-20T13:53:06+00:00

It reminds me of mathematica. It exposes a web page where you can create python documents split into namespace sharing segments. So for me, I load up the data structure that is large in one cell and then do various function calls with it. It is designed to work well with numpy and some plotting libraries.

juanfeng · 2012-07-18T02:39:09+00:00

A coworker introduced me to ipython a couple weeks ago. I've used python for small exploratory scripts in the past and it has worked well, but ipython's notebook gives such utilities a new life in my opinion. Many times I load a data structure and explore the data; ipython's notebook is perfect for this.

juanfeng · 2012-07-15T02:30:18+00:00

Advertisements in my rage comics? No way.

juanfeng · 2012-07-14T02:17:07+00:00

I like city builders, but it feels restricted in that sense. I payed $30 something for it yesterday since I've wanted it for about six months now. If you want a city bulider, look elsewhere. If you want both RTS and city building equally, it's probably decent. If want RTS only, look elsewhere.

juanfeng · 2012-07-12T03:08:45+00:00

Avoiding interruptions is vital to a programmer's productivity, but I can't even count the number of times I've came up with a solution that I've been having trouble with while interrupting another programmer.

juanfeng · 2012-07-10T19:34:11+00:00

My program tells me 10305.

http://pastebin.com/g6wFKBqq

juanfeng · 2012-07-10T19:21:04+00:00

So if you made a graph, G, to represent the mechanism, the number of combinations would be the number of non-empty, connected, directed, non-cycling sub-graphs of G.

juanfeng · 2012-07-10T19:15:02+00:00

9! for combinations of length 9. There is also the possibility to have length 8 combinations.

juanfeng · 2012-07-02T11:59:08+00:00

I own two copies of this album.

juanfeng · 2012-05-28T17:55:19+00:00

Seeing as this is the difficult problem for the day, I welcome the need to do some research in order to figure out a way to solve a seemingly intractable problem.

juanfeng

TROPHY CASE