So, here we have how my new prison currently looks. However, I ran into issues when it comes to keeping the prisoners to where they belong.  I have 3 cell blocks, the grey ones are currently open to min sec and med sec while i placed all the max sec into another block. I've built them a seperate canteen, a yard, common room, laundry and placed a shower head into each cell. I didn't want to build all these classrooms, chapels and so on just for the max secs, so I want them to be able to leave their block to enter them. But for some reason, the max secs can walk around the prison freely since I don't have a chance to restrict them to specific areas. I've tried to create small areas and make them minsec only or medsec only, but i need both, min and med, to be able to pass through those areas.  Basically, in the image, you can see where the max secs should be able to go, but not further. How can I do that?
How can I make sure that only low and medium security inmates are in a specific area? Is it possible to reverse the overlay you can set? It seems like you are only able to clear areas for low OR medium security prisoners, but sharing is not possible. The thing I want here is to make sure that max security prisoners are not in certain areas.
R's lmer cheat sheet I want to talk to someone about the house that my wife and I own.  Saying, for example, "My wife's and my house is awesome," sounds a bit funny to me.  What's the best way to express this?  Clarification  I'm asking specifically about the grammar of multiple nouns in possessive form.  I'm particularly curious if it's possible to do this with a first-person pronoun (me).  I am capable of rephrasing this in other ways - my question is not how to express the idea, but about this particular grammatical construction, if it is even legal. I recently installed Ubuntu 11.10 (new install). I would like to use the Adwaita theme with Unity, but it seems that it is not available in the theme selection dialog. I know I get it there after installing gnome-shell, but is there a way to use Adwaita theme for Unity without installing gnome-shell? What is a good replacement for a cable end cap? I was adjusting the tension of my front derailleur cable and managed to pop off the cable end cap. The cable is now quite frayed at the end and I think it would be difficult to attach another cap.  What would work as a suitable replacement for a cap? I've read that perhaps superglue or duct tape could work? Pressing Ctrl Alt NumPad 0 causes the camera to teleport over and align itself to the current view in the 3D viewport. However, it usually takes up only a small portion of the view, meaning that you have to move the camera back to fit the same view you had before. Is there a way to set the camera view to fill more of the 3D viewport when using this feature? When $z\neq 0$, $\arg z$ is defined to be the set $\{\theta \in \mathbb{R} : z=|z|e^{i\theta}\}$.  What if $z=0$? Usually does one leave the argument of $0$ undefined? Or is $\arg 0 = \mathbb{R}$? Finding the asymptotic of an integral I came across the following exercise on asymptotic behavior of integrals: $$I(a) = \int_0^\infty\frac{\cos x}{x^a} \, dx, \text{ where } a\to0^+.$$ I have tried integrating by parts or replacing $\cos x$ with the first summands of its Taylor series, but I end up with something equal to infinity (independent of $a$ and that is not what we want).  I just thought about the substitution $x \leftrightarrow\frac{1}{1+x^2}$ and I get the  following result:  $$I(a) = \frac{\cos(1/2)}{2^{2-a}} + \int_0^1\frac{2x^3 \cos\left(\frac{1}{1+x^2}\right)}{(1+x^2)^{3-a}} \, dx - \int_0^1 \frac{2x^3\sin\left(\frac{1}{1+x^2}\right)}{(1+x^2)^{2-2a}}\,dx$$ If I could prove that the last summands are $o(I(a))$ then it would be OK, but I think, in general my strategy won't work. Apparently this is supposed to be an easy exercise, but I can't come up with anything right now. If $S_n$ has cyclic subgroups of these orders or not? This question was asked in my quiz and I am having difficulties in solving it .  Question : For a positive integer $n$ , let $S_n$ denote permutation group on $n$ symbols. Choose correct statements from below. (a) For a positive integer $n$ and for every $m$ with $1\leq m \leq n , S_n $ has a cyclic subgroup of order $m$; (b) For every positive integer $n$ and for every $m$ with $n&lt;m &lt;n!$, $S_n$ has a cyclic subgroup of order $m$; (c) There exists positive integers $n$ and $m$ with $n&lt;m&lt;n!$ such that $S_n$ has a cyclic subgroup of order $m$; (d) For every positive integer $n$ and for every group $G$ of order $n$, $G$ is isomorphic to a subgroup of order $S_n$ .  Attempt: (a) is true as I can choose an element of length $m$ which will generate cyclic subgroup of order $m$. (b) Choose $n=4$ and $m=19$ to contradict (b). (c) I dont know if there can be found any such case and if yes how to do so . (d) I dont know about it . kindly tell. Answer:   A,C,D are true Finding the variable name passed to a function Is there an intuitive reason the brachistochrone and the tautochrone are the same curve? The  asks what shape a hill should be so a ball slides down in the least time.  The  asks what shape yields an oscillation frequency that is independent of amplitude.  The answer to both problems is a cycloid.  Is there an intuitive reason why these problems have the same answer?  Proposed operational definition of "intuitive":  Imagine modifying the problem slightly, either to the  (tunnel through Earth), or by taking account of the finite radius of the ball.  If the answer to the original question is intuitive, we should easily be able  to tell whether these modified situations continue to have the same brachistochrone and tautochrone curves. This is, how I download various master branches from GitHub, and I aim to have a prettier script (and maybe more reliable?).  wget -P ~/ https://github.com/user/repository/archive/master.zip unzip ~/master.zip mv ~/*-master ~/dir-name   Can this be shorten to one line somehow, maybe with tar and pipe?  Please address issues of downloading directly to the home directory ~/ and having a certain name for the directory (mv really needed?). Eclipse was working as good as anything on 14.04. I did a clean install of 16.04 and installed Eclipse. But it runs a Java program only once after which it just hangs during subsequent attempts before I remove and reinstall it. I have tried many things, since in the beginning I needed CDT as well. Right now, I just want to remove everything related to eclipse and do a fresh install (remove all the configs and dependencies). Please note that I used Eclipse installer to install Eclipse and the eclipse icon image is also not appearing (the default ubuntu ? is appearing). Is it possible to set the "urgent" flag in Gmail for outgoing mail? I'd like to be able to flag time-sensitive emails as such. Maximizing expected value of coin reveal game I was asked this question today in an interview and am still not sure of the answer. The question is as follows.   Part one:  Say I have flipped 100 coins already and they are hidden to you. Now I reveal these coins one by one and you are to guess if it is heads or tails before I reveal the coin. If you get it correct, you get $\$1$. If you get it incorrect, you get $\$0$. I will allow you to ask me one yes or no question about the sequence for free. What will it be to maximize your profit?  My approach for this part of the problem was to ask if there were more heads than tails. If they say yes, I will just guess all heads otherwise I just guess all tails. I know the expected value for this should be greater than 50 but is it possible to calculate the exact value for this? If so, how would you do it?   Part two: Same scenario as before but now I will charge for a question. I will allow you to ask me any amount of yes or no questions as I go through this process for $\$1$. What is your strategy to maximize your profit?  I was not sure about the answer to this part of the question. Would the best option be to guess randomly? I think the expected value of this should be 50. I am not sure about the expected value of part one but if it is greater than 51, I think I could also use that approach. Anyone have a good idea for this part? Combining |- and !.5! in TikZ How do I combine the !.5! operator with the -| operator?  I want a node that has x-coordinate equal to the average of x coordinates of nodes A and B, and a y-coordinate equal to the average the y coordinates of nodes C and D. Clearly, if Wolverine bleeds on the ground, a new Wolverine doesn't reconstitute himself from the drop. Presumably, if somehow his arm could be severed, that wouldn't happen there, either. If his head were cut off...probably not either.  So it seems that there's a minimum amount of contiguous body mass Wolverine has to have from which he can heal.  Maybe limbs are the limit...are there examples of Wolverine regenerating a lost limb? If so, well, this question. If not, is there anything else in the canon to suggest an answer? Let $(A,+,\cdot)$ be a unity ring with the property that if $x \in A$ and $x^2=0$ then $x=0$. Consider the set $M=\{a\in A | a^3=a\}$. Prove that:      a) $2a\in Z(A)$, $\forall a\in M$, where $Z(A)$ denotes the centre of the ring $A$;   b) $ab=ba$, $\forall a,b\in M$.   My attempts revolved around the fact that an idempotent element in a reduced ring is central. So, since for $a\in M$ we have that $(a^2)^2=a^2$, it follows that $a^2\in Z(A)$, $\forall a\in M$. The next thing I wanted to use in order to solve a) was that $Z(A)$ is a subring of $A$, so if I had proved that $(a+1)^2 \in Z(A)$, $\forall a\in M$, then we would have reached the desired conclusion. However, I couldn't prove this and I honestly doubt that it is true. Another idea that I had was to prove that $M$ is a subring of $A$. Of course, this didn't work out because I cannot even prove that $M$ is closed under addition. Again, I don't know if this is true and it most likely isn't. As for b), I think that a) should be of use, but I don't know how. It is a well-known problem that a ring with $x^3=x$ for any $x$ in that ring is commutative, but since $(M,+,\cdot)$ is almost definitely not a ring, this doesn't help. EDIT: Is there any chance that this question is simply wrong? I tended to believe this before asking it here too, but since nobody has made any progress on it until now I am even more inclined to think so. Divisibility Rule for 9 I'm working through an elementary number theory course right now and I think I've come up with a proof here but wanted some feedback on my logic.    Question:  If the sum of the digits in base 10 is divisible by 9, then the number itself is divisible by 9.    Proof: Suppose that $9|d_1+d_2+...+d_n$ then $d_1+d_2+...+d_n=0\mod9$  Now consider $d_1(10^{n-1})+d_2(10^{n-2})+...+d_{(n-1)}(10^1)+d_n(10^0)$ Each power of $10$ is equivalent to $1\mod9$   therefor  $d_1(10^{n-1})+d_2(10^{n-2})+...+d_{(n-1)}(10^1)+d_n(10^0)=(1\mod9)(d_1+d_2+...d_n)$  $9|(d_1+d_2+...d_n)$ by our assumption, thus $9|(1\mod9)(d_1+d_2+...d_n)$  Thus we have shown that if 9 divides the sum of the digits in base 10, 9 divides the number itself.    The only question I really have is whether I'm jumping the gun on my assumption concerning the powers of 10 being $1\mod 9$.  I think this is fair game here but not 100% confident.  Thanks. Several times now I have inadvertently lost the .tex file that generated a PDF file with pdflatex. Given what I know of the internal structure of PDF files, it should be possible to embed a text file containing the original LaTeX file into the PDF file so that it can be extracted later.   I am aware of no technology for doing this, but perhaps you are. Does anybody have something like this? Function return object