I just installed Ubuntu 14.04 LTS on my LENOVO IdeaPad U430 Touch. How come the battery just charges up to 59%? I also have Win8 on another partion and it easily reaches 100%.  I tried "" but nothing changed. I've read some complaints from people who have a similar problem but they all have ThinkPads and there's a special modul for "TLP" where you can control the charging threshold.  What to do?
On my y510p, I set Lenovos battery software to "Optimize battery health" while I was in Windows 8.1. I forgot to change it before overwriting that partition with Ubuntu, and now my battery in Ubuntu never charges past 59~60%. I think this is due to something in the BIOS because it persists despite my Windows partition being gone.   I've searched the BIOS but there's no mention of battery anywhere!  I'm using Ubuntu 14.04 LTS.
Attacks of the MAC construction $\mathcal{H}(m\mathbin\|k)$ for common hashes $\mathcal{H}$? Consider a common practically-collision-resistant hash function $\mathcal{H}$ (e.g. , , , ), perhaps based on the  as are the first three. We define a  $\mathcal{C}$ $$(k,m) \mapsto \mathcal{C}(k,m)=\mathcal{H}(m\mathbin\|k)$$ where $\mathbin\|$ denotes concatenation, $k$ is a secret key (constant, or at least of fixed size), and $m$ is a message (possibly of variable length). Assume that an adversary can (iteratively) submit queries with $m_j$ and obtain $C(k,m_j)$, and wants to obtain $k$ or otherwise compute $C(k,m)$ for some $m\ne m_j$.  That MAC $\mathcal{C}$ is not trivially bad. In particular, if $\mathcal{H}$ was indistinguishable from a random function in the , $\mathcal{C}$ would be secure. And even though $\mathcal{H}$ may have the , it does not turn into a devastating attack on $\mathcal{C}$.  The less impractical generic attack that I see is that if a collision was known for $\mathcal{H}$ with the colliding messages of moderate identical length, it could be deduced countless collisions for $\mathcal{C}$. Hence security is demonstrably not better than collision-resistance of $\mathcal{H}$ (for identical-length messages). We could assume that $k$ is half the size of the result of $\mathcal{H}$, and hope that the security is about  or  or , 280, 2128, 2256 hash rounds for SHA-1, RIPEMD-160, SHA-256, SHA-512.   What are the known attacks against $\mathcal{C}$ (better than the above), and their cost, for each of these common hashes?  Is there hope for an argument that an attack against $\mathcal{C}$ would turn into an attack of similar cost against $\mathcal{H}$, or hint of the contrary?  Update: this  is of interest, but I fail to find that it really answers the present question.  Update 2: I am aware that the construction considered is weaker than , and in particular is vulnerable to collision on $\mathcal H$; I stated that, and that it is thus pointless to have the key wider hopeless to target security against some attacks better than half the hash's size. I'm asking exactly what cryptanalytic attack better than finding a collision on $\mathcal H$ there are. There is room for such an attack only by exploiting a weakness in the structure or/and the round function of a concrete $\mathcal H$. Install python packages for specific python version I understand that in Ubuntu 14.04, you have access to both python 2.7.6 and python 3.4.0. When getting python packages through the command line, how do I make sure that I am installing packages meant for python 2.7.6 and not for python 3.4.0? I am running a query like   select id from students where school_id='67153fb1-8f79-441d-a747-ca3778cf6d3d';   on table that looks like                                      Table "public.students"           Column       |            Type             |             Modifiers                   -------------------+-----------------------------+------------------------------------      id                | uuid                        | not null default gen_random_uuid()      school_id        | uuid                        |  Indexes:     "students_pkey" PRIMARY KEY, btree (id)     "students_school_id_idx" btree (school_id)   The query plan for the select statement with just where looks like below-  explain select id from students where school_id='67153fb1-8f79-441d-a747-ca3778cf6d3d';                                             QUERY PLAN                                             --------------------------------------------------------------------------------------------------  Bitmap Heap Scan on students  (cost=581.83..83357.10 rows=24954 width=16)    Recheck Cond: (school_id = '67153fb1-8f79-441d-a747-ca3778cf6d3d'::uuid)    -&gt;  Bitmap Index Scan on students_school_id_idx  (cost=0.00..575.59 rows=24954 width=0)          Index Cond: (school_id = '67153fb1-8f79-441d-a747-ca3778cf6d3d'::uuid)   This is fairly fast.  Now we add order by to the query with id that degrades the query.(Such a query is generated by Rails like student.first with some condition)  explain select id from students where school_id='67153fb1-8f79-441d-a747-ca3778cf6d3d' order by id asc limit 1;                                                  QUERY PLAN                                                  ------------------------------------------------------------------------------------------------------------  Limit  (cost=0.43..488.51 rows=1 width=16)    -&gt;  Index Scan using students_pkey on students  (cost=0.43..12179370.22 rows=24954 width=16)          Filter: (school_id = '67153fb1-8f79-441d-a747-ca3778cf6d3d'::uuid)   How can I improve the speed to return the results of this query? Currently there are around 4990731 records in the table and is taking more than 2 minutes! Its running on RDS with db.t2.medium instance.  UPDATE After running Analyze students;  explain select id from students where school_id='67153fb1-8f79-441d-a747-ca3778cf6d3d' order by id asc limit 1;                                                        QUERY PLAN                                                         -----------------------------------------------------------------------------------------------------------------      Limit  (cost=8.46..8.46 rows=1 width=16)        -&gt;  Sort  (cost=8.46..8.46 rows=1 width=16)              Sort Key: id              -&gt;  Index Scan using students_school_id_idx on students  (cost=0.43..8.45 rows=1 width=16)                    Index Cond: (school_id = '67153fb1-8f79-441d-a747-ca3778cf6d3d'::uuid)      explain analyze select id from students where school_id='67153fb1-8f79-441d-a747-ca3778cf6d3d' order by id asc limit 1;                                                                           QUERY PLAN                                                                              -----------------------------------------------------------------------------------------------------------------------------------------------------------     Limit  (cost=8.46..8.46 rows=1 width=16) (actual time=1.853..1.855 rows=1 loops=1)      -&gt;  Sort  (cost=8.46..8.46 rows=1 width=16) (actual time=1.851..1.852 rows=1 loops=1)            Sort Key: id            Sort Method: quicksort  Memory: 25kB            -&gt;  Index Scan using students_school_id_idx on students  (cost=0.43..8.45 rows=1 width=16) (actual time=1.841..1.843 rows=1 loops=1)                  Index Cond: (school_id = '67153fb1-8f79-441d-a747-ca3778cf6d3d'::uuid)     Planning time: 0.145 ms     Execution time: 1.874 ms Let $A$ and $B$ be $n\times n$ matrices such that $ABAB=0_{n\times n}$.  Can we conclude that  $BABA$ must be  $0_{n\times n}$?   I fail to give a counterexample when $n=2$， so I guess the answer is "yes" This is the announcement post of the Stack Exchange Data Explorer. Its answers were meant to iron out the initial glitches 6 to 8 years ago.  If you have found a bug or need support  today with any of SEDEs features, please ask a new question and tag it with   What does it do? Allows you to run arbitrary SQL queries on the data dumps, and share those queries with your friends. Technical details It is hosted on the Stack Exchange infrastructure , the database is hosted on the same SQL Server version all other sites are hosted on. You can use most of the TSQL commands, even create temporary objects (but not User Defined Functions). The controls used are jQuery based, the grid is  . All query results are cached, so sharing a link to a query will not result in the server going in to a tailspin. The query edit control is a slightly modified  control, I also am considering bespin cause the inter iframe communication is nasty complicated. It gives up nice syntax highlighting for queries. Parameters There is support for parameterized queries, to get it to work name your params like ##this##. For example have a . Query name and description A query can have a name and description, to name it lead with a comment, to describe it continue commenting, for example: -- This is my query name  -- This is my description -- I can span multiple lines  SELECT 1  Anonymous users can initially name a query, but can not change the names of any existing queries. Tutorial There's a  which helps you getting started in writing your own SQL queries. Logging in You can use your openid provider to log in, at the moment once logged in we will track the list of queries you execute (giving you basic history support) Also if there are any params named UserId they will be populated automatically if your EmailHash matches the one on the site being queried. Magic columns If you alias an id column with as [Post Link] it will automatically create a link in the result set to the parent site. Similarly if you alias an id column with as [User Link] it will display a link to the user page. select top 10 * from Posts will show you how tags are done. (Magic columns for images is planned) example (most controversial posts:  ) So what are you waiting for, check it out at  Any feedback would be greatly appreciated. I hope to have the login section working fairly soon and allow voting on the best queries and commenting. Featured Queries At the moment, admins have permission to feature interesting queries on this page , I am looking for better ways to manage the huge query list that is building up. How can I remove myself from India's visa blacklist? Which way is up? (electric outlet) My house has electric outlets in both orientations.  Which one is correct?  Should the ground hole be at the bottom or the top?    OR Extracting text from HTML file using Python Proving Eigenvalue squared is Eigenvalue of $A^2$ The question is: Prove that if $\lambda$ is an eigenvalue of a matrix A with corresponding eigenvector x, then $\lambda^2$ is an eigenvalue of $A^2$ with corresponding eigenvector x.  I assume I need to start with the equation $Ax=\lambda x$ and end up with $A^2 x=\lambda^2 x$ but between those I am kind of lost. I have manipulated the equations several different ways and just can't seem to end up where I need to be. Help would be greatly appreciated as I believe this will be on a test tomorrow. Why didn't Elizabeth get cursed? In Pirates of the Caribbean, whoever has the Aztec gold gets cursed.  But Elizabeth had the gold coin with her which Bootstrap gave to his son Will before he was tied to a cannon and dropped to the ocean floor.  Barbossa states that they were cursed because of Aztec gold.  Also in the fight between Jack and Barbossa, Jack takes a gold coin and he was also cursed.  Why didn't Elizabeth get affected? Or was she also cursed and nobody noticed? Prove by induction $\sum_{i=1}^ni^3=\frac{n^2(n+1)^2}{4}$ for $n\ge1$ Prove the following statement $S(n)$ for $n\ge1$:  $$\sum_{i=1}^ni^3=\frac{n^2(n+1)^2}{4}$$  To prove the basis, I substitute $1$ for $n$ in $S(n)$:  $$\sum_{i=1}^11^3=1=\frac{1^2(2)^2}{4}$$  Great. For the inductive step, I assume $S(n)$ to be true and prove $S(n+1)$:  $$\sum_{i=1}^{n+1}i^3=\frac{(n+1)^2(n+2)^2}{4}$$  Considering the sum on the left side:  $$\sum_{i=1}^{n+1}i^3=\sum_{i=1}^ni^3+(n+1)^3$$  I make use of $S(n)$ by substituting its right side for $\sum_{i=1}^ni^3$:  $$\sum_{i=1}^{n+1}i^3=\frac{n^2(n+1)^2}{4}+(n+1)^3$$  This is where I get a little lost. I think I expand the equation to be  $$=\frac{(n^4+2n^3+n^2)}{4}+(n+1)^3$$  but I'm not totally confident about that. Can anyone provide some guidance? Calculating the average area of the states listed in states.txt Need someone to calculate the average area, in square miles, of the states listed in states.txt. States.txt (file): State           Population   SqMi      Region  ------------------------------------------ California           39.37   163.7       West Texas                29.36   268.6      South Florida              21.73    65.7      South New_York             19.33    54.7  NorthEast Pennsylvania         12.78    46.1  NorthEast Illinois             12.59    57.9    Midwest Ohio                 11.69    44.8    Midwest Georgia              10.71    59.4      South North_Carolina       10.60    53.8      South Michigan             9.97    96.7    Midwest  Output should look like this: Average Area: 82.85 square miles  Note my awk program will be ran like this: awk –f &lt;file.awk&gt; states.txt How do I hide javascript code in a webpage? Array versus List: When to use which? MyClass[] array; List&lt;MyClass&gt; list;   What are the scenarios when one is preferable over the other? And why? How to tile textures in Cycles? Is it possible to remove inline styles with jQuery? How to get Beamer Math to look like Article Math In a LaTeX article, the math characters are more "curvy" than the text characters:  \documentclass[12pt]{article} \begin{document}  $x^2 + y^2 = z^2$ \end{document}     In a beamer presentation, the math characters do not have the same curves:  \documentclass{beamer} \begin{document} \begin{frame}  $x^2 + y^2 = z^2$ \end{frame} \end{document}     Question  How can I get the beamer math to look just like the article math?  I would prefer if the solution was a single line (that I could place at the top of my LaTeX file) as opposed to something that needs to appear next to every piece of math. Inserting a term into a custom taxonomy Headers and font in KOMA-script I am setting up the layout for my bachelor thesis using scrbook as basis for a self-made documentclass with twosided print. I want a header containing the current part number and name on the outer side (left on even pages, right on odd pages), the current chapter number and name on the center of the head and the same for section on the inner side. I found this example in the KOMA-Script documentation:  \usepackage{scrlayer-scrpage} \pagestyle{scrheadings} \automark[chapter]{chapter} \automark*[section]{}   It puts the chapter on the outer side on even pages and the section on the outer side on odd pages. Sadly, I was not able to modify this to fit my needs because I do not really understand the way KOMA-Script works here. If a part starts but there is still no chapter in it, the place for the chapter shall remain empty (same for chapter and section). Can anyone help?  Furthermore, I would like to change all fonts that KOMA-Script changes (e.g. toc, section, chapter...) back to the default computer modern as I do not like the font KOMA-Script uses here. Is there a better way than changing all the fonts manually like this:  \addtokomafont{section}{\fontfamily{cmr}\selectfont} Test -n gives unexpected result I understand test -n &lt;expression&gt; to return false if the expression evaluates to a string length of greater than 0.  Why then does the following happen?  Macbook:~ echo ${#undeclared_variable} 0 Macbook:~ test -n $undeclared_variable &amp;&amp; echo Foo Foo   Bash 4.x  My expectation is that since test -n $undeclared_variable should evaluate false, that Foo should not be echoed.  If I use [[  ]] instead of test, it works as expected.