C# find process who owns mutex There is a global mutex used by different applications. If one application blocks this mutex then other applications will not be able to start. Given the mutex name how can I find out in C# which process is owning this mutex currently. I need to build a utility to findout this process and kill which is holding this mutex.
C# - how can I get owner's name for a Mutex I have a shared mutex between 2 applications. I want to create an administration console that shows the current owner's name of the mutex.  How can I get the application name that currently owns the Mutex?
How do I prove that $m(TE)=\left|\det(T)\right|m(E)$? Let $m$ be the $n$-dimensional Lebesgue measure and $T$ be a linear operator on $\mathbb{R}^n$. Let $\Sigma$ be the sigma-algebra of Lebesgue measurable sets. How do prove that (1) $\forall E\in\Sigma, T(E)\in \Sigma$ and $m(T(E))=\left|\det(T)\right|m(E)|$? Since the $\sigma$-algebra of Lebesgue measurable sets is strictly larger than the borel algebra, I think it cannot be proven by showing that $T$ is continuous. How do I prove this formally? I have a script from UC Davis and every thing is proven precisely here, except for one lemma which is critical for rest proofs in the script. That is,  Define $\mathbb{B}=\big\{\prod_{i=1}^n [a_i,b_i) : a_i,b_i\in\mathbb{R}\big\}$. Let $T$ be a unitary operator on $\mathbb{R}^n$. Let $A\in \mathbb{B}$ and $\{A_k\}_{1≦k≦m}$ be a finite disjoint sequence such that $\bigcup_{1≦k≦m} A_k \subset T(A)$. Then $\sum_{1≦k≦m} m(A_k) ≦ m(A)$.  It's written in the script: &quot;This result is geometrically obvious, but a formal proof seems to require a fuller discussion of the volume function on elementary geometrical sets, which is included in the theory of valuation in convex geometry. We omit the details&quot; It's okay to me to go through full discussion of volume function if that is precise. If it cannot be proven another easier way(so I can prove it in a day), please recommend me a &quot;convex geometry&quot; text which explains this. I have some files/directories on an external hard drive connected using USB to my Windows XP laptop. I am trying to delete those files but every time I try, I get an error "Cannot delete ....: Access Denied. Make sure disk is not full or write protected and that the file is not currently in use".  I checked that the directory is not is use. However, the permissions are set to read-only. Even if I remove the "read-only" checkbox, in Properties->Attributes, it automatically comes back again. How do I fix this? Is it a virus that is automatically changing it back to read-only?  regards,  JP How to Backup and Restore Android OS without Rooting Uncountable well ordered set in $Z^-$ theory. I want to build an uncountable well-ordered set within the theory $Z^\textbf-$. So, I take $A=\omega$ (exists by infinity axiom) and define $$W:=\{(X,R)\in\mathcal{P}(A)\times\mathcal{P}(A\times A):\langle X,R\rangle\ \text{is a well-ordered set}\}$$  With this I consider the set $T:=W/\cong$ (where $\cong$ is isomorphism relation). Note that $W$ and $T$ are sets by power set axiom. So I define for each equivalence class $[x],[y]\in T$ the order  $$ [x]\leq_T[y]\Leftrightarrow \text{type}(x, R_x)\leq \text{type}(y,R_y) $$  Here, $R_x$ means the order of $x$ that make it belongs to $[x]$.   So, $T$ is well ordered by $\leq_T$ and it is uncountable.  Question: I don't pretty sure if I can build $\leq_ T$ without replacement axiom. Another doubt is, Can I take the $R_x$ without AC? This is an idea I have seen around, but I have not seen a feature request for it, so here it is.  Downvotes that have no comments are frustrating and difficult to manage.  This is a way to help improve that:   Have a downvote initially cost more to cast for the downvoter (5 points for example) When a comment (from the downvoter) on the downvoted question/answer gets an upvote, you get your points back.   All points (ie all 5) could be refunded or just up till the traditional -1 that is in place now (ie 4 points refunded).    This would encourage good comments and downvotes for real reasons.  (Because comments for questions/answers that are bias related will not get the upvotes as readily.)  This could/should be limited to non-subjective tags.  (ie tags where a downvote just because you "don't like it" is not appropriate.) How to make Outlook 2010 minimize when I try to close it? When clicking the X button or ALT+F4, how can I get Outlook to minimze to the tray instead of close?  Several programs have this behavior, and it's annoying that Outlook behaves different... How do I print a #defined constant in GDB? "In" vs. "after" for future talk The class will be over in 10 minutes. The class will be over after 10 minutes.  I know the first is correct but why? Limits of sequences of sets I am starting to learn about the liminf and limsup of a sequence of sets. However, I do not understand the very basics, such as why $\lim\sup A_n=\bigcap_{n\in N}\bigcup_{k&gt;n} A_k,$ and why $\lim\sup A_n=\bigcup_{n\in N}\bigcap_{k&gt;n}A_k.$ Can someone break these definitions down for me?  Also, why is $\lim\inf\subseteq\lim\sup$? Mac Mini (Mid-2011), 16GB SSD, 16GB RAM, El Capitan (v10.11.6)  The Mac ran fine until I upgraded to Sierra. The latest Mac OS conflicted with most of the specialized apps I use every day, So I immediately returned to El Capitan.  Activity monitor shows that two "Installer/Installer.app" items are always running and are they major users of all of my available memory. Consequently, all my others apps become unresponsive.  I run Disk Utility, and the Installer.app show up there as .dmg files; but I cannot erase, delete, or unmount them. None of my 3rd party app can remove the installers.  My Mac Mini, which should be running super-fast (as it used to), now runs dreadfully and disgustingly slow. I a truly upset with Apple for this kind of garbage. To get their help: $$$. How is being able to break into any Linux machine through grub2 secure? How is the ability of a person who gained physical access to your computer to get root with those steps in any way secure?   When grub2 menu opens press  e  to edit the Linux start options Change:   "linux   /vmlinuz-2.6.35-23-generic root=UUID=e7f1e48d-0015-485f-be7d-836217a31312 ro   quiet splash"    to:  "linux   /vmlinuz-2.6.35-23-generic root=UUID=e7f1e48d-0015-485f-be7d-836217a31312 ro init=/bin/bash"  Now you have root access just do:   mount -o remount,rw / passwd user mount -o remount,ro /  sync  reboot the computer and you win.   My question is, how is being able to break into any Linux machine through grub2 secure? I don't understand that fact about Linux, thank you for your answers. + or @ mark after running 'ls -al' In Mac OS X, run 'ls -al' gives me something like this.   drwxrwxrwx+  4 smcho  staff     136 May  5 09:18 Public drwxr-xr-x+  6 smcho  staff     204 Feb  1  2010 Sites drwxrwxrwx   9 smcho  staff     306 Feb  2  2010 backup drwxr-xr-x@ 36 smcho  staff    1224 Sep  4 22:51 bin    What's the + or @ at the end of the first column means? Is this unique to Mac, or common in UNIX?   ADDED  After Michael Mrozek's answer, I ran 'ls -ale' to get the following.   drwx------+ 66 smcho  staff    2244 Aug 30 13:40 Library  0: group:com.apple.sharepoint.group.3 allow search  1: group:everyone deny delete drwxr-xr-x   3 smcho  staff     102 Sep  4 15:01 Mail drwx------+ 13 smcho  staff     442 Aug 28 17:55 Movies  0: group:everyone deny delete drwx------+  6 smcho  staff     204 Jul  9 09:37 Music  0: group:everyone deny delete drwx------+ 11 smcho  staff     374 Aug 28 16:55 Pictures  0: group:everyone deny delete drwxr-xr-x   3 smcho  staff     102 Mar 18 15:43 Projects drwxrwxrwx+  4 smcho  staff     136 May  5 09:18 Public  0: group:everyone deny delete drwxr-xr-x+  6 smcho  staff     204 Feb  1  2010 Sites  0: group:everyone deny delete   What those appended messages mean? Why do I have them for some of the files? I don't remember doing anything particular for them. Graduate school admission with a degree in a different field Can I be admitted to graduate school in a different field from my degree?  Specific cases include:   If I've taken plenty of advanced courses in field X in the process of completing a degree in another field, can I apply to graduate school in X? What if I haven't taken many courses in X, but I have acquired a good grasp of X through self-study or working in a related field? What if I've never studied X, but I have done very well in an unrelated field?  Could I be admitted to graduate school in X on the basis of general intellectual promise, and then make up the missing background after enrollment?   Note that this question is an attempt to provide a comprehensive answer, to avoid the need for a profusion of field-specific questions on this topic (see the associated ). Please feel free to edit the question or answer to improve them. Partial Sums of Geometric Series How to write a unit-test / test class for trigger? How do I write a unit-test / test class for a trigger?  What are my options?   Inline with the trigger?  New Class? Why is the application of probability in  (QM) fundamentally different from its application in other areas? QM applies probability according to the same  as in other areas of physics, engineering, etc.  Why is there a difference?  Naively one would assume one of these possibilities:   It is not the same probability (theory?) It is a matter of interpretation (of the formalism?) Something else?   Many answers (which I am still studying) focus on the fact that the combined probability of two mutually-exclusive events in QM is not equal to the sum of the probabilities of each event (which holds classically by definition). This fact (appears to) makes the formulation of another probability (a quantum one) a necessity.   Yet this again breaks down to assumed independent, if this is not so, the "classic probability" is applicable (as indeed in other areas). This is one of the main points of the question. How do I install Ubuntu alongside a pre-installed Windows with UEFI? I'm a simple minded Bayesian who feels comfortable in the cosy world of Bayes.   However, due to malevolent forces outside my control, I now have to do introductory graduate courses about the exotic and weird world of frequentist statistics. Some of these concepts seem very weird to me, and my teachers are not versed in Bayes, so I thought I'd get some help on the internet from those who understand both.   How would you explain the different concepts in frequentist statistics to a Bayesian who finds frequentism weird and uncomfortable?   For example, some things I already understand:   The maximum likelihood estimator $\text{argmax}_\theta \;p(D|\theta)$ is equal to the maximum posterior estimator $\text{argmax}_\theta \;p(\theta |D)$, if $p(\theta)$ is flat.  (not entirely sure about this one). If a certain estimator $\hat \theta$ is a sufficient statistic for a parameter $\theta$, and $p(\theta)$ is flat, then $p(\hat \theta|\theta)=c_1\cdot p(D|\theta)=c_1\cdot c_2\cdot p(\theta|D)$, i.e. the sampling distribution is equal to the likelihood function, and therefore equal to the posterior of the parameter given a flat prior.    Those are examples of explaining frequentist concepts to someone who understands Bayesian ones.   How would you similarly explain the other central concepts of frequentist statistics in terms a Bayesian can understand?  Specifically, I'm interested in the following questions:   What is the role of Mean Square Error? How does it relate to Bayesian loss functions? How does the criterion of "unbiasedness" relate to Bayesian criteria? I know that a Bayesian will not demand that its estimators are unbiased, but at the same time, a Bayesian would probably agree that an unbiased frequentist estimator is generally more desirable than a biased frequentist one (even though he would consider both to be inferior to the Bayesian estimator). So how does a Bayesian understand unbiasedness? If we have flat priors, do frequentist confidence intervals somehow coincide with Bayesian ones?  What in the name of Laplace is going on with specification tests like the $F$ test? Is this some degenerate special case of a Bayesian update on the distribution over model space?    More generally:  Is there some resource that explains frequentism to Bayesians?  Most of the books run the other way around: they explain Bayesianism to people who are experienced in frequentist statistics.     ps. I have looked, and while there are a lot of questions already about the difference between Bayesian and Frequentism, none explicitly explain Frequentism from the perspective of a Bayesian.   is related, but is not specifically about explaining Frequentist concepts to a Bayesian (more about justifying frequentist thinking in general).  Also, my point is not to bash frequentism. I really do want to understand it better Display the full URL of the home page? Is it possible to display the full, absolute URL of the home page in Drupal 7, like  www.example.com/The-best-example-possible ?  I'd like to display the full URL of the home page, not just the hostname. What is the best way to add a user to the sudoer group?