--- Log opened Tue Mar 12 00:00:11 2013 | ||
-!- FSCV [~FSCV@206.225.135.24] has quit [Quit: Leaving] | 00:58 | |
shogun-buildbot | build #275 of nightly_none is complete: Failure [failed compile] Build details are at http://www.shogun-toolbox.org/buildbot/builders/nightly_none/builds/275 | 03:01 |
---|---|---|
-!- blackburn1 [~blackburn@188.168.14.162] has joined #shogun | 06:39 | |
-!- blackburn [~blackburn@83.234.54.98] has quit [Ping timeout: 245 seconds] | 06:39 | |
blackburn1 | sonney2k: nice song | 06:52 |
blackburn1 | :D | 06:52 |
blackburn1 | sonney2k: git://github.com/airblade/vim-gitgutter.git | 07:02 |
blackburn1 | (if you are still using vim) | 07:02 |
blackburn1 | :) | 07:02 |
-!- blackburn1 [~blackburn@188.168.14.162] has quit [Quit: Leaving.] | 07:21 | |
-!- n4nd0 [~nando@n177-p170.kthopen.kth.se] has joined #shogun | 07:56 | |
-!- blackburn [~lisitsin@212.46.246.30] has joined #shogun | 08:20 | |
sonne|work | blackburn: I am still undecided... | 09:01 |
blackburn | sonne|work: a nice feature anyway | 09:04 |
sonne|work | blackburn: yes indeed... I am already used to that from eclipse btw | 09:08 |
blackburn | sonne|work: have you heard hinton is joining google? | 09:32 |
sonne|work | interesting. I guess he wants to create google brain(tm) | 09:34 |
blackburn | sonne|work: yeah infinitely deep network | 09:38 |
sonne|work | a c'mon a few million layers should be enough for everybody :) | 09:39 |
-!- sumit_ [73f91219@gateway/web/freenode/ip.115.249.18.25] has joined #shogun | 09:39 | |
blackburn | sonne|work: 640K | 09:40 |
sonne|work | true that | 09:40 |
blackburn | as a hipster teenager I should tweet that | 09:42 |
blackburn | or may be I should write it down to my moleskine and instagram it with my iphone.. | 09:43 |
blackburn | sad I don't have either hah | 09:43 |
-!- heiko [~heiko@nat-168-237.internal.eduroam.ucl.ac.uk] has joined #shogun | 10:59 | |
-!- sumit_ [73f91219@gateway/web/freenode/ip.115.249.18.25] has quit [Ping timeout: 245 seconds] | 11:36 | |
blackburn | heiko: okay that MDS thing must be changed | 12:12 |
heiko | blackburn: ok will do tonight | 12:13 |
blackburn | heiko: I will :) | 12:13 |
heiko | blackburn: just dicovered the coolness of Eigen3 :) | 12:13 |
blackburn | heiko: hah congraatz | 12:13 |
heiko | (compared to boost lina classes :) | 12:13 |
blackburn | heiko: that's kind of late discover :) | 12:14 |
heiko | blackburn: well so far I did not need it | 12:14 |
heiko | c++ array were sufficient | 12:15 |
blackburn | heiko: explicit SSE is somewhat important speedup I think | 12:15 |
heiko | what is that? | 12:15 |
blackburn | heiko: when you compute norm your CPU can handle two doubles per op | 12:16 |
heiko | blackburn: I see, thats good stuff | 12:16 |
blackburn | heiko: eigen does all vectorization explicitly (when compiler can be afraid of doing that) | 12:16 |
heiko | blackburn: what does that mean vectorization? | 12:17 |
blackburn | heiko: SIMD (single instruction multiple data), i.e. SSE | 12:19 |
blackburn | heiko: (at least SSE) | 12:19 |
heiko | blackburn: I see | 12:19 |
heiko | cool | 12:19 |
heiko | good stuff! :) | 12:19 |
blackburn | heiko: some more magic of eigen is in template expression though | 12:20 |
heiko | yeah this is what I meant | 12:20 |
heiko | this is really cool and seems flexible | 12:20 |
blackburn | heiko: a = b + c + d; means no copy | 12:20 |
blackburn | as operator+ returns some thing that can be added to other vector and finally it is evaluated to a[i] = b[i] + c[i] + d[i] (but vectorized) | 12:21 |
n4nd0 | do you guys know if // means something special in python? I have found it in some code as an operator between two integers | 12:22 |
n4nd0 | I have seen it does the same as / for simple cases | 12:22 |
n4nd0 | i.e. integer division | 12:22 |
heiko | n4nd0: no idea :) | 12:23 |
heiko | n4nd0: but python has strange operators sometimes x**2 for example | 12:23 |
heiko | to I guess // is related to that | 12:23 |
blackburn | n4nd0: 3//1 => 3 | 12:23 |
n4nd0 | floor division! | 12:23 |
blackburn | ha | 12:23 |
blackburn | 3//2.0 => 1.0 | 12:24 |
blackburn | n4nd0: ^ | 12:24 |
n4nd0 | I see, thanks! | 12:24 |
n4nd0 | so actually if both of them are integers, it doesn't make any difference wrt using / | 12:24 |
n4nd0 | more explicit though | 12:25 |
blackburn | heiko: I took a look at your statistics code - pretty well organized | 12:30 |
heiko | blackburn: thanks :) what did you look at in particular? | 12:30 |
blackburn | heiko: glanced over classes | 12:31 |
heiko | linear time mmd is the best one ! :) | 12:31 |
blackburn | heiko: pretty big | 12:32 |
heiko | yes, it does a lot of things | 12:32 |
heiko | remember: it can handle infinite amounts of data | 12:32 |
heiko | (and do automatic optimal kernel selection for that) | 12:33 |
blackburn | heiko: I still do not understand how to use it but that's nice | 12:33 |
heiko | blackburn: on streams | 12:33 |
heiko | changepoint detection for example | 12:33 |
heiko | but to be honest, it is not that widely used :) | 12:34 |
blackburn | heiko: what is changepoint detection? | 12:34 |
heiko | you have a stream of data and want to know when it changes | 12:34 |
heiko | so imagine a brain-scanner | 12:34 |
heiko | and you change your thought :) | 12:34 |
heiko | (roughly) | 12:34 |
heiko | test whether a distribution changes | 12:34 |
blackburn | heiko: what would I need to pass to that algorithm? | 12:34 |
heiko | first one needs a change point detection algo | 12:35 |
heiko | the MMD does the following | 12:35 |
heiko | you pass samples from two distributions p and q | 12:35 |
heiko | and it tells you whether p!=q | 12:35 |
blackburn | but how is that changepoint? | 12:35 |
heiko | you can also use that to select kernels for classification since it will tell you which kernel maximises the difference | 12:36 |
heiko | blackburn: you have to embed it into other things | 12:36 |
heiko | there is a paper somewhere | 12:36 |
heiko | how to do that | 12:36 |
heiko | you have like groups and test one against others | 12:36 |
blackburn | heiko: so I first collect some normal data? | 12:36 |
blackburn | heiko: I see some 'business' case | 12:37 |
heiko | yes | 12:37 |
blackburn | imagine I have a website | 12:38 |
blackburn | and collect visitors data | 12:38 |
blackburn | that's P | 12:38 |
blackburn | and then I change something in my adverstisement and collect more data | 12:38 |
blackburn | that's Q | 12:38 |
heiko | yep thats a thing you could do | 12:39 |
blackburn | so I define some kernel on visiting data and check if distribution of P and Q | 12:39 |
blackburn | are equal | 12:39 |
blackburn | quite interesting | 12:39 |
heiko | blackburn: yeah its a bit like classification | 12:39 |
blackburn | heiko: I was recently asked about possible way to solve similar problem | 12:39 |
blackburn | heiko: but P>Q | 12:39 |
heiko | but more the qeustion: are there differences | 12:39 |
heiko | you mean number of samples? | 12:40 |
blackburn | heiko: not really | 12:40 |
blackburn | heiko: not correct formulation though :) | 12:40 |
blackburn | heiko: guy needed to check if site with # of clicks P has more efficient adv than site with # of clicks Q | 12:41 |
blackburn | or so | 12:41 |
blackburn | heiko: he actually had only means so I said that's quite impossible if you just have means | 12:41 |
heiko | thats quite little information :) | 12:42 |
blackburn | as he needed to do that with 0.95 confidence heh | 12:42 |
blackburn | no way to compute anything with confidence without probability distribution I guess | 12:42 |
blackburn | or at least variance.. | 12:43 |
heiko | you need samples then you can do that | 12:44 |
blackburn | heiko: I am actually unsure what is sample here | 13:02 |
blackburn | # of clicks per some period may be | 13:03 |
-!- heiko [~heiko@nat-168-237.internal.eduroam.ucl.ac.uk] has quit [Quit: Leaving.] | 14:30 | |
sonne|work | blackburn: you seem to be so very excited about sse stuff in eigen - note that the standard gcc compiler will vectorize your simple for loops too so no need to be overly excited | 14:54 |
blackburn | sonne|work: I am actually more excited about it gives you an API to do that stuff | 15:01 |
sonne|work | yeah that is the benefit of it | 15:01 |
blackburn | sonne|work: good code contains almost no loops | 15:01 |
blackburn | sonne|work: it is not true sometimes - gcc don't care about aliasing | 15:02 |
-!- heiko [~heiko@nat-168-237.internal.eduroam.ucl.ac.uk] has joined #shogun | 15:02 | |
blackburn | sonne|work: so it could fail with that | 15:02 |
blackburn | sonne|work: I am really unsure if gcc will be able to SIMDize some function which takes double* as a parameter | 15:04 |
sonne|work | I would bet so | 15:04 |
blackburn | sonne|work: anyway you can't say it does that in all cases that eigen does | 15:05 |
blackburn | sonne|work: for example ICC vectorization is known to be more powerful (so there is a room) | 15:05 |
-!- heiko [~heiko@nat-168-237.internal.eduroam.ucl.ac.uk] has quit [Ping timeout: 252 seconds] | 15:07 | |
blackburn | sonne|work: about alignment issues: http://gcc.gnu.org/projects/tree-ssa/vectorization.html#assume-aligned | 15:07 |
blackburn | I think there won't be such thing if it could determine that in 100% cases | 15:08 |
-!- FSCV [~FSCV@78.129.244.119] has joined #shogun | 15:44 | |
wiking | blackburn: i'm going to russian for 5 days... :) | 15:52 |
-!- blackburn [~lisitsin@212.46.246.30] has quit [Ping timeout: 245 seconds] | 16:00 | |
-!- blackburn [~lisitsin@mxs.kg.ru] has joined #shogun | 16:14 | |
-!- shogun-notifier- [~irker@7nn.de] has joined #shogun | 16:36 | |
shogun-notifier- | shogun: Sergey Lisitsyn :master * b6c25aa / examples/undocumented/python_modular/converter_multidimensionalscaling_modular.py: https://github.com/shogun-toolbox/shogun/commit/b6c25aa6ddcc3dd07f1d94f2970fb331bc9a8702 | 16:36 |
shogun-notifier- | shogun: An attempt to get MDS example make more sense | 16:36 |
-!- tom____ [2eda6d52@gateway/web/freenode/ip.46.218.109.82] has joined #shogun | 16:38 | |
tom____ | hi! | 16:38 |
tom____ | I would like to use the sosvm framework in shogun | 16:38 |
tom____ | Is there any example of usage with sequential data ? | 16:39 |
-!- FSCV [~FSCV@78.129.244.119] has quit [Quit: This computer has gone to sleep] | 16:39 | |
n4nd0 | hey tom____ ! | 16:45 |
n4nd0 | nice to hear you want to use the sosvm framework :) | 16:45 |
tom____ | n4nd0: hey n4nd0 | 16:46 |
n4nd0 | tom____: take a look to examples so_hmsvm_mosek.cpp and so_hmsvm_mosek_simple.cpp in examples/undocumented/libshogun | 16:46 |
tom____ | n4nd0: then mosek need to be installed ? | 16:46 |
n4nd0 | tom____: and for the python interface, structure_hmsvm_* | 16:46 |
n4nd0 | tom____: not really | 16:47 |
n4nd0 | there is a solver that makes use of mosek | 16:47 |
n4nd0 | for the examples with mosek in the name you need it | 16:47 |
n4nd0 | but we have also some bundle methods implemented | 16:47 |
n4nd0 | look for example structure_hmsvm_bmrm.py in examples/undocumented/python_modular | 16:47 |
n4nd0 | sorry for the misleading name so_ in some of them - I will rename those to structure_ | 16:48 |
tom____ | n4nd0: ok thank you | 16:54 |
n4nd0 | tom____: no problem | 16:54 |
tom____ | n4nd0: I use most of the time c++ then I will take a lokk to CDualLibQPBMSOSVM | 16:54 |
tom____ | that's the bundle isn't it ? | 16:54 |
n4nd0 | tom____: yeah | 16:54 |
-!- shogun-t1olbox [~shogun@7nn.de] has quit [Ping timeout: 264 seconds] | 16:54 | |
--- Log closed Tue Mar 12 16:54:27 2013 | ||
--- Log opened Tue Mar 12 16:54:34 2013 | ||
-!- shogun-toolbox [~shogun@7nn.de] has joined #shogun | 16:54 | |
-!- Irssi: #shogun: Total of 12 nicks [1 ops, 0 halfops, 0 voices, 11 normal] | 16:54 | |
!wright.freenode.net [freenode-info] help freenode weed out clonebots -- please register your IRC nick and auto-identify: http://freenode.net/faq.shtml#nicksetup | 16:54 | |
-!- Irssi: Join to #shogun was synced in 7 secs | 16:54 | |
n4nd0 | tom____: there are also examples using the bundle method in the C++ interface | 16:54 |
n4nd0 | tom____: examples/undocumented/libshogun/so_multiclass_BMRM.cpp | 16:55 |
n4nd0 | that's not dealing with sequential data | 16:55 |
n4nd0 | but for that part you can always check the other examples | 16:56 |
tom____ | such ? | 16:56 |
n4nd0 | the ones I mentioned before | 16:56 |
n4nd0 | e.g. so_hmsvm_mosek | 16:57 |
n4nd0 | you can exchange models and solvers as you wish | 16:57 |
n4nd0 | so if you are interested in the bundle methods -> check things with bmrm | 16:58 |
n4nd0 | if you are interested in sequential data -> things with hmsvm | 16:58 |
n4nd0 | tom____: see what I mean? | 16:58 |
tom____ | n4nd0: allright | 16:58 |
tom____ | n4nd0: thank you | 16:59 |
n4nd0 | you are welcome | 16:59 |
-!- travis-ci [~travis-ci@ec2-54-234-212-155.compute-1.amazonaws.com] has joined #shogun | 17:03 | |
travis-ci | [travis-ci] it's Sergey Lisitsyn's turn to pay the next round of drinks for the massacre he caused in shogun-toolbox/shogun: http://travis-ci.org/shogun-toolbox/shogun/builds/5444155 | 17:03 |
-!- travis-ci [~travis-ci@ec2-54-234-212-155.compute-1.amazonaws.com] has left #shogun [] | 17:03 | |
n4nd0 | error in travis, "no space left on device"??!? | 17:04 |
n4nd0 | gtg now, see you later | 17:06 |
-!- n4nd0 [~nando@n177-p170.kthopen.kth.se] has quit [Quit: leaving] | 17:07 | |
-!- tom____ [2eda6d52@gateway/web/freenode/ip.46.218.109.82] has quit [Quit: Page closed] | 17:11 | |
wiking | lool | 17:27 |
wiking | wtf is this | 17:27 |
-!- blackburn [~lisitsin@mxs.kg.ru] has quit [Quit: Leaving.] | 17:32 | |
-!- heiko [~heiko@pat-191-250.internal.eduroam.ucl.ac.uk] has joined #shogun | 18:06 | |
-!- zxtx [~zv@cpe-75-83-151-252.socal.res.rr.com] has quit [Ping timeout: 264 seconds] | 18:52 | |
-!- blackburn [~blackburn@188.168.13.118] has joined #shogun | 18:53 | |
-!- FSCV [~FSCV@187.210.54.166] has joined #shogun | 19:16 | |
-!- FSCV_ [~FSCV@204.45.132.11] has joined #shogun | 19:20 | |
-!- FSCV [~FSCV@187.210.54.166] has quit [Ping timeout: 245 seconds] | 19:21 | |
-!- shogun-notifier- [~irker@7nn.de] has quit [Quit: transmission timeout] | 19:36 | |
-!- FSCV_ [~FSCV@204.45.132.11] has quit [Ping timeout: 240 seconds] | 20:20 | |
-!- FSCV_ [~FSCV@65.19.131.247] has joined #shogun | 20:22 | |
-!- heiko [~heiko@pat-191-250.internal.eduroam.ucl.ac.uk] has left #shogun [] | 21:56 | |
-!- sumit [73f91219@gateway/web/freenode/ip.115.249.18.25] has joined #shogun | 22:05 | |
-!- sumit [73f91219@gateway/web/freenode/ip.115.249.18.25] has quit [Client Quit] | 22:06 | |
-!- n4nd0 [~nando@s83-179-44-135.cust.tele2.se] has joined #shogun | 22:09 | |
blackburn | alright GPs are broken nice | 22:17 |
n4nd0 | blackburn: how badly? | 22:21 |
n4nd0 | what is it with them?? | 22:21 |
blackburn | n4nd0: heiko reports it's results are non-sense | 22:21 |
blackburn | sonney2k: directors work here | 22:21 |
blackburn | 2.0.8 | 22:37 |
blackburn | trying 2.0.9 | 22:37 |
-!- n4nd0 [~nando@s83-179-44-135.cust.tele2.se] has quit [Ping timeout: 264 seconds] | 23:02 | |
-!- shogun-notifier- [~irker@7nn.de] has joined #shogun | 23:10 | |
shogun-notifier- | shogun: Sergey Lisitsyn :master * f4696ee / src/shogun/evaluation/DirectorContingencyTableEvaluation.h: https://github.com/shogun-toolbox/shogun/commit/f4696ee7d06ba8ed097ed45ff74ac4c78ec12a44 | 23:10 |
shogun-notifier- | shogun: A fix for director contingency evaluation class | 23:10 |
-!- n4nd0 [~nando@s83-179-44-135.cust.tele2.se] has joined #shogun | 23:12 | |
n4nd0 | blackburn: I also tried out a couple of director examples here this morning | 23:13 |
n4nd0 | they worked fine | 23:13 |
blackburn | n4nd0: evaluation one was wrong and I fixed it just a mniute ago | 23:14 |
n4nd0 | blackburn: nice | 23:14 |
blackburn | n4nd0: about results | 23:17 |
blackburn | (in paper) | 23:17 |
n4nd0 | blackburn: tell me | 23:18 |
blackburn | n4nd0: I think I've got to try to optimize it | 23:18 |
n4nd0 | blackburn: what is the part that concerns you? | 23:18 |
blackburn | n4nd0: I'd like to show >3x speedup always (that's the reason to parallelize code) | 23:18 |
blackburn | n4nd0: I am surprised with speed of lle | 23:19 |
blackburn | in drtoolbox | 23:19 |
blackburn | n4nd0: 8 CPUs? really? | 23:19 |
n4nd0 | blackburn: that's what /proc/cpuinfo tells me | 23:20 |
n4nd0 | I can paste it if you want to check | 23:20 |
blackburn | yeah could you please | 23:20 |
blackburn | I'd rather expect 2 cpus with 4 cores | 23:21 |
n4nd0 | http://pastebin.com/GTVJNDwk | 23:22 |
n4nd0 | blackburn: well it may be | 23:22 |
n4nd0 | I have an i7 here | 23:22 |
n4nd0 | an proc/cpuinfo shows me 4 processors | 23:22 |
blackburn | n4nd0: does it happen to have intel compiler around? | 23:23 |
n4nd0 | blackburn: how can I check that? | 23:23 |
blackburn | n4nd0: X3470 is 4 core | 23:23 |
blackburn | n4nd0: 'icpc' may be | 23:23 |
n4nd0 | comman not found | 23:23 |
n4nd0 | command* | 23:23 |
blackburn | may be anything in /opt/intel? | 23:24 |
n4nd0 | no directory | 23:24 |
blackburn | n4nd0: hmm alright | 23:25 |
blackburn | n4nd0: what is ubuntu version? | 23:26 |
n4nd0 | Ubuntu 12.04.2 LTS | 23:27 |
n4nd0 | precise pangolin IIRC | 23:27 |
blackburn | n4nd0: and matlab 2011a, right? | 23:27 |
n4nd0 | yep | 23:28 |
blackburn | alright thanks | 23:30 |
n4nd0 | blackburn: a pleasure :) | 23:30 |
n4nd0 | blackburn: so how can we speed it up? | 23:31 |
-!- travis-ci [~travis-ci@ec2-54-234-212-155.compute-1.amazonaws.com] has joined #shogun | 23:35 | |
travis-ci | [travis-ci] it's Sergey Lisitsyn's turn to pay the next round of drinks for the massacre he caused in shogun-toolbox/shogun: http://travis-ci.org/shogun-toolbox/shogun/builds/5455109 | 23:35 |
-!- travis-ci [~travis-ci@ec2-54-234-212-155.compute-1.amazonaws.com] has left #shogun [] | 23:35 | |
blackburn | n4nd0: no idea actually | 23:35 |
blackburn | n4nd0: what if you run scaling thing? | 23:35 |
n4nd0 | blackburn: what? | 23:36 |
n4nd0 | blackburn: ah sorry yeah | 23:36 |
blackburn | n4nd0: python benchmark.py scaling | 23:36 |
n4nd0 | blackburn: let's do it | 23:36 |
blackburn | n4nd0: I am curious what is $\infty$ | 23:37 |
blackburn | I'd avoid offensive claims that waffles didn't finish in 10 hours | 23:37 |
n4nd0 | Tapkee parallel implementations benchmark | 23:37 |
n4nd0 | Isomap on Swissroll with 1 threads takes 17.2111s | 23:37 |
n4nd0 | Isomap on Swissroll with 2 threads takes 9.5318s | 23:37 |
n4nd0 | Isomap on Swissroll with 3 threads takes 6.8726s | 23:37 |
n4nd0 | Isomap on Swissroll with 4 threads takes 5.5947s | 23:37 |
n4nd0 | Isomap on Swissroll with 5 threads takes 5.5965s | 23:37 |
blackburn | but it is true in the end.. | 23:37 |
n4nd0 | blackburn: well it was not 10 hours | 23:38 |
n4nd0 | blackburn: or yes | 23:38 |
n4nd0 | blackburn: I don't actually remember it | 23:38 |
blackburn | n4nd0: alright lets say 3 | 23:38 |
n4nd0 | mmm yeah yeah | 23:38 |
blackburn | :D | 23:38 |
n4nd0 | it was 500 almost 600 minutes | 23:38 |
blackburn | n4nd0: 100 dense matrix-vector products.. | 23:40 |
n4nd0 | for each iteration | 23:40 |
n4nd0 | cannot be good no | 23:40 |
blackburn | no I was wrong | 23:40 |
blackburn | for each dimension of target dimensions | 23:40 |
n4nd0 | so then it is even more than 100?? | 23:41 |
blackburn | I got a little lame | 23:41 |
blackburn | n4nd0: 200 totally to be more precise | 23:41 |
n4nd0 | ah ok | 23:41 |
n4nd0 | isn't it a bit weird that it was taking that much then? | 23:41 |
blackburn | n4nd0: but that should be computed faster than in 10 hours | 23:41 |
blackburn | so I expect some even more high performance stuff is here too | 23:42 |
blackburn | may be he just waits I don't know | 23:42 |
blackburn | Thread.sleep | 23:42 |
n4nd0 | http://pastebin.com/aBvzbcYh | 23:42 |
blackburn | n4nd0: hmm I see | 23:43 |
blackburn | thnaks | 23:43 |
blackburn | n4nd0: I'd start review of the paper | 23:43 |
n4nd0 | blackburn: our or waffles? | 23:44 |
blackburn | n4nd0: haha our | 23:44 |
n4nd0 | I guess you mean ours | 23:44 |
n4nd0 | haha | 23:44 |
n4nd0 | blackburn: so should we revise the paper again and decide to send it? | 23:48 |
n4nd0 | blackburn: I thought we had already reviewed it :) | 23:48 |
blackburn | n4nd0: just after plots and website | 23:48 |
n4nd0 | the review or the send? | 23:49 |
blackburn | n4nd0: no, I mean we should read it carefully, meanwhile finishing website and some nice plots | 23:49 |
blackburn | and then send | 23:49 |
n4nd0 | blackburn: agree | 23:50 |
n4nd0 | blackburn: did Chris contact you about something? | 23:50 |
blackburn | and we should release shogun | 23:50 |
blackburn | :D | 23:50 |
n4nd0 | haha | 23:50 |
blackburn | n4nd0: no, I guess he is busy | 23:50 |
n4nd0 | and end with starvation in the world | 23:50 |
blackburn | n4nd0: btw do you think people should stop funding africa? | 23:52 |
blackburn | :) | 23:53 |
n4nd0 | blackburn: wtf? | 23:53 |
n4nd0 | :) | 23:53 |
n4nd0 | it is a delicate thing | 23:53 |
blackburn | n4nd0: well countries spend a lot of money for nothing | 23:53 |
n4nd0 | nothing? | 23:53 |
n4nd0 | ha! | 23:53 |
n4nd0 | there are lot of governors there getting rich man | 23:53 |
n4nd0 | and what about the organizations who ask for the money? | 23:54 |
blackburn | yeah that's the only thing they sponsor | 23:54 |
n4nd0 | :D | 23:54 |
n4nd0 | delicate... I remembered this | 23:54 |
n4nd0 | http://www.youtube.com/watch?v=qeGChOUqQuk | 23:54 |
n4nd0 | I couldn't stop listening this song for some years ago | 23:54 |
blackburn | I know it is not really tolerant but I'd say it is not possible to pay them for not fcking all around the africa and spread aids | 23:56 |
blackburn | it is a matter of culture or so | 23:57 |
blackburn | n4nd0: I have heard that song back in time | 23:57 |
n4nd0 | blackburn: it is a hard truth | 23:57 |
n4nd0 | blackburn: it was in a episode of House | 23:57 |
n4nd0 | maybe you heard it there | 23:58 |
blackburn | n4nd0: oh then I know | 23:58 |
blackburn | there were similar songs in | 23:58 |
blackburn | oh let me find english name for these series | 23:58 |
blackburn | ahhhhh remembered | 23:58 |
blackburn | scrubs | 23:58 |
n4nd0 | hehe, that's about doctors too | 23:58 |
--- Log closed Wed Mar 13 00:00:11 2013 |
Generated by irclog2html.py 2.10.0 by Marius Gedminas - find it at mg.pov.lt!