The Enterprise-D's computer shows us on multiple occasions that it can deal with natural language input.  One notable example of extended conversation is in TNG '11001010':  PICARD: Computer, explain Red Alert. COMPUTER: Initiated as a programmed response. The magnetic field containing the antimatter had weakened. There was no fail-safe available. PICARD: Why wasn't I notified? COMPUTER: Unknown. PICARD: Present condition? COMPUTER: The magnetic field is now restored. Containment is restored. Propulsion is at maximum efficiency.  This continues for a while, so I shan't bore you with the details. The Computer can even deal with Lwaxana Troi's talking to it as if it were a person:  LWAXANA: Hello, computer? Is Commander Riker still on the Bridge? COMPUTER: Negative. Riker is currently in holodeck three. LWAXANA: Holodeck? Where is that? COMPUTER: Follow the comm. panel lights. They will lead you there.  (TNG 'Manhunt') So, if the computer can deal with natural language requests, why does Picard order 'Tea. Earl Grey. Hot.' rather than something more like 'Replicate a cup of hot Earl Grey tea?'
Is a particular sequence required for detailed replicator requests?    To elaborate, is there a reason Captain Picard orders his tea, "Tea. Earl Grey. Hot." aka "Noun. Descriptor. Descriptor." and not "Descriptor. Descriptor. Noun." or "Descriptor. Noun. Descriptor." (in the event he forgot a descriptor)?  Would ordering it as "Hot. Earl Grey. Tea." or even the non-statement "Hot Earl Grey tea." produce a warm (hot), smoky (gray-ish) gas with the odor of tea?  I assume his ordering sequence is an acquired background affectation, but I'd like confirmation.  Note: I'm using "descriptor" instead of "adjective" to avoid minutia/debate about classification.
Homomorphisms from $\mathbb{Z} \rightarrow S_3$. Excluding grep from process list Is the below a valid circuit implementation and are there any things to watch out for? It's a simplification of the larger circuit but the crux of it is that I need to sink current into two GPIO input pins. The pins are signified by the 1 and 0.  Also, would a diode on the pins be advisable?    Edit: Here's the non-simplified circuit. The question relates to the 3.3v part of it. In essence, the timer and decade counter sequentially pulse current, 'activating' the transistors one at a time. The keypad is a simple matrix keypad. What I'm wondering if I can do is to put a GPIO pin on the line between the keypad and ground. The intended effect is that, when a button on the keypad is pressed, 2 pins will change state - this signifies the row and column.  Note that some of the resistance and capacitance values are notional at the moment. What is a single word in English which means to look down on others (due to their younger age, lower socio-economic position, lesser experience, etc)    Not look down upon everyone else in general, but look down upon some particular person due to a feeling of superiority of oneself over them ( this superiority may come from the fact that one feels has more money, talent, etc)?    By "look down upon" I don't mean just the feeling of having superiority over another, but acting to them in a manner that reflects this pride as well (for example, perhaps he acts very rudely to them, since he feels superior to them and feels he can get away with it, or he feels it doesn't matter at all due to his superiority) Iterated self-composition of arbitrary function Does there exist some notation that represents the iterative composition of a single-input, single-output function with itself? As in, say, $f_5(x)=f(f(f(f(f(x)))))$.  In other words, going by the above (incorrect, I'm pretty sure) notation:  $f(x)=x+1$, $f_n(m)=m+n$  I'm looking for the correct way to express the notion of "$f_n(x)$" for any $f$. Why does second pre-image resistance imply pre-image resistance I am studying hash functions. I can understand why collision resistance implies second preimage resistance, but I don't get why second preimage resistance should imply first preimage resistance. Could anybody be help me with this argument from Introduction to Modern Cryptography by Katz &amp; Lindell, please?   Collision resistance: This is the strongest notion and the one we have considered so far.  Second pre-image resistance: Informally speaking, a hash function is second pre-image resistant if given $s$ and $x$ it is infeasible for a probabilistic polynomial-time adversary to find $x' \ne x$ such that $H^s(x') = H^s(s)$.  Pre-image resistance: Informally, a hash function is pre-image resistant if given $s$ and $y = H^s(x)$ (but not $x$ itself) for a randomly chosen $x$, it is infeasible for a probabilistic polynomial-time adversary to find a value $x'$ such that $H^s(x') = y$. (Looking ahead to later chapters in the book, this essentially means that $H^s$ is one-way.)   [...] Likewise, any hash function that is second pre-image resistant is also pre-image resistant. This is due to the fact that if it is possible to invert $y$ and find an $x^\prime$ such that $H^s (x^\prime ) = y$ then it is possible to take $x$, compute $y = H^s (x)$ and invert it again obtaining $x^\prime$. Since the domain of $H$ is infinite, it follows that with good probability $x \neq x^\prime$. We conclude that the above three security requirements form a hierarchy with each definition implying the one below it. Newcommand + Stepcounter I'm trying to come up with a command which should increase a counter and return a string including the current value of the counter.  Have a look at the following minimal example:  \documentclass{article}  \newcounter{mycounter} \newcommand{\mystepFAILS}{\stepcounter{mycounter}foo\themycounter} \newcommand{\mystepWORKS}{foo\themycounter}  \begin{document}  \section{\mystepFAILS}  \section{\mystepWORKS}  \end{document}   Why does the command with \mystepFAILS throw an error? What is so special about \stepcounter? Any ideas? How to integrate $\int x^2 \sin^2(x)dx$ I don't know how to integrate $\int x^2\sin^2(x)\,\mathrm dx$. I know that I should do it by parts, where I have  $$ u=x^2\quad  v'=\sin^2x \\  u'=2x \quad v={-\sin x\cos x+x\over 2}$$  and now I have  $$ \int x^2\sin^2(x)\,\mathrm dx = {-\sin x\cos x+x\over 2} x^2 - \int 2x{-\sin x\cos x+x\over 2}\,\mathrm dx\\ ={-\sin x\cos x+x\over 2} x^2 - \int x(-\sin x\cos x+x)\,\mathrm dx\\  $$  so I have to calculate $$ \int x(-\sin x\cos x+x)\,\mathrm dx=-\int x\sin x\cos x\,\mathrm dx+\int x^2\,\mathrm dx$$  I know that $\int x^2\,\mathrm dx = {1 \over 3}x^3+C$ but I don't know what should I do with $$\int x\sin x\cos x \,\mathrm dx$$ Should i use parts again or what? Please help. Detecting the onload event of a window opened with window.open Academic papers using Stack Exchange data How to use unicode characters in Windows command line? We have a project in Team Foundation Server (TFS) that has a non-English character (š) in it. When trying to script a few build-related things we've stumbled upon a problem - we can't pass the š letter to the command-line tools. The command prompt or what not else messes it up, and the tf.exe utility can't find the specified project.  I've tried different formats for the .bat file (ANSI, UTF-8 with and without ) as well as scripting it in JavaScript (which is Unicode inherently) - but no luck. How do I execute a program and pass it a Unicode command line? Proof of upper-tail inequality for standard normal distribution $X \sim \mathcal{N}(0,1)$, then to show that for $x &gt; 0$, $$ \mathbb{P}(X&gt;x) \leq \frac{\exp(-x^2/2)}{x \sqrt{2 \pi}} \&gt;. $$ I am having problems with the su command. I know my password and I am typing it correctly but su indicates authentication failure.  So I checked on the internet and then went into recovery mode and changed my username's password to what I was entering before.  Even now entering the same password on su gives me authentication failure.  Please suggest what am I doing wrong?? I am having trouble with this problem from my latest homework.  Prove the arithmetic-geometric mean inequality. That is, for two positive real numbers $x,y$, we have $$ \sqrt{xy}≤ \frac{x+y}{2} .$$ Furthermore, equality occurs if and only if $x = y$.  Any and all help would be appreciated. Reading through my textbook I came across the following problem and I am looking for some help solving it.  Prove that,  $$\binom{3n}{r}=\binom{3n-1}{r} + \binom{3n-1}{r-1}$$  In a previous problem I solved the following but I wasn't sure how to use it to prove the question above. Prove,  $$\binom{n}{r}=\binom{n}{n-r}$$  Solution:  left Side,  $$\binom{n}{r}=\frac{n!}{(n-r)!r!}$$  right side,  $$\binom{n}{n-r}=\frac{n!}{(n-(n-r))!(n-r)!} = \frac{n!}{(n-r)!r!}$$  Therefore completing the proof,  but how do I solve my first question? thanks! A friend of mine has some very old photos where the deterioration process seems to have increased in the past few years, and the owner is worried about the preservation of these old memories.  They have been stored inside an album within plastic sleeves. The owner is not aware of the display method prior to that.   I have been informed by the owner that since being in their possession, they seem to be looking worse than when first viewed and seem to be falling apart.   He is looking for the best way to preserve these photos inside an album, but not really sure what would be the best method. I have suggested for the albums as a whole to be stored in vacuum sealed bags for now, but I'm not even sure if that is good!  I am looking for any suggestions or personal experiences from anyone who has had to deal with such photos and what they did to preserve their memories. With the exception of multiclassing, is there any big reason that if you were to change the spellcasting ability of a (spellcasting) class it would be a bad idea?  As a specific example: Let's say I was switching Sorcerers from Cha to Wis, what unexpected effects could this have on that class's balance? Additionally let's assume all places in spellcasting where you added your charisma modifier instead you now add wisdom (and vice-versa). Access a glyph on fontspec using a GID (Glyph ID) I'm trying to access a glyph, but it's only mentioned in the "Basic Latin and Latin 1" set for a font. The glyph has no name or unicode ID, but it does have a glyph ID or GID. fontspec doesn't mention possibilities for using this glyph. Neither does Adobe in the adobe feature file syntax:   I'd still like to be able to access a glyph through its ID, since it's the only way I can access it (I think).  My specific case requires to access the glyph ID 554 from Stevens Titling Pro Sable Brush. I will only post this font if it's strictly necessary, since I don't like to distribute these fonts to the wide world.  I posted an MWE containing another (free) font. This is not the font I intend to use, but perhaps a starting point to try and access glyphs manually.   \documentclass{article}  \usepackage{fontspec} \setmainfont{EB Garamond}  \parindent=0pt \begin{document}  Some text int EB Garamond. How can I access glyph 123 now?  \end{document} How to center column values in a table? How can I center the column values in this code?  \documentclass[conference]{IEEEtran} \begin{document} \begin{table}   \centering   \begin{tabular}{|p{2.5cm}|p{2.5cm}|p{2.5cm}|}     \hline     Reconstruction strategy &amp; aa          &amp; bb( \%) \\ \hline     Classic                 &amp; 3342 voxels &amp; 68 \%   \\ \hline     VC                      &amp; 4296 voxels &amp; 87 \%   \\ \hline     V m=7                   &amp; 4745 voxels &amp; 96 \%   \\ \hline   \end{tabular}   \newline\newline    \caption{title}\label{tab1} \end{table} \end{document} Let $T:V\to V$ be a linear map, where $V$ is an inner product space. Given $T^2=\frac{T+T^*}{2}$, prove that $T$ is normal and that $T=T^2$. Let $T:V\to V$ be a linear map, where $V$ is a finite-dimensional inner product space. Given $T^2=\frac{T+T^{*}}{2}$, I would like to prove that $T$ is normal and that $T=T^2$. The first part, to prove that $T$ is normal, is quite easy: from $T^2=\frac{T+T^{*}}{2}$ we'll have $\,T^{*}=2T^2 - T$, and as $TT^{*} = 2T^3 -T^2 = T^{*}T$. Now, I need to prove that $T=T^*$, then $T = T^2$ is immediate. I have been thinking about this question for some days and I can't figure out in what technique to prove that $T = T^{*}$.