Just started using Linux Ubuntu 14.04 and when i try to boot it, it gives me this error message. After error message it boots successfully.   The point is, i had this "ath9k.conf" file in directory but i deleted it. Thought that its going to stop giving this error (beginner, sorry), but its not. The error is still here.  I created this ath9k.conf file few days ago because my notebook have a wifi button problem so i found solution to create it and add few lines in it. It didn't help and i forgot to delete it. I successfully fixed that problem by binding my WiFi toggle to another key (instead of Fn+F2, just on F2) because almost every Asus notebook has that problem.  What should i do? That error is just annoying.    If you need more information, let me know.  I'm running Asus X552V.
Alright Ubuntu wizards, I jacked up my system a bit unnecessarily, which is now giving me the chance to learn more about how to fix it...a vicious cycle. Anyway, I have it mostly up and running again to my liking, though I am receiving this (photo attached) prompt when my system boots:  libkmod: ERROR ../libkmod/libkmod-config.c:686 kmod_config_parse: /etc/modprobe.d/blacklist.conf line 56: ignoring bad line starting with 'rt2800usb'   Other users had success with just deleting the bad line from their blacklist.conf file, which I have done. Line 56 no longer exists, but I'm still receiving the same error. So am I missing something? Is there some follow-up command I need to give Ubuntu after saving the conf file?
If $X$ is a Banach space, and $T:X \to X$ is a bounded linear operator with norm &lt; $1$, then $I-T$ has a bounded inverse defined by $(I-T)^{-1} = \sum_{n=0}^\infty T^n$.   Thinking in terms of a converse, if $T$ is any bounded linear operator defined on $X$, then does the existence of a bounded inverse $S=(I-T)^{-1}$ imply that $S$ can be represented as $S=\sum_{n=0}^\infty T^n$? Given a $10×10$ grid with $9$ red blocks and $91$ white blocks, in each step we color one red block black and after that one white block red until there are $91$ black blocks and $9$ red blocks. Prove that there exits a step in which a black block shares an edge with a white block. I ran a few trials and couldn't get past the fifth step without adjacency. But I don't know how to build a proof. I've been trying to wrap my head around the basic concepts of category theory, and I thought I would attempt to illustrate what I understand with the category of sets, probably the easiest example. Particularly, I've been trying to prove that $id_A$ (the identity morphism on $A$, for all $A \in Obj(\mathbf{Set})$) is $1_A \colon A \rightarrow A, x \mapsto x$.  This is a very intuitive and reasonable statement, and it's trivial to prove that $1_A$ is indeed an identity morphism on $A$, and I suppose uniqueness of $id_A$ can be demonstrated analogously to uniqueness of the identity element in a monoid (considering the subcategory which has $A$ as its only object, and endofunctions on $A$ as its only morphisms).  In this manner, it is not hard to prove that the proposition in the title is true, but this demonstration requires to make an assumption or guess as to what could $id_A$ be. Specifically, the scheme of the proof is: assume $id_A$ = $1_A$, see that it works with the definition of an identity morphism, show that the identity morphism is unique, and, in conclusion, $id_A$ can only be $1_A$. What I'm looking for, nonetheless, is a somehow more direct proof, that doesn't assume $id_A$ = $1_A$ at the start. I want to place myself in a state of little or no knowledge about sets and functions, and under this assumption, why would I assume $id_A$ = $1_A$ at first? Why not try with $id_\mathbb{Z}$ = $f \colon \mathbb{Z} \to \mathbb{Z}, x \mapsto x^2 + 1$, for example? It wouldn't work, but I don't have any reason to think that $1_\mathbb{Z}$ is a better guess for $id_\mathbb{Z}$.  I suppose that the proof for which I'm asking would work for categories of sets with additional structure, and probably for posets as well, although I'm not clear as to what modifications it would require to work.  Thanks. Fit mixture of distributions to your time-series data in R I have time-series data containing 1440 observations and the plot of the data is   I want to fit the Gaussian Mixture Models (GMM) to the above plot, and for the same I am using Mclust function of  package. Finally, I want a fit somewhat like this:   On using Mclust function, I do get following statistics     mclus_data &lt;- Mclust(givendataseries)    &gt; summary(mclus_data) ---------------------------------------------------- Gaussian finite mixture model fitted by EM algorithm  ----------------------------------------------------  Mclust E (univariate, equal variance) model with 8 components:   log.likelihood    n df      BIC      ICL        9525.438 1440 16 18934.52 18183.67  Clustering table:    1    2    3    4    5    6    7    8  1262    0    0    0    0   13  114   51    In the above statistic, I can not understand following:   Significance of log.likelihood, BIC and ICL. I can understand what each of them is, but what their magnitude/value refers to? It shows there are 8 clusters, but why cluster no. 2,3,4,5 has 0 values? What does this mean? From the plot it is clear that there must be two Guassians, but why Mclust function shows there are 8 Guassians?   Update: Actually, I want to do model based clustering of time series data. But currently  I want to fit the distribution to my raw data, as shown in Figure 1 on page no. 3 of  paper. For your quick reference, mentioned figure in said paper is Mirror changes to side of cube across all six sides In PHP 5, what is the difference between using self and $this?  When is each appropriate? I know that Wubi is slower in disk IO, but I can't find anything about it online other than vague statements such as "slightly slower disk seeks".  Has anyone done any benchmarks to quantify the speed difference? find exclude directory How to send AT commands to modem once the connection is established? I have a zte 3g modem. I use carrier provided dialer for connection establishment. Once the ppp connection is active, i would like to send some AT commands(for ex. Query signal strength, AT+CSQ). But the dialer i use locks the /dev/ttyUSB0 port, which is the command port to send AT commands for my modem. So is there any way, to send the commands, once the connection is active?    Edit: I also tried the additional port /dev/ttyUSB1. But the port is flowing with random data from the modem. A sample is given below.  T^PREFMODE??                                                                     ^PREFMODE:8                                                                       OK                                                                               TC                                                                               ^DSDORMANT:1                                                                      +CSQ:19, 99                                                                       OK                                                                               T^SYSINFO                                                                        ^SYSINFO:2,3,0,4,255                                                              OK                                                                               TT^SYSINFO?                                                                      ^SYSINFO:2,3,0,4,255     I tried adding my commands, i even got output. But the response is very poor. Most of the times, my AT commands went unnoticed. MAXDOP not working? I wanted to test out MAXDOP on my computer. So I set MAXDOP to 2 for a specific query. However, when I looked at my logical processors in Task Manager as I ran the query, it looked like they were all being used. I thought that it would only be using 2 logical processors if MAXDOP was set to 2? Does anyone know what is happening? Please see image below.  Another issue is, the DOP returned by the execution plan said 1. Now I know that setting MAXDOP does not mean SQL Server will actually use the number set. However, given that it seemed all my 4 logical processors were being used to process the query, it made it even more strange to see DOP 1.  This is the query I ran:   This was what happened as I ran it (i.e. it looks like all 4 logical processors are being used to run the query): Can a continuous real function take each value exactly 3 times? WI-FI Nic showing 3 different transport id {Device id} There was a problem with my network controller so i opened up cmd and started to check for interfaces. I noticed a strange thing that my Wifi network controller had 3 different Device ID (Transport id's) When i tried to disable the wifi card the different id's went away. On my other computer i tested the same thing and it only shows 1 id? Device\NPF_{4A45A363-6346-48DA-8D28-13DD9C9C1E6A} Device\NPF_{E6994972-C66C-4ABF-BE27-17BAC7C1C971} Device\NPF_{B6394772-H66C-4ABF-HRE27-17JLC0H9C971} I am using snort to check for available interfaces. Can anybody explain why i am seeing this? WLC model: intel dual band wireless-ac 8265 running default settings on the adapter however i have hyper-v open How to convert PDF to (La)TeX? I know that hardly any information is passed to the PDF when a .tex file is compiled.  But is there a tool that can convert a PDF document back to (La)TeX? Should we have a subjective version of every Stack Exchange site? I am looking for a correct proof of this statement: If $G$ is a group such that $G/Z(G)$ is cyclic, then $G$ is commutative.  Proof: $G/Z(G)$ is isomorphic to $\operatorname{Inn}(G)$ and is cyclic, and then for every $a$ and $b$ in $G$ the inner isomorphisms $\gamma_a$ and $\gamma_b$ satisfy $\gamma_a \gamma_b = \gamma_{ab} = \gamma_{ba} = \gamma_b \gamma_a$, and therefore for every $a,b \in G$, $ab = ba$.  Is that proof complete, or am I missing something? Thanks a lot for the help. Cards entering the battlefield simultaneously and "Enter the Battlefield" effects Difference between int[] array and int array[] I have recently been thinking about the difference between the two ways of defining an array:   int[] array int array[]   Is there a difference? Four balls with different colors in a box, how many times do I need to pick to see all four colors? Alternative Method to Acquire El Capitan Upgrade Let $A$ be a square matrix of order $n$ such that $A^2 = I$.  Prove that if $1$ is the only eigenvalue of $A$, then $A = I$. Prove that $A$ is diagonalizable.   For  (1), I know that there are two eigenvalues which are $1$ and $-1$, how do I go about proving what the question asks me?