How to programmatically mute other applications sound using Win32 API
Controlling Volume Mixer
Prevent execution of parent event handler In a Discord call on the desktop app and my voice cannot be heard by others. When I use Discord  through browser I can be heard. Any help appreciated. “While” loop without “do”; “if” statement without “then” I have a similar question as this :     How can I get rid of the do in a for loop and the then in an if   statement when typesetting algorithms using the algorithm and   algorithmicx packages?   but I want the same thing for algorithm2e package.  A minimal compilable example:  \documentclass[10pt]{article} \usepackage[linesnumbered,ruled]{algorithm2e} \SetKwRepeat{Do}{do}{while} \SetKw{KwGoTo}{go to}  \begin{document}  \begin{algorithm} \DontPrintSemicolon \KwIn{$A,B$} \KwOut{$C$} \While{$B &gt; 0$} {      $C = C+1$;      $B = B-1$;     \uIf{$C &gt; A$}        {            \textbf{break}\;        } } \caption{ABC} \end{algorithm}  \end{document} I generally defrost meat on the kitchen counter. A friend of mine suggested that this was dangerous and suggested that I defrost meat in the refrigerator. I am no biologist but it seems to me that as long as the meat doesn't get warm defrosting it on the counter should be safe.  Generally, I remove the frozen items from the freezer and place them on a plate on the counter in the packaging they were frozen in. When they are mostly / completely thawed I place the meat in the refrigerator.  Am I wrong and should I be defrosting in the refrigerator? I am trying to prove the following: Let $R=\mathbb{Z}[i]$, $a, b \in \mathbb{Z}, ab \neq 0$. Show that $a+bi$ is an irreducible element in $R$ if and only if $a^2 + b^2 ∈ \mathbb{Z}$ is prime. Since $R$ is a Euclidean domain, irreducible elements are prime. I think this is relevant, but am stuck on where to go from here. .NET create scheduled task on server fails with E_ACCESSDENIED I have an ASP.NET website (in C#) that takes in user data and then attempts to create a windows scheduled task.  Of course, this works great on the DEV machine, but fails to run on the server.  I'm trying to figure out what permission(s) are required on the ASPNET user (or anonymous web user) to create tasks.  The error is:  Access is denied. (Exception from HRESULT: 0x80070005 (E_ACCESSDENIED))  Stacktrace:      at MyScheduler.NewWorkItem(String TaskName, Guid&amp; rclsid, Guid&amp; riid, Object&amp; obj)      at MyScheduler.CreateTask(String name)   I've done some searching, and the suggested resolution is to use the web.config 'impersonate' flag to force the application to run as a user with sufficient permissions, as opposed to the ASPNET account which may not have those permissions.  Example:  &lt;system.web&gt;     &lt;identity impersonate="true" /&gt; &lt;/system.web&gt;    Unfortunately, this does not seem to resolve the issue.  From the documentation I read, this should run as the anonymous web user, but it seems that user does not have enough permissions.  I altered the setting to specify a specific domain user that happens to be an administrator on the machine.  Example:  &lt;system.web&gt;     &lt;identity impersonate="true" userName="WindowsDomain\YourUserName" password="YourPassword" /&gt; &lt;/system.web&gt;    Doing this allowed the application to successfully create the Windows Scheduled Task.  So, obviously, with the correct set of Windows 2003 permissions I can get the app to perform as it does in the development environment.  However, I'm not about to place the network or machine administrator account's user credentials in plain text on a Web.config file.  Does anybody happen to know what permissions exactly need to be set in order to get the ASPNET account to behave as desired?  EDIT:  The Win32 API is being used to create scheduled tasks. VSE isn't multi-threading Whenever I render a video using the blender video editor only one core is ever used at any time. I have an 8 core CPU(FX-9590) yet regardless of whether blender is set to auto detect or a fixed 8 threads only one core ever sits at 100% at any given time. The rest of the cores sit and really low usage as if blender is completely ignoring them. I'm running blender 2.77a on Linux. I'm using Theora as the codec with an ogg container and Vorbis audio. How do I get blender to use all my cores? Why does increasing the number of features reduce performance? How can one run multiple versions of PHP 5.x on a development LAMP server? Is it touch(1) from coreutils-8.4-37.el6.x86_64 or my brain which is broken?  $ touch abc $ LANG=C stat abc   File: `abc'   Size: 0               Blocks: 0          IO Block: 4096   regular empty file Device: fd04h/64772d    Inode: 10485773    Links: 1 Access: (0664/-rw-rw-r--)  Uid: (3060399/ nodakai)   Gid: (  418/   quant) Access: 2016-10-14 18:42:06.189751847 +0800 Modify: 2016-10-14 18:42:06.189751847 +0800 Change: 2016-10-14 18:42:06.189751847 +0800 $ touch -a abc $ LANG=C stat abc   File: `abc'   Size: 0               Blocks: 0          IO Block: 4096   regular empty file Device: fd04h/64772d    Inode: 10485773    Links: 1 Access: (0664/-rw-rw-r--)  Uid: (3060399/ nodakai)   Gid: (  418/   quant) Access: 2016-10-14 18:42:17.374235446 +0800 Modify: 2016-10-14 18:42:06.189751847 +0800 Change: 2016-10-14 18:42:17.374235446 +0800 $ touch --help | grep 'access time'   -a                     change only the access time   As you see, it was not only atime but also ctime which was updated by touch -a !?!?  The filesystem is ext4 over LVM if that makes any differences. Why is it possible to get significant F statistic (p<.001) but non-significant regressor t-tests? Split Java String by New Line I'm trying to split text in a JTextArea using a regex to split the String by \n However, this does not work and I also tried by \r\n|\r|n and many other combination of regexes. Code:  public void insertUpdate(DocumentEvent e) {     String split[], docStr = null;     Document textAreaDoc = (Document)e.getDocument();      try {         docStr = textAreaDoc.getText(textAreaDoc.getStartPosition().getOffset(), textAreaDoc.getEndPosition().getOffset());     } catch (BadLocationException e1) {         // TODO Auto-generated catch block         e1.printStackTrace();     }      split = docStr.split("\\n"); } How can I let people join my minecraft server from diffrent versions? How do people at Hogwarts usually tell the time? Cardinality of order types in $\mathbb{N}$ Let be the next equivalence relation on $B= \{R \subseteq \mathbb{N}\times\mathbb{N} \ | \ R \ is \ a \ well-order \ on \  \mathbb{N}\}$ : $$"R \equiv R' \leftrightarrow \ (\mathbb{N},R) \cong (\mathbb{N},R') \ are \ well-ordering \ sets \  isomorphic" $$  Which is the cardinality of $B/\equiv$?  Firstly, we can notice that each well-ordering set is isomorphic to an ordinal $\alpha \ $such that $\alpha &lt; \aleph_{1}$, and so it is enough to count how many ordinals are isomorphic to a subset of $\mathbb{N}$. For example, if we consider $A$ the set of the even numbers and $B$ the set of odd numbers with the usual order relation, $A \oplus B$ is isomorphic to $\omega + \omega$. Another example could be: if we consider the order of $\mathbb{N}$ that we use in Sharkowski Theorem, that order is isomorphic to $ \omega^{2} + \omega$. Working with prime numbers we could build also $\omega^{n} \ \forall n \in \mathbb{N}$, and so $\omega^{\omega}$ and maybe something bigger. However, we know that each countable ordinal is isomorphic to a subset of $\mathbb{Q}$, but I bet that the same result is not true for $\mathbb{N}$ because it is "too small".  What can I do? Prove that $\mathbb{|Q| = |Q\times Q|}$ What is the purpose of the /etc/shadow file in Linux Operating system?  Also, is it same for SUSE clients? There is one shadow cache file is maintained what is purpose of that? Reading output of a command into an array in Bash How could Fred and George have figured the exact password to the Marauder's map? Questions on "All Horse are the Same Color" Proof by Complete Induction I'm bugged by the following that's summarized on p. 109 of .     False theorem: All horses are the same color.      Proof by induction:      $\fbox{$P(n)$ is the statement: In every set of horses of size $n$, all $n$ horses are the same color.}$   $\fbox{Base Case or $P(1)$:}$ One horse is the same color as itself. This is true by inspection.   $\fbox{Induction Step:}$ Assume $P(k)$ for some $k \geq 1$.   $\fbox{Proof of $P(k + 1) :$}$   Since $\{H_1, H_2, ... , H_n\}$ is a set of $n$ horses, the induction hypothesis applies to this set. Thus, all the horses in this set are the same color.   Since $\{H_2, H_3, ... , H_{n+1}\}$ is also a set of $n$ horses, the induction step likewise holds for this set. Thus, all the horses in this set are the same color too.         Therefore, all $n +1$ horses in $\{H_1, H_2, H_3, ... , H_n , H_{n+1}\}$ are the same color. QED.   The issue the instructor was trying to point out is clearly valid. For the case $n = 1$, there is only ${H_1}$. So this case says nothing about possible overlapping elements of each set of $(n + 1)$, for instance $H_2$ in the above proof.    But it was proposed in the class discussion that this was the only problem. Had you been able to prove $P(2)$ true, then a proof of the above format would have been fine.    My interpretation is that yes, you could prove all horses are the same color, if you can prove that any set of two horses will be the same color. But this format would not work.  Why not? The problem I see is that the above proof is for the existence of at least one particular pair of sets of horses of sizes $n$ and $n + 1$, such that in each set, all horses are the same color.  Particularly when the set of size $n$ is a subset of the set of size $n + 1$.  In order to prove the induction step, don't you need to prove that sets of sizes $n$ and $n + 1$, do not necessarily contain the same, overlapping elements?  You could prove that any horse can be added to a set of 2 horses.  Take the last two, and they must be the same color, and so on.  Wwhatever color the first two happen to be, all other horses must thus be the same color.    Am I misinterpreting the example, or am I making a logical error? Thanks in advance.