I read this in the 1980's in the UK but the story was set in USA. (Think it was a hardback)  IIRC the protagonist worked at a printers in the 19th century but got on the wrong side of some "hidden city" gangsters and somehow ended up in modern times.   The hunters chased him to the year but then had to find him.  He has taken a job at his old works and is now  the expert on the big old steam powered printing machine, he knew it when it was brand new.  The printing machine is now ran by a failing newspaper and their main competitor is the one who has the time chasing hoodlums working for him. He runs a sleazy tabloid press.    I think he gets asked about a brass bell that occasionally  pops out the side and he informs them this is the "perfection indicator" that shows the machine is at optimum performance.  I also recall there being something about a bridge. Not sure if it was in the title or maybe only mentioned in the book cover/blurb, possibly how the time jumps happened.
I remember reading this book in the late 80's or early 90's. It was a - sort of - semi SciFi contemporary fairy tale.  It was set in Manhattan in contemporary times, near future and (I think) late 1800's. There was a mist wall round New York that ships could disappear into and arrive out at different times.  There was a man with a white horse, the horse could fly but had forgotten how. The man is brought forward from the past but (like the horse) forgets who he is.  An engineer arrives from the future in a gigantic ocean liner and builds a bridge of light to heaven (possibly at the last millennium turn over).   It was a very involved book with a huge cast of characters that all had some part to play in the story.  In the 1800's story there was a girl suffering from consumption, she slept in a glass room on the roof of her house, open to the freezing winter air, it was what kept her alive. She was rich (the family had made money in whaling) but somehow she and The Man (the guy with the white horse, who was pretty much a nobody) met and fell in love (I think).  Some of the story was set around a lake in upstate NY, and one character started off in San Francisco (contemporary times) and traveled to the lake.  Anyone any idea what I'm talking about?
What should I look for when buying chain lube / lubricant? In the past, I personally have only used WD-40.   However, I have occasionally had my bicycle looked over at the locally run, free service sessions and most of the mechanics there use a hand applied type of greasy gel (I forget the name).  Questions:   Is WD-40 suitable for bicycle chains? Would alternatives provide better chain longevity? When shopping around for lubricant, what are the most important things to look for? What do you use and why?  (optional added extra) Any tips for reducing chain wear? In my student book they separate these two and indicate that sparks need high voltage to occur while arcs need low voltage with normal or low pressure and electric arcs CAN come with heat and bright light. But when I search on the web many people said that arc is just a hotter version of spark. So what is the difference between them? $\sqrt[31]{12} +\sqrt[12]{31}$ is irrational Prove that $\sqrt[31]{12} +\sqrt[12]{31}$ is irrational.   I would assume that $\sqrt[31]{12} +\sqrt[12]{31}$ is rational and try to find a contradiction.  However, I don't know where to start. Can someone give me a tip on how to approach this problem? How to combine bold and "code sample" in Markdown? How can I make a word in a code sample bold? I only see asterisks around the expected bold text.  sample **sample** sample I'm trying to find $\int x^x \, dx$, but the only thing I know how to do is this:  Let $u=x^x$.  $$\begin{align} \int x^x \, dx&amp;=\int u \, du\\[6pt] &amp;=\frac{u^2}{2}\\[6pt] &amp;=\dfrac{\left(x^x\right)^2}{2}\\[6pt] &amp;=\frac{x^{2x}}{2} \end{align}$$  But it's certain that this isn't the correct way to evaluate that, and the answer must be wrong. Javascript file uploads Mysterious contact by advanced aliens; leaves humans insane It'd be great if anyone could remember the source of this short story I only dimly remember, but recall finding quite haunting back in my youth.  I read it maybe 20 years ago in a paperback that probably dated from the '80s.  It begins with the protagonist (a young man) being being woken by a deafening noise coming through his cochlear implant.  He's on a spaceship, and has volunteered to be put in a capsule and fired off to a remote part of the solar system.  Once in place in their capsule, the volunteers are visited by what is (presumably) a highly intelligent alien life-form, and gifted with some artefact containing priceless knowledge, like, for example, the cure for cancer.  The (unexplained) encounter leaves the them completely and irrevocably insane, perhaps terrified out of the minds.  Yet despite this, volunteers still clamour to be chosen for the mission. I have this below code where i am trying to first search an account name and on hit button it displays the result set.  On the button click i am also loading an child component which is displaying the id of the record.  I need the child component should get displayed once i click on the record.  How can i achieve this -   Parent Component -   &lt;aura:component controller="SimpleAccountController"&gt;     &lt;aura:attribute name="account" type="account[]"/&gt;     &lt;ui:outputText aura:id="outName" value="" class="text"/&gt;     &lt;ui:inputText aura:id="name" label="Enter Name:" placeholder="Your Name" /&gt;     &lt;ui:button aura:id="button" buttonTitle="Click to see what you put into the field" class="button" label="Click me" press="{!c.getInput}"/&gt;     &lt;aura:iteration var="acc" items="{!v.account}"&gt;             &lt;a onclick="{!c.accountselected}" data-recId="{!acc.Id}"&gt;         &lt;p&gt;{!acc.Name} : {!acc.Type} : {!acc.Industry} : {!acc.Rating}&lt;/p&gt;             &lt;/a&gt;         &lt;c:HelloWorkdChildCmp selectedaccount="{!acc.Id}" /&gt;     &lt;/aura:iteration&gt; &lt;/aura:component&gt;   COntroller -   ({     getInput : function(cmp, evt) {         var myName = cmp.find("name").get("v.value");         var myText = cmp.find("outName");         var greet = "Hi, " + myName;         myText.set("v.value", greet);         var action = cmp.get("c.seaAcc");         action.setParams({ "s" : myName });         action.setCallback(this, function(response) {             var state = response.getState();             if (state === "SUCCESS") {                 cmp.set("v.account", response.getReturnValue());                 //alert("From server: " + response.getReturnValue());             }         });         $A.enqueueAction(action);     },      accountselected : function(cmp, evt) {        console.log(evt.currentTarget.getAttribute("data-recId")) ;     }  })   Child component -   &lt;aura:component &gt;     &lt;aura:attribute name="selectedaccount" type="String"/&gt;     &lt;div&gt;Id: {!v.selectedaccount}&lt;/div&gt; &lt;/aura:component&gt; How to use hook_node_presave to change field's value In classical logic, why is $(p\Rightarrow q)$ True if both $p$ and $q$ are False? I am studying entailment in classical first-order logic.  The Truth Table we have been presented with for the statement $(p \Rightarrow q)\;$ (a.k.a. '$p$ implies $q$') is: $$\begin{array}{|c|c|c|} \hline p&amp;q&amp;p\Rightarrow q\\ \hline T&amp;T&amp;T\\ T&amp;F&amp;F\\ F&amp;T&amp;T\\ F&amp;F&amp;T\\\hline \end{array}$$  I 'get' lines 1, 2, and 3, but I do not understand line 4.      Why is the statement $(p \Rightarrow q)$ True if both p and q are False?  We have also been told that $(p \Rightarrow q)$ is logically equivalent to $(~p || q)$ (that is $\lnot p \lor q$).  Stemming from my lack of understanding of line 4 of the Truth Table, I do not understand why this equivalence is accurate.       Administrative note. You may experience being directed here even though your question was actually about line 3 of the truth table instead. In that case, see the companion question  And even if your original worry was about line 4, it might be useful to skim the other question anyway; many of the answers to either question attempt to explain both lines. Shadows along edges of mesh in 3D View Proving that the Intersection of any Collection of Compact Sets is Compact I was trying to do this problem this way:  Let $\mathcal{B}=\{B_i\}$ be a collection of compact sets. By Heine-Borel, each of the $B_i$'s are closed and bounded. We already know that the intersection of a collection of closed sets is once again closed, so $\cap \mathcal{B}$ is closed.  If I can prove $\cap\mathcal{B}$ is bounded as well, I can use Heine-Borel to say it is compact. So I was not sure how to show it was bounded, but a friend showed me his way of doing it. He did it the following way:  Let $b,a\in\mathbb{R}$ be an upper and lower bound for $B_1$, respectively. Since $\cap\mathcal{B}\subset B_1, a$ is a lower bound for $\cap \mathcal{B}$ and $b$ is an upper bound for $\cap\mathcal{B}$. Therefore, $\cap\mathcal{B}$ is bounded and then by Heine-Borel, it is compact.  My question is on the paragraph right above. I don't understand why what he did means that $a$ and $b$ are lower and upper bounds for $\cap\mathcal{B}.$ Can anyone explain why this is? Thanks. Why is the node editor showing different kinds of nodes? I have been following  tutorial until I started adding nodes. The problem is that he has completely different nodes than I have. Even nodes that are created at start are different (I have Material and Output and he has Render Layers and Composite). Have I missed something or should I use different nodes than he? Probability Problem with $n$ keys A woman has $n$ keys, one of which will open a door. a)If she tries the keys at random, discarding those that do not work, what is the probability that she will open the door on her $k^{\mathrm{th}}$ try?  Attempt: On her first try, she will have the correct key with probability $\frac1n$. If this does not work, she will throw it away and on her second attempt, she will have the correct key with probability $\frac1{(n-1)}$. So on her $k^{\mathrm{th}}$ try, the probability is $\frac1{(n-(k-1))}$ This does not agree with my solutions.   b)The same as above but this time she does not discard the keys if they do not work.  Attempt: We want the probability on her $k^{\mathrm{th}}$ try. So we want to consider the probability that she must fail on her $k-1$ attempts. Since she keeps all her keys, the correct one is chosen with probability $\frac1n$ for each trial. So the desired probability is $(1-\frac{1}{n})^{k-1} (\frac1n)^k$. Again, does not agree with solutions.  I can't really see any mistake in my logic. Can anyone offer any advice? Many thanks Does Java have buffer overflows? How to make partitions mount at startup? My table is like this:  Sitecode    Month  Amount --------    -----  ------ XX          Jan     1000 XX          Jan     3000 XX          Apr     3000 XX          Apr     1000   What I want is, to show the result something like this:  Sitecode    MonthJAN   MonthAPR --------    --------   -------- XX          4000       4000 What are Extension Methods? What are extension methods in .NET?    EDIT: I have posted a follow up question at A coin is tossed three times. The probability of zero heads is 1/8 and the probability of zero tails is 1/8. What is the probability that there is at least one head and at least one tail?  So, if P(zero heads)= 1/8 , then that should be the same of p(all tails)?  We would use the complement rule and Multiplication Rule?   P(at least one head) = 1 - P(no heads) = 1 - 1/8= 7/8 P(at least one tail) = 1 - P(no tails) = 1 - 1/8= 7/8  would I multiply the two values? GP 1.2.10(b) The tangent space $T_{(x,x)}(\triangle)$ is the diagonal of $T_x(X) \times T_x(X).$ If $\triangle$ is the diagonal of $X \times X$, show that its tangent space $T_{(x,x)}(\triangle)$ is the diagonal of $T_x(X) \times T_x(X).$   I don't have the slightest idea on how to do this.  By definition, the tangent space of $X$ at $x$ is the image of the map $d\phi_0: \mathbb{R}^k \rightarrow \mathbb{R}^N$, where $x + d\phi_0(v)$ is the best linear approximation to $\phi: V \rightarrow X$ at 0. $\phi: V \rightarrow X$ is a local parametrization around $x$, $X$ sits in $\mathbb{R}^N$ and $V$ is an open set in $\mathbb{R}^k$, and $\phi(0) = x$.  Thanks.