I am new to htaccess. so when i want to do a url redirect using htacces, i always get a redirect loop, and don't know how to fix it. I have been searching on the web but coundn't find a solution for me. please help on this   what i want to do is to redirect all the subpages under root(/*) to index.html under root (/index.html)  i need to redirect  www.mydomain.com.au/* to  www.mydomain.com.au/index.html  here is my code   RewriteEngine On RewriteBase /  RewriteRule ^(.*)$ http://www.mydomain.com.au/index.html [R=301,L]   please help on how to fix this thanks very much !!
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.
heat weighting: failed to find solution for one or more bones tail -f equivalent for MySQL logging database Spam iCloud Calendar Invitations How can I get a DisplayLink USB monitor work under Ubuntu? I have a DisplayLink-based external USB monitor, which has both power and data over USB, and seems to work perfectly under Windows 7, but only can display a text console under Ubuntu 10.10, and that I can only use when I am actually switched to it. So the only Use I can have so far is to have some text-based monitoring or console that I can watch while working on the graphic display.   I know there are some development done for DisplayLink, but I never could get it to actually run properly.   Yes, I tried the detailed setup described in other , but they did not work, and instead crashed my X that I had to restore.   Merci :-) Sort Order on Close Vote Queue The Close-Vote queue is large and growing. I searched for definitive information on how that queue is sorted for reviewers, and the nearest I could find is that it is randomized - but that post was some years old.  Would it be possible to sort on order of votes already received? That is, all questions with 4 votes to close are surfaced first (in random order) to reviewers? Questions with 3 votes would come up before ones with 2, etc. In that manner a given question gets out of 'will it close?' limbo faster.   This feature request would, in my opinion, be supportable if the majority of reviewer votes were going to single-vote questions. I cannot (I think) actually find these numbers. If this is the case, the majority of the work is going to an ever-increasing queue, and proportionally fewer votes are being resolved.  Note there are other distributions that could help get in this direction without being a strict ordering, like weighting the chance a given question is surfaced to a reviewer by the number of votes. However, for discussion purposes I thought I'd keep it simple.  Usual apology if this has actually been addressed. Search is sad-making. What is the best way to initialize a private, static data member in C++?  I tried this in my header file, but it gives me weird linker errors:  class foo {     private:         static int i; };  int foo::i = 0;   I'm guessing this is because I can't initialize a private member from outside the class.  So what's the best way to do this? I have changed the coordinates of couple points in the attribute table and I want to update the location. I have found the script that is working in field calculator.   Does anybody know how to write it using a Python script in ArcGIS Desktop (not in Field Calculator)?  def XYsetVALUE( shape, X_value, Y_value):    point = shape.getPart(0)    point.X = X_value    point.Y = Y_value    return point  __esri_field_calculator_splitter__ XYsetVALUE ( !SHAPE!, !X_COORD!, !Y_COORD! )   COORDINATE FIELD TYPE ------ STRING !!!! "going to do" vs. "going to be doing" Note: this post is different to , which just cites part from somewhere else, without any further analysis and thinking. Furthermore, none of the answers to that post answers my question - the situations where &quot;will (going to) be doing&quot; is more appropriate.   I will be participating in IELTS test next Tuesday afternoon.  In an online class, the teacher says the following at the beginning of the lesson.  I will be using NotePod (pointed out by red rectangle) to write relevant points we talk about today.   I guess &quot;will be using&quot; is more appropriate than &quot;will use&quot; there, right?  A  explains  This &quot;tense&quot; is used for reporting a scheduled activity with special focus on its timing— as if one is standing in the future and experiencing the flow of the time. The focus is on the temporary, ongoing, or repetitive nature of the activity.   I understand the grammar rules of those verb tenses and the difference between this group  I am going to drive home tomorrow.   I am going to be driving home tomorrow.  The former is just convey my activity in the near future while the latter probably makes an implication that &quot;don't disturb me as I am driving in that time&quot; However, in the following situations, I don't see the difference between 2 verb tenses.  Welcome back to this class. Today's lesson is for the IELTS students who are going to be taking the IELTS test. it's for everybody to be honest with you. this lesson is useful for anybody who needs to do some writing.   who are going to take the IELTS test ... Find all rings $R$ satisfying $\mathbb Z \subset R \subset \mathbb Z[\frac {1}{2}]$ Find all rings $R$ satisfying $\mathbb Z \subset R \subset \mathbb Z[\frac {1}{2}]$.   Solution: Let $f \in R$. Then $f= \frac {m}{2^n}$ for some integers $m,n$.  Since $2^{n-1} \in R$, hence $\frac {m}{2} \in R$. Hence one gets that $ \frac {1}{2} \in R$, so $R=\mathbb Z[\frac {1}{2}]$, so there is no ring $R$ satisfying given conditions.     What are the other possible solutions of this problem?    P.S: You can give a solution using any theorem from commutative algebra also. I've read  about how some publishers (e.g., Springer) allows authors to submit to arXiv before journal submission, but they make authors wait for a year after acceptance to submit to arXiv.   My question is: Is it okay to submit to arXiv during the time when the paper is under consideration by the journal, for example after it has been "revised and resubmitted" but before final decision? Let $f(z)=\sum\limits_{n=0}^{\infty}a_n z^n$ be an analytic function in $|z|\leq R$ such that $|f(z)|\leq M$. Prove an inequality about $f$'s zero Examples of the Pigeonhole Principle As most of you might know, the Pigeonhole Principle basically  that      If $n$ items are put into $m$ containers, with $n&gt;m$, then at least one container must contain more than one item   It always surprises me how this trivial - and at the same time powerful - idea might be the key in order to solve extremely complicated math olympiad-problems...  Quick and beautiful solutions are characteristic of pigeonhole problems, which are often a three-part process   Recognize that the problem requires the Pigeonhole Principle Figure out what the pigeons and what the pigeonholes might be After applying the pigeonhole principle, there is often more work to be done   I'll illustrate this with an example I've always liked...     (Example-)Problem: Given a $n\times n$ square, prove that if $5$ points are placed randomly inside the square, then two of them are at most $\frac{n}{\sqrt2}$ units apart.   Step 1: This problem can be solved with the Pigeonhole Principle  Step 2: We divide the $n\times n$ square into four $\frac{n}{2}\times\frac{n}{2}$ squares (pigeonholes). Consequently, at least two points (pigeons) are inside the same $\frac{n}{2}\times\frac{n}{2}$ square.  Step 3: The maximal distance between two points in an $\frac{n}{2}\times\frac{n}{2}$ square is the diagonal, which has the length $\frac{n}{\sqrt2}\qquad\square$  Another problem which can be solved with the Pigeonprinciple is the following:     IMO $1972/1$           Prove that from a set of ten distinct two-digit numbers (in the decimal system), it is possible to select two disjoint subsets whose members have the same sum.      At this point, you might have noticed how useful the Pigeonhole Principle can be, if you know how to recognize and use it.     Question: I would like to work on this amazing principle with my students for a week and was, therefore, gathering problems related to the Pigeonhole Principle with beautiful solutions.   Could you suggest some more? Questions with many upvotes should not be closable I see a lot of good, well-writen and constructive questions (that are probably not only good for me) closed, by various reasons which I fail to digest, so I propose the idea that questions with n upvotes should not be closable.  This would be in my opinion very much in the spirit of "", and unless I'm wrong, it would be beneficial for the users to choose by themselves whether the site should have or not x question. The ones which are low quality never get many upvotes anyway.  The only cons I can think of are... DB space? And at a minimum there's the pro of more popular pages with more ads (for the admins), and questions people like (for the users).  I'm also counting for , in the lines of Google's "", but questions  are more like what I'm aiming at (probably that question has not many upvotes for this though). My question was closed for being a "shopping list question", even though it was very much related to the topic of the site. Why? Consider the following code:  foo () {     echo $* }  bar () {     echo $@ }  foo 1 2 3 4 bar 1 2 3 4   It outputs:     1 2 3 4       1 2 3 4   I am using Ksh88, but I am interested in other common shells as well. If you happen to know any particularity for specific shells, please do mention them.  I found the follwing in the Ksh man page on Solaris:     The meaning of $* and  $@  is   identical  when  not  quoted  or  when  used  as a parameter   assignment value or as a file name. However, when used as  a   command argument, $* is equivalent to ``$1d$2d...'', where d   is the first character of the IFS variable,  whereas  $@  is   equivalent  to  $1 $2 ....   I tried modifying the IFS variable, but it doesn't modify the output. Maybe I'm doing something wrong? In iOS 7, when the phone is in Sleep mode and I receive a call, I don't see the "Decline" button. All I see is a green "Answer..." button that requires me to slide to the right to answer the call. Is there anyway we can change that? I know that there are buttons for "Remind Me Later, etc" but I want the "Decline" button.   It works fine when the phone is not in Sleep mode. How to create a site in a sitecollection on a remote SPServer using C# How to solve 'I found no database files--while read file something.aux' Hi I am trying to include references into my paper but it keeps showing the following when I compile. I am using texstudio. Message: I'm skipping whatever remains of this command The style file: plain.bst I found no database files---while reading file term paper.aux Warning--I didn't find a database entry for "Astrov"  My code is like this:   \documentclass[letter,scriptaddress,twocolumn, prl,showkeys]{revtex4}  \usepackage{amssymb, amsmath, amstext, amscd, verbatim, mathtools, graphicx, float, caption, subcaption} \usepackage[utf8]{inputenc} \usepackage{natbib} \begin{document} This is my reference\cite[1]{Astrov}. \bibliography{term paper} \bibliographystyle{plain} \end{document}   They are all in the same directory. I am really panicing about this at the moment and apologize if similar questions have been asked before. Thanks in advance for your help! I'm reading the proof of the multiplicative property of $$s_k(n)=\sum_{d|(n,k)}f(d)g\bigg( \frac kd\bigg)$$ The book wrote that in order to understand the proof, we need to know if $a,b,k,m$ are integers such that $(a,k)=(b,m)=1$, then $$(ab,km)=(a,m)(b,k).$$  I have written proof, but I don't know is it consistent, and this seems used more tools than it necessarily has to.   My proof: Let $$S_1=\{d: d|(a,m), d&gt;0\}\\S_2=\{d: d|(b,k), d&gt;0\}\\S=\{d:d|(ab,km), d&gt;0\}.$$ I will prove the statement by showing that the function $\phi:S_1\times S_2\to S$ defined as $$\phi(d_1,d_2)=d_1d_2$$ is bijective, and complete the proof by connecting the maximal elements from these partial ordering sets.  Obviously, for $d_1\in S_1, d_2\in S_2$, this tells us $d_1 $ is both divisor of $a$ and $m$, and $d_2$ is both divisor of $b$ and $k$, hence $d_1d_2$ is both divisor of $ab$ and $km$, so we can tell $\phi(S_1\times S_2)\subseteq S$.  To show one-to-one, if we have $c_1,d_1\in S_1$ and $c_2,d_2\in S_2$ such that $$\phi(c_1,c_2)=\phi(d_1,d_2)$$ then $$c_1c_2=d_1d_2$$  In particular, $c_1|d_1d_2$, we need to show $c_1|d_1$. Indeed, if $(c_1,d_2)&gt;1$, this implies $a,k$ have common factor larger than $1$, contradicts the assumption. Therefore $c_1|d_1$. A similar argument implies $d_1|c_1$, therefore $c_1=d_1$. Again a similar argument implies $c_2=d_2$, which shows one-to-one.   To show onto, let $d\in S$, since $d|ab$, we can split $d$ into $d_1d_2$ such that $d_1|a$ and $d_2|b$. Since $(a,k)=1$, we see $(d_1,k)=1$, by property of $S$ we see also $d_1|m$, therefore $d_1\in S_1$, a similar argument implies $d_2\in S_2$. So every number in $S$ has a preimage in $S_1\times S_2$  This completes the proof. Is there any mistake in the proof?     Edit: A proof about the statement: If $d|ab$ then there are $d_1,d_2$ such that $d=d_1d_2$ and $d_1|a, d_2|b$.  Let $ab=p_1^{e_1}\cdots p_r^{e_r}$ for distinct prime factors $p_1,\cdots,p_r$, then we can write $$a=p_1^{x_1}\cdots p_r^{x_r}\\b=p_1^{y_1}\cdots p_r^{y_r}$$ where some of $x_i, y_i$ can be zero, and $x_i+y_i=e_i$ for all $i=1,\cdots,r$.  Since $d|ab$, we can write $$d=p_1^{f_1}\cdots p_r^{f_r}$$ with $f_i\leq e_i$ for all $i=1,\cdots,r$. Then since $$f_i\leq x_i+y_i$$ Split into two cases:   Case 1: $f_i&gt; x_i$, then we can choose $g_i=x_i$ and $h_i=f_i-x_i$.  Case 2: $f_i\leq x_i$, then we can choose $g_i=f_i$ and $h_i=0$.  Then the choice $$d_1=\prod_{i=1}^r p_i^{g_i}, \quad d_2=\prod_{i=1}^r p_i^{h_i}$$ will prove the statement. Java has a convenient split method:  String str = "The quick brown fox"; String[] results = str.split(" ");   Is there an easy way to do this in C++?