I recently got a virus on my computer that has hidden all my files. I've tried to get rid of the virus using unhide.exe/RKill/ Spybot Search &amp; Destroy/HouseCall/Malwarebytes, and it may have got rid of it, but the files on my computer are still missing. I know they are there because I used IObit Uninstaller, and it shows all the files still there, but I can't find them.   I tried opening cmd as administrator and typed the attrib command suggested by somebody to unhide all the files, but it gives me access denied, even though I am administrator and right-click to run as administrator. I right-clicked cmd and went to Properties, went to the Security tab, and I can see all the files, but one user has full control and that's TrustedInstaller. Admin/users and even SYSTEM are unable to be changed, it's all grayed out.  I was wondering if someone could help me to change security with the cmd, so I can unhide all my files, or if there is an easier way to do it?
What should I do if my Windows computer seems to be infected with a virus or malware?  What are the symptoms of an infection? What should I do after noticing an infection? What can I do to get rid of it? how to prevent from infection by malware?   This question comes up frequently, and the suggested solutions are usually the same. This community wiki is an attempt to serve as the definitive, most comprehensive answer possible. Feel free to add your contributions via edits.
I have seen some very weird for loops when reading other people's code. I have been trying to search for a full syntax explanation for the for loop in C but it is very hard because the word "for" appears in unrelated sentences making the search almost impossible to Google effectively.  This question came to my mind after reading  which made me curious again.  The for here:   for(p=0;p+=(a&amp;1)*b,a!=1;a&gt;&gt;=1,b&lt;&lt;=1);   In the middle condition there is a comma separating the two pieces of code, what does this comma do? The comma on the right side I understand as it makes both a&gt;&gt;=1 and b&lt;&lt;=1.   But within a loop exit condition, what happens? Does it exit when p==0, when a==1 or when both happen?  It would be great if anyone could help me understand this and maybe point me in the direction of a full for loop syntax description. Where is the open source project for the WMD editor used on this site? How can I get the values of the parameters of a calling method? Question  I'm writing some code that needs to be able to get the values of the parameters from the method that called into the class. I know how to get all the way to the ParameterInfo[] array, but I don't know how to then get the values. Is this even possible?  If it is, I think it has something to do with using the MethodBody property from the MethodInfo object, which allows you to inspect the IL stream, including properties, but I don't know how to do it, and I haven't found applicable code on Google.  Code  // Finds calling method from class that called into this one public class SomeClass {     public static void FindMethod()     {         for (int i = 1; i &lt; frameCount; i++)         {             var frame = new StackFrame(i);             var methodInfo = frame.GetMethod();             if (methodInfo.DeclaringType != this.GetType())             {                 string methodName = frame.GetMethod().Name;                 var paramInfos = methodInfo.GetParameters();                  // Now what?? How do I get the values from the paramInfos                  break;             }             else if (i == frameCount - 1)             {                 throw new TransportException("Couldn't find method name");             }         }     } } So I was configuring VS code on my Notebook when suddenly I noticed that my interface font got really small on my desktop, terminal and files. I use Gnome Tweaks Tool to increase my scaling factor to 1,15 , but, even though it was active, the font stayed tiny. The solution I found was moving my scaling factor, which instantly fixed my font issue, however, every time I restart my Notebook the font gets tiny again and I have to repeat the process. I tried reseting my font configuration using this command, but had no success. gsettings reset org.gnome.desktop.interface text-scaling-factor  I also tried using the command dconf reset -f /  Finally, I tried using dconf-editor, but still had no success altering the font rendering DPI or changing the scaling factor. All of the steps I mentioned fixed my fonts temporarily, but the issue still persists when I restart my Notebook I am out of ideas and even considered getting a fresh Ubuntu install by now... My video card: NVIDIA GeForce GTX 1050 GPU I want to block Facebook (the Facebook site) for concentrating purposes, but I don't want to break the share or like buttons on other pages (like a good article or a nice clip on YouTube I want to like or share). How can I do that? I use both Windows and Linux. How did Anakin Skywalker survive Order Sixty Six? . When activated, troopers would immediately perceive Jedi as a threat and kill them.  Since Anakin was a Jedi until around the time of the Order, how did the troopers know not to kill Anakin? Every time I touch an object a full-render starts I don't know what setting I switched, or what happened, but for some reason now every time I move, scale or rotate an object in the 3d View - blender starts a render. I am not talking about the 3d View being in "Rendered" mode. I am talking about the same behavior as when you click the "Render" button (switch to image editor, begin full render). This is driving me crazy and I can't seem to figure out how to turn it off or what I did to start it. It happens whether I use the mouse or keys. If I open a new document the behavior goes away so it is probably a preference setting(?) If you can help, I will be eternally grateful.  Thanks in advance. Understanding reference counting with Cocoa and Objective-C I'm just beginning to have a look at Objective-C and Cocoa with a view to playing with the iPhone SDK. I'm reasonably comfortable with C's malloc and free concept, but Cocoa's references counting scheme has me rather confused. I'm told it's very elegant once you understand it, but I'm just not over the hump yet.  How do release, retain and autorelease work and what are the conventions about their use?  (Or failing that, what did you read which helped you get it?) Link to the recommended job is broken in the mobile apps I have the following problem illustrated by a simple example: If I cite the paper of an author T. Coven in my document, the outcome is 'Coven (2004b)'. If I cite the appendix to this paper, the outcome is 'Coven (2004a)'. Now the appendix pops up much less frequently than the original paper, therefore I would like to reverse the order (exchange 'a' and 'b' in the citations). Is this possible?  I am using Biblatex. Here is the bib-file of the above example (named: lib.bib):  @article{co:2004, author = {T. Coven}, title = {Title A}, journaltitle = {The X Journal}, date = {2004} } @article{coapp:2004, author = {T. Coven}, title = {Appendix to Title A}, journaltitle = {The X Journal}, date = {2004} }   MWE:  \documentclass[a4paper, 12pt, headsepline, headings=small,]{scrreprt} \usepackage[backend=bibtex8,     style=authoryear-icomp,     dashed=false,     autocite=footnote,     maxcitenames=3,     mincitenames=1,     maxbibnames=100,     firstinits=true,     sorting=nty     ]{biblatex} \bibliography{lib}  \begin{document} \cite{co:2004} and \cite{coapp:2004} \end{document} Strange artifacts along window borders after waking computer from sleep mode NB: Nvidia has released an official fix; please see ,  and/or .  Upon waking up Ubuntu 16.04 from Suspend, the following graphical glitches appear around all windows, context menus, and similar:      This is currently known to affect the following NVIDIA cards running the proprietary drivers:  NVIDIA GeForce 610M, driver version 375.39, 340.102 NVIDIA GT 630M, driver version 375.39 NVIDIA GTX 650, driver version 375.39 NVIDIA GT 740M, driver version 378.13 NVIDIA GTX 745, unknown driver version NVIDIA GTX 850M, driver version 375.39, 378.13 NVIDIA GT 940M, driver version 375.39 NVIDIA GTX 950M, unknown driver version NVIDIA GTX 960M, driver version 378.13 NVIDIA GTX 970, driver version 375.39 NVIDIA GTX 970M, driver version 375.39 NVIDIA GTX 980 TI, unknown driver version NVIDIA GTX 1060, driver version 375.26, 375.39, 378.09 NVIDIA GTX 1070, driver version 378.09  The above above list has been sourced from reports from other users here on AU,  thread, and  thread. NB: This is be no means an exclusive list. It probably effects nearly all Nvidia cards.  Furthermore, this issue has been replicated on a clean install where the only change was a software update and the installation of the latest NVIDIA drivers.  What is going on, and how can it be resolved? How to write a function (piecewise) with bracket outside? How to write this Piecewise function using LaTeX?  I tried $ \begin{array}{cc}   \{ &amp;      \begin{array}{cc}       0 &amp; x\leq 0 \\       \frac{100-x}{100} &amp; 0\leq x\leq 100 \\       0 &amp; 100\leq x     \end{array} \end{array} $  but it didn't work perfectly, the bracket &quot;{&quot; looks small, see: Suppose I have a paper with the following text:     Roses are red, violets are blue, sugar is sweet, and so are you [3],[4].   As one can see, the author got the information from two other references. If I want to add this information in my thesis, do I also have to reference [3] and [4] or can I just reference this particular paper, I got the information from? How to disprove this fallacy that derivatives of $x^2$ and $x+x+x+\dots\quad(x\text{ times})$ are not same. Possible Duplicate:          \begin{align*} x^2 &amp;= \underbrace{x + x + x + \dots + x}_{x \text{ times}}, \\ \therefore \frac{\mathrm{d}}{\mathrm{d}x} (x^2) &amp;= \frac{\mathrm{d}}{\mathrm{d}x} (\underbrace{x + x + x + \dots + x}_{x \text{ times}}) \\ &amp;= \underbrace{1 + 1 + 1 + \dots + 1}_{x \text{ times}} \\ &amp;= x. \end{align*}  But we know that $$ \frac{\mathrm{d}}{\mathrm{d}x} (x^2) = 2x. $$  So what is the problem?  My take is that we cannot differentiate both sides because $\underbrace{{x+x+x+\cdots+x}}_{x \text{  times}}$ is not fixed and thus $1$ is not equal to $2$. Given complex $|z_{1}| = 2\;\;,|z_{2}| = 3\;\;, |z_{3}| = 4\;\;$ : when and what is $\max$ of $|z_{1}-z_{2}|^2+|z_{2}-z_{3}|^2+|z_{3}-z_{1}|^2$ How do I calculate the resistor value for a simple LED circuit? I have a simple circuit:    The max rating (current) of the LED is 30mA.  How can I work out what the resistance of the resistor needs to be? By using ohm's law I found it to be \$3V/0.03A = 100 \Omega\$. However using software called , and trial and error I got the minimum possible resistance to be 36&Omega;. However, if I use a 35&Omega; resistor, then the LED breaks. Is the software wrong, or (more likely) am I doing something wrong? Can magnets rotate infinitely? There are many videos on youtube in which people arranged magnets in circle and rotated one placing in middle of that circle on a shaft, and the magnet (magnet motor) starts madly and continues its movement. Do they really rotate infinitely? If so, do they from where they get that extra energy to move so fast and infinitely?    EDIT: This question is about real world scenario  UPDATE: I am unable to find that particular video about which i talked about -- I added them to my favourites, but they are all now deleted :( -- there are hundreds of that that kind of videos. Some example videos links Query to find GUID's "not in" null containing subquery returns no results Can the Force be used to fly? In The Empire Strikes Back Yoda uses the Force to lift Luke's X-Wing out of the water and put it on land.  In Attack of the Clones and in many instances in the second series of The Clone Wars, Anakin (and others) use the Force to jump higher than they could otherwise, or to jump from very high locations, but I don't think I've ever seen the Force used for outright self-levitation.  But if Yoda could lift the X-Wing, shouldn't a strong Jedi be able to lift himself and, essentially, fly with the help of the Force? This is just a curiosity. I have come across multiple proofs of the fact that there are infinitely many primes, some of them were quite trivial, but some others were really, really fancy. I'll show you what proofs I have and I'd like to know more because I think it's cool to see that something can be proved in so many different ways.  Proof 1 : Euclid's. If there are finitely many primes then $p_1 p_2 ... p_n + 1$ is coprime to all of these guys. This is the basic idea in most proofs : generate a number coprime to all previous primes.  Proof 2 : Consider the sequence $a_n = 2^{2^n} + 1$. We have that  $$ 2^{2^n}-1 = (2^{2^1} - 1) \prod_{m=1}^{n-1} (2^{2^m}+1), $$  so that for $m &lt; n$, $(2^{2^m} + 1, 2^{2^n} + 1) \, | \, (2^{2^n}-1, 2^{2^n} +1) = 1$. Since we have an infinite sequence of numbers coprime in pairs, at least one prime number must divide each one of them and they are all distinct primes, thus giving an infinity of them.  Proof 3 : (Note : I particularly like this one.) Define a topology on $\mathbb Z$ in the following way : a set $\mathscr N$ of integers is said to be open if for every $n \in \mathscr N$ there is an arithmetic progression $\mathscr A$ such that $n \in \mathscr A \subseteq \mathscr N$. This can easily be proven to define a topology on $\mathbb Z$. Note that under this topology arithmetic progressions are open and closed. Supposing there are finitely many primes, notice that this means that the set $$ \mathscr U \,\,\,\, \overset{def}{=} \,\,\, \bigcup_{p} \,\, p \mathbb Z $$ should be open and closed, but by the fundamental theorem of arithmetic, its complement in $\mathbb Z$ is the set $\{ -1, 1 \}$, which is not open, thus giving a contradiction.   Proof 4 : Let $a,b$ be coprime integers and $c &gt; 0$. There exists $x$ such that $(a+bx, c) = 1$. To see this, choose $x$ such that $a+bx \not\equiv 0 \, \mathrm{mod}$ $p_i$ for all primes $p_i$ dividing $c$. If $a \equiv 0 \, \mathrm{mod}$ $p_i$, since $a$ and $b$ are coprime, $b$ has an inverse mod $p_i$, call it $\overline{b}$. Choosing $x \equiv \overline{b} \, \mathrm{mod}$ $p_i$, you are done. If $a \not\equiv 0 \, \mathrm{mod}$ $p_i$, then choosing $x \equiv 0 \, \mathrm{mod}$ $p_i$ works fine. Find $x$ using the Chinese Remainder Theorem.   Now assuming there are finitely many primes, let $c$ be the product of all of them. Our construction generates an integer coprime to $c$, giving a contradiction to the fundamental theorem of arithmetic.  Proof 5 : Dirichlet's theorem on arithmetic progressions (just so that you not bring it up as an example...)  Do you have any other nice proofs?