./watchbog is using up 198% of my cpu processor and mem 52%. Solar is the user. I tried stopping solar service but of no use. Watchbog is still running and using up as much space.
This is a  about Server Security - Responding to Breach Events (Hacking)   See Also:                  Canonical Version I suspect that one or more of my servers is compromised by a hacker, virus, or other mechanism:   What are my first steps? When I arrive on site should I disconnect the server, preserve "evidence", are there other initial considerations? How do I go about getting services back online? How do I prevent the same thing from happening immediately again? Are there best practices or methodologies for learning from this incident? If I wanted to put a Incident Response Plan together, where would I start? Should this be part of my Disaster Recovery or Business Continuity Planning?   Original Version       2011.01.02 - I'm on my way into work at 9.30 p.m. on a Sunday because our server has been compromised somehow and was resulting in a    attack on our provider. The servers access to the Internet   has been shut down which means over 5-600 of our clients sites are now   down. Now this could be an FTP hack, or some weakness in code   somewhere. I'm not sure till I get there.      How can I track this down quickly? We're in for a whole lot of   litigation if I don't get the server back up ASAP. Any help is   appreciated. We are running Open SUSE 11.0.            2011.01.03 - Thanks to everyone for your help. Luckily I WASN'T the only person responsible for this server, just the nearest. We managed   to resolve this problem, although it may not apply to many others in a   different situation. I'll detail what we did.      We unplugged the server from the net. It was performing (attempting to   perform) a Denial Of Service attack on another server in Indonesia,   and the guilty party was also based there.      We firstly tried to identify where on the server this was coming from,   considering we have over 500 sites on the server, we expected to be   moonlighting for some time. However, with SSH access still, we ran a   command to find all files edited or created in the time the attacks   started. Luckily, the offending file was created over the winter   holidays which meant that not many other files were created on the   server at that time.      We were then able to identify the offending file which was inside the   uploaded images folder within a  website.      After a short cigarette break we concluded that, due to the files   location, it must have been uploaded via a file upload facility that   was inadequetly secured. After some googling, we found that there was   a security vulnerability that allowed files to be uploaded, within the   ZenCart admin panel, for a picture for a record company. (The section   that it never really even used), posting this form just uploaded any   file, it did not check the extension of the file, and didn't even   check to see if the user was logged in.      This meant that any files could be uploaded, including a PHP file for   the attack. We secured the vulnerability with ZenCart on the infected   site, and removed the offending files.      The job was done, and I was home for 2 a.m.            The Moral   - Always apply security patches for ZenCart, or any other CMS system for that matter. As when security updates are released, the whole   world is made aware of the vulnerability.   - Always do backups, and backup your backups.   - Employ or arrange for someone that will be there in times like these. To prevent anyone from relying on a panicy post on Server   Fault.
How to resolve BackgroundContainer.dll error on startup? When I start my desktop it gives me an error about BackgroundContainer.dll.    How to get rid of it?  I found nothing when i started regedit.exe and searched (F3 or CTRL+F) for BackgroundContainer.dll I'm buying a bus ticket to get to Boston 23 hours before my flight to ensure I reach my departure airport on time.  If I didn't arrange bus transport well in advance, what legal remedies would I have if a delayed bus caused me to miss my flight? Set Snap Mode with PyQGIS I am trying to set snap mode within QGIS plugin.  So far, I have tried:  QgsSnappingUtils().setSnapToMapMode(QgsSnappingUtils.SnapAdvanced)   and  QgsSnappingUtils().setSnapToMapMode(2)   without success.  QGIS Snapping options (Settings>>Snapping Options...) continue with:  Snapping mode = Current layer  Any hint? (Using v 2.14.0) Does anyone know if there are any video formats (besides the HUGE uncompressed avis) that you can render in that maintain the alpha channel? (i.e. for after FX etc.)   I used to use quicktime, but that's no longer an option.  I know you can render in png. or other image formats, but video is significantly smaller, and I often work on machines with less space &amp; resources. He has  yet to receive an appointment.   He is yet to receive an appointment.      Is there any difference in meaning? Is one more correct than the other? How to check if specific column exists in an Access database table I want to prove the definition of limit of a function from definition (1) to definition (2).  (1) A function $f(x)$ is said to have $f^*$ as the limit as $x$ tends $x^*$ iff for every sequence $\{x_n\}$ with limit $x^*$, the limit $\lim_{n-&gt;\infty}f(x_n)$ exists and is equal to $f^*$. (2) A function is said to have $f^*$ as the limit as $x$ tends $x^*$ iff for each $\epsilon &gt;0$, there exists a $\delta_\epsilon &gt;0$ such that $|f(x)-f^*| &lt;\epsilon \forall |x^*-x|&lt;\delta_\epsilon$  I am confused about the steps. Suppose I am given an $\epsilon &gt; 0$ and $x^*$. I have to show the existence of a $\delta_\epsilon &gt;0$ such that for all $x$ satisfying  $|x^*-x|&lt;\delta_\epsilon$ I can construct a sequence $x_n$ which converges to $x^*$ and $x_n=x$ for some $n \geq N$. Then I can say that $f(x_n)-f^*=f(x)-f^* &lt; \epsilon$. I think I may have made some mistake about the steps.  My main confusion is the following : Suppose I choose $\delta_\epsilon=\epsilon$. Then if a sequence $\{x_n\}$ converges to $x^*$ then $x_n=x$ (where $x$ satisfies $|x-x^*|&lt;\epsilon$) for some $n\geq N$. Now, $\lim_{n-&gt;\infty}f(x_n)$ exists implies there exists an $M$ such that $\forall n\geq M$, $f(x_n)-f^* &lt;\epsilon$. Now, I need to show that for some $n \geq M$ indeed $x_n=x$. How do I show that ? This $M$ and $N$ are different. How do I copy vertex groups from one object to another? Where in Europe can I purchase a car without residency? I am not a resident anywhere and plan to travel for the foreseeable future, mostly in Europe. My country has good visa-free access to most of Europe, so it is conceivable I could remain without any residency for quite some time.  I enjoy driving, and maintaining cars, and I would like to purchase a car somewhere in Europe.  Where, if anywhere, in Europe (or outside of Europe, but with the ability to drive the car in Europe) can I legally purchase and insure a car as a non-resident? I am open to creative solutions like setting up a company to own the car, if the capital and ongoing paperwork requirements for the company are not too onerous.    I am aware that I could save money, get places quicker, etc, by taking trains or flying. I have a passion for cars and driving. Suggesting that I not buy a car is out of scope of this question. Total space of a finite rank locally free sheaf, Vakil's 17.1.4 & 17.1.G Moving an already-running process to Screen My office job routinely sees me connected to a Linux box via VNC.  Sometimes I start a remote job on the console, and realize later that it runs much longer than expected. (Should have started that one under Screen in the first place...)  I don't want to keep my workstation running overnight just to keep the VNC session open; I would like  to move that already-running remote job into a Screen session (on the remote box), so I can power down the workstation (and reconnect next morning).  How can this be done, if at all? Having problems with hair transparency using cycles. I ported over a model from daz studio (have done this a few times before with no issues).   Using a simple mix shader, transparent top, diffuse bottom, black/white texture in the fac.  Heres the blend  with images packed. Is a time series the same as a stochastic process? A stochastic process is a process that evolves over time, so is it really a fancier way of saying "time series"? Is a capacitor in an open circuit charged? Say I have a circuit consisting of a battery, a wire, an open switch, and a capacitor. The circuit is open since the switch is open.  My book says that the capacitor will only be charged when the switch is closed, but I don't see why this is true. I would expect the capacitor to be charged a little - not as much as if the circuit is closed, but still charged none the less.  To further illustrate my point consider this: If the circuit is open, the current must be zero. Consequently the field must be zero. For the field to be zero, the capacitor's field must cancel out the battery's field. Therefore the capacitor must be charged.  Generalizing this concept, shouldn't capacitors be charged (to a lesser degree) in open circuits?  EDIT: In other words, if the field is zero, the capacitor must be charged to cancel out the field of the battery. Lock time not involved in MySQL slow query selection? I wish to analyze some read-write contentions problems on a very huge table where writes are very fast, less than 1ms in most case. The point is that the contention makes those write queries sometimes wait for the lock for a long time, i.e. hundreds of milliseconds. But the query itself remains very fast so it's not selected as a "slow query", which threshold is actually 10ms.  The only way to gather the information I need is to put à 0ms threshold so I can capture all queries, but it's not sustainable for more than 10mn on our production environment, where it would produce about 200MB of logs per minute.  In fact I can't understand why MySQL don't include the lock time, added to the execution time, for the slow query log selection process. At least, I wish there were an option for that.  Am I missing something ? This question is similar, but not identical to:   Whereas the aforementioned question is about whether the hand’s movement is measured from the hand’s point of view or from the caster’s, this question revolves around the total distance the hand can travel to reach its destination.  To illustrate, let me give an example: Two narrow stone pillars stand next to each other, 10 feet apart. They are several kilometers high and on top of each pillar stands a wizard. One wizard casts Maximillian's Earthen Grasp and lets the hand made from compacted soil rise from the ground on his own pillar. With another action, he wants to move the hand in order to restrain the other wizard, who is within range of 30 feet.  Would the hand retract into his own pillar, then rise again from the ground on the other pillar? Or would the hand move several kilometers down the first pillar, across the floor, then several kilometers up the second pillar? What if both pillars would float in the Astral Plane, without a direct ground-based connection between them?  This might seem like a stupid and unnecessary convoluted question, but lo and behold, something similar happened in one of my games. Why isn't $\mathbb Z [\sqrt{pq}]$ a factorial domain This is exercise 8 on page 147 of Jacobson's Basic Algebra:     Let $p$ be a prime of the form $4n+1$ and let $q$ be a prime such that $ \left( \frac{q}{p} \right) =-1$. Show that $\mathbb Z[\sqrt{pq}]$ is not factorial.   Here, $ \left( \frac{q}{p} \right) =-1$ means that $\overline{q}$ is not a quadratic number in the field $\mathbb Z / (p)$.  In the special case when $p=5$ and $q=2$, $9 = 3 \cdot 3 = (\sqrt{10} +1 )(\sqrt{10 }-1)$, with $3$ and $\sqrt{10} +1$ or $\sqrt{10} - 1$ nonassociates. But I have no idea what can I do with the general case.  I know that primes of the form $4n+1$ can be written in the form $m^2 + n^2$ with $m,n \in \mathbb Z$. But when $q$ is odd and not of the form $4n+1$, $pq$ is not the sum of two quadratic numbers. How can I use the fact $\left( \frac{q}{p} \right) =-1$?  Thanks~ About an Hour ago, I faced a problem and tried different ways to solve it.  At last I was going to post my Question on Stack Overflow, but the last trick which came in my mind worked, and the problem got resolved.    Now, if I want to post that problem on Stack Overflow with the solution which worked for me, for the purpose to help other newbies to get their answer if they face the same problem, what is the proper way of posting such solution to a problem? Defining the Complex numbers I posted this question nearly 10 days ago, but am still really not satisfied with the answers I got, I have no prior education in abstract algebra, group theory, or other abstractions, and most of the answers I got involved defining sets, groups and other things I am unfamiliar with, my question was,  How does one know the notion of real numbers is compatible with the axioms defined for complex numbers, ie how does one know that by defining an operator '$i$' with the property that $i^2=-1$, we will not in some way contradict some statement that is an outcome of the real numbers.  For example if I defined an operator x with the property that $x^{2n}=-1$, and $x^{2n+1}=1$, for all integers n, this operator is not consistent when used compatibly with properties of the real numbers, since I would have $x^2=-1$, $x^3=1$,thus $x^5=-1$, but I defined $x^5$ to be equal to 1.  How do I know I wont encounter such a contradiction based upon the axioms of the complex numbers.  I reiterate here again, Please don't use terminology, or abstract math, that hasn't been taught in say a thorough collage level calculus 1 course.  Here's a link to the same question I asked 8 or so days ago: Existence of a simple closed curve which is not null-homotopic Problem. Assume that $U$ is an open and connected subset of $\mathbb R^2$, and $\gamma :[0,1]\to U$ is a closed curve, which is not null-homotopic in $U$ and not necessarily simple closed. Show that there exists a simple closed curve, which is not null-homotopic in $U$.  I am sure that this is a standard problem, and I am looking for an elegant, if possible, solution or a reference. I have in mind the following sketch of proof:  a. Construct a polygonal closed curve $\tilde\gamma$ which is homotopic with $\gamma$ in $U$.  b. Construct $\tilde\gamma$ so that it intersects itself in finitely many points, and not whole segments.  c. Use induction on the number of self–intersections of $\tilde\gamma$, in order to show that $\tilde\gamma$ is written as a product (in the fundamental group's sense) of simple closed polygonal curves.