It is probably a very "soft" question, but let me try.   It is customary to believe, that after a certain period of postdoctoral research a person should either establish him/her-self as a (permanent or tenure track) Faculty member, or leave academia for good, seeking employment elsewhere. The maximum "postdoc period" is of course not specified, and very country-- and area--dependent, but arguably it is around 8 years &mdash; for example, many fellowship programs invite applications from candidates with no more than 7-8 years of postdoc experience.  Consider a person with almost that many years of postdoc experience given a choice: either to pursue another postdoc position in a strong internationally recognized University (say, top-20 THE rating), or go for an independent Faculty position in a less recognized place (say, top-200 THE rating).  If you think that the choice here is obvious, I would very much like to hear your pro / contra arguments. The area is computational mathematics.
When it comes to getting a tenure-track position where one has both a lot of resources and academic freedom to do what one wants to do (so having a tenure-track position in a top university might be more useful because one may get more resources at a top university).   Or in short, when one wants to maximize one's chances of becoming a "top scientist".  There are obviously numerous factors, and "rank/prestige" should not be considered as a factor in itself. That said, the period after one gets a PhD is an extremely important time for building up connections, and those are easier to get at a top university.
Let $f$ be a complex function with the property that $f^{(n)} = 0$.  Does this imply that $f$ is a polynomial?  If so, why?  Upon thinking about this problem myself, I can easily observe that every $n$ degree polynomial satisfies $f^{(n+1)} = 0$.  Still, this doesn't show that some non-polynomial function couldn't also have this property. Boot screen in low graphics/text mode My ubuntu boot screen shows up in a strange low resolution, almost text mode, instead the usual and sleek white "ubuntu" over dark background. It's not a big issue because when GDM loads everything becomes ok, but If there's an easy way to fix it I would like to give it a try. How is the recommended next badge determined exactly? According to , the     "Progress to next badge" bar automatically selects the badge you're closest to earning (or that's most logical to go for next)   While "the badge you're closest to earning" is pretty easy to determine: it's the bar with the most progress, I'm wondering what "most logical to go for next" means. Because right now on Meta Stack Exchange, I can track two badges: Illuminator and Legendary. My progress for Illuminator is 66.40% and for Legendary it's 66.67%, yet Illuminator is shown as the recommended next badge:    On some child metas where I barely have any activity, Student is shown as recommended next badge with a progress of 0/1, but I do have cast some votes so I have a small progress towards e.g. Civic Duty. So obviously there is some other logic at work, but what? Markdown code snippets don't allow trailing spaces I'm trying to follow a line in a derivation for $P(Z&gt;X+Y)$ where $X,Y,Z$ are independent continuous random variables distributed uniformly on $(0,1)$.  I've already derived the pdf of $X+Y$ using the convolution theorem, but there's a line in the answer that says:  $P(Z&gt;X+Y) = \mathbb{E}[\ P(Z&gt;X+Y\ |\  X+Y )\  ]$ where $\mathbb{E}$ is the expectation.  I'm not familiar with this result. Could anyone give a pointer to a similar result if one exists?  Thanks. What conditions need to be fulfilled to enter the Schengen zone visa free? How can I show a leading + sign in siunitx S column? I'm using siunitx's S columntype to align numbers in a table. The numbers are percentage values which should all have a preceding sign (some - and some +).  The numbers with a "-" are shown with a sign, the "+" sign vanishes as siunitx processes the numbers.   How can I keep the sign of the numbers including the "+" sign? number of ways to make $2.00 How many different ways can you make $2.00 using only 1 cent, 5 cent, 10 cent, and 25 cent pieces, and 1 and 2 dollar bills (there are 100 cents in a dollar)? I have worked out an equation:  $$p + 5n + 10d + 25q + 100l + 200t = 200$$  Where all variables are non-negative integers. But I don't know what to do from here to figure out how many different sets of non-negative integers there are that satisfy this equation. What do I do next? I have a sword that currently rotates around a pivot point thats off of the actual object. Im new to blender and im not sure how i would go about changing it so that the sword rotates around the handle. Any help would be appreciated! svmono template and `\mathcal` Why, with Springer's  svmono template, do the letters written with the \mathcal font change? It seems that \mathcal becomes \mathscr.  Edit: Look at this image:    With the svmono template \mathcal returns the first alphabet and not the (classical) latter.  Here the packages I use in my document:  \documentclass[envcountsame,envcountchap]{svmono}  \usepackage{subfiles} \usepackage[utf8]{inputenc}  \usepackage{mathptmx} \usepackage[bottom]{footmisc} \usepackage{microtype} \usepackage{stmaryrd}    \usepackage{amsmath} \usepackage{courier} \usepackage{mathrsfs}  \usepackage{amssymb}  \usepackage[all,cmtip]{xy} \usepackage{faktor} \usepackage{graphicx} \usepackage{mathdots} \usepackage[colorlinks={true},linkcolor={blue},citecolor={blue}]{hyperref} \usepackage[frame,width=15truecm,height=23.5truecm,center]{crop}   With this settings I have the above strange behavior of \mathcal. How to prove $ \prod_{d|n} d= n^{\frac{\tau (n)}{2}}$ Execute command in remote active terminal How to Create Bootable Windows 10 image in Debian? Pseudocode but originally developed for Windows 7 iso file but applied for Windows 8 in the thread  but it does not work with Windows 10 iso  # https://rwmj.wordpress.com/2010/11/04/customizing-a-windows-7-install-iso/ # https://unix.stackexchange.com/a/312477/16920 $ dd if=../en_windows_10_x64_dvd.iso \     of=boot.img bs=2048 count=8 skip=734  $ mkisofs -o ../new-win.iso -b boot.img -no-emul-boot -c BOOT.CAT \     -iso-level 2 -udf \     -J -l -D -N -joliet-long -relaxed-filenames .   Unsuccessful output when run on Windows 10 image  dd if=/home/masi/Downloads/en_windows_10_multiple_editions_version_1511_x64_dvd.iso of=/home/masi/Downloads/boot.img bs=2048 count=8 skip=734 8+0 records in 8+0 records out 16384 bytes (16 kB) copied, 0.000392973 s, 41.7 MB/s    Some of the following fields have changed for the iso file used in dd   bs=2048 count=8  skip=734   How can you study which field values you can use for Windows 10 iso?  OS: Debian 8.5 64 bit Hardware: Asus Zenbook UX303UA Linux kernel: 4.6 of backports Related threads: ,  Motivation: I need Windows 10 to use Canon P-150 duplex scanner, but when I started my Windows, I got Error 0xC0000428 because Windows update has again broken things there and I use Windows otherwise so rarely; and I have no spare Windows left to make bootable media Will having multiple domains improve my seo? Lets say I have a domain already, for example www.automobile4u.com (not mine), with a website fully running and all.  The title of my "Website" says:    &lt;title&gt;Used cars - buy and sell your used cars here&lt;/title&gt;   Also, lets say I have fully SEO the website so when people searching for the term buy used cars, I end up on the second or first page.  Now, I want to end up higher, so I go to the google adwords page where you can check how many searches are made on specific terms.  Lets say the term "used cars" has 20 million searches each month.  Here comes the question, could I just go and buy that domain with the search terms adress, in this case www.usedcars.com and make a redirect to my original page, and this way when people search for "used cars", my newly bought domain name comes up redirecting people to my original website (www.automobile4u.com)?  The reason I believe this benefits me is because it seems search engines first of all check website adresses matching the search, so the query "used cars" would automatically bring www.usedcars.com to the first result right?  What are the downsides for this?  I already know about google spiders not liking redirects, but there are many methods of redirecting...  Is this a good idea generally? I want to achieve the exact same title page layout as the paper shown . For those that do not want to download the paper, the image of the title page is shown below:    The super-scripts indicating the authors doesn't have to be as shown in the example title page (e.g, a, b and c), other symbols are fine.  I am using the authblk package and know the general syntax such as:  \title{title of paper} \author[1]{author 1\thanks{details that goes into the footnote}} \author[1]{author 2\thanks{details that goes into the footnote}} \author[2]{author 3\thanks{details that goes into the footnote}} \affil[1]{university 1} \affil[2]{university 2} \renewcommand\Authands{ and } \maketitle  \begin{abstract} abstract goes here \end{abstract}   But I am not sure how to achieve the example title page shown. Any help would be appreciated! Why is method overloading and overriding needed in java? How to add CC to a webform email? I recall in at least two episodes of Star Trek ( from the original series and  from The Next Generation) that there is reference to and contact with species from external galaxies.  By the 29th century, we see that timeships exist.  My question is, is there any reference to intergalactic relations in Star Trek in the future (say, by the 29th Century), or does the Star Trek Universe stay in the Milky Way Galaxy? $g^\frac{p-1}{2} \equiv -1 \ (mod \ p)$ Let $p$ be an odd prime, and let $g$ be a primitive root modulo $p$. Prove that $g^\frac{p-1}{2} \equiv -1 \ (mod \ p)$.  I've seen this solution on the math stack exchange but most of the solutions use quadratic reciprocity. Unfortunately, I skipped that section because it seemed very hard, but the proof that  $g^\frac{p-1}{2} \equiv -1 \ (mod \ p)$ seems easy with it.  Is there another way to solve this This question is proposed in the chapter of Finite Abelian Groups.  DEF:In elementary number theory, an integer $g$ is called a primitive root for the modulus $n$ if $\mathbb{Z}_n^\times$ is a cyclic group and $[g]_n$, is a generator for $\mathbb{Z}_n^\times$. Replacing ArcPy with ArcGIS API for Python? Today I found out about the . I was wondering if you could use this to (eventually) replace ArcPy?  Recently I have been doing analyses that require cloud based solutions. When using AWS, Docker and Jupyter it is very convenient to stick with a Unix based OS such as Ubuntu. However, the Unix alternatives for ArcGIS have their own limitations as well such as the always hard to install python bindings for the  GDAL library. ArcGIS for Python operates cross platform.  Perhaps there are the things I should and should not expect from the ArcGIS API for Python.  Perhaps Arcpy is going to disappear altogether.