I recently purchased a Lenovo Thinkpad T440p, where I installed Ubuntu 13.04, with the following networking options:   WiFi card Intel Dual Band Wireless 7260AC with Bluetooth 4.0 3G/HSPA+ built-in module (Ericsson N5321)   When I run ifconfig, I get only eth0 and lo listed.  When I run lspci:  00:00.0 Host bridge: Intel Corporation Haswell DRAM Controller (rev 06) 00:01.0 PCI bridge: Intel Corporation Haswell PCI Express x16 Controller (rev 06) 00:01.1 PCI bridge: Intel Corporation Haswell PCI Express x8 Controller (rev 06) 00:02.0 VGA compatible controller: Intel Corporation Haswell Integrated Graphics Controller (rev 06) 00:03.0 Audio device: Intel Corporation Haswell HD Audio Controller (rev 06) 00:14.0 USB controller: Intel Corporation Lynx Point USB xHCI Host Controller (rev 04) 00:16.0 Communication controller: Intel Corporation Lynx Point MEI Controller #1 (rev 04) 00:16.3 Serial controller: Intel Corporation Lynx Point KT Controller (rev 04) 00:19.0 Ethernet controller: Intel Corporation Ethernet Connection I217-LM (rev 04) 00:1a.0 USB controller: Intel Corporation Lynx Point USB Enhanced Host Controller #2 (rev 04) 00:1b.0 Audio device: Intel Corporation Lynx Point High Definition Audio Controller (rev 04) 00:1c.0 PCI bridge: Intel Corporation Lynx Point PCI Express Root Port #1 (rev d4) 00:1c.1 PCI bridge: Intel Corporation Lynx Point PCI Express Root Port #2 (rev d4) 00:1d.0 USB controller: Intel Corporation Lynx Point USB Enhanced Host Controller #1 (rev 04) 00:1f.0 ISA bridge: Intel Corporation Lynx Point LPC Controller (rev 04) 00:1f.2 SATA controller: Intel Corporation Lynx Point 6-port SATA Controller 1 [AHCI mode] (rev 04) 00:1f.3 SMBus: Intel Corporation Lynx Point SMBus Controller (rev 04) 02:00.0 VGA compatible controller: NVIDIA Corporation GK208M [GeForce GT 730M] (rev a1) 03:00.0 Unassigned class [ff00]: Realtek Semiconductor Co., Ltd. Device 5227 (rev 01) 04:00.0 Network controller: Intel Corporation Device 08b2 (rev 83)   Here is the output of uname -a  Linux flo-ThinkPad-T440p 3.8.0-19-generic #30-Ubuntu SMP Wed May 1 16:35:23 UTC 2013 x86_64 x86_64 x86_64 GNU/Linux   It seems the required firmware is included with Kernel 3.10+ if I understand well what's written at  and my kernel is currently at 3.8 something.  Do I need to find the right backport to actually enable WiFi or is there something easier to do?  Thanks in advance!
I have a Dell XPS 12 running Ubuntu 13.10 and it doesn't appear to find it's wireless.  I have tried the suggestions  but they made no difference  peter@xps:/lib/firmware$ ls -l /lib/firmware/iwlwifi-7260-7.ucode  -rw-r--r-- 1 root root 682892 Aug  4 12:50 /lib/firmware/iwlwifi-7260-7.ucode peter@xps:/lib/firmware$ sudo lshw -c network   *-network UNCLAIMED             description: Network controller        product: Wireless 7260        vendor: Intel Corporation        physical id: 0        bus info: pci@0000:06:00.0        version: 63        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress cap_list        configuration: latency=0        resources: memory:f7c00000-f7c01fff  peter@xps:~/backports-3.10-2$ grep IWL7260_UCODE_API_MAX drivers/net/wireless/iwlwifi/iwl-7000.c  #define IWL7260_UCODE_API_MAX   7     .ucode_api_max = IWL7260_UCODE_API_MAX,         \ peter@xps:~/backports-3.10-2$ dmesg | grep iwl peter@xps:~/backports-3.10-2$ iwconfig lo        no wireless extensions.  peter@xps:~$ find / -name *7260-6* peter@xps:~$ find / -name *7260-7* /lib/firmware/iwlwifi-7260-7.ucode   peter@xps:~$ dmesg | grep -i -A 20 intel [ 1318.013278] Intel(R) Wireless WiFi driver for Linux, in-tree:d [ 1318.013281] Copyright(c) 2003-2013 Intel Corporation [ 1318.015154] cfg80211: World regulatory domain updated: [ 1318.015157] cfg80211:   (start_freq - end_freq @ bandwidth), (max_antenna_gain, max_eirp) [ 1318.015159] cfg80211:   (2402000 KHz - 2472000 KHz @ 40000 KHz), (300 mBi, 2000 mBm) [ 1318.015161] cfg80211:   (2457000 KHz - 2482000 KHz @ 40000 KHz), (300 mBi, 2000 mBm) [ 1318.015162] cfg80211:   (2474000 KHz - 2494000 KHz @ 20000 KHz), (300 mBi, 2000 mBm) [ 1318.015164] cfg80211:   (5170000 KHz - 5250000 KHz @ 40000 KHz), (300 mBi, 2000 mBm) [ 1318.015165] cfg80211:   (5735000 KHz - 5835000 KHz @ 40000 KHz), (300 mBi, 2000 mBm)     What I have found is that it appears to be loading an old version of the firmware but I don't know how or why  peter@xps:/lib/firmware$ modinfo iwlwifi | grep 7260 firmware:       iwlwifi-7260-6.ucode peter@xps:/lib/firmware$ ls *7260-6* ls: cannot access *7260-6*: No such file or directory   Any suggestions of how to get this setup very welcome.
Running Commands on Remote Linux Server Using SSH I am writing a Bash Script wherein I need to run some set of commands on a remote Linux server from my local computer using SSH. I want the results to be displayed on the terminal screen or dump the results in a file on my local system.   How can achieve this? Is the following syntax correct?  \#!/bin/bash . . . .  ssh &lt;user&gt;@&lt;remote_host&gt; 'COMMAND &gt;&gt; /path/to/file ; scp /path/to/file &lt;user&gt;@&lt;local_host&gt;:&lt;location&gt;; exit' . .   Thanks in advance. I have installed the pimd service by means of apt. This comes with an upstream systemd unit file (/lib/systemd/system/pimd.service).  I want the service to be restarted when for some reason it gets killed, hence I wish to add the line Restart = always in the unit file.   However, I don’t want to modify the upstream unit file.  Is there any workaround for this? I want to install the  on my iPhone. On the phone I have iOS 7. When I try to install the App, it tells me it needs at least version 8 of iOS.  I do not want to upgrade my iOS version, especially for the sole purpose of installing an App. However, I do want to use it, it's kind of important.  I searched for a while about how to do this, but I could only find solutions that would work if you installed the App before and it shows up on the "Purchases" page in iTunes or something like that. And this doesn't apply to this case.    How can I install an older version of the App (one that requires "only" iOS 7) without having to upgrade the operating system on my iPhone ? Will grammar errors become correct after enough people use them for enough time? "Questions that may already have your answer" box overlaps onto the footer How does LIGO remove the effects of environmental noise? Since LIGO is dealing with readings at nanometers, events such as vehicles driving nearby, and constant (but extremely minor) tremors of the earth can cause movement with the mirrors at nanometers.  Such tiny movements are extremely difficult to measure, but can easily cause errors when using such a small scale.  How does LIGO remove these factors, and take precautions to prevent false readings due to noise? Why is it that a sequence in a closed, bounded interval [a, b] is a bounded sequence? What is the formal proof of this proposition from the definition of a bounded sequence? Change web folders names with uppercase to lowercase or not? Are there any organised resources available from where I can begin my quantum computing studies? I am a computer science student and am currently searching for resources from where I can learn about quantum computers, quantum computing models, their working principles, their gates and some simple quantum algorithms. I have been working on this exercise for a while now. It's in B.L. van der Waerden's Algebra (Volume I), page $19$. The exercise is as follows:     The order of the symmetric group $S_n$ is $n!=\prod_{1}^{n}\nu$. (Mathematical induction on $n$.)   I don't comprehend how we can logically use induction here. It seems that the first step would be proving $S_1$ has $1!=1$ elements. This is simply justified: There is only one permutation of $1$, the permutation of $1$ to itself.  The next step would be assuming that $S_n$ has order $n!$. Now here is where I get stuck. How do I use this to show that $S_{n+1}$ has order $(n+1)!$?  Here is my attempt: I am thinking this is because all $n!$ permutations of $S_n$ now have a new element to permutate. For example, if we take one single permutation $$ p(1,\dots,n) = \begin{pmatrix} 1 &amp; 2 &amp; 3 &amp; \dots &amp; n\\ 1 &amp; 2 &amp; 3 &amp; \dots &amp; n \end{pmatrix} $$ We now have $n$ modifications of this single permutation by adding the symbol $(n+1)$:  \begin{align} p(1,2,\dots,n,(n+1))&amp;= \begin{pmatrix} 1 &amp; 2 &amp; \dots &amp; n &amp; (n+1)\\ 1 &amp; 2 &amp; \dots &amp; n &amp; (n+1) \end{pmatrix}\\ p(2,1,\dots,n,(n+1))&amp;= \begin{pmatrix} 1 &amp; 2 &amp; \dots &amp; n &amp; (n+1)\\ 2 &amp; 1 &amp; \dots &amp; n &amp; (n+1) \end{pmatrix}\\ \vdots\\ p(n,2,\dots,1,(n+1))&amp;= \begin{pmatrix} 1 &amp; 2 &amp; \dots &amp; n &amp; (n+1)\\ n &amp; 2 &amp; \dots &amp; 1 &amp; (n+1) \end{pmatrix}\\ p((n+1),2,\dots,n,1)&amp;= \begin{pmatrix} 1 &amp; 2 &amp; \dots &amp; n &amp; (n+1)\\ (n+1) &amp; 2 &amp; \dots &amp; n &amp; 1 \end{pmatrix} \end{align}  There are actually $(n+1)$ permutations of that specific form, but we take $p(1,\dots,n)=p(1,\dots,n,(n+1))$ in order to illustrate and prove our original statement. We can make this general equality for all $n!$ permutations: $p(x_1,x_2,\dots,x_n)=p(x_1,x_2,\dots,x_n,x_{n+1})$ where $x_i$ is any symbol of our finite set of $n$ symbols and $x_{n+1}$ is strictly defined as the symbol $(n+1)$.  We can repeat this process for all $n!$ permutations in $S_n$. This gives us $n!n$ permutations. Then, adding in the original $n!$ permutations, we have $n!n+n!=(n+1)n!=(n+1)!$. Consequently, $S_n$ has order $n!$.  How is my reasoning here? Furthermore, is there a more elegant argument? I do not really see my argument here as incorrect, it just seems to lack elegance. My reasoning may well be very incorrect, however. If so, please point it out to me. Since a few months, on one of the desktop Ubuntu 14.04 systems I use, CPU has regularly been going up to 80-100% for no apparent reason. htop would usually attribute responsability to file system processes, such as nemo or ntfs. To get CPU back down I would kill these process, which in some cases would lead to loss of access to the file system and a consequent restart.  Days ago I noticed that whenever this situation happened another process was always present also using high CPU: mediascanner-service-2.0. Some research lead me to  that simply advised its removal. So I did.  The end result has been unexpectedly positive: not only are the high CPU load episodes gone, the system is altogether much faster. The speed up of the Lens is dramatic: finding an application like Calc now takes 2 seconds at most when previously it took some 20 seconds. Finding a file takes now some 5 seconds, whereas before it took in the order of 30 seconds. Heavy programmes like Eclipse are starting up faster and workspaces are more fluid. There seems to be also an overall reduction in the frequency of disk access.  What is exactly this mediascanner2.0 package? Is it part of Unity 7 or a dependency that gets installed a posteriori? Is it possible to prevent its installation?  Update: following  it is possible to track this package down to indicator-session:  $ sudo aptitude why mediascanner2.0 i   indicator-session         Recommends indicator-applet (&gt;= 0.2) | indicator-renderer i A unity8                    Provides   indicator-renderer                             i A unity8                    Recommends unity-scope-mediascanner2                      pi  unity-scope-mediascanner2 Depends    mediascanner2.0                                  Apparently, mediascanner2.0 (and the Unity 8 shell) are part of the base 14.04 system. Left to answer is the exact function of this rogue package. Why can "trans" be replaced with an x? I can't think of an example, so I may be wrong about this, but I think I've seen people replace the prefix "trans" as in transport with an x. "Cross" makes sense, as in "railroad crossing", and I guess "chris" is sort of a punny extension, the extension being like "chris cross" and the example being "xmas", but why trans? $x^p-c$ has no root in a field $F$ if and only if $x^p-c$ is irreducible? Hungerford's book of algebra has exercise $6$ chapter $3$ section $6$ [Probably impossible with the tools at hand.]:     Let $p \in \mathbb{Z}$ be a prime; let $F$ be a field  and let $c \in  F$. Then $x^p - c$ is irreducible in $F[x]$ if and only if $x^p - c$   has no root  in $F$. [Hint: consider two cases: char$(F) = p$ and   char$(F)$ different of $p$.]   I have attempted this a lot. Anyone has an answer? Can a wizard using an arcane focus quarterstaff and a shield still cast somatic component spells? If there is a wizard that, by some means, has acquired proficiency in the use of shields, can said wizard use his shield in one hand and his arcane focus quarterstaff in the other and still cast somatic component spells?  Since the quarterstaff has been crafted to also be an arcane focus, and the Sage Advice Compendium states that you can provide the somatic components of spells with the same hand wielding the arcane focus, in this case an arcane focus quarterstaff, could that wizard still be able to perform somatic component spells while using a shield in the other?  I understand War Caster is the feat that allows you to cast somatic component spells even while using a shield and weapon or two weapons in each hand, but is this a simple way around those rules seeing as this "weapon" is your arcane focus? I would like to believe it is not, but I'm not fully fluent in the ways of spellcasting. Is it ever acceptable to have a  in your C or C++ application?  What if you allocate some memory and use it until the very last line of code in your application (for example, a global object's destructor)? As long as the memory consumption doesn't grow over time, is it OK to trust the OS to free your memory for you when your application terminates (on Windows, Mac, and Linux)? Would you even consider this a real memory leak if the memory was being used continuously until it was freed by the OS.  What if a third party library forced this situation on you? Would refuse to use that third party library no matter how great it otherwise might be?  I only see one practical disadvantage, and that is that these benign leaks will show up with memory leak detection tools as false positives. How can adding an infinite number of rationals yield an irrational number? For example how come $\zeta(2)=\sum_{n=1}^{\infty}n^{-2}=\frac{\pi^2}{6}$. It seems counter intuitive that you can add numbers in $\mathbb{Q}$ and get an irrational number. Why does gulp.src not like being passed an array of complete paths to files? The mediation package in R returns results in which:   Average Direct Effect (ADE) (the unmediated effect) is not statistically significant The Average Causal Mediated Effect (ACME) (the effect of the mediator alone) is positive and statistically significant The Total Effect (ADE+ACME) is larger than the ADE and ACME alone, positive and statistically significant   Does this indicate that the variable being mediated can only act through the mediator DV? I'm not quite certain as to how this would be interpreted.  Thank you for any help. Proving a sequence converges by defining the sequence recursively. Let $a &gt; 0$. Choose $x_1 &gt;$ $\sqrt a$. Define a sequence {$x_n$} recursively as $x_{n+1} = 1/2(x_n + a/x_n)$ for $n &gt; 1$.   Prove that lim$x_n = \sqrt a$.  I think I first want to prove that {$x_n$} is bounded below by $\sqrt a$. But, I am having trouble with this. Could someone help me out a little? I've recently installed Fedora 19.  is installed. But its own examples don't work. When I enter gedti the output is:  bash: gedti: command not found... Similar command is: 'gedit'   And it works correctly but when I enter powertop, the output is:  bash: powertop: command not found...   With no suggestion about the package. Why? Should I edit some configuration files or update some cache or ... ?