I am using a desktop application that reads/writes folders and files on the local filesystem.  PROBLEM: Some of these files have paths longer than 260 characters, triggering such errors:     PathTooLongException: The specified path, file name, or both are too long. The fully qualified file name must be less than 260 characters, and the directory name must be less than 248 characters.   Question: How to make Windows allow long paths? I am using a wide array of Windows versions so I appreciate answers split by versions.  Different from  as that question is only about a missing option.
For some time, Microsoft has supported an option to remove the limit of 260 symbols for NTFS file name length.  The web is full of articles, describing what should be done.   Hit the Windows key, type gpedit.msc and press Enter. Navigate to Local Computer Policy > Computer Configuration > Administrative Templates > System > Filesystem > NTFS. Double click the Enable NTFS long paths option and enable it.   However, I don't have such option. Please see the screenshot below:    Am I missing some Windows update, or is it something else?
I bought a Mac (13", early 2011) almost 5 years ago. When I first got it, it was running under OS X 10.7 and it was pretty fast. I've being upgrading it ever since and it's now running under Mac OS X 10.11.  I guess it didn't totally survive the upgrades because, today, there's a lot of bugs, freezes, lags, "spinning beach ball" appearing,... for example, when I write something on a normal program/editor, the cursor freezes for a few seconds, then catches up to what I'm writting.  As you can guess, that's really annoying! I've been thinkning about upgrading the hardware but I don't know what to do: should I change the RAM to 8 GB - 1 333 MHz (currently my computer has 4 GB - 1 333 MHz)? Or should I upgrade to an SSD (which is pretty expensive and difficult to install)?  Thank you very much. Defining the Product of Ideals Where does the &quot;naive definition&quot; of the product of two ideals $I$ and $J$, $IJ = \{ ij \mid i \in I, j \in J \}$ fall apart? (The product of two ideals $I$ and $J$ is defined to be $IJ := \sum_i a_ib_i$, where each $a_i$ is in $I$ and each $b_i$ is in $J$.)  Note: This is a question from a problem set I'm working on. I am not expecting a full solution for the answers, but I'd like some help knowing where to look. It seems to work fine in $\mathbb{Z}$ and $\mathbb{C}[x]$. I've just bought my first Mac, a Macbook pro(with an hdd), and I'm thinking in buying an ssd and replace the hdd. But the computer came with no dvd of the OS. I know that in the hdd there is a restore partition, but if I remove the hdd, how can I install the OS? Error message "sudo: unable to resolve host (none)" When I run sudo the terminal is stuck for a few seconds and then outputs an error message. My terminal looks like this:  ubuntu@(none):~$ sudo true sudo: unable to resolve host (none)   What can I do to solve it? I want to exclude certain local folders with Google Drive but I *keep* them on the computer Using Google Drive on Windows (although I think the same question applies to OS/X) I want to exclude certain local folders but keep them on the computer.  When I go to Drive preferences and deselect specific folders, it wants to remove them from the local PC and keep them only in the cloud.  This doesn't work for me.  I feel like I could do this in earlier versions of the Google Drive client but I cannot recall for sure.  Is this possible? Is there any way to backtrack to previous areas? Get lists of dependent picklist options in Apex Describe the units in $\mathbb{Z}[\sqrt{-d}]$ uint color;  bool parsedhex = uint.TryParse(TextBox1.Text, out color);  //where Text is of the form 0xFF0000 if(parsedhex)    //...   doesn't work. What am i doing wrong? Test statistic for follow up procedure (stepwise step down) of Kruskal Wallis When conducting a Kruskall Wallis test, it is possible to follow up the procedure with a post hoc test, looking for homogeneous subsets. My question is which statistic is used to perform this procedure (e.g., is it Chi-Square, z, or the original H)? 2/15/18 compiz update broke unity This  forced removal of unity and ubuntu-desktop on my 16.04 Ubuntu system.   The offending package that is missing, but unity needs, seems to be compiz-core-abiversion-20151010. It seems to be a , and I can't find it to download.    As it happens, I mostly use LXDE on this system, but I'd be very unhappy if I used Unity...  Since I do occasionally use the Unity desktop, is there a fix for this?  Edit: related questions are rolling in. Looks like a major quality escape          Edit 2: That's kind of a recursive Google Search that should be self-explanatory. It did take me some time to tweak the sentence and trying to find a number which would correspond precisely, the reason why I changed it to "hundreds" instead! :P  If you have used Google long enough you certainly have stumbled on situations similar to this, many times. Whenever it shows less than 10 pages it's quite easy to see it. The point is: the number of results on any page except the last one seems like a terrible estimate.  What's even weirder,  the estimate suddenly becomes much better and almost exactly the same on all pages than it is on the last page - the only page that's always correct.  So, anyone knows why? Is it possible to find a smooth function $p$ such that $$p(x)=0 \text{ if } x\le -1$$ $$p(x)=0 \text{ if } x&gt; 0$$ $$0\le p(x) \le 1 \text{ if } -1&lt;x&lt;1$$ $$p(x) = 1 \text{ if } -\frac{1}{2}\le x \le \frac{1}{2}$$ Hint: The following function has continuous derivatives of all orders $$f(x) = 0 \text{ if } x\le 0$$ $$f(x) = e^{-\frac{1}{x^2}} \text{ if } x&gt;0$$  My thought: Considering the left-half of the function $p$, I tried something like $e^{-\frac{1}{\tan^2(x\pi)}}$. The shape looks good but I am not sure about the smoothness at $-1$ and $-\frac{1}{2}$. For $x=-1$, since $\tan$ is infinitely differentiable so we have smoothness there. But for $x=-\frac{1}{2}$, I am not sure about the smoothness after &quot;gluing&quot; with $y=1$. Uses of the definite article (the) in generic noun phrases Nearby objects won't move independently? I created a thick glass bottle and duplicated the interior faces to make a new object to create the liquid inside.   I went in the edit mode, selected the faces I wanted to copy and duplicated them with ShiftD. Then I pressed P to  separate the duplicated faces.   Now I try to make a duplicate of that liquid to make it flow out of the bottle, and I simply need the duplicate of one face of it. So I go to edit mode and do as I did to make the liquid from the bottle faces... but as soon as I'm back to the object mode and I want to move the duplicated faces, every thing moves with it...   I played around and tried things, and while doing so I realized that if I dupe the liquid object in object mode using ShiftD and press 0 to place it where the original is, they move together if I duplicate it and place it somewhere else so that they are separated.   Also if I pick one of the two separated objects and make it intersect with the other one, release my left mouse button to place it there, and then try to move it again, they both move together, but not at the same speed.  I really don't understand what is going on and I'm sure it's really badly explained, so what I'll do is make a screen capture of my Outliner and record the behavior of the objects and upload those to help you understand. How to install Hp laser jet 1020 plus printer? Why does aptitude give me intel-microcode upgrades when I have an AMD processor? I have a Supermicro AS-2022G-URF (H8DGU motherboard) with 2 AMD Opteron 6272 16C/16T 2.1GHz and an LSI MegaRAID SAS 2108 RAID controller currently running Ubuntu Server 14.04 LTS (scheduled to be upgraded to 16.04 this summer). Several times over the last year, when I have done aptitude update/upgrade, the intel-microcode package has shown up as one of the packages that will be installed. Since this server has AMD processors, not Intel, Why does aptitude offer this package? Is it in any way necessary for other reasons? Any ill effects from going along with aptitude on this? Working in an enterprise system. We need to determine if everyone needs to update to 10.6 at the same time for mxd cross-compatibility or can we update from 10.5 as needed. Dihedral group - elements of order $2$ Expected value of subset of variables in Bayesian setting Assume we have $N$ random variables $X_1, \ldots, X_N$ with known (posterior) distributions that are easy to sample from. For simplicity, assume that I am interested in the expected value of the ten largest of these random variables. There will be some uncertainty surrounding this expected value as there is uncertainty with respect to the rank of a given $X_i$ in case the distributions of $X_1, \ldots, X_N$ overlap. I want to use simulation based methods. My approach is to simulate $M$ samples from the distributions of $X_1, \ldots, X_N$, where in each iteration, I construct a binary indicator of length $N$ indicating whether random variable $i$ is within the set of the ten largest samples or not. Averaging over these $M$ draws gives me the probability that random variable $i$ is member of the top ten group. Denote this probability as $\pi_i$. Define a binary random variable that indicates membership in the top ten group as $S_i$. $S_i$ follows a Bernoulli distribution s.t. $S_i \sim Ber(\pi_i)$. In a second step, I draw $L$ samples from the distribution of $S_i$ and from the distributions of $X_1, \ldots, X_N$. Given a draw of $S_i$, I can select the top ten out of the samples of $X_1, \ldots, X_N$ in each iteration and average the respective samples within the top ten group. I save this average, so the result after $L$ iterations will be the distribution of the average outcome within the top ten group, taking into account all relevant sources of uncertainty. My questions are: Is this simulation approach valid in general? From a Bayesian perspective, is this simulation valid or do I need to treat additional quantities (e.g. $S_i$ or $\pi_i$) as random variables that need a prior?