I am getting error while upload 5mb video file in wordpress media section. How can I solve this issue?
I have edited (created) the php.ini file and the .htaccess file in accordance with  post. I have also found a plug-in (called Upload Max File Size) that claims to raise the file size limit of media files. With the plug-in activated, I see on the add new media screen that the limit has been changed. However, when I attempt to upload a 2.7MB image, I receive the error:  The uploaded file exceeds the upload_max_filesize directive in php.ini.   The contents of php.ini are:  upload_max_filesize = 32M post_max_size = 32M max_execution_time = 300   My .htaccess file contains:  # BEGIN WordPress  php_value upload_max_filesize 100M php_value post_max_size 1M php_value max_execution_time 300 php_value max_input_time 300  # END WordPress   I am currently hosting the word press site myself and have root privileges to anything.
I have been playing with Ubuntu for a few weeks now, and I'd like to revert my computer back to it's original - factory - defaults.   On the computer I have a recovery partition (it's a netbook). I went through the process of recovery and everything seemed fine. However, when I restart the computer I'm presented with   grub rescue &gt;   Now, my understanding is that when I installed Ubuntu "side by side" it replaced the MBR or something like it, with GRUB.   I've read on a slew of forums, that I need to use a Windows Recovery Disk.   Here are my issues:   a) I don't have a recovery disk, I have a recovery partition - it's a netbook. b) I don't have an external cd drive.   What I do have is a USB key that has about 1gb of space on it.   Thanks in advance. In Inno Setup is it possible to add conditional statements to what in the [Run] section gets executed? Alternatively is it possible to manually update the built in progress bar? Basically I have 2 MSIs included and using Inno Setup as a bootstrapper, and depending on user input one or both of the MSIs are to be installed.  I have something working using Exec statements in CurStepChanged but it doesn't update the progress bar as the files are extracted and it looks like the installer is stalled.  I guess the end result is I want some progress bar updates while the files are extracted to the temp folder.  The following is my current code:  procedure CurStepChanged(CurStep: TSetupStep); var     ResultCode: Integer; begin     if(CurStep = ssInstall) then begin         if(InstallServer) then begin             ExtractTemporaryFile('ServerSetup.msi');             Exec('msiexec',ExpandConstant('/i "{tmp}\ServerSetup.msi" /qb INSTALLDIR="{code:GetInstallPath}\Server\" ALLUSERS=2'),'', SW_SHOW, ewWaitUntilTerminated, ResultCode);         end;         if(InstallClient) then begin             ExtractTemporaryFile('ClientSetup.msi');             Exec('msiexec',ExpandConstant('/i "{tmp}\ClientSetup.msi" /qb INSTALLDIR="{code:GetInstallPath}\Client\" ALLUSERS=2'),'', SW_SHOW, ewWaitUntilTerminated, ResultCode);         end;     end; end; Can I write the output the of time difference command to a file? underline omitting the descenders I'm very well aware that it is considered best practice not to use underlining other than on typewriters and in handwriting. But sometimes it is needed nonetheless.  In my opinion the typographically least offending way to underline in print is to leave out the descenders. This is also how I learned to do it in handwriting. Very few fonts offer a pre-made underlined variant, but some text-processors (e.g. OS X text-engine) do -- depending on the font used -- an acceptable job at emulating this effect:    How would I tweak any of the existing ways/packages for underlining to do the same?  As a bonus, I'd like to be able to tweak the behaviour (extent of the omitted part, apply to which letters) per font and text style, preferably working with XeLaTeX. I have End Date column and I want to add 14 Days on it auto when created, can I do it by workflow? Can I do it via jQuery. If yes how? if no how I can do it? I have this file:  sometext1{ string1 }  sometext2{ string2 string3 }  sometext3{ string4 string5 string6 }   I want to search this file for a specific string and print everything before this string up to the opening { and everything after this string up to the closing }. I tried to achieve this with sed but if I try to print everything in the range /{/,/string2/ for example sed prints this:  sometext1{ string1 }  sometext2{ string2 sometext3{ string4 string5 string6 }   If I search for the string "string2" I need the output to be:   sometext2{ string2 string3 }   Thanks. Let $E$ be a metric $\mathbb R$-vector space, $I$ be a nonempty set and $(\mu_t)_{t\in I},(\nu_t)_{t\in I}$ be families of nonnegative finite measures on $\mathcal B(E)$.  that if $(\mu_t)_{t\in I}$ and $(\nu_t)_{t\in I}$ are tight$^1$ and bounded in total variation norm, then the family of convolutions $(\mu_t\ast\nu_t)_{t\in I}$ is tight and bounded in total variation norm as well.  Now I would like to show the converse: If $(\mu_t)_{t\in I}$ and $(\mu_t\ast\nu_t)_{t\in I}$ are tight, then $(\nu_t)_{t\in I}$ is tight. (Most probably we need to impose a boundedness assumption on $(\mu_t)_{t\in I}$ and on $(\mu_t\ast\nu_t)_{t\in I}$ or even a priori on $(\nu_t)_{t\in I}$.)  For the moment, I'm only able to prove the claim assuming that the $\mu_t,\nu_t$ are probability measures. Under this assumption, the proof goes as follows: Let $\varepsilon&gt;0$. Since $(\mu_t)_{t\in I}$ and $(\mu_t\ast\nu_t)_{t\in I}$ are tight, there is a compact $K\subseteq E$ with $$\sup\left(\sup_{t\in I}\mu_t(K^c),\sup_{t\in I}(\mu_t\ast\nu_t)(K^c)\right)&lt;\varepsilon\tag1.$$ Now $K-K$ is compact and \begin{equation}\begin{split}1-\varepsilon&lt;(\mu_t\ast\nu_t)(K)&amp;=\underbrace{\int_K\mu_t({\rm d}x)\nu_t(\underbrace{K-x}_{\subseteq\:K-K})}_{\le\:\nu_t(K-K)}+\underbrace{\int_{K^c}\mu_t({\rm d}x)\underbrace{\nu_t(K-x)}_{\le\:1}}_{&lt;\:\varepsilon}\\&amp;&lt;\nu_t(K-K)+\varepsilon\end{split}\tag2\end{equation} for all $t\in I$, which immediately yields $$\nu_t(K-K)&gt;1-2\varepsilon\;\;\;\text{for all }t\in I\tag3.$$  Can we drop the probability measure assumption?  EDIT I'm not able to obtain the claim, even with the help of the answer below. If $\varepsilon&gt;0$, the goal is to show that $$\nu_t(E)-\nu_t(K-K)=\nu_t((K-K)^c)&lt;\varepsilon\tag4.$$ If I'm choosing all the constants as generic as possible, we obtain $$\mu_t(E)\le c_1\tag5$$ $$\mu_t(K^c)\le k_1(\varepsilon)\tag6$$ $$(\mu_t\ast\nu_t)(K)&lt;c_1\nu_t(K-K)+c_2k_1(\varepsilon)\tag6$$ $$\mu_t(E)\ge\alpha_1\tag7$$ $$(\mu_t\ast\nu_t)(E)\le c_3\tag8$$ $$\nu_t(E)\le\frac{c_3}{\alpha_1}=:c_2\tag9$$ $$(\mu_t\ast\nu_t)(E)\ge\alpha_3\tag{10}$$ $$\nu_t(E)\ge\frac{\alpha_3}{c_1}\tag{11}$$ $$(\mu_t\ast\nu_t)(K^c)&lt;k_3(\varepsilon)$$ The assumptions that I'm imposing is that $(\mu_t)$ and $(\mu_t\ast\nu_t)$ are bounded above (by $c_1$ and $c_3$) and below (by $\alpha_1$ and $\alpha_3$) in total variation norm and are tight (so that we can find $K$ for arbitrary $k_1(\varepsilon)$ and $k_3(\varepsilon)$). In order to obtain the claim we need to choose $k_1(\varepsilon)$ and $k_3(\varepsilon)$ such that $(4)$ holds. From everything above, we obtain $$\nu_t(E)-\nu_t(K-K)&lt;\frac{c_3}{\alpha_1}-\frac{\alpha_3}{c_1}+\frac{c_3}{\alpha_1c_1}k_1(\varepsilon)+\frac1{c_1}k_3.(\varepsilon)\tag{12}$$ Even if we simplify this by assuming $\alpha_1=\alpha_3$, $c_1=c_3$ and $k_1(\varepsilon)=k_3(\varepsilon)$, the equation $$\frac{c_3}{\alpha_1}-\frac{\alpha_3}{c_1}+\frac{c_3}{\alpha_1c_1}k_1(\varepsilon)+\frac1{c_1}k_3.(\varepsilon)=\varepsilon\tag{13}$$ doesn't seem to admit a solution $(k_1(\varepsilon),k_3(\varepsilon))$ with positive $k_1(\varepsilon)$ and $k_3(\varepsilon)$; unless $\frac{c_3}{\alpha_1}-\frac{\alpha_3}{c_1}\ge0$; which clearly doesn't need to be the case (it is clearly the case for probability measures though ...)  $^1$ Remember that a family $\mathcal F$ of finite signed measures on $\mathcal B(E)$ is called tight if for all $\varepsilon&gt;0$, there is a compact $K\subseteq E$ such that $$\sup_{\mu\in\mathcal F}|\mu|(K^c)&lt;\varepsilon.$$ What is the definition of layer in neural network? Why must a final variable be initialized before constructor completes? How can I create light trails without a blurry subject? I would like to achieve this effect using my Nikon P510:      Are there any suggestions or tips that would help me do that? I have not idea how to approach this differential equation.   $$y'-\int_0^xy(t)dt=2$$.  Basically, I did,  $$F''(t)-F(x)+F(0)=2 \;\;\;\;\;\;\; F'=y$$  I am stuck.  Thank You. Question about Riemann integral and total variation Reclassifying only part of raster keeping rest unchanged? I'm trying to reclassify only a certain part of a raster...not the entire raster.  Here's the problem.  I have a LULC raster of the entire US.  There are some issues with the raster that I want to fix, namely some cells that should be water are classified as wetlands.  These are mainly off the coast, not inland.  However, some cells that are classified as wetlands should really be wetlands (mainly inland) and I don't want these to change.  I plan on using a ZIP Code boundary file to determine which cells are considered "off the coast" and which ones are not.  I have access to ArcGIS 10.1 and R with the appropriate raster packages I need so a solution in either software would be fine.  Can anyone help me figure this out? How to create a database directory structure for MySQL? Convergence of the sequence $\sqrt{1+2\sqrt{1}},\sqrt{1+2\sqrt{1+3\sqrt{1}}},\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1}}}},\cdots$ I recently came across this problem     Q1 Show that $\lim\limits_{n \rightarrow \infty} \underbrace{{\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1+\cdots+n\sqrt{1}}}}}}}_{n \textrm{ times  }} = 3$   After trying it I looked at the solution from that book which was very ingenious but it was incomplete because it assumed that the limit already exists.  So my question is     Q2 Prove that the sequence$$\sqrt{1+2\sqrt{1}},\sqrt{1+2\sqrt{1+3\sqrt{1}}},\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1}}}},\cdots,\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1+\cdots+n\sqrt{1}}}}}$$ converges.   Though I only need solution for Q2, if you happen to know any complete solution for Q1 it would be a great help .  If the solution from that book is required I can post it but it is not complete as I mentioned.   Edit: I see that a similar question was asked before on this site but it was not proved that limit should exist. Possible to do a MySQL foreign key to one of two possible tables? Sum of the alternating harmonic series $\sum_{k=1}^{\infty}\frac{(-1)^{k+1}}{k} = \frac{1}{1} - \frac{1}{2} + \cdots $ Why is it wrong to serial voteup someone you like his answers?  Sometimes I just came to stackoverflow to read certain people answers(there are 4 guys currently) I have their profile bookmarked in my browser and in my free time at office I go to their profile and read their answers and learn a lot from them, but because I'm afraid to be a serial voter, I dont voteup them.   I think there is nothing wrong with that, if there is, please let me know. Where can a tourist apply for a UK Visitor (standard) Visa? Where did Hogwarts get money for salaries, food and other purchases? We know that you can't transfigure food, so you have to grow it or buy it. Ditto money.  I'm sure that aside from some medicinal plants Herbology Professor had there were no farmlands at Hogwarts. So they must have bought food (as well as potions ingredients for Snape etc...). And they needed to pay the teacher salaries.  Where did all that money come from according to canon?  Ministry funding?  Tuition?  Patent money on Dumbledore's inventions?  Philanthropic donations by Malfoys and co?  Other?