If my memory serves correctly, it was something along the lines of this: ->   Boy hurtles into the world, crashing and losing his memories as a result.  He's a pirate? Somebody on a floating city takes him in, and he serves as an assistant. He goes north to this forest that's incredibly dangerous at night and goes to a slave market and fights in a gladiator ring. He escapes and falls down this hole into the people-group's disposal system, which is like a giant everything-eating organism (excuse my phrasing, please) The book had illustrations. Black-and-white ones, and was in a series. This may have been the third or fourth book. I think the binding was tan, but I'm not too sure. Miscellaneous details: There's a floating/or on a mountain academy-city; man-eating snails; giant, man-eating forests at night; a generally dark tone; swamps?; most likely published in the late 90's ('98 and up) and early 2000's, because I remember reading this in 2005 or 2006.
I remember reading this as a kid and it starts out with:   a boy in his home village where the other kids are mean to him during sports and they heat up their home with floating logs or something.   The kid is being hunted by some reaper character and that reaper finds him at a place called "The Edge" or something similar.   He buys a glove covered in an expensive dust that purifies things and is really rare.  In one book they had to climb down the edge for some reason.  There was another part where people only communicated telepathically and when sneaking into somewhere he only thought of light.  One of the main things is the floating ships and how he is really good at flying them and he assembles a team for a mission or something.  There is like float powder and stuff.  I read this close to 10 years ago.
Injectivity of Homomorphism in Localization Let $\alpha:A\to B$ be a ring homomorphism, $Q\subset B$ a prime ideal, $P=\alpha^{-1}(Q)\subset A$ a prime ideal. Consider the natural map $\alpha_Q:A_P\to B_Q$ defined by $\alpha_Q(a/b)=\alpha(a)/\alpha(b)$. Suppose that $\alpha$ is injective. Then is $\alpha_Q$ always injective?    I think so, but I'm clearly being too dense to prove it! My argument goes as follows.  Let $\alpha(a)/\alpha(b)=0$. Then $\exists c \in B\setminus Q$ s.t. $c\alpha(a)=0$. If $B$ is a domain we are done. If not we must exhibit some $d\in A\setminus P$ s.t. $da=0$. Obviously this is true if $c =\alpha(d)$. But I don't see how I have any information to prove this!  Am I wrong and this is actually false? If so could someone show me the trivial counterexample I must be missing?   Many thanks! Why would Antimatter behave differently via Gravity? "Its" as a Possessive Pronoun In Drupal 7, I used the Secure login module to run the site on a secure connection, but it seems it doesn't revert back to http on logout. I would like to just run the whole site as https:// as a simplification.  Is there a simple way to do this without the use of module? I've just updated to macOS 10.12 and when I try to execute srm in Terminal, it says -bash: srm: command not found.   Is srm removed? How to fix this? Android does not download any files from untrusted CA certificate site I have a large amount of duplicate records (25.000) in an even larger table (250.000 records). I've done the detection using the reporting function. The criteria I used to detect the duplicates were 3 fields (unique account identifier, unique user identifier and date). Based on a list of criteria, I would like to either merge or delete these records. I've got a handle on the logic associated with the merging and the deleting but what I'm having trouble with is defining the duplicate detection process.   I'm looking at either creating a custom object to take care of the detection or dumping the records into an SQL database and taking care of it offline. Any thoughts on which one of the two is the best approach?  Edit:  After reading the first comment, I think the more appropriate question would be "How do I approach the problem in SOQL".  The object I'm working with is the Event object and I'm really only looking at the standard fields, AccountId, OwnerId and ActivityDate. From what I've found online, there's no easy way to find records that have the same value for these three fields. I think it could be accomplished by nesting SOQL queries but I'd like to use a different approach if at all possible. A better serial voting trap Currently we capture fanatic, voting ring or rage-type activities, by measuring the number of up-votes or down-votes between the same two users in a certain (relatively short) time period. When this is detected by the system, the votes are reversed, and I've never bothered to investigate what else happens after that - though I'm sure some form of wrist-slapping ensues.  While it is intended to be well-guarded for obvious reasons, the algorithm used is not exactly a secret, and I am sure there are plenty of examples where people are dangling (maybe intentionally, or maybe by dumb luck) just on the safe side of getting caught.  Personally I believe there are active, intentional, long-term vendettas in operation right now where users either:   blindly up-vote every answer from a user; or, down-vote a particular user once or twice a day, regardless of topic or quality.   Now, maybe the first one is valid - if I'm operating in the same tag-sphere as some smart person, it may just be that I'm constantly enthralled with their answers, and I'm not even noticing who they're written by. (Though, even Skeet isn't perfect, and I haven't up-voted every answer I've seen him post.)  But still, can we do a better job of catching - or at least noticing - this activity over the long term in addition to the short term?  The behavior is the same, and shouldn't be tolerated, regardless of the time frame - vengeful rage serial voting, blind staker crush serial voting, and painstakingly patient serial voting are all undesirable behaviors IMHO.  I'm not saying it has to do anything automatically, as I'm well aware of the possibility of false positives. And I'm not even sure what to propose as a time frame or a vote threshold.      But if a large percentage of my up-votes or down-votes are against a particular user, and especially if on a majority of those posts I am the only one voting in that direction, I think it should at least be raised as some kind of flag to moderators.   This would work much like how other suspicious activity is highlighted (but also not dealt with automatically). If a pattern becomes obvious and persists, then they can intervene in some way (or not, but at least they were provided with the information - just like they can reject and ignore manual flags). Today, all I can do is e-mail team@stackoverflow.com, and unless I know exactly which person(s) are involved, there is not much they can do about it.  And you're thinking, "Meh, let some hater down-vote you once or twice a day. Unless all you're posting is utter crap, it should be statistically insignificant." You're right. But reputation is not the point, and is not the motivation behind my request. What I'd like to see curtailed is the tendency for folks to down-vote a question or answer because of who posted it, not because of what it said or didn't say. When a down-vote is personal it can leave a person second-guessing the quality of their post. Which isn't necessarily a bad thing, except when it happens repeatedly.  Sorry for the essay but I wanted to try to anticipate and cover all the objections and hole-poking. php sort associative arrays by keys that those keys exist in other array SSH and home directory permissions This baby-walking device is called a ([prefix]-)[name] by people from [location] What's the difference between mobile and desktop processors? This is my first question.   Let $a_1, a_2,\ldots, a_k$ be natural numbers $\leq n$ with $m$ prime factors.  Let $p_1, p_2, \ldots, p_r$ be the prime numbers $\leq n$.   Let $$C_{m,n} = \frac{\sum_{i=1}^{k}a_i}{\sum_{i=1}^{r}p_i}$$ Does the following limit exist when $m\geq 2$? Obviously, when $m=1$,  $C_{1,n}=1$.  $$\lim_{n\to \infty} C_{m,n}$$  I have some guesses but not defendable enough.  My best,  The FM. is a psychological phenomenon wherein an individual is convinced that they do not deserve the success that they have achieved despite (perhaps extensive) empirical evidence to the contrary.  Some people with imposter syndrome doubt their own ability level. For me, this usually manifests in the thought:  I've somehow convinced everyone into believing that I'm actually good at this.  followed by the horrifying notion that eventually I'll be found out and my world will collapse. I believe that the imposter syndrome is not uncommon in academia. I'm interested to know how other people here have experienced and dealt with it.  In particular, I'm looking for actual tactics that someone might use to combat imposter syndrome.   Why I asked this question: Beyond the obvious reason that this is something I have struggled with for many years and only recently gotten a handle on myself, there's also some evidence that merely realizing that other people experience imposter syndrome helps fellow imposters. As a grad student, I've managed to meet a fair number of people who are in their own struggles with imposter syndrome; however, the tactics and self-trickery that have helped me don't always speak to them and perhaps someone else's methods might. How can I retain HTML form field values in JSP after submitting form to Servlet? Is there a way to prove that the order of an element in a Group divides the order of the Group, WITHOUT USING LAGRANGE'S This is a very easy fact we use in Group Theory,  But somehow, I wondered that whether there may be another way (other than Lagrange's Theorem) to prove that the order of an element divides the order of Group.  I attempted to go on the term "exponent" of the Group (just assume that G is a Finite Group), which we may define the least common multiple of orders of elements in G. But this exponent divides $|G|$, since the order of each element divides $|G|$. So it became a little paradox.   Shall I think that; before teaching this fact in a Course, one should teach about Lagrange's first? Let $\omega := dx \wedge dy$ denote the standard area form on $\mathbb{R}^2$. As the question title suggests, does there exist a $1$-form $\alpha$ with $d\alpha = \omega$? Find the derived subgroup of $A_4$ Find the derived subgroup of $A_4$.   Since it is $A_4$, for a permutation $\sigma$ to be in $A_4$, $\sigma$ must have a cycle structure of $2$ cycles. Therefore, $\sigma=(ab)(cd)$.  The commutator of such elements, would be obviously another permutation of $2$-cycle (of length $2$).  Does it mean that $A'_4=A_4$? If I design a PC for use as an NPC, how much XP should he give when killed? As part of an early quest, my PCs are likely to face off against a wizard.  The problem here is that the stat block for Mage NPCs listed in the Basic Rules has a Challenge Rating of 6, while the PCs are going to be five Level 1s. So, instead of messing with the stat block and risk weakening it too much/too little, I'm choosing to create a Level 1 Wizard PC and use it as an NPC for this quest.  The problem with that is that, as far as I can tell, there aren't any designated rules for assigning either Challenge Ratings or XP values to a PC. So, should I just give the wizard a Challenge Rating equal to his level (and thus have him give 200 xp when killed), or is there a better way to do this?  (This is different from , because he's asking for a way to assign a level to an NPC, while I'm asking for a way to assign an XP value/Challenge Rating to a PC (for use as an NPC). Similar questions, but different.) How to prove $\sum_{n=0}^{\infty} \frac{n^2}{2^n} = 6$? I'd like to find out why  \begin{align} \sum_{n=0}^{\infty} \frac{n^2}{2^n} = 6 \end{align}  I tried to rewrite it into a geometric series  \begin{align} \sum_{n=0}^{\infty} \frac{n^2}{2^n} = \sum_{n=0}^{\infty} \Big(\frac{1}{2}\Big)^nn^2 \end{align}  But I don't know what to do with the $n^2$.