So I entered Riverwood, and was attacked by 3 “thugs”. On one of their bodies was a contract, that said      Here is the agreed upon amount. I expect you to faithfully carry out my request to teach a lesson to the thief Cyoce. You need not kill him, but I have no qualms about it if you deem it necessary.      -- Orgnar   I’ve looked around, and there are several answers, but I don’t understand why it’s happening to me. First, I have never stolen from anyone, let alone Orgnar. Also, this is the second time I’ve been attacked. Is there a way to stop it? Can I yield to them after a bit, and have it qualify as having been “taught a lesson”? Would killing Orgnar stop it? Is there a way to do so without incurring a bounty (I am a warrior; I doubt assassination would work)? Any suggestions? Or do I just need to deal with random attacks from thugs as well as dragons?
So, I was just assaulted by a trio of fairly well armed thugs while walking out of Riften. Before attacking me, they informed me that they were 'here to teach me a lesson.'  After dispatching them in due course, I found this on the body of what I can only assume to be the leader, given his vastly superior armaments:   Orgnar is the innkeeper in Riverwood. Now, I admit, I've stolen a fair amount, but I pride myself on having never been caught. My total bounty to date is at zero. So, how did he figure out that I stole something, why is he taking the law into his own hands, and if I go back to Riverwood, am I going to get shanked?
I'm interested in Gaussian blur layer that blurring all inside of some figure located on this layer.  I mean, blurred background of some exact area. And in case of I move this area, blurred image must be updated. If I move some object in background - blur must be updated. etc. Setting Boundaries around city in google maps Find & Delete duplicated files on multiple harddisks at once So earlier today I came across , and I am having some trouble understanding the solution. The question is as follows:     You throw a fair six-sided die until you get 6. What is the expected   number of throws (including the throw giving 6) conditioned on the event   that all throws gave even numbers?   Quoted from Jimmy Jin in "Elchanan Mossel’s dice problem"  In the paper it goes on to state why a common wrong answer is $3$. Then afterwards explains that this problem has the same answer to,   "What is the expected number of times you can roll only $2$’s or $4$’s until you roll any other number?"  I don't understand why this is the case. If the original problem is asking for specifically a $6$, shouldn't that limit many of the possible sequences?  I also attempted to solve the problem using another method, but got an answer different from both $3$ and the correct answer of $1.5$.  I saw that possible sequences could have been something like:  $$\{6\}$$ $$\{2,6\}, \{4,6\}$$ $$\{2,2,6\}, \{2,4,6\}, \{4,2,6\}, \{4,4,6\}$$ $$\vdots$$  To which I set up the following summation and solved using :  $$\text{Expected Value} =\sum_{n=1}^\infty n\left( {\frac{1}{6}} \right)^n 2^{n-1} = 0.375$$ Obviously this is different and probably incorrect, but I can't figure out where the error in the thought process is.  Any help on understanding this would be greatly appreciated.  A blog post discussing the problem can be found Deleting external/auxiliary files? How can I tell if an AC adapter is compatible with my laptop? Possible Duplicate:        How can I tell if an AC adapter is compatible with my laptop?  For example, does the voltage output have to bee the same, or just close?  What power measurements matter? When I gain control of a creature, do I also gain control of any auras or equipment attached to it? What would happen if I 'd a creature that had been enchanted by a bestow creature and cast a spell to give it protection from the enchantment's color on it to remove the bestowed creature?  For instance:  They have just bestowed a  on a  and passes the turn. I use Portent of Betrayal to take control of the Asphodel Wanderer, attack and in the second main I cast Gods Willing to give the Asphodel Wanderer protection from black. Nighthowler detaches and where does it go, my control, opponents control or graveyard?  As an additional question, in the same vein:  What if I destroyed the creature while it was on my side? So change the gods willing to a hero's downfall in the example.  Relevent (under state-based actions):     704.5n If an Aura is attached to an illegal object or player, or is not attached to an object or player, that Aura is put into its owner's graveyard. Why is this series of square root of twos equal $\pi$? Wikipedia claims this but only cites an offline proof:  $$\lim_{n\to\infty} 2^n \sqrt{2-\sqrt{2+\cdots+ \sqrt 2}} = \pi$$  for $n$ square roots and one minus sign. The formula is not the "usual" one, like Taylor series or something like that, so I can't easily prove it. I wrote a little script to calculate it and it's clearly visible, but that's not a proof. Identify $E(X\mid X+Y)$ for $X$ and $Y$ independent and Poisson I am currently trying to understand how does an instance of the EM algorithm is derived when there are "hidden variables" in this old paper: .  I don't really understand how the expectation step is derived, and what bothers me the most, is that I cannot prove the following statement (right before 2.11):  $$ \mathbb{E}[X|X+Y] = \frac{(X+Y)\lambda_X}{\lambda_X+\lambda_Y} $$  where $X \sim Poisson\{\lambda_X\}$ and $Y \sim Poisson\{\lambda_Y\}$  To begin, I wrote the discrete expectation as follows: $$ \mathbb{E}[X|X+Y] = \sum_{k=1}^{X+Y} k P(X=k|X+Y)\\ = \sum_{k=0}^{X+Y} k \frac{P(X+Y|X=k)P(x)}{P(X+Y)} $$  Where I can replace $$ P(X+Y=k) = \frac{(\lambda_X+\lambda_Y)^ke^{-(\lambda_X+\lambda_Y)}}{k!}$$ $$ P(k=x) = \frac{\lambda_X^xe^{-\lambda_X}}{x!}$$ $$ P(X+Y=k|x) = P(Y=x-k) = \frac{\lambda_Y^{x-k}e^{-\lambda_Y}}{(x-k)!}$$  but I dont really know how to mix that together, because I don't really see what does the event $X+Y$ stands for, and how does it rely on the x in the integral ?  Thank you very much for you help Man travelling alone across a planet, thinks about a fearsome creature that he hears behind him About fifteen years ago I read a short story about a man on a planet (possibly Mars or the Moon), travelling alone between bases. It's written in the first person and as he's walking across the planet, he's thinking to himself about this fearsome creature that preys on people. It sneaks up on them, makes some noise and then attacks them. Just as he turns the final corner of the canyon he was walking through and sees the door to the other base, he hears the creature behind him making its noise and the story ends.  It was in a short story collection but I don't remember the name of the story or the book it was in. Any help would be much appreciated. I have a log file being written by another process which I want to watch for changes. Each time a change occurs I'd like to read the new data in to do some processing on it.  What's the best way to do this? I was hoping there'd be some sort of hook from the PyWin32 library. I've found the win32file.FindNextChangeNotification function but have no idea how to ask it to watch a specific file.  If anyone's done anything like this I'd be really grateful to hear how...  [Edit] I should have mentioned that I was after a solution that doesn't require polling.  [Edit] Curses! It seems this doesn't work over a mapped network drive. I'm guessing windows doesn't 'hear' any updates to the file the way it does on a local disk. Can you intentionally fail a skill check? This comes up to me in the context of the 3.x/PF/d20 Fly skill, even when I simply read about it: Can you intentionally fail a Fly skill check, or any other skill check for that matter, if you, or your character for that matter, decides that the effects of failing the check are what is desired in the situation?  Example:  Take a a shapeshifted Draconian cruising at high altitude, with a few friends on his back who have some means of breathing air supply, whether it be mundane or magical.  Now lets say that the air supply goes kablooie, similar to a decompression or all-packs-trip in an airliner.  For the sake of the folks on his back -- if not himself, depending on if dragon forms need supplemental air to fly at such high altitudes, the Draconian has to lose altitude, and fast.  Considering that by RAW, a Fly check failure leaves yourself falling, would saying "I initiate a rapid descent" be enough to treat the next Fly check as an intentional failure, or would you have to roll a 'reverse' Fly check, where failing the check gives you the desired outcome of a rapid descent, and succeeding leaves you stuck at altitude?  P.S. I added the rules-as-written tag because a RAW answer is highly desired here, albeit not mandatory.  I can already mostly figure it out from a simulationist standpoint, but that answer involves going in-depth into airline flying and non-normal procedures. Identifier for win64 configuration in Qmake Is there a "win64" identifier in Qmake project files?  documentation does not mention other than unix / macx / win32.  So far I've tried using:  win32:message("using win32") win64:message("using win64") amd64:message("using amd64")   The result is always "using win32".  Must I use a separate project-file for x32 and x64 projects, so they would compile against correct libraries? Is there any other way to identify between 32-bit and 64-bit environments? 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] Number of homomorphisms between two cyclic groups. Compare nullable types in Linq to Sql I have a Category entity which has a Nullable ParentId field. When the method below is executing and the categoryId is null, the result seems null however there are categories which has null ParentId value.  What is the problem in here, what am I missing?  public IEnumerable&lt;ICategory&gt; GetSubCategories(long? categoryId) {     var subCategories = this.Repository.Categories.Where(c =&gt; c.ParentId == categoryId)         .ToList().Cast&lt;ICategory&gt;();      return subCategories; }   By the way, when I change the condition to (c.ParentId == null),  result seems normal. Email Templates: Conditional Greeting Based on Time of Day Prove that $\int f\ d\lambda = \int_{a}^{b} f(x)\ dx,$ for any $f \in \mathcal R[a,b].$ Theorem $:$ Let $f : [a,b] \longrightarrow \Bbb R$ be a Riemann integrable function. Then $f \in L_1[a,b]$ and $$\int f\ d\lambda = \int_{a}^{b} f(x)\ dx.$$  The proof given in my book is as follows $:$     At the fag end of the proof $f$ has been proved to be measurable which uses the completeness of the measure space $\left ([a,b], \mathcal L \cap [a,b], \lambda |_{[a,b]} \right ).$ Then it has been stated that $f \leq \Phi_n,$ $\forall$ $n$ and hence $f \in L_1[a,b]$ since $\Phi_n \in L_1[a,b]$ by the proposition $5.4.3 \ $(i) which states the following $:$  Let $f \in \Bbb L$ and $g \in L_1[a,b].$ If $|f(x)| \leq g(x)$ for a.e. $x(\mu).$ Then $f \in L_1[a,b].$  I don't know how to use this proposition to claim that $f \in L_1[a,b].$ Also I don't understand the way dominated convergence theorem used here. What I know about dominated convergence theorem is as follows $:$  Let $(X, \mathcal S, \mu)$ be a complete measure space. Let $g \in L_1(X)$ and $\{f_n \}_{n \geq 1}$ be a sequence in $\Bbb L$ such that $|f_n(x)| \leq g(x)$ a.e. $x(\mu).$ Let $f_n(x) \to f(x)$ as $n \to \infty$ a.e. $x (\mu).$ Then $f \in L_1(X)$ and $$\int f\ d\mu = \lim\limits_{n \to \infty} \int f_n\ d\mu.$$  From here how to conclude that $$\Psi_n\ \bigg\uparrow\ f \implies \int f\ d\lambda = \lim\limits_{n \to \infty} \int \Psi_n\ d\lambda.$$ Please help me in this regard. Thanks in advance. Summing data from column in the Attribute table I'm working with population data, and I have an issue when it comes to knowing the sum of a population inside the attribute table.  In my attribute table, I'd like to add all the numbers in the red box, i.e. all the numbers together from the column &quot;UN_2015_E&quot;. Is there a way to do so? Why can't I log into minecraft with a mojang account? I created a Mojang account and downloaded the Minecraft launcher, but when I started it up, I couldn't log in. Since the log in fields did not require a username, I tried typing in my email, and still couldn't log in. I've tried after resetting my password, but that didn't work either. What am I supposed to do to log in and play?