I am trying to find a way to get spell checking to play a sound when an error is detected. I don’t mean when an error is “corrected”, but just when one is detected.  A long time ago, you would add a spell checker to your Mac via a third party application. I remember one which made a sound every time it detected an error, which meant that you didn’t have to look at the screen to notice errors.  I don’t think the feature is built into OS X's spelling error correction (why not?). Is there possibly a third part app that will do this simple task?  The following questions hint at the problem:   &amp;   but (a) they are more concerned with auto-correct; (b) they are a few years old; and (c) they don’t have a real solution.
There are many times when I curse the autocorrection mechanism for changing what I typed, but overall, much of the corrections are welcome so I don't really want to disable it. I do want to have it do it's work but alert me when it makes each change so I don't have to proofread everything or focus with perfect attention to the screen to see the momentary red and/or blue underlining that alerts me to the machine override.  I would love a way to turn on an audible beep (customizable of course) so that I also get a warning each time my typing gets corrected (and only when autocorrection occurs).
External program from our Java program How can I write a program in Java that will execute another program? Also, the input of that program should be given from our program and the output of that program should be written into a file.  This is my small set of code to get its output:  Process p = Runtime.getRuntime().exec("C:\\j2sdk1.4.0\bin\\helloworld.java"); BufferedReader input =         new BufferedReader(new InputStreamReader(p.getInputStream())); while ((line = input.readLine()) != null)    System.out.println(line);  input.close();   This was my set of code but this throws an IOException. Is there a way to enter the default keyring password using the command line?   For instance:  You have a remote setup of Ubuntu 10.10 thats set to auto login. You don't want to remove  the keyring password.  All right the system boots up and logs in automatically, then asks for the keyring password now at this point you can create ssh connections but you can't remote desktop.   What can you do to enter the keyring password at this point?  Also, to better clarify, this is from a remote connection using the command line. Given an alphabet of size $n$, how many strings of length $c$ contain every single letter of the alphabet at least once?  I first attempted to use a recurrence relation to work it out:  $$ T(c) = \left\{ \begin{array}{cr} 0 &amp;\mbox{ if $c&lt;n$} \\ n! &amp;\mbox{ if $c = n$} \\ T(c-1) \cdot n \cdot c &amp;\mbox{ if $c &gt; n$} \end{array} \right. $$  As there's no strings that contain every letter if c &lt; n, and if c = n then it's just all permutations. When c > n you can take any string of size (c-1) that contains all letters (of which there are $T(c-1)$ to choose from), you choose which letter to add (of which there are $n$ choices) and there are $c$ different positions to put it. However, this gives out results that are larger than $n^c$ (the total number of strings), so it can't be right, and I realised it was because you could count some strings multiple times, as you can make them taking different inserting steps.   Then I thought about being simpler: you choose n positions in the string, put each letter of the alphabet in one of those positions, then let the rest of the string be anything:  $$ {c\choose{n}} \cdot n! \cdot n^{c-n} $$  But again this counts strings multiple times.  I've also considered using multinomial coefficients, but as we don't know how many times each letter appears in the string it seems unlikely they would be much help. I've also tried several other methods, some complicated and some simple, but none of them seem to work.  How would you go about working out a formula for this? I'm sure there's something simple that I'm missing. Wasted screen space due to multiple horizontal bars at the top when an application is open in GNOME desktop Land ratio vs mana curve When choosing cards for a deck, one of the most important things to consider is the number of land you put in. The biggest issue is mana curve, of course. What shortcuts are best for determining the proper amount of land with a given mana curve? How to set the fully qualified hostname on CentOS 7.0? How do I set the fully qualified hostname on CentOS 7.0?  I have seen a few posts online for example using:  $ sudo hostnamectl set-hostname nodename.domainname   However, running domainname returns nothing:  $ domainname (none)   Also:  $ hostname nodename.domainname   However,  $ hostname -f hostname: Name or service not known $ hostname -d hostname: Name or service not known   Some debug output:  $ cat /etc/hostname nodename.domainname  $ grep ^hosts /etc/nsswitch.conf hosts:      files dns Changing my iTunes account details Proof that $\bigcap_{a\in A} \bigg(\, \bigcup_{b\in B} F_{a,b} \, \bigg) = \bigcup_{f\in ^AB} \bigg(\, \bigcap_{a \in A} F_{a,f(a)}\,\bigg) $ I found an interesting exercise of other amazing book (Jech's) that I'm not totally sure about how to do it.   Prove the following form of the distributive law:   $$\bigcap_{a\in A} \bigg(\, \bigcup_{b\in B} F_{a,b} \, \bigg) = \bigcup_{f\in ^AB} \bigg(\, \bigcap_{a \in A} F_{a,f(a)}\,\bigg) $$  Assuming that $F_{a,b_1} \cap F_{a,b_2} = \emptyset $ for each $a\in A$ and $b_1,b_2\in B$ and $b_1\not=b_2$.  First of all, I'm not completely sure about what $ F_{a,b}$ really means. I suppose that is  the range of a family with a domain $A \times B$.    And second, I cannot figure out how to do the converse (assuming that the first part it is correct, I used as normal in this kind of proof element chasing)  Proof:  ($\Rightarrow$) ...  ($\Leftarrow$) Suppose that $z\in \bigcup_{f\in ^AB} \big(\, \bigcap_{a \in A} F_{a,f(a)}\,\big)$; then there is $f\in \,^AB$ such that $z\in  \bigcap_{a \in A} F_{a,f(a)}\, $. Let $a \in A$ be arbitrary.   Claim 1 $\, \bigcap_{a \in A} F_{a,f(a)}\subseteq F_{a,f(a)} \subseteq \bigcup_{b\in B} F_{a,b}$.  Proof of the Claim 1:   For the first inclusion: Suppose $z\in\bigcap_{a \in A} F_{a,f(a)}$; then for each $a\in A$ we have that $z\in F_{a,f(a)}$. Then $\bigcap_{a \in A} F_{a,f(a)}\subseteq F_{a,f(a)}$.  For the second inclusion: Now suppose $z\in F_{a,f(a)}$. Clearly $f(a)\in B$ because $f\in ^AB$. Then there is some $b\in B$ such that  $z\in F_{a,b}$ and hence that $z\in \bigcup_{b\in B} F_{a,b}$. $\square$  Since $a$ was arbitrary it follows that $z\in \bigcup_{b\in B} F_{a,b}$ (by claim 1) for each $a\in A$ and hence  that $z\in \bigcap_{a\in A} \big(\, \bigcup_{b\in B} F_{a,b} \, \big)$ as desired.  I really, really would very much appreciate some help with that. Thanks in advance as usual. Gendry was born in the Crownlands and should therefore be referred to as Gendry Waters. However, he refers to himself as Gendry Rivers.   Did showrunners forget or is Gendry ignorant of the customs? One thing that made me curious while watching a football game on TV was the numbers that appear on the ground. For instance, there's a "1st &amp; 10" beside one team, but there was a "3rd &amp; 6" a few minutes prior (and I think it was beside the other team). What do these numbers mean? For which $n≥2$ does there exist $\sigma\in A_n$ with $|\sigma| &gt; n$? I have a proof that I'd like to be verified. My proof that there exists $\sigma\in A_n$ with $|\sigma| &gt; n$ if and only if $n\geq 8$: For $n&lt;8$, one can manually verify for each $n$ that there is no $\sigma\in A_n$ with order greater than $n$. Suppose $n\geq 8$. Case 1: $n$ is even and $3\not\mid n$. Then the permutation $(1,2,3)(4,\dots,n)$ is even and has order $\operatorname{lcm}(3,n-3)=3n-9\geq n+16-9\geq n + 7$. Case 2: $n$ is even and $3\mid n$. Then $n\geq 12$, so $n-2\geq 8$ is even and is not divisible by 3. Applying Case 1, we see that $(1,2,3)(4,\dots,n-2)\in A_n$ has order at least $n+5$. Case 3: $n$ is odd. Then apply one of the previous two cases with $n-1$ to get an even permutation with order at least $n+4$. $\blacksquare$ Is my proof correct? It doesn't seem very elegant. Is there some slicker proof? What is the sign of the work done on the system and by the system? What is the sign of the  done on the system and by the system?  My chemistry book says when work is done on the system, it is positive. When work is done by the system, it is negative.  My physics book says the opposite. It says that when work is done on the system, it is negative. When work is done by the system, it is positive.  Why do they differ? Is there a deb package to install Firefox ESR? I would like to have  on my system but I would like to install it via apt-get. Is there a special package to install this?  Download link would be: Elementary OS PPA gives “The repository does not have a Release file.” error I am running Ubuntu Bionic Beaver. I was trying to download the pantheon desktop environment on Ubuntu and it didn't work so I gave up. Now when I try to download themes or other things from the terminal I get an error code mentioning Elementary OS even though what I am downloading doesn't have to do with Elementary or pantheon. Here is what the terminal says:   jacob@jacob-MacBookPro:~$ sudo apt-add-repository ppa:tista/adapta -y …                                           E: The repository 'http://ppa.launchpad.net/elementary-os/testing/ubuntu bionic Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. E: The repository 'http://ppa.launchpad.net/mpstark/elementary-tweaks-daily/ubuntu bionic Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. When to use unsigned values over signed ones? I have a BA degree in Biochemistry.  I worked at a research lab for 5 yrs before I quit my job to be a stay at home.  Now I want to change my career and get into the field of QA.  I don't have much knowledge as to what the best way is to get into this field.  I cant afford to take online courses, so I want to self teach it to me.  Any suggestions and help would be greatly appreciated. For a login application, how would i go about checking the sha1 value of a password? Dell Inspiron 3551 Unresponsive Touchpad I just got my laptop in the mail and I installed Ubuntu 14.04 LTS. It all went smooth until it booted up and I noticed my touch pad doesn’t work at all. It works perfectly on Windows and when I use a wireless mouse it works as well.  Here's my xinput:  ⎡ Virtual core pointer                          id=2    [master pointer  (3)]   ⎜   ↳ Virtual core XTEST pointer                    id=4    [slave  pointer  (2)]   ⎜   ↳ 2.4GHz RF  KEYBOARD  AND  MOUSE               id=11   [slave  pointer  (2)]   ⎜   ↳ DLL06AB:00 06CB:78F1                          id=13   [slave  pointer  (2)]   ⎜   ↳ SynPS/2 Synaptics TouchPad                    id=15   [slave  pointer  (2)]   ⎣ Virtual core keyboard                         id=3    [master keyboard (2)]       ↳ Virtual core XTEST keyboard                   id=5    [slave  keyboard (3)]       ↳ Power Button                                  id=6    [slave  keyboard (3)]       ↳ Video Bus                                     id=7    [slave  keyboard (3)]       ↳ Power Button                                  id=8    [slave  keyboard (3)]       ↳ Sleep Button                                  id=9    [slave  keyboard (3)]       ↳ 2.4GHz RF  KEYBOARD  AND  MOUSE               id=10   [slave  keyboard (3)]       ↳ Integrated_Webcam_HD                          id=12   [slave  keyboard (3)]       ↳ AT Translated Set 2 keyboard                  id=14   [slave  keyboard (3)]       ↳ Dell WMI hotkeys                              id=16   [slave  keyboard (3)]     I would love to have my track pad working and I've done some googling and browsing of this site and nothing I've tried has worked. Any input would be great. Let me know if there’s any other information that can help remedy this. I'm pretty new to Linux. Thank you very much.  Edit: I've updated the kernel to 3.19 and checked my Additional Drivers which had nothing for me. Neither of which worked. Why are SO participants so unfriendly? When the good ship Serenity is traveling in deep space, the crew experiences what looks like an Earth-normal (or Earth That Was-normal) level of gravity. Is it ever explained how the ship is able to generate artificial gravity? The ship doesn't spin, so  is out.  is a possibility, but I think the gravity in the ship pulls in a direction that is perpendicular to the direction the ship is usually traveling in, not opposite, like this method would require.   So: how does she pull it off?   Extra credit: how does she pull it off in the episode ? Serenity's engine is totally dead, to the extent where not even life support systems are online. Yet Mal still has to valiantly haul himself around on the floor to replace the compression coil, so whatever creates the artificial gravity on Serenity is clearly still going. How?