Get the key with the biggest score in Python
Getting key with maximum value in dictionary?
Export/Deploy Drupal site/page to static? (no cache) I wonder if there is an existing  module that can help in the subject. I am not looking for a caching module (like Boost or Varnish), but a way to export my whole site (or only certain pages) into static.  The idea is that I want my web server will be a very simple and light and will only serve static files (html/css/js) - no database on production, no php engine will be installed on server. All the Drupal engine will be on another server, export will be done each time adding/editing/changing a node or view, and a new set of html files will be created in a directory structure.  These files will later on be copied to the production site that will serve always and only static files, no .htaccess that will check requests if file exist etc.   Is there a module for that, or a workaround that this can be achieved with Drupal?  Thanks I want to show that for $S,T\in B(H)$ bounded operators on Hilbertspace with $S\geq 0,T\geq 0$ and $ST=TS$,  we have $S+T\geq 0$, and $ST\geq 0$.  $T\geq 0$ means $(Tx,x)\geq 0$.    To me it seems that $((S+T)x,x) = (Sx,x)+(Tx,x)\geq 0$. But for $ST$ i like some help.   There is a theorem in Rudin (12.32) that says that for every $T\in B(H)$ we have an equivalence:   $T$ is positive $\Leftrightarrow$ $T$ is self adjoint, i.e. $T=T^*$ and $\sigma(T)\subset [0,\infty)$.   Since $S, T$ are self adjoint we know that $ST=TS = S^*T^* = T^*S^*$ ($ST$ is selfadjoint since $S,T$ commute). Also I read somewhere that if $S,T $ commute then $\sigma(ST)\subset \sigma(S)\sigma(T)$, but I am not sure if this is true. Clearly I cant prove it, but if it were true by this ''Theorem'' it would follow that $ST \geq 0$.   Is there a more straightforward way? Tips to extend battery life for laptops and notebooks This question is present as a matter of historical interest.  While you are encouraged to help maintain its answers, please understand that "big list" questions are not generally allowed on Ask Ubuntu and will be closed per the .   It is possible to greatly extend the usage time of a laptop or netbook running on battery by disabling various services and installing various packages.   What tricks or tips do people have for getting an extra hour or two out of their batteries? Say I create an object thus:  var myObject =         {"ircEvent": "PRIVMSG", "method": "newURI", "regex": "^http://.*"};   What is the best way to retrieve a list of the property names? i.e. I would like to end up with some variable 'keys' such that:  keys == ["ircEvent", "method", "regex"] Subspace of Noetherian space still Noetherian How to prove that 2017 divides $1^{2017}+2^{2017}+\dots+2017^{2017}$? How can I prove that $2017 \mid 1^{2017}+2^{2017}+\dots+2017^{2017}$? I tried proving it with the use of modulo, however it was to no avail. Afterwards, I  tried researching, for possible theorems, that may help, but that bore no fruit, either. Can you guys please help me proving it, as I am stuck? Thanking you in advance. Word for the opposite of "hypochondriasis" How to typeset row operations on augmented matrix I would like to typeset row operations on a augmented matrix, but the "gauss"-package does not seem to support the vertical line just before the last column, any way to do this?  Thanks! Meaning of U suffix How do I specify unique constraint for multiple columns in MySQL? I have a table:  table votes (     id,     user,     email,     address,     primary key(id), );   Now I want to make the columns user, email, address unique (together).  How do I do this in MySql?  Of course the example is just... an example. So please don't worry about the semantics. I have been attempting this problem for a while, it is an assignment problem so I don't want somebody to just post the answer, I'm just looking for hints.  Let $\mathfrak{u}(n,\mathbb{C})$ be the Lie algebra of strictly upper triangular $n\times n$ matrices over $\mathbb{C}$.  I am trying to show that $\mathfrak{u}(n,\mathbb{C})$ is a nilpotent Lie algebra for $n\geq 2$.  This is what I have looked at so far.  I have done some explicit calculations (I shall omit the bulk of them and just summarise below) for $n=2,3,4$ and have come up with some ideas.  Let $L=\mathfrak{u}(n, \mathbb{C})$.  If $n=2$,  $L^1 = [L, L] = &lt;0&gt;_{\mathbb{C}}$  So $L$ is nilpotent.  If $n=3$,  $L^1 = [L, L] = &lt;e_{13}&gt;_{\mathbb{C}}$  $L^2 = [L, L^1] = &lt;0&gt;_{\mathbb{C}} = \left\{ 0 \right\}$  So, $L$ is nilpotent.  If $n=3$  $L^1 = [L,L] = &lt;e_{13},e_{14},e_{24}&gt;_\mathbb{C}$  $L^2 = [L,L^1] = &lt;e_{14}&gt;_{\mathbb{C}}$  $L^3 = [L, L^2] = &lt;0&gt;_{\mathbb{C}} = \left\{ 0 \right\}$  So, $L$ is nilpotent.  So my hypothesis so far is that for an arbitrary $m\in\mathbb{N}$, $L^{m-1}=\{0\}$  My instinct is to do this by induction. My base case, $n=2$ has already been shown. Now I assume that $\mathfrak{u}(n,\mathbb{C})$ is nilpotent for $n=k$ ($k\in\mathbb{N}$) and consider the case for n=k+1.  However, I have no idea how to link these two cases together. I have read in Introduction to Lie Algebras and Representation Theory - J.E. Humphreys that $L^k$ should be spanned by basis vectors $e_{ij}$ where $j-i=k+1$ - however in my calculations for $L^1$, I obtain an $e_{14}$ which does not satisfy 4-1=2.  Am I missing something completely obvious? Or have I made a mistake somewhere? (I have checked my calculations numerous times, but cannot find any errors!)  Thanks,  Andy. How to schedule a cron job to run a video fill every 5 minute? Should a button become lighter or darker on hover? We're having a discussion in the office about whether a button should become lighter or darker when a user hovers over it.   Here are some examples from the field:  Apple "Buy Now" button (Second is hover, third is depressed) -     Twitter Bootstrap -    (Unselected)   (Hover)  Github homepage - github.com      The button on FogBugz homepage goes from yellow to slightly lighter yellow. The buttons on Optimizely and Visual Website Optimizer hardly change.  Amazon's "Buy Now" button doesn't do anything when you hover over it (besides change to a pointer cursor). The colored buttons in Google's new interface (see Gmail or Calendar) go slightly darker when you hover over them.  Finally here is our button:    Should your button become lighter or darker when you hover over it? What else should you consider? Does anyone have data on whether the hover effect matters for conversions? Cannot log in with Apple ID after performing password reset My wife forgot the password to her Apple ID account. Her Macbook Air (OS X Yosemite) restarted to install some updates. She has her user account set up through her Apple ID account.  Since she forgot the password she reset it from my laptop.  She can log in to iCloud and Apple ID with the new password, but cannot log in with the new password on the Air.  When she tries to log in she is greeted with this message:     "This account uses an iCloud password to log in. If you need to change   the password, use another device to change it at appleid.apple.com." Which version of Ubuntu will work on my PowerPC? I'm using iMac PowerPC G5 1.8 GHz, 1GB RAM, 160GB HDD, and 10.5.4 Leopard OS.  I want to run Ubuntu on my iMac. Please can anyone tell me which version will run in my system? How to remove "onclick" with JQuery? I want my Java code to be typeset in a monospaced font, so I am using the verbatim environment. LaTeX commands are highlighted in Eclipse, but as soon as I use the verbatim environment everything inside and the color of the environment itself becomes gray.  \begin{verbatim}   public class main {  public static void main (string[] args){      for(int i = 0; i &lt; arg.length; i ++){          System.out.println(args[i]);      }    }  };  \end{verbatim}   I'm using the verbatim and alltt packages.  Update 1.  MWE.  \documentclass[xcolor=dvipsnames]{beamer}  \mode&lt;presentation&gt; { \usetheme{CambridgeUS} \setbeamercovered{transparent} }  % Поддержка русского языка \RequirePackage[utf8]{inputenc} \RequirePackage[T2A]{fontenc} \RequirePackage[russian]{babel}  \RequirePackage{amsfonts}  \usepackage{algorithmic} \usepackage{mathptmx} \usepackage[scaled=.90]{helvet} \usepackage{courier} \usepackage{pst-node} \usepackage{pst-tree} \usepackage{auto-pst-pdf} \usepackage{color} \usepackage{colortbl} \usepackage{pstricks} \usepackage{verbatim} \usepackage{alltt} \usepackage{listings} \usepackage{animate} \usepackage{multimedia}  \title{Title}  \author{Name}  \institute{}  \date{\today}  \begin{document}  \begin{frame} \titlepage \end{frame}  \begin{frame} \frametitle{Outline} \tableofcontents \end{frame}  \section{Introduction}  \begin{frame}{Классификация по поколениям}  \begin{itemize}  \item Третьего поколения (высокоуровневые языки) - последовательность высокоуровневых конструкций (циклы, условные выражения, классы, интерфейсы, методы, процедуры, \ldots) \pause  \begin{exampleblock}{Пример}  \begin{centering}  Fortran, C, C++, C\#, Java, Lisp.  \begin{verbatim}  public class main { public statiс void main (string[] args){ for(int i = 0; i &lt; arg.length; i ++){ System.out.println(args[i]); } } };  \end{verbatim}  \end{centering}  \end{exampleblock}\pause  \item Четвертого поколения (для конкретного применения) - последовательность инструкций конкретной предметной области \pause  \begin{exampleblock}{Пример} SQL, Postscript, XML, Mathlab. \end{exampleblock} \pause  \end{itemize}  \end{frame}  \end{document} Linking search box to dataset column in Carto? The search box in a published map of CartoDB isn't linked to the dataset which is shown in the CartoDB map. How can I link the search box to a certain column of a dataset? I have reviewed both related posts on this site:      The issue I am having is that I have implemented the registry change, rescanned my websites, and I am still being told that IIS 6 is allowing SSL 2.0 connections.  Here's the verbage from the scanning site:     Synopsis : The remote service encrypts traffic using a protocol with known weaknesses. Description : The remote service accepts connections encrypted using SSL 2.0, which reportedly suffers from several cryptographic flaws and has been deprecated for several years. An attacker may be able to exploit these issues to conduct man-in-the-middle attacks or decrypt communications between the affected service and clients.   QUESTIONS:   How do I test this myself so I can continue to troubleshoot the issue? Is there a tool out there that I can use to test? Would I need to disable other connection methods? [PCT 1.0 / TLS 1.0]   Thanks How to place the intercept of x and y axes at (0 , 0) and extend the x and y axes to the edge of the plot