is a disease of having abnormally large size.  Is there a grammatical rule that says that it should be called "gigantism" and not "giantism"?
A little look through an etymology dictionary shows that the root is Latin gigas with adjective form gigant.  So in its derivation to English, why did the second "g" get retained in gigantic but was dropped from giant?  I have an inkling that the word giant may have travelled through French on its way to English, where it may have been pronounced "gee-yant" or "jee-yant" with a change to the second "g" that was then dropped when taken into English.  However, the "g" is retained as a hard "g" in gigantic.
Bibliography per chapter with continuous numbering I would like to create a document with two chapters. After the first chapter there should be a bibliography. The next chapter should be able to reference items of the former chapter, but only show the new items in its bibliography, starting with the next number from the first bibliography.  Example:     Chapter 1 - The Fu   Fu has been done by Bar [1]. Early versions ...   Bibliography   [1] Bar et. al., Doning the Fu      Chapter 2 - Compining Fu with Herp   Doning Fu as described in [1]   neglects the advantages of Herp pointed out by Derp [2].   Consequently ....   Bibliography   [2] Derp et. al., The Advantages of Using Herp   Please not too much discussion about if that is a friendly-to-use idea, it is not my own demand :) The  lists various combinatorial objects that are described by them. I posit that there might be bijections between these various combinatorial objects. For some of them (like Dyck paths, correctly matched parentheses and paths from the bottom left to top right of a $2n \times 2n$ grid) they are quite obvious.   I was then trying to find a bijection between the number of Dyck words and the number of ways of associating $n$ applications of a binary operator to $n+1$ items (third one on the list). I attempted to do this for a simple case ($n=3$ which is the example provided in the Wikipedia article). However, couldn't find one after multiple hours. Is it reasonable to expect such a bijection will exist? If so, how do we go about finding it?    EDIT: In addition to the very nice answer by @Marc, the following page also helped me see the bijection:   "Let $P$ be the Dyck path and $f(P)$ be the binary tree. If you go up in the Dyck path, create a left child. Otherwise, go up one vertex until creating a new right child is possible and create one."    Here is one of my attempts:   Number of Dyck words with length $2 \times 3$ is $\frac{6 \choose 3}{4} = 5$. They are:  hhhttt; hhthtt; hhttht; hthhtt; hththt  And the number of applications of a binary operator among $3+1=4$ factors is:  ((ab)c)d;     (a(bc))d;     (ab)(cd);     a((bc)d);     a(b(cd))  Both combinatorial objects have been arranged in a way that there is some kind of ordering between them. For the Dyck words for example, if h equals +1 and t equals -1, then the order is lexicographical from the left to the right of the cumulative score along the sequence.   Now, the first and last characters of the Dyck words are always h and t respectively. So, we can ignore them. We are left with:  hhtt; htht; htth; thht; thth  I tried to start from the left of the sequence abcd and if I see 'h', merge the character with the one to its right. This approach didn't produce a valid mapping from the third Dyck word to the third binary operator precedence order. At what time intervals does ntpd update the time? I'm running the latest ntpd.   When I start ntpd my system time synchronizes with ntp server's ntp. After synchronizing I changed my system time manually using date command date -s '1997-02-22 12:00:00'   My system time got changed as per the date command.   NTPD is still running, I want to know at what time interval my system time will sync with the internet via ntp. The Windows 8 version of Google Chrome seems to have been updated to support the UI formerly known as Metro.  However, this seems to be the only option now, which means that I can no longer use Chrome on my netbook.  How do I get Google chrome to work in classic desktop mode on Windows 8?  Thanks Referee says the proof is wrong, but it is not, what to do? About 3 months ago, my co-author and I submitted a mathematical paper to a journal. Yesterday, we got the editor's response and the paper has been rejected. The reason is that the referee thinks that our results are wrong or trivial.  However, we carefully read the referee's report and we conclude that the "errors" pointed out by the referee are not errors at all and that our proofs are correct. In all modesty, we think that the referee understood very poorly even the statements of our theorems.  Personally, this is the first time that such a situation occurs to me. I already have four papers published in such journal and the reports I got from the referees have been always really accurate.  What do you think is the best thing to do? Forget about and try another journal? Write an e-mail to the editor explaining why we disagree with the decision? Other ideas?  EDIT: Thank you very much for all your answers. At the end, we submitted our paper to another journal with only some slight edits we have already planned to do independently by the referee's report. From question . You have to use \r when replacing text for a newline, like this  :%s/%/\r/g   But when replacing end of lines and newlines for a character, you can do it like:  :%s/\n/%/g    What section of the manual documents these behaviors, and what's the reasoning behind them? What software can join videos? What's the best &amp; easiest GUI software that can join a video that I have downloaded in several parts? Can the rogue repeatedly hide in combat to sneak attack the same enemy? One of my players is a rogue and has been, on his turn, using Cunning Action to hide as a bonus action and immediately afterwards attacking. I have been ruling that this does work to grant him advantage as an unseen attacker as I believe that is the RAW, but it seems a little strange. Is he really, in the span of 6 seconds, ducking behind a corner and popping back out and this completely disorientates his target? I guess I just wanted to make sure I was ruling correctly. How to Convert Persian Digits in variable to English Digits Using Culture? I updated a virtual machine running Ubuntu server 15.04 to the just released new stable 15.10.  There were no apparent problems, but after reboot the machine lost its network connection. lspci showed the correct card and lsmod proved that the driver had been loaded.  Hints about editing or removing /etc/udev/rules.d/70-persistent-net.rules did not succeed (still no network, no new file), the famous /lib/udev/write_net_rules did not even exist.  I don't have much clue regarding udev and systemd, so it took me some time to find in /sys/class/net that the network interface name changed. It became ens32, which was renamed from eth0. After I changed /etc/network/interfaces network communication was enabled again.  But - why does this happen at all? And if it happens, shouldn't the interfaces file be updated automatically?  Now that I deleted the virtual network card and created another one, eth0 becomes eno16777728, which is not so, uhm, nice.  Should this behaviour (at least that of the upgrade procedure) be reported as a bug?  Furthermore, is /etc/udev/rules.d/70-persistent-net.rules obsolete now? And (although only partly related) what about /etc/udev/rules.d/70-persistent-cd.rules?)  Edit - additional question (after accepted answer) The dependency of /etc/network/interfaces from the actual interface name bothered me. I tried a new installation of *ubuntu in another virtual machine. To my surprise, /etc/network/interfaces contained a reference to the loopback device only. However, with my original VM this change prevented the network to come up. So what else do I need to change?  Edit Well, from another test I found that a new Ubuntu Server has the network interface card in /etc/network/interfaces, while XUbuntu has not. Maybe it is using network-manager or something else. I am trying to get the SIDs of users and groups by querying  get-wmiobject -query 'select groupcomponent,partcomponent from win32_groupuser`   output:  __GENUS          : 2 __CLASS          : Win32_GroupUser __SUPERCLASS     : __DYNASTY        : __RELPATH        : Win32_GroupUser.GroupComponent="\\\\COMPUTER\\root\\cimv2:Win32_Group.Domain=\"TESTDOMAIN\",Name=\                    "Schema Admins\"",PartComponent="\\\\COMPUTER\\root\\cimv2:Win32_UserAccount.Domain=\"TESTDOMAIN\"                    ,Name=\"Administrator\"" __PROPERTY_COUNT : 2 __DERIVATION     : {} __SERVER         : __NAMESPACE      : __PATH           : GroupComponent   : \\COMPUTER\root\cimv2:Win32_Group.Domain="TESTDOMAIN",Name="Schema Admins" PartComponent    : \\COMPUTER\root\cimv2:Win32_UserAccount.Domain="TESTDOMAIN",Name="Administrator"   groupcomponent is a win32_group ().  win32_group is contains an SID ()  However the groupcomponent here is a string and not a win32_group as   get-wmiobject -query 'select groupcomponent.sid from win32_groupuser'   is an invalid query. How can I access groupcomponent's members as a win32_group? Which is the correct tense to use with 'by'? I gave him the money by 6 PM.   I had given him the money by 6 PM.   I can't spot the difference between them and both seem right, but I was told the first one is wrong. Can anyone say, why?  Here is a another set of sentences with the same issue:     By 5 PM I gave him the book.   By 5 PM I had given him the book.   In both the sentences the book was given before 5 PM and no later than 5 PM. But I can't understand then what the difference between them is.   Is it right to use simple past with 'by' at all? If yes, then why and if not, then why is it incorrect to use simple past with 'by'? find out which program pops up a command line window I have windows 10 home and from time to time I see a command line window popping up for less than a second. I want to find out which process is causing that. It's not very often that this window pops up so I need some tool that can run for a long time.  Does anyone have a good idea?  Regards Tobias What does the big intersection or union sign of a set mean? In some cases, we will have to consider the union or the intersection of several, even infinitely many sets, defined in the obvious way. For example, if for every positive integer $n$, we are given a set $S_n$, then   $$\bbox[border:1px solid red]{\bigcup_{n=1}^\infty S_n}=S_1\cup S_2\cup\cdots=\{x\mid x\in S_n\text{ for some }n\},$$   and   $$\bigcap_{n=1}^\infty S_n=S_1\cap S_2\cap\cdots=\{x\mid x\in S_n\text{ for all }n\}.$$   Two sets are said to be disjoint if their intersection is empty. More generally, several sets are said to be disjoint if no two of them have a common element. A collection of sets is said to be a partition of a set $S$ if the sets in the collection are disjoint and their union is $S$.   Normally what I know is that you can make a union or an intersection between only two sets. In this expression, there is a big union of sets. I'm asking about the meaning of this expression – what does it mean? What does the infinity sign do at the top?  Things are even more complicated with De Morgan's laws, which use the same expression:     Two particularly useful properties are given by De Morgan's laws which state that   $$\left(\bigcup_nS_n\right)^c=\bigcap_nS_n^c,\quad\quad\quad\quad\left(\bigcap_nS_n\right)^c=\bigcup_nS_n^c.$$   Anyone who can explain to me the expression or De Morgan's laws would be much appreciated. What does "preceding" mean in Oracle? If $(A-2I)^3(A+2I)^2=0$, then what are the possible Jordan canonical forms of $A$? Here is the exercise:     Let $A$ be a $5\times5$ complex matrix such that $(A-2)^3(A+2)^2=0$, where we define $A-\mu:=A-\mu I$ for scalar $\mu$. Assume that $\lambda=2$ is an eigenvalue of $A$ and its geometric multiplicity is at least $2$. What are the possibilities for the Jordan canonical form (JCF)?   What I know so far from the assumption is that    the minimal polynomial of $A$ is of the form $f(x)=(x-2)^i(x+2)^j$ where $1\leq i\leq 3$ and $0\leq j\leq 2$.  The number of blocks in the Jordan segment $J(2)$ is at least $2$.    One can write the possible minimal polynomial one by one, which gives the information of the size of the largest block in each Jordan segment, and use the possible geometric multiplicity of $\lambda=2$ to find JCF.   Here are my questions:   Is there an alternative approach?  Can we use the characteristic polynomial of $A$ here? In what cases does the gerund stemming from a transitive verb take the direct object of that verb and when is a prepositional complement used?  For example:    Brown's deft painting of his daughter is a delight to watch (it is a delight to watch while Brown deftly paints his daughter). Painting his daughter is an outlet for his energy. Securing safety for prisoners is the main problem for the penitentiary system. The widely discussed problem of the securing of prisoners' safety was given priority. Loop-cut won't go all the way around Alright so I've seen some postings about loop cuts and done some research. I am very new to blender and modeling overall. I am trying to loop cut this concrete barrier. Now I'm following a tutorial and kind of did my own thing in some areas. I cleaned it up following some instructions in another answer here on stack exchange.  I can't for the life of me figure out why I can loop cut around the whole bottom:   ...but not the whole middle:   I see this marked as answered by another question. That question refers to ngons and inside faces. Now once again I'm totally new to this. I looked on the inside. I don't believe I have inside faces or any ngons by the terms I've read online in my research.  Here is a wireframe picture and the inside view:     Maybe I'm missing something the answers on other posts are saying. If so and you know what it is I'd be very appreciative of what it is. Load CSS/Javascript in frontend conditionally if block is used Assuming I have no infinite scroll or anything else going on in my theme: Is there a way to enqueue my custom Gutenberg block styles and scripts so they are only (lazy) loaded in the front-end when the block is really used? Something like is_active_widget, just for blocks?  If I enqueue them inside a enqueue_block_assets function they're added to any site.  On github, I found this  , but it sounds like it's more on bundling than conditional load, so I still hope they didn't leave that optimization opportunity out - otherwise any other site will soon be junked with 20 additional scripts from numerous Gutenberg block plugins people install and only use once on a page (think of large image gallery block scripts for example).  Thanks &amp; Regards! I have read questions about this, and people say that it is just to include the natbib package and the plainnat style. For some reason my references will not sort alphabetically. Any help on this would be much appreciated! I am really new to LaTeX ...  My commands:  \documentclass[a4paper,norsk]{article} \usepackage{amstext} \usepackage{makeidx} \usepackage{graphicx} \usepackage[comma,authoryear]{natbib} \usepackage[norsk]{babel} \usepackage[hmargin=3cm,vmargin=3.5cm]{geometry} \pagestyle{plain}  \begin{document}  \begin{thebibliography}{56}  \end{thebibliography}  \printindex  \bibliographystyle{plainnat}  \end{document}