QueryRunner qr = new QueryRunner(C3P0Util.getDataSource());         qr.update("DELETE FROM course_access " +                 "WHERE user_id = ? " +                 "AND course_id NOT IN (?)", user_id, courseIdList);   String user_id  = "2" String courseIdList = "101,102,104,105,106,108,109" But the results are not correct only the result same as     DELETE FROM course_access WHERE user_id=2 AND course_id NOT IN (101)   The table structure looks like this  id  course_id  user_id 1    101          1 2    102          1 3    105          1 4    104          1 5    106          1 6    108          1 11   110          1 12   101          2 26   101          8 27   102          8 28   105          8 29   104          8 30   106          8 31   108          8 32   110          8 33   113          8 34   115          1 35   107          1 36   115          8 37   109          8 38   109          1 39   107          8 40   116          8 41   116          1 98   102          2 99   103          2 100  104          2 101  105          2 102  106          2 103  107          2 104  108          2 105  109          2
What are the best workarounds for using a SQL IN clause with instances of java.sql.PreparedStatement, which is not supported for multiple values due to SQL injection attack security issues: One ? placeholder represents one value, rather than a list of values.  Consider the following SQL statement:  SELECT my_column FROM my_table where search_column IN (?)   Using preparedStatement.setString( 1, "'A', 'B', 'C'" ); is essentially a non-working attempt at a workaround of the reasons for using ? in the first place.    What workarounds are available?
Product of path connected spaces is path connected Will product of path connected topological spaces be necessarily path connected? Why or why not?  Give me some hints. Thank you. The difference between log and ln $$\dfrac{1}{2}\ln(x+7)-(2 \ln x+3 \ln y)$$  Our professor let's us solve this but i do not understand how $\ln$ works. He says it has same properties with $\log$ but i still don't get it. What's the difference of the two? I have the following diagram:    However, this looks a bit ugly, I would like a version that looks a little bit better. For example, size the last arrow such that the T_\phi is moved to the right.  This is the code which I am using to do this:  \begin{align*}   \xi \colon &amp;\lb \to \mathcal{L}(\hh)\\   &amp;\phi \mapsto T_\phi. \end{align*}   Where \lb and \hh just give the names for those spaces. Does anybody have a suggestion how I would improve the look of this function definition? What is the difference between a synchronized method and synchronized block in Java? Single service account running all SQL Servers Is there any negative performance impact for using the same service account and agent account to run SQL Server and SQL Agent respectively for all SQL server instances running at a small company of say 35 servers? The biggest database is 0.5 GB. any suggestions are welcome. Thank you. Thought Experiment - Poking a stick across a Black Hole's Event Horizon The classical explanation of a black hole says that if you get to close, you reach a point - the event horizon radius - from which you cannot escape even travelling at the speed of light. Then they normally talk about spaghetti.  But here's a thought experiment. What if I have a BH with event horizon radius R such that the gravitational gradient at the event horizon is far too weak for creating pasta. I build a Ring with radius R+x around the BH. Then I lower a pole of length x+d from my ring towards the BH, so that the tip passes beyond the event horizon.  Now what happens when I try to pull the pole back? Why is a different dll produced after a clean build, with no code changes? When I do a clean build my C# project, the produced dll is different then the previously built one (which I saved separately). No code changes were made, just clean and rebuild.   Diff shows some bytes in the DLL have changes -- few near the beginning and few near the end, but I can't figure out what these represent. Does anybody have insights on why this is happening and how to prevent it?   This is using Visual Studio 2005 / WinForms.  Update: Not using automatic version incrementing, or signing the assembly. If it's a timestamp of some sort, how to I prevent VS from writing it?   Update: After looking in Ildasm/diff, it seems like the following items are different:   Two bytes in PE header at the start of the file. &lt;PrivateImplementationDetails&gt;{guid} section  Cryptic part of the string table near the end (wonder why, I did not change the strings) Parts of assembly info at the end of file.   No idea how to eliminate any of these, if at all possible... Playstation Plus for PS4 on multiple Console accounts? How to get hardware specs of Android device? I'm looking for a movie that was set in the US, and all the characters (including the robot) spoke English.  I can't recall the exact plot, but mostly it was about an innocent game robot that shoots small objects for fun and becomes dangerous, because its AI made a wrongful choice about 'winning the game'. The robot starts to arm itself with more dangerous objects (not sure but knives and stuff) and starts to attack people.  It was overall supposed to be fun and adventure movie for kids. Color movie, and probably made in 80~90's.   There is a recurring scene when the robot detects an aggressor, it scans and loudly announces "enemy one, enemy one". The robot was somehow looking similar to Wall-E, and had a saucer-like head part. I've bunch of folders in folder A. I want to move files from all those folders to A.  Or  I want to cut all files from child folders and paste them in parent folder.  How to do that? proof relating to limit definition of e I'm studying the book A Primer for the Mathematics of FinancialEngineering, along with it's solution guide. I've ran into trouble with the solution to question 7 in chapter 1.    The problem is:  Show that $(1+\frac{1}{x})^x &lt; e &lt; (1+\frac{1}{x})^{x+1}$ .   Specifically, I'm having trouble with one step in the solution.    It says that  $$x\ln\left(1+\frac{1}{x}\right)&lt;1&lt;(x+1)\ln\left(1+\frac{1}{x}\right)$$  can be written as   $$\frac{1}{x+1} &lt;\ln\left(1+\frac{1}{x}\right)&lt;\frac{1}{x}, \forall \ge 1.$$  How can the first equality (or is it inequality?) be written as the second? Prove that $ S=\{0\}\cup\left(\bigcup_{n=0}^{\infty} \{\frac{1}{n}\}\right)$ is a compact set in $\mathbb{R}$. Prove that $ S=\{0\}\cup\left(\bigcup_{n=0}^{\infty} \{\frac{1}{n}\}\right)$ is a compact set in $\mathbb{R}$, but $\bigcup_{n=0}^{\infty} \{\frac{1}{n}\}$ is not a compact set.   (Can we use definition of compact set for this problem? ) This is a  about DNS (Domain Name Service).   If my understanding of the DNS system is correct, the .com registry holds a table that maps domains (www.example.com) to DNS servers.   What is the advantage? Why not map directly to an IP address? If the only record that needs to change when I am configuring a DNS server to point to a different IP address, is located at the DNS server, why isn't the process instant? If the only reason for the delay are DNS caches, is it possible to bypass them, so I can see what is happening in real time? Passing multidimensional arrays as function arguments in C In C can I pass a multidimensional array to a function as a single argument when I don't know what the dimensions of the array are going to be?  Besides, my multidimensional array may contain types other than strings. Ideal in a ring of continuous functions I have an excel file with 2 attribute columns, 1-feature info 2-Number of color (RGB) that the current feature should be symbolize. This file file can be joined with the layer using the "feature info" field which is unique (join by attribute table). So i have as attribute the color number attribute for every polygon feature.  How can  i use this this information to symbolize every feature with their attributed color already imported from the excel sheet? Prove: If a sequence converges, then every subsequence converges to the same limit. I need some help understanding this proof:  Prove: If a sequence converges, then every subsequence converges to the same limit.  Proof:  Let $s_{n_k}$ denote a subsequence of $s_n$. Note that $n_k \geq k$ for all $k$. This easy to prove by induction: in fact, $n_1 \geq 1$ and $n_k \geq k$ implies $n_{k+1} &gt; n_k \geq k$ and hence $n_{k+1} \geq k+1$.  Let $\lim s_n = s$ and let $\epsilon &gt; 0$. There exists $N$ so that $n&gt;N$ implies $|s_n - s| &lt; \epsilon$. Now $k &gt; N \implies n_k &gt; N \implies |s_{n_k} - s| &lt; \epsilon$.   Therefore: $\lim_{k \to \infty} s_{n_k} = s$.   What is the intuition that each subsequence will converge to the same limit I do not understand the induction that claims $n_k \geq k$ When I visit  I see this:     The "Congratulations! You've earned (badge)" section has dropped down completely beneath the tabs under it. The "You've earned a new privilege!" section has a gap at the bottom:     Shog9 says in comments how to reproduce this:     Gotta have earned a badge, not dismissed the notification, and be looking at your own profile. Show that  $$\lim \frac{1}{n} \sum_{i=1}^n \frac{1}{i} =0 $$  I've proved that this sequence converges (it is bounded and decreasing). NOW, I need to find a sequence that is bigger than this one and goes to zero. Maybe something using geometric serie of 1/2  Thanks in advance!