ubuntu 20.04 can't install PacketTracert 7.3
Unable to install Cisco Packet Tracer 7.3 on Ubuntu 20.04
How does end-of-year interact with mutual fund prices (if it does)? Should I expect prices of mutual fund shares to go up in anticipation of dividends, down after dividends have paid out ... or just trust that the market has already reacted to that and the price is basically fair throughout the period?  (I've generally been paranoid and tended not to play with my funds around this time of year, but that may be pure superstition.)  Clarifications: USA, open-ended index funds are my immediate interest, but the answers would be most general if we could cover some of the other varieties (and, if folks are so inclined, locations). mysterious error: \pdfendlink ended up in different nesting level than \pdfstartlink I ran into the "mysterious"  \pdfendlink ended up in different nesting level than \pdfstartlink   error.  According to , "this happens when hyperref is used under pdftex and a citation splits across a page boundary".  The given solution is to manual fix the citation to not split across the page boundary.  However, this workaround isn't feasible for me, as the documents are automatically generated on a server with no user interaction.  Is there any solution to the problem known, perhaps an experimental hyperref action or a patch to pdftex?  (Probably, one could use luatex to solve the problem, but for other reasons, luatex is not an option in this project.)  MWE:  \documentclass[%draft               ]{article} \usepackage{hyperref} \setlength{\textwidth}{3cm} \setlength{\textheight}{3cm}  \begin{document} Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna \href{http://www.tug.org/errors}{aliquyam erat, sed diam voluptua.} \end{document} Graph with Cycle and Two-Colorable i think if the graph G has an odd cycle, it's not two-colorable, otherwise it can be two colorable.   i read in one notes that the following is True: we couldent two-colorable any graph G that has cycle.    anyone could clarify me ? Checking for null before event dispatching... thread safe? Generate uniformly distributed weights that sum to unity? It is common to use weights in applications like mixture modeling and to linearly combine basis functions. Weights $w_i$ must often obey $w_i ≥$ 0 and $\sum_{i} w_i=1$. I'd like to randomly choose a weight vector $\mathbf{w} = (w_1, w_2, …)$ from a uniform distribution of such vectors.  It may be tempting to use $w_i = \frac{\omega_i}{\sum_{j} \omega_j}$ where $\omega_i \sim$ U(0, 1), however as discussed in the comments below, the distribution of $\mathbf{w}$ is not uniform.  However, given the constraint $\sum_{i} w_i=1$, it seems that the underlying dimensionality of the problem is $n-1$, and that it should be possible to choose a $\mathbf{w}$ by choosing $n-1$ parameters according to some distribution and then computing the corresponding $\mathbf{w}$ from those parameters (because once $n-1$ of the weights are specified, the remaining weight is fully determined).  The problem appears to be similar to the  (but, rather than picking 3-vectors whose $ℓ_2$ norm is unity, I want to pick $n$-vectors whose $ℓ_1$ norm is unity).  Thanks! How to perform a full system dump/backup with a broken screen? So, yesterday my phone took a serious tumble.  It is now essentially useless, as the screen either fails to turn on, or when it does, there is nothing useful to see (just lines of primary colors, mostly).  I believe (from the fact that it still chirps at me when emails come in, etc), that the phone is still functional, otherwise.  I would like to perform a full system dump, so that I can get off any files from the phone (a TMobile SGS2 (hercules) running slimrom 4.3 build 1).  The sdcard probably isn't important, as I can just pull it, but the phone's own internal storage I should like to get a copy of.  When I plug the phone into a usb port, it 'mounts' the usb via MTP, and I can see all the files.  Unfortunately, when I do a select all | copy | paste operation, the paste op dies before transferring all files.  I've tried a couple other ADB shell operations, in hope of flipping regular USB mounting on, but nothing has worked.  Any ideas how I can get a full dump of my poor phone's contents?  Edit  Currently running a adb pull /sdcard/ ... Its copying files presently, but its too early to tell if its going to get evertying I'm expecting.  Edit #2  looks like its going to work...its taking a rather long time, but it appears to be grabbing everything I was expecting it to. How do you differentiate the likelihood function for the uniform distribution in finding the M.L.E.? There is a classic problem:  Suppose that $X_1,\ldots,X_n$ form an i.i.d. sample from a uniform distribution on the interval $(0,\theta)$, where $\theta&gt;0$ is unknown. I would like to find the MLE of $\theta$.  The pdf of each observation will have the form: $$ f(x\mid\theta) =  \begin{cases} 1/\theta\quad&amp;\text{for }\, 0\leq x\leq \theta\\ 0 &amp;\text{otherwise}. \end{cases} $$ The likelihood function therefore has the form: $$ L(\theta) = \begin{cases} 1/\theta^n \quad&amp;\text{for }\; 0\leq x_i \leq \theta\;\; \text{for all }i,\\ 0 &amp;\text{otherwise}. \end{cases} $$ The general solution is usually that the MLE of theta must be a value of $\theta$ for which $\theta \geq x_i$ and which maximizes $1/\theta^n$ among all such values.   The reasoning is that since $1/\theta^n$ is a decreasing function of $\theta$, the estimate will be the smallest possible value of $\theta$ such that $\theta\geq x_i$.  Therefore, the mle of $\theta$, $\hat{\theta}$, is $\max(X_1,\ldots,X_n)$.  Here, I do not understand why we cannot just differentiate the likelihood function with respect to theta and then set it equal to $0$?  Thanks! The pdf of $\frac{X_1-\bar{X}}{S}$ Suppose $X_1, X_2,...,X_n$ be i.i.d from $N(\mu,\sigma^2)$ with unknown $\mu \in \mathcal R$ and $\sigma^2&gt;0$  Let $Z=\frac{X_1-\bar{X}}{S},$ S is the standard deviation here.  It is can be shown that  $Z$ has the Lebesgue p.d.f.  $$f(z)=\frac{\sqrt{n} \Gamma\left(\frac{n-1}{2}\right)}{\sqrt{\pi}(n-1)\Gamma\left(\frac{n-2}{2}\right)}\left[1-\frac{nz^2}{(n-1)^2}\right]^{n/2-2}I_{(0,(n-1)/\sqrt{n})}(|Z|)$$  My question is then how to get this pdf?  The question is from  in example 3.3.4  to find the UMVUE of $P(X_1 \le c)$. I can understand the logic and procedures to find the UMVUE but don't know how to get the pdf.  I think this question also relate to this    Thank you very much for help or point to any related references will be also appropriated. Find   $$\lim _{x\to \infty }x\Big(\ln\left(x+1\right)-\ln x\Big)$$  Here's how I do it:  $$x\Big(\ln(x+1)-\ln x\Big) = x\Bigg(\ln(x(1+\frac{1}{x}) - \ln x\Bigg)$$ $$x\Big(\ln x + \ln(1+\frac{1}{x}\Big)-\ln x =x\ln\Big(1+\frac{1}{x}\Big)$$ $$\ln\Bigg( \Big(1+\frac{1}{x}\Big)^x \Bigg) \rightarrow \ln 1^\infty = 0$$  What am I doing wrong? The answer is supposed to be $1$, but I get $0$. What's the easiest way to figure out if a window is opened modally or not?  CLARIFICATION:  I open a window calling   myWindow.ShowDialog();   I have a footer with an "OK" &amp; "Cancel" button that I only want to show if the window is opened modally. Now I realize I can set a property by doing this:  myWindow.IsModal = true; myWindow.ShowDialog();   But I want the window itself to make that determination. I want to check in the Loaded event of the window whether or not it is modal.  UPDATE  The IsModal property doesn't actually exist in a WPF window. It's a property that I have created. ShowDialog() blocks the current thread.   I'm guessing I can determine if the Window is opened via ShowDialog() by checking if the current thread is blocked. How would I go about doing that? I made a map with annotations in QGIS 3.0.  This is how it looks like in the layout view:    If I print the map as PDF, one would expect to get the PDF to be WYSIWYG, right? However, it looks like this (it's about half the size):    Is there a way to influence the the scaling of the Annoations? I already tried to play with the Scale and Magnifier in the map view. I also tried to change the Scale in the map item.   The strange thing is, I believe it worked a few days ago. But today I installed QGIS 3.0 on a new PC and it showed the same behaviour... Plotting Complex Quantity Functions I believe it is what the Germans call "". English itself has no such equivalent word. (Although it has been adopted as a .)  Does an idiom exist that describes it? I have a small Problem that occurs from time to time.   Sometimes, when I copy things or when I put an object from the symbol library on my page, the whole file gets messed up. The screenshot shows it. I make the graphic on the right, Illustrator the ones on the left.   I have pixel snapping checked. Is there a way to tell Illustrator to align everything to pixels no matter what? How do I catch a PHP fatal (`E_ERROR`) error? I can use set_error_handler() to catch most PHP errors, but it doesn't work for fatal (E_ERROR) errors, such as calling a function that doesn't exist. Is there another way to catch these errors?  I am trying to call mail() for all errors and am running PHP 5.2.3. When and why should I use % !TEX TS-program and % !TEX encoding? Set of discontinuity of monotone function is countable The result I am trying to prove is the following:     Let $F:\Bbb R\to\Bbb R$ be increasing. Then the set of points, at which it is discontinuous, is countable.   I have been reading this form Folland's Real Analysis and he proves this by considering the sum $\sum_{|x|&lt;N}[F(x^+)-F(x^-)]$ which has to be finite by some sort of telescoping sum. Now, I am not sure how he defines this sum. I am assuming he does this by using nets (let me know if there is another way to look at this), but he doesn't introduce the concept of nets until the next chapter. So I was looking for some other ways to prove this result and I found the following result (from Stein-Shakarchi) which is quite similar but assumes $F$ to be bounded.      A bounded increasing function $F$ on $[a,b]$ has at most countably many discontinuities.   This is shown by using the density of rationals in $\Bbb R$, i.e. $\exists r_x\in\Bbb Q$ s. t. $F(x^-)&lt;r_x&lt;F(x^+)$ corresponding to each point of discontinuity $x$.   Now I feel like there shouldn't be a problem in doing the exact same thing for unbounded increasing function. Is this right? Secondly how does this proof relate to the first one? I feel like there isn't much of a difference between the two proofs. To be precise I think that the previous sum is well defined/finite because of this countability of discontinuous points. What do you think about this way of thinking?  Edit. Here is the Folland's proof in more detail:  Since $F$ is increasing, the intervals $(F(x^-),F(x^+))$ are disjoint for all $\forall x\in\Bbb R$. Moreover,  $\forall|x| &lt; N$ such intervals are contained in $(F(-N),F(N^+))$ and so  $$\sum_{|x|&lt;N}[F(x^+)-F(x^-)] \leqslant F(N) - F(-N) &lt; \infty. $$ Hence the set $\{ x \in (-N,N) : F(x^+) \neq F(x^-)\}$ is countable. Is rejecting the hypothesis using p-value equivalent to hypothesis not belonging to the confidence interval? While formally deriving the confidence interval of an estimate, I ended up with a formula that resembles very closely the way $p$-value is computed.  Thus the question: are they formally equivalent? I.e. is rejecting an hypotheses $H_0 = 0$ with a critical value $\alpha$ equivalent to $0$ not belonging to the confidence interval with critical value $\alpha$? File names for JSP include directive to avoid compilation of them Why is Python running my module when I import it, and how do I stop it?