We are moving a large codebase from GDI to QPainter. One thing we used to get on Windows easily was the EMF clipboard format, which enabled customers to manipulate their pasted output in other programs (like Office) in a vector format.  It's easy for us to produce bitmaps from Qt into EMF, but that really doesn't give us back the editability of the old format. We can also make mime data from Postscript, which in some programs will retain vector format, but won't allow editability in Office, for example.  Since Trolltech/Nokia abandoned the GDI rendering path, is there any decent way to produce vector EMF output from QPainter? Options include 3rd-party libraries postprocessing other output formats (which we haven't seen usable results from), phony printer drivers (which introduce Windows-version specific issues). It has to work on WinXP -> 7.  Has anybody else solved this?
I want my Qt application to be able to save simple vector graphics to clipboard in a compatible way. On windows I want to be able to paste the graphics into Microsoft Word or Powerpoint. On Linux I want to be compatible with the Open Office.   Which format would you recommend? Can Qt generate EMF in an easy way? Is SVG an option?  Update:  My current plan is to add a piece of native win32 code to render the graphics to emf on windows. This code will not be available on linux.
I found the following question about compactness:     A set $S\subseteq \mathbb{R}^n$ has the following property:   if a sequence of $S$ has exactly one accumulation point in $S$, then it converges in $S$. Prove that $S$ is compact.    We know that in $\mathbb{R}^n$ compact sets correspond to closed and bounded sets.   (1) I am trying to prove that $S$ is closed. The condition in the question says if a sequence of $S$ has an accumulation point in $S$ then it converges in $S$. I think instead the condition should be if a sequence of $S$ has an accumulation point( in $\mathbb{R}^n$, not necessarily in $S$ )then it converges in $S$.  Am I correct?  (2) How to prove that $S$ is bounded?  P.S. I have made an edit (there is exactly one accumulation point).  Source of the question:  of this problem set. Reading Photoshop PSD Files with Layers (There are a few existing questions on Photoshop alternatives, but none seem to focus on reading PSD files specifically)  Say I'm a programmer working with a web designer and would like to implement a design she's produced as a PSD file using Photoshop. It's a fairly complicated design using overlays/animating layers, so the ability to examine the PSD file and turn individual layers on and off is necessary.   Is there an app available in Ubuntu that can read PSD files created by Photoshop?  Alternatively, is there a more linux-friendly file format that Photoshop can export to and still preserve layers? In a theoretical physics homework problem, I have to show the following: $$\partial_\nu T^{\mu\nu} = - j_\nu F^{\mu\nu}$$  Where $T$ is the Energy-Momentum-Tensor, $j$ the generalized current and $F$ the Field-Tensor. We use the $g$ for the metric tensor, I think in English the $\eta$ is more common.  I know the following relationships:   Current and magnetic potential with Lorenz gauge condition: $$\mathop\Box A^\mu = \mu_0 j^\mu$$ Energy-Momentum-Tensor: $$T^{\mu\nu} = \frac1{\mu_0} g^{\mu\alpha} F_{\alpha\beta} F^{\beta\nu} + \frac1{4\mu_0} g^{\mu\nu} F_{\kappa\lambda} F^{\kappa\lambda}$$ Field-Tensor: $$F^{\mu\nu} = 2 \partial^{[\mu} A^{\nu]} = \partial^{\mu} A^{\nu} - \partial^{\nu} A^{\mu}$$ d'Alembert operator: $$\mathop\Box = \partial_\mu \partial^\mu$$ Bianchi identity: $$\partial^{[\mu} F^{\nu\alpha]} = 0$$   So far I have set all the definitions into the formula I have to show, but I only end up a lot of terms from antisymmetrisation and product rule. I also drew all what I have in , but I still cannot see how to tackle this problem.  Could somebody please give me a hint into the right direction? Subdomain versus subdirectory Why do rain waves form and what is their connection to the texture of the surface they're on? When it rains and water flows down an inclined street, ripples may form that are carried along with the current. Here's a picture with an example of what I'm talking about    I'd like to know what the fluid mechanical mechanism is for the formation of these waves. A quick google search reveals that they've been identified in some scientific literature as "rain waves" (if you have a jstor subscription you can see ) but I've only been able to find phenomenological descriptions of their properties without any details of the physics giving rise to them. In particular, I'm curious if people think that the surface on which the water is flowing must have a particular texture in order to give rise to the waves. Context: I prepare my scientific documents using LaTeX and compile to a PDF. I often need to seek comments on drafts from collaborators who do not use LaTeX. Most of these collaborators use Windows OS. Assume also that the collaborator does not need to edit the document.  They only need to be able to add comments to the document. Most would be familiar with the commenting system in MS Word, for example. I'd like to be able to give the collaborator some clear instructions about what software and system they should use to comment on the draft.  This should involve free software and an easy to use interface.  Question: What is a good strategy for getting comments on draft documents when the collaborator does not know LaTeX?  Initial thoughts: I know Adobe professional allows you to add comments to a PDF.  However, some collaborators don't have this software and it costs money.  I could send the raw LaTeX to the collaborator. However, given all the markup, the collaborator may find LaTeX source a bit mysterious.  UPDATE: After posting I noticed  to a similar question. Along with a number of other good tips (such as printing and getting paper comments), he mentions jarnal, xournal, and gournal as free cross-platform PDF annotators. I'd be curious to know whether experts have found them adequate for the above mentioned purpose and whether any of them are to be preferred. Others mention FoXIt. And yet others discuss the option of exporting to MS Word or Open Office and using the reviewing system within these programs. In English, words with a 'g' followed by a front vowel (e, i, y) can be pronounced with a soft g or a hard g:   Words with Germanic roots are usually pronounced with a hard g: gear, get, gift, give Words with Latin and Greek roots are usually pronounced with a soft g: gem, general, giraffe, giant   But how should a purely English word (if such thing even exists) with a 'g' followed by a front vowel be pronounced? In other words, if an English speaker saw a new word of unknown origin (eg: a neologism) that starts with gi- or ge-, how would they pronounce it? “I saw a dog” vs. “I have seen a dog” I saw a dog.       I have seen a dog.   What are the differences between them? Did these events happen on the same day? How to delete column/field in PyQGIS? Pass shell variable as a /pattern/ to awk I've been perusing the internet looking for interesting problems to solve. I found the following problem and have been going at it for the past 30 minutes with no success:     Find a function $f: \mathbb{R} \to \mathbb{R}$ satisfying $f(f(x)) = -x$ for all $x \in \mathbb{R}$.   I am also wondering, can we find $f$ so that is continuous?  I was thinking of letting $f$ be a periodic function, and adding half the period to x each time. I had no success with this, and am now thinking that such a function does not exist.  Source: Why does the version of Java verified by Oracle differ from the version shown at the command line? Questions  Why do versions differ?   Should we trust Oracle's verification routine?    In some cases, the  is different from the version shown at the command line.   Example    That example, in detail  According to Oracle in the browser:    Java 7 Update 9   According to the Java Console:   Java Plug-in 10.9.2.05 Using JRE version 1.7.0_09-b05 Java HotSpot(TM) 64-Bit Server VM   According to the java command:   sh-3.2$ java -version java version "1.8.0-ea" Java(TM) SE Runtime Environment (build 1.8.0-ea-b58) Java HotSpot(TM) 64-Bit Server VM (build 25.0-b02, mixed mode) How to get ASCII value of string in C# I want to get the ASCII value of characters in a string in C#.  If my string has the value "9quali52ty3", I want an array with the ASCII values of each of the 11 characters.  How can I get ASCII values in C#? Show that $8 \mid (a^2-b^2)$ for $a$ and $b$ both odd Using the affine linearized polynomial $f(x)=x^p-x-b$ is irreducible over $\mathbb{F}_q$ if and only if $\operatorname{Tr}_{\mathbb{F}_q/\mathbb{F}_p} \neq 0$. But here $\mathbb{F}_3$ is not a field extension of $\mathbb{F}_5$.  Also we have that: Let $a \in \mathbb{F}_q$ and let $p$ be the characteristic of $\mathbb{F}_q$. Then the trinomial $x^P - x - a$ is irreducible in $\mathbb{F}_q[x]$ if and only if it has no root in $\mathbb{F}_q$. How to implement "select all" check box in HTML? How to NOT show keyboard layout chooser popup when changing language in GNOME 3 Proof of Young's inequality The following problem is from Spivak's Calculus.  Suppose that $f$ is a continuous increasing function with $f(0)=0$. Prove that for $a,b \gt 0$ we have Young's inequality   $$ ab \le \int_0^af(x)dx+\int_0^bf^{-1}(x)dx$$, and that equality holds if and only if $b=f(a)$.  It is enough to consider the case $f(a) \gt b$, and show that the strict inequality occurs in this case.  I've tried proving this using the theorem  $$ \int_a^bf^{-1}=bf^{-1}(b)-af^{-1}(a)-\int_{f^{-1}(a)}^{f^{-1}(b)}f$$  but I got stuck along the way.   How may I show this rigorously using the definition or properties of integrals? Any hint, suggestions or solutions would be appreciated. Code block is not properly formatted when placed immediately after a list item Which of the following sentences is/are incorrect? ("Permit" vs. "allow" vs. "let") Which of the following sentences is/are incorrect? Why?   The visa permits you to study for two months. My father would never allow me to study English Let me to go. You're hurting me.   This is question from an English learning book. All the sentences seem right to me. Do you know which one is incorrect and why?