The question might be more confusing than what I am trying to do. Basically I want to get the content of the html &lt;title element:  s = s.match(/&lt;title&gt;(.*?)&lt;\/title&gt;/);   This gives me:  ["&lt;title&gt;foobar&lt;/title&gt;", "foobar"]   So to access the text only, I have to use s[1].  Is there any way to create a match with just the text, skipping "&lt;title&gt;foobar&lt;/title&gt;"? Or with other words: is there a way to tell match(): "search for a string delimited with &lt;a&gt;&lt;/a&gt; but ignore those delimiters in the result"?  I have tried various expressions with negative lookbehinds and such, but I wasnt lucky. I dont even know if that is the correct approach.
I want to match a portion of a string using a  and then access that parenthesized substring:  var myString = "something format_abc"; // I want "abc"  var arr = /(?:^|\s)format_(.*?)(?:\s|$)/.exec(myString);  console.log(arr);     // Prints: [" format_abc", "abc"] .. so far so good. console.log(arr[1]);  // Prints: undefined  (???) console.log(arr[0]);  // Prints: format_undefined (!!!)   What am I doing wrong?    I've discovered that there was nothing wrong with the regular expression code above: the actual string which I was testing against was this:  "date format_%A"   Reporting that "%A" is undefined seems a very strange behaviour, but it is not directly related to this question, so I've opened a new one, .    The issue was that console.log takes its parameters like a printf statement, and since the string I was logging ("%A") had a special value, it was trying to find the value of the next parameter.
Initial connection to SQL Server Connection Is Slow. Why? Kernel panic after update to 4.4.0-108-generic I need to run IE 10 in 32-bit mode on 64-bit Windows 7 Enterprise N.  When I run IE 10 from "C:\Program Files (x86)\Internet Explorer" I can see in task manager that I have only one process "iexplorer.exe" and no process "iexplorer.exe *32".  I have an application with an ActiveX that is supported only on 32-bit, and the application can't be loaded on 64-bit mode.  Is there a way I can force IE10 to run in 32-bit mode? Sum of compact sets Let $A,B$ two non-empty compact subsets of a normed space X. How can we prove that the set $S=A+B=\{a+b : a \in A, b \in B\}$ is compact?  Here's my reasoning:  Let $\Omega = \{\Omega_1, \Omega_2,…\}$ be an open cover of $S$. $\Omega$ induces two open cover $X,Y$ respectively of $A,B$, where   $X_i = \{a \in A : a+b \in \Omega_i~~for~some~b\}$   $Y_i = \{b \in B : a+b \in \Omega_i~~for~some~a\}$  in practice $\Omega_i = X_i + Y_i$.  Now my idea is build a finite subcover this way: consider a finite subcover $X_F = \{X_j : j \in J\}$ where $J$ is a finite set of indices. If $Y_F = \{Y_j : j \in J\}$ is a finite subcover of $B$, then we are done as $\{\Omega_j : j \in J\}$ is a subcover of $\Omega$. Otherwise we can keep adding indexes to set $J$ until $Y_F$ becomes a finite subcover of $B$.   This is not too formal but I don't want to make a simple question unreadable, I think the idea should be clear.   Does this works? Is there a better/easier way to get the same result? When upgrading to Ubuntu 14.04 from Ubuntu 12.04 I am getting the following error:     W:Failed to fetch    Unable to find expected entry 'non-free/source/Sources' in Release   file (Wrong sources.list entry or malformed file) , E:Some index files   failed to download. They have been ignored, or old ones used instead. Extra slash added to the chat room URLs in the side bar There is a extra slash added to the chat room URLs in the side bar. This is not causing any redirection issue or 404 not found error. Just observed it and want to notify to the development team about this. Seems it is not a bug, but that can . Currently the following URLs are binded against the chat rooms in the side bar.  Tavern on the Meta https://chat.meta.stackexchange.com//rooms/89  The Fire Department https://chat.meta.stackexchange.com//rooms/1181   GIF for the reference: Claim: If $(x_\alpha)_{\alpha\in A}$ is a collection of real numbers $x_\alpha\in [0,\infty]$ such that $\sum_{\alpha\in A}x_\alpha&lt;\infty$, then $x_\alpha=0$ for all but at most countably many $\alpha\in A$ ($A$ need not be countable).  Proof: Let $\sum_{\alpha\in A}x_\alpha=M&lt;\infty$. Consider $S_n=\{\alpha\in A \mid x_\alpha&gt;1/n\}$.  Then $M\geq\sum_{\alpha\in S_n}x_\alpha&gt;\sum_{\alpha\in S_n}1/n=\frac{N}{n}$, where $N\in\mathbb{N}\cup\{\infty\}$ is the number of elements in $S_n$.  Thus $S_n$ has at most $Mn$ elements.   Hence $\{\alpha\in A \mid x_\alpha&gt;0\}=\bigcup_{n\in\mathbb{N}}S_n$ is countable as the countable union of finite sets. $\square$  First, is my proof correct? Second, are there more concise/elegant proofs? Can low-gravity planets sustain a breathable atmosphere? If astronauts could deliver a large quantity of breathable air to somewhere with lower gravity, such as Earth's moon, would the air form an atmosphere, or would it float away and disappear? Is there a minimum amount of gravity necessary to trap a breathable atmosphere on a planet? How to programmatically create a WPF window in a WinForm application Are there any rules on the positioning adverbs should take in a sentence? For example:     Ever wish you could share information broadly   Could it be rewritten to:     Ever wish you could broadly share information   Are there any rules for the position of the adverbs. I'm very new to the GIS world, so my problem could be very stupid, but I'm going to try anyway.  Objective  Given a list of coordinates in longitude/latitude, stored as a .csv file, I want to create a buffer with distance of x km around those coordinates. (In case this is relevant, these coordinates are locations of the societies in the . These societies scatter all around the world.)  Problem  I'm only able to create buffers with distance in radial degrees, but I want to do them in (kilo)meters. I'm aware of the following Q&amp;A's, but following what's suggested therein doesn't seem to solve my problem:          What I have tried...   I start QGIS (v2.4), and Add delimited text layer  choose my .csv file and the x/y fields, click OK select WGS 84 as my CRS (also tried NAD83 but didn't make a difference), click OK right-click on layer and select Save As..., in the dialog box, choose the following and click OK:  add sccs_meter.shp as layer to the current project Select Vector > Geoprocessing Tools > Buffers > set buffer distance as 10   The result is a buffer with radius of approximately 1068km, which suggests that buffer distance is 10 degrees rather than 10 meters.  What did I do wrong here? (I'm aware of  but it has no answers…)  Let be $u_0 \in \mathbb{R}$ and the sequence $(u_n)_n$ defined by: $u_{n + 1} = \frac12 \arctan(u_n)$.  I define also: $v_n = 2^n u_n$, so I can show that: $\lim (u_n)_n = 0$ (by studying $x \mapsto \frac12 \arctan(x)$), thus, I can show that $(v_n)_n$ is monotone and converges because it is bound.  Now, I conclude: $u_n \sim \dfrac{l}{2^n}$, I'd like to determine $l$ more precisely.  Here is what I tried, I suspect $l$ to be something like $f(\pi)$ for some $f$ :   push the asymptotic expansion of $\arctan$ to the 2nd order and reinject it ; use $\arctan(u_n) + \arctan(1/u_n) = \dfrac{\pi}{2}$ ; use series techniques to look for $\sum v_{n + 1} - v_n$, maybe conclude using Cesaro summation I am putting together a GIS server using GeoServer and need some help with importing my layer styles from ArcGIS 10 to  format.    I have one layer in ArcMap properly symbolized and labeled, how can I get this layers symbolization and labeling into a SLD file? Complex analysis : If $z =re^{i\theta}$, then prove that $|e^{iz}| =e^{-r\sin\theta}$ Problem :   If $z =re^{i\theta}$, then prove that $|e^{iz} | =e^{-r\sin\theta}$   My working :   $z = re^{i\theta} = r(\cos\theta + i\sin\theta)$   $\Rightarrow iz = ir(\cos\theta +\sin\theta) $ = $-r\sin\theta +ir\cos\theta $  $\Rightarrow e^{iz} =e^{(-r\sin\theta +ir\cos\theta)} = e^{-\sin\theta} e^{ir\cos\theta} $   $\Rightarrow |e^{iz}| = |e^{-r\sin\theta}||e^{ri\cos\theta}|$   Now please guide how to proceed further to get the result... thanks. What is a simple way to create a binary relation symbol on top of another? What is a simple way to have \ll on top of \gg with equal size and vertically center aligned and have them work as a binary relation symbol like \lessgtr? The commands \underset and \overset cannot be used because they do not treat the two symbols equally, and they do not vertically center. I have recently purchased a hybrid bike with suspension (not sure if that is relevant to this question). It came with two pieces of plastic. Any ideas what they may be for? Polynomials with integer coefficients such that $p(a)=b,p(b)=c,p(c)=a$ While studying polynomials a question struck in my mind that  To have a polynomial $p(x)$ with integer coefficients and $a,b,c$ are three distinct integers, then is it possible to have $$p(a)=b$$$$p(b)=c$$$$p(c)=a$$ Run a GUI program at startup I am using Ubuntu 14.04. I wrote a small script named trial. The contents of the script are as follows:   #!/bin/sh SHELL=/bin/sh PATH=/bin:/sbin:/usr/bin:/usr/sbin      sh -c firefox   I copied the script to /etc/init.d, modified permission using chmod +x trial and used update-rc.d trial defaults. The file made link but when I rebooted the machine. It did not run firefox. I tried cron @reboot but with no success. I tried rc.local too again failure. why is there no non-degenerate 2-forms on 4-sphere? I'd like to do some URL rewriting (Why? See .) so that instead of users seeing addresses like   labouseur.com/course-compilers.html    they can instead see and use simply   labouseur.com/course-compilers   (Even better, maybe I should restructure that so that it's courses/compilers.)  I'm using a Linux-based shared hosting service for my website, so I do not have administrative control of the server, but I do have control over .htaccess. The references I've read online seemed less than clear to me, so I'm looking for a little clarity and advice here.