jquery : hover and hover (one after another)
Event binding on dynamically created elements?
Making SSD & HDD work together like a hybrid At work we have a Domain Controller running Server 2008 R2. Our desktop support group has the ability to join computers to the domain using their network credentials. We are now running into a problem where if the name of the computer that is being joined is the same as an existing computer on the domain, the existing computer will get a "The trust relationship has failed..." error and will not authenticate at all unless someone logs in as a local admin, changes the computer name and rejoins it to the domain.  I want to make it so that Desktop Support can only join computers with unique names to the domain. If the name already exists on the domain the operation should fail. Looking through TechNet it looks like this functionality exists but I can't seem to find out how to enable it.  Any ideas? Jumping in an elevator? I know that the Linux kernel supports TRIM as of version 2.6.33, so there should be TRIM support in ubuntu.  Is TRIM enabled by default or do I need to change some settings or install additional software for it to work? If so, how? Whence came the different varieties of the "long i" diphthong? What is the origin of “long long i” before voiced consonants (the [ai] of wide, while, &amp; tribe) versus “short long i” before unvoiced consonants (the [ʌi] of white, wife, &amp; wipe)? When did this difference appear? Is it just a secondary distinction, or are there minimal pairs for these two diphthongs?  Obviously the distinction is not present in all accents—though its presence in most leads me to believe it's not a late arrival—and yet I've never found a dictionary that distinguishes them. What is a subnet mask, and the difference between a subnet mask of 255.255.255.0 and 255.0.0.0? My DSL/WiFi router provided by my ISP has an internal IP address of 10.0.0.138, the addresses provided by DHCP are in the format of 10.0.0.xxx.  Now, I want to start using static IP addresses on my local network, and I don't know what to provide for the subnet mask.  What is a subnet mask?  Should I be using 255.255.255.0 or 255.0.0.0 as my subnet mask? What is the difference? I've installed emacsformacosx on my OSX box.  I'd like to shove my macmini in a data center and run it headless.  I've gotten x-windows working.  If I run xeyes, it displays on my Windows 7 client.  Emacs works from the command line on the osx box.  However, if I start up emacs from the windows client, it pops it up on the server instead of the client.  What am I doing wrong? How to avoid noisy renders in Cycles? I'm a college student and I just got my first credit card (through Chase). The only reason I got the card is to try and build my credit score. I also have a checking account with Chase, and they let me pay off my credit card any time I want.  For example, right now I have a balance of $92 on my credit card, but my bill won't come until September 2, and the payment isn't actually due until September 27. But through their website I could go ahead and pay it off with money from my checking account.  My question is, is it better for my credit score if I pay off that $92 balance right now, or should I wait for the bill, or does it not matter either way? Creating polyline-based "heatmap" from GPS tracks? This winter I am planning to track my downhill skiing/snowboarding using a GPS.  Most of my riding will occur at the same resort.  I would like to be able to create a sort of "heatmap" that shows the amount of runs that I have made in a given area.  As I add more and more GPS traces to my database, my goal would be to see a sort of linear heatmap of the most traveled areas.  Given the nature of downhill skiing, you would expect the uphill chairlift lines will be the "hottest" because it will be the only places visited over-and-over again.  Given that 1) my track will not be the same every time and 2) the area covered by following one "run" may be a few hundred feet wide, what might be the best way to analyze this "linear" data to create a sort of heatmap?  My thoughts were to buffer the lines, then intersect the polys to get a sort of Venn Diagram thing going.  My preference is to use open-source technologies.  I've got QGIS and PostGIS loaded and available.  UPDATE: In regards to @blah238's response, I was thinking of something that might be able to "collect" the number of passes ("runs") through an area, and then symbolize by the count.  Conceptually, this would be similar to ArcGIS "" (but for lines, not points) or  (but for multiple line in roughly the same area).  A more visual example of a similar concept might be a traffic-flow map, where highly-congested areas would equate to "highly-traveled" ski runs/areas:    I've read the following questions that may give some ideas, but they don't really address what I am trying to accomplish: Closed formula for the sums $\sum\limits_{1 \le i_1 < i_2 < \dots < i_k \le n} i_1 i_2 \cdots i_k $? I've worked out a few summation formulas, and I am hoping to find a pattern. Unless I have made a mistake somewhere, we have the following identities:  $$\sum_{1 \le i \le n} i = \frac{(n+1)n}{2} $$  $$\sum_{1 \le i &lt; j \le n} ij = \frac{(3n+2)(n+1) \, n \, ( n-1)}{24}$$   $$\sum_{1 \le i &lt; j &lt; k \le n} ijk = \frac{(n+1)^2 \, n^2 \, (n-1)(n-2) }{48}$$   It seems clear that $$p_k(n)= \sum_{1 \le i_1 &lt; i_2 &lt; \dots &lt; i_k \le n} i_1 i_2 \cdots i_k $$ is a polynomial in $n$ of degree $2k$. But is there a nice closed-form formula for it? Maybe in terms of its factorization?  Comment: I realize that what I am looking for is the coefficient of $t^k$ in the expansion $$(1+t)(1+2t) \dots (1+nt),$$ so maybe generating function techniques could be helpful. But the main way I know to extract the coefficient of $t^k$ is to take derivatives $k-1$ times and on the surface of things that looks like a huge mess. How to properly restart unity? I keep on experiencing weird bugs. These usually start after a few hours of use. Sometimes the dash starts opening under every open window (becomes only visible on desktop, but I still can search and open anything with the enter key while it's not visible). Also, there are other minor annoyances, such as random places (especially maximized Chrome, tabs area) after navigating between programs with alt+tab can't be clicked with the mouse. Switching back and forth fixes this.  I cannot use  compiz --replace   since after that, all of the app indicator icons are gone (only teamviewer stays). Skype, network, languages, sound (also keyboard sound up/down stops working) and date are gone. Restarting unity-panel-service does not help.  Any thoughts on how to resolve these? Root of unity for $n+1$ Let $n \ge 1$ and $u_{1},u_{2},...,u_{n}$ are all root of unity for $n+1$ and there are different from $1$.(a) Find polynomial $f \in \mathbb R[x]$ of degree $n$ for which: $f(u_{k})=0$ for $k=1,2,...,n$.(b) Calculate real coefficient and imaginary part for $(2-u_{1})(2-u_{2})\cdot...\cdot(2-u_{n}).$    I have a knowledge about root of unity but I completely don't know how to do it because I think that I need some extra trick to do it but my ideas finished. I know that $\varepsilon_n^{(k)} = \cos\left(\tfrac{2k\pi}{n}\right) + i\sin\left(\tfrac{2k\pi}{n}\right) = e^\frac{2\pi i k}{n}$ and for $n&gt;1$ $\sum _{{k=0}}^{{n-1}}e^{{\frac  {2\pi ik}{n}}}=0$ but I think it is too little knowledge to solve this task.Can you help me? Consequences of overstaying Schengen visa for 6 months How do I fix a "Problem with MergeList" or "status file could not be parsed" error when trying to do an update? I'm just starting to learn linear algebra and I understand Gaussion elimination but I don't understand this proof:    Is the heart of this the fact that all the while when I've been row-reducing matrices to reduced row-echelon form... I've actually been multiplying a matrix by a series of a elementary matrices?  What does the notation $[A\ \ 0]$ mean?  How is the equation $A = E_1^{-1}...E_k^{-1}$ arrived at? This is a follow-on from my  about samples from a distribution.  Suppose $X_1 \ldots X_{n-1}, X_n$ are random variables all following some fixed distribution $D$. How do I prove that $P(X_n &gt; X_1 \wedge \ldots \wedge X_n &gt; X_{n-1}) = \frac{1}{n}$ (this is true intuitively and experimentally). What books are recommended for learning calculus on my own? I recently graduated with a degree in bachelor of science with a focus interactive and multimedia design. I had to opportunity to take 1 C++ course and 1 HTML course. I was also only required to take one math class, introduction to calculus (and it was hardly calculus, it was more of a math class for designers)  Since graduating I have pursued a career in web development. I'm considering going back for a MS in computer science or MS in web technologies.   I feel my math has suffered dramatically as I have always been behind most others on my math studies (middle school through college). I want to learn calculus as I feel it's an integral part of any CS degree.   Does anyone have any recommendations on any great books that I can read through and teach my self a bit of calculus or other advanced math topics?  Thanks for any advice How does the Golden Ratio/Spiral Work? Is it useful with Logo Design? Show that the Sorgenfrey line does not have a countable basis.