HNHacker News
TopNewBestAskShowJobs

ocfnash

1,664 karma · joined January 12, 2014

http://olivernash.org
submissionscomments
ocfnash··on The Jet Engines with 'Digital Twins'
Much of the little I know about jet engines was sparked by my reading this wonderful article: https://www.americanscientist.org/issues/pub/each-blade-a-si... (which happily is _not_ paywalled).

In particular I learned that each blade is a single crystal! I still find this absolutely mind boggling.

ocfnash··on Richard Feynman and the Connection Machine (1989)
Thanks, this is a good point: we have no idea how accurate they wished to be.
ocfnash··on Richard Feynman and the Connection Machine (1989)
Thanks for these remarks Stephen.

IIUC you're speculating that the relevant constraint they faced was that multiplication was very burdensome. I agree; it seems plausible this was the reason they found this an attractive approach.

Also agreed about Newton-Raphson; that was a thinko on my part. It would be an unusual situation if NR were the right tool for estimating log.

ocfnash··on Richard Feynman and the Connection Machine (1989)
I came across this before and found the section "An Algorithm For Logarithms" interesting.

As pointed out (in second para. of that section) Feynman's observation about representing a number as product of terms of the form $1 + 2^{-k}$ reduces the problem of estimating log to computing those values k which appear in the product. (Btw the article incorrectly claims the representation is unique.)

There's an obvious linear time algorithm for finding a sequence of values k but I don't think that would really perform so well compared to, say, Newton-Raphson.

So I wonder why this was a good approach. Perhaps there's a smart way to estimate the k or perhaps it just happened to fit the constraints under which they were working.

Anyone have some insights?

ocfnash··on Adobe To Pay $1M For Data Breach, Bolster Security, North Carolina AG Says
> A total of 52,734 North Carolina consumers were affected.

And also 152,989,508 email addresses were leaked, with sufficient information to derive the password in many cases.

I got interested in this at the time and was pretty stunned at how easily I could mine passwords: http://olivernash.org/2014/01/03/dna-of-a-password-disaster/...

ocfnash··on The secret world of microwave networks
The emphasis on secrecy is rather overblown IMHO: there's an entire company (not mentioned in the article!) whose sole business is building/maintaining these networks and they make plenty of information public on their website http://www.mckay-brothers.com/product-page/
ocfnash··on Braess' paradox: adding a new road to a city can slow down traffic
Brian Hayes wrote a nice article about this a few months ago in American Scientist [1] and also wrote a little JS demo to tinker with linked from here [2].

1. http://www.americanscientist.org/libraries/documents/2015617...

2. http://bit-player.org/2015/traffic-jams-in-javascript

ocfnash··on In Mathematics, Mistakes Aren’t What They Used to Be
The term is also used to describe some people's ability to grok simple arguments without needing to fall back on formal methods. A trivial example might be the pigeon hole principle where most people can just "see" that it is true, even though it does require proof.

Funnily enough, I was just thinking about this very topic a week ago and scribbled down some notes with slightly less trivial examples: http://www.maths.tcd.ie/~onash/counting_whats_important_file...

ocfnash··on The World Record for the Shortest Math Article: 2 Words
Somewhat related: http://mathoverflow.net/questions/7330/which-math-paper-maxi...
ocfnash··on Impossible Escape?
Wait, that's my blog post from ages ago! Looking over it now, one thing that might be appreciated here are the generalisations. For example consider a similar puzzle except instead of a chessboard and 64 coins, you have a 6x6 board, with one die on each square. Instead of turning over a coin, you must add 1 (modulo 6) to the value of exactly one of the dice (and reorient it). What is your strategy?
ocfnash··on 42.zip (2004)
Interesting.

I wonder if it might be possible to prove the existence of fixed points of compression programs using only general assumptions (which would be satisfied by the Lempel-Ziv implementations the author discusses so well).

Such a fixed-point theorem would probably not tell us how to find solutions but it would be illuminating if the assumptions could be made weak enough.

ocfnash··on FFTs and Optical Lenses
Fascinating, I've wondered a few times over the past year or so why the ideas were shelved.

Each of your points is very illuminating. It's such a nice idea that it's a shame it turned out not to be worth pursuing from a business point of view.

Perhaps some day somebody will take up those next-generation ideas!

ocfnash··on FFTs and Optical Lenses
A very interesting application of this point of view was a proposed projector of Light Blue Optics. The projector would have the property that it was near 100% efficient: it would essentially steer the light to the desired locations (rather than blocking it out where it was not desired).

The idea is outlined briefly here: http://redfrontdoor.org/blog/?p=409

ocfnash··on Mining Strava's cycling data
Oh dear my table of effort censoring frequencies got all messed up and is annoying to read. Here is a slightly less garbled version:

isInconsistentDistances (difference of first and last 'distance' numbers in effort more than 2% away from official segment distance) : 442

isInadmissableAvgSpeed (journeys that are too slow) : 36

isInconsistentTimes (difference of first and last 'time' numbers in effort not equal to reported time for that effort) : 1

isNotAlwaysMoving ('elapsed_time' != 'moving_time' in Strava's effort summary) : 1164

ocfnash··on Mining Strava's cycling data
Author here. I just had a look at those links and they're super. I know what I'll be reading when I get back from this morning's cycle!

Regarding the fact that I threw out so many segment efforts for the Col du Tourmalet and Alpe d’Huez (especially compared to Stocking Lane): a large part of this is explained by the fact that I only keep efforts for people who do not stop before the end. I just reran the data cleaning code to get the stats for Col Du Tourmalet. The first round of cleaning (which is the most severe) throws out 1,643 segment efforts and the breakdown is: isInconsistentDistances (difference of first and last 'distance' numbers in effort more than 2% away from official segment distance) : 442 isInadmissableAvgSpeed (journeys that are too slow) : 36 isInconsistentTimes (difference of first and last 'time' numbers in effort not equal to reported time for that effort) 1 isNotAlwaysMoving ('elapsed_time' != 'moving_time' in Strava's effort summary) 1164

Regarding the altitude data, thanks for the tip. If I return to do more, I may see if it's possible to use only data from Garmin devices. I would guess that for the curves for faster riders (the upper decile curves) a lot of the riders are using Garmins so I might even be able to see the effect if I tried to look for it.

Regarding the power equation, I did not know that! I'll have to have a look at what Strava are doing. They continue to impress me with the number of features they have.

ocfnash··on Observation of Dirac monopoles in a synthetic magnetic field
As others have pointed out, these are indeed just analogues of (fundamental) monopoles.

IMHO, this is an example of a deliberately-slightly-misleading abstract for a paper. The authors write: "Although analogues of magnetic monopoles have been found [in others' work] there has been no direct experimental observation of Dirac monopoles within a medium described by a quantum field [...]. Here we demonstrate the controlled creation of Dirac monopoles in [...]. Monopoles are identified, in [...]"

If I were a referee for the paper, I would have registered the following objection: When referring to others' work, the authors use the phrase "analogues of monopoles" whereas they reserve the phrases "monopole" and "Dirac monopole" for references to their own. Their terminology seems especially egregious on account of their earlier statement: "The existence of even a single Dirac magnetic monopole would have far-reaching physical consequences, most famously explaining the quantization of electric charge". In fact they too have only discovered analogues of monopoles and the abstract is confusing for non-specialists, as evidenced by this thread.

Nature is a journal that has been known to give in to the temptation to sensationalise so I am not all that surprised.

ocfnash··on What are the lesser known but useful data structures?
IMHO, the FM-index deserves to be highlighted. That it is possible to store a string in a compressed format which can answer length-P substring queries in O(P) time (with good constant factors) is quite surprising at first sight.

I recently wrote a few words about this here: http://ocfnash.wordpress.com/2014/01/03/dna-of-a-password-di... By the time I finished I decided the whole area was exciting and seems not at all as well known as it should be. I also think there are plenty of related, as-yet-undiscovered ideas, waiting for somebody to find them!

← PreviousPage 6 of 6