My friend had an exam but he didn't come because he was sick. Then he needs to pass the exam even he wasn't there. What is the verb or phrase which describes what he needs to do?  ("making-up" the missing works here?)  In addition, in Europe, in some of the universities if you didn't come then you have to pay to the university on the missing class and then you have to go with the receipt to the professor of the missed class and you have to represent the topic that you missed and show him that you studied by yourself, and he asks question about the topic in order to ensure that this student controls in the topic. Is it called "making up" classes or it is something else?
I'm looking for one word which describes what a student who missed classes needs to do in order to complete his missing.   For example if he missed biology class he needs to seat with the teacher and study this missed class together with her and then he get the mark for this missed class. Someone -who isn't native English speaker- told me that it's called "rework". But I looked for it in some dictionaries (such as ) and I didn't find such definition.   : "SCHEDULE of reworks of missed classes"
How do you sort du -sh /dir/* by size? I read one site that said use | sort -n but that's obviously not right. Here's an example that is wrong.  [~]# du -sh /var/* | sort -n 0       /var/mail 1.2M    /var/www 1.8M    /var/tmp 1.9G    /var/named 2.9M    /var/run 4.1G    /var/log 8.0K    /var/account 8.0K    /var/crash 8.0K    /var/cvs 8.0K    /var/games 8.0K    /var/local 8.0K    /var/nis 8.0K    /var/opt 8.0K    /var/preserve 8.0K    /var/racoon 12K     /var/aquota.user 12K     /var/portsentry 16K     /var/ftp 16K     /var/quota.user 20K     /var/yp 24K     /var/db 28K     /var/empty 32K     /var/lock 84K     /var/profiles 224M    /var/netenberg 235M    /var/cpanel 245M    /var/cache 620M    /var/lib 748K    /var/spool "File Open" dialog is missing sidebar items I'm having the strangest issue since updating to OS X El Capitan. My "Open File" dialogs show the sidebar but all my main (and useful) locations are missing. Take a look at this screenshot. This screenshot shows Keychain Access but this happens in Safari when I'm trying to attach a file to Gmail for example, or uploading an image to Facebook.  What I would like is for the sidebar to show my home directories, such as Desktop, Documents, Downloads, etc.  Help? I'm a software developer and as such I build and run programs hundreds of times per day. I've noticed that since I started using Catalina, after compiling and linking there is a delay (which can be seconds) when the internet is slow or having problems (I have bad internet often). If I disable wifi and rebuild, the delay goes away. How can I disable this so my builds run faster? Is there a catchall function somewhere that works well for sanitizing user input for SQL injection and XSS attacks, while still allowing certain types of HTML tags? I've been using Texmaker for ~5 years now and prefer it over other editors because of its flexibility.   Is there a way to auto-indent LaTeX code in TeXmaker so that the code becomes more manageable ? Bernoulli maximum likelihood Suppose $X_1, X_2, \dots, X_n$ are iid Bernoulli(p) random variables. How do you find the restricted maximum likelihood for p where $0&lt;p&lt;0.5$?  My work so far:  Write out the likelihood: $L=p^{\sum x} (1-p)^{n-\sum x}$  Take the log: $\ln(L) = \sum x\ln(p)+(n-\sum x)\ln(1-p)$  Take the derivative and set equal to zero: $\frac{\sum x-np}{p(1-p)}=0$.  Now I'm stuck. I don't know how to incorporate the restrictions for $p$. How do I get permissions to delete files on Windows 7? I updated my laptop's OS from Windows XP to Windows 7. There are some leftover files from Windows XP on the computer now. If I try deleting them I get the following error:     You need permission to perform this action.      You require permission from S-1-.... to make changes to this folder.   What's weird is that I am logged in with the only user account on this machine and I have administrator privileges. I tried turning UAC off, but I still can't delete the files.  How can I force removal of these files? Apparently I inadvertently irked a moderator by creating a tag.  The moderator told me that my tag was "meta" and therefore not appropriate.  Having been a SO user for a long time (and a lurker on MetaSO), it was not clear to me what makes my tag "meta" and why meta tags would be inappropriate.  Many of the questions I see on SO aren't really about the topics in the title or the existing tag list.  For example, , isn't really about C++ or SetWindowText (or the Windows API as tagged).  It's simply somebody who had a bug, couldn't find it, and tried to outsource the debugging.  This seems to be a common category of question on SO.  So I started tagged questions like this with the label "findmybug".  Lots of frequent SO contributors regularly answer questions in this category rather than voting to close them as "Too Localized".  I took that as a cue that I should also try to answer rather than voting to close.  But leaving these questions open and tagged with "c++" and "winapi" even though the question isn't really about C++ or the Windows API seemed misleading.  Someone searching for answers on using SetWindowText from C++ probably isn't making exactly the same mistake and won't find that entry useful.  (In the end, the sample question was closed as "Too Localized", but this doesn't seem common for these types of questions.)  The Tags page says:     A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.   It seems to me that the "findmybug" tag does group these similar questions together.  So from that perspective, it seems to fit.  Lots of users seem to enjoy answering these types of questions, so it makes sense they'd want a way to find them.  If you want to suggest that all the questions I would tag as "findmybug" should be closed as "Too Localized", that's fine.  But I'm trying to ask the more general question:  What makes a tag meta, and are meta tags inappropriate? Why does Lang describe a field as a union and compositum of its subfields in this manner? I am reading Serge Lang's Algebra, revised 3rd edition, and on page 226, the author makes the following definitions and observations:   If $E,F \subset L$, the compositum of $E$ and $F$ in $L$ is defined to be the smallest subfield of $L$ containing both $E$ and $F$. It is denoted $EF$. If $k \subset E$ and $\alpha_1,\dots,\alpha_n \in E$, then $k(\alpha_1,\dots,\alpha_n)$ is defined to be the smallest subfield of $E$ containing $k$ and $\alpha_1,\dots,\alpha_n$. Observe that $$ E = \bigcup k(\alpha_1,\dots,\alpha_n), $$ where the union is taken over all finite families $\{ \alpha_1,\dots,\alpha_n \}$ of elements of $E$. The compositum of an arbitrary family of subfields of a field $L$ is defined as the smallest subfield of $L$ containing all fields in the family. $E$ is finitely generated over $k$ if there is a finite family $\{ \alpha_1,\dots,\alpha_n \}$ of elements of $E$ such that $E = k(\alpha_1,\dots,\alpha_n)$. Observe that $E$ is the compositum of all its finitely generated subfields over $k$.   My question is regarding the two observations (point nos. 3 and 6). It appears to me that it is enough to take union (and compositum) over all subfields generated by a single element. For example for point no. 3, I can write $$ E = \bigcup_{\alpha \in E} k(\alpha) $$ because $E$ is clearly contained in the RHS, and each $k(\alpha)$ is contained in $E$ and hence so is the union, implying that $E$ contains the RHS. Similarly for point no. 6.  So, why does Lang emphasise to take the union and compositum over all finitely generated subfields? Is there some perspective that he wishes to emphasise that I am missing? Any help in understanding this will be appreciated. i m using ubuntu 10.10. please tell me how to type in hindi fonts in open office word. please help This question is from [Number Theory George E. Andrews 1-1 #3].     Prove that $$x^n-y^n=(x-y)(x^{n-1}+x^{n-2}y+\ldots+xy^{n-2}+y^{n-1}).$$   This problem is driving me crazy. $$x^n-y^n = (x-y)(x^{n-1}+x^{n-2}y+\dots +xy^{n-2}+y^{n-1)}$$  $(x^n-y^n)/(x-y) =$ the sum for the first $n$ numbers and then I added $(xy^{(n+1)-2}+y^{(n+1)-1})$ which should equal $(x^{n+1}-y^{n+1})/(x-y)$ but I can't figure it out    This is a similar problem in the book and I tried this method but it wasn't working out      $\quad$Thereom $\bf1$-$\bf2$: $\,\,\,\,$ If $\,x$ is any real number other than $1$, then $$\sum_{j=0}^{n-1}x^j=1+x+x^2+\ldots+x^{n-1}=\dfrac{x^n-1}{x-1}.$$    $\quad$Remark: $\displaystyle\sum_{j=0}^{n-1}A_j$ is shorthand for $A_0+A_1+A_2+\ldots+A_{n-1}.$     $\quad$Proof: Again we proceed by mathematical induction. If $n=1$ then $\displaystyle\sum_{j=0}^{1-1}x^j=x^0=1$ and $(x-1)/(x-1)=1$. Thus the theorem is true for $n=1$.  $\quad$ Assuming that $\displaystyle\sum_{j=0}^{k-1}x^j=(x^k-1)/(x-1)$, we find that $$ \eqalign{ \sum^{(k+1)-1}_ {j=0}x^j &amp; = \sum^{k-1}_ {j=0}x^j+x^k=\dfrac{x^k-1}{x-1}+x^k \\ &amp;= \dfrac{x^k-1+x^{k+1}-x^k}{x-1}\\ &amp;= \dfrac{x^{k+1}-1}{x-1}. }$$   Hence condition $(\rm ii)$ is fulfilled, and we have established the theorem.    $\quad$Corollary $\bf1$-$\bf1$: $\,\,$ If $\,m$ and $n$ are positive integers and if $m&gt;1$, then $n&lt;m^n.$ I am looking for shapefiles or a list of suburb names for Melbourne and Canberra. I have ABS shapefiles, but I need to filter that to end up with only metropolitan suburbs.  My shapefile has codes in it for  - I just need to know which suburbs belong to the metros. Is there a difference between DataTable.Clear and DataTable.Rows.Clear? Why is it necessary to sample from the posterior distribution if we already KNOW the posterior distribution? My understanding is that when using a Bayesian approach to estimate parameter values:   The posterior distribution is the combination of the prior distribution and the likelihood distribution. We simulate this by generating a sample from the posterior distribution (e.g., using a Metropolis-Hasting algorithm to generate values, and accept them if they are above a certain threshold of probability to belong to the posterior distribution). Once we have generated this sample, we use it to approximate the posterior distribution, and things like its mean.   But, I feel like I must be misunderstanding something. It sounds like we have a posterior distribution and then sample from it, and then use that sample as an approximation of the posterior distribution. But if we have the posterior distribution to begin with why do we need to sample from it to approximate it? Define a mathematical set literally as a hyperbole Possible Duplicate:          I have seen a lot of backlash in internet media against people using the word literally to mean something not literal. Something like "he was literally as big as a house" to mean someone was very big I think this comic sums up the anti literal movement well   Is this actually grammatically incorrect or can the word "literally" be a hyperbole strengthening a metaphor? Changed permissions of / to user What are the shell's control and redirection operators? How do I switch between keyboard layouts? I want to switch between English and another language.  I have tried Lubuntu and it was easy, I figured it out from the friendly menus. But in Ubuntu everything is so cryptic. Proving the measure of an increasing sequence of measurable sets is the limit of the measures Show that if $A_1\subseteq A_2\subseteq A_3\subseteq\cdots$ is an increasing sequence of measurable sets (so $A_j\subseteq A_{j+1}$ for every positive integer $j$), then we have $$m\left(\bigcup_{j=1}^\infty A_j\right)=\lim_{j\to\infty}m(A_j)$$  Here is my proof: According to the $\sigma$-algebra property, $\bigcup_{j=1}^{\infty}A_j$ is a measurable set, so it makes sense to talk about $m(\bigcup_{j=1}^{\infty}A_j)$. Firstly, I prove that $\lim_{j\to\infty}m(A_j)\leq m(\bigcup_{j=1}^{\infty}A_j)$. This is because for any given positive integer $N$, $A_N\subseteq \bigcup_{j=1}^{\infty}A_i$, according to monotonicity, we have $m(A_N)\leq m(\bigcup_{j=1}^{\infty}A_i)$. Take the limit,we will have $\lim_{j\to\infty}m(A_j)\leq m(\bigcup_{j=1}^{\infty}A_j)$. Secondly, I prove that $m(\bigcup_{j=1}^{\infty}A_j)\leq \lim_{j\to\infty}m(A_j)$. For any given positive integer $N$, $\bigcup_{j=1}^N A_j = A_N$. According to monotonicity,we have $m\left(\bigcup_{j=1}^N A_j\right)=m(A_N)\leq \lim_{j\to\infty}m(A_j)$. Take the limit, we will have $m\left(\bigcup_{j=1}^\infty A_j\right) \leq \lim_{j\to\infty} m(A_j)$. Combine the above two arguments, we will see that $$m\left(\bigcup_{j=1}^\infty A_j\right)=\lim_{j\to\infty} m(A_j)$$$\Box$  The above is my proof, unlike many books, my proof does not use the property of countable additivity. So I doubt my proof is correct. Who can point out where are my mistakes?