How can you match everything up to the next captured group?
My regex is matching too much. How do I make it stop?
How to mount a virtual hard disk? Is it possible to mount a virtual hard disk (VHD, HDD, VDI, VMDK) on Ubuntu? How can this be done? How to set render engine in blender? Two figures side by side Custom cross-reference formats (e.g. "Equation 1" instead of just "1") Foreign words reborrowed back into English Wikipedia mentions several English words that have been :   Anime comes from animation and has been reborrowed into English to mean Japanese-style animation. Puroresu comes from professional wrestling and is a term for Japanese-style professional wrestling. Kosupure comes from cosplay (an abbreviation of costume play) and refers to the practice of dressing in costumes of anime and video game characters.    Do you know other examples of word reborrowings from Japanese or other languages back into English, or vice versa? I have two NTFS partitions, and I don't want to mount them manually every-time I start Ubuntu.   How can I do this?  Is there a tool or a code to use?   If so, is it safe to automount? specially when they are being used by another OS? Why use a z test rather than a t test with proportional data? When testing the difference between 2 proportions why do we use a z-test rather than a t-test?    Further, is there a simple way to conduct an omnibus test for significant differences between more than 2 proportions (in the form of percentages). Is there an equivalent to a one-way ANOVA for this?  I imagine that you could use logistic regression (assuming you have the original data for the proportions in the form of 0s and 1s) Are there other options? When should I use # and = in ASP.NET controls? I have been using ASP.NET for years, but I can never remember when using the # and = are appropriate.  For example:  &lt;%= Grid.ClientID %&gt;   or  &lt;%# Eval("FullName")%&gt;   Can someone explain when each should be used so I can keep it straight in my mind? Is # only used in controls that support databinding? An excerpt from Introduction to Analytic Number Theory by Tom M. Apostol.      I have three main concerns regarding this proof:    What is the abscissa of convergence for $\frac{1}{F(s)}$ - why can we take the product of the two series. I only know this is true if the two series are absolutely convergent.  Why can we do term by term integration? I believe its suffices to show that the series converges locally uniformly - BUT is this true?  How does the proof show that $G(s)$ converges uniformly? We are currently developing a site that currently has 8 million unique pages that will grow to about 20 million right away, and eventually to about 50 million or more.  Before you criticize... Yes, it provides unique, useful content. We continually process raw data from public records and by doing some data scrubbing, entity rollups, and relationship mapping, we've been able to generate quality content, developing a site that's quite useful and also unique, in part due to the breadth of the data.  It's PR is 0 (new domain, no links), and we're getting spidered at a rate of about 500 pages per day, putting us at about 30,000 pages indexed thus far. At this rate, it would take over 400 years to index all of our data.  I have two questions:   Is the rate of the indexing directly correlated to PR, and by that I mean is it correlated enough that by purchasing an old domain with good PR will get us to a workable indexing rate (in the neighborhood of 100,000 pages per day). Are there any SEO consultants who specialize in aiding the indexing process itself. We're otherwise doing very well with SEO, on-page especially, besides, the competition for our "long-tail" keyword phrases is pretty low, so our success hinges mostly on the number of pages indexed.   Our main competitor has achieved approx 20MM pages indexed in just over one year's time, along with an Alexa 2000-ish ranking.  Noteworthy qualities we have in place:   page download speed is pretty good (250-500 ms) no errors (no 404 or 500 errors when getting spidered) we use Google webmaster tools and login daily friendly URLs in place I'm afraid to submit sitemaps. Some SEO community postings suggest a new site with millions of pages and no PR is suspicious. There is a , too, in order to avoid increased scrutiny (at approx 2:30 in the video).      Clickable site links deliver all pages, no more than four pages deep and typically no more than 250(-ish) internal links on a page. Anchor text for internal links is logical and adds relevance hierarchically to the data on the detail pages. We had previously set the crawl rate to the highest on webmaster tools (only about a page every two seconds, max). I recently turned it back to "let Google decide" which is what is advised. Evaluate $\lim_{n\to \infty} \sum_{r=1}^n \frac {1}{2^r}\tan \left(\frac {1}{2^r}\right)$ Evaluate $$\lim_{n\to \infty} \sum_{r=1}^n \frac {1}{2^r}\tan \left(\frac {1}{2^r}\right)$$   I tried to create a telescoping sum but I couldn't. The last step I could reach was turning the limit into $$\lim_{n\to \infty} \sum_{r=1}^n \left(\frac {1}{2^r(1-\tan (2^{-r+1})} -\frac {1}{2^r(1+\tan (2^{-r+1})}\right) $$  But couldn't proceed further. Also I thought about Riemann sums but it was a pure dead end.  Any help would be greatly appreciated Information on month old flights Where can I get flight info for a flight a month ago for an insurance claim? Flight stat sites will only show a weeks worth of data. Poll in background for StackExchange™ MultiCollider SuperDropdown™ inbox events and update the titlebar accordingly à la Facebook Steam Bollywood Achievement:     As Gandhi, win a cultural victory with   3 or fewer cities in your empire.   I wish to do this achievement on a Pangaea Standard map size or larger and on Prince difficulty or higher,  What tactics do people recommend to achieve this. Any tips on the use of, Social Policies, Wonders, Diplomacy, City States and Military. Why is it so hard to do this in Java? If you want to have any kind of module system you need to be able to load JAR files dynamically. I'm told there's a way of doing it by writing your own ClassLoader, but that's a lot of work for something that should (in my mind at least) be as easy as calling a method with a JAR file as its argument.  Any suggestions for simple code that does this? I'm studying the Darboux definition of integrability, which I completely explained . There's an exercise that asks me to prove that the Darboux Integrability is equivalent to Riemann Integrability, but this Riemann integral is defined as the following:  It first defines a 'pointed' partition (I don't know how to say it in ensligh) by the following: a 'pointed' partition $[a,b]$ is a pair $P^*=(E,ξ)$, where $P=\{t_0, t_1, \cdots, t_n\}$ is a partition of $[a,b]$ and $ξ = (ξ_1, \cdots, ξ_n)$ is a list of $n$ chosen numbers such that $t_{i-1}\le ξ_i\le t_i$ for each $i=1,\cdots ,n$.  Now, the Riemann Integral is defined as:  $$\sum(f,P^*) = \sum_{i=1}^n f(ξ_i)(t_i-t_{i-1})$$  (I didn't understand the notation for the left hand side of the equation, by the way)  Finally, I'm asked to prove the following: given $f,g:[a,b]\to \mathbb{R}$ integrable functions, for the entire partition $P=\{t_0, \cdots, t_n\}$ of $[a,b]$ let $P^* = (P,ξ)$ and $P^{\#} = (P, η)$ be pointed partitions of $P$, then:  $$\lim_{|P|\to 0}\sum f(ξ_i)g(η_i)(t_i-t_{i-1}) = \int_a^b f(x)g(x) \ dx$$  I guess here I need to prove that the Riemann Integral of the product of two functions if the darboux integral of $f(x)g(x)$, but it seems too obvious, I just need to verify that $f,g$ are integrable, then their product is too, isn't it? I'm pretty sure this should be a hard question. Is there another interpretation that I'm missing? Can ovulation and menstruation occur simultaneously? Is that possible that ovulation happens in the time of actual menstrual haemorrhage in human females - let say in a case that woman has 21 day cycle and her menstrual period is 7 days?   If yes, does it means that in this particular case the woman has lower chances to conceive? strptime() equivalent on Windows? Is there a good equivalent implementation of strptime() available for Windows?  Unfortunately, this POSIX function does not appear to be available.   - summary: it converts a text string such as "MM-DD-YYYY HH:MM:SS" into a tm struct, the opposite of strftime(). How to change file extension at runtime in Java Mavericks unusually high RAM usage I thought Mavericks was suppose to utilize RAM memory better, thus run smoother.  Running ML on Mac mini 2012, with 16GB RAM...always running smoothly even with over a dozen apps running.  Now, after installing Mavericks, my Mac is SLOW, eating up RAM like crazy! Looking over usage, of the 16GB of installed memory...on average it uses 10-14 GB RAM when barely running a few apps!!!   There is this kernel_task that is always running with over 1GB of RAM and most apps are not taking that much RAM, so what is using up all my RAM?! File cache? It shows very high in that new description, with about 1/3 of my total RAM