I wish to present my education for a potential employer. If I had the chance to phrase a whole sentence, I would go for "I received my PhD from University X", as suggested in other answers to related questions. However, the information needs to be put in bullet point style. I am not sure about the correct preposition here. My thoughts:   PhD at University X   or   PhD from University X   Please not that this information is not connected to a date (as in "2012: PhD from University X"), merely the fact that I earned a PhD is listed.  Thanks for your help in advance!
I would like to know what is the preferred way to indicate that I took a degree in some subject while also naming the place where I obtained the degree from:   I got my master's degree from the University of Somewhere; I got my master's degree in the University of Somewhere; I took my master's degree in the University of Somewhere.   I would say that "in" is more suitable to mention the particular subject (a degree in maths, for instance) than to indicate the place, but I still have doubts.  By the way, is it a "master's degree" or a "Master's degree"?
International TLD's vs. duplicate content I currently work at a pretty big website that has visitors from around the globe. My job is to help out on the SEO, and one thing we've been discussing lately is the use of international TLD's. The ones we use range between:   (partly) translated websites like .es and .de that serve most of the content in the country's language non-translated (english) websites for non-english languages (due to a lack of translations) like .ro and .cz english websites for english speaking countries with localized TLD's (.co.nz, .co.uk)   On one hand I really have the feeling this is causing a lot of duplicate content, especially for the last two categories of TLD's.   On the other hand though it seems a lot like country-specific TLD's tend to score a lot better in that country's Google. Would it be advisable to keep on using these domains, or should we canonicalize them all to the .com version? Perl - Package/Module Issues How to enable multiple logon remote desktop in Windows 7 Executing user-supplied ruby code on a web server Eclipse doesn't start on Ubuntu 18.04 I installed eclipse via Ubuntu Software. When I start it, it take some seconds and then comes an error window showing the path of the error.  The following is the .log file:  !SESSION Wed May 02 12:53:28 BRT 2018 ------------------------------------------ !ENTRY org.eclipse.equinox.launcher 4 0 2018-05-02 12:53:28.587 !MESSAGE Exception launching the Eclipse Platform: !STACK java.lang.ClassNotFoundException: org.eclipse.core.runtime.adaptor.EclipseStarter     at java.base/java.net.URLClassLoader.findClass(URLClassLoader.java:466)     at java.base/java.lang.ClassLoader.loadClass(ClassLoader.java:566)     at java.base/java.lang.ClassLoader.loadClass(ClassLoader.java:499)     at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:626)     at org.eclipse.equinox.launcher.Main.basicRun(Main.java:584)     at org.eclipse.equinox.launcher.Main.run(Main.java:1438)     at org.eclipse.equinox.launcher.Main.main(Main.java:1414)   What is the problem and how can I fix it? Change the title size in scrartcl I'd like to use a smaller title. I'm using the scrartcl documentclass from the . I can change it's color font but not it's size.  \setkomafont{title}{\normalfont\bfseries\small}   Everything works exept the size. Atlas generation for different extents How do I repeat a theorem number? Often in my papers I want to mention theorems in the introduction that are introduced in more detail and proved in a later section.  I'd like to include the statement of these theorems twice over, each time numbered as the theorem would naturally appear in its later section.  My current solution (using amsthm) is, e.g.  %(in the introduction) \newtheorem*{thm:associativity}{Theorem \ref{thm:associativity}} \begin{thm:associativity} Lorem ipsum ... \end{thm:associativity}  %(in a later section) \begin{thm} \label{thm:associativity} Lorem ipsum ... \end{thm}      Can anyone think of a cleaner solution? Where can the last FSTrim be seen as successful or not? (log files) I recently installed an SSD and AFAIK Ubuntu makes a weekly FSTrim on SSD's that support it.  Is there a log file of this trims? CSS Margin Collapsing So essentially does margin collapsing occur when you don't set any margin or padding or border to a given div element? What is the best way to flatten a linked list with lists as values? Let $f(z)$ be an entire function whose real part is bounded by a polynomial in $|z|$. Does it follow that $f(z)$ is a polynomial?  Or, without loss of generality and more suggestively $$(f(z)=\sum_{k=0}^\infty a_k z^k \quad \land \quad \operatorname{Re}(f(z))\leq |z|^n)\quad \forall z\in \mathbb{C} \qquad \Rightarrow \qquad f(z)=\sum_{k=0}^n a_k z^k \quad\forall z\in \mathbb{C}$$ On proving that a finitely generated group has a finite number of subgroups with index $n$. Theorem: If $G$ is a finitely generated group, then it has a finite (maybe zero) number of subgroups of index $n$ for any $n\in \mathbb{N}$.   is a sketch of a proof. It consists of assuming such a subgroup $H$ exists, and allowing $G$ to act on $G/H$ by left multiplication. Such action defines a homomorphism $$\phi :G \rightarrow \text{Sym}(G/H)\cong \mathbb{S}_n$$  If $G=\langle g_1, \ldots ,g_r\rangle$, then the homomorphism is uniquely determined by where it sends the generators $g_i$. In particular, there are at most $(n!)^r$ such homomorphisms.  The last step of the proof requires one to notice that a different subgroup $H'$ of index $n$ in $G$ would produce a different homomorphism, and here is where I'm struggling. I've been able to show that $\text{ker}(\phi )=\text{core}(H)$, yet haven't been able to rule out the possibility of $\text{core}(H)=\text{core}(H')$. Prove that $\sum_{n=0}^\infty \frac{(-1)^n}{3n+1} = \frac{\pi}{3\sqrt{3}}+\frac{\log 2}{3}$ Prove that $$\sum_{n=0}^\infty \frac{(-1)^n}{3n+1} = \frac{\pi}{3\sqrt{3}}+\frac{\log 2}{3}$$   I tried to look at $$ f_n(x) = \sum_{n=0}^\infty \frac{(-1)^n}{3n+1} x^n $$  And maybe taking it's derivative but it didn't work out well.  Any ideas? "Do you want to continue[Y/n]?" Why the upper case? I am new to Ubuntu and some little thing start to bug me. Such as when trying to install a program, Ubuntu asks,     Do you want to continue[Y/n]?   What is bugging me is why the letter "Y" is upper case and "n" is lower case. Do they have any significant reason why one is upper and the latter is lower? Whatever case I enter it doesn't change the outcome: it either continues or not. Are they trying to notify us that we can enter both and it won't change anything? Show that if $f(z)$ is an entire function such that it takes real values on the lines $Im(z)=0$ and $Im(z)=a$ (for some $a \in \mathbb{R}_{\neq 0})$, then $f$ is periodic with period $2 i a$.    So here is my thought process: First of all by reflection principle $f(\bar{z})=\overline{f(z)}$ so if our function $f$ is given in the strip $0 \leq Im(z) \leq a$, then its values on $-a \leq Im(z) \leq a$ follow by reflection principle. Then by imposing $f(z)=f(z+2 ia)$ we can intuitively see that this will define an entire function by looking at how the strips $na \leq Im(z) \leq 2na$ seamlessly stack on top of each other. Is this logical? And how would one prove this analytically? Print file content without the first and last lines How to draw simple table Notify-send ignores timeout? Maybe I'm doing something wrong, but shouldn't the commands (run separately) notify-send -t 1 &quot;test&quot; notify-send -t 1000 &quot;test&quot; notify-send -t 10000 &quot;test&quot;  have different timeouts? The first being nearly instantaneous, the second taking 1 sec and the third 10 seconds? In all cases it seems to take about six seconds for me. Is there a way around this behaviour? As the developers label this as a &quot;feature&quot; instead of a bug, I would like some alternatives. I have been looking at this for hours and it isn't making anymore sense than it did in the first hour.   If $a$ und ${x_{0}}$ are positive real numbers and ${x_{k}}$ defined as follows, prove that ${x_{k}}$ is monotone decreasing and bounded, then calculate the limit.  ${x_{k}} = \frac{1}{2}\left({x_{k-1}+\frac{a}{{x_{k-1}}}}\right)$  What I though I had to do was pick an ${x_{0}}$ and solve for ${x_{k}}$, so I picked ${x_{0}}$. Then I wanted to put the result back into the function to get ${x_{k+1}}$, which I still believe is what I'm supposed to be doing, but I don't understand what I am getting as a result.  I get that I should prove it is decreasing, then that it is bounded,  then address the limit, but the how is missing.