<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: toddkaufmann</title><link>https://news.ycombinator.com/user?id=toddkaufmann</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 09 Apr 2026 05:00:52 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=toddkaufmann" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by toddkaufmann in "[dead]"]]></title><description><![CDATA[
<p>Looks interesting for some tables, but I'm not sold yet. 
Seems to (mostly) only show analysis of a single dimension at a time, 
though it looks like there is some scrubbing capability?<p>For multiple dimensions (and I would consider a table with N columns akin to a list of N-dimensional points),
GGobi has a number of tools for showing the relation and co-relations.
A brief demo of only a few of the features are illustrated here:  <a href="https://vimeo.com/12292239" rel="nofollow">https://vimeo.com/12292239</a>
Parallel coordinates are not show in that video (it is in others), 
but is something that looks like it could easily fit in the top part of your table.<p>I know the names Ramana Rao and Stuart K. Card but hadn't seen that paper before, I'll have to look closer.  Diane Cook (creator of xgobi and ggobi) also had a paper in IEEE Vis that same year.</p>
]]></description><pubDate>Tue, 14 Jul 2015 04:41:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=9882931</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9882931</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9882931</guid></item><item><title><![CDATA[New comment by toddkaufmann in "Ask HN: Will programming continue to be a lucrative profession in the future?"]]></title><description><![CDATA[
<p>Programmers of the world, 
you are at the forefront of job creation!</p>
]]></description><pubDate>Fri, 03 Jul 2015 04:44:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=9823535</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9823535</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9823535</guid></item><item><title><![CDATA[New comment by toddkaufmann in "The Extraordinary Growing Impact of the History of Science"]]></title><description><![CDATA[
<p>Very interesting.  So Zatocoding [1] allows for a card to have multiple index entries, and then any of those could be used to retrieve it.<p>For completeness, the 1951 paper is here [1].  Apparently has been
covered in undergraduate algorithms at U. of I. [2] (with Bloom
filters) so be getting more exposure.<p>Is the "needed improvement" of the 1976 paper due to better methods available 
(e.g. proof rigor, or understanding of sorting algorithms) or a better explanation of the methods 
(perhaps because of more widespread knowledge of information theory,
and a better defined terminology).<p>I thought edge-notched cards [3] had been used for a long time (and
have:  since 1896)--I remember reading about them used for fingerprint
card retrieval (indexed by feature, on each finger.  This didn't use
superimposed coding, but instead was a type of content-addressable
memory--the time to retrieve all cards with e.g. a whorl on the thumb is
O(1).<p>Apparently the cards are still used some places, see Kevin Kelly's [3]
site for some images and interesting comments.<p>Finally found a fingerprint filing reference: 
"For example,
as early as 1934 the FBI tried a punchcard
and sorting system for searching fingerprints,
but the technology at that time could
not handle the large number of records in the
Ident files." [5]<p><pre><code>    1. https://courses.engr.illinois.edu/cs473/fa2013/misc/zatocoding.pdf
       (or buy from Wiley for $38)
    2. https://courses.engr.illinois.edu/cs473/fa2013/lectures.html
    3. http://en.wikipedia.org/wiki/Edge-notched_card
    4. http://kk.org/thetechnium/one-dead-media/
    5. Chapter 3: Evolution to Computerized Criminal History Records
       https://www.princeton.edu/~ota/disk3/1982/8203/820306.PDF</code></pre></p>
]]></description><pubDate>Mon, 08 Jun 2015 07:00:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=9677591</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9677591</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9677591</guid></item><item><title><![CDATA[New comment by toddkaufmann in "The Extraordinary Growing Impact of the History of Science"]]></title><description><![CDATA[
<p>There are tools and data available at the Science of Science (Sci^2) site [1], part of the Cyberinfrastructure for Network Science Center, funded by NSF.<p>I haven't looked closely in a couple years, 
but my impression is NSF hopes such tools can help show the effects (and "ROI") of research grant money, connection with PI's and institutions, and their impact both on publication citation and economic impact (development  of technology etc.).<p>Ideally this could also be used to measure growth in technical fields to determine whether more (or less) funding is required to answer bigger questions in basic science (which may not have economic incentives yet), methodologies, public policy, and education (will there be enough Ph.D's in the pipeline to meet demands for fields that will exist in ten years?).<p>Scientometrics [2] (the journal) has been around for nearly 40 years, and I assume people were thinking about such issues then.  Sci^2 looks to me like a more "big data" approach to not only understanding this, but seeing if it is possible to "push" the frontiers
(but I admit I don't know anything that goes on at NSF or how their decision-making process works).<p>Another tool, Publish Or Perish [3], is aimed at individual academics to understand their (or another's) impact in terms of citation metrics that are used in the games for academic (and other) hiring purposes.<p>I stumbled on Sci^2 when trying to learn some new fields 
(computer vision, hpc / parallel computing, network science, sensemaking)
and wanted to quickly find seminal papers (ie highly cited, or literature reviews) 
to quickly get a broad overview.  Not having the patience or time to read lots, 
playing with interesting tools and trying to extract data from Google Scholar and the like was more attractive.<p>Being impatient, I wanted a way to process knowledge like data.
To measure something like growth of a field, it seems something like scientometrics with some natural language processing and ontology engineering is needed.<p>The Google paper seems to be more about an analysis of Google Scholar data and what can be gleaned there.  Maybe an update of  Google Scholar Metrics is coming?  I am surprised no reference to scientometrics in the arXiv paper (maybe they aren't familiar with the literature?).<p>1. <a href="https://sci2.cns.iu.edu/user/index.php" rel="nofollow">https://sci2.cns.iu.edu/user/index.php</a>
2. <a href="http://en.wikipedia.org/wiki/Scientometrics_%28journal%29" rel="nofollow">http://en.wikipedia.org/wiki/Scientometrics_%28journal%29</a>
3. <a href="http://www.harzing.com/pop.htm" rel="nofollow">http://www.harzing.com/pop.htm</a></p>
]]></description><pubDate>Sun, 07 Jun 2015 19:24:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=9676015</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9676015</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9676015</guid></item><item><title><![CDATA[New comment by toddkaufmann in "RocketChat: Slack-like online chat, built with Meteor"]]></title><description><![CDATA[
<p>Go to <a href="https://www.meteor.com/" rel="nofollow">https://www.meteor.com/</a> and Start tutorial.
After installed you can go through the tutorial in an hour or two depending how deep you go, and it comes with a number of examples (show with "meteor create --list").<p>Discover Meteor has some more; they were giving their book away 
(see <a href="https://www.discovermeteor.com/blog/we-made-our-book-free/" rel="nofollow">https://www.discovermeteor.com/blog/we-made-our-book-free/</a> -- first 4 chapters are free).<p>That may be enough for the basics.  Then look at telescope, or one of the chat apps listed here or search on github.  Also plenty of conference talks on youtube.</p>
]]></description><pubDate>Sat, 30 May 2015 00:31:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=9628331</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9628331</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9628331</guid></item><item><title><![CDATA[New comment by toddkaufmann in "Tabvention – Manage Your Browser Tab Addiction"]]></title><description><![CDATA[
<p>Haven't tried, but I think I would find this intrusive and annoying--I'd be mentally keeping track of how many tabs I had open and then checking my bookmarks if I went over.  
Not for me, but maybe useful for some.<p>I've tried session managers too, and those are okay for restoring state when things crash.<p>THE GREATEST THING is Tabs Outliner (chrome only).  
This displays all your windows and tabs as a tree and lets you rearrange, easily close and restore windows, selectively restore, add notes to tabs, etc.<p>A slight learning curve, but worth it for the power surfer.
Demo of some of the features in this video:  <a href="https://www.youtube.com/watch?v=OqjcrfKjobY" rel="nofollow">https://www.youtube.com/watch?v=OqjcrfKjobY</a></p>
]]></description><pubDate>Sun, 12 Apr 2015 18:10:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=9364215</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9364215</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9364215</guid></item><item><title><![CDATA[New comment by toddkaufmann in "PapyrOS, based on Arch Linux"]]></title><description><![CDATA[
<p><i>(this comment has nothing to do with this distro, just the general state of software installation and the transmission of such instructions on the internet.)</i><p>I'm not sure anybody else gets you,
but I'm totally with changing the copy-paste way of transmitting instructions.
And I don't mean a gui and a whole lot of clicking.<p>System Requirements (hw/sw, pre-reqs) / applicability tests (will this work for me?), 
tailoring instructions to my configuration(s) (automatically),
recommended and trusted instructions (using PKI) with data and statistics to back up the confidence I should have,
time estimates and ENV-impact statement,
testing and follow up discussion,
and transactional rollback of any step to previous state of the system.<p>See instructions.  Install instructions.  Should be easy as a click.  Something breaks, undo should be just as easy.<p>Copy and pasting instructions is like typing in BASIC from magazine listings decades ago.
"Clipboard is the new fax machine"<p>At the other extreme are "apps" which are nice when they don't break, but opaque and not developer-friendly.<p>Willing to discuss elsewhere or learning about existing efforts which try to address these problems.</p>
]]></description><pubDate>Sun, 12 Apr 2015 17:49:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=9364132</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9364132</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9364132</guid></item><item><title><![CDATA[New comment by toddkaufmann in "A note on the argument about the 'morality' of adblockers"]]></title><description><![CDATA[
<p>I would like to see a study done on how much ad-blocking can <i>save</i> in terms of energy costs (not running flash ads), bandwidth, and reduction of risk from malware.</p>
]]></description><pubDate>Tue, 07 Apr 2015 17:40:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=9335691</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9335691</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9335691</guid></item><item><title><![CDATA[New comment by toddkaufmann in "Stop using tail -f (mostly)"]]></title><description><![CDATA[
<p>You don't have to wait.  You can turn that off with '-n'.<p>When you jump to the end of the file ('>' command) you'll see
"Calculating line numbers... (interrupt to abort)"
and interrupt (ctrl-C) here will also turn them off.</p>
]]></description><pubDate>Mon, 30 Mar 2015 20:25:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=9292322</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9292322</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9292322</guid></item><item><title><![CDATA[New comment by toddkaufmann in "Stop using tail -f (mostly)"]]></title><description><![CDATA[
<p>Use '/' (search) to enter a regexp to match a pattern on that line, and it will be highlighted.</p>
]]></description><pubDate>Mon, 30 Mar 2015 17:55:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=9291267</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9291267</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9291267</guid></item><item><title><![CDATA[New comment by toddkaufmann in "A significant amount of programming is done by superstition"]]></title><description><![CDATA[
<p>At the other end of the spectrum from practicing "scales", there is the growing size and complexity of libraries and APIs.  If you only scratch the surface, learn the minimal necessary, then go on to learning something else, then it's hard gain fluency.<p>On the other hand, you should only be repeating the same patterns so many times before you build something so you don't have to replace yourself again...<p>Maybe it's an 80/20 mix; mostly repetition, part novel content.</p>
]]></description><pubDate>Mon, 30 Mar 2015 15:04:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=9289963</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9289963</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9289963</guid></item><item><title><![CDATA[New comment by toddkaufmann in "The Shut-In Economy"]]></title><description><![CDATA[
<p>Beer is very easy.  So is wine--actually easier.  Lots of people have made them over the past 5000+ years, so how hard can it be?<p>I had helped a friend a bit with some beer, but it wasn't until a few years later I tried on my own.  I started with wine, initially with a book from author of _The Joy of Home Winemaking_ [1].  Apple, blueberry, raspberry, strawberry, elderberry, and also grapes (piesporter, carmenere, barolo, grenache, viognier, etc.).  Cabernet / chardonnay are boring choices for boring people; there are so many other choices available.<p>Good results right away.  
More extreme experiments, perhaps questionable results, but learned a lot in all of them.<p>For beer, can't go wrong with _The Complete Joy of Homebrewing_ [2].<p>I went to my public library and got a dozen books on each subject before going to the bookstore.  Besides the techniques and recipes, there tend to be a lot of history and related books on those shelves, so definitely check your library and return for more.<p>It can seem like a lot of details, but it's not that hard.  Easier with a friend.  Even easier, you can go to a brew-on-premises place (with a friend).  There's probably a homebrew group near you, maybe a meetup; go to your local brewing supply store and check it out--they're knowledgeable and usually pretty friendly too.
Relax!  have a homebrew.<p>And don't forget cider, mead, metheglin, cyser, perry, etc.<p>[1] <a href="http://www.joyofwine.net/" rel="nofollow">http://www.joyofwine.net/</a>
[2] <a href="http://www.amazon.com/The-Complete-Homebrewing-Fourth-Edition/dp/0062215752" rel="nofollow">http://www.amazon.com/The-Complete-Homebrewing-Fourth-Editio...</a></p>
]]></description><pubDate>Mon, 30 Mar 2015 05:10:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=9287757</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9287757</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9287757</guid></item><item><title><![CDATA[New comment by toddkaufmann in "Open Notebook History"]]></title><description><![CDATA[
<p>This is something that interests me very much.<p>My vision is an "active" notebook--something I can record ideas or hypotheses in, come back later and find them explored, implemented, fleshed out and connected to the rest of the world's knowledge.<p>Blog comments don't cut it.  They can you help make simple discoveries or connect you to others.  But, they're better than nothing.<p>Right now a software project with issue tracker is probably the closest thing, but this is like manual labor.  I might have 5 ideas in the morning (or just from reading an article like this one).  I look forward to the active lazyweb of the future.</p>
]]></description><pubDate>Mon, 02 Mar 2015 14:54:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=9132056</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9132056</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9132056</guid></item><item><title><![CDATA[New comment by toddkaufmann in "Yann LeCun on a MIT Tech Review article that is all hype"]]></title><description><![CDATA[
<p>See <a href="http://hypothes.is/" rel="nofollow">http://hypothes.is/</a>
for an open-source annotation-tools project with a lot of big minds behind it.</p>
]]></description><pubDate>Mon, 02 Mar 2015 07:39:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=9130765</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9130765</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9130765</guid></item><item><title><![CDATA[New comment by toddkaufmann in "Embracing SQL in Postgres"]]></title><description><![CDATA[
<p>I second jOOQ.
The fluent interface actually catches SQL errors at compile time (brief example is in the wikipedia entry[1]).<p>[1] <a href="http://en.wikipedia.org/wiki/Java_Object_Oriented_Querying" rel="nofollow">http://en.wikipedia.org/wiki/Java_Object_Oriented_Querying</a></p>
]]></description><pubDate>Fri, 27 Feb 2015 01:33:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=9116698</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9116698</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9116698</guid></item><item><title><![CDATA[New comment by toddkaufmann in "Bug finding is slow in spite of many eyeballs"]]></title><description><![CDATA[
<p>So how  many bugs remain?<p>Mostly rhetorical question, but can any extrapolation be done?  If you
go back five years, can any of those numbers correlate to the findings
since?  Do any metrics such as cyclomatic complexity, #defects/kLoC[1][2], 
unit tests or code coverage help?<p>In most cases the definition of "defect" is not well-defined, nor in
many cases easily comparable (e.g., a typo in a debug message compared
to handling SSL flags wrong).  Is is a requirements or documentation
bug:  the specification to the the implementer was not sufficiently
clear or was ambiguous.  Also, when do we start counting
defects?  If I misspelled a keyword and the compiler flagged it, does
that count?  Only after the code is commited?  Caught by QA?  Or after
it is deployed or released in a product?<p>Is it related to the programming language?  Programmer skill level and
fluency with language/libraries/tools?  Did they not get enough sleep the night
before when they coded that section?  Or were they deep in thought
thinking about 4 edges cases for this method when someone popped their
head in to ask about lunch plans and knocked one of them out?
Does faster coding == more "productive" programmer == more defects long term?<p>I'm not sure if we're still programming cavemen or have created
paleolithic programming tools yet[3][4].<p>p.s.:  satisified user of cURL since at least 1998!<p><pre><code>    [1] http://www.infoq.com/news/2012/03/Defects-Open-Source-Commercial
    [2] http://programmers.stackexchange.com/questions/185660/is-the-average-number-of-bugs-per-loc-the-same-for-different-programming-languag
    [3] https://vimeo.com/9270320 - Greg Wilson - What We Actually Know About Software Development, and Why We Believe It's True
    (probably shorter, more recent talks exists (links appreciated))
    [4] https://www.youtube.com/watch?v=ubaX1Smg6pY - Alan Kay - Is it really "Complex"? Or did we just make it "Complicated"?
    (tangentially about software engineering, but eye-opening for how much more they were doing, and with fewer lines of code) (also, any of his talks)</code></pre></p>
]]></description><pubDate>Mon, 23 Feb 2015 18:44:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=9096062</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9096062</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9096062</guid></item><item><title><![CDATA[New comment by toddkaufmann in "There are too many shiny objects and it is killing me"]]></title><description><![CDATA[
<p>Good points.<p>But it can also be illuminating to try one of the wagons on for a bit and see how it feels.
"This is the big thing everyone's talking about?  It's just like some X I put together 10 years ago, 
with a couple layer of warts to deal with concerns that didn't affect me."</p>
]]></description><pubDate>Thu, 19 Feb 2015 17:56:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=9075567</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9075567</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9075567</guid></item><item><title><![CDATA[New comment by toddkaufmann in "There are too many shiny objects and it is killing me"]]></title><description><![CDATA[
<p>Me too.  Maybe 30+.  I have alternately thought that it was procrastinating, ADD, FOMO, the distraction of shiny objects, etc.--new terms keep appearing.<p>In the past this has been "useful", because I learned a number of tools 
before I had need for them.  "Useful" in quotes because I might not have been most productive 
at that moment but maybe it amortizes over time (ie, maybe I "10x" for spurts at later time),
and it got me skills and opportunities that I wouldn't have otherwise.<p>If I don't a creatively productive day in doing what I'm "supposed" to be doing, I need to feed that hunger by learning something new.  Sometimes it's shopping for shiny things, other times it's going deeper into something...   still looking for the balance.</p>
]]></description><pubDate>Thu, 19 Feb 2015 17:20:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=9075276</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9075276</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9075276</guid></item><item><title><![CDATA[New comment by toddkaufmann in "Google deleted whocalled.us for “Pure Spam” and replaced it with spam"]]></title><description><![CDATA[
<p>Suppose 100 top spam sites all had a portion of some top legitimate content site (like NYT).  Wouldn't this lower the ranking of the legitimate site?<p>Ignoring other factors like number of incoming links--which for whocalled.us is probably a low number (why would anyone link to it?)--it seems like spam could (temporarily at least) pull down the others somewhat especially once any results can make it to the first page and get some clicks.  In fact if there are 10 spam sites that link to each other or use some slimy affiliates they might get better listings.<p>I use services "like" whocalled.us all the time, usually for nearly every incoming number I don't recognize, before answering.  I've seen whocalled.us and used it before, others equally often.  I've noted a couple times (and even bookmarked I think) "this site seems less spammy than the others), but I don't remember which.<p>If there were some way to differentiate yourself from the others...
allow people to register themselves as not telemarketers, or a business listing, or say who you are?  I don't see how to verify or prevent abuse.  I'm sure you've thought about this much more than me.</p>
]]></description><pubDate>Sun, 15 Feb 2015 16:21:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=9053000</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=9053000</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9053000</guid></item><item><title><![CDATA[New comment by toddkaufmann in "An experimental real world adblock"]]></title><description><![CDATA[
<p>More useful would be an infographic that showed ingredient quality info, sugar/caffeine levels, generic flavor symbol, environmental impact etc.</p>
]]></description><pubDate>Fri, 23 Jan 2015 16:32:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=8935670</link><dc:creator>toddkaufmann</dc:creator><comments>https://news.ycombinator.com/item?id=8935670</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=8935670</guid></item></channel></rss>