How can I copy a cd into my computer? I tried extract juicer but it doesnt have the mp3 option and when i choose another it brings the cd but when i put extract it doesn't do it. how can I do this, is it posible in ubuntu as in windows. or itunes to just extract tracks directly into your computer without having to burn a cd? thanks in advance for your help.
What are some CD ripping programs for Ubuntu? Can you list the Pros? What are the Cons? For each program there should be a screenshot, sources to install, and instructions to install and use.
Prove that $f_n$ converges uniformly on $\mathbb{R}$ How do I deploy an OpenStack cloud with Juju? I'd like to get a test cloud up and running in preparation for a possible deployment of 12.04. I messed with the UEC a bit, but have had a much harder time finding anything helpful as a primer for the new stack. There is generic documentation on Diablo, but there are likely to be a lot of pieces already handy in Ubuntu that a specific guide could save time with.  Also, as much as I would love to, my budget doesn't include the $4-6k to get a small cluster running with the Canonical support. What does `invalid initialization of non-const reference` mean? Thought Experiment - Poking a stick across a Black Hole's Event Horizon php/mysql - foreign characters Prove $\vdash \neg(\square F\land p)$ in $KD$ Format timedelta to string Programmatically disable apt unattended upgrades How can I programmatically/script disable apt unattended upgrades? Running Ubuntu 16.04. Which process scheduler is my linux system using? I'm not quite sure if stackoverflow or serverfault is the forum to use for this question, but ill try here.  Is there some command I can use or a file I can check in order to find out which process scheduler I'm using on my Linux system? I am not looking for the I/O scheduler, but the process scheduler, and please, do not refer to guides or howtos for what a scheduler is, what I'm simply asking is if there is a command or file I can run/check to see this. I could check the doc for my kernel but again I'm just wondering if there is a command or file i can check.  I might have been a little redundant above but that's because the posts I've seen people seem to confuse process scheduler with the i/o scheduler, and they don't seem to answer the actual question, just provide links to what a scheduler is which is not what I'm after here, so apologies if the above comments sounded rude. "Member for: today" Very new members will have this text displayed in their profile:    Should this not be changed to say "1 day" or "3 hours", etc? Especially as the "last seen" also works in this way.  Note that members who joined 24 hours ago have been members for "2 days", etc.  You'd say "x has been a member for 1 day" over "x has been a member for today"; saying "member for today" just doesn't feel right to me. Can I disown my heir? Everything was perfect. I have a good and young ruler, who has passed on some good genes to his sons. I also had a lot of spare lands, so I could make my heir a duke and doubly count when he came of age.  My mistake was to marry him off to some scheming wench. I knew it would end like this, but her stats were just too great to resist!  Anyway, a few years down the road, and my trusty spy master lets me know that my beloved son is looking to usurp me. Not cool! I demand that he end the plot, and decide to see how this develops.  Shortly thereafter, he suddenly dies (not by my hand — likely the wife is the culprit). My second eldest son becomes my new heir and favourite, however all the titles are inherited by my clubfooted grand daughter aged two. Curses!  Now, what I really wanted, was to imprison and disown my traitorous son followed by swift justice of the axe. Not sure what my other vassals would think of that idea, but I had a just reason for imprisonment at least.  Option number two, is to start plotting for my dearly beloved grand daughters untimely demise, but I'm not sure how that would work out either.  The situation is this. I'm young (40ish) and well-liked. I have a new heir, but I'd prefer to keep my lands for myself and give him the ones of the previous heir — one duchy and two counties currently held by my grand daughter. The duchy can be revoked free of charge, as I hold a claim to it. She has no siblings. I am da King. I have limited crown authority, but can bump it up to medium if it suits me.    So my questions to you are as follows:   Is it possible to disown a son, considering I have just cause for imprisonment? An execution would of course settle the deal, but my other vassals would probably find me "cruel". Is it possible to plot against a character which is not yet of age? What would happen if she suddenly died with no heir? Would all her titles be returned to the king or duke (i.e. me)?   EPILOGUE I had savegames before and after, so I decided to test a few things.   I could imprison my quisling of a son. I could also seize all his titles and banish him from my lands, but he would remain an heir, even if he wasn't officially a prince. I guess I could have let him rot in jail, as it seems prisoners often die in custody, but it would be a risky bet. After the unfortunate death of my old heir, it seems some strange rules apply regarding the remaining titles. The dukal title I could simply revoke for free (although at a opinion penalty from the duchess). Should she die today, one of the counties would be inherited by her younger sister, and the other would be inherited by me.   I found this to be an interesting development: Turns out my new heirs wife suddenly died. Who did he marry, other than the same scheming hag who presumably killed off his brother, and made an attempt at me? By a suspicious coincidence, I died not very long after. Such is the effects of the deceitful and ambitious traits combined with a really dope intrigue stat. ;) Without appealing to the axiom of choice, it can be shown that (Proposition:) if $X$ is well-orderable, then $2^X$ is totally-orderable.  Question: can we show the stronger result that if $X$ is well-orderable, then so too is $2^X$?  Proof of Proposition. Pick any well-ordering of $X$. Then the lexicographic order totally orders $2^X$.  More explicitly: for any two $f,g \in 2^X$, define $f &lt; g$ iff   there exists $x \in X$ such that $f(x) \neq g(x)$, and if $x \in X$ is minimal such that $f(x) \neq g(x)$, then $f(x)=0$ and $g(x)=1$.   It can be shown that $&lt;$ totally-orders $2^X$. Animating Dynamic Paint with noise texture I will go to France from 17/12/13 – 19/12/13, then I will come back to London. And again I will go back to Portugal and Spain from 26/12/13 to 03/01/14 which I will stay in Spain for the longest period. However, the Spanish consulate told me that I have to request for the visa from the French consulate.  The point is: Do I need to apply for a visa for a single trip two times (from French and Spanish consulate) or a single visa for multiple time (from French consulate). When I choose the Connection Type in VPN Connections, I have only PPTP and I can't find OpenVPN, but I already installed it via terminal with the command sudo apt-get install openvpn easy-rsa  Why I can't find it? Convert bytes to a string Solving linear congruence (modular inverse or fraction) via gcd Bezout equation Isn't finding the inverse of $a$, that is, $a'$ in $aa'\equiv1\pmod{m}$ equivalent to solving the diophantine equation $aa'-mb=1$, where the unknowns are $a'$ and $b$? I have seem some answers on this site (where the extended Euclidean Algorithm is mentioned mainly) as well as looked up some books but there is no mention of this. Am I going wrong somewhere or is this a correct method of finding modular inverses? Also can't we find the Bézout's coefficients by solving the corresponding diophantine equation instead of using the extended Euclidean Algorithm? In version 5.2 of Apple's Pages app for OS X (Mavericks), how do I change the page layout? Prove or disprove: For every integer a, if a is not congruent to 0 (mod 3), the a^2 is congruent to 1 (mod 3) Prove or disprove: For every integer a, if a is not congruent to 0 (mod 3), the a^2 is congruent to 1 (mod 3)  SO this is for abstract algebra and I am really struggling with this. Here are some of the definitions and theorems I think would apply.  -an integer a divides and integer b if there is an integer q such that b=aq -Let a and b be integers, with a>0. Then there exist unique integers q and r such that b= aq+r and 0&lt;=r  The question says hint: use 2 cases but I'm not really sure what that means. I'm guessing it wants me to look at it when a is congruent to 0 and when it's not? so i tried to do that but just ended up stuck. below is as far as i got with that attempt  Proof: Case 1 There should be some information about letting variables exist in certain number sets here  assume a is not congruent to 0 mod 3, then 3 does not divide a-0, therefore a-0 does not equal 3q for some q in the integers  I was trying to get this to wind down to thus 3 divides a^2-1 but even tho it seems true (I couldn't find a counter example) I couldn't figure out how to prove it with what I have.  Next i tried reversing it thinking I could contradict it or something.  I think this would be case 2? assume a is congruent to 0 mod 3, then 3 divides a-0 and a-0=3q for some q in the integers, then 3q=a since 0 is the additive identity, therefore 3 divides a,  and again stuck and my brain hurts a little..  Can anyone help me figure out how to work this. Problems with Curve Modifier Every time I think I have the curve modifier mastered, it throws me a another curve ball (no pun intended).  Why in  can I not get the lights to follow the spiral curve? When the modifier is activated, the lights are stretched and distorted along the curve.  I created the curve by converting it from a mesh (string of verts). Why does it not display like a normal Bezier? Is that related to my problem?  I am following all the "rules" that I am aware of, as detailed here: . The curve seems to run in the correct direction. The origin point is at the first point of the curve. The curve modifier on the lights is set to -Y which is the local orientation of the curve's direction.  What am I missing?