I want to play mobile games on my Mac. How do I do that? I have been seeing a lot of iPhones controlling Macs. Where is the Mac controlling the iPhone?
I would like to take control of my app on an iOS device (mostly an iPhone) from my MacBook Pro or Windows, doesn't matter which one.  I know that it can be accomplished via Veency, and that's exactly what I need - but I do NOT want to jailbreak my iPhone.  Is there a similar legal alternative?  If not - is it something I could develop perhaps, or will I run into some SDK limitations for such a thing?
SFDC DKIM Setup - Production or Sandbox? Cannot figure out this via SFDC documentation. Need someone who have setup this before to advise.  Basically we want to enable DKIM for our SFDC org. In testing Sandbox and production, the from email address is using the same email domain. For example, "test@abc.com" for sandbox and "contact@abc.com" in production.   Question: shall we setup DKIM in both sandbox and production or just need to setup in production since sandbox and production are actually using the same domain "abc.com"? I'm trying some things with my shell. This includes the following command:  kill $$  My expectation was that the shell would log me out and terminate itself. But instead the bash persists without change.   Any idea why?  I ran this command on different environments (archlinux, debian). The behavior was always the same. How does RAID 1 determine which drive should act as the source for a rebuild? Here's my scenario -- both drives were working perfectly fine. I removed one of the drives for a while (building a new PC, didn't think I was going to use RAID anymore but changed my mind). I actually switch the SATA type to AHCI and was operating for about a week on the new system before deciding to re-enable RAID and reinstall the drive I had removed.   It's currently rebuilding, but I'm curious how it knows which one is the source and which one is out-of-date? UTF-8 all the way through What are the practical differences between 256-bit, 192-bit, and 128-bit AES encryption? Can a ring of positive characteristic have infinite number of elements? For curiosity: can a ring of positive characteristic ever have infinite number of distinct elements? (For example, in $\mathbb{Z}/7\mathbb{Z}$, there are really only seven elements.) We know that any field/ring of characterisitc zero must have infinite elements, but I am not sure what happens above. I dont need this vertices and/or edge. What is the best way to get rid of them? I am trying to figure out how to add a Lightning Web Component to a Lightning tab.  I have it on the Home Page, but I would like it to be on its own tab.  I feel like there should be an option to expose it to the Lightning tabs.  When I am in the Tabs section, I don't see my LWC listed. Frequently loaded packages: Differences between pdfLaTeX and XeLaTeX Until now, I have been compiling my LaTeX documents with pdfLaTeX. My standard document preamble includes the "usual suspects" for non-English speakers (, , ) and a bunch of other packages. Assuming I were to convert to XeLaTeX, what modifications of my preamble are advisable? I'm aware that the expansion=true option of the  package is not (yet) available for XeLaTeX, and that  is sort of a default package for OpenType fonts. What other packages (and package options) should be removed and, vice versa, incorporated when switching from pdfLaTeX to XeLaTeX? Can I boil milk unattended (and still keep the pan clean)? Fix Accessibility of the sites on the leagues (and other pull downs that share the same code path) please The  site picker seems to be ordered on-site statistics instead of alphabetically:  This makes it very hard to find Photography, Physics, and Philosophy (for example) since they are nowhere near each other in the list. I’m open to a better solution, but as it stands, this feels a little too user-hostile to assume everyone is only interested in the first 3 to 5 top visible hits in the ordered list.  Scanning pages of unorganized contents is not optimal Keyboard input should filter and not just jump around  It also breaks accessibility when someone wishes to access the list from a keyboard (or a slower input control) as opposed to a mouse and visually. How do I unlock privacy in multiplayer modes mission settings? Appearing on the second page (under the section Digression: Size worries) of the following paper about the Yoneda Lemma:     It says that $a$ $priori$ $[\mathcal C^{op},Set](H_A,X))$ is a class. I don't understand why this is the case.  My understanding is that $a$ $priori$ each member of $[\mathcal C^{op},Set](H_A,X))$ is a class.  So it seems to me that $[\mathcal C^{op},Set](H_A,X))$ could be a collection of proper classes.  I've looked at this , but it hasn't helped me much.  Any help is appreciated -Thanks Vitali-type set with given outer measure My internal storage capacity is running low,  what can I do? Currently, my internal storage is running low on space.    What can I do besides moving applications to the external memory, as to free up more space, but preserve my current applications and avoid uninstalling?  (Some of them won't be moved) Declaring Text Decorations such as Underline, Strikethrough in a Style How do I include text decorations such as Underline, Strikethrough etc in a Style definition:  &lt;Style x:Key="UnderlinedLabel"&gt;      &lt;Setter Property="Control.FontFamily" Value="Trebuchet MS" /&gt;      &lt;Setter Property="Control.FontSize" Value="14" /&gt;      &lt;!-- Next line fails --&gt;      &lt;Setter Property="Control.TextDecorations" Value="Underline" /&gt; &lt;/Style&gt;   I'm familiar with using the following XAML to underline text:  &lt;TextBlock&gt;    &lt;Underline&gt;        Underlined text    &lt;/Underline&gt; &lt;/TextBlock&gt;   However text decoration is just another style, I want to be able to define it declaritively like FontWeight, FontSize etc.  [Update]  I was applying this style to a Label control.  This was my main problem.  It appears you can't underline text in a Label.  Change to a TextBlock (thanks gix) and all is well. Can I print a custom paper on standsard size in word? What exactly happens when a Weeping Angel is quantum locked? This question was prompted by . Notoriously, if you calculate the Schwarzschild coordinate time for anything, matter or light, to reach the event horizon the result is infinite. This implies that the universe ages by an infinite time before someone falling into the black hole reaches the event horizon, so could that person see the universe age by an infinite time?  To be more precise, suppose the observer starts falling from rest at time $t = 0$ and some initial distance $r &gt; r_s$. If we wait for some time $T$ then shine a light ray at the falling observer. Will the light ray always reach the falling observer before they cross the event horizon? If not, what is the formula for the longest time $T$ that we can wait and still be sure the ray will catch the observer? If $T$ is not bounded it implies that observer could indeed see the end of the universe.  I can think of a qualitative argument for an upper limit on $T$, but I'm not sure how sound my argument is. The proper time for the observer to fall to the event horizon is finite - call this $\tau$. The proper time for the light ray to reach the horizon is zero, therefore the light ray will reach the observer before they cross the event horizon only if $T &lt; \tau$. Hence $T$ is bounded and the observer won't see the end of the universe.  I think a more rigorous approach would be to determine the equations of motion (in the Schwarzschild coordinates) for the falling observer and the light ray, and then find the condition for the light to reach the falling observer at some distance $\epsilon$ from the event horizon. Then take the limit as $\epsilon \rightarrow 0$. In principle this seems straightforward, but in practice the algebra rapidly defeated me. Even for a light ray the radial distance:time equation isn't closed form (Wolfram claims it needs the $W$ function) and for the falling observer the calculation is even harder. Is there a easy way to test ubuntu on new notebooks before buying it? Is there an easy way to check a notebook's hardware compatibility with ubuntu before you buy it?  I really don't want to buy a notebook home and find several bugs caused by the hardware.  I know that DELL has some notebooks which are pre-installed ubuntu12.04LTS, i.e. the new xps. But what about other notebooks? isn't there a way to quickly check a notebook's compatibility with ubuntu?  A way I can see is using a LiveCD/ubuntu stick and boot in ubuntu first, then run some tests. But the problem is: how to make these tests in a short time automatically??? and how can I check the hardware compatibility? I know that I can use lshw or hardinfo to get informations, but only having the information is not enough, there are still some possibilities that your hardware has a bug. For instance, Lenovo T410i's wireless driver has a bug which causes extremely low speed internet connection, I googled a lot and recompiled the driver to fix that bug. So this is the kind of situation I'm trying to avoid.  Any help is appreciated.