G-streamer, what is it?  How can I determine if it is already installed?  I've already looked in the obvious places - where and how do I get it?
I'm a bit confused about what Gstreamer does.   Does it come installed by default with Ubuntu ?  If so which version  is the default for 14.04?  Does it provide hardware accelerated video playback (decoding) ?   If so does it work with VA-API and VDPAU or is it an alternative to those?    Thanks for your help
Use a partitioned live usb I have a USB device and i'm trying to create it in a way that it has 2 partitions: one for a live linux disc and the other for document storage.  I created the partitions using gparted and and set a boot flag to the one I want to use as the live disc. Now, I have a usb like this:  Disk /dev/sdc: 14.6 GiB, 15623782400 bytes, 30515200 sectors Units: sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disklabel type: dos Disk identifier: 0xc3072e18  Device     Boot   Start      End  Sectors  Size Id Type /dev/sdc1       8439808 30515199 22075392 10.5G 83 Linux /dev/sdc2  *      51200  8439807  8388608    4G  b W95 FAT32   I then used dd to flash an Ubuntu iso to /dev/sdc2  sudo dd if=/dev/shm/ubuntu-17.04-desktop-amd64.iso of=/dev/sdc2 bs=4M   When the disc is flashed onto the usb drive, I try to boot from my laptop and it shows "Operating system not found". When i try to use qemu/kvm, it shows a kernel panic like this:    How would I be able to do this properly? Using 3rd party Python modules Find roots of $3^x+x^3=17$ Find $x$ in the following equation: $$3^x+x^3=17$$ Proving bessel identity $[J_0(x)]^2 + 2[J_1(x)]^2 + 2[J_2(x)]^2 + \cdots = 1$ and $|J_0(x)|\le 1$ The generating function for a Bessel equation is:      $$g(x,t) = e^{(x/2)(t-1/t))}$$      Using the product $g(x,t)\cdot g(x,-t)$ show that:      a) $$[J_0(x)]^2 + 2[J_1(x)]^2 + 2[J_2(x)]^2 + \cdots = 1$$      and consequently:      b)      $$|J_0(x)|\le 1, \forall x$$      c) $$|J_n(x)| \le \frac{1}{\sqrt{2}}; n=1,2,3,\cdots$$   For a) I tried the product:  $$e^{(x/2)(t-1/t))}\cdot e^{(x/2)(-t+1/t))} = 1$$  I at least arrived at the right side of the equation. Since this generates the bessel functions, I should arrive at something related to $J_n$ in the left side. I know that  $$e^{(x/2)(t-1/t))} = \sum_{n=0\infty}^{\infty} J_n(x)t^n$$  $$e^{(x/2)(-t+1/t))} = \sum_{n=0\infty}^{\infty} J_n(x)(-t)^n$$  but it's not just a matter of multiplying coefficients from the two infinite series, right?  For $b$, I tried to use  but it's not as obvious  I have no idea how to deal with $c$, could somebody help me? I was watching some videos on YouTube showing how to get the Duke O' Death in GTA 5, however what I have seen is sort of unclear.  Some people say you must be a returning player on GTA 5 to get it (what does this mean too BTW?), some people don't say that. Some people say you have to be Trevor, some people don't. Some say the time of day matters, some don't. And apparently you can buy it from Warstock website (I can't).   Can someone please tell me how to get it?! GTA 5 came with my PS4 (I didn't play it on PS3) if that helps. wp_get_nav_menu_items order doesn't work How to remove uninstalled snaps from cache? I'm working on this problem already, the domain and co-domain are the set of Rational Numbers. we see that setting $x = 1$ and $y = n$, we obtain $f(n + 1) = f(n) + 1$  But I'm trying to prove that $f(n) = n + 1$ for all $n$, the case when $n = 1, 2$ is obviously true, how do I approach this via induction? How to prevent SIGPIPEs (or handle them properly) I'm training a neural network but the training loss doesn't decrease. How can I fix this?  I'm not asking about overfitting or regularization. I'm asking about how to solve the problem where my network's performance doesn't improve on the training set.    This question is intentionally general so that other questions about how to train a neural network can be closed as a duplicate of this one, with the attitude that "if you give a man a fish you feed him for a day, but if you teach a man to fish, you can feed him for the rest of his life." See this Meta thread for a discussion:   If your neural network does not generalize well, see: natbib: combining chicago style and sorting by appearance What program can be used to package software into one executable? Why do return flight costs vary depending on the country of origin? Why is the voltage across a capacitor and the current across an inductor continuous? Why is the voltage across a capacitor (as a function of time) continuous? Why is the current across an inductor (as a function of time) continuous? The classical book on commutative algebra Introduction to Commutative Algebra, by Atiyah and Macdonald, has the following as exercise I.11.       A ring is Boolean if $x^2=x$ for any $x$ of $A$. In a Boolean ring $A$, show that     i) $2x=0$ for all $x\in A$;    ii) Every prime ideal of $A$ is maximal, and its residue field consists of two elements;   iii) Every finitely generated ideal of $A$ is principal.     I can but solve the first two of them; for the last one, I cannot even perceive the situation here, for it will not, generally speaking, be a Dedekind domain, whereof my knowledge is somewhat more. I have hitherto tried to find one element for each ideal of two generators which can stand the stead of them, and then proceed by induction. But even the first step fails to produce any result. Thanks for any hints and inspirations in advance. prove that $\mathbb{Q}^n$is dense subset of $\mathbb{R^n}$ Prove that $\mathbb{Q}^n$is dense subset of $\mathbb{R^n}$ using the fact that $\mathbb{Q}$ is dense subset  of $\mathbb{R}$  I know that $\mathbb{Q}$ is dense subset  of $\mathbb{R}$ That is, between any two real numbers, there exists a rational number  then how to prove that $\mathbb{Q}^n$is dense subset of $\mathbb{R^n}$ Now that Unity is gone, the usual way of setting a Compose Key (via Keyboard Preferences > Layout) no longer works (because in Ubuntu 18.04, Devices > Keyboard has no Layout tab).  How do we set a Compose Key in Ubuntu 18.04 Bionic Beaver? I'm trying to access an XML file within a jar file, from a separate jar that's running as a desktop application.  I can get the URL to the file I need, but when I pass that to a FileReader (as a String) I get a FileNotFoundException saying "The file name, directory name, or volume label syntax is incorrect."  As a point of reference, I have no trouble reading image resources from the same jar, passing the URL to an ImageIcon constructor.  This seems to indicate that the method I'm using to get the URL is correct.  URL url = getClass().getResource("/xxx/xxx/xxx/services.xml"); ServicesLoader jsl = new ServicesLoader( url.toString() );   Inside the ServicesLoader class I have   XMLReader xr = XMLReaderFactory.createXMLReader(); xr.setContentHandler( this ); xr.setErrorHandler( this ); xr.parse( new InputSource( new FileReader( filename )));   What's wrong with using this technique to read the XML file? "How are" or "How is" the wife and kid? Prove if $a\mid b$ and $b\mid a$, then $|a|=|b|$ , $a, b$ are integers. Form the assumption, we can say $b=ak$ ,$k$ integer, $a=bm$, $m$ integer.  Intuitively, this conjecture makes sense. But I can't make further step.