This is my first time using Ubuntu.  I would like to know how to create a shortcut to change the language that I use to write.   For example, in Windows you press Alt+Shift to cycle between languages.  How do I do that in Ubuntu 16.04 LTS?
Possible Duplicate:          On Windows I am able to switch between keyboard layouts by pressing Alt+Shift. Is there a similar keyboard shortcut in Ubuntu?
How to prototype? How is prototyping done in a professional EE environment? Do you do your prototypes on breadboards, on copper clad boards, Manhattan style, or do you just draw schematics, order PCBs made and assembled and work with them, hacking here and there if necessary? Normalizer of upper triangular group in ${\rm GL}(n,F)$ The following question has already appeared on mathstack:     If $B$ is the subgroup of ${\rm GL}(n,F)$ consisting of upper triangular matrices then normalizer of $B$ in ${\rm GL}(n,F)$ is $B$ itself.   I know a proof of this using Bruhat decomposition of ${\rm GL}(n,F)$.   Question: Can we prove above theorem without using Bruhat decomposition?    Why came to this question: Consider the general linear Lie algebra $L=\mathfrak{gl}(n,F)$; in it, let $T=\mathfrak{t}(n,F)$ be the upper triangular sub-algebra. Then normalizer of $T$ in $L$ is $T$ itslef, and this can be proved just by considering a very simple decomposition of ${\mathfrak gl}(n,F)$: write any element as sum of upper triangular matrix and lower triangular matrix whose diagonal is $0$.   But then for problem above, is it necessary to use Bruhat decomposition? Is there a way to set transparency of windows in GNOME? Sometimes ago I used KDE 3.5 I think, and really liked the transparency option for windows, which gave all my text editor a really killer look and feel, really nice/ethereal environment for coding.  I haven't managed to find such a possibility with GNOME.  Any idea if it is possible and how? VT-x is not available, but is enabled in BIOS Recently I started having an issue with VT-x on my Windows 10 running on HP EliteBook. I was using Oracle VirtualBox to run some VMs on it before and VT-x was enabled in BIOS and was working fine.  I started getting VT-x is not available error every time I was trying to start any of my VMs. That started happening after I installed Docker on my machine, so I tried uninstalling it and rebooting. Didn't help.  I checked BIOS settings and it says VT-x is enabled but checking with Intel(R) Processor Identification Utility shows that VT-x is not supported and Oracle VirtualBox also doesn't see it.  There were no hardware changes and the only software change was installing/uninstalling Docker.  How can this issue be fixed? For the command   sudo apt-get update   I get following error:  W: Failed to fetch http://ch.archive.ubuntu.com/ubuntu/dists/maverick-updates/multiverse/binary-i386/Packages.gz   407  Proxy Authentication Required (The ISA Server requires authorization to fulfill the request. Access to the Web Proxy filter is denied. )   I am running Ubuntu 10.10 installed on Windows XP using VirtualBox. For Internet connections I am using proxy server with an authentication. I tried to use gnome-network-proxy tool to set proxy settings system-wide.   After that /etc/environment has been updated by http_proxy variable with the format http://my_proxy:port/, there were no authentication data.  I checked this with Firefox. Browser asked my for login and password and everything was working fine. It was unfortunately not the case for apt-get. I have also tried to do as described . Unfortunately it does not work.  May it be somehow related to the fact that a proxy is in a Windows domain, any ideas?  My proxy name is http-proxy. Is '-' a special character here? The category Set has the property that any morphism f can be decomposed into an epimorphism $e$ and a monomorphism $m$ with $f$ = $m\circ e$. (The intermediary set object is the image of $f$.)  Is there a name for this construction?  Is there a name for this property of categories?  In Set, the intermediary object is unique up to isomorphism. Is this the case for all categories with the property? I am auditing a Linear Algebra class, and today we were taught about the rank of a matrix. The definition was given from the row point of view:      "The rank of a matrix A is the number   of non-zero rows in the reduced   row-echelon form of A".   The lecturer then explained that if the matrix $A$ has size $m  \times n$, then $rank(A) \leq m$ and $rank(A) \leq n$.   The way I had been taught about rank was that it was the smallest of    the number of rows bringing new information the number of columns bringing new information.    I don't see how that would change if we transposed the matrix, so I said in the lecture:  "then the rank of a matrix is the same of its transpose, right?"   And the lecturer said:   "oh, not so fast! Hang on, I have to think about it".   As the class has about 100 students and the lecturer was just substituting for the "normal" lecturer, he was probably a bit nervous, so he just went on with the lecture.  I have tested "my theory" with one matrix and it works, but even if I tried with 100 matrices and it worked, I wouldn't have proven that it always works because there might be a case where it doesn't.  So my question is first whether I am right, that is, whether the rank of a matrix is the same as the rank of its transpose, and second, if that is true, how can I prove it?  Thanks  :) Understand PAM and NSS In the last days I have set up some Linux system with LDAP authentication and everything works fine, but there's still something I can't really understand regarding NSS and PAM, also after a lot of research. Citing:  NSS allows administrators to specify a list of sources where authentication files, host names and other information will be stored and searched for  and  PAM is a set of libraries that provide a configurable authentication platform for applications and the underlying operating system  What I don't understand is how PAM and NSS work and interact together. In  the architecture is explained pretty well: I configure PAM to use pam_ldap for LDAP accounts and pam_unix for local accounts, then I configure nsswitch.conf to fetch information from local files and LDAP. If I have understood correctly LDAP is used twice: first by pam_ldap and then by NSS which is itself called from pam_unix. Is that right? Is LDAP really used twice? But why do I need to configure both NSS and PAM? My explanation is that PAM performs different tasks than NSS and it is used by other programs. But, then, it should be possible to use only NSS or only PAM, as I have read in . So I experimented a bit and I have first tried to delete LDAP from the nsswitch.conf (and the authentication stopped to work as if only pam_ldap is not enough to do the job). Then I re-enabled LDAP in NSS and I deleted it from the PAM configuration (this time everything worked fine, as if pam_ldap is useless and NSS is enough to authenticate a user). Is there anyone who can help me to clarify this? Many thanks in advance. UPDATE I've just tried something now. I removed again all the pam_ldap entries in all pam configuration fields and I have also removed shadow: ldap from nsswitch.conf. As now in all the system there are only the lines: passwd: ldap files and group: ldap files in nsswitch.conf. Well... the login with LDAP users works perfectly, those two lines (plus /etc/ldap.conf) are enough to configure LDAP auth. From my knowledge PAM in independent from NSS, but my tests showed it's not. So I ask myself is it possible to completely disable NSS and use only PAM? MatrixPlot with Tooltips Inconsistent behavior when typing a number into the search field What are WPF Preview Events? I was playing around with some integrals and noticed that some integrals of the form:  $$I(a,b,c)=\int_a^\infty \frac{\arctan(x+b)}{x^2+c}dx$$ Does have a closed form. I am trying to find for what constant $c$ will this work. In case you wonder why only $c$ is problematic, I will try to show by an example.  $$I=I(1,3,16)=\int_1^\infty \frac{\arctan(x+3)}{x^2+16}dx$$ Let's start by letting $x-1=t\,$ thus: $$I=\int_0^\infty \frac{{\arctan(\color{blue}{t+4})}}{t^2+2t+17}dt$$ With $\displaystyle{t=\frac{17}{y}\rightarrow dt=-\frac{17}{y^2}dy}$ $$I=\int_0^\infty \frac{{\arctan\left(\color{red}{\frac{17}{y}+4}\right)}}{\left(\frac{17}{y}\right)^2 +\frac{34}{y}+17 }\frac{17}{y^2}dy\overset{y=t}=\int_0^\infty \frac{{\arctan\left(\color{red}{\frac{17}{t}+4}\right)}}{t^2+2t+17}dt$$ $$2I=\int_0^\infty \frac{{\arctan(\color{blue}{t+4})+{\arctan\left(\color{red}{\frac{17}{t}+4}\right)}}}{t^2+2t+17}dt$$ $${\arctan(\color{blue}{t+4})+{\arctan\left(\color{red}{\frac{17}{t}+4}\right)}}=\arctan\left(\frac{\color{blue}{t+4}+\color{red}{\frac{17}{t}+4}}{1-(\color{blue}{t+4})\left(\color{red}{\frac{17}{t}+4}\right)}\right)$$ $$=\arctan\left(\frac{x^2+8x+17}{x}\frac{x}{-4(x^2+8x+17}\right)=\pi-\arctan\left(\frac14\right)$$ Above follows since the original integral is positive so we take $\arctan(-x)$ as $\pi-\arctan x $ and therefore getting a negative answer will not be an issue. $$I=\frac12 \left(\pi -\arctan\left(\frac14\right)\right)\int_0^\infty \frac{1}{t^2+2t+17}dt$$ Well, now the inner integral is not hard to compute and the final answer happens to be: $$I=\frac12 \left(\pi -\arctan\left(\frac14\right)\right)\frac14\arctan\left(\frac{t+1}{4}\right)\bigg|_0^\infty =\frac{\pi^2}{16}-\frac{3\pi}{16}\arctan\left(\frac14\right)+\frac18\arctan^2\left(\frac14\right) $$ There are more examples that I found by checking and try such as:  $$I(1,2,9)=\int_1^\infty \frac{\arctan(x+2)}{x^2+9}dx$$ $$I(2,1,6)=\int_2^\infty \frac{\arctan(x+1)}{x^2+6}dx$$ $$I(2,2,13)=\int_2^\infty \frac{\arctan(x+2)}{x^2+13}dx$$ And so on... All those can be solved by the same method: First substitute $x-a=t$, then let $t=\frac{\alpha}{y}$, where $\alpha$ is the "free of x" coefficient from the denominator.   The problem is that I tried more than $100$ combinations to get those integrals which is not that nice. How can we "smartly" find $c$ so that $I(a,b,c)$ is evaluable by symmetry? Or put in other word what should be $c$ if one wants to compute by symmetry $I(7,13,c)$? Unable to install ECW support on lubuntu 14.04 Is there a way to access an iteration-counter in Java's for-each loop? Is there a way in Java's for-each loop  for(String s : stringArray) {   doSomethingWith(s); }   to find out how often the loop has already been processed?  Aside from using the old and well-known for(int i=0; i &lt; boundary; i++) - loop, is the construct  int i = 0; for(String s : stringArray) {   doSomethingWith(s);   i++; }   the only way to have such a counter available in a for-each loop? If $f,g:X \to Y$ are continuous and $Y$ is $T_2$, then $\{x \in X\,|\,f(x)=g(x)\}$ is closed I'd like to know if the following proof is valid.  The only thing I'm not sure about (though I can't see why it's invalid if it is) is if we can always use the Hausdorfness of $Y$ to separate an open set from $f(C)=g(C)$.  "Let $X$ be a space, $Y$ a $T_2$-space, and $f,g:X \to Y$ continuous functions.  Prove that $C:=\{x \in \,|\,f(x)=g(x)\}$ is a closed subset of $X$."  Let $x \in X$ be such that $f(x) \ne g(x)$.  Since $Y$ is $T_2$, there are open sets $U_\alpha \ni f(x)$ and $V_\alpha \ni g(x)$ such that $U_\alpha \cap O_\alpha=V_\alpha \cap O_\alpha=\varnothing$ for all $\alpha \in A$ where $A$ is the set indexing the points of $f(C)=g(C)$, and $O_\alpha$ is an open set containing $x_\alpha \in f(C)=g(C)$.  Let $U:=\displaystyle\bigcap_{\alpha \in A} U_\alpha$ and $V:=\displaystyle\bigcap_{\alpha \in A} V_\alpha$.  Then $U \cap f(C)=V \cap f(C)=\varnothing$.  Therefore, since $f,g$ are continuous, $f^{-1}(U)$ and $g^{-1}(V)$ are open sets in $X$ disjoint from $C$.  Since $X\setminus A$ is the union of such open sets, it is open itself and therefore $C$ is closed.  Thanks. Which programs can I use to edit PDF files? I know that there is a very similar question, but I'm not interested in highlighting. What I'm looking for is some tool in Linux to edit pdf files. I've tried pdfedit which did the work for me, but if freezes after a few edits. I've tried this tool under Ubuntu 9.10 and under KDE Fedora 14 and the same thing happens. I've tried Okular but the notations are too big to fill out exercises from pdf workbooks.    Is there any tool that suits this job? I don't care whether it is open source or I have to pay a reasonable price for it. How to bind 'touchstart' and 'click' events but not respond to both? I have been hit with a homework problem that I just have no idea how to approach. Any help from you all is very much appreciated. Here is the problem  Prove the equation: $a^{\log_b c} = c^{\log_b a}$  Any ideas? I've had a few concerns over a new form of &quot;spam&quot; - that is, through voting. A while back, I had seen some wild reputation increases to my account, amongst others, that seemingly felt weird - as I've barely participated in asking questions or providing answers. Earlier today, this sentiment was echoed by another user in chat:  and like 250 this month? it seems like someone is spam upvoting  This was another user that saw a 250 rep increase, but has been inactive for quite a while. For a site that hasn't seen more than 5 questions a day, that was really weird. To put things even more out of hand, it seems like each vote has been placed on a question.  I did some investigation of my own, and it seems like I've found a badge hunter. More of a... gold badge hunter. This user is among the top 3 voters of the site. Looking into this user's profile, this user only has under 200 rep, and has posted a single question, which was received differently. One thing caught my eye:  Votes all time              by type 581   up              535    question 1     down            47     answer   Each vote is an up vote (with the exception of one), and there are 535 up votes on questions. There are 535 questions in the entire site. Using reputation stats from user profiles, I came with the conclusion that these votes are...  Done within a short period of time. 5 question votes within a couple of minutes Done in [near] perfect chronological order: The earlier the vote, the earlier the question was asked. As if the user had gone through the list of questions in order, and placed an up vote on each one.   I see this as incredibly problematic. First:  It dangerously inflates reputation. Votes are not done based on their content, but simply for voting. Therefore, reputation loses it value as a way to measure expertise.  It's like serial up voting. Generally, when we hear the term &quot;serial up voting&quot;, we think of a voting ring, where one user continuously up votes another. This is negative for the targeted user. Well, here, we've got a voting ring with the site and this user. A user continuously up votes the site, causing negative damage for the site.  We mix good and bad content. Since low quality questions are a victim of the voting spree, many get meddled with the rest of &quot;good quality&quot; questions, despite being closed as off-topic, too broad, or whatever the reason. We can no longer reliably sort questions by quality with the very system that was designed to help us.   ... And the rest of voting fraud issues outlined in .  I've got a couple questions on this:  Is this comparable to serial voting? Should such votes be reversed? How should we determine whether or not to reverse them?  Should we stop this? Let it be? Is this really that big of a problem for sites? (I would argue that it's less of an issue for graduated sites that receive large amounts of content, but what about beta sites that rarely see more than a few questions a day) I have a failure to transfer my game from one HDD to another, and one PC to another. I copied the entire Skyrim folder from one HDD to another. And told where to find it also. Steam did a huge check of my HDD.  But it ended up downloading most of the files anyway. It took a week to download Dawnguard, Hearthfire, and Dragonborn files along with my Hi-Res textures.  I did ask about it in chat. But I feel this could help me or somebody else.  This is the screen I am looking at after transferring my entire hard drive to to new one. Steam downloaded my games, including Skyrim even though my Skyrim data folder had all the data files for Dawnguard, Hearthfire, Hi-Res and Dragonborn.  I have my copied files and have got rid of everything not steam related. I just have my DLCs and they include my hires files.  This is what it looks like.    But I still get this :     What could be causing this? How can I rectify? And in future when one is migrating to a new PC, how can this be avoided?  EDIT::::::::::::::::: Removed everything : Here is how it looks :  Still the prompt as before Steam Error 15  (Side Note : I transferred all my Origin games just by copy/pasting. This really is not nice.)    EDIT 2 :::::::::::::::::::::  And one more EDIT  I tried getting game cache up to speed, but this is prompt I am getting. But I played the game, it was working, I could pick out my character and all, and escape from Helgen.  EDITED 3 :::::::::::::::::  How does one transfer a Steam game? A game that is heavily modded, will the backup a Steam Game option suffice?