As I said, Before I begin, this is not a duplicate of , so idk why it has been marked as a duplicate this is an entirely different question. What im talking about is what is the difference between DDR3 and GDDR5? I have a desktop PC, and I am looking to upgrade the ram from 4GB to 8GB. But as I have discovered GDDR5, im not sure which one is better.  Can someone help me with the difference? (Ports are PCIe like all desktops)
I am trying to buy a laptop, and I have seen in many place that they show GDDR3 and sometimes  DDR3. What is the difference between them?  afaik DDR3 is a type of RAM used for system memory, while GDDR3 is a type of RAM used for graphics cards. So does "G" only stand for Graphics or does it have another particular meaning?
Why Inox Steel doesn't interact with magnets? My dad has a HUGE magnet on his workshop.  I love magnets, and when I saw it, I asked him what it was for.  His reply was: "I don't know why, but inox steel bolts don't get attracted to it, so I use it to identify them."  Thus I got curious, why a magnet don't attract  bolts? Steel, even if a inox variation is still mostly iron, no? Public-key cryptographic systems are often implemented on top of an existing problem. For example, RSA is built on top of integers and the difficulty of factoring. ECDSA/ECIES are built on top of elliptic curves and the difficulty of the discrete logarithm.  My question is, what are, mathematically speaking, the exact primitives needed to implement public-key based signature and encryption cryptography in a generic way? How to run test methods in specific order in JUnit4? Is it feasible to transform each variable differently while doing multiple regression Adobe Illustrator: Lines with stroke < 2.0pt doesn't change color I created lines using the line segment tool in Adobe Illustrator (latest Adobe Cloud version) and I can't change the color of the stroke (through the Appearance panel) if the stroke weight is less than 2.0pt.   If the stroke is 2pt or more, then the color around the line changes but not the line itself.    The whole behavior is odd for me as I've never faced in Illustrator before.  Edit: added screen below with the line selected. Estimating Uniform distribution endpoints using data with errors Suppose I have a random variable $X$ ~ $Unif(0,\theta)$ where I want to estimate $\theta$. I draw a sample $X_1,...,X_n$.One way is to get a point estimate using e.g.  maximum likelihood estimation via the sufficient statistic $X_{(n)}$.  However, suppose I want a 95% confidence interval of sorts on the value of $\theta$, how should I construct one?  The reason why I am interested in confidence interval is because of the following issue, which is actually my main question (the above prelude on confidence interval is just a suggestion on possible approach). So actually my sample came with some noise, in a sense that I actually observe $X_1+E_1,...,X_n+E_n$ where $E_i$~$N(0,\sigma_i^2)$ independently from each other and from the $X$'s. How should I make some form of statistical estimation about $\theta$? I would prefer some form of confidence estimate. Getting Session ID in Lightning This is result of who -uH:  NAME     LINE         TIME             IDLE          PID COMMENT me    :0           2013-08-29 01:29   ?          1686 (:0) me    pts/0        2013-08-29 01:42  old         2905 (:0) me    pts/1        2013-08-29 01:45  old         2905 (:0) me    pts/2        2013-08-29 01:52  old         2905 (:0) me    pts/3        2013-08-29 02:26  old         2905 (:0) me    pts/4        2013-08-30 18:37 00:07        2905 (:0) me    pts/5        2013-08-29 10:34  old         2905 (:0) me    pts/6        2013-08-29 11:05  old         2905 (:0) me    pts/7        2013-08-29 13:34  old         2905 (:0) me    pts/8        2013-08-30 15:56 02:45        2905 (:0) me    pts/9        2013-08-30 18:27 00:17        2905 (:0) me    pts/10       2013-08-30 17:34   .          2905 (:0) me    pts/11       2013-08-30 17:37 00:13        2905 (:0) me    pts/12       2013-08-30 18:28 00:17        2905 (:0) me    pts/13       2013-08-30 18:38 00:07        2905 (:0)   Why it lists my username in 15 lines? How do I know If someone has connected to my system remotely? We consider $g : (t,u,v)\in \mathbb{R}^3 \mapsto (t^2,u^2,v^2,\sqrt{2}uv, \sqrt{2}tv,\sqrt{2}tu)\in\mathbb{R}^6$. I have to prove that $g(\mathbb{S}^2)$ is a submanifold of $\mathbb{R}^6$.  $dg_{(t,u,v)}=\begin{pmatrix}2t&amp;0&amp;0\\  0&amp;2u&amp;0\\  0&amp;0&amp;2v\\  0&amp;\sqrt{2}v&amp;\sqrt{2}u\\ \sqrt{2}v&amp;0&amp;\sqrt{2}t\\ \sqrt{2}u&amp;\sqrt{2}t&amp;0\\ \end{pmatrix} $  So it proves that $g$ is an immersion (the rank is $3$ clearly) for $(\mathbb{R}^3-\{(0,0,0)\})$.  Now how to prove that $\mathbb{S}^2$ is homeomorphic to $g(\mathbb{S}^2)$ ? I must prove that $g$ is injective  ?  Thanks in advance ! I want to run a daily incremental backup and append the day of the week to the file name so I end up with:  backup_mon.bak backup_tue.bak  etc.  Not really bothered about what exactly is appended - 0 - 6 is fine.  How do I go about this? This is similar to , except it's a bug report, not a feature request.  Currently, the nominee's comments on his/her own post are not highlights, unless you click "add / show more comments"  When the page is loaded it looks like:    AfterI click "add / show more comments", it becomes:    Could we have the blue highlighting on the post owner's comments there all the time? It becomes difficult to see the nominees responses to questions, especially on nominations where there aren't enough comments to enable the "add / show more comments" features, like Matt's. Can an abstract class have a constructor? Can an abstract class have a constructor?  If so, how can it be used and for what purposes? First time using bevel tool, doesn't bevel evenly. What am i doing wrong? Particles rotation not working correct In an ideal case, we assume strings and ropes to be massless and having same tension throughout.  However, I was doing some questions which involved a rope with mass.  The question was that if a uniform thick rope of length 5 m is resting on a horizontal smooth (assume frictionless) surface and is pulled by a force of 5N from one end, then what is the tension in the rope at the point 1 m away from the end where force is applied? (sorry for the poor image)    I came to the conclusion that since rope is not fixed, tension anywhere should be zero. However, when I checked the answer, it was 4 N. I failed to understand how.  Then the next part of the question was that if the rope now hangs between two fixed points which are at same level, then what would be the tension in the rope at its lowest point?    The answer has to be expressed in terms of mass of string m, acceleration due to gravity and $\theta$ where $\theta$ is the angle that tangents to the rope make with the horizontal.  I took that force acting on lowest point is mg, since it is center of mass and hence T = mg. However, according to the answer it depends upon $\theta$ as well. However, I failed to see what I was doing wrong?  I would appreciate any help in solving these questions, since I have no clue of where exactly I am wrong. I did search the Internet and a few books, but everywhere they assumed string/rope to be massless. I have a blender file where a sphere is orbiting a force field. I want it to be more red when it's closer to the center, and more blue when it's further. I already have the math figured out, I just need to know how to get x/y coordinates in nodes.  Here's the file: Convergence of the series $\sum_n \frac{n^{\log(n)}}{\log(n)^n}$ I have a rough outline of a proof. Is this correct?  $$\sum_{n \geq 2} \frac{n^{\log(n)}}{\log(n)^n} \to a \in \mathbb{R} \iff  \sum_{n \geq 2} 2^n \frac{(2^n)^{\log(2^n)}}{\log(2^n)^{2^n}} \to b \in \mathbb{R}$$ via dyadic criterion (or Cauchy condensation test).  Analyzing the right-hand side:  $$\sum_{n \geq 2} 2^n \frac{(2^n)^{\log(2^n)}}{\log(2^n)^{2^n}} = \sum_{n \geq 2} 2^n \frac{(2^n)^{n\log2}}{(n\log2)^{2^n}} = \sum_{n \geq 2} \frac{(2^n)^{n\log2 + 1}}{(n\log2)^{2^n}} = \sum_{n \geq 2} \frac{2^{n^2\log2 + n}}{(n\log2)^{2^n}} = (\ast). $$  We know for some sufficiently large $N$, $n \log 2 \ge 2$ for all $n\ge N$, so we can bound the series above by:  $$(\ast) \leq C_N + \sum_{n \geq N} \frac{2^{n^2\log2 + n}}{2^{2^n}} = \sum_{n \geq N} 2^{n^2\log2 + n - 2^n} = (\ast\ast),$$  where $C_N$ is the finite sum of the original series until $N$. And once again, for sufficiently large $M$, $m^2\log2+m - 2^m \leq -m^2$ for all $m \ge M$. Hence  $$ (\ast\ast) \leq C_{\max(N,M)} + \sum_{n \geq \max(N,M)} 2^{-n^2} &lt; \infty.$$  We then use the $p$-test to conclude that the sequence does converge. Why are swap partitions discouraged on SSD drives, are they harmful? I often read that one should not place swap partitions on a SSD drive, as this may harm the device. Is this true? Can you please explain the reason to me?  Because I otherwise would have thought that placing swap on an SSD is the best choice, as it's much faster than HDDs and therefore swapping RAM contents to the SSD is not as slow as it would be with the HDD... How do malloc() and free() work? Easiest way to sort DOM nodes? If I have a list like this:  &lt;ul id="mylist"&gt;     &lt;li id="list-item1"&gt;text 1&lt;/li&gt;     &lt;li id="list-item2"&gt;text 2&lt;/li&gt;     &lt;li id="list-item3"&gt;text 3&lt;/li&gt;     &lt;li id="list-item4"&gt;text 4&lt;/li&gt; &lt;/ul&gt;   What's the easiest way to re-arrange the DOM nodes to my preference? (This needs to happen automatically when the page loads, the list-order preference is gained from a cookie)  E.g.  &lt;ul id="mylist"&gt;     &lt;li id="list-item3"&gt;text 3&lt;/li&gt;     &lt;li id="list-item4"&gt;text 4&lt;/li&gt;     &lt;li id="list-item2"&gt;text 2&lt;/li&gt;     &lt;li id="list-item1"&gt;text 1&lt;/li&gt; &lt;/ul&gt;