I have a button:  &lt;td class="rigaconto"&gt;   &lt;a class="btn btn-default separa_conto" data-conto="2" data-toggle="tooltip" data-original-title="NewAccount"&gt;&lt;i class="fa fa-sitemap"&gt;&lt;/i&gt;&lt;/a&gt; &lt;/td&gt;   and jQuery code:  $(function(){   $(".separa_conto").click(function() {     var conto = $(this).data('conto');     var nuovoConto = conto + 1;     alert(conto);     $('#showAddeb_conto_'+ conto).removeClass('hidden').show('slow');     $('#showAddeb_conto_'+ conto).append('&lt;tr&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;Sogg&lt;/td&gt;&lt;td&gt;1000&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;/tr&gt;');     $('.rigaconto').append('&lt;a class="btn btn-default separa_conto" data-conto="'+ nuovoConto +'" data-toggle="tooltip" data-original-title="Separa conto"&gt;&lt;i class="fa fa-sitemap"&gt;&lt;/i&gt;&lt;/a&gt;');      var table = $('&lt;table&gt;&lt;/table&gt;').attr('id','showAddeb_conto_'+ nuovoConto).addClass('table table-hover table-bordered hidden');     var row = $('&lt;tr&gt;&lt;th&gt;&lt;/th&gt;&lt;th&gt;Further account&lt;/th&gt;&lt;th&gt;&lt;/th&gt;&lt;th&gt;&lt;/th&gt;&lt;/tr&gt;');     table.append(row);      $('#tabelle_conti').append(table);    }); });   but if I click twice class "NewAccount" doesn't appear second table. What is my mistake?
I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.
Professionals: Would you choose GIMP over Photoshop and/or Inkscape over Illustrator? Calculus of variations -- how does it make sense to vary the position and the velocity independently? Understanding etoolbox \ifdefempty and \ifdefvoid I am trying to understand the  \ifdefempty and \ifdefvoid macros. The documentation says that \ifdefempty     Expands to true if the control sequence is defined and is a   parameterless macro whose replacement text is empty, and to false   otherwise.   Similarly \ifdefvoid     Expands to true if the control sequence is undefined, if is a macro   whose meaning is \relax, or a parameterless macro whose replacement   text is empty, and to false otherwise.   From these descriptions I thought that \def\myempty{}, \def\myrelax{\relax}, and \def\myemptyempty{\myempty} would all be both "empty" and "void", but \def\myempty{} is the only one that is either "empty" or "void". What am I missing?  \documentclass{minimal} \usepackage{etoolbox}  \begin{document}  \def\myempty{} \def\myrelax{\relax} \def\myemptyempty{\myempty}   \ifdefempty{\myempty}{Empty}{Not empty}  \ifdefempty{\myrelax}{Empty}{Not empty}  \ifdefempty{\myemptyempty}{Empty}{Not empty}  \ifdefvoid{\myempty}{Void}{Not void}  \ifdefvoid{\myrelax}{Void}{Not void}  \ifdefvoid{\myemptyempty}{Void}{Not void}  \end{document} Has Marvel commented on the extra Infinity Gauntlet? I have two atoms, both of which are either bosons or fermions, with four allowed energy states: $E_1 = 0$, $E_2 = E$, $E_3 = 2E$, with degeneracies 1, 1, 2 respectively.  What's the difference between the partition functions of a pair of two bosons and that of a pair of two fermions? I have researched and found out long time no see is a direct translate from the Chinese phrase, 好久不见. As much as we use it almost everyday in our lives, is it actually grammatically correct? Since it is a direct translate, is it grammatically approved? If $p$ and $q$ are distinct primes such that $p|c$ and $q|c$, prove that $pq|c$ I recently found out that the expectation of a random variable $X$ in a probability space $(\Omega, \mathcal F,  \mathbb P)$, $\mathbb E(X)$, is just the term used in probability theory for the measure of the function $X$; i.e.:  $$ \mathbb E(X)=\mathbb P(X) $$  or, for a real-valued random variable $X:\Omega\to\mathbb R$:  $$ \mathbb E(X)=\int_\Omega X(x)\mathbb P(dx) $$  The thing is, I am also familiar with the definition of the expectation of a random variable $X:\Omega\to\mathbb R$ with probability distribution function $f$ to be:  $$ \mathbb E (X)=\int_\mathbb R xf(x)dx $$  Here, the integral is with respect to the Lebesgue measure on $\mathbb R$.    We can define the function $f$ in the following way: we have $F(x)=\int_\mathbb R f(x)dx$, where $F(x)=\mathbb P(X^{-1}((-\infty,x]))$.    I can't see any way to show that these two definitions are equal to one another.  The only transformation between integrals with respect to different measures that I know is that $\mu(f^{-1}(g))=\mu(g\circ f)$, which gives that $\mathbb E(g)=\mu_X(g)$, where $\mu_X$ is the image measure $\mathbb P\circ X^{-1}$, but that doesn't seem to help.  Why can we write $\mathbb E(X)=\int_\mathbb R xf(x)dx$?  Why are these two definitions consistent? The attached animated gif shows some frames of a video with a mesh box placed at each tracking marker used to successfully track (solution error &lt;.4) an 800 frame chunk of video.   The point is to illustrate just how poorly the camera tracker calculated: when the box is at a marker placed at the top of a faraway building on the left, it is actually visually much larger than when it is at the tracking marker closest to where the real camera was. I went to great lengths to be sure that the camera's sensor size and focal length are correct, and manually placed and followed all markers to be sure they were accurately tracking.   There is not a lot of parallax motion over the 800 frames, but there should have been enough to at least know that the point closest to the camera moved more than the point furthest away. Sometimes it seems to work, sometimes it doesn't. Does anybody know how to improve this? Settings -> Applications -> All tells me that "Contacts Storage" uses 2.5MB which must be my contact data.  Since I had to revert to 4.03 after a faulty update to 4.1 my contacts seem inaccessible although the data seems to be there.  Could you please tell me where to find the associated data(base) for Contacts Storage? My phone is rooted. And no, my contact data is not on GMail and I honestly don't know why... I did a fresh install of Ubuntu 16.04. /dev/md1 contains an ext4 filesystem that is mounted at /:  /dev/md1 on / type ext4 (rw,relatime,data=ordered)   Now I want to set the automatic filesystem check interval to one month, but I'm getting a strange error that I find no useful information about:  &gt; tune2fs -i 1m /dev/md1 tune2fs 1.42.13 (17-May-2015) tune2fs: Filesystem has unsupported read-only feature(s) while trying to open /dev/md1 Couldn't find valid filesystem superblock.   Rebooting didn't help. On another machine running Ubuntu 12.04, the same command works like a charm.  Does anyone have an idea what's wrong?  The command tune2fs -l /dev/md1 works fine, by the way. Here is its output:  tune2fs 1.42.13 (17-May-2015) Filesystem volume name:   &lt;none&gt; Last mounted on:          / Filesystem UUID:          38366a40-bbe1-476b-acfe-d271be6335eb Filesystem magic number:  0xEF53 Filesystem revision #:    1 (dynamic) Filesystem features:      has_journal ext_attr resize_inode dir_index filetype needs_recovery extent 64bit flex_bg sparse_super large_file huge_file dir_nlink extra_isize metadata_csum Filesystem flags:         signed_directory_hash Default mount options:    user_xattr acl Filesystem state:         clean Errors behavior:          Continue Filesystem OS type:       Linux Inode count:              8380416 Block count:              33521664 Reserved block count:     1676083 Free blocks:              32419430 Free inodes:              8312762 First block:              0 Block size:               4096 Fragment size:            4096 Group descriptor size:    64 Reserved GDT blocks:      1024 Blocks per group:         32768 Fragments per group:      32768 Inodes per group:         8192 Inode blocks per group:   512 Flex block group size:    16 Filesystem created:       Thu May 31 10:01:27 2018 Last mount time:          Thu May 31 10:49:41 2018 Last write time:          Thu May 31 10:15:14 2018 Mount count:              7 Maximum mount count:      -1 Last checked:             Thu May 31 10:01:27 2018 Check interval:           0 (&lt;none&gt;) Lifetime writes:          5782 MB Reserved blocks uid:      0 (user root) Reserved blocks gid:      0 (group root) First inode:              11 Inode size:               256 Required extra isize:     32 Desired extra isize:      32 Journal inode:            8 First orphan inode:       4325378 Default directory hash:   half_md4 Directory Hash Seed:      9d55d989-2c2b-4ad8-a29e-53c8798ec68e Journal backup:           inode blocks Checksum:                 0x3d9f8d23 Let $p\in[1,\infty]$, $a\in\ell^\infty$ and $$T:\ell^p\to\ell^p\;,\;\;\;x\mapsto ax.$$ Note that $\left\|T\right\|=\left\|a\right\|_{\ell^\infty}$. It's easy to see that if $a\in\ell^1$, then $T$ is nuclear and hence compact.  Can we more generally conclude that $T$ is compact?  Assume $p&lt;\infty$. The intuitive approach would be to define $$T_n:\ell^p\to\ell^p\;,\;\;\;x\mapsto(a_1x_1,\ldots,a_nx_n,0,\ldots)$$ for $n\in\mathbb N$ and to show that $\left\|T_n-T\right\|\to0$. Now, $$\left\|(T_n-T)x\right\|^p=\sum_{i=n+1}^\infty|a_ix_i|^p\tag1$$ for all $x\in\ell^p$ and $n\in\mathbb N$. The right-hand side of $(1)$ clearly converges to $0$ as $n\to\infty$, but this only yields convergence in the strong operator topology. On the other hand, if $(a_n)_{n\in\mathbb N}$ would be nonincreasing and $a_n\to0$ (e.g. $a_n=\frac1n$), then $$\left\|(T_n-T)x\right\|^p\le|a_{n+1}|^p\left\|x\right\|_{\ell^p}^p\tag2$$ for all $x\in\ell^p$ and $n\in\mathbb N$ and we could immediately conclude $\left\|T_n-T\right\|\to0$. EDIT: Maybe the general result can be obtained from the convergence in strong operator topology (which holds by $(1)$) by noting that $\ell^p$ has the approximation property; but I'm not sure whether this is true. Which Stack Exchange sites use MathJax? As the title says, I could use an exhaustive list of all Stack Exchange sites that use MathJax.  If the list included any site-specific customizations made to the MathJax configuration on each site, that would be even better. Biblatex: Don't show n.d. when no year is given I am using biblatex/biber with several bibliographies for my book, and the misc-type, which is also a single bibliography (as a chapter), for legal documents. These documents often do not have a proper date or rather the date is part of the title. However, Latex gives me a "n.d." output, and I am wondering what I can do for it to not give a "n.d." when there is no year given?    To make clear, the reason for why I don't want to use the "year" field is that I deal with very different kinds of documents, which may either have no date or the date is in the title, because of which I prefer to simply "hard-copy" the whole thing in the "howpublished"-section and need to suppress the year, if none is provided.  MWE:  \usepackage[autocite=footnote, language=german, style=authoryear-ibid, sorting=nyt, backend=biber]{biblatex} \usepackage[bottom]{footmisc} \bibliography{lit.bib} \makeindex \begin{document}  Test\autocite[2]{draftnotice}.  \printbibliography[title={EU Legal Documents}, type=misc1]  \end{document}   My lit.bib is as follows:  @misc1{draftnotice,     Author = {{COMMUNICATION FROM THE COMMISSION}},     Howpublished = {Draft Commission Notice of 2014 on the notion of State aid pursuant to Article 107 (1) TFEU}}   Check out my MWE on overleaf Why can't I launch eclipse from a terminal ? change $PATH environment variable I have purchased a game on Steam and can not find out the details of the file or purchase. How does one find their CD Key from a game purchased in Steam? In C++, what is a virtual base class? I want to know what a "virtual base class" is and what it means.  Let me show an example:  class Foo { public:     void DoSomething() { /* ... */ } };  class Bar : public virtual Foo { public:     void DoSpecific() { /* ... */ } }; Evaluate trigonometric function I'm writing an application that allows users to upload images onto the server. I expect about 20 images per day all jpeg and probably not edited/resized. (This is another question, how to resize the images on the server side before storing. Maybe someone can please drop a .NET resource for that in the comment or so).  I wonder now what the best place for storing uploaded images is.   Store the images as a file in the file system and create a record in a table with the exact path to that image. Or, store the image itself in a table using an "image" or "binary data" data type of the database server.   I see advantages and disadvantages in both.  I like a) because I can easily relocate the files and just have to change the table entry. On the other hand I don't like storing business data on the web server and I don't really want to connect the web server to any other datasource that holds business data (for security reasons)  I like b) because all the information is in one place and easily accessible by a query. On the other hand the database will get very big very soon. Outsourcing that data could be more difficult. Iterating through list of list in Python