How can I modify $scope.variable1 if it is passed to a function as a parameter?
Is JavaScript a pass-by-reference or pass-by-value language?
How to download Bootcamp drivers without Bootcamp assistant? Mathoverflow - why so different Is this arthropod non-intrusive and recommended to be left alive? I am in Portugal (Lisbon) at the moment, and when leaving my room late at night (12 pm ~ 04 am) I usually face about 4 of these arthropods in the corridors:    (For reference, the "line" in the image is a standard separation on the floor. This particular example of the animal is a little smaller than a nail.) They seem to have quite variable sizes and walk primarily on ground. Also, as implicit above, they seem to be active primarily during the late night. (I don't see them much often, if at all, during the morning/afternoon.) They can be quite fast, but if left unharmed do not move much. They also appear to take shelter inside the walls.  From what I searched, it seems possible that they are centipedes. I've seen sites saying that they are useful to keep other less pleasant animals at bay. My questions are: What are those animals, and should I leave them be or not? What can a wizard take instead of a familiar at 1st level? The familiar is brilliant feature for a wizard, but not for a prestige multiclassing one. Such a wizard stops upgrading his familiar once getting off the main road. So if he still wants to utilize his familiar, he should take the obtain familiar feat, but this would made the basic familiar feature redundant.  So what options can a wizard take instead of gaining a familiar at 1st level? Cannot connect to internet after using airmon-ng check kill In new version of Kali 2.0 with updated "aircrack-ng" tool, there is a problem between Internet connection and using cracking tools.   I have my wireless card as wlan0. And the Internet connection is fine too. Then, what I do is:  airmon-ng start wlan0 airodump-ng wlan0mon   Now the airodump-ng doesn't work, saying "Device or resource busy".  In order to run this I have to kill some processes, using:  airmon-ng stop wlan0 airmon-ng check kill airmon-ng start wlan0 airodump-ng wlan0mon   Now the cracking process is up.   I can start cracking, but now I cannot connect to the Internet after the kill process.  On typing iwconfig in terminal, I get this:  root@kali:~#iwconfig wlan0mon IEEE 802.11bgn  ESSID:"myessid"         Mode:Managed  Frequency:2.412 GHz  Access Point: 00:00:00:00:00:00          Bit Rate=108 Mb/s   Tx-Power=20 dBm          Retry short limit:7   RTS thr:off   Fragment thr:off       Encryption key:off       Power Management:off       Link Quality=42/70  Signal level=-68 dBm         Rx invalid nwid:0  Rx invalid crypt:0  Rx invalid frag:0       Tx excessive retries:2  Invalid misc:9   Missed beacon:0  eth0      no wireless extensions. lo        no wireless extensions.   And, on running ifconfig on terminal, I get this:  root@kali:~#ifconfig lo        Link encap:Local Loopback         inet addr:127.0.0.1  Mask:255.0.0.0       inet6 addr: ::1/128 Scope:Host       UP LOOPBACK RUNNING  MTU:65536  Metric:1       RX packets:5604 errors:0 dropped:0 overruns:0 frame:0       TX packets:5604 errors:0 dropped:0 overruns:0 carrier:0       collisions:0 txqueuelen:0        RX bytes:452904 (442.2 KiB)  TX bytes:452904 (442.2 KiB)   There is no wlan0 or wlan0mon. I also restarted the network manager by:      service network-manager restart   But nothing changed. Though it displays wlan0 when checked using ifconfig this time. Showing that $\displaystyle\lim_{s \to{1+}}{(s-1)\zeta(s)}=1$ I need prove the following: ($\zeta(s)$ is the Riemann zeta function)  $\displaystyle\lim_{s \to{1+}}{(s-1)\zeta(s)}=1$  I really don't know, I have tried hard, but have obtained nothing for now. I simply can't figure out what the capacity of this circuit is.  I can do the math myself, I just need a hint how to create an equivalent circuit where it is obvious what is parallel and what is in series... What should the standard spelling be - British or US? If a commutative ring is semiprime and its prime ideals are maximal then it is von Neumann regular (absolutely flat). If a commutative ring is semiprime and its prime ideals are maximal then it is von Neumann regular (absolutely flat).  The converse, although not immediately apparent, can be proven quite easily. But I've been stuck on this one for awhile.  I found that Bourbaki has a question in his treatise on commutative algebra, namely: if all points in Spec(A) are closed (ie. prime ideals are maximal) then A/R (where R is the nilradical) is von Neumann regular (absolutely flat). If this can be proven, the above statement follows immediately since the nilradical of a semiprime ring 0?  Ideas?   Ps: this is my first time posting a question so apologies for any formatting issues. How can I return NULL from a generic method in C#? I designed a poster in CorelDraw X5 for printing purposes. I was told by the Printshop guy to use colors only in CMYK. For the most part I did, I don't know why I missed it but I used one color in RGB. I liked this color so much that I've used it at many places. So, current situation is that some colors are in RGB and some are in CMYK. So, I want to convert all RGB to CMYK and thought the problem would be solved. But now I'm actually facing a lot of trouble. The colors are not at all same. I hate the colors that it is showing me.  This is the color I used in RGB:    When I changed the "Model" to CMYK, the color it shows is really different. As you can see in the picture below, it's too dull:    The RGB values of both colors are not the same. What can I do to get the same color in CMYK? I did a little bit of reading here and there. They say, that you can't get same. In that case, what is the closest color that I can get? Allow embedded HTML5 YouTube video How do I ask LaTeX to exactly fill up a page? I understand that I can control interline spacing in LaTeX in a number of ways. The commands like ,  ,  come in handy in controlling the interline spacing. Each has its own speciality and circumstances of usage, as we can find in these discussions (, , ).  If want to go for a ready made solution for controlling line spacing, packages like  come in quite handy (built-in commands like \onehalfspacing or \setstretch for more finer controls).  Anyway, my problem is a bit different. I have some text (both in paragraph and list mode) which I want to fill up exactly one page. To complicate the scenario, it may even contain equations and graphics. (Let us leave aside floats.)   If I want to solve the problem statically, all I will have to is to play with some value of \baselineskip (or  \setstretch) until satisfied. While this works good for most of the cases, I will have to go through the process again when I want to delete or add some texts.  Would it be possible to have a dynamic value for  \baselineskip or  \setstretch so that my text always fills up one page? (Definitely within reasonable limits.)  Another idea will be to use a number of \vfills between some pieces of texts. But I think that this technique is usable for cover pages only.  I am not putting here an MWE. I think that one is not applicable.    The problem is not a theoretical one, I am preparing some kind of handout which I want to fill-up exactly one page. Why is 128==128 false but 127==127 is true when comparing Integer wrappers in Java? I'm an elected diamond moderator on one site, and a user of several others. I think it would be extremely helpful for our flagging process if users had the option to enter freeform text explaining their flag on types of flags other than the "in need of moderator attention" flag.  An example of when this is relevant: Sometimes posts have had rude/abusive flags, but the rude/abusive part might be difficult to notice, or it might be a single word or sentence buried somewhere in the middle of the post. Users have to choose between "flag it as rude with no explanation" or "flag it as misc and explain what's going on". Often they'll pick the first because of course it seems like what they should do (e.g. they know the system has special handling attached to rude/abusive flags) but it means they can't explain what's going on to us, so we have to reach out directly in private to find out.  Sometimes it also helps to be able to explain why a comment is no longer needed, because past experience tells me the "no longer needed" flag on its own might be declined on a particular site -- so I pick the custom reason instead of "no longer needed" just so I can provide explanation.  I'd prefer users be able to understand they can pick the appropriate reason and be able to attach any explanation they deem necessary to further direct moderators to the issue. If not for all kinds of flags, then at least for spam or rude/abusive flags. describes the first-order vs. second-order logic as follows:     First-order logic uses only variables that range over individuals (elements of the domain of discourse); second-order logic has these variables as well as additional variables that range over sets of individuals.   It gives $\forall P\,\forall x (x \in P \lor x \notin P)$ as an SO-logic formula, which makes perfect sense to me.  However, in a , the poster claimed that $\forall x\forall y(x=y\leftrightarrow\forall z(z\in x\leftrightarrow z\in y))$ is an FO formula. I think this must not be the case, since in the above formula, $x$ and $y$ are sets of individuals, while $z$ is an individual (and therefore this must be an SO formula).  I mentioned this as a comment, but two users commented that ZF can be entirely described by FO logic, and therefore $\forall x\forall y(x=y\leftrightarrow\forall z(z\in x\leftrightarrow z\in y))$ is an FO formula.  I'm confused. Could someone explain this please? What is the best way to tokenize/split a NSString in Objective-C? Here’s something that sucks:   Plug in external monitor to laptop (Mac OS X Leopard in my case). Arrange your windows to have the IDE on one screen and browser on another. (Etc etc.  Resize, rearrange, fuss, fuss, fuss.) Unplug monitor to run to a meeting, or whatever. Goto 1.   I’d like to replace step 2 with “computer remembers exactly how I had it and just puts it back that way”.  (I personally only need a solution for Mac but collecting solutions for other systems here might be useful to others.  I’m sure it’s a common problem.) optimality of the Carnot cycle Do spellcasters know when a dismissable spell has been broken? Do spell casters know how long their spells are active, and can they tell at a glance?  Specifically lets talk about , as I know its a permanent duration and dismissable. Does the spell caster who put someone under this spell know how long it is active? Could they tell automatically just by seeing the person (without any clues like them walking in a maze without difficulty or reacting to a sound)? So could they tell if someone has broken the spell they cast?