foreach — iterating over two lists
Multiple TikZ keys with foreach
Web designer's link back to own website (rel="designer" / rel="nofollow") How do I install wine? Would particles behave the same way as a satellite orbiting earth, only far more compact and rapid correlating to the gravitational force of the black hole? Picklist dependent on 2 controlling picklist I have 3 picklist in an object Test1, Test2, Test3  1. Test2 is dependent on Test1  2. Test3 is dependent on both.. Test1 and Test2    I want to have Test3 picklist showing values accordindly. i.e  if U selected Test1 = First and Test2 = SA . I should be able to see "IST,ABC and PQR" in Test 3.   Is this possible??? How to get the current URL within a Django template? java.net.SocketException: Connection reset Representative point of a cluster with L1 distance The representative point of a cluster or cluster center for the k-means algorithm is the component-wise mean of the points in its cluster. The mean is chosen because it helps to minimize the within cluster variances (which is to say that it is minimizing within cluster squared Euclidean distance, since its the same). Now, when I want to use a different distance metric, like L1 (Manhattan distance), I would be minimizing the within cluster absolute deviations (if I choose to). I was looking at what the centers calculation would be like, because the mean won't reduce the new objective function, and I found this on the Matlab documentation of their kmeans function for the distance parameter     cityblock - Sum of absolute differences, i.e., the L1 distance. Each centroid is the component-wise median of the points in that cluster.   Now, how did they come up with the component-wise median? How does a median minimize absolute deviations? What is the T-SQL To grant read and write access to tables in a database in SQL Server? What is the exact SQL to assign db_datareader and db_datawriter roles to a user in SQL Server?  The user name is MYUSER and the database is MYDB. How to Remove URLs from Google Search Engine A friend of mine was trying to explain to me how all infinities are equal. For example, they were saying that there are the same amount of numbers between $0$–$1$ as there are between $0$–$2$.  The way they explained it, you could prove that there are the same amount of numbers by getting a match to each number.  For example, for any number in the range from $0$–$2$, you can find a matching number in the range $0$–$1$ by dividing the number by 2. In every case, the ending number will end up between $0$–$1$. In addition, if you multiplied any number in the range of $0$–$1$ by 2, you will always end up with a number between $0$–$2$ Therefore, there should be the same infinite amount of numbers between  $0$–$1$ as there are between $0$–$2$.  Is this principle accurate? The problem that I had with it was, if in-fact there are the same amount of numbers between 0 and 1 as there are between 0 and 2, why is 2 greater than 1? Net work done on the body when we lift it and put it on the table is zero? How to merge all scene geometry into a single mesh? Is there a specific purpose in terms of efficiency or functionality why the k-means algorithm does not use for example cosine (dis)similarity as a distance metric, but can only use the Euclidean norm? In general, will K-means method comply and be correct when other distances than Euclidean are considered or used?  [Addition by @ttnphns. The question is two-fold. "(Non)Euclidean distance" may concern distance between two data points or distance between a data point and a cluster centre. Both ways have been attempted to address in the answers so far.] Pgfplots: Linewidth when using \ref in custom legend Fortran IF statement with numbers/labels rather than another statement A question about eigenvalues of $5\times5$ matrix $A\in M_5({R})$  and $A^2-4A-I=0$ If $a_1,a_2,a_3,a_4,a_5$ are eigenvalues of $A$ what is value of $$\left(a_1-\dfrac{1}{a_1}\right)+\left(a_2-\dfrac{1}{a_2}\right)+\cdots+\left(a_5-\dfrac{1}{a_5}\right)$$ I tried to work with $A^2-4A-I=0$ but get nothing because $A_{5\times5}$ characteristic polynomial is something like $A^5+k_1A^4+...$ Any hint will be appreciated . Why is using "for...in" for array iteration a bad idea? I've been told not to use for...in with arrays in JavaScript. Why not? Why does my user number show up in the search box when clicking my profile information? Hey all-  I just noticed that if you click on your username on the top bar, when your profile shows up, in the search bar at the top you'll find an explicit search for your user account.  For my meta account, for example, I see user:157031 whenever I click on my profile.  Is this deliberate?  If so, can I suggest removing that text?  It means that I have to manually delete the contents of the search field if I want to do a search from my profile screen.  Thanks! Integral inequality with a strange condition Let $f$ be a continuously differentiable real valued function on $[0,1]$.  It is given that $\displaystyle \int_{\frac{1}{3}}^{\frac{2}{3}}f(x) dx=0$     Find the minimum value of $\dfrac{\int_{0}^{1} (f'(x))^2 dx}{\left( \int_{0}^{1} f(x) dx \right)^2}$   I tried to use Cauchy-Schwarz to show that  $$\frac{\int_{0}^{1} (f'(x))^2 dx}{\left( \int_0^1 f(x) dx \right)^2} \ge \frac{\left( \int_0^1 \bigl| f(x)f'(x) \bigr| dx \right)^2}{ \left( \int_0^1 f(x) dx \right)^2} \ge \frac{ f(1)^2 - f(0)^2}{2 \left( \int_0^1 f^2 (x) dx \right)^2}$$ But I can't proceed from here.  Also, I don't know how to use the condition  $\int_{1/3}^{2/3}f(x) dx=0$ How can I copy files from A to B, only including files that exist in B? I'm on Windows 7 Professional, and this is my scenario :  Folder "Asd" (C:\)              Folder "Asd" (D:\) File 1                          File 1  File 2                          File 3  File 3                          File 4 File 4 File 5   I'd like to select the folder on C:\ (without selecting each single file, of course) and copy it over the same folder on D:. Usually, it will copy all files. But what I'm looking for is to copy only files (from C:) that are contained on folder d:.  So in my case I'd like to replace only File 1, File 3 and File 4.  File 2 and File 5 must be ignored.  Is it possible?