In Java, how do I record the sound output that is going to the speakers?
Capturing speaker output in Java
Capture console exit C# I have a console application that contains quite a lot of threads.  There are threads that monitor certain conditions and terminate the program if they are true.  This termination can happen at any time.  I need an event that can be triggered when the program is closing so that I can cleanup all of the other threads and close all file handles and connections properly.  I'm not sure if there is one already built into the .NET framework, so I'm asking before I write my own.  I was wondering if there was an event along the lines of:  MyConsoleProgram.OnExit += CleanupBeforeExit; Convert UTC date time to local date time By accident, I messed up a configuration file. How do I recover the default version without reinstalling or affecting other things? I am trying to install  under Wine. The program setup continually requests proxy settings. My broker tells me this shouldn't happen, and is a problem on my end. Here is what I have tried to attempt to solve this error:   I have gone into Network settings and proxy is set to none. I have looked in Wine Regedit and proxy_enable is set to 0. I have checked the firewall settings on my modem. I have tried reinstalling wine. I have installed lib32nss-mdns I can log on to my modem in iexplore using the gateway ip but thats it I've set my DNS to 10.0.0.138 to reflect the gateway I've set up a 32 bit Wine prefix   How should I proceed in solving this? Ubuntu 14.04 System Logging I've set up an Ubuntu 14.04 Server (from an Ubuntu 12.04 Server) but today I wanted to look in the auth.log but this file is not used. It seems that ´syslog´ was deleted.  How does Ubuntu 14.04 log? I need this for a server.  Thank you. Got less output with print0 option on find? I have read the man page and other references, but I am still confused by the behavior of find with -print0 option.  -print0      This primary always evaluates to true.  It prints the pathname of              the current file to standard output, followed by an ASCII NUL              character (character code 0).   First command:  $ find /some/path/ -iname "*intro*jpeg" -o -iname "*intro*jpg" 2&gt; /dev/null /some/path//asdf199Intro-5kqlw.jpeg /some/path/199intro-2jjaj.JPEG /some/path/199intro-3.jpg /some/path/wuer199intro-4.JPG /some/path/xbzf199INTRO-1.jpg   Second command:  $ find /some/path/ -iname "*intro*jpeg" -o -iname "*intro*jpg" 2&gt; /dev/null -print0 /some/path/136intro-3.jpg/some/path/wuer136intro-4.JPG/some/path/xbzf136INTRO-1.jpg   I can see that the the filenames from the second command are null character separated, but why do I get 3 output as opposed to 5 above? How can I search the bash history and rerun a command? Can I search history in bash and run the result? Here is a fun integral I am trying to evaluate:  $$\int_{0}^{\infty}\frac{\sin^{2n+1}(x)}{x} \ dx=\frac{\pi \binom{2n}{n}}{2^{2n+1}}.$$  I thought about integrating by parts $2n$ times and then using the binomial theorem for $\sin(x)$, that is, using $\dfrac{e^{ix}-e^{-ix}}{2i}$ form in the binomial series.  But, I am having a rough time getting it set up correctly. Then, again, there is probably a better approach.   $$\frac{1}{(2n)!}\int_{0}^{\infty}\frac{1}{(2i)^{2n}}\sum_{k=0}^{n}(-1)^{2n+1-k}\binom{2n}{k}\frac{d^{2n}}{dx^{2n}}(e^{i(2k-2n-1)x})\frac{dx}{x^{1-2n}}$$  or something like that. I doubt if that is anywhere close, but is my initial idea of using the binomial series for sin valid or is there a better way?.  Thanks everyone. This  shows the dual cone of $K = \{(x,t) \mid \| \boldsymbol{x} \|_1 \le t \}$ is $K^{*} = \{(x,t) \mid  \| \boldsymbol{x} \|_{\infty} \le t\}$. Is it right? How is it proved? "The package lists or status file could not be parsed or opened" Everytime I sudo apt-get update it always not complete and will say in the end  E: Read error - read (5: Input/output error) E: The package lists or status file could not be parsed or opened.   Same goes, when I try to install something and do sudo apt-get install &lt;some app&gt;  What should I do ? I admit, that my drive has bad sectors, could that be the reason? Is there anything else I can do? Does RSA work for any message M? I decided to read the original RSA paper A Method for Obtaining Digital Signatures and Public-Key Cryptosystem because of a question I had about RSA (which is not the question I'm about to ask, but may be a question on here at some time) and came across something I had never seen before in any textbook description of RSA (Note: this comes from the beginning of ).  for any integer (message) $M$ which is relatively prime to $n$, $M^{\phi(n)} \equiv 1\pmod{n}$  The part I don't recall ever hearing in class, or coming across in a text book, or seeing in any description of RSA I've ever read is that $M$ and $n$ must be relatively prime. So, I decided to play around with a toy example of RSA to see what would happen. I use $p=13$, $q=31$, $e=7$ and $M=2p=26$ (for completeness: $d=103$, $\phi(n)=360$, $n=403$). I observed the following using my toy instance of RSA: $M^e\equiv M\pmod{n}$, $M^e\equiv 0\pmod{p}$ and $M^e\equiv M\pmod{q}$. Do these equivalences hold for all $M,p,q$ when $M$ and $n$ are not relatively prime? How would I prove this? What is the real-world effect of this? "Unable to connect to Upstart" error when installing git-all I am using 15.04.   So I'm working with git and I installed the standard version. I set up the ssh keys and was able to clone one of my repositories to the correct folder. Everything was working great and then I decided it was a good idea to install more packages. I ran sudo apt-get install git-all. I'm looking at error codes now having to deal with upstart.  start: Unable to connect to Upstart: Failed to connect to socket /com/ubuntu/upstart: Connection refused No apport report written because the error message indicates its a followup error from a previous failure. dpkg: error processing package runit (--configure):  subprocess installed post-installation script returned error exit status 1 dpkg: dependency problems prevent configuration of git-daemon-run:  git-daemon-run depends on runit; however:   Package runit is not configured yet.  dpkg: error processing package git-daemon-run (--configure):  dependency problems - leaving unconfigured Errors were encountered while processing:  runit  git-daemon-run E: Sub-process /usr/bin/dpkg returned an error code (1)   This is what happens when I even update/upgrade my system. At this point all I'm looking to do is be able to install software and update my current software. Is there any way I can potentially reverse this issue or at least correct it?   Edit: Thankfully this issue was solved only a day or two after it happened. The accepted answer worked perfectly and took care of my issue Do I need a Turkey transit visa for a layover? Join matrix based on conditions java.lang.IllegalArgumentException: Invalid  in servlet mapping &lt;servlet&gt;     &lt;servlet-name&gt;myservlet&lt;/servlet-name&gt;     &lt;servlet-class&gt;workflow.WDispatcher&lt;/servlet-class&gt;     &lt;load-on-startup&gt;2&lt;/load-on-startup&gt; &lt;/servlet&gt;  &lt;servlet-mapping&gt;     &lt;servlet-name&gt;myservlet&lt;/servlet-name&gt;     &lt;url-pattern&gt;*NEXTEVENT*&lt;/url-pattern&gt; &lt;/servlet-mapping&gt;   Above is the snippet from Tomcat's web.xml. The URL pattern *NEXTEVENT* on start up throws     java.lang.IllegalArgumentException: Invalid &lt;url-pattern> in servlet mapping   It will be greatly appreciated if someone can hint at the error. ­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­ How can I achieve the correct garden tap orientation when threading it in? I'm installing an external tap using a wall plate like this one:    And a tap like this one:    This might be a stupid question, but if I screw the tap into the wall plate it will end up at a certain angle. I can install the wall plate with that angle and the tap will end up with the correct orientation (i.e. pointing down). But what if I want to put another tap in later that has its thread cut slightly differently? How do I prevent it ending up upside-down or whatever? Are all the threads cut exactly the same in these taps?  This seems like a stupid design. Consider the factorization into irreducibles of $6$ in $\mathbb{Z}[\sqrt{-5}]$. We have $6=2 \times 3$ and  $6=(1+\sqrt{-5}) \times (1-\sqrt{-5})$, i.e. $2$ distinct factorizations. And,  $$6^2=3 \times 3\times2\times2$$ $$=(1+\sqrt{-5}) \times (1-\sqrt{-5}) \times (1+\sqrt{-5}) \times (1-\sqrt{-5})$$ $$=(1+\sqrt{-5}) \times (1-\sqrt{-5})\times3\times2.$$ More generally, $6^n$ will have $n+1$ distinct factorizations into irreducibles in $\mathbb{Z}[\sqrt{-5}]$ by a simple combinatorial argument. But, can we construct a ring in which there exists an element that has an infinite number of distinct factorizations into irreducibles? To make life harder, can we construct an extension of $\mathbb{Z}$ in which this happens? I have been thinking about this for a while and have managed to find no foothold.. Any help is appreciated. For users running Java application or applets in the browser, what difference does it make running either Sun Java or OpenJDK?  EDIT  Oracle will be , and basing the proprietary implementation on OpenJDK. Can we expect similar experience in running Java apps using either OpenJDK or Oracle JDK? Do you really answer "How do you do?" with "How do you do?" Simple enough question: is there some shell command (or GUI method) I can use that, given the path to a file on my system, tells me what package put it there? Assuming the file did in fact come from a package, that is.  Bonus question: what if it's a file that isn't installed on my system? Is there, say, a website that will let me look up a file and see what packages, if any, provide it?