I've been having problems on Windows 10: periodically I get a "low memory" warning. A lot of the Super User questions on this topic talk about driver memory leaks, but as I'll explain below mine doesn't fit the criteria found with those. What normally happens for me is my page file gets to about 70-80 GB in size as my "System and Compressed" memory grows. Eventually I start getting low memory warnings until I reboot, and then I'm good again for 5-8 days.  There are a lot of people who complain about System &amp; Compressed memory growing to the point where it causes problems, but unfortunately the common cause (driver memory leak) in those doesn't appear to be immediately the problem for me.  Firstly,  covers a common problem. However, note that a key indicator in that scenario is a high "Non-Paged" memory usage. In my scenario, non-paged memory is not being used that much; I have 16 GB of memory, and I can have 8-9 GB of "System and Compressed Memory" and less than 1 GB of non-paged memory.  The question I linked to suggested utilizing the PoolMon tool. I have done that. The high Nonp processes I've observed have been those with the tag "Thre" and "Py28" and from what I can tell these are not drivers (most Q&amp;A on high system memory usage in Windows 10 will point you to a driver leak).  Another symptom of my issue is that the longer the system is left on, the larger the pagefile gets. For example, before the last reboot the pagefile got to be about 60 GB in size. Also note that I see on my Task Manager screen "Committed" values regularly in the "12.3/50-60 GB range." I have no idea if that is normal or not. But it would at least seem "weird" to me for my page file to get so large.  Edit: Let me make clear what I'm asking here. I am asking, "How can I tell what application is using so much of my system's memory when it appears that System &amp; compressed memory is obscuring the root memory hog from me." Note that again, I have a pagefile that gets up to 80 GB or so in size and NO single application has high memory usage, only the "System and compressed memory" system process. Under older versions of Windows I knew how to tell what applications were using so much memory, but NONE show abnormal memory use now. I don't know if this is because System and compressed memory is "being helpful" and helping manage the memory so the system can run for much longer without running out of it, or what, but I know that I'm running out of memory on my system and no application EVER shows abnormal memory usage in task manager. I'm asking how to find out what is causing this. The closest I've found to an answer for this suggests using PoolMon and looking for an offending driver using large amounts of non-paged memory, but unlike people who have had driver memory leaks, my non-paged memory usage is never very high at all, and no drivers are listed as high memory users when I ran PoolMon.
Since I upgraded to Windows 10, my system has been consuming RAM excessively    I've been reading a bit and determined it's likely a driver leaking memory. So I got myself the Windows Driver Kit and tracked memory usage with poolmon:    However, I don't really know how to proceed from here. Is the item tagged "smNp" the culprit in this issue? How do I go from there to actually identifying the driver?  I tried some stuff like "C:\Windows\System32\drivers>findstr /s smnp ." but it returned no results. I also took a look at the pooltag.txt file and this is the description I found for it:      So yeah, any help would be appreciated. Thanks in advance.
Landscape printing from HTML I have a HTML report, which needs to be printed landscape because of the many columns. It there a way to do this, without the user having to change the document settings?  And what are the options amongst browsers. I'd like to do the equivalent of the following in LINQ, but I can't figure out how:  IEnumerable&lt;Item&gt; items = GetItems(); items.ForEach(i =&gt; i.DoStuff());   What is the real syntax? "Failed to create user" due to regular expression error Is "architect" a verb and a noun? I hear the word architect used as a verb in the technical field and now more often in other industries and groups, for example:     We need to architect a better solution to the problem.   I am interested if this is considered acceptable usage, as I see this word being used more in published technical documents (not necessarily books, but corporate publications).  I can see how a conductor can conduct, a typist can type, but can a scientist "science"?  A scientist might research, analyze, and so forth, as an architect might design, create, build, etc.  Merriam-Webster , however, I have been told that other dictionaries exist that define architect as both a noun and a verb&nbsp;— is there a credible reference or source that authoritatively answers this question? How can I copy files from A to B, only including files that exist in B? I'm on Windows 7 Professional, and this is my scenario :  Folder "Asd" (C:\)              Folder "Asd" (D:\) File 1                          File 1  File 2                          File 3  File 3                          File 4 File 4 File 5   I'd like to select the folder on C:\ (without selecting each single file, of course) and copy it over the same folder on D:. Usually, it will copy all files. But what I'm looking for is to copy only files (from C:) that are contained on folder d:.  So in my case I'd like to replace only File 1, File 3 and File 4.  File 2 and File 5 must be ignored.  Is it possible? Invalid token 'while' in class, struct, or interface member declaration in very simple code I am not sure what the problem is but I keep receiving this error when I try to use a while statement in my code.     Invalid token 'while' in class,   struct, or interface member   declaration   I want to use a while loop to have something continuously update while a statement is true.  The rest of my code is rather long but whenever I type in the syntax:  while(a&lt;b) { //do whatever i want it to do here }   It gives me that compiler error right off the bat. Not quite sure what the problem is. I am doing this in a C# windows application under the Form1.cs file with all the other event handlers (for buttons and such).  Thanks!    I was unaware that loops had to be placed within a method (fairly new to c#), but I tried it and no errors were returned. Thanks for your help everybody!  Previously, I just had the loop within the main class of the program. System settings won't open on Ubuntu 20.04 LTS after adding System76/pop PPA How to print "$" in here-document How can I echo "$" in a here-doc in bash?  For example, I want to have a file with the content on remote server like $ABC=home_dir.  $ ssh hostname sudo -s &lt;&lt;EOF echo "$ABC=home_dir" &gt; file EOF   But it would be treated as a variable. How can I print a literal $? Why does evolution not make life longer for humans or any other species?  Wouldn't evolution favour a long life? Order of product of two elements in an abelian group Will running a large query on a secondary database in an availability group affect transaction performance in the primary database? I need to provide real-time, or almost real-time, data for SSRS and Tableau reporting. I don't want the production OLTP system to be negatively impacted by long running queries. Will running a large query on a secondary database in an availability group affect transaction performance in the primary database? I need a non trivial  examples of group isomorphism that maps $G\to H$ such that   $G/H \cong G$. Uninstalling/reinstalling QGIS plugin where uninstall is disabled? Plugin Raster->TerrainAnalysis->slope which had initially worked, started showing what another questioner referred to as a "crazy histogram":   Before finding his question and the answer, I endeavored to uninstall and reinstall the plugin.  I found/still find (QGIS 2.0.1, now upgraded to QGIS 2.4, on Ubuntu 14.04), the plugin "uninstall" button grayed out/disabled.  It's working, but I am worried about having a plugin I installed that does not offer an option to be uninstalled.  Failing anything else I would be tempted to use the path information to rename the .so library and see if it disappeared. Recently my wife and I traveled to Italy and before we left we got about 85% of our money in travelers checks and the other 15% we carried on in cash. When we arrived there, no one would take our travelers checks and many places did not accept credit cards. Eventually, we found some currency exchange places that would take the travelers checks and give us Euro's, but at a 7-15% fee, which was not really a very fun surprise.   While I was under the impression that it is safer to use travelers checks, it seems that they were not really accepted (the usual explanation being fraud). So the question is, is it best to just exchange your currency at home and carry all of it with you when you travel or are there other alternatives to carrying cash that are safer and cost effective? Let $f$ be a bounded measurable function on a set of finite measure $E$.  For a measurable subset $A$ of $E$, show that $\int_A f = \int_E f \cdot \chi_A$     Lemma: Let $f$ be a bounded measurable function on a set of finite measure $E$.  Suppose $A$ and $B$ are disjoint measurable subsets of $E$.  Then $\int_{A \cup B} f = \int_A f + \int_B f$.   My first approach was to view the problem like this utilizing the above lemma:  $$\int_E  f \cdot \chi_A = \int_{E\setminus A} f \cdot X_A + \int_A f \cdot \chi_A $$  I'm not really sure how the result follows from the above. Almost all standard sources on the existence of Majorana spinors (e.g. Appendix B.1 to Polchinski's "String Theory", Vol. 2) do so in a way I consider inherently ugly:   A priori, we are dealing with an irreducible complex representation $(V,\rho)$ of the Clifford algebra of signature $(p,q)$, i.e. generalized Dirac spinors. That Majorana spinors exist means abstractly that there is a  on $V$, i.e. a conjugate-linear map $\phi : V\to V$ with $\phi^2 = \mathrm{id}_V$ that commutes at least with the $\mathfrak{so}(p,q)$ action.  Every single source I can find for Majorana spinors uses operations like the transpose, complex conjugation and Hermitian adjoint on the $\Gamma$-matrices to obtain matrices acting on the same space. This is abstractly wrong, the transpose acts on the dual, the complex conjugation on the conjugate, and the Hermitian adjoint needs an inner product we have no reason for choosing. Of course, since $V$ is finite-dimensional, one can pick a basis and define the uncanonical isomorphisms to its dual and its conjugate, but I find this inelegant, particularly since the standard derivations require us to make a particular such choice with respect to the signs the $\Gamma$-matrices have under e.g. ${}^\dagger$. Finally, the Majorana spinors are usually defined by some equation involving an unnatural and arbitrary-looking product of $\Gamma$-matrices, which varies from source to source according to different sign conventions and sign choices made in the course of the derivation.  It's inelegant because the rest of the theory of spinors can be developed without making such uncanonical choices. Both the uniqueness of the dimension of the irreducible Dirac representations (there are two of them in odd dimensions) and the existence of the Weyl spinors in even dimensions can be derived purely from the abstract properties of the Clifford algebra, no choices made, no transpose, adjoint or conjugate occuring. The (admittedly slightly subjective question) is: Is there a way to show in which dimensions Majorana spinors exist that neither requires an uncanonical choice of basis nor arbitrary choices of signs?  Some partial results:   In even dimensions, the Dirac representation is necessarily self-conjugate since it is the only irreducible representation of the Clifford algebra, so all that is left to show is that a conjugate-linear $\mathfrak{so}$-equivariant map on it squares to $\mathrm{id}_V$ and not to $-\mathrm{id}_V$. However, I can't seem to exhibit any particular equivariant map on it that one could simply check for its square. In odd dimensions, one first needs to figure out whether the two inequivalent Dirac representations are conjugate to each other or self-conjugate.     As further motivation that a clear proof using only canonical properties of the Clifford algebra itself is required, consider the confusing and contradictory claims in the literature:   Polchinski, "String Theory", Vol. 2, p.434: $\mathrm{SO}(d-1,1)$ has Majoranas for $d = 0,1,2,3,4 \mod 8$, corresponding to a special case of $p-q = d-1-1 = 6,7,0,1,2 \mod 8$. Fecko, "Differential Geometry and Lie Groups for Physicists", pp. 651: $\mathrm{Cliff}(p,q)$ has Majoranas for $p-q = 0,2\mod 8$.  This clearly conflicts with Polchinski's claims e.g. for $d=3$. Figueroa-O'Farrill, , pp. 18: We have Majoranas for $p-q = 0,6,7\mod 8$ and "symplectic Majoranas" for $p-q = 2,3,4\mod 8$.   Note that these results conflict simply by the number of possible $p-q$ regardless of whether I've correctly taken care of the differing conventions of whether $p$ or $q$ denotes timelike dimensions. Generating data with a given sample covariance matrix Execute Java from command line Let $f(z)=\sum\limits_{n=0}^{\infty}a_n z^n$ be an analytic function in $|z|\leq R$ such that $|f(z)|\leq M$. Prove an inequality about $f$'s zero Can a jar that has had botulinum food in it be cleaned If a home canned jar has botulinum in it can the jar be cleaned and saved? If so what is the correct way to clean the jar?