I'm very new to Ubuntu again, I haven't touched it since Desktop 13, and I will need some hand-holding here. I can't connect to a network. I've been frustrated trying to find a solution to here and I've mashed more code through terminal than I'd like to admit. Would anyone be willing to help me solve this? I will do my best to answer any questions I can.
I'm having serious problems installing the Broadcom drivers for Ubuntu. It worked perfectly on my previous version, but now, it is impossible.   What are the steps to install Broadcom wireless drivers for a BCM43xx card?  I'm a user with no advance knowledge in Linux, so I would need clear explanations on how to make, compile, etc.    lspci -vnn | grep Network showed:   Broadcom Corporation BCM4322 802.11a/b/g/n Wireless LAN Controller [14e4:432b]      iwconfig showed:  lo        no wireless extensions. eth0      no wireless extensions.   NOTE: Answer below is updated every time new information is added and confirmed working.
How do I avoid the "S to Skip" message on boot? After upgrading my laptop from karmic to lucid, my fat32 partition won't mount automatically. I get the message:  The disk drive for /osshare is not ready yet or not present Continue to wait; or Press S to skip mounting or M for manual recovery   Funny thing is, if I skip, then /osshare/ is mounted once I log in.   I've a similar setup on my desktop, and it works fine. Fstab on desktop:  UUID=4663-6853  /osshare        vfat    utf8,umask=007,gid=46 0       1   /etc/fstab on laptop:  UUID=1234-5678 /osshare vfat utf8,auto,rw,user 0 0 Transpose/Unzip Function (inverse of zip)? I have a list of 2-item tuples and I'd like to convert them to 2 lists where the first contains the first item in each tuple and the second list holds the second item.  For example:  original = [('a', 1), ('b', 2), ('c', 3), ('d', 4)] # and I want to become... result = (['a', 'b', 'c', 'd'], [1, 2, 3, 4])   Is there a builtin function that does that? How to make a water vortex When is the order of convergence of Newton-Raphson greater than 2? If some function $f$ has a simple root at $x_*$ then I know that the order of convergence of the Newton-Raphson iteration is at least 2. But when is this order strictly greater than 2? Repeated ANOVA unbalanced data I did experiment on one group of rats, the group was tested during 8 days, this is the first stage. The same group was also tested again but this time the test phase was 7 days. I tried to do my analysis using ANOVA repeated measures but I had a problem with the days.. I want to know the difference in the 2 tests but the days are not the same number. I don't know how to handle it. If there is any way to do the analysis using repeated measures ANOVA.   I tried to use repeated measure anova within subjects effect. My first factor will be test with 2 levels (test 1 &amp; 2),second factor is day with the level of ?? Here is the problem! if I write 8 there will be extra day in test 2 and the analysis cant carry!! Is there a way to take a screenshot of an Android device and save it as an image file? I'm looking for a story that was probably written somewhere from the 1940s to the 1960s. I think I read it in an anthology, possibly in the 1970s.  A group of human explorers landed on a planet with primitive aliens, living in hunter-gatherer villages. They hoped to make a profit from trading our goods for—well, I'm not clear on what they wanted from the aliens.  The native people learned the human language before the explorers could learn theirs. Then the natives suddenly started producing technological innovations far beyond what they originally used. I remember that wooden sailing ships suddenly replaced their canoes. All the natives had to do was hear a story once from the explorers before copying the technology in the story.  Finally, the explorers realized that the natives were much, much smarter than us and that Earth faced a serious problem.  I'm fairly certain that it wasn't a Heinlein story, but I remember that it had some qualities similar to his work. Multiplicative inverse in $\operatorname{GF}(2^8)$? I know how to do multiplication over ${\rm GF}(2^8)$:  uint8_t  gmul(uint8_t  a, uint8_t  b) {     uint8_t p=0;     uint8_t carry;     int i;     for(i=0;i&lt;8;i++)     {         if(b &amp; 1)             p ^=a;         carry = a &amp; 0x80;         a = a&lt;&lt;1;         if(carry)             a^=0x1b;         b = b&gt;&gt;1;     }     return p; }   So, I tried to create a ${\rm GF}(2^8)$ multiplication table using this code. I've given below the values in the 3rd row of the table, but I don't think they're correct:      0  1  2  3  4  5  6  7   8  9  A  B  C  D  E  F 0 1 2   0  2  4  6  8  A  C  E  10 12 14 16 18 1A 1C 1E  3 . . E F   I don't know what went wrong. I built the table by multiplying the values in the first row with those in the first column.  E.g. in the third row, I multiplied 2 &times; 0, 2 &times; 1, &hellip;, 2 &times; E, 2 &times; F.  How can I create a multiplication table for arithmetic in ${\rm GF}(2^8)$?    Also, how can I find the multiplicative inverse of a number in ${\rm GF}(2^8)$?  For example, how can I determine that the inverse of 95 is 8A?  I tried to do this using the multiplication table above, but when I took 9th row and the 5th column in the multiplication table I got 2D, not 8A. Can I visit other Schengen countries on a long-term Schengen visa or residency permit? How to search by key=>value in a multidimensional array in PHP Skins that cannot be in mystery gifts? Yesterday I had a discussion with some of my friends while playing league. It was about the contents of the mystery gifts and while I said there are restrictions, they were convinced that you can get absolutely every skin from a gift (including victorious, and really old ones).  Now while I'm pretty sure that there are restrictions (Triumphant ryze for example), I'm not really sure on which skins they affect.   What about the victorious, riot, legacy, pax and completely removed skins (Rusty BC, Black Ali, Urf WW)? Can you get those with a mistery gift or is it impossible to get those right now? Bottom to top explanation of the Mahalanobis distance? I'm studying pattern recognition and statistics and almost every book I open on the subject I bump into the concept of Mahalanobis distance. The books give sort of intuitive explanations, but still not good enough ones for me to actually really understand what is going on. If someone would ask me "What is the Mahalanobis distance?" I could only answer: "It's this nice thing, which measures distance of some kind" :)   The definitions usually also contain eigenvectors and eigenvalues, which I have a little trouble connecting to the Mahalanobis distance. I understand the definition of eigenvectors and eigenvalues, but how are they related to the Mahalanobis distance? Does it have something to do with changing the base in Linear Algebra etc.?  I have also read these former questions on the subject:       I have also read .  The answers are good and pictures nice, but still I don't really get it...I have an idea but it's still in the dark. Can someone give a "How would you explain it to your grandma"-explanation so that I could finally wrap this up and never again wonder what the heck is a Mahalanobis distance? :) Where does it come from, what, why?   UPDATE:   Here is something which helps understanding the Mahalanobis formula: Is a join optimized to a where clause at runtime? Is it possible to conditionally format a cell if the cell contains formula (to alert myself and other users when updating the cell)? what operation repeated $n$ times results in the addition operator? How are Python's Built In Dictionaries Implemented? Does anyone know how the built in dictionary type for python is implemented?  My understanding is that it is some sort of hash table, but I haven't been able to find any sort of definitive answer. Is the orbit in Schwarzshild metric a path with maximal proper time? In curved spacetime particles follow timelike geodesics, which should have maximal proper time (at least locally). I thought this path usually corresponds to a global maximum, and there are only strange exceptions. Propably I was wrong, or I really don't understand something, because it doesn't seem to be true for the case of orbitals in Schwarzschild geometry.  The Schwarzschild metric is (with +--- signature)  $$ g_{\mu\nu} = \textrm{diag}\left(1-\frac{2GM}{r},-\left(1-\frac{2GM}{r}\right)^{-1},-r^2,-r^2\sin^2\theta\right) $$  An observer with fixed $r,\theta,\phi$ coordinates will age according to $d\tau_1 = \sqrt{g_{tt}}dt$. An observer, which orbits the center at the same constant radius with $\theta=\pi/2$ will age according to $d\tau_2 = \sqrt{g_{tt}-\omega^2r^2\sin^2\theta}dt$, so he ages slower during the same amount of coordinate time $dt$. If the two observers start from the same point, they will meet again after a full rotation of the orbiting observer, and the orbiting observer will age less. What I don't understand is that the orbit is the geodesic (if the angular velocity is set properly), so why didn't he age more? He should have been on the path with maximal proper time. Upper bound on $\chi(G)$ for a triangle-free graph I'm struggling with the following question;     For every graph $G$ such that $K_3 \not\subseteq G$ (i.e. $G$ does not contain a triangle), prove that $\chi(G) \leq 2\sqrt{n} +1$ (where $\chi(G)$ denotes the chromatic number).   Any hints? I really cannot see the connection between the triangle-free nature of $G$ and a chromatic number being bounded above by $O(\sqrt{n})$. How and when does the tracking of shared links work? Has any Dark Force user/ally ever said "May the Force be with you"?