Why Curve bend at the corners
How to make beveled 90 degree corners on a curve better?
Defining the Product of Ideals Word for "things which exist" My understanding is that a question is historically locked because the information in it is too valuable for the question to be deleted.   But if the "valuable information" becomes obsolete, what happens then?  We cannot modify the question content, or the answers for a historically locked question, right? Remove specific duplicates (all but latest) When removing duplicate rows, using the below query from  tutorial, how would I go about forcing which of the found duplicates to remove?  DELETE FROM dbo.ATTENDANCE      WHERE AUTOID NOT IN (SELECT MIN(AUTOID) _ FROM dbo.ATTENDANCE      GROUP BY EMPLOYEE_ID,ATTENDANCE_DATE)    And this works great. The reason why I am using this one is because the only unique id available is one in the IDENTITY column. And to determine if there are duplicate rows I have to look at a combination of multiple columns.    But if I have a set of duplicate rows how do I / how does SQL Server decide which to remove? And how would I force it to remove all but the one with the highest IDENTITY value?  EMPLOYEE_ID     ATTENDANCE_DATE     AUTOID A001            2011-01-01          1 A001            2011-01-01          2   If I would run the query now it happens to remove the second one, with AUTOID 2. But I am trying to remove all but this one (because this is the one latest added). From time to time I lose all edits because of undo in Object Mode. If I enter immediately after Undo in Edit Mode I can't redo, and switching again in Object results in losing all edit history.  How can I resolve this? Separating undo history by mode or linear/unified will both be acceptable.  Edit:I think the most preferable solution will be to disable/skip edit undos when in object mode through an addon. gzip: stdin: not in gzip format When I run:  tar -zxvf john-1.7.0.2.tar.gz   I get this:  gzip: stdin: not in gzip format tar: Child returned status 1 tar: Error is not recoverable: exiting now   It should start unpacking.  Some people told me not to use the z but I get the same error.  It's a file that I downloaded this way:  wget http://openwall.com/john/f/john-1.7.0.2.tar.gz Careers ad asking if I want to work where I already work? How to pin either a Shortcut or a Batch file to the new Windows 7, 8 and 10 Taskbar and start menu? We are having trouble adding our batch scripts to the Windows 7, 8 or 10 taskbar or start menu.  Our batchfiles take some arguments and just execute other application based on those arguments . To keep it simple, we created some shortcuts for our customers which they just need to click in order to get everything running.  The question here is: How can we pin those shortcuts or batch files to the taskbar or start menu?  (The customers aren't supposed to access the file system and that's why they can only see the taskbar) I need to prove that     $f_1 \in \Theta(g_1) \land f_2 \in \Theta(g_2) \implies f_1 + f_2 \in \Theta(\max\{g_1, g_2\})$    is relevant, but I have a slightly different case, so I don't know how to translate it into this one, because I need to turn the $f$'s into $g$'s.  Am I allowed to say $\max\{f_1, f_2\} \in \Theta(\max\{g_1, g_2\})$?  Or even $\Theta(\max\{f_1, f_2\}) = \Theta(\max\{g_1, g_2\})$? I'm trying to install Linux alongside my 64-bit Windows 8 and went into my partition manager to find this structure.    In order to create partitions for my Linux install I need to free up some space. I see that the last partition is an empty recovery partition, as you can see highlighted, it's 100% free.  I was wondering is it okay to just remove this partition seeing as it doesn't appear I'll be losing anything?  Not sure if this helps but this is on a Fujitsu AH532 running Windows 8 64-bit with UEFI. Where can I get an Ubuntu Installation CD/DVD/USB? I need to upgrade my existing Ubuntu system, and I also want to install Ubuntu on a new laptop.  I would like to have an installation CD or DVD to do both of these.  Where exactly I can order or request an Ubuntu installation CD/DVD/USB? A proof that $1=2$. May I know why it’s false? Individual community preferences vs. SE network policy: who wins? In the recent question , the OP asks where the following question would be appropriate:     What would be the best way to approach someone that works for me about bad odor?   CHAOS team member Abby Miller  by suggesting the proposal  &#8212; which is in commitment as I'm writing this &#8212; because     One of the up voted example questions there is about dealing with an irritating coworker. This question will be perfectly on topic for that site.   In my opinion,  qualifies for the not constructive close reason*, which applies to all sites in the network, and therefore, the question shouldn't be allowed, no matter how much it has to do with workplaces.  I know Abby isn't the only one who disagrees with me about this. I once had a talk with a mod of some beta about the presence of poll/GTKY questions on his site. His position, in short, was that his community had different rules from SO and its members enjoyed such questions. I don't remember which site it was, it might even be graduated now, but I never did end up participating there.  Anecdotal examples are nice and all, but here's the real question: to what extent can individual communities/sites override network policies? To what extend should they be able to do so?  *: not constructive comes with the description "This question is not a good fit to our Q&amp;A format. We expect answers to generally involve facts, references, or specific expertise; this question will likely solicit opinion, debate, arguments, polling, or extended discussion." How many bandits must agree? Problem  A group of $n~(1 \leq n \leq 30)$ bandits hid their stolen treasure in a room.  The treasure needs to be locked away.  The bandits want to ensure that at least $k~(1 \leq k \leq n)$ of the bandits must agree in order to retrieve the treasure.  They have decided to place multiple locks on the door such that the door can be opened if and only if all the locks are opened.  Each lock may have up to n keys, distributed to a subset of the bandits.  A group of bandits can open a particular lock if and only if someone in the group has a key to that lock.  Given $n$ and $k$, how many locks are needed such that if the keys to the locks are distributed to the bandits properly, then every group of bandits of at least size $n$ can open all the locks, and no smaller group of bandits can open all the locks?  For example, if $n=3$ and $k=2$, only 3 locks are needed - keys to lock 1 can be given to bandits 1 and 2, keys to lock 2 can be given to bandits 1 and 3, and keys to lock 3 can be given to bandits 2 and 3.  No single bandit can open all the locks, but any group of 2 bandits can open all the locks.  My thoughts  At first glance, I thought it was just a simple combinations problem ($nCr$), and the provided test cases confirmed my suspicions: when $n=3$ and $k=2$, $\binom{3}{2}=3$.  Likewise, when $n=5$ and $k=3$, $\binom{5}{3}=10$.  However, two cases where this doesn't work are where $n=2$ and $k=1$ and $n=5$, $k=4$ (it gives $2$ and $5$, respectively, when the correct answer according to the judging data should be $1$ and $10$).  Next, I bothered a colleague who's a math major, and he briefly glanced at it and suggested it might be a hypergeometric distribution problem.  However, if this is correct, I'm having trouble wrapping my head around it - all the examples I can find have 2 distinct categories, e.g. red and green marbles being drawn from an urn, and I don't see that here.  An example in the terms of this problem would be extremely helpful.  If this isn't correct, where do I go from here?  I've been spinning my wheels on it for quite a while.  Background  This is for homework for a CS class (I'm a CS major with 2 semesters of calc plus discrete).  I'd like to be able to understand the math behind it, because once I can understand it, I can program it.  This problem originally came from an ACM ICPC regional contest this year, but my professor has made it into a challenge homework problem. Highlighting the selected tab using jQueryUI Tabs I have a header page with links to all the visualforce page as tabs.I need to highlight the tab on select of it.      &lt;apex:page title="{!$Label.site.site_login}" showHeader="false" sidebar="false"       standardStylesheets="false"&gt; &lt;apex:includeScript value="{!URLFOR($Resource.jQuery, '/js/jquery-1.4.2.min.js')}"  /&gt;   &lt;apex:includeScript value="{!URLFOR($Resource.jQuery, '/js/jquery-ui-1.8.6.custom.min.js')}"  /&gt; &lt;apex:stylesheet value="{!URLFOR($Resource.jQuery, '/css/ui-lightness/jquery-ui-1.8.6.custom.css')}"  /&gt;          &lt;html lang="en"&gt;  &lt;head&gt;   &lt;script src="http://ajax.googleapis.com/ajax/libs/jqueryui/1.8/jquery-ui.min.js"&gt;  $(function()  {   $( "#tabs" ).tabs();   });  &lt;/script&gt;   &lt;style&gt;   #tabs .ui-tabs-active    { background: red; }  &lt;/style&gt;     &lt;/head&gt;      &lt;body&gt;         &lt;nav class="navbar navbar-static-top navbar-inverse" role="navigation"&gt;             &lt;div class="container"&gt;                 &lt;div class="navbar-header"&gt;                     &lt;button type="button" class="navbar-toggle" data-toggle="collapse" data-target=".navbar-ex1-collapse"&gt;                         &lt;span class="icon-bar"&gt;&lt;/span&gt;&lt;span class="icon-bar"&gt;&lt;/span&gt;                         &lt;span class="icon-bar"&gt;&lt;/span&gt;                      &lt;/button&gt;                     &lt;a class="navbar-brand" style="line-height: 0px; padding: 10px 15px;" href="index.php.html"&gt;                         &lt;img height="30px" src="{!URLFOR($Resource.Resources, 'img/logo.png ')}" /&gt;                     &lt;/a&gt;                 &lt;/div&gt;                 &lt;div class="collapse navbar-collapse navbar-ex1-collapse" id="tabs"&gt;                     &lt;ul class="nav navbar-nav"&gt;                         &lt;li id="Home"&gt;                             &lt;apex:outputLink value="{!$Page.Home}"&gt;Home&lt;/apex:outputLink&gt;                         &lt;/li&gt;                         &lt;li id="chatter"&gt;                             &lt;apex:outputLink value="{!$Page.Chatter}"&gt;Chatter&lt;/apex:outputLink&gt;                         &lt;/li&gt;                         &lt;li id="page3"&gt;                             &lt;apex:outputLink value="{!$Page.page3}"&gt;Room&lt;/apex:outputLink&gt;                         &lt;/li&gt;                         &lt;li id="page4"&gt;                             &lt;apex:outputLink value="{!$Page.page4}"&gt;Page4&lt;/apex:outputLink&gt;                         &lt;/li&gt;                     &lt;/ul&gt;                 &lt;/div&gt;             &lt;/div&gt;         &lt;/nav&gt;     &lt;/body&gt;      &lt;/html&gt; &lt;/apex:page&gt; What happens in a circuit, when the wire and the battery are superconducting. And shorted This question is present as a matter of historical interest.  While you are encouraged to help maintain its answers, please understand that "big list" questions are not generally allowed on Ask Ubuntu and will be closed per the .   It is possible to greatly extend the usage time of a laptop or netbook running on battery by disabling various services and installing various packages.   What tricks or tips do people have for getting an extra hour or two out of their batteries? I am trying to understand the Georgi chapter of tensor methods in $SU(3)$ representations, and I don't know how to resolve the tensor product of 2 matrices in a 2 heavy quark + 2 light antiquark system. Namely:  Let the tetraquark system be:           $QQ\bar q\bar{q}$  So, those $Q$ heavy quarks interact and can be understood in the $3\bigotimes 3$ representations for $SU(3)$, and $\bar q\bar q$ can be understood as the $\bar 3\bigotimes\bar 3=3\bigoplus\bar 6$ representations for $SU(3)$.  The interaction diagram for the $Q$ heavy quarks is shown in the following scheme, which is an analogy to the Feynman Diagram where a gluon is understood to be exchanged between upper and lower arrows:  $i'\xrightarrow{(T_{a})^{i'}_{i}}i ,  {}^iQ$  $j'\xrightarrow{(T_{a})^{j'}_{j}}j ,  {}^jQ$  So, as usuall we consider the elements of $3$ representation as $u^i$, and therefore the elements of $\bar 3$ representation as $v_{j}$.  I must understand how does the following expression transform:  $(T_{a})^{i'}_{i}(T_{a})^{j'}_{j}\cdot(1/2)\cdot (w^iv^j+w^jv^i)=\Xi\cdot(1/2)\cdot(w^{i'}v^{j'}+w^{j'}v^{i'})$  In other words, how can one give the correct value of $\Xi$?  Note1: $T_a$ is understood to be the $a-ith$ generator of the associated Lie Algebra, which come from the definition of the Gell-Mann Matrices.  $(T_{a})^{i}_{j}\propto(\lambda)_{ij}$, in matrix notation.  Note2: I understand the Young Tableaux and they are not intended to be used here, so please don't try to explain this situation through the tables.   Note3: I assume this is a purely solvable mathematical problem and doesn't need a deep insight into the physical concepts...  Also requesting information about how to understand the tensor products in these cases, since I have been checking many sources but the definitions seem not clear enough. How to debug suspend? How do you make a torus 'telescope' open?