PS3 and PS4 switch
GTA V Online Character Transfer PS3 to PS4
In my javascript I have this      loopDeLoop:         while (foo !== bar) {             switch (fubar) {                 case reallyFubar:                     if (anotherFoo == anotherBar) {                         break loopDeLoop;                     }                     break;                 default:                     break;             }         }   But JSLint says... lint warning: use of label  Here's the notes from        Labels   JavaScript allows any statement to have a label, and labels have a separate name space. JSLint is more strict.      JSLint expects labels only on statements that interact with break: switch, while, do, and for. JSLint expects that labels will be distinct from vars and parameters.   How do I construct the above to get rid of the warning?  Thanks, Greg I am trying to find all the Sylow 2 subgroups of S4 using Sylow’s theorems. Now, I know that a Sylow 2 subgroup of S4 has size 8, and that there are either 1 or 3 of them (as the number of of Sylow 2-subgroups has form 1+2k and divides 3, the index).  Now my lecturer states “stabilisers of the 3 different bisections of {1,2,3,4} yield 3 distinct Sylow 2 subgroups”  Now my questions are:  1) What does it mean by stabilisers of 3 different bijections of {1,2,3,4}? Is that to say the elements of S4 which send {1,2} and {3,4} to {1,2},{3,4} i.e. by (12)(34)?  2) How does he know that there are 8 elements of this set? Perhaps this will become clearer after the 1st question is answered.  Many thanks, group theory is hard. Performing multiple layer intersection in QGIS? Was Red Shirt Security a rotating detail, like K.P, or was it a dedicated branch of Star Fleet like the M.P's are to the US Army? As I channel surfed the other day, I accidentally found an episode of Star Trek TOS, and I settled in to watch it. As always, it was a bad day to be a landing party Red Shirt Security person.    Their apparent lack of skill (training?) made me wonder: Was Red Shirt Security a rotating detail, like K.P. (Kitchen Patrol), that crew members with regular assigned duties were ordered to do when it was their turn, or was it a dedicated branch of Star Fleet like the M.P's (Military Police) are to the US Army? In a field that is the direct product of two fields, why isn't it a field? Suppose that we have the direct product of two fields, defined as: $\mathbb{F}^2 = \mathbb{F} \ \times\ \mathbb{F}$. Then, this is obviously not a field because we can take $(1,0)$, and this doesn't have a multiplicative inverse. However, I saw a mention to this today in a book, and the reasoning was:     "$\mathbb{F} \ \times\ \mathbb{F}$ has the zero-divisor $(1,0) \neq  (0,0)$, hence it is not a field".   (Lectures on Rings and Modules by Joachim Lambek, pg. 17).  I am not sure what they mean by zero-divisor here nor what $(1,0) \neq  (0,0)$ has anything to do with the direct product of fields not being a field. I always assumed there wasn't a multiplicative inverse, and that was it. Am I missing something deeper? What can I do to increase passive HF RFID read range? I am working on a prototype, one function of which is to detect whether an object is "in range" by a few cm. Right now I'm just using an Arduino and a cheap  that operates at 13.56 MHz:    I've successfully gotten it to detect the tag, but only at a distance of about 3-4 cm when the tag is oriented parallel to the antenna.  According to my  , the HF band allows read ranges of between 10 cm and 1 m for passive tags, depending on factors like antenna size, tag size and orientation, and transceiver power.  I realize this inexpensive reader is not up to task as-is, but I'm interested in building something that achieves read ranges of 15-20 cm.  Some criteria:   No need to read multiple tags; only whether one tag is in range or not. No need to write to the tag. Cannot use an active tag.   I'm not experienced with RFID reader construction (yet) but am interested in knowing what I should pursue.  Here are some things I've considered:   Ditch the embedded antenna on the cheap RFID reader and construct my own, larger antenna. I'd need to see if the onboard  is up to the task of providing additional power. Look for a different IC around which to build a reader from scratch. Find a ready-made solution instead of trying to build one (more cost-effective?). Use something other than RFID for simple proximity detection.   I am experienced with microcontrollers and basic electronics, and have made audio and lighting projects, but this is a first with RFID. Since I don't need to read multiple tags, which RFID is suitable for, I've considered maybe some sort of magnet and hall-effect sensor, but the range does not seem adequate. I considered using an ultrasonic proximity detector, but the application calls for detecting the tagged object while ignoring untagged ones (ultrasonic would produce false positives on untagged objects). I've considered some sort of reflective surface placed on the object, and detecting reflected light, but the object orientation is not reliable enough to maintain alignment.  So, in a nutshell, What modifications can I make to my existing reader, or what alternate technology should I pursue to achieve 15-20 cm detection of a passively tagged object?  I plan on connecting whatever proximity detector is used to a microcontroller using SPI. Where can I find other RPG players? Where did the practice of using apostrophes for possessive nouns but not pronouns originate? Where did the practice of using apostrophes for possessive nouns but not pronouns originate?  For example, possessive nouns (both proper and common) are written with a apostrophe before the final s:        Bill’s, not Bills   Sarah’s, not Sarahs   the bear’s, not the bears   the lizard’s, not the lizards      On the other hand, several possessive pronouns do not have apostrophes before the s:        his, not hi’s   hers, not her’s   its, not it’s   theirs, not their’s   ours, not our’s   yours, not your’s      When and where did this usage originate? Was there any technical advantage of this usage? I was wondering how one can construct a Borel set that doesn't have full measure on any interval of the real line but does have positive measure everywhere.   To be precise, if $\mu$ denotes Lebesgue measure, how would one construct a Borel set $A \subset \mathbb{R}$ such that $$0 &lt; \mu(A \cap I) &lt; \mu(I)$$ for every interval $I$ in $\mathbb{R}$?   Moreover, would such a set necessarily have to contain infinite measure? Chat related privileges are not site specific Do fluorescent lighting and shutter speed create a problem with color cast? I took a bunch of photos at my son's martial arts club using a D90 with a 50mm F1.8.  The club is lit with overhead fluorescent lighting, and I was getting some weird results where some shots are "white", others have an "orange cast", and still others are partly white and partly orange in the same shot.  I suspect it has to do with the combination of the frequency of the light flicker and with the camera shutter speed. Here is a sequence of 3 shots that show the problem.  The shots were taken with 1/500s at F2 and ISO-800 and with Auto-WB.  First shot ("white/normal"):    Second shot ("orange cast" at top):   Third shot ("orange cast" at bottom):   These were taken in burst mode within a second of each other.  Can anybody tell me what is going on?  And, how I can avoid this? This is a question you can read everywhere on the web with various answers:  $ext = end(explode('.', $filename)); $ext = substr(strrchr($filename, '.'), 1); $ext = substr($filename, strrpos($filename, '.') + 1); $ext = preg_replace('/^.*\.([^.]+)$/D', '$1', $filename);  $exts = split("[/\\.]", $filename); $n    = count($exts)-1; $ext  = $exts[$n];   etc.  However, there is always "the best way" and it should be on Stack Overflow. What are the alternative Android app markets? How many competing Android markets (other than the Play Store itself) are there and are they any good?  Which ones do you use and why? In my book, it proves that an infinite subset of a coutnable set is countable. But not all the details are filled in, and I've tried to fill in all the details below. Could someone tell me if what I wrote below is valid?  Let $S$ be an infinite subset of a countable set $T$. Since $T$ is countable, there exists a bijection $f: \mathbb{N} \rightarrow T$. And $S \subseteq T = \{ f(n) \ | \ n \in \mathbb{N} \}$. Let $n_{1}$ be the smallest positive integer such that $f(n_{1}) \in S$. And continue where $n_{k}$ is the smallest positive integer greater than $n_{k-1}$ such that $f(n_{k}) \in S$. And because $S$ is infinite, we continue forever. Now consider the function $\beta : \mathbb{N} \rightarrow S$ which sends $k \rightarrow f(n_{k})$.   So in order for $S$ to be countable, $\beta$ would have to be a bijection. $\beta$ is injective since if $f(n_{k}) = f(n_{j})$, then $n_{k} = n_{j}$ because $f$ is injective. We also can conclude $k = j$ because the various $n_{i}$ chosen were strictly increasing.   Edit: $\beta$ also needs to be surjective. So for every $r \in S$ there exists a $q \in \mathbb{N}$ such that $\beta(q) = f(n_{q}) = r$. We know that $f^{-1}(r) \in \{n_{1}, n_{2}, ..., n_{k} ... \}$, so we can let $f^{-1}(r) = n_{d}$. Thus $\beta(d) = f(n_{d}) = r$. Short story: rocket fuel which oxidizes iron destroys life on earth I'm looking for the title of a short science fiction story, probably published in a Hugo winner collection 30 years ago. In the story, scientists have developed an extremely efficient rocket fuel that has one dangerous side-effect: it oxidizes iron. A man takes off in a rocket powered by this fuel but returns to find the earth completely devoid of life. His subsequent investigation reveals that a single drop of the fuel began a domino effect, as the substance oxidized all iron it came into contact with. In the end, the man is dying.  He drags himself to the ocean, believing that if he can get his living cells into the water they will restart the primordial soup. Self-promotion in chat We know from the  that it is accepted only in a limited way in answers and frowned upon if found to be spammy. We know from  that it can be deleted at any time from comments if the comment is not relevant or spammy.  But what about the chat? This leaves chat to be the only legitimate place to promote products or services that the user is affiliated to (albeit in an ad-like way).  What is your opinion? I have a population of phone calls - 200,000.  There are different reasons for each call, but lets assume the number of reasons is known. i.e. 7 different call reasons: 1) Check on order 2) Cancel order 3) Billing information 4) Account information etc...  My question is, I want to get a statistically significant sample size so the number of calls I listen to in my sample are representative of the distribution of the reasons in the overall population of 200,000 calls.  What should the sample size be? Which methods to use to calculate the sample size? Counter ions and charge of a complex how can I add the charge and the counter ions to my complex? I'm using chemfig.  \schemestart \chemname{\chemleft[\chemfig{Ni (&lt;:[1]OH_2) (-[2]OH_2) (&lt;:[3]OH_2) (&lt;[5]OH_2) (-[6]OH_2) (&lt;[7]OH_2) }\chemright]}{\ce{[Ni(OH2)6]Cl2}} \schemestop     Thanks! Let $P$ be a prime. Show that $\exists$ $x \in \mathbb{N}$ such that $f(x) = p$ then $\exists$ $y \in \mathbb{N}$ such that $g(y) = p$ What is given?  $$\text{Let P be a prime}$$ $$\text{Let} \space f(x)= 3x+1$$ $$\text{Let} \space g(x)= 6x+1$$  Show that: If there exists $x \in \mathbb{N}$ such that $f(x) = P $ , then there exists a $y \in \mathbb{N}$ , such that $g(y) = P$  What have I tried?   Given the question says 'show that', that leads me to believe I need to do a proof of sorts. I'm guessing it might be a proof by either strong induction, or just induction (or maybe just a direct proof?).  I don't even know how to set this up If $f(x) =$ $3x + 1 = $ prime...for any integer $x$, then there exists an integer $y$ such that $g(y) = 6y + 1 = $ prime?   Any hints or starting points would be greatly appreciated.   $$\text{Thanks in advance!}$$ HTTP vs HTTPS performance Are there any major differences in performance between http and https?  I seem to recall reading that HTTPS can be a fifth as fast as HTTP.  Is this valid with the current generation webservers/browsers?  If so, are there any whitepapers to support it?