Best Azure service for large no of SQL Server databases
Best Azure Service for Large no of SQLServer Databases
Process substitution and pipe Reading order for Dragonlance? Is there any difference between Present Perfect and Present Perfect Continuous? I have seen in American Sniper, Dead-7 and Carrie that when someone is killed, they are laying on the ground with blood leaking out of their back or somewhere else on the body.  The puddle continuously grows with few signs of slowing down. This is obviously not CGI because it is a real liquid (may not be real blood as that would spark an emergency in real life).   I have seen in American Sniper that when the protagonist kills yet another enemy, they are filmed hitting the ground and blood starts pooling around their body.  In Carrie: In the dance room where Carrie sets her powers loose and kills a lot of teenagers in the process, there are a few that hit the ground with blood pooling under their bodies. Sometimes they would be on their side with blood coming out.  In Dead 7: Kimono and the other six killed lots of zombies. Some of the six were killed in the process as well before they came to Apocalypta to kill her. They were filmed hitting the ground dead with blood pooling around them.  I am not sure how they film this as they are wearing thin shirts for these scenes, and not only that, but the characters also have blood (obviously fake) only just dripping out of the side of their mouths (an indicator they have a ruptured and wounded stomach or lung (in this case the blood would be pink and frothy).  What is the film technique that allows this to happen? Prove that , any primitive root $r$ of $p^n$ is also a primitive root of $p$ Is it necessary to close StringIO in ruby? How do I get an animated gif to work in WPF? What control type should I use - Image, MediaElement, etc.? What program can be used to package software into one executable? I need to package an application into a single executable file (so that I don't have to install it, so that it will be portable).  Does anybody know what I can use to make a program portable? I'm new to Linux and Ubuntu. People keep using ~/filename in their answers to my questions. What does ~/ mean? I am doing some challenges. This is one them. I am trying to brute-force 4 digit pin with the password to get my desired answer. After connecting to the port It prompts me to enter the password then space then 4 digit pin. I tried to brute-force the pin using the script:  #!/bin/bash   nc localhost 30002   sleep 2    for i in {0000..9999};       if [[ $(echo 'UoMYTrfrBFHyQXmg6gzctqAwOmw1IohZ $i' &lt;/dev/stdin) = ^Wrong*]];                         then          continue       echo '[+] Pincode Cracked! Pincode = $i'       fi   done  but it seems that this doesn't input the pass and pin to stdin, before i tried doing something like this -&gt; if [[ $(echo 'UoMYTrfrBFHyQXmg6gzctqAwOmw1IohZ $i') = ^Wrong* ]]; What am I doing wrong here? UPDATE: Okay, so after researching around. I wrote this: for i in {0000..9999} do     if [ (echo &quot;UoMYTrfrBFHyQXmg6gzctqAwOmw1IohZ $i&quot; | nc localhost 30002 | grep -o Wrong) == &quot;Wrong&quot; ]    then       sleep 0.1       continue    fi    echo &quot;- - - - - - - - - - - - - - - - - - - - - - - - [$i]&quot; done  This might even work but as you can see it opens new connections in the loop which makes it really slow and exhaust the system. Same question listed twice in reputation list This might not be a bug but I see the same question list twice in my reputation display, I know it is grouping things by a six hour difference, but is this really expected?    The first list says 2 events but shows all 5, similarly the second list says 3 events and shows all five. When to use icons vs. icons with text vs. just text links? SOAP or REST for Web Services? Bypass GPG signature checks only for a single repository Built-in text editor in Terminal Is there a built-in text editor in the terminal on Lion?  (Like, for example, nano on Linux.) On the paragraph explaining arithmetic expansion,  uncovers 2 different ways of evaluating an expression, the first one uses $(( EXPRESSION )) and the second one uses $[ EXPRESSION ]. The two ways seem pretty similar as the only difference I have found is:     $[ EXPRESSION ] will only calculate the result of EXPRESSION, and do no tests:   Yet, I am intrigued because the same document recommends using $[ EXPRESSION ] rather than $(( EXPRESSION )).     Wherever possible, Bash users should try to use the syntax with square brackets:   Why would you want that if less tests are being done? What can cause a question to be bumped? What can cause a question to be "bumped" to the first page in the Active tab of a Stack Exchange site? (Changing the "Last Active" date.)  . How can I start learning about political philosophy? I'm interested in learning about political philosophy. What are the best ways to start? Are there any websites for beginners? Are there any books such as the "For Dummies" series? Are there any audio or video introductions to familiarize myself with the terminology? Show that if $|f(z)| \leq M |z|^n$ then $f$ is a polynomial max degree n I can't prove this statement, can anybody show me how to prove it?    $$f:\mathbb{C}\rightarrow \mathbb{C} \in \mathcal{O}(\mathbb{C}), \exists n\in \mathbb{N}, R &gt;0 , M&gt;0 : |f(z)| \le M|z|^{n} \ \ \forall |z|&gt;R \Rightarrow \deg(f)\le n $$  To show is that if there exists such an $M$, that then $f$ is a polynomial of max degree $n$. I started like this:   $$f(z) = \sum_{n=0}^{\infty} a_n (z-z_0)^n$$ So if I put this into the inequality: $$|f(z)| = \left| \sum_{n=0}^{\infty} a_n (z-z_0)^n \right| \le M |z|^n .$$ This is from Fraleigh's First Course in Abstract Algebra (page 82, Theorem 8.16) and I keep having hard time understanding its proof. I understand only until they mention the map $\lambda_x (g) = xg$. Can someone explain this proof step by step? Thank you so much! Here is the proof:  Let $G$ be a group. We show that $G$ is isomorphic to a subgroup of $S_G$. Define a one-to-one function $\phi: G \to S_G$ such that $\phi(xy)=\phi(x) \phi(y)$ for all $x,y \in G$. For $x \in G$, let $\lambda_x: G \to G$ be defined by $\lambda_x (g) = xg$ for all $g \in G$. The equation $\lambda_x (x^{-1} c) = x(x^{-1} c) = c$ for all $c \in G$ shows that $\lambda_x$ maps $G$ onto $G$. If $\lambda_x (a) = \lambda_x (b)$, then $xa=xb$ so $a=b$ by cancellation. Thus $\lambda_x$ is also one to one, and is a permutation of $G$. We now define $\phi: G \to S_G$ by defining $\phi(x) = \lambda_x$ for all $x \in G$. To show that $\phi$ is one to one, suppose that $\phi(x) = \phi(y)$. Then $\lambda_x = \lambda_y$ as functions mapping $G$ into $G$. In particular $\lambda_x (e) = \lambda_y (e)$, so $xe=ye$ and $x=y$. Thus $\phi$ is one to one. It only remains to show that $\phi(xy) = \phi(x) \phi(y)$, that is, that $\phi_{xy} = \lambda_x \lambda_y$. Now for any $g \in G$, we have $\lambda_{xy} (g) = (xy)g$. Permutation multiplication is function composition, so $(\lambda_x \lambda_y)(g) = \lambda_x (\lambda_y (g)) = \lambda_x (yg) = x(yg)$. Thus by associativity, $\lambda_{xy} = \lambda_x \lambda_y$.