589 karma · joined May 22, 2012
Reversing the problem is also a good idea, I know some people had success buying an ad in Sueddeutsche Zeitung. At one point I also put up printed ads in supermarkets in the areas I was considering and while the response rate was very low, I got at least some response.
There are also some agencies that in fact own flats and rent them without requiring the 2.5 x rent fee.
On the other hand, the persistent sessions/activities in KDE someone mentioned sound intriguing.
What did you switch to?
For Unity I'm probably simply not in the target group, I don't like it.
I left KDE many years ago because I found it buggy and bloated. Maybe it's time to give it a look but I'm happy with my Gnome Shell (in a very nearly out of the box configuration).
Thanks
He uses a nice graphical approach that is easily understandable yet formal. It's been many years since I've read it to learn for an exam at university but I remember it was an enjoyable read and I wished I had more time to spend on the book.
[1] http://www.amazon.com/Neural-Networks-A-Systematic-Introduct...
[1] http://fishshell.com/ [2] http://xiki.org/ [3] https://www.kickstarter.com/projects/xiki/xiki-the-command-r...
There is so many of them that I doubt there is a good resource comparing them. I think it's best to start comparing the various models (document store vs column store vs key-value store vs graph db vs rdbms, ...) and then look for detailed comparisons of the implementations of the model.
There is a lot of hype around many of them, but a lot has already been debunked too, esp. here.
For example I personally would have picked PostgreSQL rather than Mongo in some cases in past when Mongo was pushed on me by people who's understanding didn't go beyond the hype.
Maybe describe your problem in more detail here and perhaps you'll get useful feedback? Maybe Ask HN? Feel free to drop me a line.
From a recruiter's point of view being a PhD dropout might be even better because it could mean that you won't go back and you will stay being productive where they hired you after they invest in training you the first couple of months/a year.
I'd leave it open ended. In practice, it's just your plan, it's not a given, it can change based on many things. If they ask you, you can explain that it wasn't a good match and that you may or may not try again but right now you want industry experience. You could sell it as wanting to do practical, useful, not ivory tower things which could possibly in the longer term give you a better idea what would be worthwhile research if you ever decide to go back.
In view maintenance, there are various counting algorithms known since around 30 years - for example the PF (Propagate and Filter) algorithm, or DRed (derive-rederive) algorithm. One difference is that in garbage collection you always have the whole graph: edges and vertices, while in view maintenance you typically have only the vertices. That gives rise to the "proof traces" method of view/reason maintenance where you build up the whole graph and keep the edges even though they are useful only for maintenance (or for explanation).
The distinction of tracing garbage collection vs. reference counting garbage collection could be also seen as sort of analogous to the difference between forward chaining and backward chaining in datalog or rule systems in general.
It seems like another case where bigger awareness of results from different but related fields could help to bear fruit much faster. This paper in particular seems like something that could have been inspired by the old view maintenance research. Maybe there still are some opportunities left for transferring results from one of the fields to the other.
> By the end of that summer of 1983, Richard had completed his analysis of the behavior of the router, and much to our surprise and amusement, he presented his answer in the form of a set of partial differential equations. To a physicist this may seem natural, but to a computer designer, treating a set of boolean circuits as a continuous, differentiable system is a bit strange. Feynman's router equations were in terms of variables representing continuous quantities such as "the average number of 1 bits in a message address." I was much more accustomed to seeing analysis in terms of inductive proof and case analysis than taking the derivative of "the number of 1's" with respect to time. Our discrete analysis said we needed seven buffers per chip; Feynman's equations suggested that we only needed five. We decided to play it safe and ignore Feynman.
> The decision to ignore Feynman's analysis was made in September, but by next spring we were up against a wall. The chips that we had designed were slightly too big to manufacture and the only way to solve the problem was to cut the number of buffers per chip back to five. Since Feynman's equations claimed we could do this safely, his unconventional methods of analysis started looking better and better to us. We decided to go ahead and make the chips with the smaller number of buffers.
> Fortunately, he was right. When we put together the chips the machine worked. The first program run on the machine in April of 1985 was Conway's game of Life.
http://longnow.org/essays/richard-feynman-connection-machine...
Location: Ireland, hoping to relocate (lived in Germany and Czech republic)
Remote: yes, preferred
Willing to relocate: yes
Technologies: hadoop, solr, elasticsearch, play framework, java, automated reasoning. Would love to do more AI, machine learning, haskell
Resume: https://www.linkedin.com/profile/view?id=703594
Twitter: @jkbkot
Looking around for the next challenge, would love to work remotely with a motivated, ambitious team.Also, I have background in (research) AI, reasoning, semantic web, and experience (software engineering) around hadoop and search/information retrieval, (education): machine learning, medical informatics, biology of the cell. I see many possible matches in the US-based jobs. Is there an option for a broader application where you would suggest a good match?
Would it be possible to perform some of the roles offered for US in continental Europe or truly remotely?
I like it a lot, it would be great to have it that way by default.
Now, where to find such partners - that can be a matter of networking, but online communities such as http://www.reddit.com/r/mentors/ can certainly help.
You could have a look at the various entrepreneurial schools and their communities, recently I've stumbled upon http://www.morningcoach.com/ ... I have no idea what it is and how it works but there are some interesting testimonials online (I believe not faked), etc.
> So unlike the title "co-chair" might imply, and unlike in many other organizations, IRTF co-chairs are little more than group secretaries.
The chair is far more than a "group secretary". As RFC 2014 section 5.3 states:
""" The Research Group Chair is concerned with making forward progress in the areas under investigation, and has wide discretion in the conduct of Research Group business. [...] The Chair has ultimate responsibility for ensuring that a Research Group achieves forward progress. """
Could someone shed a bit more light on who Dan Harkins is? He seems to be quite arrogant and does not address Trevor Perrin's criticism very constructively. See the other two threads started by Trevor:
http://www.ietf.org/mail-archive/web/cfrg/current/msg03545.h... (Question regarding CFRG process)
http://www.ietf.org/mail-archive/web/cfrg/current/msg03537.h... (Review of Dragonfly PAKE)
To me it still sounds like "I solved the problem because I formalized it." The formalization is probably novel (since he got his PhD for it) but somehow I find it difficult to believe noone else had a similar idea before (it definitely sounds familiar to me having learned about reinforcement learning, minimum description length, etc. before). I'll have to read up on it.
I admit that I didn't spend time to really delve into it but nothing in this article strikes me as particularly ground breaking.
[1] http://en.wikipedia.org/wiki/Minimum_description_length
edit: innovative --> ground breaking