I added comments to a bunch of cells. When I then sorted the cells, the comments did not follow their original cell and now was connected to the new cell.  This is a massive problem and now my comments are all messed up.   This is the same problem that was brought up here, but was not answered.    Any ideas?
I'm running into this weird problem with Google spreadsheets: if the cells have comments on them and I sort the spreadsheet, the rows sort but the comments stay in the same position, and don't move with the cells they're attached to.  In other words, the cells look like this:  A C  &lt;-- comment on this cell B   and then I sort by this column:  A B  &lt;-- comment remains on this cell (stays in position) C  &lt;-- comment should have remained attached to this cell   This means that sorting is completely broken and I can't use it at all, because I clearly need the cell comments to stay with the cell they're attached to.  Is this a bad bug in Google Spreadsheets, or am I missing something here?
Using ST_Union in PostGIS I have a spatial table (polygons,polylines) in a database. These are digitized by multiple people. For example, a state is divided into multiple Grids and given to multiple people to digitize using QGIS; which is connected to a postgres database. Now, I have to merge all those polygons and polylines. I don't know how to do this via ST_Union. I Used the following snippet to merge the polygons and polylines CREATE TABLE schema_name.polygon_un2 AS SELECT upg.un_geom,npg.Column1,npg.Column2,npg.Column3,npg.Column4,npg.Column5  FROM (  SELECT st_union(the_geom) As un_geom,(   SELECT oid FROM schema_name.polygon    WHERE oid = 100748191   ) FROM schema_name.polygon WHERE oid IN (100748191,100763519)  ) upg  INNER JOIN schema_name.polygon npg ON npg.oid = upg.oid;   DELETE FROM schema_name.polygon WHERE oid IN (100748191,100763519);  I have the interesecting polygon oid in a Seperate Table, I want to do this process in an update query and that should be a dynamic plpgsql function.  Green : Grid , Other : Polygon But This snippet did not work !! The snippet which i expect is  It should create a new row for the merged polygons and polylines (eg oid - 1 and 2 merged to oid 3).  The polygons which are not merged (eg 1 and 2 should be deleted) How to fix the incompatility between BiBer and BiBLaTeX versions in TeXmaker? How to install hp scanjet 200 in Ubuntu 12.04? Unable to scan with hp scan-jet 200. When I type lsusb command in terminal it shows the scanner details.  I opened the simple scan which displays no scanners found, and x sane image scanners also displays the same error. Should you gain rep for asking a duplicate question? I am trying to use a  as input and then creating a query with it - so I need a .    I was surprised to find that it couldn't do the conversion implicitly or explicitly - but I don't even know how I would do this, as the Java API is still fairly new to me. I am currently in a clan with three members. When we tried to initiate a clan war it said we had insufficient clan requirements. Does anyone know what the full requirements are? Is there a minimum clan member requirement? I'm trying to connect 32 I²C "root of trust"  devices.    I'm thinking about a good way that does that, I mean what kind of communication should I use? A digital multiplexer that selects a device? but based on what? switching on the VDD source? but that needs reinitialization of the device and that takes time. keyboard hard remap keys? How does a Support Vector Machine (SVM) work? How to combine measurement error with statistic error We have to measure a period of an oscillation. We are to take the time it takes for 50 oscillations multiple times.  I know that I will have a $\Delta t = 0.1 \, \mathrm s$ because of my reaction time. If I now measure, say 40, 41 and 39 seconds in three runs, I will also have standard deviation of 1.  What is the total error then? Do I add them up, like so?  $$\sqrt{1^2 + 0.1^2}$$  Or is it just the 1 and I discard the (systematic?) error of my reaction time?  I wonder if I measure a huge number of times, the standard deviation should become tiny compared to my reaction time. Is the lower bound 0 or is it my reaction time with 0.1? ESM is available for 12.04, which enables Advantage customers to keep receiving kernel updates and updates for many user space packages. In our case it's very important to know if we'll be able tot use Ubuntu 14.04 safely after April '19, because it is not possible to upgrade our application and migrate it to say, 16.04. There are numerous (, , ) questions concerning this problem. I realize this is a borderline duplicate, but I'll re-iterate the futility of this particular filter and why it should be outright removed from Stack Overflow.  Do you know how effective this is in preventing users who just don't care from posting questions with bad titles? 100% ineffective. What do these users do?   Replace it with a synonym: "issue," "trouble," "predicament," "botheration" or what have you. Or worse, they simply work around the filter by deliberately misspelling the word or inserting space or punctuation:    () ?    and the coup de grâce:      I mean, even Jeff . This adds zero value to the title. In fact, it looks worse. Why, oh why are people  to scrap a bad feature? All this does is:   Prevent people who have a  to use the word "problem" in the title from posting questions with an appropriate title. Break the search feature because of workarounds or the need to use less descriptive titles than the error itself   This is an extraordinarily useless (and harmful) feature. Please, for the love of Cthulhu,  remove, eliminate, abolish, eradicate, extirpate this "feature" from Stack Overflow.    Bonus:     So I can't mention the Halting Problem in the title? – Keith Thompson Nov 1 at 19:05      @KeithThompson Maybe it's a "Halting Issue". Or "Need help with Halting". Or the "Halting thing in Computability Theory". – slhck Nov 1 at 19:14 How to divide aleph numbers Nested roots sequence, how to prove it's monotone and bounded? Let $a\ge1$ and define the sequence $(x_n)$ recursively by: $$x_1 = \sqrt{a}$$ $$x_{n+1}= \sqrt{a+x_n}$$  Here's what I did:  Plugging in some values makes it seem as if the sequence is increasing. I first solve the equation $t=\sqrt{a+t}$, equivalently $t^2 -t -a =0$, to get an idea what's going on. The roots are $$t_{1,2}= \frac{1 \pm \sqrt{1+4a} }{2}.$$ Therefore, between the roots, that is for $$t\in \left( \frac{1 - \sqrt{1+4a} }{2}, \frac{1 + \sqrt{1+4a} }{2}\right)$$  we have $t^2-t-a \le 0 \iff t \le \sqrt{a+t}$. Here's my attempt at showing inductively that $$\forall n\in \mathbb{N}, \ x_n \le \frac{1 + \sqrt{1+4a} }{2}$$  For $n=1$, the statement is true (simple arithmetic). Suppose it's true for $n$. Consider  $$x_{n+1}= \sqrt{a+x_n}\le \sqrt{a+\frac{1 + \sqrt{1+4a} }{2}}=\frac{1 + \sqrt{1+4a} }{2},$$  because $\frac{1 + \sqrt{1+4a} }{2}$ satisfies $x=\sqrt{x+a}$.  So this establishes the sequence $(x_n)$ is bounded. Now, by induction again, I try to show it's monotonically increasing. The base case $x_1\le x_2$ is obvious. Assume (strong induction) $x_{n-1}\le x_n$ for all $n&gt;1$. But since we have $$x_1\le x_n \le \frac{1 + \sqrt{1+4a} }{2}, $$   then $x_n$ lies in the appropriate interval, so $x_n \le \sqrt{a+x_n}=x_{n+1}.$  Is this proof correct? Can the condition on $a$ be relaxed to $a&gt;0$? Maybe even small negative $a$? And could someone provide me with another proof of convergence of $x_n$? I absolutely hate this one! How to find the roots of $x^4 +1$ I'm trying to find the roots of $x^4+1$. I've already found in this site solutions for polynomials like this $x^n+a$, where $a$ is a negative term. I don't remember how to solve an equation when $a$ is a positive term as the equation above.  Thanks Antonym of "deepen" Since there is no word "shallowen", is there a good antonym of "deepen"? The meaning of "deepen" that I am referring to here is "to cause to become deeper." It doesn't necessarily refer to digging a hole. For example, a temporary deformation in a soft surface:     Putting the anvil on the mattress deepens the depression in it, but removing the anvil ______ it.   I would also be happy with an antonym of the intransitive version "to become deeper." I'd like to do something like this to tick a checkbox using jQuery:  $(".myCheckBox").checked(true);   or  $(".myCheckBox").selected(true);   Does such a thing exist? I used this isomorphism today but now I'm having trouble justifying it. The norm function isn't additive so I can't come up with a ring isomorphism to prove the following:     For any $\,a+bi\in\Bbb Z[i],\,\gcd(a,b)=1$, we have a ring isomorphism   $$\Bbb Z[i]/\langle a+bi\rangle\,\cong\Bbb Z/(a^2+b^2)\Bbb Z=:\Bbb Z_{a^2+b^2}.$$   Could someone show me an isomorphism between these rings to prove this? number of ways to make $2.00 How many different ways can you make $2.00 using only 1 cent, 5 cent, 10 cent, and 25 cent pieces, and 1 and 2 dollar bills (there are 100 cents in a dollar)? I have worked out an equation:  $$p + 5n + 10d + 25q + 100l + 200t = 200$$  Where all variables are non-negative integers. But I don't know what to do from here to figure out how many different sets of non-negative integers there are that satisfy this equation. What do I do next? How to choose trace width for very high current PCB? I am currently designing a PCB layout for my team's high current, high voltage project and am having trouble with choosing my trace width.  The circuit is composed of 12 inductors placed in series with short traces connecting them together (about 5mm max length). We are feeding 10μs pulses at ~300A/1000V at a maximum rate of 10 pulses per second by discharching capacitor banks into the coils. The capacitors are recharged by an external source.  I have looked for resources on the subject, but nothing I could find applies to the level of current and voltage we are applying.  Is there a rule for determining trace width for very high current pulses?