There is a great need for a Robust DateTime parser library for .NET, prefer C# DateTime.TryParse supports very few formats I know the question has been asked a year ago but with no good answer. There must be good libs out there! Commercial or open source  I looked at . But blog says it does not do parsing yet  Dates fall into two categories:  Date formats:   All the various date formats   2011-09-09T20:00:00 29 September 2011 6 September 2011  7:00pm 1/1/2009, 12:00PM   Natural Dates:  How a Human would say/write it   Today Tomorrrow Mondays, 6PM Every Monday, 6PM Every Friday First Monday of every month Last Sunday of the month Everyday 1st of the Month
Does anyone know of a .NET date/time parser similar to  (handles stuff like "tomorrow" or "3pm next thursday")?  Note: I do write Ruby (which is how I know about Chronic) but this project must use .NET.
Is there a general method (which can be implemented by hand) to finding the $n$-th roots of $2 \times 2$ matrices? Is there a similar method for a general $m \times m$ matrix? (for $n &gt; 1$ and $n\in\mathbb{Z}$) Change cursor color after log out on ubuntu 18.04.2 LTS I've set my cursor color on gnome-tweaks to be DMZ-Black, which works fine when I log in and lock the computer. But, after I log out, the cursor color changes to white.  Is there a way to change the color of the cursor after log out?  My gnome-tweaks setting: Why are date-based hats awarded too early? I just got the  hat which states "post or vote on December 21".  Does SE have a time machine now? Number of solutions of $x_1+2x_2+\cdots+kx_k=n$? Suppose $n$ be a given positive integer. Then the Diophantine equation $x=n$ has only $1$ solution. Just by inspection, I found that the Diophantine equation $x+2y=n$ has $\left\lfloor \dfrac{n}{2}+1\right\rfloor$ non-negative solutions for $(x,y).$ Also, according to  the Diophantine equation $x+2y+3z=n$ has $\left\lfloor \dfrac{n^2}{12}+\dfrac{n}{2}+1 \right\rfloor$ non-negative solutions for $(x,y).$  Is there any closed form for the number of non-negative integer solutions for $(x_1,x_2,\cdots,x_k)$ of $$x_1+2x_2+3x_3+\cdots+kx_k=n$$ for a given $k\in\Bbb{N}$? How can I prove these formulas rigorously?  EDIT After a very tedious calculation I found that the equation $w+2x+3y+4z=n$ has  $\left\lfloor \dfrac{n^3}{144}+\dfrac{5n^2}{48}+\dfrac{(15+(-1)^n)n}{32}+1 \right\rfloor$ solutions. This solution completely agree with the approximation given by Rus May. However still I believe that we can do something more than this. I'm trying to find a discontinuous linear functional into $\mathbb{R}$ as a prep question for a test. I know that I need an infinite-dimensional Vector Space. Since $\ell_2$ is infinite-dimensional, there must exist a linear functional from $\ell_2$ into $\mathbb{R}$. However, I'm having trouble actually coming up with it.   I believe I'm supposed to find an unbounded function (although I'm not sure why an unbounded function is necessarily not continuous; some light in that regard would be appreciated too), so I thought of using the vectors $e^i$, which have all entries equal to zero, except for the $i$-th one. Then, you can define $f(e^i)=i$.  That'd be unbounded, but I'm not sure if it'd be linear, and even if it is, I'm not sure how to define it for all the other vectors in $\ell_2$.   A friend mentioned that at some point the question of whether the set $E=\{e^i:i\in\mathbb{Z}^+\}$ is a basis would come up, but I'm not sure what a basis has to do with continuity of $f$.   I'm just learning this topic for the first time, so bear with me please.   The space of sequences that are eventually zero (suggested by a few people) turned out to be exactly what I needed.  It also helped to cement the notions of Hamel basis, not continuous, etc. How to setup a restricted SFTP server on Ubuntu? "'Hello', says he. 'Hello', says I" — is this correct? I'm reading a novel in which once in a while a character says something like "I are", "He do", and similar stuff. I understand the author is just reproducing the way people talk on the streets.  However I've found a piece of text of which I'm not sure if it's proper English. One of the characters, who almost always speaks proper English, is reproducing a conversation that happened many years ago using the present tense in the following manner:     I was with this guy and "Hi", says he, "how are you", says I...   and so on.  My question is if the "says I" is proper English (a special case in which "I" is treated as a third person because we are relating in present tense something that happened in the past) or it's just kind of slang.  I was also a bit surprised by how the usual order is switched ("says he" instead of "he says") but to me it's secondary to the "says I" issue. How do I find this limit: $\lim_{n\to\infty} \left[ n-{n\over e}\left(1+{1\over n}\right)^n \right]$? I'm working on a practice exam for my masters quals and I am having difficulties with the following limit. According to wolfram alpha, it's value is 1/2. Does anyone know how to find this limit?   $$\lim_{n\to\infty} \left[ n-{n\over e}\left(1+{1\over n}\right)^n \right].$$ I have been racking my brain to understand the solutions of constrained stars and bars problems like:  $a+b+c+d = 19$;  $a,b,c,d \in \{0,1,2,3,4,5,6,7\}$  Finding the total number of solutions is really simple $\dbinom{22}{3}$.   What to do after that? I want to understand the entire procedure step by step.   Please do not mark it as a duplicate of .  Reasons:   The accepted answer's trick doesn't always work.   Another person (the answer with two upvotes) has just listed out the binomial coefficients and I can't even remotely understand what he has tried to do.   The second answer isn't my cup of tea. How are questions in the 'hot' tab on a site selected? 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. Proving that a number with digits 1...9 in some order, ending in 5, is not a perfect square. If "x" is a 9 digit number , which contains digits from 1 to 9 which ends in 5 . Prove that it can't be a perfect square ( digits are not to be repeated).  Please suggest the solution of this question. Show "Insufficient Privileges" directly when clicking 'Edit' (override), not on 'Save' If a user clicks 'Edit' on an opportunity which he isn't allowed to edit, the "Insufficient Privileges" page directly appears. This is good. If a user clicks 'Edit' on a custom object (which has an edit override that points to a visualforce page), he first sees the form without problems, and the "Insufficient Privileges" page only appears when he tries to save it. This behaviour is misleading for the users, because they think they can manipulate the data and put effort into it, and only afterwards they realize that this wasn't possible after all.  An idea was to check at page load if the user has edit permissions and otherwise redirect him to the "Insufficient Privileges" page.  Might there be another way? Thanks! How do I create a reflective white material? I'm pretty new to this and this is my first question here, any help would be greatly appreciated.  So basically what I want to achieve is a floor material as seen in this photo...    ...the reflections are very crisp but dim.  With a glossy shader I get the following results:    First picture: reflections are blurry  Second picture: roughness of the material looks right but reflection is bright red  Third picture: If tinted in any other color than white, it seems to produce the result I want. Reflection is sharp and gets tinted blue. What I need is the reflection to be tinted white.  Thanks for any help. We just bought a Lenovo  (which is supposed to have the Intel 8265 for wireless). This laptop was bought in part because it is certified to run Ubuntu and as such to me at least it would make sense for things to work out of the box... but no such luck.  First, I installed Ubuntu 17.10 and after installation realised Wi-Fi was not working. I also tried Ubuntu 16.04 from a USB drive since that is the version of Ubuntu it is certified for, but no luck there either.  The wireless chip is not detected by lshw (or even lspci by the looks of it), ip link does not show a wireless interface, and the iwlwifi kernel module is not loaded at boot (I can load this myself using modprobe iwlwifi but this does not make Wi-Fi work). I think it is a combined Wi-Fi/Bluetooth chip, and Bluetooth does appear to work (or at least Bluetooth shows up in Gnome and rfkill list).  modinfo iwlwifi | grep 8265 shows me a file ending in -34 is supposedly loaded but only a file ending in -33 (and some other lower numbers) is present in /lib/firmware, if that helps).  I have also installed the Linux 4.14.9 kernel in an attempt to get things to work, but this did not resolve the issue either.  Further information  root@ThinkPad-E570:~# modinfo iwlwifi | grep 8265 firmware:       iwlwifi-8265-34.ucode root@ThinkPad-E570:~# rfkill list all 0: tpacpi_bluetooth_sw: Bluetooth     Soft blocked: no     Hard blocked: no 1: hci0: Bluetooth     Soft blocked: no     Hard blocked: no root@ThinkPad-E570:~# dmesg | grep iwl root@ThinkPad-E570:~# lspci -nnk | grep 0280 -A3 05:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. Device [10ec:c821]     Subsystem: Lenovo Device [17aa:c024]   Update  I just noticed that the laptop does not have an Intel wireless chip at all, but in fact has a Realtek one... which means that the  of the shop I bought this laptop at were not accurate... Sigh. Same problem stands, however, just with a crappier wireless chip. QGIS save postgis table error : no result buffer I've a polygon layer on PostGIS, and when I try to add featureS using QGIS it gets error when I save the edit.   Here is the error notification "no result buffer".     I found a similar case here : . But it doesn't give me the answer to solve it. Any ideas ? One thing that made me curious while watching a football game on TV was the numbers that appear on the ground. For instance, there's a "1st &amp; 10" beside one team, but there was a "3rd &amp; 6" a few minutes prior (and I think it was beside the other team). What do these numbers mean? Why separation of variables works in PDEs? Converting string into datetime Teleporting a player from the overworld to the end Is there any way to teleport a player from the overworld to the end?   Or a way of teleporting a player to a random enderman in the end? Does a wireless-N (802.11n) network have poor performance when in b/g "mixed" mode? It seems to be an "old" wives tale that, when using a wireless-N router in "mixed mode" to support legacy 802.11b or 802.11g devices, the performance of 802.11n clients will suffer.      claim that when running in mixed-mode, all (some?) N clients run at G speeds.   make the same claim, but say it only happens when a G client is connected.    say N clients run faster, but still run about 30% slower than if the router were in N-only mode, even if there are no legacy B/G clients connected.    claim there is no speed drop for N clients when running on a mixed-mode network.  They say the only issue is that overall network throughput will be lower, because only one client can be transmitting at any time, so some of that transmission time must be shared with the legacy B/G clients running at lower speeds, reducing the overall throughput from what it would be if there were only N clients connected.    So, which is it?  Will running in mixed-mode slow down my network, even if there are no B/G clients?  If I'm running N, will having another client connected at B/G slow me down substantially vs. if they were running N?