I have a problem with the \label command, it is supposed only to label your section without appearing withing the text. and in my case I want to label a section but it appears right after the section like in the picture. Is there any package to make it disapear ?  Thanks for your help Omer
I've got a problem using \label and \ref in Texmaker 3.1 (MiKTeX 2.9). When I put label somewhere, i got a frame with label name in it. How can I hide it?  \begin{figure}[h] \includegraphics[width=0.75\textwidth]{img/2}\caption{SomeCaption} \label{fig:4eb1} \end{figure} $\frac{w}{w_1}-1=4$ $4\leqslant n\leqslant3$, using (pic. \ref{fig:4eb1}),blah-blah.   PS: Sorry for my awesome English. :)
Regression Proof that the point of averages (x,y) lies on the estimated regression line How do you show that the point of averages (x,y) lies on the estimated regression line? I want to calculate the posterior distribution given a gamma-prior and a poisson likelihood. The task is from a textbook and I just have the solutions (without a walkthrough). Please find all given information in the following:  Given information:  $m$ countries each with a population of $n_i$; $y_i$ is the number of people having a disease; $y_i$ is a poisson random variable with mean $\frac{n_i*\lambda}{100}$  The prior distribution for $\lambda$: $\lambda \sim Gamma(a_0,b_0)$  Task:  Show that the posterior distribution is also a gamma distribution with $a_m = a_0 + \sum_{i = 1}^{m}y_i$ and $b_m = b_0 + \sum_{i = 1}^{m} \frac{n_i}{100}$  My solution:  $Posterior \propto Likelihood \times Prior$  $p(\theta|y) \propto \prod_{i=1}^{m}(\theta^{y_i}e^{-\theta})\times \theta^{a_0-1}e^{-b_0\theta}$  $p(\theta|y) \propto \theta^{\sum_{i = 1}^{m}y_i}e^{-m\theta}\times \theta^{a_0-1}e^{-b_0\theta}$  $p(\theta|y) \propto \theta^{\sum_{i = 1}^{m}y_i+a_0-1}e^{-\theta(m+b_0)}$  $a_m = a_0 + \sum_{i = 1}^{m}y_i$  $b_m = b_0 + m \neq b_0 + \sum_{i = 1}^{m} \frac{n_i}{100}$  I think I am doing a mistake, because I don't know how to incorporate the information that the mean of $y_i$ is given as $\frac{n_i*\lambda}{100}$. Or do I just have to transform $b_m$ somehow? Can someone may give me a hint?   Thank you already in advance!  Edit 1: Considering first advices  $Likelihood: p(y | \theta) \propto \prod_{i=1}^{m}(\frac{n_i\lambda}{100})^{y_i}e^{-\frac{n_i\lambda}{100}}$  $\propto \prod_{i = 1}^{m} ((\frac{n_i}{100})^{y_i})\lambda^{\sum_{i=1}^{m}y_i}e^{-\lambda\sum_{i=1}^{m}\frac{n_i}{100}}$  $\propto \lambda^{\sum_{i=1}^{m}y_i}e^{-\lambda\sum_{i=1}^{m}\frac{n_i}{100}}$  Is the transformation of $\prod_{i=1}^{m}$ I did from the first to the second step correct? Control 220V AC line using MCU How to properly typeset multiletter quantities, e.g. Re or Nu (Reynolds, Nusselt numbers) Storage order vs Result order Whoever or whomever: 'happy for ___ has the pleasure of working with you next.' So sad to lose you, yet happy for whomever has the pleasure of working with you next. Why are the Ringwraiths fearful of coming into contact with water? At least twice in The Lord of the Rings: The Fellowship of the Ring, Ringwraiths cower away from bodies of water.  The second time (the ford of Bruinen) can be explained away by their fear of some Elvish magical trap through the enchantment of the water; but what about the first time, at the ferry? One of the Nazgûl could have easily made the jump onto the barge and quickly dispatched those pesky Hobbitsses. Periodic function implies periodic primitive? If $f$ is a periodic function with $T = \pi$, does that mean that $F$ (a primitive of $f$) has the same period ? What about the inverse implication (periodic primitive implies periodic function) ? How to install and configure Wine? I am looking for a step by step instruction to guide me in the ways of installing, configuring and debugging many of the issues new users have when dealing with Wine in Ubuntu.  What is the recommended way of installing Wine, some of the key issues that it has and how to solve them?  If I have a specific problem with an App in Wine, how do I go about solving it? What are the recommended steps to ensure that I can fix a problem related to an app I wish to use? Using GParted to remove windows partition ConcurrentModificationException Woes Assumptions of linear regression I'm reposting  I asked on the  SE, bacause I have been redirected to Super User.  I have successfully set up two Linksys routers running DD-WRTv24 to do WDS. They have the same SSID, but different static local IP addresses. There is no security: it's just for testing; no Internet connection.   When I open my notebook, I see the SSID shared by the routers in the list of WiFi access points, and I can connect to it. Once connected, I can ping both routers' local IP addresses, so I know that the WDS is working. But I can't find a way to find out which of them I have actually connected to.  I wouldn't like to have different SSIDs, because I plan to have the access points hand-off users to one another, and I want it to be transparent for the users. I configured one AP to distribute DHCP IP addresses in one range, and the other in another range, so I can discover which AP I connected to at first, but I want a way to discover which AP I'm connected to now, so that I can find out whether the hand-off actually occurred. Path.Combine for URLs? is handy, but is there a similar function in the .NET framework for ?  I'm looking for syntax like this:  Url.Combine("http://MyUrl.com/", "/Images/Image.jpg")   which would return:  "http://MyUrl.com/Images/Image.jpg" How to reinstall yum? I made a big mistake: I removed yum. So now when I for example run the following it gives me an error:  $ yum clean all yum command not found.   I can download the package succesfully:  wget mirror.centos.org/centos/6/os/i386/Packages/yum-3.2.29-40.el6.centos.noarch.rpm --2014-01-15 15:42:59--  http://mirror.centos.org/centos/6/os/i386/Packages/yum-3.2.29-40.el6.centos.noarch.rpm Resolving mirror.centos.org... 192.133.139.3 Connecting to mirror.centos.org|192.133.139.3|:80... connected. HTTP request sent, awaiting response... 200 OK Length: 1019540 (996K) [application/x-rpm] Saving to: “yum-3.2.29-40.el6.centos.noarch.rpm.1”  100%[====================================================================================================================&gt;] 1,019,540    649K/s   in 1.5s  2014-01-15 15:43:01 (649 KB/s) - “yum-3.2.29-40.el6.centos.noarch.rpm.1” saved [1019540/1019540]   Trying to install the downloaded package gives the following error:  # rpm -ivh yum-3.2.29-40.el6.centos.noarch.rpm Preparing...                ########################################### [100%]     file /usr/lib/python2.6/site-packages/yum/__init__.py from install of yum-3.2.29-40.el6.centos.noarch conflicts with file from package yum-3.2.29-30.el6.centos.noarch [...] file /usr/share/yum-cli/yummain.pyo from install of yum-3.2.29-40.el6.centos.noarch conflicts with file from package yum-3.2.29-30.el6.centos.noarch   There is no directory "yum" in /usr/bin.  When I use the command "rpm -qa | grep yum".  yum-metadata-parser-1.1.2-16.el6.x86_64 yum-plugin-fastestmirror-1.1.30-14.el6.noarch yum-3.2.29-30.el6.centos.noarch   The distro is CentOS 6.3. How can I reinstall yum? Can't compile any c/ c++ program, linker problem It's my second post here, i have a huge problem which prevents me to study so i have to fix it as soon as it's possible ! My gcc was working fine and i had to work on FairThreads (in C). I downloaded the following archive :  As you can see, in /src there's a makeFile, i replaced the second line which was : LIB_DIR     = ../lib  by LIB_DIR     =  /usr/bin/ld and i compiled the makeFile by the command &quot;make&quot; And now, i cannot compile any c/c++ program anymore. Even a hello world program. I got the following error message on the terminal for every compiling attempt : /usr/bin/ld: 2: /usr/bin/ld: Syntax error: newline unexpected collect2: error: ld returned 2 exit status  I have found on the net this solution but it doesn't work for me : sudo apt-get autoremove binutils     sudo apt-get install binutils  I also tried to reinstall gcc, when executing : sudo apt-get purge gcc   i got : Des erreurs ont été rencontrées pendant l'exécution :   linux-firmware   linux-image-generic-hwe-18.04   linux-generic-hwe-18.04 E: Sub-process /usr/bin/dpkg returned an error code (1)  but when i trie a gcc --version it tells me that it is not found. So when i execute the command to reintall it : sudo apt-get install gcc   i also get : Des erreurs ont été rencontrées pendant l'exécution :  linux-firmware  linux-image-generic-hwe-18.04  linux-generic-hwe-18.04  linux-image-5.4.0-72-generic  initramfs-tools E: Sub-process /usr/bin/dpkg returned an error code (1)  but gcc --version tellls that it's installed. Finally, when i trie to compile a program, i got : /usr/bin/ld: 2: /usr/bin/ld: Syntax error: newline unexpected collect2: error: ld returned 2 exit status  I hope that i explained well, and i'll get a solution for this :/, as a computer science student, i can't do anything without gcc :( EDIT 1 : When i try to remove bin/ld by executing : sudo rm -fr /usr/bin/ld;sudo apt-get install --reinstall binutils  i got : Des erreurs ont été rencontrées pendant l'exécution :  linux-firmware  linux-image-generic-hwe-18.04  linux-generic-hwe-18.04  linux-image-5.4.0-72-generic  initramfs-tools E: Sub-process /usr/bin/dpkg returned an error code (1)  and this particular error message : WARNING: no ldd around - install libc-bin  EDIT : I have installed ldd by the command : sudo apt-get install libc-bin  still no changes... What and how does Darth Vader see? Are there any sources that talk about  about Darth Vader's visual acuity?  His life-supporting armour is quite advanced but does it provide any useful augmentation to his visual abilities? How can I speed up D&D 3.5e combat? Any complete group (that is, with trivial center and outer automorphism group) is isomorphic to its automorphism group. The inverse is not true, as the dihedral group of order 8 is isomorphic to its automorphism group but isn't complete.  Problem 15.29 in the Kourovka Notebook asks to find another exemple of a p-group, but I was wondering, is any other exemple known? Is there any other finite (or even infinite) group (not necessarily a p-group) which is isomorphic to its automorphism group but isn't complete? Cartesian products and families I have some trouble trying to understand Halmos' explanations about generalized Cartesian products. I've read these entries already:    This also has the page I'm stuck on.      Is his generalization the same as a Cartesian product of several sets? As here:   What puzzles me is $\{a,b\}$. Where does it come from, what does it do? I know that it is supposed to be arbitrary. How does it identify distinct elements of $X \times Y$? Does some function map each $a \in A$ to an element in $X$? Or is it always the same $a$?  What does he mean by      the set $Z$ of all families $z$, indexed by $\{a,b\}$, such that $z_a \in X$  and $z_b \in Y$   ? What does does an element of $Z$, namely one family $z$, consist of? By family, does he mean an indexing function or the indexed elements? This comes to a very important question for me: Does family mean a function or the set of all indexed elements?   I will try to explain how I understand it thus far: $Z$ contains elements of the form $\{(a,x),(b,y)\}$. The choice of $x$ depends on $a$, so an $x$ in a $z \in Z$ equals the $z_a$ of $X$. Now, we want to map these pairs to $X \times Y$, so we have a function $f$ that takes $z \in Z$ and connects it to the corresponding ordered pair $(z_a, z_b)$, where $z_a \in X$. $X \times Y$ is not the same as $Z$; they only, effectively, contain equal elements.  He goes on:     If $\{X_i\}$ is a family of sets ($i \in I$), the Cartesian product of the family is, by definition, the set of all families $\{x_i\}$ with $x_i \in X_i$ for each $i$ in $I$.   How I understand it: $\{X_i\}$ contains, as elements, several sets, each single one a set $X$ identified by an index/element of $I$. Then, we go over all indeces $i$ in $I$, take from each set $X$, namely $X_i$, an element $x$ and add it to current set of the newly created sets/families. So, the lower index $i$ does not refer to an element of $X_i$ indexed by $i$, but rather calls all elements of $X_i$ $x_i$. We end up with a set, defined as Cartesian product, of sets, in which each element (set) contains ordered elements, each from a different $X_i$. How does the ordering occur?  $\prod_i X_i$, the Cartesian product, becomes equal to $X^I$, if all $X_i$ are the same set $X$. $X^I$ means all possible combinations of mapping from $I$ to $X$. We randomly take an elements $x$ from some $X_i$, put it in a set/family with other randomly obtained $x$, put the entire set into a set denoted $X^I$, and continue doing so, till we have no more options. Then, each set in the new $X^I$ contains a mapping of some $i$ to some $x$. Since we exhausted the options, they are indeed all combinations.  Where did I go wrong? Someone needs to spoonfeed my the answer; I am completely confused by now.