We see migrated, close, down voted (more than five down voted) questions are in hot tab.  From this scenario many questions arise in mind  &amp; See the picture below These types of questions are hot question? What is the definition of hot questions? (It does not mean  how algorithm work .. It means how people think about  hot question ) When question are closed for off topic , Details or Clarity or etc.… Should we remove those type of questions from hot, week, month tab? Feature Request I would like to request to remove those type of questions from hot, week, month tab Picture
Each site got a &quot;hot&quot; tab, where its contents are calculated based on . However take a look on the screenshots below and see for yourself that &quot;hot&quot; got nothing to do with many of the questions listed there. :    :    As you can see, there are questions with negative score, no answers, and even closed. I won't be surprised to see spam in there as well. This can't be any worse. What I suggest, instead of fixing the formula or patching it, simply have the hot tab show the same questions as the Hot Network Questions sidebar. (from the specific site only, of course.) Since the hot questions &quot;pool&quot; (as seen ) is limited to 100 for the whole network, either expand it or have the per-site list show questions with less hotness points - it would still be better than what we have now.
In Interstellar, what do Murph and NASA do to save humanity after solving Brand's equation? Do they get the entire human race on giant space ships and transport them to a habitable planet? (How exactly do they do  this?)  If yes, is this habitable planet Edmunds' (the one that Amelia lands on)? Show that $\frac 1{1+x+y^{-1}}+\frac1{1+y+z^{-1}}+\frac1{1+z+x^{-1}}=1$ if $xyz=1$ If $x.y.z=1$ show that $\dfrac 1{1+x+y^{-1}}+\dfrac1{1+y+z^{-1}}+\dfrac1{1+z+x^{-1}}=1$  My attempt - L.H.S$=\dfrac 1{1+x+y^{-1}}+\dfrac1{1+y+z^{-1}}+\dfrac1{1+z+x^{-1}}$  $=\dfrac y{y+xy+1}+\dfrac z{z+yz+1}+\dfrac x{x+zx+1}$  $=\dfrac{yz}{yz+xyz+z}+\dfrac z{z+yz+1}+\dfrac x{x+zx+1}$  What to do next? Customizing citations and the list of publications depending on the author Say I use a bibliography file in my document, relying on Biblatex and Biber for citation management.  Given a citation command such as \cite{A, B, C} (or any other standard Biblatex citation command), I'd like the resulting citations to be typeset differently depending on whether a given field (e.g. the author field) in the corresponding bibliography entry contains a given string (e.g. someone's lastname).   Besides, I'd like to generate two different bibliography sections in the resulting document, depending on the same condition as above.  Typically this would be used to differentiate, both at the citation level in the main text and in the appendix, the publications that I co-authored from others.  EDIT: adding a MWE:  \documentclass{article} \usepackage{filecontents} \usepackage[backend=biber,style = alphabetic]{biblatex} \usepackage[colorlinks=true, breaklinks, allcolors = blue]{hyperref} \DeclareSourcemap{%   \maps[datatype=bibtex]{%     \map{%       \step[fieldsource=author, match=Doe, final]%       \step[fieldset=keywords, fieldvalue=doe]%     }%   }% } \begin{filecontents}{\jobname.bib} @Book{p1,   author =       "A. U. Thor and John Doe",   title =        "A Scientific Article 1",   year =         "1975"   } @Book{p2,   author =       "John Doe",   title =        "A Scientific Article 2",   year =         "1985"   } @Book{p3,   author =       "Joe Bar",   title =        "A Scientific Article 3",   year =         "1995"   } @Book{p4,   author =       "Jane Baz",   title =        "A Scientific Article 4",   year =         "2005"   } \end{filecontents} \addbibresource{\jobname.bib} \begin{document} % Requirement 1: should make citations of Doe bold In \parencite{p4, p1, p2, p3}, ``TD75'' and ``Doe85'' should appear in bold (the semicolon should remain plain).  % Requirement 2: separating bibliographies. IT WORKS. \section{Co-authored Publications} \nocite{*} \printbibliography[keyword=doe,heading=none]  \section{Other Publications} \nocite{*} \printbibliography[notkeyword=doe,heading=none]  \end{document} Ok guys, continuing my passage through edwards... here is the question... thanks for hints/solutions in advance:  Suppose $f(x,y,z)=0$ can be solved for each of the three variables $x,y,z$ as a differentiable function of the other two. Then prove that  $\displaystyle \frac{\partial x}{\partial y} \frac{\partial y}{\partial z} \frac{\partial z}{\partial x} = -1$  Verify this is the case for the ideal gas equation $pv =RT$ where (where $p,v,T$ are the three variables and $R$ is the constant). Logical volume is not mounted but is in use. Please close all applications using this device (eg iscsi) Why is method overloading and overriding needed in java? What are the benefits of modeling in one piece, or as separate parts? Is there any benefit of creating model in one piece or I can create separate pieces and just overlap them to create a visually joint part.  For example, the below image were made from two parts 1. Blade 2. Spinner  Is there any benefit to model them (e.g. extrude from the spinner) or it is actually ok to have them separated since visually I can achieve the same effect (See picture 2) Snap application doesn't see files from another partition I have installed KeePassXC snap package on Ubuntu 17.10. I have multiple linux systems installed on the same drive, so I have made most of my home folders like ~/Documents created as links to a separate ext4 partition (users have same uid so permissions are correct). I tried to open my passwords' database which I have inside Documents, but keepassxc cannot see any files inside Documents. If I put the file in my home folder then it sees it.  Are snap packages able to find files outside from my home folder? Any way to make KeePassXC (and the rest snap packages) access the files at my separate ext4 partition (maybe some configuration somewhere)? Identify a story about a teen boy who learns to use magic with his lizard companion Call to a member function on a non-object So I'm refactoring my code to implement more OOP.  I set up a class to hold page attributes.  class PageAtrributes  {   private $db_connection;   private $page_title;      public function __construct($db_connection)      {         $this-&gt;db_connection = $db_connection;         $this-&gt;page_title = '';     }      public function get_page_title()     {         return $this-&gt;page_title;     }      public function set_page_title($page_title)     {         $this-&gt;page_title = $page_title;     } }   Later on I call the set_page_title() function like so  function page_properties($objPortal) {         $objPage-&gt;set_page_title($myrow['title']); }   When I do I receive the error message:     Call to a member function set_page_title() on a non-object   So what am I missing? How do I convert the coordinates of a click to a tilemap position? How do you turn a tilemap (produced by TileD) for cocos2d where I can click on individual items and get a callback?  Is it just a case of converting captured touch and finding out where it is on the tilemap and then converting that to pixels  -- but that doesn't say what item was clicked on.  I have a tilemap of a city with buildings on it, and I'd like to be able to click or press on a specific building, get a callback.  What would be the best way to accomplish this? Help with completing the proof: Any unbounded sequence is either infinitely large or has a convergent subsequential limit Given $\{x_n\}$ is an unbounded sequence, prove:   $$ \lim_{n\to\infty}x_n = \infty\ \  \text{or}\ \ \lim_{n_k \to \infty} = A $$   In other words any unbounded sequence either infinitely large or has a convergent subsequence.     Everything before udpate section is wrong.  Part 1. Proving $|x_n| &gt; M \implies \lim_{n\to\infty} x_n = \infty$  $\Box$ Start with the definition of an unbounded sequence: $$ \forall M &gt; 0 \in \Bbb R \ \exists N \in \Bbb N: \forall n &gt; N\implies |x_n| &gt; M $$  Suppose that: $$ \lim_{n\to\infty}x_n \ne \infty $$ That means: $$ \forall n\in\Bbb N\ \exists C &gt;0 \in\Bbb R : |x_n| &lt; C $$  Now taking $M^\prime = \max\{M, C\}$ we have that: $$ \begin{cases} \begin{align} \exists N \in \Bbb N : &amp;\forall n&gt;N \implies &amp;|x_n| &gt; M^\prime \\ &amp;\forall n \in \Bbb N: &amp;|x_n| &lt; M^\prime \end{align} \end{cases} $$  So we have arrived to a contradiction which means the assumption is wrong and: $$ \lim_{n\to\infty}x_n = \infty $$ $\Box$     Part 2. It's not clear to me how to prove that if unboundedness does not imply infinity limit then it must imply the existence of a convergent subsequence.   Two questions is my mind:   Is part 1 correct?  How do I proceed with the second part?     I'm using the following definition. $$ \lim_{n\to\infty}x_n = +\infty \stackrel{\text{def}}{\iff} \forall \epsilon &gt; 0 \exists N \in \Bbb N :\forall n &gt; N \implies x_n &gt; \epsilon \\ \lim_{n\to\infty}x_n = -\infty \stackrel{\text{def}}{\iff} \forall \epsilon &gt; 0 \exists N \in \Bbb N :\forall n &gt; N \implies x_n &lt; -\epsilon \\ $$ A sequence is considered infinitely large when: $$ \lim_{n\to\infty}x_n = \infty\ \ \text{when}\ \ \lim_{n\to\infty}x_n = + \infty \ \ \text{or} \ \ \lim_{n\to\infty}x_n = - \infty $$    Update.   Looks like i've messed up a lot of things. I will try once again. As shown in comments and answers the statement holds only in case: $$ \lim_{n\to\infty} |x_n| = \infty \iff \forall \epsilon &gt; 0 \exists N \in \Bbb N: \forall n &gt; N \implies |x_n| &gt; \epsilon $$  Consider the following: $$ \lnot P = \lnot\left(\lim_{n\to\infty}|x_n| = \infty \right) \iff \exists \epsilon &gt; 0\ \forall N_1 \in \Bbb N : \exists n &gt; N_1 \land |x_n| &lt; \epsilon $$  But on the other hand it is given that $x_n$ is unbounded: $$ Q = \forall M &gt; 0\ \exists N_2 \in \Bbb N : |x_{N_2}| &gt; M $$  Construct a negative expression for boundedness: $$ \lnot P = \exists M &gt; 0\ \forall N_2 \in \Bbb N : |x_{N_2}| &lt; M $$  If $S = \lnot P \implies \lnot Q$ then $S = P \lor \lnot Q$  Let $\epsilon = M$, choose $N = \max\{N_1, N_2\}$ then both statements are true and: $$ \exists \epsilon &gt; 0\ \forall N = \max\{N_1, N_2\}: \exists n &gt; N \land |x_n| &lt; \epsilon $$  Now either $P$ is true, which would mean $\lim |x_n| = \infty$, or $\lnot Q$ is true which would mean the sequence is bounded and hence contains a convergent subsequence. Manually clear saved question drafts I've seen lately that new question editing is stored somewhere for later use if we wander off the new question without posting it and then return back to the page. Which is a good functionality addition in it's own right.  What I'd like to also have is the Discard this draft functionality that would clear form data and forget it. Somehow we find an answer in the meantime and the question isn't valid any more.  So having a Discard saved draft or something similar would be a nice contra-functionality to auto-save to remove stored data. The way it's implemented now seems too hidden hidden and unpredictable to users.  Additional edit  When adding hidden auto functionality usually means creating the opposite as well by either giving the possibility to preference of not having automatism at all or giving the possibility to clear what's been auto saved.  Let's see how GMail doesn't work (and I think we all agree that from UX perspective it does the job as expected:   User clicks Compose message User starts writing a new email message User decides to not send the message and checks their inbox User clicks Compose message again A clean form is presented to user (old one being part of drafts)   I'm not suggesting we should have something like Saved drafts but we surely should have the possibility to clear previous question draft.  Since this new functionality was introduced I should point out that I would use the discard functionality more frequently than the saved one. I do welcome saving messages, but discarding of saved drafts is anything but a rare situation one might want to do. It wouldn't be a problem if this was a 1% against 99%. To me it's more like 50/50.  Best possible solution  When providing saved drafts there should (from the UX perspective) be the opposite functionality as well. Namely discarding of it. But first thing we should be asking ourselves is:    do users more frequently need pre-filled saved question draft or do users more frequently need empty form with the possibility to populate it with a saved draft   User testing should provide the usage frequency between the two and the one that's more likely to happen (my guess is that there would be a big difference between the two) should be implemented. So one of these:   Pre-populate question fields with saved draft on question form load, while also providing a button to clear the draft and start writing anew without the need to manually clear all the fields (which would be the optimal solution in case of a single field form) Question form should always load empty while also having a button that would pre-populate it with a saved draft.   I think this would be the best consensus related to saved question drafts and their usage. But as we've seen this issue has been swept under the rug for an indefinite time. I have some troble understanding the Kernel density estimation.  If a consider the next example:  s&lt;-0 z&lt;-density(rnorm(25)) f&lt;-function(i)approx(z$x,z$y,xout=i)$y for(i in seq(min(z$x),max(z$x),length.out = 10000)) s&lt;-s+f(i) s   I expected getting that s is approximately equals to one since I am considering an approximation for the integral of the Kernel density function (that I suppose is also a density). However, I don't get the expected result. Why it doesn's sum one?  The idea behind this is that I wanted to use the Kernel as the density of my data points. I was interpolating to get my explicit function and use with other x values. Or do you know another way to get a density function estimated by fitting? Convert XML/HTML Entities into Unicode String in Python Have Peter Capaldi's previous acting roles in the Doctor Who universe ever been addressed? Similar to this question posted in August 2014:       Has the fact that  (as  in The Fires of Pompeii, and  in Torchwood’s Children of Earth season) yet been addressed/explained either in, or out of universe? This morning, I read Wikipedia's informal definition of a limit:     Informally, a function f assigns an output $f(x)$ to every input $x$. The   function has a limit $L$ at an input $p$ if $f(x)$ is "close" to $L$ whenever   $x$ is "close" to $p$. In other words, $f(x)$ becomes closer and closer to $L$   as $x$ moves closer and closer to $p$.   To me that sounds like something that might be better described as a 'target'.  If I take a simple function, say one that only multiplies the input by $2$; and if my limit is $10$ at an input $5$: then I've described something that seems to match the elements contained in Wikipedia's definition. I don't believe that that's right. To me it looks like an elementary-algebra problem ($2p = 10$). To make it more calculusy, I could graph the function's output when I use inputs other than $p$, but that really wouldn't give me anything but an illustration of the fact that one's answer moves farther from the right answer as it becomes more wrong (go figure).   So limits are important; what I've just described is trivial. I do not understand them. I know calculus is often used for solving real-world challenges, and that limits are an important element of calculus, so I assume there must be some simple real-world examples of what it is that limits describe.   What is a simple example of a limit in the real world?  Thank you  -Hal. I am trying to add a timed delay in a C++ program, and was wondering if anyone has any suggestions on what I can try or information I can look at?  I wish I had more details on how I am implementing this timed delay, but until I have more information on how to add a timed delay I am not sure on how I should even attempt to implement this. If $f$ is integrable then $|f|$ is also integrable Show that if $f$ is integrable on $[a, b]$ then $\lvert f \rvert$ is also integrable. Hint: Show that $$U (P , \lvert f \rvert) − L(P , \lvert f \rvert) ≤ U (P , f ) − L(P , f ).$$ I have: $$U (P , \lvert f \rvert) \ge U (P , f )$$ and $$ L(P , \lvert f \rvert) \ge L(P,f)$$ Thus, $$U (P , \lvert f \rvert) − L(P , \lvert f \rvert) ≤ U (P , f ) − L(P , f ).$$ Which process scheduler is my linux system using? I'm not quite sure if stackoverflow or serverfault is the forum to use for this question, but ill try here.  Is there some command I can use or a file I can check in order to find out which process scheduler I'm using on my Linux system? I am not looking for the I/O scheduler, but the process scheduler, and please, do not refer to guides or howtos for what a scheduler is, what I'm simply asking is if there is a command or file I can run/check to see this. I could check the doc for my kernel but again I'm just wondering if there is a command or file i can check.  I might have been a little redundant above but that's because the posts I've seen people seem to confuse process scheduler with the i/o scheduler, and they don't seem to answer the actual question, just provide links to what a scheduler is which is not what I'm after here, so apologies if the above comments sounded rude.