Error validating geometries in PostGIS
Error validating geometry collection / multipolygon in PostGIS
Why is it better to use "#!/usr/bin/env NAME" instead of "#!/path/to/NAME" as my shebang? Is there a way to get the name of the currently executing method in Java? I'm trying to find a post I made on my timeline (aka wall) several months (or even years) ago, but can't find a way to search for it. I , but that's very heavy.   Currently, I open the activity log (e.g., https://www.facebook.com/username/allactivity) and start scrolling down to get some info on the page. Then I use my browser to search for the text. But this is slow and, depending on how far back I want to go, tedious. Clicking on the earliest month/year in the filter only loads those periods specifically.    Anyone know of a better way that will find the search words anywhere on your activity log quickly?    Edit: There's a  (not really a bug, but lack of a feature) related to this on Facebook's developers forum. Simple form validation As part of graduating from Area51 and becoming a full fledged site we sometimes change domain names from http://topic.stackexchange.com to http://example.com. Aside from the obvious 301 redirect rules to support existing urls transparently, are there other techniques that would aid in the preservation of SEO? Best way to restrict access by IP address? For an ASP.NET C# application, we will need to restrict access based on IP address. What is the best way to accomplish this? Foreign key constraints failures Given the following tables:  CREATE TABLE `longdescs` (   `comment_id` int(11) NOT NULL AUTO_INCREMENT,   `bug_id` mediumint(9) NOT NULL,   `who` mediumint(9) NOT NULL,   `bug_when` datetime NOT NULL,   `work_time` decimal(7,2) NOT NULL DEFAULT '0.00',   `thetext` mediumtext NOT NULL,   `isprivate` tinyint(4) NOT NULL DEFAULT '0',   `already_wrapped` tinyint(4) NOT NULL DEFAULT '0',   `type` smallint(6) NOT NULL DEFAULT '0',   `extra_data` varchar(255) DEFAULT NULL,   PRIMARY KEY (`comment_id`),   KEY `longdescs_bug_id_idx` (`bug_id`),   KEY `longdescs_who_idx` (`who`,`bug_id`),   KEY `longdescs_bug_when_idx` (`bug_when`),   KEY `comment_id` (`comment_id`),   CONSTRAINT `fk_longdescs_bug_id_bugs_bug_id` FOREIGN KEY (`bug_id`) REFERENCES `bugs` (`bug_id`) ON DELETE CASCADE ON UPDATE CASCADE,   CONSTRAINT `fk_longdescs_who_profiles_userid` FOREIGN KEY (`who`) REFERENCES `profiles` (`userid`) ON UPDATE CASCADE ) ENGINE=InnoDB AUTO_INCREMENT=82727 DEFAULT CHARSET=utf8  CREATE TABLE `trace` (   `id` mediumint(9) NOT NULL AUTO_INCREMENT,   `comment_id` mediumint(9) NOT NULL,   `type` varchar(255) NOT NULL,   `short_hash` char(22) DEFAULT NULL,   `stack_hash` char(22) DEFAULT NULL,   `trace_text` mediumtext NOT NULL,   `quality` double NOT NULL,   PRIMARY KEY (`id`),   UNIQUE KEY `trace_comment_id_idx` (`comment_id`),   KEY `trace_short_hash_idx` (`short_hash`),   KEY `trace_stack_hash_idx` (`stack_hash`) ) ENGINE=InnoDB AUTO_INCREMENT=2 DEFAULT CHARSET=utf8  ALTER TABLE trace ADD CONSTRAINT `fk_trace_comment_id_longdescs_comment_id` FOREIGN KEY (`comment_id`) REFERENCES `longdescs`(`comment_id`) ON UPDATE CASCADE ON DELETE CASCADE; ERROR 1005 (HY000): Can't create table 'bugs4.#sql-4bb_6f1d' (errno: 150)   MariaDB [bugs4]> show warnings;  | Level  | Code | Message | | Warning |  150 | Create table 'bugs4/#sql-4bb_6f1d' with foreign key     constraint failed. There is no index in the referenced table where the referenced columns appear as the first columns.  | | Error   | 1005 | Can't create table 'bugs4.#sql-4bb_6f1d' (errno: 150)                                                                                                                       |   Any idea why I get that error? FYI I looked it up and it appears that it was a bug but not anymore. Basically the question is how to get from this:   foo_id   foo_name 1        A 1        B 2        C   to this:   foo_id   foo_name 1        A B 2        C I deleted an answer which had no upvotes or downvotes, but after some time I saw that my reputation was -2 and the reason is linked to my search engine.    I want to know why this happened and what "linked to my serach engine" means? Roots in a polynomial ring How to read over 4k input without new lines on a terminal? So I have a lot of data WITHOUT NEW LINES on the clipboard (it's a large SVG file on one line). I went  $ cat &gt;file.svg   then tried to paste (in Gnome Terminal), but only the first 4kB characters were accepted.  I assume this is a readline feature/limitation.  Is there a way to read from STDIN that would avoid this problem?  EDIT  Test case: Create a demo file. This one will have ~4k "=" symbols followed by "foo bar".  { printf '=%.0s' {1..4095} ; echo "foo bar" ; } &gt; test.in   Copy that into your clipboard  xclip test.in   (if you want to middle-click to insert) or  xclip -selection clipboard test.in   (if you want to use Ctrl-Shift-Insert to past it in)  Then cat &gt;test.out, paste (whichever way). Press Ctrl-D to end the stream. cat test.out - do you see "foo bar"?  On my set-up (Ubuntu 12.04, Gnome Terminal, zsh) when I paste I only see the = and I don't see foo bar. Same when I inspect test.out. How do I resolve slow and choppy performance in virtualbox? Ubuntu runs very slowly inside of VirtualBox.  How do I run Ubuntu with unity or enabled transparency smoothly with VirtualBox? fastest way to detect if a value is in a group of values in Javascript I have a group of strings in Javascript and I need to write a function that detects if another specific string belongs to this group or not.  What is the fastest way to achieve this? Is it alright to put the group of values into an array, and then write a function that searches through the array?  I think if I keep the values sorted and do a binary search, it should work fast enough. Or is there some other smart way of doing this, which can work faster? How do I work with the Card Layout in the NetBeans GUI builder? Modified Hamilton's Principle overconstraining a system by imposing too many boundary conditions In Hamiltonian Mechanics, a version of Hamilton's principle is shown to evolve a system according to the same equations of motion as the Lagrangian, and therefore Newtonian formalism. In particular, letting $\delta$ indicate a variation of the path through phase space, $$ \delta \int_{t_1}^{t_2} \big(p_i \dot{q}_i - H(p_i,q_i,t)\big)dt = 0 $$ is shown to generate the same motion equations as those found by the Legendre transform of the Lagrangian equations of motion. Essentially, when we calculate the Euler-Lagrange equations for the above integrand, we find $$ \dot{p}_i + \frac{\partial H}{\partial q_i} = 0\text{, } \dot{q}_i - \frac{\partial H}{\partial p_i} = 0. $$ Now, since these are both first-order equations of motion, we require $2n$ boundary conditions to obtain a solution, where $n$ is the number of particles. This is perfectly consistent with the Lagrangian formalism which had $2n$ boundary conditions due to its $n$ distinct second-order motion equations.   An important thing to note is that since $p_i\dot{q}_i - H(p_i,q_i,t)$ contains no $\dot{p}_i$ dependence, the variation in $p_i(t)$ need not be zero at the endpoints of the path. This is not the case with $q_i(t)$ because the $\dot{q}_i$ dependance results in the appearance of boundary terms that must be set to zero in order to obtain the motion equations.  Now, as far as the boundary conditions are concerned, this makes sense. For the path to be uniquely specified given Newtonian mechanics, we require $2n$ boundary conditions. These can either be the usual Newtonian choice of initial positions and velocities/momenta, or they can be the initial and final positions. Both are perfectly acceptable mathematically speaking. If we were required, in the modified Hamilton's principle variation, to enforce that the variations in the momenta also be zero at the initial and final times, this would mean $2n$ additional boundary conditions, which would generally over constrain a Newtonian system.   However, my confusion is this: when textbooks (Goldstein in particular) consider generating functions, they require that the integrand be invariant to the addition of a total time derivative of a function $F(q_i,p_i,t)$ of the phase space coordinates. However, adding such a function will in general add some $\dot{p}_i$ dependence to the integrand, which will then add boundary terms to the equations of motion unless we require that the $p_i(t)$ variations be zero at the boundaries. This is fine as far as it goes. We can always define the variation however we like. The point is just that it spits out the right motion equations at the end of the day. But my confusion lies in how this doesn't generally over constrain the system. If we specify all the positions and momenta at both the initial and the final times, might not the required path to connect those points in phase space be non-Newtonian? Does this only matter if you're actually trying to use the stationary action principle to find the paths, rather than just using it to find the motion equations? I have to submit a manuscript to a journal, and I just realized that they want every single part of the paper to be in 12 pt font. This includes tables text, footnotes, acknowledgements etc. Is there a way to force all text to be the same size? How can I test if a RegEx matches a string exactly?  var r = /a/; r.test("a"); // returns true r.test("ba"); // returns true testExact(r, "ba"); // should return false testExact(r, "a"); // should return true What is the concept of erasure in generics in Java? What is the concept of erasure in generics in Java? Find $\lim_{n \to \infty} \left[\frac{(n+1)^{n + 1}}{n^n} - \frac{n^{n}}{(n-1)^{n-1}} \right]$ (a question asked at trivia) My friend's trivia league had this math question:  $$\lim_{n \to \infty} \left[\frac{(n+1)^{n + 1}}{n^n} - \frac{n^{n}}{(n-1)^{n-1}} \right]$$  After computing a few values, one could guess the answer is $e$ = 2.718...But how can we prove that is the limit?  Someone offered up a hand-wavy proof like this:  \begin{align} \lim_{n \to \infty} \left[\frac{(n+1)^{n + 1}}{n^n} - \frac{n^{n}}{(n-1)^{n-1}} \right] &amp; = \lim_{n \to \infty} \left[\frac{(n+1)(n+1)^{n}}{n^n} - \frac{n \cdot n^{n-1}}{(n-1)^{n-1}} \right] \\ &amp;= \lim_{n \to \infty} \left[(n+1)\frac{(n+1)^{n}}{n^n} - n\frac{n^{n-1}}{(n-1)^{n-1}} \right] \\ &amp;= \lim_{n \to \infty} \left[(n+1)\left(1 + \frac{1}{n} \right)^n - n\left(\frac{n - 1 + 1}{n-1} \right)^{{n-1}} \right] \\ &amp;= \lim_{n \to \infty} \left[(n+1)\left(1 + \frac{1}{n} \right)^n - n\left(1 + \frac{1}{n-1} \right)^{n-1} \right] \\ &amp;= \lim_{n \to \infty} \left[(n+1)e - n \cdot e \right] \\ &amp;= \lim_{n \to \infty} e \\ &amp;= e \end{align}  The part about substituting $e$ is hand-wavy since technically this is an indeterminate form of $\infty - \infty$. And using $e$ as as upper bound did not lead me to an easy proof either.  Is there a way to rigorously prove the limit? I tried a few approaches: (a) sandwiching the limit--I could prove $e$ was a lower bound, but I could not find a suitable upper bound converging to $e$, (b) using L'Hopital's rule with no luck, (c) using the mean value theorem--but that also got complicated.  So this is a pretty tough problem to ask at trivia! Is there a way to prove this limit formally?  Sources  Trivia question:   Thread on trivia:   Hand-wavy proof:   Idea for mean value theorem: I have a web page that includes a bunch of images. Sometimes the image isn't available, so a broken image is displayed in the client's browser.  How do I use jQuery to get the set of images, filter it to broken images then replace the src?    --I thought it would be easier to do this with jQuery, but it turned out much easier to just use a pure JavaScript solution, that is, the one provided by Prestaul.