Since a few days ago I've been observing some strange recurrent outgoing UDP traffic from my server on port 24441 but since it's not constant, I cannot seem to find what's causing it.  All I can see is the following in iptables logs:  Nov 15 00:46:33 server kernel: [17216276.676673] Firewall: *UDP_OUT Blocked* IN= OUT=eth0 SRC=&lt;SERVER_IP&gt; DST=5.9.124.53 LEN=192 TOS=0x00 PREC=0x00 TTL=64 ID=0 DF PROTO=UDP SPT=60641 DPT=24441 LEN=172 UID=501 GID=513   I suspect it's some kind of malware running periodically from my server but want to find out what exactly. Can someone shed a light on how to catch this/log the source of this automatically when it happens? I'm running Centos 6.7. Thanks!
My machine is continously making udp dns traffic request. what i need to know is the PID of the process generating this traffic.  The normal way in TCP connection is to use netstat/lsof and get the process associated at the pid.  Is UDP the connection is stateles, so, when i call netastat/lsof I can see it only if the UDP socket is opened and it's sending traffic.  I have tried with lsof -i UDP and with nestat -anpue, but I can't find wich process is doing that request because i need to call lsof/netstat exactly when the udp traffic is sended, if i call lsof/netstat before/after the udp datagram is sended is impossible to view the opened UDP socket.  Call netstat/lsof exactly when 3/4 udp packet is sended is IMPOSSIBLE.  How I can identify the infamous process? I have already inspected the traffic to try to identify the sended PID from the content of the packet, but is not possible to identify it from the contect of the traffic.  Anyone can help me ?  I'm root on this machine FEDORA 12 Linux noise.company.lan 2.6.32.16-141.fc12.x86_64 #1 SMP Wed Jul 7 04:49:59 UTC 2010 x86_64 x86_64 x86_64 GNU/Linux
Highlight elements in the matrix Induction proof (bitstring length) Theorem : The number of bitstrings with the length $x$ that begin with $1$ and/or end with $0$ is  $3 \times 2^{x-2}$.  I know there are easier ways to prove this but I must figure out how to do it with induction. Calculating the expected values of the min/max of 2 random variables When I receive a message on an SE post, I get a notification like this:    If I double tap this notification, the SE application opens, but my feed is empty approximately half the time. It looks like this:    If I refresh the feed (slide from the top), the feed does refresh and shows the new notification.   The notification, above, leads to  comment.  I haven't figured out the pattern yet, but this occurs roughly half the time I open a notification. It's occurred for chat messages, comments and answers - but not consistently. I have received notifications for the same post (for example, the two comments after the one linked above) that do not show an empty feed. But, a chat message barely 10 minutes later will show the empty feed again.  I am utilizing the beta app - version 1.0.72 on Android 5.0.1. Voldemort ordered Nagini to kill Snape in hopes of claiming the Elder Wand's ownership.  Let's suppose that Snape was indeed the owner.  In this scenario, would the Elder Wand's ownership truly pass to Voldemort?  I ask this because, after all, the one who overpowered Snape was Nagini, not Voldemort.   Voldemort ordered Nagini to kill Snape. However, this would be equivalent to ordering a Death Eater to kill Snape, in which case the Death Eater would gain the ownership - in a similar manner, Nagini is the murderer. Nagini isn't a "spell": remember how Draco summoned a snake to attack Harry back at CoS? If that snake kills Harry, I'd imagine that Draco gains the ownership (if Harry had the Elder Wand) because that snake was a "spell" casted by Draco - but this time is different, because Nagini isn't a "spell" casted by Voldemort, but rather an actual third-party creature.   The curious thing is that Voldemort did cast some sort of spell (he flicked his wand), which I think caused Nagini's barrier to break so Nagini could kill Snape. In some way, Voldemort did provoke Snape's death - however, it was mostly indirectly.  So, would the ownership pass to Nagini or to Voldemort? If it passes to Nagini, would the Elder Wand's "ownership cycle" end, or would it continue if Voldemort decides to kill Nagini?    The simplified version of this question is: if an animal kills the owner of the Elder Wand, what happens to its ownership? If $H$ has maximum vertex degree at most $3$ and is a minor of $G$, then $H$ is a topological minor of $G$. If  $H$ has maximum vertex degree at most $3$ (so $\Delta(H)\leq 3$) and $H$ is a minor of $G$, then $H$ is a topological minor of $G$.   The converse follows by definition. However, most sources state this proposition without a proof. Any help is greatly appreciated. Misleading chat usercard on SE 2.0 chat Are Tolkien Elves taller or shorter than Men?  In general fantasy, elves are frequently smaller than humans. But I seem to recall that in Tolkien they aren't.  Based on Downgrading MacBook Pro 16” to Mojave Did anyone succeed in installing Mojave on the MacBook Pro 16”? It ships with Catalina but my corporate requires Mojave to connect to the corporate network.  I  but once I select booting from the Mojave external drive I get a “forbidden” icon and the system shuts down. This may be a very basic question.      Let $R$ be a commutative ring with unity (may be assumed to be an integral domain, if necessary) and $I$ be an ideal of $R$. Assume that $R/I$ is isomorphic to $R$. Does this mean $I=(0)$ ? What is a Vanilla JS or jQuery solution that will select all of the contents of a textbox when the textbox receives focus? I had some NEF files in a folder that I didn't do anything with. When importing them in Lightroom, no previews and a "file unsupported or damaged message" So I tried with Nikons ViewNX, nothing. Even not in DxO or PhotoMechanic.  I had a look with EXIFTool and the corrupt file prints me only this:  ExifTool Version Number         : 8.39 File Name                       : _DSC5559.NEF Directory                       : /Users/tunafish/Desktop File Size                       : 12 MB File Modification Date/Time     : 2010:11:29 12:46:56+01:00 File Permissions                : rwxrwxrwx Error                           : File format error   I saw another question on photo.stack  and tried to copy over the makernotes from a good file (_DSC5556.NEF) with  exiftool -tagsfromfile _DSC5556.NEF -makernotes _DSC5559.NEF   but EXIFTool gives me this error  Error: Not a valid TIFF - _DSC5559.NEF 0 image files updated 1 files weren't updated due to errors   I have uploaded 2 NEF's, with _DSC5559.NEF being the corrupt one here: How to explain the different forms of the Hamilton-Jacobi equation? In Arnold's Mathematical Methods of Classical Mechanics, he derives the Hamilton-Jacobi equation (HJE) using a generating function $S_1(Q, q)$ to get  $$ H\left(\frac{\partial S_1(Q, q)}{\partial q}, q, t \right) ~=~ K(Q, t). $$  However, this is different from what I've seen in other physics texts. For example, Goldstein uses the generating function $S_2(q, P, t)$ to get the equation  $$ H\left(\frac{\partial S_2(q, P, t)}{\partial q}, q, t\right) ~=~ - \frac{\partial S_2(q, P, t)}{\partial t}. $$  Why is there this difference? Are the two equations saying the same thing? Rigorously proving equal tension on both ends There is always one point in introductory mechanics that has been continuously bothering me ever since I had taken my freshman physics course - Why does a massless rope have its tension equal on both ends?  I have been searching for a good explanation on various textbooks at different levels, but none of them provided me a satisfactory explanation. They either   State directly "we assume the string is massless and the pulley has no friction, therefore the tension must be the same throughout the string" without further any elaboration and continue the calculation, Claim without any reasons that "whenever the rope and the pulley are massless and frictionless, the tension will be the same on both sides", or Explain using a lot of hand-waving arguments regarding infinite acceleration, non-zero moment of inertia, etc. , in one line or two.   Although those hand-waving arguments of type $(3)$ do sound quite reasonable to me and will convince me for a while every time I review them. But after a while, I will start feeling not well about this whole tension concept again.  Therefore, I am looking for a rigorous (in the physicist's sense) proof of exactly why and when do the tension in rope will be uniform, and hopefully from that I can clean up all of my conceptual difficulties. Shannon confusion and diffusion concept I read the document(not the whole document) from Shannon where he speaks about the concepts of confusion and diffusion. I read in many places(not in the document but around the internet) that confusion is enforced using substitution. Diffusion is enforced using permutation/transposition. Ciphers must use both of them because either confusion or diffusion alone are not enough. I read that a substitution cipher can apply by itself confusion(only). Permutation/Transposition applies by itself diffusion(only). It's precisely the last case that bothers me: Can a permutation/transposition cipher by itself apply diffusion?  Shannon explains diffusion as a property that spreads statistic properties of text all over the text preventing statistic analysis. It's frequently translated to: an alteration to a plaintext symbol affects many cipher text symbols. Assuming permutation of bits or characters, how can diffusion be achieved by simple permutation? I mean, if you permute bits, there will be no other bits affected. But if you consider a symbol a character and you permute bits, a change in a character will affect many other characters. It's a question of what is a symbol.  I also read versions of this diffusion concept where the point was just changing bits order just to avoid pattern analysis of the text. But, where is the avalanche effect in simple permutation?  So, what is the correct definition and the implications of diffusion?  I hope you understand what is troubling me.  Thank you once more $M /K \land L /K$ algebraic $\implies ML/K$ algebraic? Generalized mean value theorem I know and understand the mean value theorem. But at the moment I don't have the intuition to understand the generalized mean value theorem     If $f$ and $g$ are continuous on the closed interval $[a,b]$ and differentiable on the open interval $(a,b)$, then there exists a point $c\in(a,b)$ where$$[f(b)-f(a)]g'(c)=[g(b)-g(a)]f'(c).$$If $g'$ is never zero on $(a,b)$, then the conclusion can be stated as$$\frac{f'(c)}{g'(c)}=\frac{f(b)-f(a)}{g(b)-g(a)}.$$   What is the intuition? And how can you prove this (generally) ? How do I generate random integers within a specific range in Java? How do I generate a random int value in a specific range? I have tried the following, but those do not work: Attempt 1: randomNum = minimum + (int)(Math.random() * maximum);  Bug: randomNum can be bigger than maximum. Attempt 2: Random rn = new Random(); int n = maximum - minimum + 1; int i = rn.nextInt() % n; randomNum =  minimum + i;  Bug: randomNum can be smaller than minimum. Proof of the equality $\sum\limits_{k=1}^{\infty} \frac{k^2}{2^k} = 6$ Occasionally I see an old Meta post that has no status tag (like ), but from the answers it looks like the question is resolved.  Example:  should be  since the answers say HTTP compression actually is enabled.  Is it worth flagging these questions, or is that a waste of time?