CSS is not detected for newly added divs
Which characters are valid in CSS class names/selectors?
I'd like to output hello world over 20 characters.  printf "%-20s :\n\n" 'hello world!!'  # Actual output hello world!!        :  # Wanted output hello world!!========:   However, I don't want to complete with spaces but with "=" instead. How do I do that? How to UPSERT (MERGE, INSERT ... ON DUPLICATE UPDATE) in PostgreSQL? Why do we use the object instead of the subject pronoun in constructions like "stupid me"? I'm trying to find out how come we say lucky me and stupid us rather than lucky I and stupid we. My understanding is that this is not a recent invention, but a relic from the distant past where it was a dative construction. However, I don't see the reason for using any case other than the nominative in this construction to begin with.        He went surfing. → Lucky him went surfing.   I got pulled over. → Stupid me got pulled over.   They bought a house. → Thoughtless them bought a house.      This is rather intriguing. After thinking about it for a while, I couldn't come up with any other language, Germanic or otherwise, where simply introducing an adjective would dictate a change of grammatical case. This appears to be an English peculiarity. How far can it be traced back? Can anyone comment on its background? XIV pages in page counts? Is it possible to make biblatex output page counts for both the regular pages and the roman-numbered pages, for example:     Cook, Theodore Andrea. The Curves of Life : Being an Account of Spiral Formations and Their Application to Growth in Nature, to Science and to Art; with Special Reference to the Manuscripts of Leonardo da Vinci. — London : Constable and Company, 1914. — xxx + 479 p.   Here there are "30 pages + 478 pages" in total. Thanks! Video produced from images only plays in VLC but no other players RemoveDuplicates gives 1004 error why normalize and the definition of directional derivative I'm not understanding how to solve this problem.  I think the problem lies in the fact that I don't understand why normalize and the definition of directional derivative... It's in Portuguese. The question would be: Determine the directional derivative of f in P in direction of vector u: Multi armed bandit for general reward distribution I'm working on a multi-armed bandit problem where we do not have any information about the reward distribution.   I have found many papers which guarantee regret bounds for a distribution with known bound, and for general distributions with support in [0,1].   I would like to find out if there is a way to perform well in an environment where the reward distribution does not have any guarantees about its support.  I'm trying to compute a nonparametric tolerance limit and using that number to scale the reward distribution so I can use the algorithm 2 specified on this paper (). Does anyone think this approach will work?  If not, can anyone point me to the right spot?  Thanks a bunch! I would like to know how to create a physically correct mirror material in cycles. How can that be achieved as realistic as possible?  From :     Mirrors are manufactured by applying a reflective coating to a   suitable substrate ...      In modern times, the mirror substrate is shaped, polished and cleaned, and is then coated. Glass mirrors are most often coated with silver[20] or aluminium ...      In some applications, generally those that are cost-sensitive or that   require great durability, mirrors are made from a single, bulk   material such as polished metal ... Dynamic Symlinks I have built my app for different architectures and would like to create a "dynamic symlink" which takes me to the right version based on a variable.   If the machine I am currently logged in to, is x86, then the symlink should take me to that build.  A mocked example of what I want to do:  $ uname -i x86_64  $ ls -ltr  lrwxr-xr-x  1 dogbane gg     4 Feb 16 15:40 mylink -&gt; @sys/ drwxrwxr-x  2 dogbane gg  2048 Feb 16 15:40 x86_64/ drwxrwxr-x  2 dogbane gg  2048 Feb 16 15:40 i386/  $ cd mylink  $ pwd -P ~/x86_64   Is this possible?   I know I can use cd $(uname -i), but want something simpler. How do you reset the sa password? I lost the sa password on a machine, and when I log in to the machine directly using an account in the admin group, SQL Server Management Studio will not allow me to log in using Windows authentication.  My plan was to simply log into the server, connect via Windows Authentication, and reset sa to use a new password. Since I cant' connect via Windows Authentication, this won't work.  How else can I reset the sa password? I want to type Arabic text in Photoshop, but the text appears disjointed and the letters do not connect at all. For example محمد appears as م ح م د.   I'm using Photoshop CS6 on OSX Mountain Lion. What should the character limit(s) for first/last name inputs be? We want to create input fields for a user's first and last names. What should the minimum and maximum limits be, if any, and why? limit of integral $n\int_{0}^{1} x^n f(x) \text{d}x$ as $n\rightarrow \infty$ I am trying to solve the following problem at the level of a senior undergrad analysis level. So, the problem is as follows: We are given a function $f$ which is continuous on the interval $\left [ 0,1 \right ]$, and the question is to find the limit: $$\lim_{n\rightarrow \infty}\int_{0}^{1}x^{n}f(x)dx\;.$$ The second part of the problem is to deduce the following limit: $$\lim_{n\rightarrow \infty}n\int_{0}^{1}x^{n}f(x)dx\;.$$  For the first part: I just did the following: For every $0\leq x&lt; 1$: $x\leq M$, where $0&lt; M&lt; 1$. Then: $$\int_{0}^{1}x^{n}f(x)dx\leq M^{n}\int_{0}^{1}f(x)dx\;.$$ Then: $$\lim_{n\rightarrow \infty }\int_{0}^{1}x^{n}f(x)dx\leq \lim_{n\rightarrow \infty }M^{n}\int_{0}^{1}f(x)dx= 0.\int_{0}^{1}f(x)dx=0\;,$$ so $$\lim_{n\rightarrow \infty }\int_{0}^{1}x^{n}f(x)dx=\lim_{n\rightarrow \infty }f(1)\int_{0}^{1}1dx=f(1)\;.$$ Does that make sense? If not, please show me the correct one.  As for the second part, I have no idea what to do. Any help? For which $x$ exists sum $1 + 2 + 3 + \ldots + n$, where $n &gt; 3$, which has notation $xxx\ldots x$?   In other words, I am looking for a sum of natural numbers which gives a result which has all same digits, e.g. $5555555$ or $22222222222222222$, or whatever else.  How to find this series and how to proof it for all possible series?  I have found the following examples:   $1 + 2 + 3 + \ldots + 10 = 55$ $1 + 2 + 3 + \ldots + 11 = 66$ $1 + 2 + 3 + \ldots + 36 = 666$     And what about next series which ends with (different) repeating $x$? Hot to find and proof it? On Travel-SE, there are currently  awarded. However, when one uses the search interface with views:2500, . The two numbers should be equal, and it's difficult to explain the difference with caching issues.   As the number of views is ever-increasing (as we all know, it's impossible to un-see things, unfortunately), this seems like a bug. Or perhaps I'm doing something wrong?  Also, some questions which should qualify don't appear on the search page. See , for example.  None of these questions are closed or deleted: views:2500 closed:yes and views:2500 deleted:yes return 0 results.  Eeeek? I am downloading the HTML source page of a website using cURL command. The problem is, I do not want most of the contents in the page. I just need the first 100 lines of the source page. Is there a way to stop the download of the page after first few lines?  Currently, I have the below command working but it does not seem to be time effective.   curl -r[0-1] "http://www.freebase.com/m/045c7b" &gt; foo.txt   I tried changing the value from 1 to .5 and .05 and still the entire web page is getting downloaded.   I am looking at time less than a second to execute the above command.    EDIT  From the man page of cURL, I see that "You should also be aware that many HTTP/1.1 servers do not have this feature enabled, so that when you attempt to get a range, you'll instead get the whole document." So if the server is not supporting the range querying, is there some other command in nix environment which will help me accomplishing what am trying to do? My laptop's cable broke and sadly it seems like I need to buy a new power supply.  What I wonder is, I've found that universal power supplies are much cheaper than the official HP ones. Are they really worth it?  Another question: the original supply has these specs: 65W, 18.5V, 3.5A. However the universal supplies are more powerful (90W, 100W) and come in integer voltages (17V, 18V, 19V, etc). Are they compatible? Should I set them to 18V or 19V? How can an encryption scheme be indistinguishable with multiple messages but vulnerable to an adaptive chosen-plaintext attack? In order to be indistinguishable with respect to multiple messages, wouldn't the scheme need to be nondeterministic? How would this then possibly be vulnerable to an adaptive CPA? Do eyeballs exhibit chromatic aberration? Fairly straightforward question. If not, why not?  I suspect that if they do, it is not perceived due to the regions of highest dispersion being in one's region of lowest visual acuity.