The relevant portion is: "A person born in the United States to a foreign diplomatic officer accredited to the United States, as a matter of international law, is not subject to the jurisdiction of the United States. That person is not a United States citizen under the Fourteenth Amendment to the Constitution. Such a person may be considered a lawful permanent resident at birth."
Microsoft has had such a service for a few years now, they call it SkyDrive. Unfortunately it wasn't a very good user experience when I last looked at it. It's been a while though (and I just use Dropbox now), so it might have gotten better.
Java and the JVM are not the same thing. Java is a programming language. The JVM is a stack-based virtual machine that executes Java bytecode. Java bytecode is what Java compiles into (ie. the contents of .class files).
As it happens, the JVM can't tell if a .class file was generated from compiling Java code, or handwritten, or generated from another programming language altogether. As long as the class file is valid, the JVM will run it. In the case of Scala, "continue" isn't in the language, so bytecode that performs the operation is never generated by scalac. In fact, "break" and "continue" don't even have any meaning at the JVM level. Java bytecode works at the level of gotos and conditional branches.
Big O notation is intended to convey the algorithm's runtime as a function of the inputs. By the sounds of it, the number of checkboxes you had was actually fixed and relatively small. In this case, the algorithm is still O(n). The real problem with your code is that you went through the list (an expensive operation) multiple times. This gives you a large constant factor, not O(n^2). Because Big O notation is only concerned with large (asymptotic) values, the constants are generally ignored.
If you had a form where the number of checkboxes scaled with the number of items on the list, then you might end up with an O(n^2) algorithm, depending on how exactly they scale.
This document isn't actually a legislation. It is a regulation made under the authority of the Copyright Act, and as the preamble states, it is "for the years 2009 and 2010".
The actual legislation does not make any reference to "pixels" or "frame" or "resolution" at all. If anything, this legislation an example of how write laws so they don't rely on current day technology.
They have a call centre in my hometown, handling calls for a cell phone provider and a credit card company (for the most part at least). My understanding is the company mostly does incoming calls, ie. customer support lines and the like. Their operators identify themselves by the company they're taking calls for, not as Online Support.
I can tell you is isn't being deallocated before being used, that would be a major bug. So, I guess it would get moved, but the GC probably won't run unless the first gen space is pretty full. I'm glossing over details because, well, the GC in the JVM is a very complicated piece of work, and I don't know much of the details, but the JVM does in fact default to a stop-the-world garbage collector[1].
I don't think anyone actually expects the JVM to beat C++ using stack allocated objects[2]. Our concern is how well a garbage collector handles lots of small objects.
[1] Details on how the JVM GC works: http://www.oracle.com/technetwork/java/gc-tuning-5-138395.ht...
[2] There is a switch, which will be on by default one day, that lets the JVM do escape analysis so it can allocate objects on the stack automatically.
High object churn shouldn't be a problem for the JVM, whether it is running Scala or Java code. Allocation lots of little objects and then discarding them shortly after is a use case the JVM is well optimized for. You would have to allocate an extraordinary number of such objects to see any real slowdown.
The Oracle JVM uses generational garbage collection[1]. Glossing over some details, this garbage collector divides objects into generations depending on how long they've been around, and also keeps track of references that cross generations. Objects that are newly created go into the first generation. If the objects don't refer to objects outside of the first generation, it is very cheap for the VM to determine they are in fact garbage. When the garbage collector gets run, objects that a still live get copied to another generation. Once the still live objects are copied out, the VM doesn't need to do any cleanup to get rid of the dead objects, it simply marks the whole memory block the first generation was in as available.
[1] Not that other JVMs don't, but I only know the official one.
Actually, that doesn't appear to be the case. You can see some long term trends from StatsCounter[1]. From May 2009 to May 2011, Firefox's marketshare has been fairly stable, while IE's dropped ~18% and Chrome's rose ~17%.
I think the other replies have answered your question well enough, but your definitions for = are a litle off. The cases 1 and 2 are really the same thing. In Python the names are references to objects. Assignment in Python is like using pointers in C. You are doing mutation, what you mutate is the value of a pointer (and probably some other oddsand ends for garbage collection).
The "=" in the declaration of Haskell functions isn't considered an assignment, but a binding of a name to a definition. Usually when you have assignments, you are permitting a name to be rebound to a different value than it had originally. In Haskell you cannot rebind a name. Essentially "=" in Haskell is more like the operator's use in defining mathematical functions.
Due to how scoping and how do-comprehensions actually work, you can do some things that look like assignment, but are really creating a new binding in a nested scope. But if you try to bind a name twice in the same scope, the program fails to compile.
While not quite a legal requirement, at the last company I worked for the timesheet was described as something like: If we don't give the government timesheets, they don't pay us our salaries.
The one before that said the timesheets were used to do reporting for R&D grants from the government.
There's Happstack too: http://happstack.com/index.html . That said, there are quite a few little Haskell web frameworks/libraries floating around already, so unless you're bringing something absolutely amazing to the table compared to what's there now, I don't see much point in building yet another Haskell web framework.
Looking at the course ( I take it this is what you are talking about? http://www.cs.colorado.edu/ugrad/seniorproject/ ), it seems that your project is based on a proposal from a sponsor, so I'm not sure why you're trying to come up with something already.
I don't know why you have a problem with the past projects. That a couple of undergrads can put together a working, useful (I presume), application is freaking awesome! I wouldn't dare assume a random CS major fresh out of university could pull something like that off.
If the title suggests the article is directly relevant to me, I'll open the article, then the comments. If the title merely looks interesting, or there are a lot of comments, I'll take a look at the comments first, and then maybe the article.
The relevant portion is: "A person born in the United States to a foreign diplomatic officer accredited to the United States, as a matter of international law, is not subject to the jurisdiction of the United States. That person is not a United States citizen under the Fourteenth Amendment to the Constitution. Such a person may be considered a lawful permanent resident at birth."