I have an internal SSD with a dual boot arch linux/Windows 7 grub. I bought a usb to sata adapter and plugged the usb to a toshiba laptop - the system starts to boot normally from the USB device, up to the point where the animated Windows pictogram appears (description from ). Then I get a bluescreen (STOP: 0x7B).  Safe mode, last driver loaded is aswRvrt.sys  Arch boots to the terminal but when I issue startx it fails with Fatal server error: no screens found(EE)  Is it hopeless ?  EDIT: this is not a duplicate of the question cited - I do not want to install to the usb - I want to BOOT from the usb. Plugging the SSD to a desktop worked out of the box.
I wanted to take a sneak peek at Windows 7 so I thought of installing it. I have Windows Vista on my laptop which came pre-installed with it. I didn't want to mess with it.  So I created a partition (20 GB) in my USB external hard disk and tried to install Windows 7 on that partition. But when I booted from a Windows 7 DVD and selected the target partition on USB hard disk, it said it cannot be installed.  Is there any way to install Windows on an external USB hard disk?
Should postdocs work only on the projects they are hired for, or can they work with other people in the same research group on other projects? Would the latter be an issue with the funding body, when the project proposal and budget only covers the expenses for hiring one postdoc? Note: it is the supervisors who got the grants, not the postdocs themselves. How do I determine how many spell slots I have when multiclassing? How do I determine how many spell slots I have if I multiclass into more than one spellcasting class? For example, I have a character that is a level 3 Wizard, a level 5 Eldritch Knight Fighter, a level 4 Arcane Trickster Rogue, a level 4 Paladin, and a 4 Warlock. How many spell slots do I have and how do I determine this? What does “{} \;” mean in find (in Linux)? Sometimes I see a command like  find . -name * -exec ls -a {} \;   I was asked to execute this.  What does {} \; mean here? Consider $X = (a+b)^n-a^n-b^n$  where  $a$ and $b$ and $a+b$ are not divisible by $n$, $n&gt;=3$ is positive and prime, $a \ne b$ and both are greater than 1.  By the binomial expansion we know $X$ is divisible by $n$, but how can we study whether $X$ is divisible by $n^2$ or other powers of $n$? Specifically I am interested to prove $X$ is NOT divisible by $n^2$, but I am not sure how to prove or disprove it. How do I remap certain keys or devices? (c) Let $\mathcal{L}^*\subseteq\mathcal{L}^{\text{FOPC}}$ be a first order language of predicate calculus consisting of three unary function symbols $f,g,h$.  (i) Write down an $\mathcal{L}^*$-sentence $\phi$ such if $\mathcal{A}$ is an $\mathcal{L}^*$-structure with $\mathcal{A}\vDash\phi$ then the restriction of $h_\mathcal{A}$ to the range of $f_\mathcal{A}$ gives a one-to-one function onto the range of $g_\mathcal{A}$.  (ii) Write down an $\mathcal{L}^*$-sentence $\psi$ such that if $\mathcal{A}$ is an $\mathcal{L}^*$-structure with $\mathcal{A}\vDash\psi$ and the domain $A$ of $\mathcal{A}$ is finite then the cardinality $|A|$ is a square.    Part (i) is easy enough, but I'm having trouble with part (ii). I assume that you can use part (i). My initial idea was to use $h$ to ensure $|Range(f_A)| =|Range(g_A)|$ but I'm not sure where to go from there. Thanks. This works just fine:      protected void txtTest_Load(object sender, EventArgs e)     {         if (sender is TextBox) {...}      }   Is there a way to check if sender is NOT a TextBox, some kind of an equivalent of != for "is"?  Please, don't suggest moving the logic to ELSE{} :) Let p be a prime. Consider the equation $\frac1x+\frac1y=\frac1p$. What are the solutions? Write down the set of distinct solutions and prove your list is complete. $x$ and $y$ are positive integers.  I have rewritten it as $\frac{(x+y)}{xy} = \frac1p$, but I don't understand where to go from here? set 4-bit nibble in an int type Headphone jack not working? Find all positive integers $a, b, c$ such that $1/a + 1/b + 1/c = 4/3999$ Find all positive integers $a, b, c$ such that $1/a + 1/b + 1/c = 4/3999$.  The contest is just ended, so you may freely answer. (I did not attend the contest: it is an Italian contest for schools and the groups may ask other people for hints. This is how I got involved, but of course asking on MSE would have been cheating)  I found three solutions: I am explaining below what I did. I would like however to know if there is a more general approach. How to add thickness to a curve? How can I add thickness to a curve? I already tried with the extrude and depth options in the curve settings, but it doesn't work properly. Lightning Web Component embedded in Visualforce Page via Aura Component and App not displaying I am writing a lightning web component that is going to be used in Salesforce Classic, Lightning Experience and an Employee Community. It does not HAVE to be a lightning web component - I could use a traditional Aura Lightning Component if I must.   However, what I am finding is that the visualforce page does not work, even when the lwc component is embedded in a aura component that is then used with Lightning Components for Visualforce. I can see from the documentation  that using a lwc directly from within visualforce is not supported, but I was under the impression that it may work if wrapped in an aura component.   My question then is this:  Has anyone had success having a lwc wrapped in an aura component display successfully within Visualforce? Or is this completely unsupported behaviour? What is a "year" in Westeros? Do I need to upgrade RAM from 4GB to 8GB for Android development? I'm an android developer and have laptop with 4GB RAM. When I compile my project the RAM is used at 100%.    If I add more RAM will it solve the problem? Why didn't Count Dooku expose Palpatine? Is my ESTA valid for a second trip? I visited the USA in May this year, on an ESTA which I applied for in April. It was approved and I was allowed entry into the country.    I'm re-visiting again this November for two weeks. Am I able to use the same ESTA again or do I need to re-apply for a new one? I know it says it's valid for two years, but is that valid for every use within those two years, or I have to use it within two years, and once I have visited on that visa, it's invalid? R's randomForest can not handle more than 32 levels. What is workaround? R's randomForest package can not handle factor with more than 32 levels. When it is given more than 32 levels, it emits an error message:     Can not handle categorical predictors with more than 32 categories.   But the data I have has several factors. Some of them have 1000+ levels and some of them have 100+. It even has 'state' of united states which is 52.   So, here's my question.   Why is there such limitation? randomForest refuse to run even for the simple case.  &gt; d &lt;- data.frame(x=factor(1:50), y=1:50) &gt; randomForest(y ~ x, data=d)   Error in randomForest.default(m, y, ...) :    Can not handle categorical predictors with more than 32 categories.   If it is simply due to memory limitation, how can scikit learn's randomForeestRegressor run with more than 32 levels? What is the best way to handle this problem? Suppose that I have X1, X2, ..., X50 independent variables and Y is dependent variable. And suppose that X1, X2 and X3 has more than 32 levels. What should I do?  What I'm thinking of is running clustering algorithm for each of X1, X2 and X3 where distance is defined as difference in Y. I'll run three clusterings as there are three problematic variables. And in each clustering, I wish I can find similar levels. And I'll merge them.  How does this sound? How to find the smallest $n$ such that $n^a\equiv 1 \pmod p$ I'm using soul to letterspace headings in a Hungarian document and compiling it with lualatex.  For some reason soul drops some of the accented letters at the end of a word, but not all. In the example below, only ő and ű are affected:  \documentclass{minimal} \usepackage{fontspec} \setmainfont[Ligatures = TeX]{TeX Gyre Pagella} \usepackage{soul} \begin{document} \noindent \so{áll llá ÁLL LLÁ}\\ \so{íll llí ÍLL LLÍ}\\ \so{űll llű ŰLL LLŰ}\\ \so{őll llő ŐLL LLŐ}\\ \so{üll llü ÜLL LLÜ}\\ \so{öll llö ÖLL LLÖ}\\ \so{úll llú ÚLL LLÚ}\\ \so{óll lló ÓLL LLÓ}\\ \so{éll llé ÉLL LLÉ} \end{document}