For example:   I have a sister named Charlotte Martin has a brother named William Charlotte is married to Martin   Martin is my brother-in-law, but what is William to me?  I originally posted  on English.StackExchange. A commenter referred me to ask it on this stack.
Here at the Genealogy and Family History Stack Exchange we see many questions about relationship mapping which is also known as:   relationship calculation kinship terminology etc   If you are just trying to understand how to calculate "cousins and removes" then  provides an excellent guide.  However, if you are seeking an English term for a more complicated relationship between two members of an extended family, rather than asking a question like:          site users are encouraged to first review the answers below.    Note: This Q&amp;A arises from  and is set to  to help make it canonical.
Natural Sort in MySQL How do you start Windows 10 in safe mode? Count and limit the number of files uploaded (HTML file input) Is there a way to disable access to certain Settings components? Lower the amount of reputation needed to comment is a great example of people coming from Google and using answers as comments.  I understand the reputation threshold is there to prevent spam, but Answers are just as prone to spam as comments and you can post them at reputation 1. Furthermore there are already flags in place as a preventive measure for both.  Essentially the reputation threshold of comments is forcing people to use the site in ways the designers did not intend. Removal of the reputation cap would also make the site more new user friendly as newbies that use the site in this manner are commonly given a unfriendly welcome in the form of downvotes from people who forget you need 50 rep to post comments. Lock time not involved in MySQL slow query selection? I wish to analyze some read-write contentions problems on a very huge table where writes are very fast, less than 1ms in most case. The point is that the contention makes those write queries sometimes wait for the lock for a long time, i.e. hundreds of milliseconds. But the query itself remains very fast so it's not selected as a "slow query", which threshold is actually 10ms.  The only way to gather the information I need is to put à 0ms threshold so I can capture all queries, but it's not sustainable for more than 10mn on our production environment, where it would produce about 200MB of logs per minute.  In fact I can't understand why MySQL don't include the lock time, added to the execution time, for the slow query log selection process. At least, I wish there were an option for that.  Am I missing something ? Unable to shrink transaction log file in SQL Server I moved to a new company recently wherein they have 2 databases in a SQL server of size 20-25 GB. I'm unable to shrink the log file of the databases. Transaction log backup of the databases are set to run every 30 mins from 6 AM-7PM. They are of size 10 and 2 Gb respectively. I tried to shrink it around 8-9 PM last night but I was not able to do.  The log_reuse_wait column stated it's waiting on a log_backup. I tried taking couple of log backups which didn't help. I ran DBCC OPENTRAN but there are no open transactions.  Also, this morning even after the Tlog backups started at 6:00 AM till now(10:30) it still shows LOG_BACKUP in log_reuse_wait column. And no OPEN TRAN as well.  When I researched on this I found this article from Paul Randal:   It states that if the DB is small and all the content of tlog file is in same VLF it couldn't truncate. I have some 300-400 VLFs in the Databases. So that doesn't make sense here as well.   One thing I noticed that every morning at 6 AM the tlog is a little bigger than the other ones. So I'm thinking to check with the lead DBA to run tlog round the clock. Other than that, I would like to see why is this happening and Am i missing anything.  I tried to shrink with the below command:  Use DB1 go DBCC SHRINKFILE(2,10)  GO   Note: It's SQL 2012 instance running 0n 2012 compatibility What is the sponsored party called? Google results for sponsee have scattered definitions in unreliable sources, so it does not appear that is a real word. I'm looking for something similar, a single word.  The specific context is a social group membership application where new members must be sponsored (as in definition 2, here - "one who assumes responsibility for some other person or thing") by existing members. I am looking for a single word to describe the target of such a sponsorship. I am about to sponsor a fraternity, but I would like to have a more general word for what I'm sponsoring. Next time, the fraternity could well be a study club, or something else.  Therefore, what is the sponsored party also called? E.g. if I sponsor somebody, that person is my __? Case insensitive 'Contains(string)' Is there a way to make the following return true?  string title = "ASTRINGTOTEST"; title.Contains("string");   There doesn't seem to be an overload that allows me to set the case sensitivity.. Currently I UPPERCASE them both, but that's just silly (by which I am referring to the  issues that come with up- and down casing).  UPDATE This question is ancient and since then I have realized I asked for a simple answer for a really vast and difficult topic if you care to investigate it fully. For most cases, in mono-lingual, English code bases  answer will suffice. I'm suspecting because most people coming here fall in this category this is the most popular answer.  answer however brings up the inherent problem that we can't compare text case insensitive until we know both texts are the same culture and we know  what that culture is. This is maybe a less popular answer, but I think it is more correct and that's why I marked it as such. I need to start reading Lucifer comics, but I am having trouble figuring out where to start Do I read the Sandman stuff, or do I jump right into the main comics? Because I really want to maintain continuity, what's the right sequence to ensure that I get every bit of the story? A (not necessarily unitary) $R$ module $M$ splits into $B\oplus C$ where $B$ is unitary and $RC=\{0\}$. 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; Addition with NULL values How to restore original size and unboot my bootable USB pendrive What is the name for the grammatical device of putting "not" after a verb to negate it? Supremum and Infimum Let $A$ be a nonempty set of real numbers which is bounded below. Let $-A$ be the set of all numbers $-x$, where $x \in A$. Prove that $\inf A = -\sup(-A)$.   We know that $-A$ is bounded above. Hence $\sup(-A)$ exists. So to proceed, one would show that $\inf A \leq -\sup(-A)$ and $\inf A \geq -\sup(-A)$? Or $-\inf A &gt; \sup(-A)$ and $-\inf A &lt; \sup(-A)$.  I get the sense that one can use the following fact as well: (i) Let $\alpha = \sup S$. If $\beta &lt; \alpha$ then $\beta$ is not an upper bound for $S$. How to avoid interference in wireless communication? I am working on wireless communication system. We are using around 10 pairs of transmitter and receivers. We are using atmega16 microcontroller for encoding and decoding by USART ports.  Now we are able to transmit the data and receive the same in the receiver end, but there is a major problem, when we are finding the 2 transmitter data coming at the same time. The receiver is unable to get it due to interference.  Suppose one transmitter sends "SENDA" at the meanwhile another transmitter sends "GETTS", at that time the receiver can not receive proper data. As all the transmitters and receivers are working in same frequency, so this interference is occurring. How can I resolve this issue? Why I can't connect to VPS after changing OS from CentOS to Ubuntu? Given a real positive sequence $\{a_n\}$ such that $\sum_{i=1}^n a_i$ converges.  Prove that there exists a real sequence $\{c_n\}$ monotonically increasing to $\infty$ such that $\sum_{i=1}^\infty a_nc_n$ converges.  What I have done:  I have written $$\sum_{i=1}^{N+1}a_ic_i=c_{N+1}\sum_{i=1}^{N+1}a_i-\sum_{i=1}^N(c_{n+1}-c_n)S_n$$  and then try to prove the convergence by the Cauchy criterion. However my evaluation is still not good enough. I'm really stuck. Prove that if $a$ and $b$ are odd, coprime numbers, then $\gcd(2^a +1, 2^b +1) = 3$ Prove that if $a$ and $b$ are odd, coprime numbers, then $\gcd(2^a +1, 2^b +1) = 3$.   I was thinking among the lines of:  Since $a$ and $b$ are coprime numbers, $\gcd(a,b)=1$. Then there exist integers $x$ and $y$ such that, $ax+by=1$.   Then, $a=(1-by)/x$, $b=(1-ax)/y$  So if I write $2^a+1$ as:  $2^{(1-by)/x}+1$  Then can I say that the above expression is equivalent to 0 (mod 3)?