Change the name of service before Installation
Is it possible to install multiple instances of the same delphi service application?
Fonts larger than \Huge? How can I make text that is larger than the size of the output of {\Huge ...}?   I would like to be able to make text arbitrarily large (even if that is done by some suboptimal scaling routine). This is a  about Apache's mod_rewrite.   Changing a request URL or redirecting users to a different URL than the one they originally requested is done using mod_rewrite. This includes such things as:   Changing HTTP to HTTPS (or the other way around) Changing a request to a page which no longer exist to a new replacement. Modifying a URL format (such as ?id=3433 to /id/3433 ) Presenting a different page based on the browser, based on the referrer, based on anything possible under the moon and sun. Anything you want to mess around with URL   Everything You Ever Wanted to Know about Mod_Rewrite Rules but Were Afraid to Ask!  How can I become an expert at writing mod_rewrite rules?   What is the fundamental format and structure of mod_rewrite rules? What form/flavor of regular expressions do I need to have a solid grasp of? What are the most common mistakes/pitfalls when writing rewrite rules? What is a good method for testing and verifying mod_rewrite rules? Are there SEO or performance implications of mod_rewrite rules I should be aware of? Are there common situations where mod_rewrite might seem like the right tool for the job but isn't? What are some common examples?   A place to test your rules  The  web site is a great place to play around with your rules and test them. It even shows the debug output so you can see what matched and what did not. Neural network - meaning of weights Prove: $\gcd(a,b) = \gcd(a, b + at)$. I know that $\gcd(a,b)$ divides $a$ and $b$, and must also then divide $(a)(t)$ ($t$ being some integer).  This makes sense to me, but how do I prove it?  It seems that the addition of $(a)(t)$ is a continuation of the linear combination of $\gcd(a,b) = av + bu$ for some $v$, $u$ being elements of $\mathbb{Z}$.    Any help? How long was Luke Skywalker's training with Yoda? Cloning an SD card onto a larger SD card I'm using Ubuntu 12.04. I have an old 4GB SD card, and have just bought a new 16GB SD card. I would like to copy everything from my old 4GB SD card onto the new 16GB SD card. I was afraid that the usual copy-and-paste trick would miss out something, so I wanted to clone the old 4GB SD card onto the 16GB SD card. I used the dd command in a shell, following instructions in .  This worked with one small caveat. The new SD card now appeared to be 4GB. I later found out this is because the primary partition on the 16GB SD card has now shrunk to 4GB. I have solved this problem, and I think I understand it. However, my question now is, how do I clone my old 4GB SD card onto my new 16GB SD card without making the primary partition on the 16GB SD card shrink to 4GB? How can I distribute a native executable for a Python program? How caret calculates R Squared From the training output below, it looks like R squared is not calculated by the traditional formula 1 - SSE/SST, since lower error rate has lower R squared. So how is it calculated?    colsample_bytree  min_child_weight  RMSE      Rsquared    0.4               3                 16963.39  0.8799191   0.4               5                 16813.24  0.8788395 Why is $\gcd(x^4+1,x^2-1) = 1$ but I get $2$? [unit normalization of gcds] I need to find the gcd of two polynomials: $f(x) = x^4+1$ and $g(x)=x^2-1$ using the Euclidean algorithm.  Wolfram shows that the gcd is equal to $1$, but for some reason I don't get the same answer.   First I divided $f(x)$ by $g(x)$ and got that the remainder is $2$. Then, I divided $g(x)$ by the remainder, $2$, and got a remainder of zero, hence concluding that the gcd is $2$.   What am I doing wrong? This was an assertion made in our textbook but I have no idea how to show that either statement is true.  Also would like to show that that $\mathbb{Q}(\sqrt{2})$ is strictly larger than $\mathbb{Q}$, which was the second part of the assertion. Some English words only differ in their vowels: crisscross, dillydally, riffraff, etc. Is there a name for them? How to prove that you have significant ties with family in your home country? Title of short story: God granting immortality to others to find a way to kill himself Convert UTC/GMT time to local time Detecting pattern at the end of a line with grep How do you take profit from stock trading while keeping capital invested? we are currently experiencing some issues with the ambiguity feature of apa for biblatex/biber (we use biber) in TexLive 2012.  What would be correct with the ambiguity feature:  Doe J., Peters M., Kramer N., Conan B. (2012) Doe J., Mayer M., Smith N., Walker J. (2012)  Citations in text (subsequent ones) - AS IS AND CORRECT Doe, Peters et al (2012) Doe, Mayer et al (2012)   But in case of different years, it shouldn't actually do this ...  Doe J., Peters M., Kramer N., Conan B. (2012) Doe J., Mayer M., Smith N., Walker J. (2009)  Citations in text (subsequent ones) - AS IS: Doe, Peters et al (2012) Doe, Mayer et al (2009)  Citations in text (subsequent ones) - HOW IT SHOULD BE: Doe et al (2012) Doe et al (2009)   Can anyone help here?  Thank you! While studying the Fibonacci sequence I encountered this problem in the handout, and I can not understand how to do it.     Show that if the Fibonacci sequence has a term divisible by a natural number $m$, then there are infinitely many such terms. ToolStrip sometimes not responding to a mouse click Should questions having lots of downvotes be downvoted further? Is down-voting an already heavily down-voted/closed question kind of like kicking a dead horse? Is this bad practice?