Why does it put on record that I had a edit rejected, if it conflicted with a later one? If I do an edit, and while it is pending (being approved), someone comes and does the same edit, my edit gets rejected by 'Community'. It doesn't contribute to my edit ban, but it does still contribute to my 'number of rejected edits', which is shown to all the reviewers when I edit something. This seems pointless, as in fact, my edit was good, and was, in a way, implemented. I shouldn't be penalised for it.  I don't think that this should increment the rejected edits number for no reason, even if it still doesn't award the +2 rep and increment the accepted edits number either.
Dismiss suggested edits which conflict with full edit instead of auto rejecting them Currently, once an edit by a user without full edit privilege is suggested, it can be either approved or rejected.  There is a known edge case that cause suggested edits to get auto rejected: (aka edit conflict)   User with full edit privilege click "edit" and start typing. Let's name this user Joe. Since the user from previous step did not yet send the edit, users without full edit privilege can still click the "edit" as well, oblivious to the fact someone else is editing the same post in those very seconds. Such user click "edit" too and start typing. Let's name this user Kenny. Kenny is faster than Joe: he send his edit first, creating new suggested edit. Joe is still typing. Joe finally done typing. He send his edit to its merry way oblivious to the consequences. As result of the full edit made by Joe, Kenny's suggested edit is kicked away and rejected. Boom.   This is all known and reported many times.  where the user got it hard with at least two auto rejections in short period of time. Some concrete examples: , , .  For edge case, it became pretty thick edge. This is not just minor hassle: enough rejections, and the user is banned from suggesting for a whole week: and remember we're talking here about good edits made by good users. The above used to count for the ban, but . Thanks Gilles for requesting such a change!   I know it was already suggested to lock edits and similar solutions, but I suggest whole different approach: instead of auto rejecting the suggested edit, dismiss it, i.e. cancel it like it never existed same way a bounty can be revoked by moderator.  In the edit suggestion page it will show "Dismissed" instead of Approved or Rejected maybe with a tooltip explaining what caused this. This will soften the blow from those edge cases, taking the edge out of them. :)
How do you show monotonicity of the $\ell^p$ norms? I can't seem to work out the inequality $(\sum |x_n|^q)^{1/q} \leq (\sum |x_n|^p)^{1/p}$ for $p \leq q$ (which I'm assuming is the way to go about it). Let $f(x)$ a irreducible polynomial of degree $n$ over a field $F$. Let $g(x)$ be a polynomial in $F[x]$. Prove that every irreducible factor of the composition $f(g(x))$ has a degree which is divisible by $n$.  I don't know even how to begin. I really need help. Thanks Is there a rule to know when to pronounce letter c as a "soft c" (s) or "hard c" (k)? When I have a query that checks if a column of type uniqueidentifer does not exist in a table that has a null value then I get no results back. If the subquery does not return a null it works fine and it only happens when using not in.   I know I can just do a not null check in my subquery, but I am curious why this does not work.  Query Example:  select a.guid from tableA a where a.guid not in (select b.guid from tableB AS b)   Working Test:  select 1 where newid() not in (select newid())   Broken Test:  select 1 where newid() not in (select null) How to pad multiple strings when writing to console so that part is aligned left and part is aligned right? Is "funnest" a word? We seem to be stuck at an impasse on this issue.  Is funnest a word or not?  If so, does it mean "most fun"? How much willpower do gravely wounded soldiers lose? The text says they suffer a permanent reduction? I just received a PhD invitation letter from a German University which mentions that my remuneration will be 2/3 of full TV-L 13 position. I do not know what a TV-L 13 position is (Google is of no help here), and didn't want to be rude, so I am asking here first. Is this a common position or specific to Germany? If anyone knows, currently how much remuneration corresponds to a TV-L position? We want to have a plain empty sandbox - one without any configuration metadata or data from Production.  Is it possible to have such a sandbox?  Please advise. Prove that $\langle a^n \rangle \bigcap \langle a^k \rangle = \langle a^{lcm (n,k)} \rangle$ I have a laptop which I'm going to return due to battery defects. As I have already configured everything on this laptop, I'd like to migrate the installation on the new laptop (when I'll get it). The one to replace has a 128 GB eMMC, and two USB 3 ports. So, I was thinking to   Boot from a Linux live USB from port 1 Make an image with dd of the eMMC, saving it to a external HDD on port 2 Do the reverse on the new laptop   My question is, will it work fine with Windows? Does migrating this way have any issues? Would I be able to restore the installation if the new laptop is a different model with at least 128 GB? Is there a shortcode for linking to a user profile in an answer? Sometimes I want to refer to a specific user in an answer.  Something along the lines of      "From the answers of UserA and UserB I have crafted this super useful solution..."   Is there a shortcode creating a link to a user profile using the user name? Similar to the @ we have in the comments, but in an answer. In natural language parsing, what is the feature function? I'm working in the area of natural language processing, to be specific I'm reviewing the parsers that take advantage of data-mining techniques.   I've read an introduction to natural language processing, specifically the  by Della Pietra and others. In that paper, the authors explain that features are indicator functions that take into account certain aspects of the text. The problem is that this aspects affect the maximum entropy function.  In the case of parsing, I have problems understanding the concept of features. For parsing one must have:   Two sets, $X$ for the sentences and $Y$ for the parses For each sentence $x \in X$, one must have the N-best list of candidate parses; denoted $GEN(x) \subset Y$. Training samples $(x_j,y_j)$. The $x_j$ are sentences and the $y_j$ are parses. And a feature mapping $\Phi(X,Y)$ that maps each pair (x,y) to a vector of feature values.   The problem of parsing will consist of finding the weight vector such that the following expression is minimized  $$ -\sum log P(y_j|x_j,w) + \lambda ||w||_1 $$  where   $$ P(y_j|x_j,w) = \frac{exp \{w^T \Phi(x_j,y_j)\}   }{ \sum_{u \in GEN(x)} exp\{ w^T\Phi(x_j,u) \}  } $$  My question is, what are the features in this case? Some codified version of the parsing tree? Are the features a statistical concept?  I will also appreciate any bibliography that can be useful in tackling this issue.  UPDATE: I've talked to a professor and he had just told me that the features are obtained after doing a classification algorithm based on the parse-tree. Do you know what kind of classification is done with the parse tree? What mechanism is responsible for the creation of these dunes on Comet 67P/Churyumov-Gerasimenko?  The following high resolution picture from ESA's Rosetta mission shows the dunes:       At a distance of 7.8 km from the surface, the image scale is about   66.5 cm/pixel, so each 1024 x 1024 pixel frame is about 680 m across (although if we assume the furthest point away is an additional ~1 km   further from the centre, the image scale is about 92 cm/pixel).   So the scale of the dunes is on the order of tens of meters along the crest. And each crest are probably just a few meters apart. How to plot logistic regression decision boundary? I am running logistic regression on a small dataset which looks like this:    After implementing gradient descent and the cost function, I am getting a 100% accuracy in the prediction stage, However I want to be sure that everything is in order so I am trying to plot the decision boundary line which separates the two datasets.  Below I present plots showing the cost function and theta parameters. As can be seen, currently I am printing the decision boundary line incorrectly.    Extracting data  clear all; close all; clc;  alpha = 0.01; num_iters = 1000;  %% Plotting data x1 = linspace(0,3,50); mqtrue = 5; cqtrue = 30; dat1 = mqtrue*x1+5*randn(1,50);  x2 = linspace(7,10,50); dat2 = mqtrue*x2 + (cqtrue + 5*randn(1,50));  x = [x1 x2]'; % X  subplot(2,2,1); dat = [dat1 dat2]'; % Y  scatter(x1, dat1); hold on; scatter(x2, dat2, '*'); hold on; classdata = (dat&gt;40);   Computing Cost, Gradient and plotting  %  Setup the data matrix appropriately, and add ones for the intercept term [m, n] = size(x);  % Add intercept term to x and X_test x = [ones(m, 1) x];  % Initialize fitting parameters theta = zeros(n + 1, 1); %initial_theta = [0.2; 0.2];  J_history = zeros(num_iters, 1);   plot_x = [min(x(:,2))-2,  max(x(:,2))+2]  for iter = 1:num_iters  % Compute and display initial cost and gradient     [cost, grad] = logistic_costFunction(theta, x, classdata);     theta = theta - alpha * grad;     J_history(iter) = cost;      fprintf('Iteration #%d - Cost = %d... \r\n',iter, cost);       subplot(2,2,2);     hold on; grid on;     plot(iter, J_history(iter), '.r');  title(sprintf('Plot of cost against number of iterations. Cost is %g',J_history(iter)));     xlabel('Iterations')     ylabel('MSE')     drawnow      subplot(2,2,3);     grid on;     plot3(theta(1), theta(2), J_history(iter),'o')     title(sprintf('Tita0 = %g, Tita1=%g', theta(1), theta(2)))     xlabel('Tita0')     ylabel('Tita1')     zlabel('Cost')     hold on;     drawnow      subplot(2,2,1);     grid on;         % Calculate the decision boundary line     plot_y = theta(2).*plot_x + theta(1);  % &lt;--- Boundary line      % Plot, and adjust axes for better viewing     plot(plot_x, plot_y)     hold on;     drawnow  end  fprintf('Cost at initial theta (zeros): %f\n', cost); fprintf('Gradient at initial theta (zeros): \n'); fprintf(' %f \n', grad);   The above code is implementing gradient descent correctly (I think) but I am still unable to show the boundary line plot. Any suggestions would be appreciated.    logistic_costFunction.m  function [J, grad] = logistic_costFunction(theta, X, y)      % Initialize some useful values     m = length(y); % number of training examples      grad = zeros(size(theta));      h = sigmoid(X * theta);     J = -(1 / m) * sum( (y .* log(h)) + ((1 - y) .* log(1 - h)) );      for i = 1 : size(theta, 1)         grad(i) = (1 / m) * sum( (h - y) .* X(:, i) );     end  end   EDIT:  As per the below answer by @Esmailian, now I have something like this:  [m, n] = size(x);  x1_class = [ones(m, 1) x1' dat1']; x2_class = [ones(m, 1) x2' dat2'];  x = [x1_class ; x2_class] Using notify-send with cron I am using Arch Linux with KDE/Awesome WM. I am trying to get  notify-send to work with cron.   I have tried setting DISPLAY/XAUTHORITY variables, and running notify-send with "sudo -u", all without result.  I am able to call notify-send interactively from the session and get notifications.  FWIW, the cron job is running fine which I verified by echoing stuff to a temporary file. It is just the "notify-send" that fails to work.  Code:  [matrix@morpheus ~]$ crontab -l * * * * *  /home/matrix/scripts/notify.sh  [matrix@morpheus ~]$ cat /home/matrix/scripts/notify.sh #!/bin/bash export DISPLAY=127.0.0.1:0.0 export XAUTHORITY=/home/matrix/.Xauthority echo "testing cron" &gt;/tmp/crontest sudo -u matrix /usr/bin/notify-send "hello" echo "now tested notify-send" &gt;&gt;/tmp/crontest  [matrix@morpheus ~]$ cat /tmp/crontest testing cron now tested notify-send  [matrix@morpheus ~]$    As you can see the echo before &amp; after notify-send worked. Also I have tried setting DISPLAY=:0.0   UPDATE: I searched a bit more and  needs to be set. And after hardcoding this using the value I got from my interactive session, the tiny little "hello" message started popping up on the screen every minute!   But the catch is this variable is not permanent per that post, so I'll have try the the named pipe solution suggested there.   [matrix@morpheus ~]$ cat scripts/notify.sh #!/bin/bash export DISPLAY=127.0.0.1:0.0 export XAUTHORITY=/home/matrix/.Xauthority export DBUS_SESSION_BUS_ADDRESS=unix:abstract=/tmp/dbus-BouFPQKgqg,guid=64b483d7678f2196e780849752e67d3c echo "testing cron" &gt;/tmp/crontest /usr/bin/notify-send "hello" echo "now tested notify-send" &gt;&gt;/tmp/crontest   Since cron doesn't seem to support notify-send (at least not directly) is there some other notification system that is more cron friendly that I can use? The product of a normal and Rademacher variables, independent from each other Let $X\sim N(0,1)$ and let $Z$ be a random variable independent of $X$ such that:  \begin{equation} \Pr(Z=z) = \begin{cases} \frac{1}{2} &amp; \mbox{if $z = -1$ or $z=1$}, \\ \\ 0 &amp; \mbox{otherwise}. \end{cases} \end{equation}   Define $Y = ZX$. Show that $Y \sim N(0,1)$. Determine $\operatorname{Cor}(X,Y)$. Are $X$ and $Y$ independent?   Progress:  I'm basically stuck at the beginning. I got as far as $P(ZX &lt; y) = P(Z &lt; y/X)$, which I'm not even sure is correct. I'm also not clear on what it means by defining $Y = ZX$ - does it mean I need to state the probability density function or something? And how do I show that $Y \sim N(0,1)$? How do I deal with a runaway bride? How do I count attendance in Excel? Search by multiple tags I'd like to be able to search for questions by multiple tags; for example "questions tagged 'nhibernate' and 'web-services'".  I can get close by searching for "nhibernate web-services" but the results tend to be a few questions that relate to both terms--but much more largely just questions that relate to one or the other.