Xpath expression with both an ID and contains Text
Xpath expression with multiple predicates
I accidentally removed my /etc/apt/sources.list file. Is it hosted by Canonical somewhere so I can re-add it to the system? It's a bit of an emergency, so I hope someone can provide a quick answer. Solving functional differential equation $f'(x)=2f(2x)-f(x)$ Make \cite{my reference} show name and year I am trying to figure out how to make author's name and year show up every time I make a reference.  For example:  my_bibtex.bib has this entry:  @article{Franklin1999,  author = {Franklin Allen and Risto Karjalainen}, title = {Using genetic algorithms to find technical trading rules}, year = {1999}, volume = {51}, pages = {245-271}, journal = {Journal of Financial Economics}  }   If in my_paper.tex I use this line:  Important result has been found by \cite{Franklin1999}   My output looks like:  Important result has been found by [1]   But I want it too look like:  Important result has been found by Franklin 1999   I there a way to do it?  My bibliographystyle is set to plain  \bibliographystyle{plain}  \bibliography{my_bibtex} For my MAC laptop, I only have 250GB and out of this 250GB MAC is taking up 129GB in the other section. I looked everywhere to the best of my knowledge. Please note my home directories is only 45GB. Can you somehow please help me? How to prove that there exist no functions $f,g:\Bbb{R}\to\Bbb{R}$ such that $f(g(x))=x^{2018}$ and $g(f(x))=x^{2019}$? I have tried a little bit to solve the problem which goes as follows:   My intuition says that there exist no $f:\Bbb R\to\Bbb R$ such that $$f(g(x))=x^{2018}\text{ and }g(f(x))=x^{2019}.$$  Note that $$f(g(f(x)))=f(x)^{2018}\implies f(x^{2019})=f(x)^{2018}$$  Similarly, $$g(x^{2018})=g(x)^{2019}$$ Putting $x=1$ in $f(x^{2019})=f(x)^{2018}$, we get $f(1)=f(1)^{2018}$ and thus $f(1)=0$ or $f(1)=1$.  Similarly, putting $x=1$ in $g(x^{2018})=g(x)^{2019}$ we get $g(1)=g(1)^{2019}$ and thus $g(1)=0,1,-1$.  Now, I can't proceed further. Can anybody solve it? Thanks for assistance in advance. In linear regression, each predicted value is assumed to have been picked from a normal distribution of possible values. See below.  But why is each predicted value assumed to have come from a normal distribution? How does linear regression use this assumption? What if possible values are not normally distributed? Prove inequality using Schwarz's Lemma I'm having trouble proving the following:  Let $f$ be analytic on $D(0,R)$ and suppose there is a real constant A for which $\operatorname{Re}f(z) &lt; A$ for all $z \in D(0,R)$. If $f(0) = 0$, show that $|f(z)| \leq \frac{2A|z|}{R-|z|}$.   I was told to first start by showing that $|\frac{f(z)}{2A-f(z)}| \leq 1$ and also use the following result, which I was able to prove:  Let $f$ be analytic on $D(0,R)$ and let $f(0)=0$. If $|f(z)| \leq M$ for all $z \in D(0,R)$, then $|f(z)| \leq M|z|/R$ for all $z\in D(0,R)$.  Thanks in advance! Most of the time, it should be really easy to determine who is my ally and who is not. The people who try to kill me are most likely my foes, whereas the people who entered the dungeon with me are probably my allies.   But sometimes it’s not that simple. What if one of my party members got replaced by an evil doppelganger, who plans to kill me in the near future? What if one of my allies infiltrated the court of the evil king and I accidentally have to fight her, while she is (unbeknownst to me) under the effect of a  spell? What if a character fell in love with the BBEG and just wants to save him from himself, while the BBEG hates the character and actively tries to murder him?  Most spells and abilities that affect others specify the targets as “creatures” or “willing creatures”. Some explicitly affect allies only. That’s why I want to know, how to determine who’s allied with whom. Do I have to think that someone is my ally for someone to count as my ally? Does someone else have to believe to be my ally in order to count? Do both of us have to agree on being allies? Is there an objective observer who determines who’s allied? Can Person A be the ally of Person B, while Person B is not the ally of Person A?  There are many examples for spells/abilities that care about allies, among others:   the Exalted Champion feature from the  (SCAG, p. 132-133), that grants allies within 30 feet advantage on Wisdom saving throws. the Inspiring Surge feature from the  (SCAG, p. 128), that allows one or two allies within 60 feet to make a melee weapon attack as a reaction.   With features like this, you could accidentally affect someone who’s not actually your ally. You could fail to affect someone who is actually your ally, but you don’t know it (yet). Or you could affect someone who doesn’t want to be affected (because they don’t want to be allied with you). This all depends on the interpretation of the word “ally”. I’m not sure if "ally" is a defined game term (but I don’t think so), or if I have to rely on the dictionary definition. That’s why I want to ask:  How do I determine who’s allied with whom? ASP.NET MVC Relative Paths In my applications, I often have to use relative paths. For example, when I reference JQuery, I usually do so like this:  &lt;script type="text/javascript" src="../Scripts/jquery-1.2.6.js"&gt;&lt;/script&gt;   Now that I'm making the transition to MVC, I need to account for the different paths a page might have, relative to the root. This was of course an issue with URL rewriting in the past, but I managed to work around it by using consistent paths.  I'm aware that the standard solution is to use absolute paths such as:  &lt;script type="text/javascript" src="/Scripts/jquery-1.2.6.js"&gt;&lt;/script&gt;   but this will not work for me as during the development cycle, I have to deploy to a test machine on which the app will run in a virtual directory. Root relative paths don't work when the root changes. Also, for maintenance reasons, I cannot simply change out all the paths for the duration of deploying the test - that would be a nightmare in itself.  So what's the best solution?  Edit:  Since this question is still receiving views and answers, I thought it might be prudent to update it to note that as of Razor V2, support for root-relative urls is baked in, so you can use   &lt;img src="~/Content/MyImage.jpg"&gt;   without any server-side syntax, and the view engine automatically replaces ~/ with whatever the current site root is. How to capture the scale of a scene? What are the differences between a multidimensional array and an array of arrays in C#? An equivalence relation is defined by three properties: reflexivity, symmetry and transitivity.  Doesn't symmetry and transitivity implies reflexivity? Consider the following argument.  For any $a$ and $b$, $a R b$ implies $b R a$ by symmetry. Using transitivity, we have $a R a$.  Source: Exercise 8.46, P195 of Mathematical Proofs, 2nd (not 3rd) ed. by Chartrand et al How to filter uninteresting questions I am working on a proof about Dedekind cuts on the positive rational numbers. I have been stuck for a while on the following point and would appreciate any help.  Given $x\in \mathbb{Q}^+$ such that $x^2&lt;2$, how to find $y\in \mathbb{Q}^+$ such $y&gt;x$ and $y^2&lt;2$? What translation occurs when writing to a file that was opened in text mode that does not occur in binary mode? Specifically in MS Visual C.  unsigned char buffer[256]; for (int i = 0; i &lt; 256; i++) buffer[i]=i; int size  = 1; int count = 256;   Binary mode:  FILE *fp_binary = fopen(filename, "wb"); fwrite(buffer, size, count, fp_binary);   Versus text mode:  FILE *fp_text = fopen(filename, "wt"); fwrite(buffer, size, count, fp_text); This has puzzled me for years: How does Blender decide the window where it will display the rendered image when I hit F12 to render? mysqli_fetch_assoc() expects parameter / Call to a member function bind_param() errors. How to get the actual mysql error and fix it? I am getting this error:     SObject row was retrieved via SOQL without querying the requested   field: Contact.Account   Controller:  public class WrapperAccountCtrl {      public List&lt;Account&gt; acclist{get;set;}     public List&lt;Contact&gt; conlist{get;set;}      public List&lt;MyWrapper&gt; wap{get;set;}      public WrapperAccountCtrl()      {         acclist=[Select id,name from Account];          conlist=[Select id,name,AccountID  from contact where AccountID IN:acclist];          system.debug('Size----'+conlist.size());           wap=new List&lt;MyWrapper&gt;();           for(integer i=0;i&lt;acclist.size();i++)          {              wap.add(new MyWrapper(conlist,acclist[i]));          }     }      public class MyWrapper     {          public Account accn{get;set;}          public List&lt;Contact&gt;conrec{get;set;}          public MyWrapper(List&lt;Contact&gt; con,Account acc)         {             accn=acc;             conrec=con;             }     } }   VF Page:  &lt;apex:page controller="WrapperAccountCtrl" sidebar="false"&gt;       &lt;apex:form &gt;          &lt;apex:pageBlock &gt;              &lt;apex:pageBlockTable value="{!conlist}" var="c"&gt;                  &lt;apex:column value="{!c.account.Name}"/&gt;              &lt;/apex:pageBlockTable&gt;          &lt;/apex:pageBlock&gt;      &lt;/apex:form&gt;  &lt;/apex:page&gt; A reward becomes a penalty if I am working to build a reinforcement agent with DQN. The agent would be able to place buy and sell orders for a day trading purpose. I am facing a little problem with that project. The question is "how to tell the agent to maximize the profit and avoid the transaction where the profit is less than 100$".  I want to maximize the profit inside a trading day and avoid to place the pair (limit buy order, limit sell order) if the profit on that transaction is less than 100$. The idea here is to avoid the little noisy movements. Instead, I prefer long beautiful profitable movements. Be aware that I thought using the "Profit &amp; Loss" as the reward.  "I want the minimal profit per transaction to be 100$" ==> It seems this is not something that is enforceable. I can train the agent to maximize profit per transaction, but how that profit is cannot be ensured.  At the beginning, I wanted to tell the agent, if the profit of a transaction is 50 dollars, I will remove 100 dollars, then It becomes a penalty of 50 dollars for the agent. I thought it was a great way to tell the agent to not place a limit buy order if you are not sure it will give us a minimal profit of 100$. It seems that all I would be doing there is simply shifting the value of the reward. The agent only cares about maximizing the sum of rewards and not taking care of individual transactions.   How to tell the agent to maximize the profit and avoid the transaction where the profit is less than 100$? With that strategy, what guarantee that the agent will never make a buy/sell decision that results in less than 100 dollars profit? Does the sum of reward - # transaction * 100 can be a solution? What does an unprocessed RAW file look like?