How to count packets coming from outside using iptables? If you don't give iptables a target, it simply counts how many bytes and packets match the rule. I'd like to count all packets that come from outside, i.e. don't match 10.0.0.0/8 and don't match 192.168.0.0/16.  My first intuition is:  iptables -A INPUT ! -s 10.0.0.0/8,192.168.0.0/16   However this adds two rules, of which each count separately, and no count of outside packets is discernible. So how do I count outside packets?
Iptables rules with ! character I have entered iptables rules to log a specific connection on our server, but it doesn't seem to be working as I want it to. Here are the rules:  1    LOG        tcp  -- !10.51.0.0/16         0.0.0.0/0           state NEW    tcp dpt:8040 LOG flags 0 level 4 prefix `New Connection_8040TCP: ' 2    LOG        tcp  -- !192.168.0.0/16       0.0.0.0/0           state NEW tcp dpt:8040 LOG flags 0 level 4 prefix `New Connection_8040TCP: '   Iptables should log only IP connections which are not in the specified networks, but it keeps logging all connections from all IP addresses.
Show that a positive operator on a complex Hilbert space is self-adjoint Let $(\mathcal{H}, (\cdot, \cdot))$ be a complex Hilbert space, and $A :  \mathcal{H} \to \mathcal{H}$ a positive, bounded operator ($A$ being positive means $(Ax,x) \ge 0$ for all $x \in \mathcal{H}$). Prove that $A$ is self-adjoint. That is, prove that $(Ax,y) = (x, Ay)$ for all $x,y \in \mathcal{H}$. Here's what I have so far. Because $A$ is positive we have $\mathbb{R} \ni (Ax,x) = \overline{(x,Ax)} = (x,Ax)$, all $x \in \mathcal{H}$. Next, I have seen some hints that tell me to apply the polarization identity: $$(x,y) = \frac{1}{4}((\lVert x+y \rVert^2 + \lVert x-y \rVert^2) - i(\lVert x + iy \rVert^2 - \lVert x - iy \rVert^2)),$$ where of course the norm is defined by $\lVert \cdot \rVert^2 = (\cdot, \cdot)$. So my guess is that I need to start with the expressions: $$(Ax,y) = \frac{1}{4}((\lVert Ax+y \rVert^2 + \lVert Ax-y \rVert^2) - i(\lVert Ax + iy \rVert^2 - \lVert Ax - iy \rVert^2)),$$ $$(x,Ay) = \frac{1}{4}((\lVert x+Ay \rVert^2 + \lVert x-Ay \rVert^2) - i(\lVert x + iAy \rVert^2 - \lVert x - iAy \rVert^2)),$$ and somehow show they are equal. But here is where I have gotten stuck. Hints or solutions are greatly appreciated. Determinant of block matrix with commuting blocks I know that given a $2N \times 2N$ block matrix with $N \times N$ blocks like   $$\mathbf{S} = \begin{pmatrix} A &amp; B\\  C &amp; D \end{pmatrix}$$  we can calculate $$\det(\mathbf{S})=\det(AD-BD^{-1}CD)$$ and so clearly if $D$ and $C$ commute this reduces to $\det(AD-BC)$, which is a very nice property.   My question is, for a general $nN\times nN$ matrix with $N\times N$ blocks where all of the blocks commute with each other, can we find the determinant in a similar way? That is, by first finding the determinant treating the blocks like scalars and then taking the determinant of the resulting $N\times N$ matrix.  Thanks in advance! Prove that $A\ge0, B\ge0$ and $A\ge B$ implies $B^{-1}\ge A^{-1}$ Does anyone know how to prove the following:       Suppose $A$ and $B$ are both positive definite and $A - B$ is positive semi-definite.   Show that $B^{-1} - A^{-1}$ is also positive semi-definite.    I really appreciate any comments! Where did Schrödinger solve the radiating problem of Bohr's model? One of the problems with Bohr's theory to describe the hydrogen atom, was that the electron orbiting around the nucleus has an acceleration. Therefore it radiates and loses energy, until it would collapse with the nucleus.  Now Schrödinger describes the electron as a wave function. His theory is able to describe all atoms (in contrast to Bohr's model), but how is the radiation problem solved? I understand that the wave has not an exact position in the time anymore. But the electron still "moves", so it has an acceleration anyway (because of vibrations or so).   Why is in this theory the electron not radiating anymore? And if it is, why doesn't the atom collapse? I am trying to show that if for a group $G$ we have $Z(G)=1$, then $Z(\operatorname{Aut}(G))=1$.  I have tried everything I can think of, but to no avail.  The first part of the problem was to show that $\operatorname{Inn}(G) \triangleleft  \operatorname{Aut}(G)$ - does this have any connection?  I couldn't find one.  I know that $\operatorname{Inn}(G) \cong G/Z(G)$, so in this case $\operatorname{Inn}(G) \cong G$ and $Z(\operatorname{Inn}(G))=1$.  Is there any way to get from this to $Z(\operatorname{Aut}(G))=1$?  How do we go about showing this?  Thanks. I forgot my iPhone 5 passcode when I was changing the code. A window appeared on the device screen saying that iPhone is disabled.  I have Apple ID and password for it. After signing in to iCloud I have erased the device in order to remove the passcode from my iPhone but it still says that device will be erased when device will connect to internet. What would i have to do? How can I intercept XMLHttpRequests from a Greasemonkey script? cube collider losing shape upon rotation I'm not sure what's going on here. I have a cube which I have turned into a rectangle; it's a child of a plane which is the "ground" so that they share rotation (this is a pinball table).   To create these cubes, I just used the create => 3d shape => cube/plane option. No packages are used.   The issue is when I rotate the rectangle, the collider visibly becomes wrong.  This is before rotation:    This is after rotating on the y axis:    The collider does seem to rotate, but not at the correct amount. Can anyone shed some light as to what's going on here?  Here's the inspector and hierarchy:      I also tried making the plane a cube, it didn't change anything. How to prove that 2017 divides $1^{2017}+2^{2017}+\dots+2017^{2017}$? How can I prove that $2017 \mid 1^{2017}+2^{2017}+\dots+2017^{2017}$? I tried proving it with the use of modulo, however it was to no avail. Afterwards, I  tried researching, for possible theorems, that may help, but that bore no fruit, either. Can you guys please help me proving it, as I am stuck? Thanking you in advance. Raised index of partial derivative I am having a really hard time wrapping my head around component notation for tensor fields. For example, I do not know exactly what the following expression means $$\partial_\mu\partial^\nu \phi, \tag{$\#$}$$ where $\phi$ is a scalar field. On the one hand $\partial^\nu=g^{\lambda\nu}\partial_\lambda$ where $g_{\mu\nu}$ is the Minkowski metric, and hence we could write explicitly $$\partial_\mu\partial^\nu \phi=\sum_{\mu,\nu,\lambda}g^{\lambda\nu}\partial_\mu \partial_{\lambda}\phi=\sum_{\mu,\nu}\partial_{\mu}\partial_{\nu}\phi=\partial_\mu\partial_\nu\phi. \tag{$*$} $$ On the other hand, we may think of $\partial_\mu\partial^\nu=g(\partial_\mu,\partial^\nu)=\delta_\mu^\nu;$ so that $\partial_\mu\partial^\nu\phi=\phi?$ Maybe? I am actually not sure of what this would mean. I am really confused. Any help is appreciated. Edit: To give context of where this expression comes from: I was computing the Lagrangian $$\mathcal L=\frac{1}{2}(\partial_\mu\phi)(\partial^\mu \phi) $$ considering an infinitesimal spacetime translation $x^ \mu\to x^\mu-\alpha a^\mu$. The scalar field thus transforms like $\phi(x)\to \phi(x)+\alpha(\partial_\mu\phi(x))a^\mu.$ Plugging thins into the Lagrangian yields the term I am referring to. Edit 2: The change in placement of indices are actually my doubts. I try to elaborate. I do not have any background in using indices to talk about tensors. I am used to interpret the expressions $\partial_\mu$ as the local vector field defined in some chart (local coordinates). I think about vector fields $X$ as abstract section of the Tangent bundle, which restricted to local coordinates can be expressed as $X=X^\mu\partial_\mu$. In the context of QFT, as far as I understand, the symbol $\partial_\mu$ denotes  $(\partial_t,\nabla)$ in the local coordinates $(t,x,y,z)$. So that $\partial_\mu\phi=(\partial_t \phi,\partial_x \phi,\partial_y\phi,\partial_z\phi)$. This was supposed to be my justification on why I wrote the summation on $\mu$ and $\nu$ in $(*)$, but now I note that this only applies when $\mu$ or $\nu$ appear twice, indicating the scalar product; which leads me to the last remark. I think of $g_{\mu \nu}$ as the component of the matrix $$g=\begin{pmatrix} 1&amp;0&amp;0&amp;0\\ 0&amp;-1&amp;0&amp;0\\ 0&amp;0&amp;-1&amp;0\\ 0&amp;0&amp;0&amp;-1\\ \end{pmatrix}$$ which represents the pseudo-Riemmanian metric, which by definition acts on tangent vectors, i.e. linear combinations of the $\partial_\mu$ applied to a point. This is where my doubt comes, in which was the right way to interpret the notation; in particular what is the expresion $(\#)$ in explicit coordinates? Is there an equivalent of 'which' on the Windows command line? As I sometimes have path problems, where one of my own cmd scripts is hidden (shadowed) by another program (earlier on the path), I would like to be able to find the full path to a program on the Windows command line, given just its name.  Is there an equivalent to the UNIX command 'which'?  On UNIX, which command prints the full path of the given command to easily find and repair these shadowing problems. I'm building an application where I should capture several values and build a text with them: Name, Age, etc.   The output will be a plain text into a TextBox.  I am trying to make those information appear in kind of columns, therefore I am trying to separate them with tab to make it clearer.  For example, instead of having:  Ann 26 Sarah 29 Paul 45   I would like it to show as:  Ann tab 26 Sarah tab 29 Paul tab 45  Any tip on how to insert the tabs into my text? How can I return NULL from a generic method in C#? It seems Microsoft has tried to solve this problem .  In Windows 7, there is no boundary between monitors and the mouse can move freely across the top of the screen between my 3 monitors, provided I had set their heights equal in display settings. Windows 8 introduced sticky corners. See .  Windows 10 got sticky corners as well. There are a few pixels at the top corners of each display where the mouse cannot cross over onto the other display. One must move the cursor down to avoid this region in order to get to the next display.  The image shows roughly the region where mouse movement is not permitted in Windows 10, but is allowed in Windows 7.    Personally, I had no problem with unrestricted mouse movement across the top of my screens - I got used to "aiming" for the x, and the convenience of unrestricted cursor movement. Like all the people who wanted to disable it in W8, I'm wondering if there is a way to disable it in W10.  Edit to address possible duplicate:  Although the problem is identical to the one in , solutions to solve the problem in W8 involving editing the registry key MouseCornerClipLength do not work in W10, since that registry key is not present in W10. Also adding that key and setting the value doesn't work. I searched the entire registry and couldn't find it in another location. No other W10 keys in the node referenced in the W8 solution are obvious replacements.  Edit to address possible solutions in comments  harrymc's  and  that worked for for Windows 8.1 do not work in Windows 10. Can I change the color of the last selected face? I am investigating the vulnerability to  and I think I understand how and why this sort of attack works.  What I don't understand is why Lighttpd and NginX are not affected (according to the same article as linked above). What do they make so different? What do I need in order to create an application for ubantu? Express $\sqrt{3}\sin\theta - \cos\theta$ as: $a\cos (\theta + \alpha) $ Express $\sqrt{3}\sin\theta - \cos\theta$ as: $a\cos (\theta + \alpha) $  Can someone please explain to me how to go about doing this? Animations with movie15 and swf files I am trying to use movie15 to embed vector animations in my presentation. The trouble is that embedded SWF files refuse to display on Acrobat Reader X sometimes with a "This Media requires an additional player" message. Eg. this  doesn't work. Animated GIFs won't display either, with no error message.   Maybe this is an Acrobat issue but I tried the flashmovie package with the same SWF files and that does work (but only with the embedded player option so no controls are visible). But flashmovie is supposedly unstable with beamer so I was wondering if someone had run into the same problem with movie15.  I am using Windows 7, Acrobat 10.1.2 and MiKTeX. Create 128 Barcodes within Excel Is there a way to create Barcodes (128 standard) on a Mac, preferably via an add-in?  I need it to create barcodes in Excel sheets (or moreso a friend of mine needs it).   I have tried all VBA macros and fonts I found on Google, but none give me a scannable result (usually there are weird characters like ó's mixed in). Does anybody have a working solution?