Why does not http call /usr/bin/http instead of /usr/local/bin/http?
Why does bash say No such file or directory when the file is on the path
How to install Gnome 3 without breaking Unity? I tried installing gnome 3 , but it broke Unity and I had to reinstall Natty from scratch.  Does anyone know if there is a way to install Gnome 3 without breaking Unity? How to generate all permutations of a list? How do I debug Node.js applications? I'm having exactly the same issue as , also using Biber 2.14, albeit I didn't upgrade, downgrade, change TexLive version, change encoding or (seemingly) do anything. It's like Biber suddenly quit parsing dates on me.  Whether the bibfile is encoded in ASCII or UTF-8 makes no difference. Whether the date is a short format or the full YYYY-MM-DD makes no difference. I'm not sure what else to test.  Here's a MWE and the associated .blg file:  \begin{filecontents}{mwe.bib}     @Article{JD2020,         author       = {John Doe},         title        = {A Title},         date         = {2020-01-01},         %date       = {2020}         journaltitle = {Journal},     } \end{filecontents}  \documentclass{article} \usepackage{biblatex} \addbibresource{mwe.bib}  \begin{document}     test\autocite{JD2020}     \printbibliography \end{document}   [1] Config.pm:304&gt; INFO - This is Biber 2.14 [1] Config.pm:307&gt; INFO - Logfile is 'mwe.blg' [154] biber-darwin:322&gt; INFO - === Thu Apr 30, 2020, 11:04:33 [185] Biber.pm:415&gt; INFO - Reading 'mwe.bcf' [354] Biber.pm:943&gt; INFO - Found 1 citekeys in bib section 0 [384] Biber.pm:4256&gt; INFO - Processing section 0 [385] Utils.pm:75&gt; INFO - Globbing data source 'mwe.bib' [385] Utils.pm:91&gt; INFO - Globbed data source 'mwe.bib' to mwe.bib [401] Biber.pm:4455&gt; INFO - Looking for bibtex format file 'mwe.bib' for section 0 [402] bibtex.pm:1653&gt; INFO - LaTeX decoding ... [406] bibtex.pm:1471&gt; INFO - Found BibTeX data source 'mwe.bib' [437] Utils.pm:304&gt; WARN - Entry 'JD2020' (mwe.bib): Invalid format '2020-01-01' of date field 'date' - ignoring [457] UCollate.pm:68&gt; INFO - Overriding locale 'en-US' defaults 'normalization = NFD' with 'normalization = prenormalized' [457] UCollate.pm:68&gt; INFO - Overriding locale 'en-US' defaults 'variable = shifted' with 'variable = non-ignorable' [457] Biber.pm:4084&gt; INFO - Sorting list 'nty/global//global/global' of type 'entry' with template 'nty' and locale 'en-US' [457] Biber.pm:4090&gt; INFO - No sort tailoring available for locale 'en-US' [461] bbl.pm:652&gt; INFO - Writing 'mwe.bbl' with encoding 'UTF-8' [463] bbl.pm:755&gt; INFO - Output to mwe.bbl [463] Biber.pm:128&gt; INFO - WARNINGS: 1   The \printbibliography output actually looks like this: [1] John Doe. “A Title”. In: Journal ().  In my actual thesis, all the dates are gone from the pdf output. Lattices are congruence-distributive How to create an Atlas based on point attributes? Essentially I am wanting to produce an atlas based on a categorical field in a point layer.   i.e. I have a point layer of childcare providers with the categorical field "Provision". I've categorized each feature in this field with "After School Club" , "Breakfast Club" etc, and I now want to produce a set of maps that iterate through each category and show only the points for each. One map of after school clubs, one map of breakfast clubs etc. The extents might be subtly different.  I could do it one by one but it seems like there should be a way to produce an atlas based on the extents of each category? (I do feel i'm missing something obvious :) )   Or alternatively is there a way of automating the creation of a polygon layer and using that as a hidden coverage for the atlas?  EDIT: I've made a little progress with this  - you can use rule based styling to switch on and off features relevant to the current atlas coverage feature.  it actually works fine if all you want to do is show a different set of points. I'm now looking at tying that back to a color scheme and reactive legend. Grandi's Series; tends to $1/2$, but why is this considered a valid sum? Grandi's series,  $$1+1-1+1-1+1-1+...$$  can be expressed as the below:  $$\sum_{n=0}^\infty(-1)^n$$  Two valid sums that make sense to me are $1$, and $0$, depending on how you approach the series. $(1+1)-(1+1)-(1+1)-...=0$, and $1+(1-1)+(1-1)+(1-1)+...=1$.  There is consensus, however, that the actual sum is $\frac{1}{2}$. Why? I understand the approach of finding partial means of the series, and they do indeed tend to $\frac{1}{2}$, but it seems unintuitive to assert that the sum is neither $1$ or $0$.  A more convincing method I found was assuming the series is $S$, then shifting it such that $S-1 = S$, then through algebra finding $S = \frac{1}{2}$, but again, it seems more intuitive answer is either $0$ or $1$. I say this strictly because adding and subtracting integers should equal an integer, never a fraction.  Is this a characteristic of infinite series, which is not specific to Grandi's series? Counter example for $(A \times B) \cap (C \times D) = (A \cap C ) \times (B \cap D)$ Exposing database IDs - security risk? I've heard that exposing database IDs (in URLs, for example) is a security risk, but I'm having trouble understanding why.  Any opinions or links on why it's a risk, or why it isn't?  EDIT: of course the access is scoped, e.g. if you can't see resource foo?id=123 you'll get an error page. Otherwise the URL itself should be secret.  EDIT: if the URL is secret, it will probably contain a generated token that has a limited lifetime, e.g. valid for 1 hour and can only be used once.  EDIT (months later): my current preferred practice for this is to use UUIDS for IDs and expose them. If I'm using sequential numbers (usually for performance on some DBs) as IDs I like generating a UUID token for each entry as an alternate key, and expose that. line of mathematicians guess their own hat color out of c colors There is a common problem in which a long line of N mathematicians are each given a hat that is either red or blue.  They cannot see their own hat but can see all in front of time and can hear any response. They must state their own hat color from the back of the line forwards and no information may be passed besides their guess.  They may have a planning session in advance.  What is the maximum number of correct guesses can they guarantee?  The answer is (look away if you don't know) $N-1$.  If, instead of 2 colored hats, we use $c$ different colored hats, how many can we guarantee?  Assuming $N&gt;&gt;c$  I believe the answer to be $N-c+1$ and have confirmed this for $c=2, 3$, and $4$.  I believe this should be simple to prove by using the concept of "$x$ formulas allow you to solve for $x$ variables" but I am not well versed enough in pure mathematics to answer this. A reward becomes a penalty if I am working to build a reinforcement agent with DQN. The agent would be able to place buy and sell orders for a day trading purpose. I am facing a little problem with that project. The question is "how to tell the agent to maximize the profit and avoid the transaction where the profit is less than 100$".  I want to maximize the profit inside a trading day and avoid to place the pair (limit buy order, limit sell order) if the profit on that transaction is less than 100$. The idea here is to avoid the little noisy movements. Instead, I prefer long beautiful profitable movements. Be aware that I thought using the "Profit &amp; Loss" as the reward.  "I want the minimal profit per transaction to be 100$" ==> It seems this is not something that is enforceable. I can train the agent to maximize profit per transaction, but how that profit is cannot be ensured.  At the beginning, I wanted to tell the agent, if the profit of a transaction is 50 dollars, I will remove 100 dollars, then It becomes a penalty of 50 dollars for the agent. I thought it was a great way to tell the agent to not place a limit buy order if you are not sure it will give us a minimal profit of 100$. It seems that all I would be doing there is simply shifting the value of the reward. The agent only cares about maximizing the sum of rewards and not taking care of individual transactions.   How to tell the agent to maximize the profit and avoid the transaction where the profit is less than 100$? With that strategy, what guarantee that the agent will never make a buy/sell decision that results in less than 100 dollars profit? Does the sum of reward - # transaction * 100 can be a solution? Is there a website with historical temperatures and weather data? I am interested in hiking this fall in France and camping along the way. In order to figure what gear I need to pack to camp (particularly for the sleeping bag), I would like to know what temperatures to expect.  I am interested in historical temperatures to figure the usual temperature and I might look at them for other seasons. If that matters, I am thinking about hiking in the Pays Basque (South West of France), the mountainous part.  Where (ideally online and for free) can I find such data? Are there resources that cover Europe, or even the whole world? Changing email addresses on my @me.com and @icloud.com How do you disable anonymous login? Find count of all combination of numbers whose sum is x How to prove $\hat{p}|x\rangle=i\hbar\frac{\partial}{\partial x}|x\rangle$,using $[\hat{x},\hat{p}]=i\hbar$? How to prove $$\hat{p}|x\rangle=i\hbar\frac{\partial}{\partial x}|x\rangle,$$ using $$[\hat{x},\hat{p}]=i\hbar~?$$ The question seems to be uncomplete because for any $f(x)$ $$[\hat{x},\hat{p}+f(x)]=i\hbar.$$ But that's my homework. Can someone add some appropriate assumptions and prove the question?  Here is a seemingly right answer:  $$ \hat{Q} = e^{-i \frac{u}{\hbar} \hat{p}},[\hat{x},\hat{Q}]=u \hat{Q} $$ $$ \hat{x}\hat{Q}|x\rangle = (x+u)\hat{Q}|x\rangle $$ $$ \hat{Q}|x\rangle = |x+u\rangle $$ $$ \hat{T} = e^{i \frac{u}{\hbar} \hat{x}},[\hat{p},\hat{T}]=u \hat{T} $$ $$ \hat{p}\hat{T}|p\rangle = (p+u)\hat{T}|p\rangle $$ $$ \hat{T}|p\rangle = |p+u\rangle $$  Therefore  $$ \langle x | p \rangle = e^{i\frac{px}{\hbar}} \langle 0 |_x |0 \rangle_p $$  $$ \delta(p-p') = \langle p | p' \rangle  = 2\pi \hbar |\langle 0 |_x |0 \rangle_p|^2 \delta(p-p') $$ $$ \langle 0 |_x |0 \rangle_p = \sqrt{\frac{1}{2 \pi \hbar}}$$ $$ \hat{p}|x\rangle = \int \hat{p} |p\rangle\langle p |x\rangle= \int \hat{p} |p\rangle e^{-i\frac{px}{\hbar}}\sqrt{\frac{1}{2 \pi \hbar}} = i\hbar\frac{\partial}{\partial x}|x\rangle $$ Which assumption is made here? Removing leading zeroes from a field in a SQL statement I am working on a SQL query that reads from a SQLServer database to produce an extract file. One of the  requirements to remove the leading zeroes from a particular field, which is a simple VARCHAR(10) field. So, for example, if the field contains '00001A', the SELECT statement needs to return the data as '1A'.  Is there a way in SQL to easily remove the leading zeroes in this way? I know there is an RTRIM function, but this seems only to remove spaces. I'm trying to get through Spivak's Calculus on my own and even though I kinda understand induction I'm not so sure that's the case when it comes to complete induction. So I tried to do a starred problem which involves using it. But I'm not sure that my proof is valid, can someone check this for me?  So the problem is that I have to prove that     For every natural $n&gt;1$, if $n$ is not prime we can write it as a product of primes.   I'm starting with a base case. For $n=2$, $n$ is prime, so the assumption holds.  Let's assume that for some $n &gt; 1$ and also all numbers $p &lt;= n$ the assumption holds.  Then $n+1 = cd$. If $n+1$ is not prime, then $c &lt; n+1$ and $d &lt; n+1$, but as they are natural numbers, we can also write that $c &lt;= n$ and $d &lt;= n$. But we assumed that if $p &lt;= n$, and $p$ is not prime, we can write it as a product of primes. So if $c$ or $d$ are not primes, we can write them as a product of primes. That means that $n+1$ can be written as a product of primes if it's not prime, which completes the proof. What is a complete list of the usual assumptions for linear regression? I want to compile my program with the latest version of gcc.  Ubuntu 14.04 comes with gcc 4.8.2, however there's 4.9.0 available, moreover, I see that it is available as a package: . I tried to install it  sudo apt-get install gcc-4.9   but it says  Reading package lists... Done Building dependency tree        Reading state information... Done Note, selecting 'gcc-4.9-base' for regex 'gcc-4.9' gcc-4.9-base is already the newest version. 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   Looks like it is already installed, just not as the default one? How do I utilize it to build my program?