I have been handed a PILZ flash drive from my friend, because it is apparently broken - indeed, it is. Connecting it to my computer instantly installed it's driver as a "XXXXXXXX U177CONTROLLER" device with 0MB of space, trying to view it results in a "Please insert media" message from Windows. I've read around, and found no fix for almost 2 hours now and I'm left totally clueless.
I have a USB flash drive which is no longer recognized by my computer. Windows Disk Management and DiskPart report No Media with no storage space (0 bytes) on the drive and I cannot partition or format the drive:     If the drive appears in Windows Explorer, trying to access it returns an error message indicating that there is no disk inserted, such as the following:     Please insert a disk into drive X:.   Various disk partitioning and data recovery utilities don't recognize the drive or only give a generic name for the drive and cannot access the contents of the drive.  What can I do? How do I recover data from the drive?     This question comes up often and the answers are usually the same. This post is meant to provide a definitive, canonical answer for this problem. Feel free to edit the answer to add additional details.
When training a neural network using the back-propagation algorithm, the gradient descent method is used to determine the weight updates. My question is: Rather than using gradient descent method to slowly locate the minimum point with respect to a certain weight, why don't we just set the derivative $\frac{d(\text{Error})}{dw}=0$, and find the value of weight $w$ which minimizes the error? Also, why are we sure that the error function in back-propagation will be a minimum? Can't it turn out the error function is a maximum instead? Is there a specific property of the squashing functions that guarantees that a network with any number of hidden nodes with arbitrary weights and input vectors will always give an error function that has some minima? Short story with aliens who hear their own thoughts as god-like voices I would have read this about 20-25 years ago.  I believe the subject was an alien individual, but it could have been a non-standard human instead.  The hook of the story was that the subject lacked an organ like the  that allows the halves of the brain to communicate efficiently, allowing the illusion of a single consciousness.  The subject is conscious, and has thoughts, but is subject to hearing commands like "Wash your hands!" "Fetch water!" within its head.  I recall the subject (and others like the subject) believing that the voices are their gods talking to them.  To the reader it becomes clear that this is a separate part of the subject's own mind that is responsible for long-term planning and simply can't communicate with the rest of the mind in the way a "normal" human is accustomed to. I want to make a generic class that accepts only serializable classes, can it be done with the where constraint?  The concept I'm looking for is this:  public class MyClass&lt;T&gt; where T : //[is serializable/has the serializable attribute] How to move boot and root partitions to another drive I have two drives on my computer that have the following configuration:  Drive 1: 160GB, /home Drive 2: 40GB, /boot and /   Unfortunately, drive 2 seems to be dying, because trying to write to it is giving me errors, and checking out the SMART settings shows a sad state of affairs.  I have plenty of space on Drive 1, so what I'd like to do is move the / and /boot partitions to it, remove Drive 2 from the system, replace Drive 2 with a new drive, then reverse the process.  I imagine I need to do some updating to grub, and I need to move some things around, but I'm pretty baffled how to exactly go about this. Since this is my main computer, I want to be careful not to mess things up so I can't boot. Prove $\alpha \in R[[x]]$ is a unit iff $a_0 \in R$ is a unit I was running my OS off a USB stick fine and the wifi was working. I installed it to my SSD and setup again but not the WIFI adaptor isn't working.  I followed the first time  and it worked but since installing onto the SSD and doing the same its not working.  No wlan0 interface found Please check drivers, try lsusb to check USB device is present root@goldminer:~# lsusb Bus 002 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub Bus 001 Device 002: ID 0bda:0811 Realtek Semiconductor Corp.  Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub   On the working device  root@coalminer:~# dkms status amdgpu, 18.10-572953, 4.13.16-hiveos, x86_64: installed amdgpu, 18.10-572953, 4.4.0-127-generic, x86_64: installed nvidia, 390.59, 4.13.16-hiveos, x86_64: installed nvidia, 390.59, 4.4.0-127-generic, x86_64: installed rtl8812au, 4.2.2, 4.13.16-hiveos, x86_64: installed rtl8812au, 4.2.2, 4.4.0-127-generic, x86_64: installed   On the SSD  root@goldminer:~# dkms status amdgpu, 18.10-572953, 4.13.16-hiveos, x86_64: installed amdgpu, 18.10-572953, 4.4.0-127-generic, x86_64: installed nvidia, 390.59, 4.13.16-hiveos, x86_64: installed nvidia, 390.59, 4.4.0-127-generic, x86_64: installed rtl8812au, 4.2.2, 4.13.16-hiveos, x86_64: installed (WARNING! Diff between built and installed module!) rtl8812au, 4.3.8.12175.20140902+dfsg: added rtl8812au, 5.2.9: added   Any advise? I think from trying to fix it ive been making it worse. How to show that $\mathbb{Q}$ is not $G_\delta$ I read a section of a book and it made mention of the set of rationals not being a $G_\delta$. However, it gave no proof. I read on  about using contradiction, but it made use of the Baire category theorem, which is unfamiliar to me. I was wondering if anyone could offer me a different proof; perhaps using the fact that the complement of $G_\delta$ is $F_\sigma$.  Thanks. I wrote an algorithm to randomly generate terrain and I am trying to load and edit my results with blender.  The problem is that when I load my terrain in blender, the individual triangles are not linked together.     You can see when I shrink/flatten a subset the the faces, the rest don't follow and deform as a single mesh.  I tried deleting the faces and edges and using F to create faces from the points, but it does not give usable results.    How can I go about solving this problem? Decide if the series converges and prove it using comparison test: $\sum_{k=1}^{\infty}\frac{1}{2k+3}$ Decide if the series converges and prove it using comparison test:   $\sum_{k=1}^{\infty}\frac{1}{2k+3}$   $$\frac{1}{2k+3} &lt;\frac{1}{2k}&lt;\frac{1}{k}$$  and since $\sum_{k=1}^{\infty}\frac{1}{k}$ diverges (we have defined that in our readings, so I can claim it here), the complete series will diverge, too.  Did I do everything correctly? What makes me feel a bit unsure is that there is no "$\leq$" sign anywhere and when I look up the comparison test on the internet, I don't see any "&lt;" or ">" in the definition.  Is it correct anyway? Let us say we have the following Makefile  include config.mk  # Generate summary table. results.txt : $(ZIPF_SRC) isles.dat abyss.dat last.dat     $(ZIPF_EXE) *.dat &gt; $@  # Count words. .PHONY : dats dats : isles.dat abyss.dat last.dat  %.dat : books/%.txt $(COUNT_SRC)     $(COUNT_EXE) $&lt; $*.dat  .PHONY : clean clean :     rm -f *.dat     rm -f results.txt   where all the variables are defined in config.mk  LANGUAGE=python COUNT_SRC=countwords.py COUNT_EXE=$(LANGUAGE) $(COUNT_SRC) ZIPF_SRC=testzipf.py ZIPF_EXE=$(LANGUAGE) $(ZIPF_SRC)   Is there any tool available that can expand all the include lines within the makefile so as to produce a bigMakefile? If such a tool does not currently exist, can a python/perl/awk/bash script be cooked up to achieve this goal? How to share data between forms? What are good strategies for booster drafts? I know that doing a booster draft can be somewhat complicated, because to really be good you need to know a lot about the set you're drafting (or be really good at evaluating cards quickly) and to pay attention to signal cards.    Besides going into the whole complicated strategies of knowing the set and paying attention to signal cards, what are some relatively simple/basic guidelines for drafting? Solve $x=y\frac{dy}{dx}-\left(\frac{dy}{dx}\right)^{2}$ Is there any way I can specify a standard or custom numeric format string to always output the sign, be it +ve or -ve (although what it should do for zero, I'm not sure!) Mean Value Theorem: $\frac{2}{\pi}<\frac{\sin x}{x}<1$ I need to show that $\dfrac{2}{\pi}&lt;\dfrac{\sin(x)}{x}&lt;1$ for $0&lt;x&lt;\dfrac{\pi}{2}$.  I know I need to use the mean value theorem, would I just say that since $f$ is continuous in the interval (call it I).  We know $\exists c\in I$ such that $f'(c) = \dfrac{f\left(\dfrac{\pi}{2}\right)-f(0)}{\dfrac{\pi}{2}}$. I don't know where this is going though.  Also, would I need to show $\lim_{x \to 0}\dfrac{\sin(x)}{x} = 1$? Is there a way to do this without L'H Rule? Should a button become lighter or darker on hover? We're having a discussion in the office about whether a button should become lighter or darker when a user hovers over it.   Here are some examples from the field:  Apple "Buy Now" button (Second is hover, third is depressed) -     Twitter Bootstrap -    (Unselected)   (Hover)  Github homepage - github.com      The button on FogBugz homepage goes from yellow to slightly lighter yellow. The buttons on Optimizely and Visual Website Optimizer hardly change.  Amazon's "Buy Now" button doesn't do anything when you hover over it (besides change to a pointer cursor). The colored buttons in Google's new interface (see Gmail or Calendar) go slightly darker when you hover over them.  Finally here is our button:    Should your button become lighter or darker when you hover over it? What else should you consider? Does anyone have data on whether the hover effect matters for conversions? E: Package 'libpng12-0' has no installation candidate [ubuntu 16.10 Gnome] I tried to install WPS Office on my laptop (ubuntu 16.10 Gnome, 64 bit) with  Gdebi installer but it said   Dependency is not satisfiable: libpng12-0   Then I tried to open this library as follows  sudo apt-get install libpng12-0   But I encountered an error:  Reading package lists... Done Building dependency tree        Reading state information... Done Package libpng12-0 is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source  E: Package 'libpng12-0' has no installation candidate   Can anyone help? Thanks a lot Bash script copy file to user's (wildcard) home dir Time taken for collision We have three particles at the vertices of equilateral triangle of side $d$. At $t=0$ they start moving in such away that at all instant of time each of them has a speed $v$ towards adjacent one. We have to find the time after which they will collide. I know that you can solve this by calculating from reference frame of any one particle, but I want a way to solve this by calculating the total distance traveled first in ground frame and then dividing by speed. Out-of-control starship results in some crew members landing in a rebirthed universe?