How would I go about transforming like this in CSS?
CSS Transform Skew
print IP address with interface name I want to show the IP address like below  lo : 127.0.0.1  eth0 : 192.168.5.123 eth1 : 192.172.0.212 wlan0 : 10.1.0.124   I'm able to print all IP address by ifconfig | awk '/inet addr/{print substr($2,6)}'. But it is only printing the IPs. Every system have their own interface names and addresses. So my script has to show their interfaces with respect to IP addresses. How do I mount shared folders in Ubuntu using VMware tools? I'm using biblatex for my references.  Normally, if I use \cite{source1, source2, source3}, I get a citation like  [3, 45, 98]   If I now want to give a page number for one of them, it looks confusing imho, as I should get (did not try it out up to now, honestly)   [3, 45, 78, p. 23f, 98]   So imho it would make sense to change one of the separator from a comma to e. g. a semicolon like:  [3; 45; 78, p. 23f; 98]   Question 1: Does that make sense, or are there other conventions for citing sources with and without page numbers together?  (Up to now I collected the citations without page number in one cite command and added singular \cite[][p. xy]{} commands for those with page numbers., so I'd get:   [3, 45, 98][78, p. 23f]   )  the \cites[]{}[]{}[]{} could also do that, but it also uses the same separators for entries and postnotes.  Question 2: How could I change the separator globally for those number-citations from comma to semicolon in biblatex? Can I manually put an external hard disk to sleep? Reputation and inbox notification shows up again after refresh This was asked before too. .  Currently I am facing the issue of appearance of reputation notification in above toolbar.  I can see the reputation notification, for every page refresh even after clicking and viewing the notification.  current browser: Chrome Version 36.0.1985.143 m Now that I've reached 2k on Stack Overflow, I get access to the "Suggested Edits" review queue.  Although I only have 20 edits per day, the "suggested edit awaiting" icon in the top bar is always there and it bothers me a lot!  My suggestion is to apply one of three solutions:   Remove the suggested edits icon when we reach the maximum (50) edits Remove the Highlight (orange) on the suggested edits Remove the suggested edits part when we click on it   What do you think? Can I permanently block an update (non-driver) that will not install on my machine on Win10 pro? I have an update to Visual Studio 2010 that will NOT update and has failed hundreds of times. Manually installing it also fails, and no source has been found for manually getting this very old patch to install on Windows 10. I believe the problem is that Microsoft simply hasn't re-tested KB2890573 at all and it doesn't install on Win10 ver 1511 at all, anymore.  I do not want to use the MS utility that will postpone this update for a while. I want to permanently block it so it does not appear in the windows update list ever again. I want to write a function that takes an array of letters as an argument and a number of those letters to select.   Say you provide an array of 8 letters and want to select 3 letters from that. Then you should get:  8! / ((8 - 3)! * 3!) = 56   Arrays (or words) in return consisting of 3 letters each. Are there surface-mount pin header footprints for KiCAD? I'm designing a small module that breaks out a DIP SPI EEPROM to a 2x5 pin header socket(more info here: ). I want to mount the socket on the end of the board, with the pins lying parallel to the board.  I think two 5x1 surface-mount header footprints, on both sides of the board right near the end would do the job. Trouble is, KiCAD doesn't come with such a footprint(if it does, I haven't found it yet). Where might I find one? If one doesn't exist, that's OK; I'll have a shot at making my own. I want to log out of Stack Overflow or any Stack Exchange site, but always it shows me logged in!  How do I log out of this site?  Note: I have yet to register; the site currently always shows my name and default email. I wish to log out so that I may start a new session! Let $C_*$ be a chain complex such that each $C_i$ is a torsion-free, finite-range abelian group with $C_i=0$ for all $i&lt;0$. Suppose that $C_i=0$ for all $i$ is large enough. The Euler characteristic of $C_*$ chain complex is defined as $$\chi(C_*)=\sum_{i\geq 0}(-1)^iRank(C_i)$$ Prove that $$\chi(C_*)=\sum_{i\geq 0}(-1)^iRank(H_i(C_*))$$  I have to prove that $\sum_{i\geq 0}(-1)^iRank(C_i)=\sum_{i\geq 0}(-1)^iRank(H_i(C_*))$, I think that one way to do this is by showing that $Rank(C_i)=Rank(H_i(C_*))$ but I do not know if this is true in general, in a nutshell, I want to show that the cardinality of the base of any $C_i$ is the same as the cardinality of the basis of the corresponding homology, how can I do this? Thank you The new software center in Ubuntu 16.04 shows no application data found This is the error I get when I open the software center. I've tried rebooting and running sudo apt-get update but I see no improvement. It worked earlier but I don't know what went wrong since then. I'm using Ubuntu 16.04 final release on a Dell Inspiron 15R. Any advice will be appreciated. Thanks in advance.  EDIT: The problem magically solved itself without me doing anything special (or maybe inadvertently doing something, I don't know). So I'd still like to get to the root of this. What my thought was that the bijection was a piecewise function:  $f(x) = 1/n+1$ if $x = 1/n$ for some $n \in \Bbb N$ and $x=1/n$ if $x \neq1/n$ for some $n \in \Bbb N$.  However, the textbook says this is incorrect. I don't actually see why. Was it a matter of brackets or the open variable $(0,1]$, which is what I tend to think. Missing argument 2 for wpdb::prepare() Issue Why are the Ringwraiths fearful of coming into contact with water? At least twice in The Lord of the Rings: The Fellowship of the Ring, Ringwraiths cower away from bodies of water.  The second time (the ford of Bruinen) can be explained away by their fear of some Elvish magical trap through the enchantment of the water; but what about the first time, at the ferry? One of the Nazgûl could have easily made the jump onto the barge and quickly dispatched those pesky Hobbitsses. Notepad++ auto indent html code while writing I have seen many plugins in Notepad++ for indenting html code after you write the code, but is there a plugin or other method to auto intent html while you are writing the code?  Many of the other programming languages Notepad++ supports automatically indent while you are writing but html doesn't seem to have the same support.  Any ideas? If an ideal contains the multiplicative identity, then it is the whole ring I have to prove that if $I\subseteq R$ is an ideal, and $1\in I$, then $I=R\,$. So I know $I\subseteq R$ is an ideal if $a,b\in I$ implies $a+b\in I$, and if $a\in I$, $r\in R$, then $ra\in I$. I'm finding it hard to put this into words. Since $1\in I$ and $I\subseteq R$ is an ideal, then let $a=1$ and $r=1$ so $1\cdot 1\in R\,?$ How to install Eclipse? I have a question about XTP_CHECKPOINT.  I'm using SQL Server 2014. I have a database that is in SIMPLE recovery model mode. It is also being replicated.  There are no open transactions. I've run DBCC OPENTRAN and it returns:     "No active open transactions."   But I keep getting this message whenever I try to create or drop a table or delete data: (I've replaced my actual database name with the word database_name)     "The transaction log for database 'database_name' is full due to 'XTP_CHECKPOINT'"     Does anyone know why this might be happening, and, more importantly, how can I make it stop?  And yes, the database really is in SIMPLE recovery model mode. i.e. The transaction log should truncate automatically.  Incidentally, another database that I have in full recovery mode did the same thing, started returning the same error:     The transaction log for database 'database_name' is full due to 'XTP_CHECKPOINT'   I tried to change the log growth settings to unlimited growth, but it wouldn't let me, returning the same error.  I can reproduce the problem without any XTP stuff at all, except for just the filegroup. Here's how: Why do we care about eigenvalues of graphs?  Of course, any novel question in mathematics is interesting, but there is an entire discipline of mathematics devoted to studying these eigenvalues, so they must be important.  I always assumed that spectral graph theory extends graph theory by providing tools to prove things we couldn't otherwise, somewhat like how representation theory extends finite group theory.  But most results I see in spectral graph theory seem to concern eigenvalues  not as means to an end, but as objects of interest in their own right.  I also considered practical value as motivation, e.g. using a given set of eigenvalues to put bounds on essential properties of graphs, such as maximum vertex degree.  But I can't imagine a situation in which I would have access to a graph's eigenvalues before I would know much more elementary information like maximum vertex degree.  (EDIT: for example, dtldarek points out that $\lambda_2$ is related to diameter, but then why would we need $\lambda_2$ when we already have diameter?  Is this somehow conceptually beneficial?)     So, what is the meaning of graph spectra intuitively?  And for what practical purposes are they used?  Why is finding the eigenvalues of a graph's adjacency/Laplacian matrices more than just a novel problem?