waitwhat

Aliexpress listings can have multiple different items, and the price displayed in the search results will be that of the first of those (in your case, probably just an antenna) rather than the actual item you searched for or even the item image shown on the results page.

There is also the foreign policy based on threats and insults, increasing reports of hostile border experiences, reductions in non-tourist visas, US economic policy reducing consumer confidence globally leading to fewer people committing to inter-continental travel, and the fact that some people simply prefer not to visit countries whose domestic policies they disagree with.

If you capitalise the first word (a signal to the algorithm to be more sentence-based than word-based, perhaps?)

- Krya på dig Björn - Get over it Björn

- Krya på dig Helga - Get over it Helga

- Krya på dig Dave - Get over it Dave

- Krya på dig Mary - Get over it Mary

- Krya på dig Linnéa - Come on Linnéa

- Krya på dig Mohammad - Get over it Mohammad

The google translate integration.

maybe the use of "sign"?

The "Reader" button in the address bar fixes it.

I'm sorry, but describing homelessness as "a cool hack" is pretty twisted.

I did my own undergrad project on JPEG steganography, and I was surprised that section 2.6 accurately represents popular algorithms being implemented today. At the time it seemed to me that you got significantly better results than the naive algorithm when measuring visible differences and statistical anomalies in two ways...

1) Consider the unquantised DCT coefficients. If the unquantised coefficient is 12, and the quantisation factor is 5, then the quantised value is round(12/5) = round(2.4) = 2. If you need to flip the LSB, then the F5 algorithm would change this to 1. My algorithm would have changed this to 3 instead as this was much closer to the unrounded 2.4.

2) Encode one bit into multiple quantised co-efficients. For example: If you only need to hide one bit in a block, xor together the LSB of all 64 quantised co-efficients and use that; if you need to flip it, then carefully choose the single co-efficient which produces the best result for your visual/statistical models. (I might have excluded the DC co-efficient, don't remember.) If you need to hide two bits, use half of the co-efficients for one bit, and half for the other, and so on. Conversely, this method could also be extended to so that one bit is encoded into multiple blocks.

Rather than a keyed shuffle, I simply required the secret message to be strongly encrypted. This appears to have the added advantage of a message with predictable statistical properties.

Note also that robustness was not one of my criteria at the time.

Hope this is of some value (or at least interest). And my apologies if I have some of the terminology wrong - this was nearly twenty years ago and I don't have the work in front of me right now!

Maybe it was just quicker/cheaper for Yahoo! to buy Summly and their license than to negotiate their own license off SRI?