Please add a list of failed review audits I apparently failed too many First Post-review audits, and have been banned for two days.  I would like to have a list of audits I failed, so I can try and find some pattern in what I'm doing wrong.  It can be linked from the profile page or the review page.
Is it possible to see own 'review queue audits' results? I completed recently a few review audits, some of them I passed, some I failed.  Is there a place I could (easily) find these results?
I want to draw a perfect rectangle. How can I do that with QGIS v.3+?  .  Is there a similar solution for the latest QGIS version? Does an increasing sequence of reals converge if the difference of consecutive terms approaches zero? If $a_n$ is a sequence such that   $$a_1 \leq a_2 \leq a_3 \leq \dotsb$$   and has the property that $a_{n+1}-a_n \to 0$, then can we conclude that $a_n$ is convergent?   I know that without the condition that the sequence is increasing, this is not true, as we could consider the sequence given in  to a similar question that does not require the sequence to be increasing.  $$0, 1, \frac12, 0, \frac13, \frac23, 1, \frac34, \frac12, \frac14, 0, \frac15, \frac25, \frac35, \frac45, 1, \dotsc$$  This oscillates between $0$ and $1$, while the difference of consecutive terms approaches $0$ since the difference is always of the form $\pm\frac1m$ and $m$ increases the further we go in this sequence.    So how can we use the condition that $a_n$ is increasing to show that $a_n$ must converge?  Or is this still not sufficient? 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] solution :-  $21= 3 \times 7$  there is only one Sylow $3$ and Sylow $7$ subgroup  so, Sylow $3$ and Sylow $7$ subgroup are normal in group $G$  so $G$ is cyclic group of order $21$.  Am I right ?  somebody told me that group of order $21$ is not cyclic.  he gave me this .  If group of order 21 is not cyclic, then can we understand it by Sylow method ? What is the rule to convert the 'mm' notation to the 'optical zoom' notation? I searched a bit and found this one:  optical zoom = maximum focal length / minimum focal length   For example a 18-55mm lens would have a 3x optical zoom, and a 18-200mm lens would have a 11x optical zoom. Is that right? How to merge vertices in Blender? I am attempting to create my first 3D character just for practice. Being one of my first 3d models I going through the learning curve needless to say. In doing so I find myself creating many extra vertices. Where we will say 10 vertices on a rounded shape are spaced out on the equator and on the other north pole end of the edges they are very close. The close end could all be one vertex. Is it possible to say merge all points to one point and delete the rest? Why do non-constant periodic functions have no limit at infinity? how to host multiple pages from diferent domains all together? It's a series of fantasy books in which the inhabitants of the world, from the time when they're children, get to somehow have an accompanying small animal that represents their soul or their personality. Where is the itoa function in Linux? Any class of a nonempty $X$ generates a base for a topology on $X$. Theorem Any class $\mathcal{A}$ of subsets of a nonempty set $X$ is the subbase for a unique topology $\tau$ on $X$. That is to say, the finite intersections of members of $\mathcal{A}$ form a base for the topology $\tau$ on $X$. Example Consider $X=\{a,b,c,d\}$ Let $\mathcal{A}=\{\{a,b\},\{b,c\},\{d\}\}$ The finite intersection of members of $\mathcal{A}$ give us: $$\mathcal{B}=\{\{a,b\},\{b,c\},\{d\},\{b\},\varnothing,X\}$$  How is it true that $X \in \mathcal{B}$ ? By definition of subbase, the finite intersection of members of $\mathcal{A}$ are the members of some base $\mathcal{B}$. But for $a_i \in \mathcal{A}, \displaystyle\bigcap a_i \neq X$ for any finite intersection of $a_i$'s. Look: $\{a,b\}\cap\{b,c\}\cap \{d\} \neq \{a,b,c,d\}$ nor do any other intersection of elements of $\mathcal{B}$ result in $X$. Anybody know what's going on here? Why is $X \in \mathcal{B}$? How to model this odd-shaped distribution (almost a reverse-J) My dependent variable shown below doesn't fit any stock distribution that I know of.  Linear regression produces somewhat non-normal, right-skewed residuals that relate to predicted Y in an odd way (2nd plot).  Any suggestions for transformations or other ways to obtain most valid results and best predictive accuracy?  If possible I'd like to avoid clumsy categorizing into, say, 5 values (e.g., 0, lo%, med%, hi%, 1). Is there difference in force when the height increases? What is the mysterious stranger doing in my vault? Crash with error "No more room to grow table" We just had a scenario where the enemy set up a 'death trap' with arrow slits covering a corridor, allowing them to pop in, shoot, then pop out -- all without actually entering the corridor.  Which was fine in and of itself, until my cleric ran through the corridor at top speed, with Spirit Guardians up.  The DM and I discussed it, and as far as we can tell the spell doesn't require a line of sight and isn't blocked by walls -- just being 'in range' gets you the damage.  So I wiped out an entire encounter with one well placed third level spell.  In and of itself, that doesn't seem too OP -- at level 5/6 a third level spell is a pretty big investment!  But it still seems a bit odd that I can do it without even LOS.  Are there any rules I'm missing? On some Microsoft Access queries, I get the following message:  Operation must use an updatable query. (Error 3073).  I work around it by using temporary tables, but I'm wondering if there's a better way.  All the tables involved have a primary key. Here's the code:  UPDATE CLOG SET CLOG.NEXTDUE = (     SELECT H1.paidthru      FROM CTRHIST as H1     WHERE H1.ACCT = clog.ACCT AND     H1.SEQNO = (         SELECT MAX(SEQNO)          FROM CTRHIST          WHERE CTRHIST.ACCT = Clog.ACCT AND          CTRHIST.AMTPAID &gt; 0 AND         CTRHIST.DATEPAID &lt; CLOG.UPDATED_ON     ) ) WHERE CLOG.NEXTDUE IS NULL; In point-set topology, one always learns about the : the topology on an infinite product $X = \prod_{i \in I} X_i$ generated by sets of the form $U = \prod_{i \in I} U_i$, where $U_i \subset X_i$ is open.  This seems naively like a "good" topology to use for $X$.  However, one quickly learns that this is not so; that the  is the natural one.  The box topology has many strange properties that make it a good source for counterexamples, but I am not aware of it having any other applications.  So I would like to know:     Are there examples of using the box topology to prove interesting "positive" statements?   Edit: And to pursue a comment of Jim Conant:     Are there "non-artificial" problems where the box topology arises naturally?   Edit: The title is perhaps too flippant.  I don't mean to minimize the obvious significance of the box topology as a counterexample.  However, for the purposes of this question I am interested in positive results.  I'm not looking to be convinced that counterexamples are useful; I know that they are. I have email addresses encoded with HTML character entities. Is there anything in .NET that can convert them to plain strings? How do you become friends with someone?