Antimalware Service Executable (Win10) has had disk usage pegged at 100% for five hours and counting. Is there any way to get some level of detail what specifically it's doing and/or an estimate of when it will be done?   This seems pretty basic but every search I've tried yields piles and piles of "solutions" that involve disabling the service. I don't want to do that. What is Antimalware Service Executable actually doing? What other solutions are there to fix the problem?  Edit: Explanation of why it is not a duplicate question:  The single answer on the "" is installing a different antivirus program. That's not in any sense an answer for how to find out what Antimalware Service Executable is doing.  Edit: I did not change the subject and I don't think it reflects the question. I am not asking how to make the process stop having high disk usage. I'm asking how to get some information about what the process is currently doing instead of just guessing.
Ever since upgrading to Windows 10 1903 the other day, my CPUs have all been pegged at 100%.  "Antimalware Service Executable" is using 60%, and "Microsoft OneDrive (32 bit)" is using 35% (with the other 5% being spread amongst everything else running).  After running like this for a day or so my computer case (Surface Tablet) is smoking hot.  How can I find out what's causing this problem?  Is there logging I can review for those services?  Known issues with 1903 that I just can't find on Google?
Possible Duplicate:          The FAQ specifies that:     Use your downvotes whenever you encounter an egregiously sloppy, no-effort-expended post, or an answer that is clearly and perhaps dangerously incorrect.   But if I find a correct question, closed (or not yet) as duplicate, is downvote a correct behavior for Stack&nbsp;Overflow policy? Proof that $\inf A = -\sup(-A)$ Does League of Legends have a tournament that is recognized as the 'Most Important'? C# Change A Button's Background Color Show that the series $\sum\limits_{n=2}^{\infty} \frac {(n^3+1)^{1/3}-n}{\log n}$ converges Show that the series $$\sum\limits_{n=2}^{\infty} \frac {(n^3+1)^{1/3}-n}{\log n}$$ converges.   I showed it using Abel's theorem and limit comparison test. Any other simpler method? Prove that $(a+1)(a+2)...(a+b)$ is divisible by $b!$ The problem is following, prove that:  $$(a+1)(a+2)...(a+b)\text{ is divisible by } b!\text{ for every positive integer a,b}$$    I've tried solving this problem using mathematical induction, but I don't think that i did it correctly. Here's what i've done  $1.\ b=1\ (Basis)$  $$b!| (a+1)(a+2)...(a+b)$$ $$1 | a+1 \text{, which is true}$$  $2.\ b=k\ (Induction\ Hypothesis)$  $$k! | (a+1)(a+2)...(a+k)\text{, we assume it's true}$$ $$k!*n = (a+1)(a+2)...(a+k)\text{, n is some positive integer}$$  $3.\ b=k+1\ (Inductive\ Step)$  In order to prove I should get:  $$(k+1)!*m = (a+1)(a+2)...(a+k)(a+k+1)\text{, where m is some positive integer}$$ $$(a+1)(a+2)...(a+k)(a+k+1) = k!*n*(a+k+1)$$ $$(a+1)(a+2)...(a+k)(a+k+1) = (k+1)!*n + k!*n*a$$ $$(a+1)(a+2)...(a+k)(a+k+1) - a(a+1)(a+2)...(a+k) = (k+1)!*n$$ $$(a+1)(a+2)...(a+k)(k+1) = (k+1)!*n$$  And as you can see I'm returning at the beginning.  Also I've tried to use the fact that in b consecutive numbers, there must be at least one that divides b, but since i eliminate that number (because I couldn't be sure that the quotient is divisible with (b-1) or (b-2) or ... or 2. And after this i can't continue with (b-1) using this method, because it's not necessary for the other (b-1) to be consecutive. Can I live in the UK for a long time through repeat visits? I had recently entered the UK without a visa to be with my partner, from 21 July 2016 until 16 December 2016. I hope to return on the 9th of January. We don't meet the income requirement for a Spouse visa. I recently applied to university, and got in, and was intending to return to the UK on a student visa, but my university did not tell me about maintenance fees and my loan wasn't large enough to cover it all, so my visa would have been denied.  Now, I am hoping to attend university in the next semester, and therefore return to the US to apply for that visa. Do you think that if I try to return to the UK without a visa, I will be turned away?  I won't be working or studying during this time, however, I'm afraid that they'll consider it living in the UK illegally; I don't have a criminal record or anything like that. If we had an airtight container that was large enough, say extended out to the Karman line, would there still be a pressure gradient? If we assume that the pressure at the bottom was $1\ \mathrm{atm}$, would it have the same exact pressure gradient at 6 miles up on the outside? This is assuming that the gravity is still $9.8\ \mathrm{m/s^2}$. Incompatible Software for next OSX? I understand the move past Snow Leopard meant losing Rosetta, and compatibility with any PPC apps.   Since there are some apps that can't be replaced (for example, old years of TurboTax that I might need to reference) I have a drive to boot Snow Leopard, and one for Yosemite. I was considering the jump to El Capitan, when I saw the question  which got me wondering the question -     Before installing a next generation OS, is there any way to find, in   advance, which apps I have that would be orphaned by the move?   Edit, the answer below from Jean Valjean was what I needed. One app concerning me appeared as follows:    It might be tedious to search many apps, but at least this gives me a chance to view the top ones that will cause me grief. My prof gave us this definition of an Echelon system:     A system of m linear equations in n variables is called an echelon system if         m ≤ n.   Every variable is the leading variable of at most one equation.   Every leading variable is to the left of the leading variables of all lower equations.   Every equation has a leading variable.      I don't understand this definition at all.  Q1)If you have this system of equations:  $ax_1 + bx_2 + cx_3 = z$  $dx_1 + ex_2 + fx_3 = z$  its not an echelon system because of multiple equations having the same variable as the leading variable and therefore violating rule #2.  But if you switch around variables and rewrite the equation as:  $ax_1 + bx_2 + cx_3 = z$  $ex_2 + dx_1 + fx_3 = z$  It becomes an echelon system! Why would the way you write a system of equations affect its definition?  Q2)Why would point number three matter? Can't you just move around the equations so that they are in order of variables?  Q3)Why would point number four matter? If you have a equation in the system that doesn't have a leading variable can't you just disregard it? For example if you have the equation $0x = 0$ in the equation can't you just ignore it to have a echelon system since it doesn't affect the solution of the system? Group presentation for discrete Heisenberg group Does a photon in vacuum have a rest frame? A large number of variants of this question were already asked here, including these - , , which are close, but none seem to answer my question. Assume that $n$ balls are thrown randomly and independently into $k$ bins.  What is the probability of finding $x$ empty bins? What is the expectation of the number of empty bins? Can't watch youtube videos with chromium on ubuntu 13.04 64-bit I've digged all over google but I can't find any solution to my problem.   Firefox works pretty well. I have this issue only with chromium and only with youtube. I have no problem watching videos at any other site with chromium.   When I try to watch a video a black screen occurs and after a while it gives me the warning "an error occurred". Weirdly, sometimes when I try a couple of refreshing it starts to play but then the issue occurs again.  I tried removing-reinstalling chromium or the flash plugin but it did not do any good. With the new  and the upcoming release of  film, JK Rowling has been awesome and given us new writing on the .  In the introduction it is stated that there are eleven established/registered schools. There are writings for six of them. I don't think we need a new writing for Hogwarts... so that means seven have been located and defined.   Hogwarts School of Witchcraft and Wizardry - Great Britain  - France  - Northern Europe (possibly Estonia, Latvia, or Belarus)  - Japan  - Africa (possibly Congo/DRC)  - Brazil  - United States   Do we know anything of possible location or names of the other four schools? I know Koldovstoretz was mentioned as school in Russia, but is that still canon?   Koldovstoretz - Russia (maybe depending on current canon)   The final three are my guesses based on the population and geography on the world.   Name Unknown - China (based on population) Name Unknown - India (based on population) Name Unknown - Australia (based on geography)   Related: Fedora 25 and disabling whatever is listening on port 111 I've got a Fedora 25 x86_64 stand alone workstation. Something is listening on port 111 (identified with an nmap scan):  $ sudo lsof -i :111 COMMAND PID USER   FD   TYPE DEVICE SIZE/OFF NODE NAME systemd   1 root   36u  IPv4  15170      0t0  TCP *:sunrpc (LISTEN) systemd   1 root   37u  IPv4  15171      0t0  UDP *:sunrpc systemd   1 root   38u  IPv6  15172      0t0  TCP *:sunrpc (LISTEN) systemd   1 root   39u  IPv6  15173      0t0  UDP *:sunrpc   I disabled the Sun gear on the port with the following commands:  $ sudo systemctl disable rpcbind $ sudo systemctl disable sunrpc Failed to disable unit: No such file or directory   After reboot the port is still open.  It appears something other than Sun gear wants to listen on port 111. Or maybe systemd is not respecting my wishes to disable the unused service. Or maybe something else...  How do I determine what is trying to listen on the port, and how do I disable it?    From below:  $ sudo systemctl -a | grep -E "rpc|port"   var-lib-nfs-rpc_pipefs.mount          loaded    active   mounted   RPC Pipe File System   abrtd.service                         loaded    active   running   ABRT Automated Bug Reporting Tool   auth-rpcgss-module.service            loaded    inactive dead      Kernel Module supporting RPCSEC_GSS   fedora-import-state.service           loaded    active   exited    Import network configuration from initramfs   fedora-readonly.service               loaded    active   exited    Configure read-only root support   rpc-gssd.service                      loaded    inactive dead      RPC security service for NFS client and server   rpc-statd-notify.service              loaded    inactive dead      Notify NFS peers of a restart   rpc-statd.service                     loaded    inactive dead      NFS status monitor for NFSv2/3 locking. ● rpc-svcgssd.service                   not-found inactive dead      rpc-svcgssd.service   rpcbind.service                       loaded    inactive dead      RPC Bind   rpcbind.socket                        loaded    active   listening RPCbind Server Activation Socket   rpc_pipefs.target                     loaded    active   active    rpc_pipefs.target   rpcbind.target                        loaded    active   active    RPC Port Mapper Lualatex and bm package I've updated my latex packages yesterday and have now issues with lualatex. One problem arising for me now is, that lualatex does not print bold characters using the bm package.  When I compile the following MWE with pdflatex everything looks okay, but for lualatex it doesn't:  \documentclass{article} \usepackage{bm} \begin{document} % Bold $\bm{E}$ \\ Normal $E$ % \end{document}   Output using pdflatex    using lualatex    Also trying to fall back to an earlier version of lualatex by using \RequirePackage{luatex85} does not work for me.  When having a look at the log file, there are the suspicious messages   LaTeX Font Info:    Redeclaring math alphabet \mathbf on input line 142. LaTeX Info: Redefining \bm on input line 208. [...] Missing character: There is no х (U+0445) in font cmmi10!   Can anyone tell me, what is going on here and what I need to do to solve this problem, since I am quite sure lualatex and bm worked before? Ubuntu 20.04 graphics driver problem I have upgraded from Ubuntu 19.10 to 20.04, and now I have a problem with my graphics rendering (strange squares on background and font problems). I use the i915 driver. Graphics card: Skylake GT2 HD Graphics 520. I tried to reinstall GNOME shell and Xorg server. Nothing helped. Also Chrome browser breaks on most of pages. av_acharya@AnoxBotox:/$ wireshark qt.qpa.plugin: Could not find the Qt platform plugin &quot;xcb&quot; in &quot;path/to/plugins&quot; This application failed to start because no Qt platform plugin could be initialized. Reinstalling the application may fix this problem.   sudo apt-get install --reinstall qt5-default Reading package lists... Done Building dependency tree        Reading state information... Done The following NEW packages will be installed:   qt5-default 0 upgraded, 1 newly installed, 0 to remove and 23 not upgraded. Need to get 0 B/24.4 kB of archives. After this operation, 170 kB of additional disk space will be used. Selecting previously unselected package qt5-default:amd64. (Reading database ... 241279 files and directories currently installed.) Preparing to unpack .../qt5-default_5.12.8+dfsg-0ubuntu1_amd64.deb ... Unpacking qt5-default:amd64 (5.12.8+dfsg-0ubuntu1) ... Is there an algorithm to decide if a symlink loops? Unix systems usually just error out if they are confronted with a path that contains a symlink loop or just too many symlinks, because they have a limit to the number of symlinks they will traverse in one path lookup. But is there a way to actually decide if a given path resolves to something or contains a loop, even if it contains more links than a unix is willing to follow? Or is this a formally undecidable problem? And if it can be decided, can it be decided in a reasonable amount of time/memory (e.g. without having to visit all files on a filesystem)?  Some examples:  a/b/c/d where a/b is a symlink to ../e and e is a symlink to f and f is a symlink to a/b  a/b/c/d where a/b/c is a symlink to ../c  a/b/c/d where a/b/c is a symlink to ../c/d  a/b/c/d where a/b/c is a symlink to /a/b/e where a/b/e is a symlink to /a/b/f where a/b/f is a symlink to /a/b/g   Edit:  To clarify, I am not asking about finding loops in the file system, I am asking about a decision algorithm that decides of a given path whether it resolves to a definite file/directory or whether it does not resolve at all. For example in the following system, there is a loop, but the given path still resolves fine:  / -- a -- b where b is a symlink to /a   This directory tree clearly has a cycle, but the path a/b/b/b/b/b still resolves fine to /a.