I recall that, as a child, I purchased a science fiction anthology of short stories in British Home Stores (BHS) sometime in the mid 1980s. It had a reddish-orange cover with white writing and drawn pictures of aliens, space ships, etc. and I suspect it may have been specially made for BHS as well.  It was about an inch or so thick and must have contained 20-25 stories from various authors.  I never got around to reading most of the stories but one I recall reading was about a ship automatically being prepped and armed, taking off and bombing an enemy city. The conclusion was that all the people had been wiped out and the systems kept the war going automatically because there was nobody left to turn the machinery off.  I've been thinking about that book recently and resolved to find it (or the stories at least) and get around to finally reading it.
I'm trying to find the name of a book I had as a kid back in the 80's/90's that was a collection of science fiction short stories and in particular one story in it.  The book: I remember the cover being mostly orange with the face of an alien taking up most of the cover. Scaly looking 'grey' style alien with hooded green eyes. They may have also been a 60's/70's style space ship in the background with a man and woman.  The story: Was set after all human life had ended in a great war and the story followed one of the many autonomous bombers still flying the skies carrying out their missions repeatedly bombing already leveled cities. At least that's how I remember it.  Any help/clues you can give would be much appreciated as I'd love to share these stories with my kid.  Some other stories it had, if any of these can be identified it might help me find the book:   Two guys talking in a room and one give the other a wooden carving of an apple and starts telling him the history of the object and how it's used to hypnotise people who hold it as they can't resist stroking it and it puts them in a catatonic state. A bunch of robots/machines wandering the post-apocalyptic country side, free of their duties to mankind. Their adventure comes to an end when they run into a hermit living in the country and their programming kicks in and they immediately become his servants. A story about first contact with an alien race, the aliens come to earth and land at the coordinates of an air-force base but upon arrival there is confusion as the humans cannot see the aliens and the aliens cannot see the humans. The aliens complain that they've been tricked and that their ship is sinking. The humans think this is strange until they realise the aliens are incredibly small and have landed in a puddle on the airfield.
What is the difference between apt and apt-get? I read about the new fancy progress bar which was added to apt 1.0 in  and how to enable it . However on running sudo apt-get update, I did not see the fancy progress bars. On reading the second link again, the solution explicitly requires you to use sudo apt update.  Hence my question is the difference between apt and apt-get. I thought they were one and the same. Writing a list to a file with Python Text alignment issue in custom Table of Contents As you can see from the image below, I have an issue with the text alignment of extra long chapter names. How can I fix it so that the text will not go further left than the start of the chapter name? That is, I don't want any text to be underneath the "Appendix A" part.  I added that red line just to show how I'd like it aligned, if possible.    Here's my MWE:  \documentclass{book} \let\cleardoublepage\clearpage  \RequirePackage{titletoc} \RequirePackage{tikz} \RequirePackage[explicit]{titlesec} \RequirePackage{DejaVuSansCondensed} \RequirePackage[normalem]{ulem} \RequirePackage[   left=2.25in,   right=0.75in,   top=1.25in,   bottom=1.25in,   marginparwidth=1.75in,   marginparsep=.25in,   asymmetric]{geometry}  \renewcommand*\familydefault{\sfdefault} % Set default font  %%% Table of Contents ---------------------------------------------------------- \setcounter{tocdepth}{1} % Show only Chapters and Sections  %%% Change font/color/layout of TOC \makeatletter \titlecontents{chapter}[-2em] {\color{cyan}\bfseries\LARGE\addvspace{3mm}} {\makebox[4.4em][r]{\@chapapp}\contentslabel{-0.25em}\hspace{1.9em}} {} {\hspace{3em}\contentspage} \g@addto@macro{\appendix}{%   \addtocontents{toc}{\protect\renewcommand*{\protect\@chapapp}{\protect\appendixname}}% } \makeatother  \titlecontents{section}[5.3em] {\color{cyan}\large\itshape\addvspace{3mm}} {\contentslabel{0em}\hspace{3.2em}} {} {\hspace{3em}\contentspage} [\addvspace{0mm}]  %%% Chapter Header ---------------------------------------------------------- \makeatletter \titleformat{\chapter}   {\normalfont\sffamily\Huge\scshape}   {}{0pt}   {\thispagestyle{empty}    % Remove page number on new chapters   %\setcounter{definition}{0}   \begin{tikzpicture}[remember picture,overlay]     \node[yshift=-3cm] at (current page.north west)       {\begin{tikzpicture}[remember picture, overlay]         \draw[fill=cyan] (0,-1) rectangle           (25cm,3cm);         \draw[fill=cyan] (0,-24) rectangle           (25cm,-25cm);         \ifttl@label% &lt;---------------------- Added condition on \ifttl@label           \node[anchor=west,xshift=.21\paperwidth,yshift=-.01\paperheight,rectangle]               {\color{white}\LARGE \MakeUppercase{\@chapapp} \Huge\thechapter};         \fi% &lt;------------------------------- end condition on \ifttl@label        \end{tikzpicture}       };    \end{tikzpicture}\endgraf   \vskip-.7cm   \color{cyan}\Huge\raggedright\leftskip-1cm    \noindent\MakeUppercase{#1}\endgraf   } \makeatother  \titlespacing*{\chapter}{0pt}{10pt}{0pt}{}  \titleformat{\section}{\color{cyan}\itshape\LARGE}{\llap{\thesection} #1}{1em}{}[\titleline{\color{cyan}\titlerule[1pt]}] \titleformat{\subsection}{\color{cyan}\normalfont\large}{\; #1}{1em}{}  \begin{document}   \tableofcontents   \chapter{Turing Machines}     \section{The Turing Machine}     \section{Variations of the Turing Machine}       %\subsection{Non-deterministic Turing Machines}     \section{The Church-Turing Thesis}   \chapter{Decidability}     \section{The Universal Turing Machine}    \appendix   \chapter{ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM} \end{document} Is the "the ... the ..." construction governed by some grammatical rule? a) The more I study, the less I learn. b) More I study, less I learn.  Could we rewrite the sentence shown under the letter a) in the form shown under the letter b) without breaking any grammatical rule? If not, why not? Network simplex method, leaving and entering variables So you are camping (please excuse the MMO jargon, sometimes I just can't help myself) your own particular corner of Stack Overflow, hoping for a couple of upvotes before bed.  It's freezing cold and you can't quite drag yourself across the room to grab the little blow heater, because that would mean leaving the almost adequate warmth of your laptop.  A completely objective question pops up, to which you absolutely know the answer.  Riding the surge of adrenaline, you spend the next twenty minutes typing like a madman. Desperate to beat the other lunatics that loiter in your tag of choice.  You beat them to the punch and enter a superlative answer, code samples, examples and maybe some ironic humour. You are flushed with your own awesomeness.  You go to bed. Satisfied you have garnered a couple of points of virtual self validation. You look forward to the flush of pleasure in the morning when you see your account bumped ever closer (yet never close enough) to that shining example of Skeetness.    Yet, the next morning, no such flush occurs.  Your answer sits in prime position for some questioner love and none eventuates.  You might get a couple of upvotes from some sympathetic SO compatriot, but the ultimate (I'll try to avoid any unsavory metaphors here)  satisfaction of accepted answer is denied you.    So my question. How you react to this kind of situation?   Catch yourself monitoring the questioner's account waiting for them to log on and then breaking nearby inanimate objects when your answer continues to be ignored. Panic that the questioner might delete their account, leaving your beloved question to evaporate in a puff of uninterest.  Wondering if it was something you said and answering some other of the questioner's queries in the hope of redeeming yourself in their fickle eyes.   I have seen a few examples of this type of frustration on Twitter and wondered how the hardcore Stack Overflow community dealt with this type of rejection. Forgive my ignorance. The below seems 'inconsistent'. If canceling the $(x+1)$ is 'legal', how does the domain change? I realize it does, but would someone be so kind as to provide an explanation?    $$ \frac{x^2 - 1}{x + 1} \mbox{ is undefined when } x = -1 $$  Its domain (the values that can go into the expression) does not include $ -1 $.  Now, we can factor $ x^2 - 1 $ into $ (x - 1)(x + 1) $ so we get:  $$ \frac{(x - 1)(x + 1)}{(x + 1)} $$  It is now tempting to cancel $ (x + 1) $ from top and bottom to produce:  $$ x - 1 $$  $$ \mbox{Its domain now } \textbf{does} \mbox{ include } -1 \mbox{.} $$  But it is now a different function because it has a different domain.    Thanks! Render every Nth frame of an animation I want to render every Nth frame of an animation, in this case every 12th frame. This way I can play back the animation at 2fps and see if everything is going correctly.  I'm a real novice with Blender Python and cobbled this together:  import bpy  for f in range(startframe,endframe,NthFrame):     bpy.context.scene.frame_current = f     bpy.ops.render.render()     bpy.data.images['Render Result'].save_render(filepath="" + str(f) + '.png')    This kind of works, the right images are rendered and saved. However it completely freezes up Blender, and after about an hour it crashes on windows due to being unresponsive I guess. How can I fix this? Preferably I'd like it to work like rendering an animation normally works, i.e. being able to still use Blender and seeing the progress of each rendered frame. Violation of linearity assumption in Logistic Regression I built a logistic model with 7 continuous independent variable and 8 categorical (dummy) variables in R. I tested for the linearity assumption using the Box Tidwell test and all my variables show high significance.  I am wondering now, if the assumption is violated what it would mean for the coefficient estimates and if I still can run the model with caution.   I read about the approach of using regression splines but I am confused how I would determine those and interpret the model then. Intersection of open affines can be covered by open sets distinguished in *both*affines Suppose $X$ is an arbitrary scheme and $U \cong \operatorname{Spec} A$ and $V \cong \operatorname{Spec} B$ are affine upon subsets of $X$.  It's not true in general that $U \cap V$ is affine, so if we want to prove basic results about general schemes (e.g. the stuff in section II.3 of Hartshorne), we need some technical means of understanding what goes on on the intersections of open affines.  I've heard that this can be done by covering $U \cap V$ with open sets which are distinguished in both $U$ and $V$, i.e. sets $W \subseteq U \cap V$ with $W \cong \operatorname{Spec} A_f \cong \operatorname{Spec} B_g$ for some $f \in A$ and $g \in B$.  I'm having trouble actually proving this.    So, questions:   Is this actually true? If so, how are these sets constructed? How Do I insert a image in LaTex from my computer How do I create a file in windows from where LaTex can extract the pdf or Jpg file I want to insert in my document? In other words I need an example of inserting either images or pdf files in my document Here's the image I want to insert    The Image will be placed center to the page just beneath this codes  \[ \overline \rho = \overline P + 0.645 \Big (\frac { \overline P}{K}\Big) ^{\frac {3}{4}} \tag { Tazkera} \] Format numbers in django templates Is it possible to know who voted my question/answer up or down? If not, then is it possible to include this feature? By this feature we can come to know if you are being voted up by question owner or persons giving other answers to same question or just the visitors of that question thread.  Like...  If it is a group of people giving other answers, then your answer is most correct If it is readers of that question, then your answer is more popular Effects:  +25 attack damage +15% life steal +40% attack speed Passive  Unique: Your attacks deal 5% of the target's current health in physical damage (60 max vs minions and monsters). Active   Unique: Drains target champion, dealing 15% of the champion's maximum Health in physical damage and healing you by the same amount. Additionally you steal 30% of their movement speed for 4 seconds - 60 second cooldown. (500 range)  Cost: 3200g VS.   Effects:  +70 attack damage +12% life steal Passive: Gain +1 attack damage and +0.2% life steal per kill (maximum +30 attack damage and +6% life steal). Half of the bonuses are lost upon death.  Cost: 3200g What is better for what situations, and when should you build BT instead of BotRK and Vice Versa. Which provides more lifesteal, the only variable being the stats of the weapon? I find myself constantly questioning my decision on which weapon to get and would really love some in depth answers. Would be great if any examples given were given from the ADC side of the house. Redshifting of Light and the expansion of the universe So I have learned in class that light can get red-shifted as it travels through space. As I understand it, space itself expands and stretches out the wavelength of the light. This results in the light having a lower frequency which equates to lowering its energy.  My question is, where does the energy of the light go? Energy must go somewhere!   Does the energy the light had before go into the mechanism that's expanding the space? I'm imagining that light is being stretched out when its being red-shifted. So would this mean that the energy is still there and that it is just spread out over more space? Propose a privilege to sit in the 500 reputation mark As , the retag privilege serves a lot more confusion and a lot less of its benefit due to the suggested edit system. It must be done away with. It will be done away with. ♪  In light of this decided course of action, we're going to need a new snack for the road between "Create Tags" at 300 reputation and "Established User" at 1000 reputation. We'd like your help in thinking about some ideas on what would be a nice privilege to sit at this level. Since we're... a bit dry on our end.  The primary guideline in deciding what kind of privilege to put here is acknowledging its position in the overall hierarchy of privileges. 500 reputation is an early-intermediate user, one who has started to really get the hang of the site and its function. It can be something that provides convenience in how they currently can act on the site, or it could be some new functionality that fits as an early ability (especially considering there's no new abilities until 2000 reputation's "Edit Everywhat" ability).  I look forward to hearing what creative ideas y'all can provide. How can I find the smallest set of groups of $n$ elements such that every element is in the same group as every other at least once? Background: I'm working on  for , and I've run into a problem with how I'm creating the individual matchups (groups of 4 entries).  Currently, I'm simply generating all combinations of 4 elements (in the combinatoric sense) of entries, but that gets really big really quickly:  $$x \choose 4$$    (from )  Therefore, my question is: How can I choose subsets (of length $n$) of a set such that each element of that set appears in the same subset as every other element at least once, while maintaining a minimal amount of subsets?  I can figure this out for $n = 2$, since the solution is quite intuitive: simply combine the first element with every other element, combine the second element with every other element that comes after it, etc. For a set of length $L$, this yields:  $$\sum_{x=1}^{L-1}(L - x)$$    (from )  which is much smaller and more manageable.  However, I still have not been able to figure out: How can I generalize this to any $n$? What issues should be considered when overriding equals and hashCode in Java? The problem: The links at the bottom of the Stack&nbsp;Exchange newsletter link to a YouTube video instead of the right place on the website. I´m not sure if this is an oversight or a clever hack.  Screenshot: How can I prevent Overflow for the Gamma function? I have a Dirichlet distribution from which I'm maximizing $\alpha$ by calculating the log likelihood with the following equation  $p\left(s|\alpha\right) = \sum\limits_{i=1}^O\log\left(\frac{n_i!}{\prod\limits_{j=1}^kn_{ij}!}\frac{\Gamma\left(\alpha_0\right)}{\Gamma\left(\sum\limits_{j=1}^k\left(n_{ij}+a_j\right)\right)} \prod\limits_{j=1}^k \frac{\Gamma\left(n_{ij}+\alpha_j\right)}{\Gamma\left(\alpha_j\right)}\right)$  I have a python script to calculate the log likelihood. It works for small values, but when $n_{ij}$ gets high $\Gamma\left(\sum\limits_{j=1}^k\left(n_{ij}+a_j\right)\right)$ and $\Gamma\left(n_{ij}+\alpha_j\right)$ python runs into overflow error (the max for math.gamma is between 171 and 172).   Is there a way to change the likelihood function so that $\Gamma\left(\sum\limits_{j=1}^k\left(n_{ij}+a_j\right)\right)$ and $\Gamma\left(n_{ij}+\alpha_j\right)$ don't run into overflow errors. Can I just divide the values in $\Gamma$ by for example 100, if I then compare the likelihood between $p(s|\alpha)$ with different $\alpha$ values do the best $\alpha$ values still have the highest likelihood?