Windows 10 has filename rules, which includes illegal characters and too long names for example. You can find all rules in this Microsoft Docs  article. I wanted to make a compact list of the most important ones but my markdown skills are not sufficient to make it clearly readable. I think some files got on my computer through syncing, decompressing files or other 'non-conventional' means and contain some illegal names or have too long paths/names. I don't exactly know how this happened. I speculate that the too long paths/filenames case is due to symbolic/relative paths. One case that I am very certain of is that some of my files contain emojis in their file names. Although they don't seem to be deemed as illegal characters, some applications have issues processing/opening them. Thus I would like to get rid of them as well. Is there a tool available that can detect those files and maybe even fix them for me? If there is no tool already available, a regex pattern would be very useful so I can integrate it in my regex based filename editor myself. I found a Regex pattern like [~&quot;#%&amp;*:&lt;&gt;?/\\{|}]+ from  but it only contains the reserved characters. How can I add emojis and characters not supported by NTFS filesystems to the pattern?
I have a song that Windows can't play because there is a question mark in the name of the file.  "Where Have All the Cowboys Gone?.ogg" // as an example   So I try to rename it and Windows complains whether I try it in Explorer or from command prompt.  Error I get when trying to copy, rename, or move is:     The Filename, directory name, or volume label syntax is incorrect   Is there a Windows way to force a rename in this case?   Update  I'll keep an eye on this question, but after 13 answers and many attempts (aside form 3rd party solutions) it seems that Windows can't do this (or at least my windows can't, no short names). So I'm accepting the answer which was my original solution anyway of using Linux. It would be nice to see Windows handle this somehow, so don't stop just because I've accepted this answer, the question still stands!
Given ∃x.¬p(x), use the Fitch System to prove ¬∀x.p(x). I'm trying to make airsoft chronograph/chronometer (a device that measures airsoft bullet speed). The idea is to measure time in which bullet is traveling from point A to point B, and then I can calculate bullet speed. Bullet is shot into plastic pipe with diameter of 32mm. I've tried to put on one side IR LED and on the other side phototransistor (BPW 40), both at the start and end of the tube. Something like this:  Blue circles are phototransistors, red circles are IR LEDs and white circles are airsoft bullets. When bullet passes through area where bullet 2  is drawn (just in between IR LED and phototransistor), everyting works perfectly. But when the bullet passes where bullets 1 and 3 are drawn, it isn't detected. That is expected, but unwanted behavior. So my question is: how can I detect bullets regardlessly of it's position ? I've thought about putting IR LEDs and phototransistors around the pipe (not only in one place), like this:  but this solution isn't cheapest: 5 IR LEDs + 5 BPW 40 = cca $12 times 2 (because I need it on both sides of the pipe) = $24. Is there any cheaper solution ? Is BPW 40 good choice for phototransistor ? I don't know which IR LEDs I'm using (and salesman in the store also doesn't know - he told me these are generic ones for remote controllers, like TV or DVD controller). Diameter of the pipe is 32mm and it will be long about 14cm (sensors will be 10cm apart). Diameter of airsoft bullet is 6mm. EDIT: I'll go for my second idea. I just have one more question: is it better to arrange IR emitters and photo transistors this way:  or this way:  Thanks !! How to show that  $$ \lim _{\alpha \rightarrow \infty } \sup_{t \in \left [0,T \right]} \left | e^{-\alpha t} \int _ 0 ^t e^{\alpha s} ~ dB_s \right | =0, \ \ \text{a.e.} $$  where $\left (B_s \right)_{s\geq 0}$ is a real standard brownian motion starting from zero ? If $R_{1}$ and $R_{2}$ are relations on a set S with $R_{1};R_{2}=R_{2};R_{1}$. Then $R_{1}$ and $R_{2}$ are bijective maps For the surjectivity part, I showed that if $(a,b)\in I$ then $(a,c)\in R_{1}$ and $(c,b)\in R_{1}$ and $(a,c)\in R_{2}$ and $(c,b)\in R_{2}$ for some $c\in S$. Now for arbituary $(x,y)\in R_{1}$ we have $(x,z)\in I$ which implies that $(y,z)\in R_{2}$. But also $(y,z)\in R_{1}$, so $R_{1}$ is surjective. Similar argument for $R_{2}$  And for Injectivity, I've tried to show that if $aR_{1};R_{2}c$ and $bR_{2};R_{1}c$, then $a=b$ but I am not entirely sure what $a=b$ means in this context. Do I have to show that there is an equivalence relation containing (a,b)?  edit: $R_{1};R_{2}$ is a composition of two relations and $I=R_{1};R_{2}$ Do we have always $f(A \cap B) = f(A) \cap f(B)$? Suppose $A$ and $B$ are subsets of a topological space and $f$ is any function from $X$ to another topological space $Y$. Do we have always $f(A \cap B) = f(A) \cap f(B)$?  Thanks in advance 10 hour layover in Moscow Russia, do I need a transit visa? On June 29th 2015, I will be traveling for the first time to Italy from USA. I will have a 10 hour layover in Moscow Russia. My question is, do I need a visa to visit the city? How to set root password to null My friend and his wife visited UK during the year 2015. And they came back on time we want to know one information as they same couple want to visit UK again  For how many years or months can multiple entry visa can be given for a couple who have already visited UK? Integral of $\int \frac{dx}{\sqrt{x^2 -9}}$ How can I capture KeyDown event on a WPF Page or UserControl object? I have a Page with a UserControl on it.  If the user presses Esc while anywhere on Page I want to handle.  I thought this would be as easy as hooking up the PreviewKeyDown event, testing for the Esc key, and then handling it.  However, when I placed I breakpoint in the event handler I found it was never getting called.  I thought perhaps the UserControl might be getting hit, so I tried PreviewKeyDown there... same result.  Does anyone know the proper place to test for a KeyDown or PreviewKeyDown on a Page object? Let $\Gamma$ be a set of formulas and $\phi$ be a formula. Show that $\Gamma \cup \{\neg \phi\}$ is satisfiable if and only if $\Gamma\not \models \phi$.   This seemed pretty obvious but I wanted to see if my proof made sense:  Proof: $(\Rightarrow)$  To derive for a contradiction, suppose that: $\Gamma \models \phi$. That means for all truth assignments $v$, for $\gamma \in \Gamma$, if $v(\gamma) = T$, then $v(\phi) = T$.  But this contradicts our assumption that $\Gamma \cup \{\neg \phi \}$ is satisfiable by the fact that $v(\phi) = T$ cannot happen so: $\Gamma \not \models \phi$ .  $(\Leftarrow)$   So by the definition of $\Gamma \not \models \phi$, we have that there is some truth assignment $v$ which satisfies $\Gamma$ but does not satisfy $\phi$. So  that means $v(\phi) = F$ since $v(\phi) \not = T$ which implies that $v(\neg \phi) = T$ which means $v$ satisfies $\Gamma \cup \{\neg \phi\}$.    I feel like I'm missing something in the forward direction, but at the same time... It looks pretty trivial as well. Am I missing anything crucial?  Thank you! Are there any Combinatoric proofs of Bertrand's postulate? I feel like there must exist a combinatoric proof of a theorem like: There is a prime between $n$ and $2n$, or $p$ and $p^2$ or anything similar to this stronger than there is a prime between $p$ and $(\prod_p p) + 1$ (Euclid's theorem).  I was trying to prove one by the Sieve on this grid      1     2     3     4 ... p   p+1   p+2   p+3   p+4 ... 2p  2p+1  2p+2  2p+3  2p+4 ... 3p ........................... ........................... ........................... p^2 p^2+1 p^2+2 p^2+3 p^2+4 ...   but it did not work.  Do any good arguments like this exist? I don't expect anything as strong as Prime Number Theorem or even Bertrand, but surely a direct combination proof can prove that there are lots of primes? When is a CDATA section necessary within a script tag? Are CDATA tags ever necessary in script tags and if so when?  In other words, when and where is this:  &lt;script type="text/javascript"&gt; //&lt;![CDATA[ ...code... //]]&gt; &lt;/script&gt;   preferable to this:  &lt;script type="text/javascript"&gt; ...code... &lt;/script&gt; mailto link with HTML body Did English ever have a formal version of "you"? Desktop wakes from suspend at random (14.04) Where are the NetworkManager logs? A previous poster on the regular forums (  ) said /var/log/daemon.log, but I don't seem to have such a file. Do I need to enable logging? Remove Meta Privilege for MSE (only) Choosing OpenLayers or Leaflet? I was debating with one of my collegues on OpenLayers v/s Leaflet. I made a point that OpenLayers is much better API if we wish to build a project, where you need direct connectivity to the Geoserver and PostGIS.  Then I found , which looks pretty new but has the features of connectivity with the Geoserver and PostGIS.  So my project details are as follows,   Use the map interface to fetch Feature Info Create a customized tool that takes the lat/lon from user as to where he/she clicks on the map and then fetches the Climate Data from the raster (which is handled by a py script on the server) Allows user to upload excel, which is sent to the py script, which returns a GeoJSON, which creates Vector Features on the map Allow user to create vector polygons, which will fetch the Features it intersects from the WFS Layer. Fetches Layer from the PostGIS Datastore on GeoServer and displays the layers on the map.   So now I am confused on which is better and why using OpenLayers over Leaflet makes more sense or not? Wubi with 14.10 doesn't work - failed to partition the selected disk I tried to install Ubuntu 14.10 on my computer with Wubi. The installation appeared to work in Windows, and told me to reboot.   After rebooting the Ubuntu installer continued the installation, until it stopped with an error message: Failed to partition the selected disk with the detail This probably happened because are too many primary partitions in the partition table.