Where to invoke ExecutorService.shutdown() in web application
How to run a background task in a servlet based web application?
ACPI error when trying to make dual boot with Ubuntu 18.04 and Windows 10 What is 'deictic time'? [5]     i  If she beats him he’ll claim she cheated.    [non-deictic past]     ii If you eat any more you’ll say you don’t want any tea.[non-deictic present]      The preterite and present tense inflections on cheat and do indicate that Tr is respectively anterior to and simultaneous with To, but here  To is clearly not Td. The time of the (possible) cheating is not anterior to the time of my uttering [5i], but to the time of his (possibly) making a claim of cheating.                       — The Cambridge Grammar of the English Language, p126   I can understand To (time of orientation = utterance time), yet don’t get what the ‘deictic time (Td)’ is. Would you let me know the Td? The following is an old qualifying exam that I cannot solve:  Suppose $f$ is holomorphic on the punctured unit disk and $ \frac{f '}{f} $ has a simple pole at $0$.  Show that $f$ does not have an essential singularity at $0$. Update manager doesn't offer an upgrade to the new release What is the limit of Lovers Leap? No package php-imap available on CentOS 7 I'm running a dedicated server with CentOS 7 64bit, here is the output when trying to install IMAP:    yum install php-imap   Loaded plugins: fastestmirror   Loading mirror speeds from cached hostfile    * base: ftp.ciril.fr    * extras: ftp.ciril.fr    * updates: ftp.ciril.fr   No package php-imap available.   Error: Nothing to do       Also the same when disabling exclusions:    sudo yum install --disableexcludes=all php-imap Loaded plugins: fastestmirror Loading mirror speeds from cached hostfile  * base: ftp.ciril.fr  * extras: ftp.ciril.fr  * updates: ftp.ciril.fr No package php-imap available. Error: Nothing to do Error when using TikZ-Feynman package Today I downloaded and installed the new  package to draw Feynman diagrams. I included the packages   \usepackage{tikz}  \usepackage{tikz-feynman} \tikzfeynmanset{compat=1.0.0} \usetikzlibrary{shapes,arrows,positioning,automata,backgrounds,calc,er,patterns}   into my preamble (changed them already many times).  However, already a simple sample code like  \begin{tikzpicture} \begin{feynman} \vertex (a) {\(\mu^{-}\)}; \vertex [right=of a] (b); \vertex [above right=of b] (f1) {\(\nu_{\mu}\)}; \vertex [below right=of b] (c); \vertex [above right=of c] (f2) {\(\overline \nu_{e}\)}; \vertex [below right=of c] (f3) {\(e^{-}\)}; \diagram* { (a) -- [fermion] (b) -- [fermion] (f1), (b) -- [boson, edge label'=\(W^{-}\)] (c), (c) -- [anti fermion] (f2), (c) -- [fermion] (f3), }; \end{feynman} \end{tikzpicture}   directly gives the error:     Package pgfkeys Error: I do not know the key '/graph drawing/node distance'.   Can you please help me? Thanks in advance! I am trying to route a pic32 chip to a  chip and having a bit of a hard time getting all 17 address lines and all 8 data lines connected. I am trying to tie the first 16 address pins to portB pins 0-15 and the data pins to portD 0-7.  After thinking about it for a while I realized that I am probably making my life more difficult by trying to line up rb0 with a0, rb1 with a1, etc. All I really want to be able to do is write a 16 bit value to portB and have the majority of the address loaded and ready. If I make pin assignments based on ease of routing, the logical address will be different between the mcu and the ram, but it should at least be consistent. Since nothing else needs to communicate with the RAM, I don't think it will be a problem if the mcu asks for address 0x101 and the RAM gives it address 0x110.   However, I wonder if it is a good idea. If there is some structure internal to the RAM designed to make sequential reads more efficient, or something like that, then I may want to go to the trouble of routing them 1:1. The pins arrangement on both chips fees somewhat random to me, so it would make it a lot easier on me if I could ignore the particular numbers. Is there any good reason why I should or should not do that? Chrome asks for password to unlock keyring on startup In Google Chrome, when I go to a login page, a window pops up asking to "Enter password for keyring 'default' to unlock". In most cases, whether I click Cancel or enter my password, the login form gets auto filled anyway.  How do I get rid of the popup? I want it to auto login each time, not ask for my system password. The dialog box never appears for any other apps. Received an unexpected cashiers check for over $2K from another state - is this some scam? This is actually about my sister-in-law who lives in Georgia. She just received a "cashiers check" for $2395 from a company in Indiana. It looks like this:    She said that she has been doing "mystery shopper" work for a company and thought that this would be payment for that, but that usually the payments she received for that work were just a couple of hundreds of dollars.  She said she had not done that much of that "mystery shopper" work that she would have expected to receive anything close to the amount on this check.  She was asking me about it but I thought that if she does not know the sender, perhaps this could be some kind of new scam and she should check with the local police (which she said she was going to do).  Anyway I wanted to ask here if anyone knows of a scam like this? Considering that the check here seems to be a "cashiers check", how would a scam like this even work?  Update: I just found out that there was indeed a letter included with the check (and it seems to have instructions similar to those mentioned in the answer by "BrenBarn"). This is indeed related to that "mystery shopper" work. Turns out the reason she was not sure was because the sender of that check has a different company name than the company she normally dealt with. Here is a part of the letter: When can a hyphen ("-") be used, and what does it mean? I've seen the hyphen (-) used in phrases a lot, for example:     audience-knowing      moves-sometimes      do-gooder   When and why is the hyphen used, and what does it mean when it's used? What is meant by "Constant Amortized Time" when talking about time complexity of an algorithm? After many unsuccessful trials based on almost everything about this topic on the Internet, I decided to ask this question again. There is almost  in this platform, but it did not work. That's why I am here.  I want to have Ubuntu 18.04 installed on my USB memory stick (SanDisk Cruzer Glide 32GB) with a persistent storage of more than 4GB (at least 23GB in my case).  I used MiniTool partition wizard to format the stick (NTFS) on Windows. Then, I used Universal USB Installer 1.9.8.2 to install Ubuntu 18.04 on the stick. Here, I tried to format the stick either fat32 or ntfs, but nothing changed. Later, I used another Ubuntu to delete the casper-rw file and create another partition with the same name by following the steps given in the link given above. Unfortunately, I couldn't make it working although I tried almost all combinations.  Can anyone give a thorough list of steps to follow in order to install it on the stick properly?  Edit: I gave ear to @c-s-cameron 's comment below and used YUMI to do that, and it worked. I believe all other answers would work, but I dont have time to give a try for all of them. Thanks all, again! I understand that the architecture of Convolutional Neural Networks (CNN) and Feed forward (FNN) are quite different. And that CNNs use pooling and filters of shared weights over a patch of the image. I am not so clear on the core convolution operator (1):   If anyone could link me to an explanation, I have looked at the Colah blog and Nielsen's online book, and I understand what it is doing but don't understand the convolution operator.  Also, it looks quite similar to the the core FNN function is there and difference? (2).  (1) convolution operator is $a^1 = \sigma(b + w*a^0)$ which is equivalent to:  $a^1 = \sigma(b + \sum^4_{l=0}\sum^4_{l=0}w_{l,m}a_{j+l,k+m})$  (2) feed forward operation:  $a^1_i = \sigma(\sum^n_{j=1}w_{ij}x_j +b_i)$  Many thanks  Sources: functions taken from: Is there an irrational number $a$ such that $a^a$ is rational? It can be proved that there are two irrational numbers $a$ and $b$ such that $a^b$ is rational (see ) and that for each irrational number $c$ there exists another irrational number $d$ such that $c^d$ is rational (see ).  My question is: Is there an irrational number $a$ such that $a^a$ is rational (and how could you prove that)? I have noticed that some users have taken it upon themselves to create  that allow you to see a user's rank (percentile) among SO developers.  I like this.  I was wondering if the owners of the website are planning something like this in the future?  If so, are you planning on making this by tag?  (I care less about where I rank when compared to developers of a different language).  What I'm looking for is something like this:  C#:      User is ranked #XX (Top XX %) ASP.Net: User is ranked #YY (Top YY %) ffmpeg working from command line in Terminal but not in an Automator shell script! I have just compiled my own copy of ffmpeg on my system and it's located in the following path:  /opt/local/bin/ffmpeg   When I run the following command in Terminal.app, it runs smooth:  ffmpeg -i /Users/Amit/Documents/input.avi -c:v copy -c:a aac -b:a 384k -strict -2 /Users/Amit/Documents/output.m4v   However, a similar command run as a shell-script in an Automator service fails:  for f in "$@" do     ffmpeg -i "$f" -c:v copy -c:a aac -b:a 384k -strict -2 "${f%.*}.m4v" done   Up until now, I had a pre-compiled build of ffmpeg on my system located at:  /Applications/Scriptlets/   And my Automator shell-script had the full path (/Applications/Scriptlets/ffmpeg) instead of just ffmpeg; and it worked fine. However, today I decided to compile a fresh copy of ffmpeg using MacPorts and removed the earlier version from my Applications/Scriptlets folder. Now, this ffmpeg works fine in Terminal but gives an error whenever I try running it from a shell-script inside of an Automator workflow. Am I doing something wrong here? Please help! The square root of a prime number is irrational If $p$ is a prime number, then $\sqrt{p}$ is irrational.  I know that this question has been asked but I just want to make sure that my method is clear. My method is as follows:  Let us assume that the square root of the prime number $p$ is rational. Hence we can write $\sqrt{p} = \frac{a}{b}$. (In their lowest form.) Then $p = \frac{a^2}{b^2}$, and so $p b^2 = a^2$. Hence $p$ divides $a^2$, so $p$ divides $a$. Substitute $a$ by $pk$. Find out that $p$ divides $b$. Hence this is a contradiction as they should be relatively prime, i.e., gcd$(a,b)=1$. I have the message:   Error Broken count &gt;0 Check if you are using third party repositories. If so disable them, since they are a common source of problems. Furthermore run the following command in a Terminal: apt-get install -f Details: The following packages have unmet dependencies: firefox-globalmenu: Depends: firefox (= 19.0+build1-0ubuntu0.12.04.2) but 19.0+build1-0ubuntu0.12.04.1 is installed   Any suggestions? How to compare objects by multiple fields Assume you have some objects which have several fields they can be compared by:  public class Person {      private String firstName;     private String lastName;     private String age;      /* Constructors */      /* Methods */  }   So in this example, when you ask if:  a.compareTo(b) &gt; 0   you might be asking if a's last name comes before b's, or if a is older than b, etc...  What is the cleanest way to enable multiple comparison between these kinds of objects without adding unnecessary clutter or overhead?   java.lang.Comparable interface allows comparison by one field only Adding numerous compare methods (i.e. compareByFirstName(), compareByAge(), etc...) is cluttered in my opinion.   So what is the best way to go about this?