How fix sql injection issue for the order by clause How can I resolve SQL injection issue for order by clause in the classic asp application?  Here is the demo code:  strSort=request("sort") strSQL="select * from table1" select case strSort case "case1"    strSQL=strSQL &amp; "order by " &amp; strSort case "case2"    strSQL=strSQL &amp; "order by" &amp; strSort end select
Classic ASP SQL Injection Protection What is a strong way to protect against sql injection for a classic asp app?  FYI I am using it with an access DB.  (I didnt write the app)
Group of even order contains an element of order 2 I am working on the following problem from group theory:     If $G$ is a group of order $2n$, show that the number of elements of $G$ of order $2$ is odd.   That is, for some integer $k$, there are $2k+1$ elements $a$ such that $a \in G,\;\; a*a = e$, where $e$ is the identity element of $G$. I was viewing  question in the Android app. As shown in the below screenshot, while the top shows "4 answers", the bottom button will ask to "View 6 Answers". After checking the question, there are indeed six answers to the aforementioned question.    I am using Android 4.3 with the 0.1.64 version of the app.    EDIT: The changes to the UI made this question obsolete. Why is it so hard to do this in Java? If you want to have any kind of module system you need to be able to load JAR files dynamically. I'm told there's a way of doing it by writing your own ClassLoader, but that's a lot of work for something that should (in my mind at least) be as easy as calling a method with a JAR file as its argument.  Any suggestions for simple code that does this? I am trying to show that $a^{12} \equiv 1 \mod 32760$ for each $a \in \mathbb{Z}$ coprime to $32760$. I have found the prime decomposition $32760 = 2^3 \cdot 3^3 \cdot 5 \cdot 7 \cdot 13$ and determined $\phi(32760)$, where $\phi$ is the Euler's totient function. This gives me that $\phi (32760) = 8640$.   Using Euler's congruence, this gives that $a^{8640} \equiv 1 \mod 32760$, but this is still far from the result I want to show... I also know a consequence of Eulers congruence, which states that $e \equiv e' \mod \phi (n)$ implies that $a^e \equiv a^{e'} \mod n$, but I do not see how to use this...  Any hints would be appreciated.  $\textbf{EDIT:}$ I made a mistake in my primefactorization, it is edited now. Symbols of derivatives Sum of nth roots of unity Question: If $c\neq 1$ is an $n^{th}$ root of unity then, $1+c+...+c^{n-1} = 0$  Attempt: So I have established that I need to show that $$\sum^{n-1}_{k=0} e^{\frac{i2k\pi}{n}}=\frac{1-e^{\frac{ik2\pi}{n}}}{1-e^{\frac{i2\pi}{n}}} =0$$ by use of the sum of geometric series'. My issue is proceeding further to show that this is indeed true. Flagging accepted "answers" Does this need a comma? I'm proofing a story, and at one point, as it is written at the moment, one the characters exclaims:     Prepare to die you fool!   Should there be comma after "die"? Understanding MCMC and the Metropolis-Hastings algorithm Over the past few days I have been trying to understand how Markov Chain Monte Carlo (MCMC) works. In particular I have been trying to understand and implement the Metropolis-Hastings algorithm. So far I think I have an overall understanding of the algorithm but there are a couple of things that are not clear to me yet. I want to use MCMC to fit some models to data. Because of this I will describe my understanding of Metropolis-Hastings algorithm for fitting a straight line $f(x)=ax$ to some observed data $D$:  1) Make an initial guess for $a$. Set this $a$ as our current $a$ ($a_0$). Also add $a$ at the end of the Markov Chain ($C$).  2) Repeat the steps bellow a number of times.  3) Evaluate current likelihood (${\cal L_0}$) given $a_0$ and $D$.  4) Propose a new $a$ ($a_1$) by sampling from a normal distribution with $\mu=a_0$ and $\sigma=stepsize$. For now, $stepsize$ is constant.  5) Evaluate new likelihood (${\cal L_1}$) given $a_1$ and $D$.  6) If ${\cal L_1}$ is bigger than ${\cal L_0}$, accept $a_1$ as the new $a_0$, append it at the end of $C$ and go to step 2.  7) If ${\cal L_1}$ is smaller than ${\cal L_0}$ generate a number ($U$) in range [0,1] from a uniform distribution  8) If $U$ is smaller than the difference between the two likelihoods (${\cal L_1}$ - ${\cal L_0}$), accept $a_1$ as the new $a_0$, append it at the end of $C$ and go to step 2.  9) If $U$ is bigger than the difference between the two likelihoods (${\cal L_1}$ - ${\cal L_0}$), append the $a_0$ at the end of $C$, keep using the same $a_0$, go to step 2.  10) End of Repeat.  11) Remove some elements from the start of $C$ (burn-in phase).  12) Now take the average of the values in $C$. This average is the estimated $a$.  Now I have some questions regarding the above steps:   How do I construct the likelihood function for $f(x)=ax$ but also for any arbitrary function? Is this a correct implementation of Metropolis-Hastings algorithm? How the selection of the random number generation method at Step 7 can change the results? How is this algorithm going to change if I have multiple model parameters? For example, if I had the model $f(x)=ax+b$.   Notes/Credits: The main structure of the algorithm described above is based on the code from an MPIA Python Workshop. What is the first movie to show this hard work message at the very end? What is the first movie to show this hard work message at the very end? Why isn't the center of the galaxy "younger" than the outer parts? I understand that time is relative for all but as I understand it, time flows at a slower rate for objects that are either moving faster or objects that are near larger masses than for those that are slower or further from mass.  So, the illustrative example I always see is that if I were to leave earth and fly around at near light speed for a while or go into orbit around a black hole the time I experience would be substantially shorter than for those I left behind at home on earth and I'd come back to find that I've only aged however long I felt I was gone by my own clock but that on Earth substantially more time would have elapsed.  Following through on this model, the stars in orbit around the black hole at the center of the Milky Way are aging much much slower (relative to us), right?  So does it not follow that the center of the galaxy is some appreciable (I have no idea how to go about putting this in an equation so will avoid guessing at the difference) amount "younger" than the stuff further away from the center?   If this is not true, could someone please explain why not, and if it is true, can someone please point me to where I can calculate the age of the center of the galaxy :-)  And to be clear... what I'm asking is... if there was an atomic clock that appeared at the center of the galaxy when the center was first formed, and we brought it through a worm hole to earth today - how much time would have elapsed on that clock vs. the age we recon the galaxy currently is? (13.2 billion years) About the absence of metal in machinery and buildings of the past How do I show that $x$ is a root of $p(x)$ in $F[x]/\langle p(x)\rangle$? Let $F$ be a field, and $p(x)$ an irreducible polynomial in $F[X]$. Define $K=F[X]/\langle p(x)\rangle$. For every $a\in F$, denote $\bar{a}=\left&lt;p(x)\right&gt;+a$. How do I show that $\bar{x}\in K$ is a root of $p(x)$?. Why do modern mountain bike forks no longer use boots on fork stanchions? Why do modern mountain bike forks no longer use boots on fork stanchions? Older mountain bikes used to have them on the forks, and lefty and headshocks still do. Why have these fallen out of fashion and would putting aftermarket fork boots on your stanchions be productive or not? Stuck in a loop at login prompt after changing shell to zsh Can you nest html forms? Is it possible to nest html forms like this  &lt;form name="mainForm"&gt;   &lt;form name="subForm"&gt;   &lt;/form&gt; &lt;/form&gt;   so that both forms work? My friend is having problems with this, a part of the subForm works, while another part of it does not. PATH variable resets with reboot Windows 7 stuck on CLASSPNP.SYS I'm running Win 7 x86 on a Lenovo Thinkpad Z61m in dual boot mode with Win XP, both OSes are running on separate partitions. I have a faulty battery and if left unplugged my laptop shuts usually down within 10 minutes. Last night, it shut down due to this, but after plugging in AC power and starting back up I'm stuck at the "Starting Windows" screen, I'm unable to boot into safe mode or into recovery mode(XP boots fine).  I believe I had installed some Win 7 updates the same/previous day. From one of the boot options I was able to see that Windows 7 is getting stuck on CLASSPNP.SYS  How can I go about fixing this?  I do have a complete Win 7 Restore CD that I created after setting up my machine, I'm unable to boot into this either.  Please help! A closed form of $\int_0^1\frac{\ln\ln\left({1}/{x}\right)}{x^2-x+1}\mathrm dx$ This integral has been bugging me since yesterday:     $$\int_0^1\frac{\ln\ln\left({1}/{x}\right)}{x^2-x+1}\mathrm dx$$   I've tried substitution $y={1}/{x}$ and $e^y={1}/{x}$, but those didn't help much. Wolfram Alpha gives me result: $-0.67172$. Could anyone here please help me to obtain the closed form of the integral preferably (if possible) with elementary ways (high school methods)? Any help would be greatly appreciated. Thank you. Uses of the 3D Cursor