Note that in the US, we have strict stop everyone controls at the border (with Canada no less, this isn't just a Mexican border thing), at which you need to show your passport, and we have mobile border controls up to 100 miles within the border.
I used to live near a place where they frequently put the "mobile" control on an interstate in Vermont about 80 miles from the border, so I got stopped by it a lot.
Of course, I've always wondered about how useful the mobile controls are, other than for getting people used to a police state. They are not allowed to ask any US citizens for passports or proof of US citizenship; so they always ask "is everyone in this car a US citizen" and then wave you on if you say yes. When my friend, who is Malaysian, answered "no, I'm not a US citizen", they thought based on his excellent American English accent that he was joking and waved him on anyhow.
And if you're a dirty foreigner you have to have your Iris scanned, a picture taken and your fingerprints taken.
I've lived on the US/Canadian border and if they make a flip-book of all the pictures they took of me over the years it would make for a neat animated study in aging.
Really? As a Canadian who crosses that border fairly regularly, the iris & fingerprint records are only for the "Enhanced Drivers License" as far as I knew, I've crossed the border dozens of times with just my passport
Note also that people who are in this country illegally may have come here legally, and then simply stayed beyond the point that they were allowed to. That has nothing to do with border patrols, but rather whether we feel it's appropriate to aggressively police inside the country for people who may have overstayed the amount of time they were supposed to.
Not really. In the scrypt paper, cperciva recommends parameters that allow it to do a single password hash in 64 ms, and in the process use only 4k of RAM. Nowadays, as processors are faster and ram is cheaper, you'd probably want to up the parameters a bit, so that the encryption time will be similar (between 50-100 ms) on modern hardware, and the RAM usage will scale proportionally (probably 128k, based on the ratio of RAM prices between 2002 and now). That means that you would be able to handle 10-20 logins per second per core, using no more than 2.5 MB in the process (if they were all run in parallel on separate threads and so all of that memory was needed at once; that's obviously a worst case, most likely they would be scheduled more sequentially and use proportionally less RAM as you would free the memory after finishing an encryption). On a 12 core machine, you might wind up using 30 MB at at time, to support 240 logins per second.
If you need to handle 240 logins per second (which presumably means many many more requests per second, as there are usually many requests per login), 30 MB of RAM is the least of your worries.
Note that these numbers are simply extrapolations from the ones in the original scrypt paper, I haven't actually tried this on modern hardware. Regardless, there are parameters that allow you to trade off CPU time and RAM usage, so you can tweak it to provide the level of performance that you require (with the understanding that the faster it is and less RAM it uses, the faster cracking it would be).
> If you need to handle 240 logins per second (which presumably means many many more requests per second, as there are usually many requests per login), 30 MB of RAM is the least of your worries.
Well, if you have a large system of nodes, and until now you arranged things as an SOA where there's one node-cluster in particular that serves as an authentication service, doing all the hashing and table-lookup and comparison, and handing out session tokens for your other services to use--then with scrypt, that auth service will now be have the combined "memory hard"ness of every user's login requests on it for your entire system.
With bcrypt, that level of CPU+memory load isn't so bad--but with scrypt, I think I'd think about pushing the hashing step into the client library part of that service's API, before the RPC call, so that the load gets distributed throughout the system back to where it's being "spent."
> Beneath a nice infix/indentation based syntax with a powerful (AST based, hygienic) macro system lies a semantic model that supports a soft realtime GC on thread local heaps. Asynchronous message passing is used between threads, so no "stop the world" mechanism is necessary.
Yes, so not. I've found the actor module, but it's based on threads so no "lightweigth" and not as powerful as the networked, lightweight erlang processes. I'd really love to see that in a new language, especially since Rust and Nimrod are the first ones in a while i really like from the syntax point of view..
Erlang seems to pay a small performance penalty for that ability though. The VM is not allowed to run more than a few thousand instructions without checking for a signal to task switch.
But if that kind of guaranteed cooperation isn't needed, I'd expect that lightweight threads could be added to a language like this in a straightforward way.
Note that eviction requires the landlord to go to court, not just unilateral action on the part of the landlord. Somehow I doubt this web designer got a court order to allow them to deface their client's page.
Hospitals will not refuse treatment that is necessary to provide life support.
Collections agencies generally operate by sending you mail and calling your phone repeatedly until they get their payment. The contents of your mail and phone calls are generally private.
Note that most of these are private matters, generally considered confidential.
> There is apparently not space in this article for the important qualifier: during a search incident to arrest.
Why do you say that? In the article it clearly states:
> The case in question dates back to 2007, when a man from Massachusetts was arrested for allegedly selling crack cocaine. Police seized his cell phone and, without a warrant, searched its contents to access information that allowed them to locate the defendant’s home.
Did it not say that when you wrote this comment, or were you merely commenting on the headline or first two paragraphs of the article?
Hmm. I'm not sure that's the case. Sure, it's preferable, if possible, to describe a mathematical idea in such a way that makes it completely obvious and trivial. But at a certain point, there are some ideas that will not be obvious and trivial; there is a huge amount of foundation which is needed to understand them.
Can Grigori Perelman describe to you his proof of the Poincaré conjecture in a way that is completely obvious and trivial? Well, no, otherwise he probably would have done that. Rather, he explained it as succinctly as possible, in a series of papers totaling about nearly 70 pages of fairly dense math, building on nearly a century of earlier work on the problem.
Does the fact that he was not able to express this completely obviously and trivially mean that he is not brilliant? No. It means that it's a really hard problem, which doesn't have a really obvious and trivial solution.
Now, it's absolutely true that mathematical complexity has nothing to do with how correct a theory is. You can have a complex, difficult mathematical theory that is bullshit, and you can have a complex, difficult mathematical theory that is a damned good approximation of reality (remember, in all of science, we are building models or approximations of reality, so even the best theory is never expected to be "right" in some absolute sense). And likewise, you can have a simple, easily explained theory that is bullshit, and you can have a simple, easily explained theory that is a damned fine approximation of reality.
Part of the beauty of physics is that since you are just studying the most fundamental of forces and interactions in the universe, it's a lot easier for a simple mathematical theory to model it quite accurately. Newton's laws are a damn good approximation of many physical phenomenon that we can observe directly, even if we now know that at large scales and high speeds they are not quite accurate due to relativistic effects.
It's just hard to find that kind of beauty in economics. The systems involved are just so much more complex; remember, you are trying to model not just the a single human, but a complex system of humans operating in both cooperative and competitive ways. So, asking that they boil down theories into something completely obvious and trivial may be asking too much. It may be the case that no obvious and trivial theory provides anything close to an accurate model of reality.
Now, the issue seems to be that there are a lot of theories in economics that are simply not grounded in any sort of empirical evidence at all, and are merely more mathematical manipulations applied to other theories that haven't been well substantiated. And this may be a problem; it's also a problem in physics, where ideas like string theory take hold and lead to complex, opaque mathematical manipulations that seem to be almost entirely independent of any kind of empirical evidence.
This does not mean that better theories will necessarily be simpler. There are plenty of theories in physics which have been well tested which are quite mathematically complex and non-obvious, like quantum electrodynamics.
> You can have a complex, difficult mathematical theory that is bullshit, and you can have a complex, difficult mathematical theory that is a damned good approximation of reality (remember, in all of science, we are building models or approximations of reality, so even the best theory is never expected to be "right" in some absolute sense).
One quibble. Unlike the empirical sciences, mathematics doesn't have to agree with reality, only with the rest of mathematics. Mathematics need only be internally consistent, where successful empirical science theories need to be both internally and externally consistent, i.e. they must agree with established theories* as well as survive reality-testing.
* = Or overthrow them entirely, as relativity did to the ether theory
> This does not mean that better theories will necessarily be simpler.
Yes, true, but Occam's razor favors simple theories, and there's plenty of empirical support for the idea that a simple explanation is more likely to reflect reality than a complex one.
Sorry, when I used "mathematical" in the quoted paragraph I did not mean an actual theorem in mathematics, I meant a scientific theory that involves heavy use of mathematics to describe some aspect of the world.
> Yes, true, but Occam's razor favors simple theories, and there's plenty of empirical support for the idea that a simple explanation is more likely to reflect reality than a complex one.
All Occam's razor tells us is that all else being equal, the simple theory is more likely to be correct than the more complex. I was not objecting to this observation, just pointing out that in only applies when all else is equal. There are some cases in which Occam's razor does not help you; when the problem being modeled is complex enough that you really do need a difficult, complicated model to accurately model it.
I think the big issue that OP has with economics is that it is neither beautiful, like much of pure mathematics, nor particularly grounded in empirical results, so it essentially winds up being a bunch of complexity for complexity's sake. That's the problem, not just the fact that a theory is complex and difficult to understand.
> Sorry, when I used "mathematical" in the quoted paragraph I did not mean an actual theorem in mathematics, I meant a scientific theory that involves heavy use of mathematics to describe some aspect of the world.
Yes, that's different, and for that case, my reply was misdirected. A theory in mathematical physics must certainly acquire empirical support, and must remain falsifiable in perpetuity.
> I think the big issue that OP has with economics is that it is neither beautiful, like much of pure mathematics, nor particularly grounded in empirical results, so it essentially winds up being a bunch of complexity for complexity's sake.
I agree completely, and the consequences are sometimes severe, as when quants use questionable economic theories to make phony risk estimates that backfire.
> That's the problem, not just the fact that a theory is complex and difficult to understand.
Yes, both difficult to understand, and difficult to test in any meaningful sense.
Under Japanese (and Korean) rules, there occur situation in the end game in which it may be difficult to determine whether a particular group is alive or dead, but the player who would need to play in order to play it out and determine for certain may not want to do so as doing so would fill in their own territory, reducing their score.
Japanese rules have a variety of special cases to deal with this problem, but most beginners don't know them, and many beginners may not know exactly when to stop (as they are unsure if a group is safe or not), and so may wind up reducing their score in the endgame just because they are trying to make sure a group is safe.
Under area scoring rules (Chinese, Tromp-Taylor, AGA, New Zealand, Ing, etc), you count the sum of your territory and your stones on the board, avoiding this problem. AGA has a hack that makes both scoring methods work the same; whenever you pass, you give your opponent an extra prisoner.
Chinese and AGA scoring rules are essentially the same as Tromp-Taylor, just not expressed quite as concisely.
AGA rules actually have a neat hack which makes it so using either area or territory scoring gives you the same result (by making you give an opponent a stone as a capture every time you pass).
The reason Japanese counting is so complex is that there are situations where it would hurt you to play it out in order to determine life or death, as you would need to fill in your own territory, so they've developed a whole bunch of special cases to determine life or death for disputed groups without playing it out. Area scoring eliminates this problem, as does the AGA rule of giving your opponent an extra capture every time you pass.
Really, if people are having trouble with scoring, just teach them area scoring and tell them to play it out until they can score the game unambiguously.
Regarding the last part, have you asked if your landlord (or someone on their behalf) entered your apartment? For a newly rented out apartment, they may have had some kind of work to do or something to check over, and since you were away, may have just let themselves in.
I used to live near a place where they frequently put the "mobile" control on an interstate in Vermont about 80 miles from the border, so I got stopped by it a lot.
Of course, I've always wondered about how useful the mobile controls are, other than for getting people used to a police state. They are not allowed to ask any US citizens for passports or proof of US citizenship; so they always ask "is everyone in this car a US citizen" and then wave you on if you say yes. When my friend, who is Malaysian, answered "no, I'm not a US citizen", they thought based on his excellent American English accent that he was joking and waved him on anyhow.