I want to create a multi boot CD in windows I do this with xboot but is there any program to create multi boot ISO in Ubuntu
What I want is to create a bootable pen drive that shows GRUB menu and I can select any of the several bootable systems from there to install/run. I have several ISO images that I want to install in the USB like Ubuntu, Fedora, System Rescue CD, Windows XP and Windows 7 (The windows versions are optional, mostly am looking for a multi installer for Linux distros, specially Ubuntu version)  The default Startup Disk Creator only works with Linux Images and only 1 at a time (At least for the mean time. If it allows more systems and multiple ISOs it would be awesome)  What method exists that I can use step by step to create a bootable USB Drive with multiple images than can be booted from the USB and selected from GRUB. It must support Windows Images and Linux Images.  Alternatively, is there also a way to have multiple versions of the Ubuntu installation ISO on same USB Drive, such as, when booting from it, I get to choose what Ubuntu version and architecture to install, for example:     BOOT MENU   Ubuntu 12.04 32 Bit   Ubuntu 12.04 64 Bit   Ubuntu 12.10 32 Bit   Ubuntu 12.10 64 Bit   UPDATE: Wanted to add that the English version for the post mentioned by daithib8 is here:
Is there a way to "rescue" mesh that has very bad topology? 'Good' review audits can be misleading I want to make a Launcher that will do privileged (requires root) commands, but I don't want to see the terminal or have to type my password into the terminal. So I found the command, gksudo that allows me to enter my password so that I can escalate my privilege level. Now I want to couple this, so that I can change the partition priority using this command cgpt add -i 6 -P 0 -S 0 /dev/sda (this command is privileged) and have it automatically reboot from this one launcher.  I setup a Luncher like this:  Name: ChromeOS  Description:  Command: gksudo gnome-terminal -e "cgpt add -i 6 -P 0 -S 0 /dev/sda;reboot"  Comment:  But it does not work. Any tips? Which SUSY models are affected by the recent LHCb result? I can't seem to get these particular faces to take the UV Mapping. I selected the entire object, entered edit mode, hit U>Unwrap.   The rest of the mesh takes the uv wrapping, but not those faces for some reason.    It looks normal in solid mode.     Does anyone know what could be causing this? How to prove the following expression does not depend on x? I'm not sure how to approach this question, but I know it has something to do with taking the derivative of this. Can anyone please help me out?  Let x > 0. Prove that the value of the following expression does not depend on x: $$\int_{0}^{x}\frac{1}{1+t^4} dt + \frac{1}{3}\int_{0}^\frac{1}{x^3} \frac{1}{1+t^\frac{4}{3}} dt$$ All Stack Exchange data dumps Why is there no absolute maximum temperature? Allow cancelling of stars from message Currently, the only way to cancel stars in a chat transcript is when the chat-message is visible in the chatroom's sidebar.    However, in a fast-moving, multi-star chatroom, the window of opportunity to cancel can be short, and rapid changes in starring can quickly make this impossible to do in a timely way.  We use stars as markers in moderator chat events (where the Community managers disseminate important information to the moderator teams) as well as for town halls during elections.  Feature request: Allow mods/room owners to cancel stars from the chat message menu box, including in the transcript. Customizing tray/taskbar date display in Ubuntu with GNOME 3 I installed kali linux OS on my laptop.  The installation went well but when I booted in kali linux the screen was backwards. I signed in as root and the screen flipped back but the mouse is reverse (x &amp; y axis).  When I move my mouse left it moves right when I move it down it moves up. If I want to press a button at the upper right I need to press it at the down left.  The screen is acting backwordes (x &amp; y axis)but I see the graphics straight and the mouse is acting backwordes.  I installed kali linux again with a fresh installation. I have the same problem as before.  I installed kali linux again with a fresh installation. I have the same problem as before.   I searched the web And I don't find information on a problem like this Adjectives and nouns to describe an answer that doesn't answer the question? I am revising for an exam and have just realised that the euclidean algorithm questions in past exams are much harder than in homeworks! So i need some help please.  I have a question here, i already have the solution to it but i dont understand it that well, so i would like someone to please explain what is going on ect, and dont worry about avoiding giving me the full solution as i already have it so a full solution would be good!  Here is the question:  Use euclids Algorithm to find $gcd(172,20)$.  Hence solve $172a + 20b = 1000$ giving all solutions in terms of parameter t. List any solutions for which $a,b&gt;0$.  So it wants the answers in terms of parameter t, which is something i am not familiar with and cannot find in my books.   I have the solution in the solutions paper as   $$172= 8\times20+12 $$ $$20=1\times 12 + 8$$ $$12=1 \times 8 +4$$ $$8=2\times 4+0$$  thus $gcd(172,20)=4$  then   $$4= 12-8=12-(20-12)=2\times 12 - 20$$  $$=2\times(172-8\times20)-20$$  $$=2 \times 172 -17 \times20$$   multiplying by 250 we get   $$1000=500 \times 172 -4250 \times 20$$  so one solution is $a=500, b=-4250$  So, I understand everything up until here!!  Now it says,  Generally, $$a=500-t \frac{20}{4}=500-t$$            $$b=-4250+t \frac{172}{4}=-4250+43t$$  To have $a,b&gt;0$, we need $$500-5t&gt;0, (100&gt;t)$$ to have $a&gt;b$ we need $$-4250+43t&gt;0,(t&gt;98.8)$$$  Need $t=99$, $a=5$, $b=7$  Could someone please help explain what is going on in this last bit of working out? I am pretty good at euclidean algorithm usually but havent seen this type before an am panicking  bit as so close to exam! Any help appreciated how to find t and the other positive solutions would be great!  Please could you show me exactly how it is done here as my lecturer is quite strict with us using his exact methods. Many thanks Why does cout print char arrays differently from other arrays? Difference between the use of "a" and "any" in these examples? I didn't have an idea.      I did not have any idea.   I am much more familiar with the second one. The first one sounds a bit odd to me, but sounds fine if I say:     I did not have even an idea.   But, the first one is also one of the widely used sentences by natives. What is the difference between the two? Ok, I have to admit, I don't really delve too deep into the semantics of the spatial operators list below, I'm more of a user, I write software to drive the SQL most of the time and don't really think about it too much.  However, I have a situation where a spatial operation I'm doing is going dog slow, on a table that has great indexes on and has never caused a problem before now.  As a result, I'm trying to figure out which of the following is my best bet to use, that will give me the best performance, however, sometimes I find my searches don't return anything when I know they should, and sometimes return stuff when they shouldn't.  SO I'm reaching out, to ask if some one can give me the actual definition, such as criteria to match, fully within enclosing geometry, or within outer ring etc etc of each of the following operations:  Equals(Geom1, Geom2):int Disjoint(Geom1, Geom2):int Touches(Geom1, Geom2):int Within(Geom1, Geom2):int Overlaps(Geom1, Geom2):int Crosses(Geom1, Geom2):int Intersects(Geom1, Geom2):int Contains(Geom1, Geom2):int Relate(Geom1, Geom2):int   If you can give a concrete example of when they will and will not match too, that would be great.  For reference, I'm searching on a table of Linestrings, using a rectangular polygon, rotated to be pointing in the direction of travel (It's part of a traffic managment app)  For further reference, here is a sample of the SQL the app generates to perform a search:  SELECT recordID,AsBinary(geometry) AS geometry,Distance(GeomFromText('POINT(-1.84101 54.85078)',4326), geometry) AS distanceFromGps FROM linegrid WHERE Intersects(GeomFromText('POLYGON ((-1.8413149820810311 54.850782468607292, -1.8409507853094111 54.850952257034713, -1.8408279009723911 54.850864894077496, -1.8411920982612455 54.850695105650068, -1.8413149820810311 54.850782468607292))'), geometry)   You can see in this example I'm using intersects trying the others as mentioned doesn't quite give the results I expect, hence why I'm asking the question.  Please note, I'm not particularly bothered about actual faster/other ways of doing this at the moment, BUT if you do happen to spot a better way do feel free to shout up :-)  For now all I'm mostly trying to understand is the differences between each of the operations.  As for doing it faster/better I intend to open a different question for that at a later date.  For more reference, the Spatial engine this is working against is Spatilite 2.3.0, and I can't upgrade it due to the devices it's running on not having a more up to date build for it (Windows CE)    I'm going to choose mintix'es answer here as that provided a super easy to understand grid and description of all the various operations, which answered my question.  I'm still faced with getting performance on the routines up, but I do now have a few strategies to try on that one, I may still seek advice here from the group with regards to that.  @Vince deserves some credit too, as that white paper is definitely the definitive answer, but it's also quite challenging to read (I had to read through it several times) , for anyone wanting the real I am on these operations The Clementini paper is the way to go, if you need an easy to understand overview while developing solutions however, the FME link should be open in another browser tab. I am trying to prove the following.  Proposition Let $g$ be a Lie algebra such that the first derived algebra $Dg$ is a proper ideal of $g$. Consider the quotient $g/D^1 g$, and show that the preimage of any codimension 1 subspace is   an ideal, and has codimension 1.   I could show that the preimage is indeed an ideal, but I need some help with the part about the dimensions:  So suppose that $\phi: x \mapsto [x]$ is the quotient projection. And write $[h] + Dg$  for a codimension 1 subspace of $g$ (here $h\subset g$). Then the preimage of this subspace is just the linear span $h+Dg\leq g$. Let $y+z \in h+Dg$ with $y\in h$ and $z\in Dg$. Let $x\in g$. We want to show that $[x, y+z]\in h$, ie that $h + Dg \lhd g$. We can write $x$ as $x_0+x_1$ for $x_0 \in Dg$, $x_1\not\in Dg$. Then  $$[x,y+z] = [x_0, y+z] + [x_1, y] + [x_1,z] \in h + Dg$$  The inclusion follows since $Dg$ is an ideal so the first and third terms belong $Dg$; and $[x_1, y] \in D_g$, as $g/Dg$ is abelian. Whenever I add a Quick Smoke effect, I can't preview it on the viewport unless I bake it.   And Yes, I added the Smoke Domain on the object.   I've seen tutorials like this  and this  that clearly shows the possibility of previewing the smoke before baking it.   I'm using Blender on a Mac with AMD GPU. I would guess that this is something related to OpenGL, as thoroughly explained here -  but that's for Windows.   Does anyone have any idea how to fix this? @class vs. #import It is to my understanding that one should use a forward-class declaration in the event ClassA needs to include a ClassB header, and ClassB needs to include a ClassA header to avoid any circular inclusions. I also understand that an #import is a simple ifndef so that an include only happens once.  My inquiry is this: When does one use #import and when does one use @class? Sometimes if I use a @class declaration, I see a common compiler warning such as the following:     warning: receiver 'FooController' is a forward class and corresponding @interface may not exist.   Would really love to understand this, versus just removing the @class forward-declaration and throwing an #import in to silence the warnings the compiler is giving me. Which is stronger, a rope without knots or a rope with knots? Suppose I have two identical ropes, one of which I manually tie some knots in. If I use them to hang clothes, which one is more durable?      Personally I think that rope with knots will be more durable, but I can't come up with a satisfactory reason.