"Notepad++ (Install) 7.3.3" looks to be the better one based on the number of downloads, but why is there also "Notepad++ 7.3.3" ?
example:   Does Chocolatey run the native program installer? If I prefer simplicity, should I avoid packages with (Install) in their name?
Prevent specific sites from being overrepresented in the hot questions list Some sites appear far more often in the hot questions list than other sites. I don't have any hard data on that, as that kind of data is just not publicly available, but I'm pretty sure my subjective impression on that is reasonably accurate.  Those sites don't appear more often because they are inherently more interesting, but because they have certain voting and answering patterns that favor them in the hot questions algorithm. I would argue that the goal of the hot questions list is to present questions from a large variety of SE sites to the whole network, and to show possibly interesting questions to users that would not have found them otherwise.   To achieve this goal, the spots in the hot questions list should be distributed among all SE sites. The algorithm should try to get a good sampling of all sites, and it should try to normalize the results for varying voting behaviour. At the moment, sites that intrinsically get more votes and more answers per question seem favored in the algorithm.  So I think one part of the algorithm should try to identify questions that get an unusally high amount of votes and views for that site, and give the smaller sites a chance this way.  I'm not sure on how exactly this weighting should be done, as a complete normalization would likely not work across the huge difference in scale for all the SE sites.  As a specific example that the current algorithm is broken I'll present . I don't think any site should occupy a third of the whole list.   Here's another instance where one site is overrepresented at the top of the list: How many times can I benefit from Advantage if I attack multiple times while not seen? A hidden ranger with Extra Attack attacks a surprised creature. Do both attacks benefit from Advantage, or just the first one?  If the ranger used Horde Breaker on another creature, would this attack benefit from Advantage? I'm working on the following problem set.  Let $\mathcal{H}$ be a Hilbert space and $A$ and $B$ orthogonal subspaces of $\mathcal{H}$.  Prove or disprove:  1) $A \oplus B$ is closed, then $A$ and $B$ are closed.  2) $A$ and $B$ are closed, then $A \oplus B$ is closed.  I could prove 1) and if my proof is correct, it even holds if $\mathcal{H}$ is just an inner product space.  Unfortunately, I can't manage to prove 2). Since $\mathcal{H}$ is by assumption a Hilbert space and I didn't use that fact to prove 1), I should probably use it here.  It means that $A$ and $B$ are also complete. Given some convergent sequence in $A \oplus B$, I want to show that the limit is also in  $A \oplus B$. Here I'm stuck. I want to use the completeness of $A$ and $B$, but I don't see how to obtain suitable Cauchy sequences.  Can anyone drop me a hint? Or is my approach all wrong? What is the fastest, easiest tool or method to convert text files between character sets?  Specifically, I need to convert from UTF-8 to ISO-8859-15 and vice versa.  Everything goes: one-liners in your favorite scripting language, command-line tools or other utilities for OS, web sites, etc.  Best solutions so far:  On Linux/UNIX/OS X/cygwin:   Gnu  suggested by  is best used as a filter. It seems to be universally available. Example:  $ iconv -f UTF-8 -t ISO-8859-15 in.txt &gt; out.txt   As pointed out by , there is an . Gnu  () suggested by  will convert one or several files in-place. Example:  $ recode UTF8..ISO-8859-15 in.txt   This one uses shorter aliases:  $ recode utf8..l9 in.txt   Recode also supports surfaces which can be used to convert between different line ending types and encodings:  Convert newlines from LF (Unix) to CR-LF (DOS):  $ recode ../CR-LF in.txt   Base64 encode file:  $ recode ../Base64 in.txt   You can also combine them.  Convert a Base64 encoded UTF8 file with Unix line endings to Base64 encoded Latin 1 file with Dos line endings:  $ recode utf8/Base64..l1/CR-LF/Base64 file.txt    On Windows with  ():    PS C:\&gt; gc -en utf8 in.txt | Out-File -en ascii out.txt  (No ISO-8859-15 support though; it says that supported charsets are unicode, utf7, utf8, utf32, ascii, bigendianunicode, default, and oem.)   Edit  Do you mean iso-8859-1 support? Using "String" does this e.g. for vice versa  gc -en string in.txt | Out-File -en utf8 out.txt   Note: The possible enumeration values are "Unknown, String, Unicode, Byte, BigEndianUnicode, UTF8, UTF7, Ascii".   CsCvt -  is another great command line based conversion tool for Windows. nodes near coords with logarithmic axis: Wrong values I created a horizontal bar plot to compare benchmark times. Since one of the tested components is really slow, I need a logarithmic y axis for the other values to be distinguishable. Combined with "nodes near coords" this results in the calculated values showing, instead of the original ones. Is there any way to fix this?  What it looks like:   What the values(!) should look like:   Clearly, I'm overlooking something terribly obvious. I'm just a beginner at PGFPlots, so please don't kill me. :)  MWE:  \documentclass[fontsize=12pt]{scrartcl}  \usepackage{pgfplots} \pgfplotsset{compat=1.8}  \begin{document}   \begin{tikzpicture}   \begin{axis}[      width=12.5cm,     xbar=0.1cm,     xmin=0,     y=0.6cm,     bar width=0.4cm,     xlabel={Time (ms)},     xmode=log,     major x tick style = transparent,     major y tick style = transparent,     symbolic y coords={       {SpreadsheetGear},       {Aspose.Cells},       {NPOI},       {C1.Excel},       {Spire.XLS},       {GemBox.Spreadsheet},       {SmartXLS},     },     ytick=data,     y dir = reverse,      nodes near coords,     nodes near coords align={horizontal},   ]    \addplot coordinates {       (3078.6,{Aspose.Cells})       (10059.2,{C1.Excel})       (28794.8,{GemBox.Spreadsheet})       (7437079.8,{SmartXLS})       (19975.2,{Spire.XLS})       (573.2,{SpreadsheetGear})       (10025.2,{NPOI})};   \end{axis}   \end{tikzpicture} \end{document} Multiplying by a $1\times 1$ matrix? For matrix multiplication to work, you have to multiply an $m \times n$ matrix by an $n \times p$ matrix, so we have $$\bigg(m \times n\bigg)\bigg(   n\times p \bigg).$$  But what about a $1 \times 1$ matrix? Is this just a scalar? But every matrix can be mulitplied by a scalar; so do $1 \times 1$ matrices break the rule? 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? Theorem numbering I am trying to number my theorems, corollaries, Lemmas, Propositions, Definitions, Remarks etc. I put the following code:  \theoremstyle{theorem}  \newtheorem{theorem}{Theorem}[section] \newtheorem{corollary}{Corollary}[theorem] \newtheorem{lemma}[theorem]{Lemma} \newtheorem{proposition}[theorem]{Proposition}  \theoremstyle{definition} \newtheorem{definition}{Definition}[section] \newtheorem{example}{Example}[definition]  \theoremstyle{remark}     \newtheorem{remark}{Remark}[section]   I want to produce the following:  theorem 1.1  proposition 1.2  definition 1.3  example 1.4  remark 1.5  lemma 1.6  but the code above gives me  theorem 1.1  definition 1.1  remark 1.1  lemma 1.2  Can anyone tell me if there is a code that numbers all these respectively? The company I work for makes hardware that communicates to the computer though a serial port. Third party companies write software that communicates with our hardware.   There are times when I need to diagnose our hardware. However, a third party software app connects to the serial port when Windows starts up, blocking any other connection. I don't know the name of this application/service and it's not always the same one.  Is there any way to either:   Find the name/pid of the app/service that is currently using a given serial port or Steal the serial port connection from another app.   vb.net preferably, but I'll take a language agnostic answer as well. Intersection of three vector subspaces We say that two vector subspaces $U,W\subset V$ intersect transversally (written $U\pitchfork W$) if $U+W=V$.  Let $V_1,V_2,V_3$ be vector subspaces of $V$ where $\dim V=n$. We say they intersect normally if $V_i\pitchfork(V_k\cap V_l)$  for $i\ne k,l$. Prove that $V_1,V_2,V_3$ intersect normally if  the following condition holds:  $\operatorname{codim}(V_1\cap V_2\cap V_3)=\operatorname{codim} V_1+\operatorname{codim} V_2+\operatorname{codim} V_3,$   where $\operatorname{codim} V_i=n-\dim V_i$.  How to approach this problem? I tried to order dimensions of $V_i$ but I got that the LHS is $\ge n-\min (\dim V_i,i=1,2,3)$ and the RHS is $\le 3( n-\min (\dim V_i,i=1,2,3))$ which does not lead anywhere. What is the right way to do this? How can I undo git reset --hard HEAD~1? dpkg: error: cannot scan updates directory `/var/lib/dpkg/updates/' I want to install a package in Ubuntu 14.04, but every time I run the ./configure command it gives me this error:  E: Cannot get debconf version. Is debconf installed? debconf: apt-extracttemplates failed: No such file or directory Extracting templates from packages: 35%E: Cannot get debconf version. Is debconf installed? debconf: apt-extracttemplates failed: No such file or directory Extracting templates from packages: 70%E: Cannot get debconf version. Is debconf installed? debconf: apt-extracttemplates failed: No such file or directory Extracting templates from packages: 100% dpkg: error: cannot scan updates directory `/var/lib/dpkg/updates/': No such file or directory E: Sub-process /usr/bin/dpkg returned an error code (2) Why does paper become translucent when smeared with oil but not (so much) with water? When I smear oil onto a scrap of paper and rub it in, the paper becomes quite translucent; but when I attempt the same with water it doesn't as much. Why? Why did the gamma ray burst from GW170817 lag two seconds behind the gravitational wave? , reporting on the announcement of gravitational wave GW170817, explained that for the first time we could identify the precise source of a gravitational wave because we also observed the event in the electromagnetic spectrum. It notes however that the gamma ray burst detected by the FERMI space telescope was observed nearly two seconds later than the gravitational wave.   Did the gamma ray burst actually arrive at Earth two seconds after the gravitational wave, or is this time delay just some kind of observational artefact? If the delay is real, what is its cause? Is the delay due to the gamma ray burst somehow being slowed, or was it 'emitted' at a different time in the merger event? What does a delay even mean when the gravitational wave was detected for over 100 seconds? Is it a delay from peak GW to peak gamma ray? I can seem to run scripts (.sh) with and without them being set as executable. So where exactly this matters? How to cluster time series? I have a question about cluster analysis. There are 3000 companies, which have to be clustered according to their power usage over 5 years. Each company has values for every hour during 5 years. I would like to find out if some companies have the same pattern in usage power over the time period. The results should be used for daily prediction of power usage. If you have some ideas how to cluster time series in SPSS, please share with me. python get only class attribute no superclasses Let $W^{1,p}(U)$ be the Sobolev space. Suppose that $U$ is connected bounded domain in $\mathbb{R}^n$ and $u \in W^{1,p}(U)$ satisfies $Du=0$ a.e. in $U$. How can I prove that $u$ is constant a.e. in $U$? I am currently developing an RPG game with a classic experience-points and levelup mechanic. The player kills monsters, gains experience points, levels up when they collect enough and become stronger.  How do I balance the amount of Exp points necessary for reaching each level and the amount of Exp awarded by each monster on each level? How to compute the determinant of a tridiagonal matrix with constant diagonals? How to show that the determinant of the following $(n\times n)$ matrix  $$\begin{pmatrix} 5 &amp; 2 &amp; 0 &amp; 0 &amp; 0 &amp; \cdots &amp; 0 \\ 2 &amp; 5 &amp; 2 &amp; 0 &amp; 0 &amp; \cdots &amp; 0 \\ 0 &amp; 2 &amp; 5 &amp; 2 &amp; 0 &amp; \cdots &amp; 0 \\ \vdots &amp; \vdots&amp; \vdots&amp; \vdots &amp; \vdots &amp; \vdots &amp; \vdots \\ 0 &amp; \cdots &amp; \cdots &amp; 0 &amp; 2 &amp; 5 &amp; 2 \\ 0 &amp; \cdots &amp; \cdots &amp; \cdots &amp; \cdots &amp; 2 &amp; 5 \end{pmatrix}$$  is equal to $\frac13(4^{n+1}-1)$?    More generally:     How does one compute the determinant of the following  (where the three diagonals are constant)?      $$M_n(a,b,c) = \begin{pmatrix} a &amp; b &amp; 0 &amp; 0 &amp; 0 &amp; \cdots &amp; 0 \\ c &amp; a &amp; b &amp; 0 &amp; 0 &amp; \cdots &amp; 0 \\ 0 &amp; c &amp; a &amp; b &amp; 0 &amp; \cdots &amp; 0 \\ \vdots &amp; \vdots&amp; \vdots&amp; \vdots &amp; \vdots&amp; \vdots &amp; \vdots \\ 0 &amp; \cdots &amp; \cdots &amp; 0 &amp; c &amp; a &amp; b \\ 0 &amp; \cdots &amp; \cdots &amp; \cdots &amp; \cdots &amp; c &amp; a \end{pmatrix}$$      Here $a,b,c$ can be taken to be real numbers, or complex numbers.   In other words, the matrix $M_n(a,b,c) = (m_{ij})_{1 \le i,j \le n}$ is such that $$m_{ij} = \begin{cases} a &amp; i = j, \\ b &amp; i = j - 1, \\ c &amp; i = j + 1, \\ 0 &amp; \text{otherwise.} \end{cases}$$  There does not seem to be an easy pattern to use induction: the matrix is not a diagonal  of the type $M = \bigl(\begin{smallmatrix} A &amp; C \\ 0 &amp; B \end{smallmatrix}\bigr)$ (where we could use $\det(M) = \det(A) \det(B)$ for the induction step), and there are no lines or columns with only one nonzero entry, so  gets complicated quickly.  Is there a general pattern that one could use? Or is the answer only known on a case-by-case basis? It's possible to compute the determinant by hand for small $n$:  $$\begin{align} \det(M_1(a,b,c)) &amp; = \begin{vmatrix} a \end{vmatrix} = a  \\ \det(M_2(a,b,c)) &amp; = \begin{vmatrix} a &amp; b \\ c &amp; a \end{vmatrix} = a^2 - bc \\ \det(M_3(a,b,c)) &amp; = \begin{vmatrix} a &amp; b &amp; 0 \\ c &amp; a &amp; b \\ 0 &amp; c &amp; a \end{vmatrix} = a^3 - 2abc \end{align}$$  But there is no readily apparent pattern and the computation becomes very difficult when $n$ gets large.