Ektbear's Posts
Nairaland Forum › Ektbear's Profile › Ektbear's Posts
1 2 3 4 5 6 7 8 ... 51 52 53 54 55 56 57 58 59 (of 485 pages)
"let's be friends" is pretty much the most annoying thing ever. Girl I ain't trying to be your friend, I'm trying to be your lover.. |
ogugua88: Fish. I've never been much of a meat person. I don't consider chicken or turkey as meat by the way. Those are poultry.meat >>> all |
eh... is there a law on the books saying that these clubs are illegal? |
So, Mr Globe, Abagworo, etc, where are your own apologies? |
After about one hour, pmnewsnigeria.com got a response from the Metropolitan Police, that said at the bottom of its query: “Confirmation: Yes”. In another part of the response, MET said: “Thank you for your email. I am sorry, we are unable to disclose any information to you under the Data Protection Act.” It was signed by “The Email Office, Lambeth CCC, Metropolitan Police.”Lmao! So on the basis of this automatic email, they decided to slander her? No actual phone conversation with a real person...just a generic email is what they used to decide to publish the article? Jesus Christ, why is the Nigerian media so useless and unprofessional |
peckhamboi: you go explain your apology in court.+100 Which kyn useless apology be dis. PM News shall "apologize" with its pocket boot. |
Prof Corruption is correct |
born into Christianity |
The question does not ask: a) "what time does he visit the same spot", or b) "what is this same spot visited." It asks, c) "is there a time he visits the same spot?" The answer to (c) is independent of his velocity. Anyway, no worries, if you didn't find it interesting, so be it. |
[quote author=ndu_chucks]Ogbeni, I'm pretty sure you fully understood the points I raised. Nigerian state governments should not be running corporations, period.[/quote]So we have two options: (1) Lagos Government does only what it can do involving land within Lagos State. (2) Lagos does (1), and also does what it can do in other states. The only way for it to do (2) is to do it in a way that at least breaks even, yes? So what is so wrong with running your operation outside of Lagos as a corporation? |
lol |
So, Lagos's model isn't that unusual, it seems: http://www.economist.com/node/13692889 http://www.crikey.com.au/2011/06/16/foreign-ownership-of-aussie-land-the-peril-of-selling-the-farm/ |
Lagos State cannot indirectly support farms in other states through dams or whatever (since this costs money, but doesn't directly give benefit or even break even for LASG). And of course, the employment/tax revenues it generates in other states is not enough to sustain its support (for the same reason). Within the state itself, land is limited. So, your approach and others like it cannot work for LASG. |
Btw, doesn't Singapore own cattle ranches in Australia? The Singapore government. Actually, it isn't every country where the mainstream belief is that government and corporations should be separated. More of a Western philosophy...they don't do that in Singapore, Japan, etc. |
Elaborate. What would you suggest is a better approach than the current one Lagos is taking? |
I would ordinarily agree with ndu_chucks...I'm very much against the government interfering in things best left to the private sector. But, for various reasons, the private sector is not sufficiently interested in industrial farming in Nigeria. If it takes Lagos State's initiative to stimulate this sector of our economy and reduce importation of food, then perhaps the benefits will outweigh the costs. Anyway, time will tell. |
I like the original version better. |
Books are expensive. Library membership >>> individual book ownership. |
[quote author=Kilode?!]Off Topic post, apologies. Bro, I just read that NYT link in your profile. Good read. Have you read John Ogbu's work? He was a Berkeley Prof. of Sociology. His work "A Study of Academic Disengagement" was a seminal research on that topic. Died years ago. He was from Nigeria too. He identified immigrant culture as the reason for the disparity explained in that article and not innate intelligence or anything like that. I wonder how African immigrant kids (1st - 2nd Gen ) do on that New York test, I won't be surprised if they compare well with Asians. Review here: http://www.hepg.org/her/abstract/38 Ogbu's bio: http://www.universityofcalifornia.edu/senate/inmemoriam/johnogbu.htm[/quote]Hey, we should probably move this discussion to another thread ![]() |
[quote author=Lord_Reed]Okay now we have a speed assumption so in this case we can say that since Femi is faster than Tunde they will meet somewhere off center towards Tunde's starting point. It's not really a brain teaser as there are to many likely endings based on the parameters someone considering the setup would choose. A brain teaser should have very specific answers that require a tortuous route to the answer.[/quote]The point is that, the answer is INDEPENDENT of what the speed of the guy going up the hill Monday at 9am and his speed going down Tuesday 9am. No matter what the speed functions are (or even more simply, position functions are), there is bound to be some time at which he crosses the same spot on both days. That is why the puzzle is kind of cool. |
Desola: He only formalised what has always been. Remo and Ijebu, though speak the same language with a slight variance in dialect have always maintained their own sovereignty hence having their own oba - Akarigbo of Remoland.Interesting. |
Interesting, if you can implement it with a BST that'd be cool. |
Anyway, let's pretend/assume that you fixed those issues. Essentially, you are paying K log(K) time each time you call insert. If K is a small constant or something, this isn't a big deal. However, there is a way to improve this substantially by making the "cost" of each insertion log(K). Have you heard of something called a heap/priority queue? You can make the program much faster if you use a min-heap. |
[quote author=Lord_Reed]Without a speed assumption how do you determine how much distance he covers?[/quote]Well, think about it this way. Call our original Ijebu man Tunde. Now, whatever speed the man Tunde travels on Tuesday, pretend there is an identically fast old man (Femi) who is walking down the hill a day earlier (on Monday). So, Tunde is walking up this hill Monday @ 9am, Femi is walking down the hill Monday @ 9am. They are on the exact same path. So of course, at some point, they will have to walk past each other. So there is some time at which they are both at the same position. (Just FYI, this simple explanation is NOT the one i initially came up with when I solved this problem...I did something a lot more complicated and less elegant). Kind of a neat brain teaser, no? ![]() |
1 and 3 are easy to fix. 2 is also easy to fix, but you'll either need some sort of minimum float value from Java, or (even better) to handle the case when you've only seen K numbers from the stream separately from the case when you've already seen more than K numbers. |
Your Java implementation looks close. However, some comments: 1. In your constructor, shouldn't you pass k as an argument to it? 2. In your constructor, you initialize all the values to zero. This is fine if you know that all of the #s in the stream are bigger than zero. But if they are just arbitrary floating point numbers, then you'd need to do things a bit differently. 3. In your function insert(), since you sort numbers right away, then you only need to compare n to the bottom element of numbers, i.e., numbers[0], right? But you are quite close. |
Nash looked terrible |
The N numbers could be much bigger than the capacity of your memory. So the simple algorithm one might have in mind of loading all the N numbers into memory, sorting, and picking the K largest won't work, since you don't have space to sort all N items at once. So, you sort of want to process the data sequentially. So a possible design is this: 1. Build some class/data structure that has internal storage for the K largest elements 2. build an insert method for this class that allows you to insert a potential number into the data structure. 3. Then, as you see this stream of N numbers, call your insert function on each new number you see. So in pseudocode: a = MyClass.new(K) for i=1..N a.insert(Next # in stream of numbers) end Something like that. Or more legibly/filled out a bit more, something like this: http://pastebin.com/5xRVQ6iC |
God bless Lagos |
Prof Corruption: It was a wicked, very wicked lie.and PM News should be made to pay the price for their slander |
1 2 3 4 5 6 7 8 ... 51 52 53 54 55 56 57 58 59 (of 485 pages)
