execute an app when a button from another app is clicked
How To: Execute command line in C#, get STD OUT results
A place where you could sit and see something like this (with a fall if you step further):    (Not looking for a technical term, just a common one). Can I accept an already rejected edit (to my own post)? Today,  to one of . Before I got to see the notification, the edit already was rejected by other people (three rejections, one approval).  But the edit was actually a good one (like most edit proposals to my post I get to see) – a correction of syntax errors, so I would have definitively approved it.  (The suggested edit didn't change the main point of the answer, which was about the API to use, but it made the code example of my answer actually usable. I didn't compile it when writing my answer, it was late at the evening.)  So I did edit my post to include the proposed change, so the proposal is not fully lost. But the proposer only got the negative feedback from the rejection, and none of the reputation bonus an accepted edit gives.  My suggestion: Could there be added a way a post author can accept edits which were already rejected by other users?  Also, is there some way I can contact the rejectors and teach them not to reject good edits? Can infinitely many primes lie over a prime? Proving that two vector spaces of equal dimension are isomorphic Given the following problem     Let $U$ and $V$ be finite dimensional vector spaces, such that $\dim(U) = \dim(V)$. Prove that $U$ and $V$ are isomorphic.   I was just wondering if somebody could critique and validate my proof.  Proof  Two vector spaces $U$ and $V$ are isomorphic if and only if there exists a bijection $\phi: U \to V$. That is, an invertible linear map between the two. Let $\dim(U) = \dim(V) = n$ and let $\left\{u_1, \dots, u_n\right\}$ and $\left\{v_1, \dots, v_n\right\}$ be bases for $U$ and $V$, respectively. It follows that any vector $u \in U$ can be written as  $$ u = c_1u_1 + \cdots + c_nu_n $$  We define $\phi: U \to V$ as  $$ \phi(c_1u_1 + \cdots + c_nu_n) = c_1v_1 + \cdots + c_nv_n $$  Observe that $\phi$ is invertible. That is, given a vector  $$ v = d_1v_1 + \cdots + d_nv_n $$  in $V$, we define $\phi^{-1}: V \to U$ as  $$ \phi^{-1}(d_1v_1 + \cdots + d_nv_n) = d_1u_1 + \cdots + d_nu_n $$  Since there exists a bijection between $U$ and $V$, they are isomorphic. Well, this question has been puzzling me for kinda long time, many people believe that orbiting astronauts feel weightless because they are "beyond the pull of Earth's gravity"...How far from the Earth would a spacecraft have to travel to be truly beyond the Earth's gravitational influence? If a spacecraft were really unaffected by Earth's gravity would it remain n orbit? If so, what is the real reason for weightlessness in orbit? When given $p = 5, q = 11, N = 55$ and $e = 17$, I'm trying to compute the RSA private key $d$.  I can calculate $\varphi(N) = 40$, but my lecturer then says to use the extended Euclidean algorithm to compute $d$. That's where I get stuck.    Here's my work so far:  First I use the Euclid algorithm to calculate:  40 = 2(17) + 6  17 = 2(6) + 5 6 = 1(5) + 1 = gcd   So I know the GCD is 1. Applying the 'extended' section of the algorithm:  6 = 40-2(17) 5 = 17-2(6) 1 = 6-1(5) 1 = 6-1(17-2(6)) 3(6) = 1 (17) 3(40 - 2(17)) - 1(17) 3(40) - 3(17)   I know the answer is $33$, but I have no idea how to get there using the extended Euclidean algorithm. I can't figure out why I'm getting $3(40) - 3(17)$ when I know the answer should contain $33$. Could someone help me prove that given a finite measure space $(X, \mathcal{M}, \sigma)$ and a measurable function $f:X\to\mathbb{R}$ in $L^\infty$ and some $L^q$, $\displaystyle\lim_{p\to\infty}\|f\|_p=\|f\|_\infty$?    I don't know where to start. Property of $\{0^n, 1^n, \ldots\}$ The differences between adjacent squares are the odd numbers:  0 1 4 9 16 25 …  1 3 5 7  9 …  The differences between adjacent odd numbers are 2 = 2!  I found that this truth is more general: If the differences between adjacent powers of $n$ are written out, and the differences of those differences etc, the $(n+1)$th sequence is {n!, n!, …}  Is this a well-known theorem? Does it have an easy proof? How can I install Minecraft? I have tried many tutorials but none of them are clear enough. I have also tried installing it using Wine but it won't update and Wine goes gray and stops working.  Does anybody know an easy way to install Minecraft though the Java file without using Wine? What is an example of "this" assignment in C#? Does anybody have useful example of this assignment inside a C# method? I have been asked for it once during job interview, and I am still interested in answer myself. Alternate position of x tick labels Does encrypting my home folder make my computer more secure? Do I have to enter my password more if my home folder is encrypted? What else should I know about encrypting my home folder? How to specify ec2 instance types for different services? After I have specified a default EC2 instance type for my Juju charm, how do I override that for one of the services?  For instance, the  deploys wordpress and mysql, and I can set the default-instance-type in my environments.yaml so both services are m1.small  But how do I configure it so that (only) the mysql service gets deployed on an instance type better suited to a database, like m2.xlarge ? Difference between standard error and standard deviation I'm struggling to understand the difference between the standard error and the standard deviation. How are they different and why do you need to measure the standard error? What type of lens will auto-focus on Nikon bodies without a focus motor? Comparing and contrasting, p-values, significance levels and type I error I was wondering if anybody could give a concise rundown as to the definitions and uses of p-values, significance level and type I error.  I understand that p-values are defined as "the probability of obtaining a test statistic at least as extreme as the one we actually observed", while a significance level is just an arbitrary cutoff value to gauge if the p-value is significant or not. Type I error is the error of rejected a null hypothesis that was true. However, I am unsure regarding the difference between significance level and the type I error, are they not the same concept?  For example, assume a very simple experiment where I flip a coin 1000 times and count the number of times it lands on 'heads'. My null hypothesis, H0, is that heads = 500 (unbiased coin). I then set my significance level at alpha = 0.05.  I flip the coin 1000 times and then I calculate the p-value, if the p-value is > 0.05 then I fail to reject the null hypothesis and if the p-value is &lt; 0.05 then I reject the null hypothesis.  Now if I did this experiment repeatedly, each time calculating the p-value and either rejecting or failing to reject the null hypothesis and keeping a count of how many I rejected/failed to reject, then I would end up rejecting 5% of null hypotheses which were in actuality true, is that correct? This is the definition of type I error. Therefore, the significance level in Fisher significance testing is essentially the type I error from Neyman-Pearson hypothesis testing if you performed repeated experiments.  Now as for p-values, if I had gotten a p-value of 0.06 from my last experiment and I did multiple experiments and counted all the ones that I got a p-value from 0 to 0.06, then would I also not have a 6% chance of rejecting a true null hypothesis? Problem printing LaTeX from lua in lualatex I am having difficulty printing LaTeX from a lua function in a LaTeX document processed with lualatex (version 0.70.2). I have a sample that works (if I remove all newlines from the code) and a case that fails. I don't know why these get different results. Here is the sample that fails:  \documentclass{report} \usepackage{luacode} \begin{document}  \begin{luacode*} tex.sprint([[ \begin{tabular}{ | l | l | p{4.in} | }  \hline  {\bf File} &amp; {\bf Cards} &amp; {\bf Summary} \\ \hline  \end{tabular} ]]) \end{luacode*}   \end{document}   I get an error saying:  ! Misplaced \noalign. \hline -&gt;\noalign               {\ifnum 0=`}\fi \hrule \@height \arrayrulewidth \futurelet... l.22 \end{luacode*}   When I put all of the LaTeX code printed from lua on one line the code works fine:  \documentclass{report} \usepackage{luacode} \begin{document}  \begin{luacode*} tex.sprint([[ \begin{tabular}{ | l | l | p{4.in} | } \hline {\bf File} &amp;{\bf Cards} &amp; {\bf Summary} \\ \hline \end{tabular} ]]) \end{luacode*}   \end{document}   So I have a few question.  First, why does the first example shown above fail? It seems like something I am not aware of is being inserted into the generated LaTeX.  Also is there a way for me to see the actual LaTeX that is generated and processed so that I can debug issues like this better?  Is there a way to tell the lualatex to log the actual LaTeX it tries to process?  Any other suggestions for how to debug a problem like this? Using mask as a garbage matte to hide an object I'm trying to use a mask to hide a part of a render layer, so that when the render layer is shown over a movie, some parts in the movie will appear to be in front of the render layer.  For example, assume I want to add a box to this image, so that it would look like it's behind the person:    I created the following simple object:    If I render the object, it looks great - the object is solid, everything else is transparent (I didn't use any 'sky'):     Now I create a mask to describe the standing person (or at least the part that would otherwise be covered by the box):    What I want now is to create a "hole" in the rendered box, so that when I use Alpha-over, the box look as if it's behind the person, but I can't find an easy way to do that. My first guess was to use 'Set alpha' to apply the mask (inverted) as an alpha for the rendered layer, but this doesn't look good:    The mask did create a "hole" where it should, but now all the other pixels are not transparent. How can I "retain" the transparent pixels while setting more pixels to be transparent based on the mask (use it as a matte)?  Note: I can do this with (I'm ashamed to say) some math work on the alpha channel, but it just doesn't seem right:    Thanks, and sorry for the [oh so] long question. Assigning CRS to shapefile when it doesn't have one, in R? I think that by using readOGR to import a shapefile renders worthless to put proj4string to the script since if any coords are available in the shapefile, it will be transported through the readOGR.   Therefore, proj4string is expedient only if we use another import function for example readShapeSpatial (for polygons, lines or points) or by using readOGR, but in the case that the shapefile does not contain the coordinates/projection:  When checking if the shapefile has projection information and if it has not, should I add proj4string although I have put readOGR? I have been trying to install a fresh copy of Ubuntu 14.04 (64 bit version) on my desktop PC from a USB memory stick, but I'm experiencing a problem.  Each time I attempt an install I received an  "[Errno 5] Input/output error", followed by the following message before the installer exits:  "The installer encountered an error copying files to the hard disk: [Errno 5] Input/output error This is often due to a faulty CD/DVD disk or drive, or a faulty hard disk. It may help to clean the CD/DVD, to burn the CD/DVD at a lower speed, to clean the CD/DVD drive lens (cleaning kits are often available from electronics suppliers), to check whether the hard disk is old and in need of replacement, or to move the system to a cooler environment."  In order to attempt to remedy this I have so far tried installing Ubuntu to two different hard disks, one of which is brand new, and each time I have received the same error "Errno 5" message. I have also tried installing from 3 different USB sticks using torrent and Ubuntu site iso images burned using both Unetbootin and Startup Disk Creator.  Again, these measures have proved fruitless.  The installation process varies depending of the iso I use, with the Ubuntu download page iso exiting at an earlier stage compared to the torrented iso.  The later torrent iso returns an error and exits when I am prompted for my name, computer's ID and password.  I've never experienced anything like this when installing previous versions of Ubuntu.  I'm absolutely stumped!  Does anyone have any more ideas?