ResourceBundle getting wrong ListResourceBundle (by Locale)
Wrong Java resource bundle loaded
Is there any canon reference to the Mirror Universe Borg that would explain more about them?   I've tried searching on my own and haven't found anything. How do we know the brain flips images projected on the retina back around? How to create two partitions? Story where vampires are created by drop absorbed on neck? I have been trying to identify a book that I read maybe 25-30 years ago (1987-1992), in which there are vampire or vampire-like creatures, but instead of being created in the traditional way (e.g. bite on the neck), something drops a drop of a fluid on the back of their neck, which is then absorbed into the body and transforms them. I have a vague notion that some sort of tree is what creates these drops. The drops may have had a shiny metallic appearance.  I've tried to find this book before and always came up short. I'm starting to think the whole thing was a dream and I never read it at all. But I really feel like it was a book or at least a short story. How can I identify an anonymous inner class in a NotSerializableException When would I use a voltage regulator vs voltage divider? When would you use a voltage regulator vs a resistor voltage divider?  Are there any uses for which a resistor divider is particularly bad? While looking at online code samples, I have sometimes come across an assignment of a String constant to a String object via the use of the new operator.  For example:  String s; ... s = new String("Hello World");   This, of course, compared to  s = "Hello World";   I'm not familiar with this syntax and have no idea what the purpose or effect would be.  Since String constants typically get stored in the constant pool and then in whatever representation the JVM has for dealing with String constants, would anything even be allocated on the heap? I see lots of tutorials telling me how to root my phone (Motorola Droid), but none of them mention any potential "side effects."  Aside from a few relatively minor issues that seem to require rooting to fix, I'm basically happy with the phone and therefore a little leery of messing with a device that cost me a lot of money and is only a few months old.  Assuming that I'm just talking about rooting, and none of the typical post-root actions (like installing a custom ROM), am I taking any risks by choosing to root?   Does it have the potential to brick the device? Will it void my warranty? Will I stop getting updates? Will the cops show up at my front door the next day? (Yes, I'm being facetious.) Anything else I should be aware of?   (See also: ) elementary ring proof with composition of functions and addition of functions as operations Consider the set $\mathcal{F}=\lbrace f\mid \mathcal{f}:\Bbb{R}\to\Bbb{R}\rbrace$, in which an additive group is defined by addition of functions and a second operation defined as composition of functions. The question asks to verify that the resulting structure does not satisfy the ring properties.     This is the question 24.10 from Modern Algebra, by Durbin, 4th edition.  So what I have so far is that all of the properties for the additive group (with addition of functions as the operation here) hold, associativity of the composition of functions hold, and that the failure must come from the distributive laws.  My proof of my claim, so far;  $$1\,\,\,\,\,[(\mathcal{f}\circ\mathcal{g})+\mathcal{h}](\mathcal{x})=\cdots=\mathcal{f}(\mathcal{g}(\mathcal{x}))+\mathcal{f}(\mathcal{h}(\mathcal{x})).$$ ...but,  $$2\,\,[(\mathcal{f}\circ\mathcal{g})+\mathcal{h}](\mathcal{x})=$$ $$3\,\,(\mathcal{f}\circ\mathcal{g})(\mathcal{x})+\mathcal{h}(\mathcal{x})=$$ $$4\,\,\,\mathcal{f}(\mathcal{g}(\mathcal{x}))+\mathcal{h}(\mathcal{x}).$$ ...which brings me to my contradiction of the properties of rings that;  $$5\,\,\,[\mathcal{f}\circ(\mathcal{g}+\mathcal{h})](\mathcal{x})\neq[(\mathcal{f}\circ\mathcal{g})+\mathcal{h}](\mathcal{x}).$$  So my question is, is this the correct path to showing the distributive laws are not obeyed when composition is taken as an operation on $\mathcal{F}$? particularly my proceeding from 2 to 3 to 4 is what i feel uncomfortable about, like i may be missing a step in there.  thanks A great Python IDE for Ubuntu Possible Duplicate:          I want to develop Python apps in Ubuntu, and I'm tired of working with gedit one time and another.  So I'm trying to find a great Python IDE (a true IDE, not just a syntax-highlighting editor) on the Ubuntu repositories. Which one do you recommend me? How can one prove that the series $\displaystyle \sum\limits_{n=1}^\infty \frac{1}{(n!)^2}$ converges to an irrational number? There's no need to use Taylor expansion, integrals or any advanced/professional techniques. It can be proved using only basic techniques. My first attempt was to assume that the series does converge to a rational number $ \frac{p}{q}$ and then it follows by definition that for every positive epsilon there exists an integer k such that $ {\sum_{n=1}^{k} \frac{1}{(n!)^2} -\frac{p}{q}}&lt;=\epsilon$ I tried to get a contradiction but I failed. Both apt-get update and upgrade hang:  sudo apt-get update [sudo] password for xxx:  0% [Connecting to archive.ubuntu.com (2001:67c:1360:8001::17)]   I'm able to ping archive.ubuntu.com:  ping archive.ubuntu.com PING archive.ubuntu.com (91.189.88.162) 56(84) bytes of data. 64 bytes from yukinko.canonical.com (91.189.88.162): icmp_seq=1 ttl=50 time=42.2 ms 64 bytes from yukinko.canonical.com (91.189.88.162): icmp_seq=2 ttl=50 time=42.1 ms 64 bytes from yukinko.canonical.com (91.189.88.162): icmp_seq=3 ttl=50 time=42.1 ms ^C --- archive.ubuntu.com ping statistics --- 3 packets transmitted, 3 received, 0% packet loss, time 2002ms rtt min/avg/max/mdev = 42.169/42.206/42.265/0.240 ms   I checked , and I don't think its the same issue.  Any tips for investigating this further? Eigenvalues of the rank one matrix $uv^T$ Is $C[0,1]$ a Banach space for the $L^1$ norm? Is $C[0,1]$ a Banach space with respect to the norm $\|f\| = \int\limits_0^1|f(t)| \, dt$?   People keep telling me it is, but lets consider: $f_n(x) = x^n$. This function defines a Cauchy sequence, yet the limit clearly isn't a continuous function! Format SQL in SQL Server Management Studio In Visual Studio &amp; other IDEs, you can easily auto format your code with a keyboard shortcut, through the menu, or automatically as you type.  I was wondering if there is yet a way to enable this standard feature in SQL Server Management Studio?  I'm working with some large-ish stored procs that are a mangled mess of poorly formatted SQL and it'd be nice if I could just go "Select All -> Format SQL" This is something I've been curious about since starting this whole 'meta' thing a couple years back.     Let's say a user posts a feature request.   Under what circumstances is the feature-request read by staff? If staff decline to do anything (I'd guess it's some sort of triage), under what circumstances is the feature-request reevaluated by staff?     Let's say a user posts a bug.    Under what circumstances is the bug tested? What generally determines whether a verified bug is actionable? (And/or what are the criterion for deciding what to do?)     For both of the above, would it be possible to see a general-but-relatively-detailed flow for what happens to these questions? It would help everyone if we provided a mechanism that people could use to flag their post if English is language they are not comfortably fluent in. A lot of non-English speakers have to go to English forums for tech support and find it embarrassing to ask questions in broken Englis.   Worse, people reading a post often cannot tell if a badly-worded post results from a poor English or just laziness and sloppiness on the part of a native English speaker. Personally, I will take the time to puzzle out a poorly-worded post if I know the author is struggling with English, but if I think they're just lazy and careless I won't bother.   A simple check box could flag the author as a non-English speaker and allow everyone to adjust accordingly.   Edit01:  Some answers below have accused me of being 'elitist'. I'm not sure where they got the idea that I was sneering down at anyone because their abilities at either English or coding. That was not my intent.   When I said I would not bother with post that appeared to incoherent owing to laziness or carelessness, I am not being elitist. I'm giving priority in my time budget to people who are respectful enough of my time to spend the their time writing as clear a question as their grasp of English and coding allows. Why should I spend time answering a careless and slapdash post when I could spend that time helping posters who took more of their time writing their questions?   I am perfectly willing to burn a lot of time helping someone struggling to write code in their non-native language. I have a hard enough time coding myself in English that I can't even imagine what a dog's breakfast I would make of it if I had to code in, say, Korean.    I have seen many instances in which questions have been downvoted when a quick glance at the poster's profile gives a strong hint they are not native English speakers. I would like a system that would spare those posters from being downvoted or ignored by using an interface element that clearly communicates in a standardized way whether the poster natively speaks English or not.   I don't see what's elitist about that.    Edit02:   (original unedited) I'm talking about:     Hy, I have a childe view that put it   self over other brother views. The   problem is that when i touch it the   brother also reacts at the touch   event. How can I disable touch   propagation on the underlieng brother   views?   I'm not even exactly sure what he is describing. I can guess that he has a sibling view that extends over its siblings but I'm not sure. If I edited it, I might not end up asking the same question the poster intended.   To answer the question, I will either have to (1) first ask for more detail and then keep checking back until I get it or (2) try to answer what I think the question is and possibly mangle it then have to come back and edit my answer all the while risking a downvote because I answered the wrong question.   I will take the time and the risk of down vote if the poster is not a native English speaker (or is a child) and the confusing question represents their honest best effort. If they're just being lazy, I have other people to help.   I would like a mechanism that would help me decide how to allocate my time and would protect the non-English speaking posters from unjust downvotes. How do I uninstall Ubuntu? How do I format drive and unistall Ubuntu 11.10?  I wanted a dual boot and was given an option to overwrite Windows XP partition and said yes.  Format options don't work.  I tried a few dos prompts and probably not using correct fdisk.  Format options state drive is busy closed all windows.  Tried to boot windows XP and disk says its corrupt. I have some thoughts on this. First, I want to say I am no expert on cryptography, I just know some stuff, and I took a cryptography class in University. I am very interested in this topic.  I understand that many security experts out there might get angry just by the discussion of these things, but I hope you can spare me :)  My Questions:  Would it be possible to break an RSA key, in for example 1 week of time, if the cracker have already spent X number of years building an index of primes by performing every permutation of existing prime keys up to 2^2048 ?  I understand this would take an immense amount of time to do, but it would only be done once.  Given the public key, you would be able to look up what the two primes are, and hence retrieve the private key instantly.  When I consider who might break such a code, I am primarily thinking about NSA and other Governments that might have spent years in research and have the resources and interest in doing so.  Breaking an 256 AES would then be easier, as AES keys are often generated using the RSA private key.  Would it be possible to build such an index ? How long would that take in permutations, and perhaps with the fastest computer in the world ?  I hope we can have a nice chat about this. We are just discussion theory here. I hope you can offer me some insight on this topic.  Thanks! I'm having trouble figuring out how to iterate over map layers. I can access the currently highlighted layer in the table of contents via iface.activeLayer() but I want my code to operate on all layers.  I don't see anything in the API that provides easy access to this functionality and couldn't find a good online example but maybe I missed something?