C ODBC Insert into MSSQL
SQL Server - Best way to get identity of inserted row?
Is there a functional difference between the modern police station and classic police station? How to obtain and use the .bbl file in my tex document for ArXiv submission? lstlisting in two columns I would like to have two listings, side by side.  They have approximately the same length, therefore I don't care about how it's layed out if one part is longer.  I tried  \begin{minipage}{\textwidth} \begin{parcolumns}{2} \colchunk{\begin{lstlisting}[caption=code 1,frame=tlrb]{Name} void code() {  } \end{lstlisting}}  \colchunk{\begin{lstlisting}[caption=code 2,frame=tlrb]{Name} void code() {  } \end{lstlisting}}  \colplacechunks \end{parcolumns} \end{minipage}   while the border of the listings end up in chunks as follows:   Btw I'm using the texlive-package &amp; pdflatex on Ubuntu and the document class is  \documentclass[ a4paper, 10pt, twoside, openright, notitlepage, parskip=half, ]{scrreprt}   Any idea is appreciated. Is it possible to keep publishing under my professional (maiden) name, different from my married legal name? How to Backup and Restore Android OS without Rooting Best technique to create oldschool (fake 3D) racing game? What would be a good approach to develop the render system for an oldschool type racing game that uses a pseudo 3D scenery, like for example Outrun or Lotus Esprit Turbo Challenge? There's an endless scrolling road and scenery graphics are placed like billboard items, etc. I think you get the idea.    Are these developed in a similar way like  or is there a different technique behind it? Does the technique has a specific name I could search for on the web? I need to develop something like that in Flash. Let's take the numbers 0-10.  Their mean is 5, and the individual deviations from 5 are -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5 And so the average (magnitude of) deviation from the mean is $30/11 \approx 2.72$.  However, this is not the standard deviation.  The standard deviation is $\sqrt{10} \approx 3.16$.  The first mean-deviation is a simpler and by far more intuitive definition of the "standard-deviation", so I'm sure it's the first definition statisticians worked with.  However, for some reason they decided to adopt the second definition instead.  What is the reasoning behind that decision? Suggested reading for renormalization (not only in QFT) What papers/books/reviews can you suggest to learn what  "really" is?  Standard QFT textbooks are usually computation-heavy and provide little physical insight in this regard - after my QFT course, I was left with the impression that Renormalization is just a technical, somewhat arbitrary trick (justified by experience) to get rid of divergences. However, the appearance of Renormalization in other fields of physics  approach in statistical physics etc.), where its necessity and effectiveness have, more or less, clear physical meaning, suggests a general concept beyond the mere "shut up and calculate" ad-hoc gadget it is served as in usual QFT courses.   I'm especially interested in texts providing some unifying insight about renormalization in QFT, statistical physics or pure mathematics. Is the function $f(x)=|x|^{1/2}$ Lipschitz continuous? Is the function $f(x)=|x|^{1/2}$ Lipschitz continuous near $0$? If yes, find a constant for some interval containing $0$.   I think the answer is yes since I can find $L=1$ that satisfies Lipschitz continuity criteria in a interval close to $0$, am I right? Copy files excluding x,y,z causing error in shell script Formula for calculating $\sum_{n=0}^{m}nr^n$ I want to know the general formula for $\sum_{n=0}^{m}nr^n$ for some constant r and how it is derived.  For example, when r = 2, the formula is given by: $\sum_{n=0}^{m}n2^n = 2(m2^m - 2^m +1)$ according to   Thanks! Suppose we have $x^2+4x+3=0$  We differentiate both sides to get $2x+4=0$.  So $x=-2$  But $(-2)^2+4(-2)+3=0$   $4-8+3=-1$ is not equal to $0$.  Which tells that we cannot differentiate equalities. But in many proofs, like in integral calculus, differentiating both sides occurs. So, where is the fallacy? Shannon confusion and diffusion concept I read the document(not the whole document) from Shannon where he speaks about the concepts of confusion and diffusion. I read in many places(not in the document but around the internet) that confusion is enforced using substitution. Diffusion is enforced using permutation/transposition. Ciphers must use both of them because either confusion or diffusion alone are not enough. I read that a substitution cipher can apply by itself confusion(only). Permutation/Transposition applies by itself diffusion(only). It's precisely the last case that bothers me: Can a permutation/transposition cipher by itself apply diffusion?  Shannon explains diffusion as a property that spreads statistic properties of text all over the text preventing statistic analysis. It's frequently translated to: an alteration to a plaintext symbol affects many cipher text symbols. Assuming permutation of bits or characters, how can diffusion be achieved by simple permutation? I mean, if you permute bits, there will be no other bits affected. But if you consider a symbol a character and you permute bits, a change in a character will affect many other characters. It's a question of what is a symbol.  I also read versions of this diffusion concept where the point was just changing bits order just to avoid pattern analysis of the text. But, where is the avalanche effect in simple permutation?  So, what is the correct definition and the implications of diffusion?  I hope you understand what is troubling me.  Thank you once more I  as unclear what you're asking after receiving flags on it in the moderator queue.   Once I did that, the text for the question title in the moderator queue changed from:     How to use handler to display images from database without passing ID in querystring?    to     How to use handler to display images from database without passing ID in querystring? [undefined more votes needed]    The text on the main page has stayed consistent with the new 'on hold' verbiage, however.  Here's a screenshot: Is there an official Marvel Cinematic Universe viewing order? I'm planning on re-watching the currently-released 5 Marvel films prior to seeing The Avengers.  Have Marvel released any sort of official viewing order?  Captain America: The First Avenger seems like the hardest one for me to place in order with the rest.  It takes place prior to the other films, but has the greatest number of references to the other films.  So should it be watched first, or last?  The rest of them are relatively clear, as they're chronological in the order they're released, with the possible exception of The Incredible Hulk and Iron Man 2 happening at the same time. Finding value of $S-T$ in $2$ binomial sum. If $\displaystyle S=\sum^{n}_{k=0}(-1)^k\frac{1}{k+m+1}\binom{n}{k}$ and f $\displaystyle T=\sum^{m}_{k=0}(-1)^k\frac{1}{k+n+1}\binom{m}{k}$.Then $S-T$ is   Try:$$S=\sum^{n}_{k=0}(-1)^k\int^{1}_{0}x^{k+n}\binom{n}{k}dx=\int^{1}_{0}x^n\sum^{n}_{k=0}(-x)^k\binom{n}{k}dx$$  Could some help me, thanks Further anonymize deleted accounts by changing the username in close/delete notices When an account is deleted, the username in the user's posts and comments is changed to a generic user&lt;userID&gt;. But the username stays the same on close and delete notifications on posts the user had voted to close / delete1. I think it shouldn't, especially for users who used their real name as their username, if they chose to distance themselves from the site and remove their accounts, it makes sense that they wouldn't really want their name plastered on close and delete notifications.   A perhaps easy way to avoid the actual username remaining visible would be to change it to the generic user&lt;userID&gt; (or anything generic enough, like "anonymous") prior to deletion, and wait a bit for the generic username to propagate all over the site. If I'm not horribly misreading , this was part of the process in the old days.   This could be automated or added as a suggestion to the .  Glaring example can be seen , where the deleted user also posted a comment where their name is properly anonymized:        1 I've seen it on close notifications and self deleted answers. I'm not sure it happens on deleted questions, or deleted answers that aren't self deletions, and I don't have a way to verify it - other than stumbling on them accidentally Strange Recurrence: What is it asymptotic to? So I have the following recurrence relation for the growth rate of an algorithm:  $T(n)$ = time taken by algorithm to solve problem of size n:  $$T(n) = T(n-1) + T(\lceil(n/2)\rceil)$$  Clearly this does not obey any polynomial law but now my question is what does it obey?  I merely want an asymptotic equivalence.  My guess is subexponential since this is faster than polynomial but clearly slower than any exponential form.  What though is the question.... If $g \circ f$ is surjective, show that $f$ does not have to be surjective? Using the Well Ordering Principle to Show that n^3 - n is divisible by 6. I read the following two sources and I think I understand the structure of proofs involving WOP, but I am stuck on the open-ended part where you prove P(n-1) for the  following problem:    Use the well-ordering principle to show that n^3 - n is divisible by 6.    Any help would be greatly appreciated!   Note: After factoring out (n-1)^3 - (n-1) it took the form of n^3 - 3n^2 + 2n and the only difference between that and n^3 - n is "3n^2 - 3n" which I proved was divisible by 6 via induction. Is there a better way to solve this problem?  Edit: , post is useful however I not supposed to use induction for the main part of the proof.