I know this question has been posted ad-nauseam; however, I still cannot manage to get a working solution.  OS being used is Debian 7 Wheezy.  vHosts file (/etc/apache2/sites-available/default):  &lt;VirtualHost *:80&gt;   ServerName www.example.com   ServerAlias *.example.com   RedirectPermanent / https://www.example.com/ &lt;/VirtualHost&gt;  &lt;VirtualHost *:443&gt;         ServerAdmin domains@example.com         SSLEngine on         ServerName www.example.com         SSLCertificateFile /etc/apache2/ssl/ev-cert.crt         SSLCertificateKeyFile /etc/apache2/ssl/private.key         SSLCertificateChainFile /etc/apache2/ssl/intermediate.crt         SSLProtocol all         SSLCipherSuite HIGH:MEDIUM         DocumentRoot /var/www      &lt;Directory /var/www/&gt;             Options -Indexes FollowSymLinks MultiViews             AllowOverride All             Order allow,deny             allow from all     &lt;/Directory&gt;          ErrorLog /var/log/apache2/error.log         LogLevel info         CustomLog /var/log/apache2/access.log combined &lt;/VirtualHost&gt;   EDIT (Added description of the problem):  Upon restarting apache2, I get no errors; however, when I visit  it goes no where and get a server connection error (cannot connect to server), though when I visit  I get through just fine.  There are no logs in apache to indicate a failure.
This is a  about Connection Refused    We see a lot of questions to the effect      When I try to connect to a system I get a message      Connection refused      Why is this ?
Does the series $\sum_{n=1}^{\infty}|x|^\sqrt n$ converge pointwise? If it then what would be the sum? Flag pop-up hidden beneath answer box (and it's still transparent!) order of a sylow p-subgroup Are there any known uncountable transfinite increasing sequences of real numbers? The real numbers are uncountable, so assuming the axiom of choice there is at least transfinite sequence of real numbers $r_0, r_1, r_2, ..., r_\omega, r_{\omega + 1}, ..., $ up to (and possibly including) $r_{\omega_1}$ that contains an uncountable number of terms. However, it's not guaranteed that $r_0 &lt; r_1 &lt; ..., r_\omega &lt; ...$  Is there a known transfinite sequence of real numbers that is monotonically increasing and which contains uncountably many real numbers?  Thanks! Do separate autofocus motors exist for entry level Nikon DSLRs? javascript not working, working on fiddle but not on my webserver Automatically growing lists as in MATLAB? Over the years I have seen a few people transport a dog on a bike.  What options have you seen?   Please include a photo in your answer if possible. I have the following problem: I correctly obtain a numbered bibliography at the end but along the text the cite_key appear instead of a number. How to fix this problem?   \documentclass[11pt]{book}  \usepackage[]{biblatex} \begin{document} %some text  ... \cite{ABKM2015}... %some text  \begin{thebibliography}{99} \bibitem{ABKM2015} Arroja, F. and Bartolo, N. and Karmakar P. and Matarrese, S. (2015). \newblock The Two Faces of Mimetic Horndeski Gravity             \newblock {\em ArXiV}, 1506.08575 (2015). \end{thebibliography} \end{document}   After compiling I get ... [ABKM2015] ... while I want for example  [1]. Extruding a circular shape from a non-circular object I need to extrude a circular shape from a surface that's basically just a grid of quads. What's the best practice to do this without screwing up the topology too much?  I basically want to have a circular face I can extrude, in order to have a cylinder like protuberance on the object, something like this: Disallow downvoting other answers if I've posted my own Possible Duplicates:        As Dan Dyer mentioned in his comment on , there is a conflict of interest when you have posted your own answer and are allowed to downvote other answers.  Despite the vote editing window being drastically reduced, the fundamental problem remains: I can downvote the other answers permanently and still benefit - my answer gets upvoted ONCE and wham, I have just made up the rep loss for my 10 other downvotes. The vote editing window fixes part of the problem, but there is a more complete fix that has the extra benefit of not preventing legitimate vote changes: to disallow downvotes on competing answers when you have posted one yourself.  The temptation to wrongfully downvote competing answers is huge. The rep loss is tiny in comparison. It has to be in order for people to continue to legitimately downvote.  Details:   If I have previously voted and then post my own answers, delete my downvotes. Continue to allow me to remove the upvotes - I think this is fully legitimate. If I delete my answer it's probably best to continue to deny downvotes (perhaps even including the question), but I don't have a strong opinion either way. Automatically login and lock I want to configure Windows 7 to login automatically after the computer is switched on. That's not because I'm lazy and don't like typing passwords. That's because I want programs that are configured to run on startup run automatically.  But I don't want everyone to see my desktop, so I want my computer to remain locked. When I'm ready to work, I just type my password and don't have to wait until all startup programs run. do I only get a limited number of at-will powers? I use the scroll function with my mouse and it works fine. But either in script, or in terminal sections of Spyder, I can't use the touchpad for scrolling. I do not experience any problems with my touchpad in other programs like Word, Chrome etc. Is there any option for this in Spyder, specific for touchpad?  I am using Lenovo Legion Y520, Windows 10. $e^A$, where $A= \begin{bmatrix} 0 & \omega \\ -\omega& 0 \end{bmatrix}$ $\omega&gt;0$, Then Compute the matrix:          $e^A$,     where $A= \begin{bmatrix} 0 &amp; \omega \\ -\omega&amp; 0 \end{bmatrix}$      I have never seen any problem like this. So Please help me solving this. Any link for theoretical reading is welcome. What's the main difference between int.Parse() and Convert.ToInt32 Example of non-flat modules Let $R = \mathbb{C}[t]$ be a ring of polynomials in variable $t$ with coefficients in the field of complex numbers $\mathbb{C}$ and let $$N = R[x]/(tx-t).$$  I claim that $N$ is not a flat $R$- module. If we consider the exact sequence $$0 \rightarrow(t) \rightarrow R$$ such that the ideal $(t)$ is viewed as an $R$-module.   We know that the above sequence exact iff the map $(t) \rightarrow R$ is injective. Let us assume that N is flat then this means that $N \otimes  (t) \rightarrow N \otimes R$ has to be injective. How do I go from here?   Thanks. Solving multiple congruences by CRT = Chinese Remainder Theorem How do I get the solution given by CRT to match another solution, e.g. the least positive? For example say I have X = 1234. I choose mi as 5, 7, 11, 13. This satisfies the simple requirements of . More precisely given in my example k = n = 4, and the product of any k - 1 is smaller then X how come simply computing the remainder of each won't give equations that solve to X = 1234. In the case of the example, x = 4 mod 5 x = 2 mod 7 x = 2 mod 11 x = 12 mod 13  Which resolves to  (won't CRT produce the smallest?) Any hints?  Below is the solution linked to on &quot;Math Celebrity&quot; (cached to avoid link rot). How to replace subscript symbols vi shows as vim When I type vi into a terminal it shows the following display:    Note that it says vim not vi, I'm sure I haven't downloaded vim yet and that this is actually vi not vim: for example the arrow keys print ABCD instead of moving.