Short version, I want to fill in this list of letter names suitable for use in dialog: ?, bee, cee, dee, eee?, eff, gee, aitch, eye, jay, kay, ell, em, en, oh, pee, queue/cue?, arr, ess, tee, you/yew?, vee, double you/yew?, ex, why?, zee.  Problem letters are A, E, Q, U/W, and Y.  I can find formal pronunciations like /ei/ for A, but that doesn't seem easily understandable.  Example, ""Yes, it's ABC spelled ?-bee-cee," she clarified." (I'm not interested in writing A-B-C instead.)
The English alphabet has a common pronunciation. For example, the letter b is pronounced like the word bee, the letter c like the word see, and the letter i like the word aye.  Is there a formal spelling for the letter names?
It seems that in the words Englishman, Frenchman, and Scotsman, the ‑man part is pronounced /mən/ (just like in Roman).  Whereas in snowman, the ‑man part is pronounced /mæn/ (just like in no man).  Why is it that when ‑man is appended to snow‑ to make snowman, the pronunciation of the man part doesn’t change?    Wouldn’t it logically follow for it to be pronounced /ˈsnowmən/ not /ˈsnowˌmæn/? Should I be able to 'manually' rotate the headset? How do I list the default installed packages? I am developing an offline installer for all versions of Ubuntu, and I need Ubuntu's default installed packages list. Is there a way to get this information from any server (web server)? Any script to fetch any Ubuntu version's default installed packages list.  I will give the Ubuntu version, and the script will fetch the packages list.  Note: I need at least a server address. I can write a script for this. There are $k$ penguins, $k\ge 3$. They are all different heights. How many ways are there to order the penguins in a line, left to right, so that we cannot find any three that are arranged tallest to shortest (in left to right order)? The penguin triples do not have have to be adjacent.  This problem is courtesy of someone I know only as "DaMancha." How can I list the contents of a .zip folder in c#? What is the best choice for .NET inter-process communication? Consider a sequence of $n$ Bernoulli trials with $P(\text{success})=p$. Let $X_i$ and $X_j$ be indicator variables of the number of "success" in $i$th and $j$th runs. Given the total number of success was $m$, $m&lt;n$. I am asked to compute the correlation coefficient for $X_i$ and $X_j$.  Now I know the formula for correlation coefficient, but to compute the co-variance I will need to find $E(X_i)$ and $E(X_j)$ first. By definition does $E(X_i)=p_i$ and $E(X_j)=p_j$? I feel this seems a bit too easy but I can't see whats wrong with it. /etc/sysctl.conf doesn't persist after reboot What blocks can Endermen pick up and what blocks they can't? Remove HTML tags from a String Is there a good way to remove HTML from a Java string? A simple regex like replaceAll(&quot;\\&lt;.*?&gt;&quot;, &quot;&quot;)   will work, but things like &amp;amp; wont be converted correctly and non-HTML between the two angle brackets will be removed (i.e. the .*? in the regex will disappear). When light waves enter a medium of higher refractive index than the previous, why is it that:  Its wavelength decreases? The frequency of it has to stay the same? What's the point of Hamiltonian mechanics? I've just finished a Classical Mechanics course, and looking back on it some things are not quite clear. In the first half we covered the Lagrangian formalism, which I thought was pretty cool. I specially appreciated the freedom you have when choosing coordinates, and the fact that you can basically ignore constraint forces. Of course, most simple situations you can solve using good old $F=ma$, but for more complicated stuff the whole formalism comes in pretty handy.  Then in the second half we switched to Hamiltonian mechanics, and that's where I began to lose sight of why we were doing things the way we were. I don't have any problem understanding the Hamiltonian, or Hamilton's equations, or the Hamilton-Jacobi equation, or what have you. My issue is that I don't understand why would someone bother developing all this to do the same things you did before but in a different way. In fact, in most cases you need to start with a Lagrangian and get the momenta from $p = \frac{\partial L}{\partial \dot{q}}$, and the Hamiltonian from $H = \sum \dot{q_i}p_i - L$. But if you already have the Lagrangian, why not just solve the Euler-Lagrange equations?  I guess maybe there are interesting uses of the Hamiltion formalism and we just didn't do a whole lot of examples (it was the harmonic oscillator the whole way, pretty much). I've also heard that it allows a somewhat smooth transition into quantum mechanics. We did work out a way to get Schrödinger's equation doing stuff with the action. But still something's not clicking.  My questions are the following: Why do people use the Hamiltonian formalism? Is it better for theoretical work? Are there problems that are more easily solved using Hamilton's mechanics instead of Lagrange's? What are some examples of that? I want to ask how to get id of element which was clicked by right clicking in open menu. I must know ID of this element to show only that history the element what was clicked fom open menu: I'm creating a composite image, in order to create a timeseries. I've already created the composited image, but i am having difficulty masking the clouds of the composite image. I've followed the code from a page having similar problems, however when I run the code (after replacing all the l8_mayo to composite as that is the name of my composite var), I get the error code of composite.map not a function. This error does not come up when I run the exact same code from the previous answer. Can someone explain how to overcome this problem? Here is the page I used:  here is my code and the link to my code:  (point is the long, lat for Lake Manyara, Tanzania)  //load images for composite var sr14= ee.ImageCollection('LANDSAT/LC08/C01/T1_SR') .filterBounds(point) .filterDate('2014-01-01','2014-03-01') .select(['B4','B3','B2']);  // Temporally composite the images with a maximum value function. var composite = sr14.max(); Map.setCenter(35.8244, -3.5799); Map.addLayer(composite, {}, 'max value composite');  var getQABits = function(image, start, end, newName) { // Compute the bits we need to extract. var pattern = 0; for (var i = start; i &lt;= end; i++) {    pattern += Math.pow(2, i); } // Return a single band image of the extracted QA bits, giving the band // a new name. return image.select([0], [newName])               .bitwiseAnd(pattern)               .rightShift(start); };  // A function to mask out cloudy pixels. var cloud_shadows = function(image) { // Select the QA band. var QA = image.select(['BQA']); // Get the internal_cloud_algorithm_flag bit. return getQABits(QA, 7,8, 'Cloud_shadows').eq(1); // Return an image masking out cloudy areas. };  // A function to mask out cloudy pixels. var clouds = function(image) { // Select the QA band. var QA = image.select(['BQA']); // Get the internal_cloud_algorithm_flag bit. return getQABits(QA, 4,4, 'Cloud').eq(0); // Return an image masking out cloudy areas. };  var maskClouds = function(image) { var cs = cloud_shadows(image); var c = clouds(image); image = image.updateMask(cs); return image.updateMask(c); };  var composite_free = composite.map(maskClouds);  Map.addLayer(composite_free, 'composite collection without clouds'); Proving $\int_0^1 \frac{(\ln(x))^5}{1+x} \mathrm{d}x = -\frac{31\pi^6}{252}$ I would like to show the following identity:     $$\boxed{ I :=  \int_0^1 \dfrac{(\ln(x))^5}{1+x} \mathrm{d}x = -\dfrac{31\pi^6}{252} }$$     Here is what I tried. The change of variables $u=1/x$ yields $$I= \int_1^{\infty} \dfrac{(\ln(x))^5}{1+1/u} \dfrac{1}{u^2} \mathrm{d}u = \int_1^{\infty} \dfrac{(\ln(x))^5}{u^2+u} \mathrm{d}u$$ Then $z=u-1$ gives $$I = \int_{0}^{\infty} \dfrac{(\ln(z+1))^5}{z^2+3z+2} \mathrm{d}z $$ with $z^2+3z+2=(z+1)(z+2)$. I wanted to use contour integration like , but I was not sure how to proceed in this case. Anyway, the computations of the residues (of which "well-chosen" function? Maybe something like ?) seem to be difficult.  I believe that we can generalize to $\frac{(\ln(x))^n}{1+x}$, or maybe even more (e.g. $\frac{(\ln(x))^n}{ax^2+bx+c}$). Related computations are: , , , .  Thank you for your detailed help. Is the below brief explanation correct and complete (at least in context)? Can it be improved/simplified without getting technical? I am especially concerned about the last sentence: Is that reasoning absolutely clear to a layman?            The problem can be viewed as drawing the above graph without lifting your hand and without retracing a line. Observe that each dot is connected by three lines. Also observe that you have to draw a line to arrive at a dot, and you have to draw a line to leave that dot. Because each dot is connected by three lines, each must be visited twice. But it is impossible to visit each dot twice (even number of times) and end up with each dot connected with three lines (odd number of times). Alternative Method to Acquire El Capitan Upgrade Root of continuous function using Rolle's Theorem $$f(x)= 1 + e^x\cos(x)$$   $$g(x)= 1 + e^x\sin(x)$$      Show that there is at least one root of $g$ between two roots of $f$   How do I start to answer this question and do I need to use Intermediate Value Theorem? What does the "bugs" section of /proc/cpuinfo actually show? On a Debian Stretch and testing/Buster system with a current kernel and installed microcode I still see meltdown and spectre listed as bugs in /proc/cpuinfo.  However, running the spectre-meltdown-checker shows not vulnerable.   So I'm wondering what /proc/cpuinfo does show. Are these just the vulnerabilities for this cpu and will those always be listed despite having a patched system? Stack Overflow reputation in CV Should I mention my Stack Overflow (and other Stack Exchange sites) reputation in my CV while applying for a post-graduate position?