I tried changing file name but it won't change. Tried moving and deleting. Tried deleting from cmd but it won't work.
My wife has several files and folders that somehow ended up having filenames that have caused them to be undeleteable (can't be deleted) by normal means or via the command line. I believe the filenames are too long due to the depth of the folder structures. Does anyone know of a good utility for cleaning up files like this?
Pokemon GO isn't working at all for me right now. I'm in one of the following circumstances and can't do anything:   My game is displaying a "Try Again" message I'm stuck on the Loading Screen When I sign in I get a message that the servers are experiencing problems. I see the map but nothing is loaded, and my team color is wrong The "loading" Pokeball just ends up spinning and I can't catch or interact with things When I try to catch a Pokemon, the Pokeball just sits on my screen doing nothing Gym opponents will drop to 1 HP and won't take any more damage or attack When I open a pokestop, the pokestop image and the name of the pokestop does not load.   What's causing this? Is there a way to fix it? We are seeing this error in a Winform application.  Can anyone help on why you would see this error, and more importantly how to fix it or avoid it from happening.   System.ComponentModel.Win32Exception: Error creating window handle.    at System.Windows.Forms.NativeWindow.CreateHandle(CreateParams cp)    at System.Windows.Forms.Control.CreateHandle()    at System.Windows.Forms.Control.CreateControl(Boolean fIgnoreVisible)    at System.Windows.Forms.Control.CreateControl()    at System.Windows.Forms.Control.OnVisibleChanged(EventArgs e)    at System.Windows.Forms.ButtonBase.OnVisibleChanged(EventArgs e) What do I do when glitched? I was playing Grand Theft Auto Online on Xbox 360, and a player teleported to me.  I shot them, but they placed a campfire on me.  Now, I am constantly being burnt to death. How do I get out? Recently, I read this  about how they have some of their infrastructure laid out. I was curious to know, does Stack Exchange use caching (both at the application layer and/or database layer) and if so, how? What are good out of the box alternative geocoding solutions to Esri's services? Esri's  will retire at the end of the year, what are good GIS services that can replace the North American and US Streets geocoders?  I have totally excluded Esri's replacement, the  as it is a subscription service. Is there a specific term for a statement that uses words such that their precise meaning conveys a subtext contrary to the colloquial meaning?  For example, the joke in Men in Black:     Gentlemen, congratulations. You're everything we've come to expect   from years of government training.   where the precise use of the words conveys a sarcastic meaning (ie that the candidates are inept because that's what he's come to expect from government training).  I was going to use "irony" to describe this but then realized this is basically the opposite of irony - the use of words to convey their literal intention, when a nonliteral intention was expected. Classic Fantasy with characters from the real world I read this book about 6-8 years ago, and it was already slightly old at that point. The key parts were that the characters were all from Earth (America, if I remember correctly - one character internally monologues about remembering exactly how many steps it takes to get to a specific beach from his house, and while I don't remember the beach name, I remember thinking it was American) and woke up in a fantasy world, scattered about, and not remembering where they come from for quite a while.  Each abductee is wearing a bracelet with (what I remember as) polyhedral dice, although they aren't named that I think I inferred it from the description, and at some point they start using them as a form of magic. They find out that they were all abducted by a wizard so they go to find him. I can't remember what happens next, other than that eventually they find him and in a later book in the series (that I only saw the blurb of) they go back to his castle.  I think the book might be called "______ Keep", and am fairly certain the later book in the series is called "Return to ______ Keep".  I'd really appreciate it if someone who knew the title could tell me - it's like an unscratched itch at the moment, and I'd love to read it again! I am aware of what hyperfocal distance is and the general principles behind it. However, most of the tutorials I have seen and read regarding it make use of lenses with focus distance indicators. Unfortunately, neither of my lenses (Nikkor 18-55mm &amp; 35mm f1.8) have indicators.  I have read that you can 'cheat' and simply focus a third of the way into the shot (which I have done previously simply by spot-focusing on the lowest focus point in my VF). I also assume you could pace out the distance and note an object to focus on when you get back to the camera (though that might be easier said than done).  Does anyone have any suggestions on how to achieve maximum sharpness from front to back without focus distance markers. A new lens is not an option; global economic crisis and all that! Are there any tools that I can use to defrag my Windows partition from Linux? I once had the task of determining the following performance parameters from inside a running application:   Total virtual memory available Virtual memory currently used Virtual memory currently used by my process Total RAM available RAM currently used RAM currently used by my process % CPU currently used % CPU currently used by my process   The code had to run on Windows and Linux. Even though this seems to be a standard task, finding the necessary information in the manuals (WIN32 API, GNU docs) as well as on the Internet took me several days, because there's so much incomplete/incorrect/outdated information on this topic to be found out there.  In order to save others from going through the same trouble, I thought it would be a good idea to collect all the scattered information plus what I found by trial and error here in one place. Concrete Mathematics - The Josephus Problem I've been going through  and have a question on the inductive proof for the . Recurrent relation:  $J(1) = 1$ $J(2n) = 2J(n) - 1$ $J(2n+1) = 2J(n) + 1$  Closed form hypothesis:  $J(2^m + l) = 2l + 1$, for $m \ge 0$ and $0\le l&lt;2^m$  Inductive Proof (for the even case):  $J(1)=1$ $J(2^m+l)= 2J(2^{m-1}+l/2)-1=2(2l/2+1)-1=2l+1$  How do the authors get from $2J(2^{m-1}+l/2)-1$ to $2(2l/2+1)-1$? Why is this simple Excel calculation not netting Zero? It's supposed to be zero but for some reason the result produces a peculiar series of digits at the end.  Also, here's the .xlsx of it: http://83.212.111.36/Book1.xlsx Minecraft extra folders? Once I click to run minecraft a small window appears saying "Downloading runtime", then three other folders appear onto my desktop: Game, Native Log, and Runtime. This really annoys me, as I have to keep deleting them after I am done with a session of minecraft. Why is this? It never use to happen before. Evaluate the following limit of finite sum Derive Variance of regression coefficient in simple linear regression I need a shapefile for India which is up-to-date to display the regional borders. By up-to-date (in 2014), I mean that it includes Telangana as a state. Many shapefiles that I downloaded do not have Telangana as a state as it was partitioned a month ago, it is displayed as part of Andhrapradesh.  So I need the latest shapefile. Access-Control-Allow-Origin Multiple Origin Domains? Tuning PostGIS for production environments? What PostGIS documentation have you come across that has been helpful when tuning PostGIS for a production environment?  I would like to get together with my DBA to setup a Postgresql/PostGIS installation that is fit for production. I have read that there is some tweaking involved to achieve this, and I was hoping to find the answer on the .  So far I have found some documents on the OpenGeo site helpful, .  And this  is the kind of information I have found helpful, this is probably just basic DB stuff but to me its good stuff.  I would be interested to see what resources have helped others in achieving a stable production installation of PostGIS. Fastest way to determine if an integer's square root is an integer I'm looking for the fastest way to determine if a long value is a perfect square (i.e. its square root is another integer):    I've done it the easy way, by using the built-in  function, but I'm wondering if there is a way to do it faster by restricting yourself to integer-only domain. Maintaining a lookup table is impractical (since there are about 231.5 integers whose square is less than 263).   Here is the very simple and straightforward way I'm doing it now:  public final static boolean isPerfectSquare(long n) {   if (n &lt; 0)     return false;    long tst = (long)(Math.sqrt(n) + 0.5);   return tst*tst == n; }   Note: I'm using this function in many  problems.  So no one else will ever have to maintain this code.  And this kind of micro-optimization could actually make a difference, since part of the challenge is to do every algorithm in less than a minute, and this function will need to be called millions of times in some problems.    I've tried the different solutions to the problem:   After exhaustive testing, I found that adding 0.5 to the result of Math.sqrt() is not necessary, at least not on my machine. The  was faster, but it gave incorrect results for n >= 410881.  However, as suggested by , we can use the FISR hack for n &lt; 410881. Newton's method was a good bit slower than Math.sqrt().  This is probably because Math.sqrt() uses something similar to Newton's Method, but implemented in the hardware so it's much faster than in Java.  Also, Newton's Method still required use of doubles. A modified Newton's method, which used a few tricks so that only integer math was involved, required some hacks to avoid overflow (I want this function to work with all positive 64-bit signed integers), and it was still slower than Math.sqrt(). Binary chop was even slower.  This makes sense because the binary chop will on average require 16 passes to find the square root of a 64-bit number. According to John's tests, using or statements is faster in C++ than using a switch, but in Java and C# there appears to be no difference between or and switch. I also tried making a lookup table (as a private static array of 64 boolean values).  Then instead of either switch or or statement, I would just say if(lookup[(int)(n&amp;0x3F)]) { test } else return false;.  To my surprise, this was (just slightly) slower. This is because . Let $S$ be the set of $3 \times 3$ matrices $\rm A$ with integer entries such that $$\rm AA^{\top} = I_3$$ What is $|S|$ (cardinality of $S$)?   The answer is supposed to be 48. Here is my proof and I wish to know if it is correct.  So, I am going to exploit the fact that the matrix A in a set will be orthognal, so if the matrix is of the form \begin{bmatrix}         a_{11} &amp; a_{12} &amp; a_{13} \\         a_{21} &amp; a_{22} &amp; a_{23} \\         a_{31} &amp; a_{32} &amp; a_{33} \\         \end{bmatrix}  Then each column and row will have exactly one non-zero element which will be +1 or -1. Thus, I have split possibilities for the first column into three cases and counted the possibilities in each case as follows :- $$a_{11} \neq 0$$ or $$ a_{21} \neq 0$$ or $$ a_{31} \neq 0$$  In case 1), we obviously have two possibilities(+1 or -1) so we consider the one where the entry is +1. Now, notice that the moment we choose the next non-zero entry, all the places for non-zero entries will be decided because of the rule 'each column and row will have exactly one non-zero element'. Meaning, if b and c are remaining two non-zero entries, we only have two possibilities left  \begin{bmatrix}         1 &amp; 0 &amp; 0 \\         0 &amp; b &amp; 0 \\         0 &amp; 0 &amp; c \\         \end{bmatrix}  or  \begin{bmatrix}         1 &amp; 0 &amp; 0 \\         0 &amp; 0 &amp; c \\         0 &amp; b &amp; 0 \\         \end{bmatrix}  Using the fact that b and c are simply $$\pm1$$  In each of the above matrices, we get 4 possibilities for each of the matricies. Thus, 8 possibilities in totality. Basically, we are getting 8 possibilities on the assumption that  $$a_{11} = 1$$  Thus, we get 16 possibilities on the case that $$a_{11} \neq 0$$  Following, the second and third cases analogously, we get a total of 16 possibilities in each of them and 48 possibilities in total.    Source :- Tata Institute of Fundamental Research Graduate School Admissions 2016