I have recently installed ubuntu in dual boot with windows 10 and everything was working, until I switched on the computer and ubuntu was 1024x768 instead of 1920x1080 and only one monitor was connected. How can I fix this?
As expected, Nvidia drivers have reduced my customizations. I can't login to Unity 3D session. I can't find any content to help me to uninstall the driver and I don't know what to do as I have never uninstalled them before.
The default in lyx is to have   I. First part (roman number)   Section 1   1.1 Subsection 1  and I'd like to have   First part (arabic number)   1.1 Section 1  1.1.1 Subsection 1  etc.   Any suggestion? Thanks a lot in advance! How can I check if a package is installed (no superuser privileges)? At our university we can get almost any ubuntu package installed we want, but we are not superusers ourselves (we need to request packages being installed).  With some libraries it is not always easy to know whether the package is already installed or not. Is there a simple way/command to check this? Xerces error: org.apache.xerces.impl.dv.dtd.DTDDVFactoryImpl I keep having to re-install Ubuntu after trying advice.  This is very frustrating.  All I want is to boot to a Linux command prompt.  Please help! Does $G\oplus G \cong H\oplus H$ imply $G\cong H$ in general? What should main() return in C and C++? Possible Duplicate:          Here is my sync script:  ssh user@remote.host /etc/init.d/some_service stop scp user@remote.host:/var/some_service/events ./events scp ./new_data user@remote.host:/var/some_service/new_data ssh user@remote.host /etc/init.d/some_service start   As You can see, it stops service, perform some copies with scp and starts service back.  The problem: it "costs" 4 "similar" ssh connections in a row.  Is there any way to make all the work, using one physical ssh connection? Blender 2.8 contains a number of HDRi's in it by default for the LookDev. I'd like to know how to use them in final renders (EEVEE or Cycles), because quite frankly they appear fantastic. Do not load Facebook-based avatars directly from the Facebook CDN Users who register for their account via Facebook get  as their default avatar. However, the avatar is not copied to SE servers or Imgur, and thus the original URL is kept. This URL compromises the privacy of the user as it contains their Facebook user ID which everyone can easily extract and then view the profile.  The image is also not visible at all to those who have Facebook blocked for their own privacy (by extensions such as Ghostery or browser features ), or due to network policy (e.g. some work and school networks block Facebook).  With the new avatar system, it would be much better if the Facebook photo was stored like a manually uploaded avatar to avoid this problem. What is the exact $SU(2)$ representation to which these Hermitian generators belong? \begin{equation} t_a=\{t_1,t_2,t_3\}=\left\{\frac{1}{\sqrt{2}}\begin{pmatrix}  0 &amp; 1 &amp; 0 \\ 1 &amp; 0 &amp; 1 \\ 0 &amp; 1 &amp; 0 \end{pmatrix},\,\frac{1}{\sqrt{2}}\begin{pmatrix}  0 &amp; -i &amp; 0 \\ i &amp; 0  &amp; -i \\ 0 &amp; i &amp; 0 \end{pmatrix},\,\begin{pmatrix}  1 &amp; 0 &amp; 0 \\ 0 &amp; 0 &amp; 0 \\ 0 &amp; 0 &amp; -1  \end{pmatrix} \right\} \end{equation}  I'm a bit puzzled with this, these are not the generators of the triplet representation of $SU(2)$ (the triplet in $SU(2)$ is the adjoint rep which is real and constructed with the structure constants), nevertheless they are used as if they were in much literature. What are really these generators? They seem like the extension to 3 dimensions of the Pauli matrices. The 3 dimensional fundamental rep (this does not make sense to me)? some kind of non-irreducible representation? Tensor product of a sheaf of module and a residue field Let $S$ be a scheme over a finite field $\mathbb{F}_q$ and $\mathcal{L}$ an invertible sheaf on $S$.   In Pink's article (, see section 1.4 on page 13), he states that:  For any section $\ell\in \mathcal{L}(S)$ and any point $s\in S$ we let $\ell(s)\in \mathcal{L}\otimes_{\mathcal{O}_S}k(s)$ denote the value of $\ell$ over the residue field $k(s)$ of $s$.  My question is: what is the definition of $\mathcal{L}\otimes_{\mathcal{O}_S}k(s)$?  We know we can define the tensor product of two $A$-modules or of two $\mathcal{O}_X$-modules, but what is the tensor product of an $\mathcal{O}_X$-module and a field? I have the following file:  abcde kwakwa &lt;0x1A&gt; line3 linllll   Where &lt;0x1A&gt; represents a byte with the hex value of 0x1A. When attempting to read this file in Python as:  for line in open('t.txt'):     print line,   It only reads the first two lines, and exits the loop.  The solution seems to be to open the file in binary (or universal newline mode) - 'rb' or 'rU'. Can you explain this behavior ? What is my login username and password? Updating list definition using features I have a feature that deploys content types, a list definition and template that uses these content types and finally a list instance. This feature is already in production.  Now we have a change request to add new views to this existing list. So I make the changes to schema.xml and upgrade the solution. But alas, the new views don't show up. If I create a new site, the list instance is created with the new views. I tried deactivating/reactivating, iisreset but still no success. Is there anything I'm missing? How to add a program as a startup application from a terminal? I am using Ubuntu 12.04 and I know the GUI way to maintain the startup program list but now I want to find out the way to add/remove startup applications using a command line interface (CLI). How can a distribution have infinite mean and variance? Frequency count of two column in R Solving $ax \equiv c \pmod b$ efficiently when $a,b$ are not coprime I know how to compute modular multiplicative inverses for co-prime variables $a$ and $b$, but is there an efficient method for computing variable $x$ where $x &lt; b$ and $a$ and $b$ are not co-prime, given variables $a$, $b$ and $c$, as described by the equation below?   $ a x \equiv c \mod b $   For example, given  $ 154x \equiv 14 \mod 182 $, is there an efficient method for computing all the possibilities of $x$, without pure bruteforce?  Please note that I'm not necessarily asking for a direct solution, just a more optimized one.    I do not believe that the Extended Euclidean Algorithm will work here, because $a$ and $b$ are not co-prime.   Edit:  Follow up question, since the first one had a shortcut:  Could the be computed efficiently as well?  $12260x \equiv 24560 \mod 24755$.  $107$ needs to be one of the computed answers. Combine or rebase an arbitrarily large number of commits When I entered the -al attribute with the  command, I got the following:  anupam@JAZZ:~/blog$ ls -al total 76 drwxrwxr-x 13 anupam anupam 4096 Aug 28 21:45 . drwxr-xr-x 34 anupam anupam 4096 Aug 28 20:52 .. drwxrwxr-x  8 anupam anupam 4096 Aug 28 12:19 app drwxr-xr-x  2 anupam anupam 4096 Aug 28 12:19 bin drwxrwxr-x  5 anupam anupam 4096 Aug 28 12:19 config -rw-rw-r--  1 anupam anupam  154 Aug 28 12:19 config.ru drwxrwxr-x  3 anupam anupam 4096 Aug 28 12:37 db -rw-rw-r--  1 anupam anupam 1339 Aug 28 12:19 Gemfile -rw-rw-r--  1 anupam anupam 2871 Aug 28 12:19 Gemfile.lock drwxrwxr-x  7 anupam anupam 4096 Aug 28 21:45 .git -rw-rw-r--  1 anupam anupam  466 Aug 28 12:19 .gitignore drwxrwxr-x  4 anupam anupam 4096 Aug 28 12:19 lib drwxrwxr-x  2 anupam anupam 4096 Aug 28 12:29 log drwxrwxr-x  2 anupam anupam 4096 Aug 28 12:19 public -rw-rw-r--  1 anupam anupam  249 Aug 28 12:19 Rakefile -rw-rw-r--  1 anupam anupam  478 Aug 28 12:19 README.rdoc drwxrwxr-x  8 anupam anupam 4096 Aug 28 12:19 test drwxrwxr-x  6 anupam anupam 4096 Aug 28 12:33 tmp drwxrwxr-x  3 anupam anupam 4096 Aug 28 12:19 vendor   What does each column mean, and what does the total 76 signify here?