Updating post_views_count on publish
Increasing post view count automatically
How do question bookmarks work? What does bookmarking a question mean? How do you bookmark a question? Do users get updates on their bookmarked questions? Are my bookmarks publicly visible? How do you see your own bookmarks? How do you see other users' bookmarks? How do you see which users have bookmarked a particular question? What impact does the bookmark system have on the voting system? Can I &quot;un-bookmark&quot; a question? Can I search within my bookmarks? How can I find local IP addresses (i.e. 192.168.x.x or 10.0.x.x) in Python platform independently and using only the standard library? Software recommendations Many C++ books contain example code like this...  std::cout &lt;&lt; "Test line" &lt;&lt; std::endl;   ...so I've always done that too. But I've seen a lot of code from working developers like this instead:  std::cout &lt;&lt; "Test line\n";   Is there a technical reason to prefer one over the other, or is it just a matter of coding style? Can the Force be used to fly? How to escape quotes in shell? I'm having trouble with escaping characters in bash. I'd like to escape single and double quotes while running a command under a different user. For the purposes of this question let's say I want to echo the following on the screen:  'single quote phrase' "double quote phrase"   How can I escape all the special chars, if I also need to switch to a different user:  sudo su USER -c "echo \"'single quote phrase' \"double quote phrase\"\""   Of course, this doesn't produce the right result. Estimating partial sums $\sum_{n = 1}^m \frac{1}{\sqrt{n}}$ Apostol's Calculus, exercise number I 4.7 13.     Prove that if $n \geq 1$, then   $$ 2(\sqrt{n+1} - \sqrt{n}) &lt; \frac{1}{\sqrt{n}} &lt; 2(\sqrt{n} - \sqrt{n-1}) $$   and use this to prove that if $m \geq 2$, then   $$ 2 \sqrt{m} - 2 &lt; \sum_{n = 1}^m \frac{1}{\sqrt{n}} &lt; 2\sqrt{m} - 1 $$   In particular, when $m = 10^6$ the sum lies between $1998$ and $1999$.   After establishing the trivial case, for $n=1$, I can't think of a way to perform the inductive step:  assuming $2(\sqrt{n+1} - \sqrt{n}) &lt; \frac{1}{\sqrt{n}} &lt; 2(\sqrt{n} - \sqrt{n-1})$ and using this, deducing the same for $n+1$ is true as well:  $2(\sqrt{n+2} - \sqrt{n+1}) &lt; \frac{1}{\sqrt{n+1}} &lt; 2(\sqrt{n+1} - \sqrt{n})$  Any help is very appreciated, thanks Lecturer with anxiety. How to survive in academia? I've been a long time member of academia.SE but I created this alt account because the question is a bit embarrassing. I finished my PhD 4 years ago and after a 2 year postdoc at a different university secured a contractual lecturership. During my PhD I never realised I had fear of public speaking, because I always felt secure presenting in front of my supervisor. Even at conferences, his presence in the audience was enough to keep me relaxed.  Fast forward to my postdoc, I was mostly working and publishing by myself. So, even if I had to present something it was to my coauthors, with which I am okay. But as a lecturer doing research part of my time, I am involved in projects and seminars where I am expected to present my latest work. Being on my own has brought out my inner anxiety, so much so that I choked during a presentation, had to drink water to calm my nerves and apologise for my breathlessness and slurred speech. That was the most embarrasing thing in my life. Please note that the anxiety is not the result of me not publishing or doing research. I have published more than most in my department. Knowing that hasn't helped with the anxiety though. I am constantly making excuses to get out of project presentations and seminar talks. Fortunately, the anxiety is less intense in teaching and I am able to manage.   How do I survive as an academic? Now even conference presentations seem daunting. I can publish exclusively in journals, but how do I get out of giving project and departmental presentations? How can I politely refuse to present without revealing my situation? Or better yet, how do I fix the whole thing? That one bad presentation has really messed me up. Seeking block (sub-district) level boundaries for India? I'm looking for block (sub-district) level shapefiles for India. The GADM database only has files for the 2300 Tehsils, whereas I'm looking for the about 5500 Census blocks (sub-districts) for any year possible. Beamer how to change color of infolines and frame title How could I change the color of color of infolines and frame title in beamer. I am using this now   \documentclass[xcolor=dvipsnames]{beamer} \usetheme{CambridgeUS} \useinnertheme{rectangles} \useoutertheme{infolines} \usecolortheme[named=Brown]{structure}    I need to change the color from red to brown. [named=Brown] doesn't work for \useoutertheme{infolines}. This is my current output. I also need to change the background of frame title (mouse pointer) 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 :-) Dividing an equilateral triangle into N equal (possibly non-connected) parts It’s easy to divide an equilateral triangle into $n^2$, $2n^2$, $3n^2$ or $6n^2$ equal triangles. But can you divide an equilateral triangle into 5 congruent parts? Recently M. Patrakeev  an awesome way to do it — see the picture below (note that the parts are non-connected — but indeed are congruent, not merely having the same area). So an equilateral triangle can also be divided into $5n^2$ and $10n^2$ congruent parts.  Question. Are there any other ways to divide an equilateral triangle into congruent parts? (For example, can it be divided into 7 congruent parts?) Or in the opposite direction: can you prove that an equilateral triangle can’t be divided into $N$ congruent parts for some $N$?                                               (Naturally, I’ve tried to find something in the spirit of the example above for some time — but to no avail. Maybe someone can find an example using computer search?..) I’d prefer to use finite unions of polygons as ‘parts’ and different parts are allowed to have common boundary points. But if you have an example with more general ‘parts’ — that also would be interesting. How do I arrange selected vertices into a circular formation quickly?  The other answers does not have the same title as my question. My question is direct and simple for younger beginner to search for results. Do sets, whose power sets have the same cardinality, have the same cardinality? Is it generally true that if $|P(A)|=|P(B)|$ then $|A|=|B|$?  Why? Thanks. "Contact us"... and then what? I've got a utility that outputs a list of files required by a game.  How can I run that utility within a C program and grab its output so I can act on it within the same program? UPDATE: Good call on the lack of information.  The utility spits out a series of strings, and this is supposed to be portable across Mac/Windows/Linux.  Please note, I'm looking for a programmatic way to execute the utility and retain its output (which goes to stdout). Targeting only Firefox with CSS I would like to know if it is possible to not get penalised by google for changing the subject of a category entirely. I would like to swap a category that I have built on a webpage, for one with a more relevant (as of now) topic. Changing description, content and title etc... would this destroy my SEO? It has amassed backlinks of great quantity and quality over the course of time and I seriously would not like to have them wasted or passed with internal links as the page itself is invaluable. Assume anchors to my webpage were all &quot;&lt;empty&gt;&quot; for convenience purposes. They are nothing particularly descriptive. Given two increasing continuous functions $f,g$ prove that $(b-a) \int^b_a f(x)g(x) dx > \int^b_a f(x) dx \int^b_a g(x) dx$ Given two monotonically increasing continuous functions $f,g$ prove that  $$(b-a) \int^b_a f(x)g(x) dx &gt; \int^b_a f(x) dx \int^b_a g(x) dx,\; b&gt;a$$  what I have tried:  Let $$h(x) = (x-a)\int^x_a f(t)g(t) dt - \int^x_a f(t)dt\int^x_a g(t)dt $$ and trying to figure out that $h'&gt;0$ using MVT to reform $h'(x)$ as   $$h'(x) = (x-a)(-f(x)g(\xi_1) - g(x)f(\xi_2) + f(x)g(x) + f(\xi_3)g(\xi_3))$$ where $\xi_{1,2,3} \in (a,x)$ (That method does not seem to work) How do I remove objects from an array in Java? Given an array of n Objects, let's say it is an array of strings, and it has the following values:  foo[0] = "a"; foo[1] = "cc"; foo[2] = "a"; foo[3] = "dd";   What do I have to do to delete/remove all the strings/objects equal to "a" in the array?