Disclaimer: New to stack overflow. In the Julia language the eval(parse()) ability comes in very useful. Example: eval(parse(&quot;x = 5&quot;)). I'm wondering if there is an equivalent in python, I get the consensus that this is a no. If it is a no why? Surely it would be a useful addition to the language.
How do I execute a string containing Python code in Python?
Is there implementation of tri-planar mapping in Cycles renderer? Is it possible to have tri-planar mapping in cycles?  Like in corona renderer or fstorm? What is the relationship between redshift and conformal time ?   For example in a paper i found:   taking $z_e = 3234 $ at the time of radiaton-matter equality yields the conformal time $\frac{\eta_e}{\eta_0} = 0.007$ and taking $z_E=0.39$ at matter-$\Lambda$ equality yields $\frac{\eta_E}{\eta_0}=0.894$ and setting redshift at decoupling $z_d=1089$ yields $\frac{\eta_d}{\eta_0} = 0.0195$  where $\eta_0$ is the present decoupling time.  Further some cosmological parameters are given as :  $\Omega_r = 8.36 \times 10^{-5}, \Omega_m = \Omega_b + \Omega_{dm} = 0.044 +0.226, \Omega_\Lambda = 0.73,  H_0=0.72$  Now how can i calculate all those $\eta_e, \eta_E, \eta_d, \eta_0$ from given redshift values and/or above parameters ? I searched whole of my text books trying to find an explicit relation for conformal time $\eta$ but all i got was $ \mathrm{d}t=a(t)\mathrm{d}\eta$. Any help would be very helpful. I am a medical doctor in Pakistan. I have been on a career break to allow myself to study full time for the IELTS exam (from which I recently got the required band score) and PLAB 1. I have now registered and paid for the PLAB 1 exam in UK for June 2016, as the next sitting in Pakistan is in November 2016 and I feel like I am ready to do the exam sooner.  Due to having no current employment, my savings are limited (around 25,000 Pakistani Rupees) but I live with my parents and do not have any financial commitments at home.  My savings have depleted in the past ten months whilst I have taken a career break and the money has been used for my own personal expenses. My trip to the UK is being funded by my grandfather who is a British citizen. He is a retired doctor with a good NHS pension. He has provided me with:   6 months bank statements which clearly show his pension deposits   Letter from NHS Pensions stating his pension   Sponsorship letter stating that he will pay for my PLAB exam fee, travel, accommodation and subsistinence costs whilst in the UK   Copy of British passport  Document confirming that he owns the house he lives in mortgage-free Confirmation email from GMC stating he has paid the PLAB exam fee.   Without large personal savings and no current job (but I have job offers now) would my application be rejected or is the strong sponsorship going to be good enough?  Are there any other documents I should consider submitting that may help me get a visa? When referring to flash exposure, what does "max sync speed" mean? I am given this problem: let $a\ge0$,$b\ge0$, and the sequences $a_n$ and $b_n$ are defined in this way: $a_0:=a$, $b_0:=b$ and $a_{n+1}:= \sqrt{a_nb_n}$ and $b_{n+1}:=\frac{1}{2}(a_n+b_n)$ for all $n\in\Bbb{N}$    To prove is that both sequences converge and that they have the same limit. I don't know how to show this. I have spent 2 hours on this, no sign of success Is it possible to set a DNS record to redirect all example.com/* traffic to www.example.com/*?  I'm running a  app on Heroku's .  I set up , and the documentation discusses . I also read about how to do this with . However, I'm wondering if there's a way to do this via DNS, i.e., without hitting my app. I'm wondering whether I should use the present tense for a descriptive statement but in a past context. For example:     (1) I went to the zoo and saw a giraffe last week.       (2) A giraffe is a mammal with long neck.       (3) It is the first time I see that animal with my own eyes.   Statement (2) is a description of a giraffe in general, not the specific one in the zoo, so is it correct to use is?  Statement (3) is an event that is still true now, so should I use is and see?  I'm not native speaker so forgive me if the question is very obvious to others. How do I verify a PGP signature? What GUI (no command line) software or websites can I use to verify a PGP signature?  If I have a message like this  -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1  Because anyone can claim to be me. There's no validation of the user name or email address when someone posts a comment. While I do try to remove imposters, some may slip through. By signing my comments using this technique, anyone can independently verify that I was the author of the message by validating the signature. -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (MingW32)  iD8DBQFFxqRFCMEe9B/8oqERAqA2AJ91Tx4RziVzY4eR4Ms4MFsKAMqOoQCgg7y6 e5AJIRuLUIUikjNWQIW63QE= =aAhr -----END PGP SIGNATURE-----   How can I verify the message against the public key to get the same signature back?  This  does not allow me to do that. Propagate all arguments in a bash shell script using trial and error in math problems Suppose one bacterium is in a jar at 12AM, and then suppose there are two bacteria at 12:30AM,  and then there are four bacteria at 1AM, etc.  (a)  How many bacteria will be in the jar at 12PM that day?  (b)  Use trial and error to estimate at what time there will be 1 billion (1,000,000,000) bacteria in the jar.  for a) is it going to be 44 bacterias ? or am i wrong? Please help with b), i have no idea how to figure it out in short term Thanks When does HashSet 'add' method calls equals? How to change the default fonts in Windows 10 I have read the entries for other OS versions.    Changing the MS Shell Dlg (2) entries in FontSubstitues registry key doesn't seem to work (in Windows 10), or it works in two minor places.  I don't have access to a Windows 95/98/etc. machine, the "earliest" I have is Windows 8.1, so I can't use the Plus directory trick either (directory doesn't exist). For the WindowMetrics registry entry, I seem to have all the *Font keys to be set to the font I want, but that doesn't seem to be doing the trick (on Windows 10). For Windows 8/8.1, there was a program called Windows 8 Font Changer, which worked like a charm, but doesn't seem to on Windows 10 (though it was probably that program run that changed the fonts in the WindowMetrics).   Thanks.   Update: One more method that came out that is perhaps still not the solution: Winaero Tweaker (winaero.com), as it has some issues, the biggest two of which seem to be:   If you have changed the size of text etc. from: "Settings –> Display –> Advanced display settings –> Advanced sizing of text and other items –> set a custom scaling level (not recommended)", the changes do not stick upon a logoff-login or restart. You need to have changed it, if at all, only through "Settings –> Display –> Change the size of text, etc." (which goes up to only a certain percentage, depending on the maximum resolution of your device – 125% on a tablet of mine, which I was able to set to 175% or even 200% with the other, older method that is now apparently listed as not recommended).  Even though it lists a number of items to change the font and size of, not everything gets changed. A typical example of this is the right click menu on the desktop, which still shows the View, Sort By, etc. items in the default font, however much it has a clear 'Change menu font' item. I would like to know if there is a word or phrase for a systematic campaign to annihilate every descendant of a particular ancestor.   We have the word 'genocide' for killing off an entire race, and plenty of words for killing people based on how they are related to you (fratricide, filicide, et. al.), but looking over the  and the , I couldn't find a term for systematically killing an entire bloodline.   My question is prompted by a US news story about the horrific murder of 8 members of the same family, but those murders are not an example of what I'm thinking of because the children of the victims were left alive, so the motive for the killings was not to kill off the bloodline. The sense that some group had coordinated an attack against just one family is what made me wonder what the "not an entire race, just one bloodline" version of 'genocide' would be called.   Searching the Internet for "kill off" and bloodline sends me straight into the land of vampires, Illuminati, reptilian overlords, and, naturally, Priory of Sion nonsense so I haven't had much luck finding a thread to pull.   It may be that there is no word for it in the sense of murdering a human bloodline, because we just don't attempt kill off our royals down to the last heir often enough to coin a term for it. Maybe there is a scientific term for culling a line from a test population as part of biological research? Prove that if b is coprime to 6 then $b^2 \equiv 1 $ (mod 24) Let $\gcd(b,6) = 1$. Prove that $b^2 \equiv 1 $ (mod 24).  Now I have that as $\gcd(b,6) = 1$, we know that  $3\nmid b $ and $2\nmid b$ (else the GCD would be 3 or 2 resp.)  So as $2\nmid b$, $b$ must be odd. Hence $b^2$ is also odd.  Then I'm not sure where to take it from here? Maybe I've gone down the wrong path to start with, and should be looking more along the lines of the Chinese Remainder Theorem? I'm not sure. How can I match multiple occurrences with a regex in JavaScript similar to PHP's preg_match_all()? I am trying to parse url-encoded strings that are made up of key=value pairs separated by either &amp; or &amp;amp;.   The following will only match the first occurrence, breaking apart the keys and values into separate result elements:  var result = mystring.match(/(?:&amp;|&amp;amp;)?([^=]+)=([^&amp;]+)/)   The results for the string '1111342=Adam%20Franco&amp;348572=Bob%20Jones' would be:  ['1111342', 'Adam%20Franco']   Using the global flag, 'g', will match all occurrences, but only return the fully matched sub-strings, not the separated keys and values:  var result = mystring.match(/(?:&amp;|&amp;amp;)?([^=]+)=([^&amp;]+)/g)   The results for the string '1111342=Adam%20Franco&amp;348572=Bob%20Jones' would be:  ['1111342=Adam%20Franco', '&amp;348572=Bob%20Jones']   While I could split the string on &amp; and break apart each key/value pair individually, is there any way using JavaScript's regular expression support to match multiple occurrences of the pattern /(?:&amp;|&amp;amp;)?([^=]+)=([^&amp;]+)/ similar to PHP's preg_match_all() function?  I'm aiming for some way to get results with the sub-matches separated like:  [['1111342', '348572'], ['Adam%20Franco', 'Bob%20Jones']]   or   [['1111342', 'Adam%20Franco'], ['348572', 'Bob%20Jones']] How to quickly send commands to nested tmux sessions? I have the following in my .tmux.conf  set -g prefix M-j bind-key j  send-prefix   I need to press (Atl+J) + (J) + bound-key to send something to the nested tmux session. I feel it is rather slow. Is there any better way? For example, I would love to be able to do (Alt+J) + (2x bound-key) to do stuff in the nested session. I constantly execute commands in the top tmux session instead of executing them in the nested one. Also, how come everybody binds prefix to C-a? I find it awfully slow and unpleasant to type this combination. Am I missing something? What's the quickest Schengen consulate to issue a visa in London? Terence Tao, Analysis I, Ex. 5.5.2: Entry point needed Terence Tao, Analysis I, 3e, Exercise 5.5.2:     Let $E$ be a non-empty subset of $\mathbb{R}$, let $n \ge 1$ be an   integer, and let $L &lt; K$ be integers. Suppose that $K/n$ is an upper   bound for $E$, but that $L/n$ is not an upper bound for $E$. Without   using Theorem 5.5.9, show that there exists an integer $L &lt; m \le K$   such that $m/n$ is an upper bound for $E$, but that $(m-1)/n$ is not   an upper bound for $E$. (Hint: prove by contradiction, and use   induction. It may also help to draw a picture of the situation.)    does not do the trick for me, since I'm looking for the proof by contradiction, equipped only with the set of propositions and theorems covered so far.  What I'm actually looking for is an entry point to the proof, since I find it quite hard to negate the assumption.  My attempt is to induct over $n$. Assume I have been able to prove the statement for $n = 1$, is the following a valid negation of the assumption?  For all integers in the range $(L, K]$, at least one of the following statements holds:   $(m-1)/(n+1)$ is not an upper bound and $m/(n+1)$ is not an upper bound. $(m-1)/(n+1)$ is an upper bound and $m/(n+1)$ is not an upper bound. $(m-1)/(n+1)$ is an upper bound and $m/(n+1)$ is an upper bound.   If I were able to prove that there is an integer in the given range such that none of the above holds, am I done?       Theorem 5.5.9 (Existence of least upper bound). Let $E$ be a non-empty subset of $\mathbb{R}$. If $E$ has an upper bound, (i.e.,   $E$ has some upper bound $M$), then it must have exactly one least   upper bound.     I went through another loop considering  of Steve Kass, but I ended up wondering why the proof needs induction at all:  Assume for all integers $m$ where $L &lt; m \le K$ we have that $m/n$ and $(m-1)/n$ are upper bounds of $E$. Then $(m-1)/n = L/n$ is also an upper bound. But $L/n$ is no upper bound, by assumption. Assume $m/n$ and $(m-1)/n$ are no upper bounds. Then $m/n = K/n$ is also no upper bound. But $K/n$ is an upper bound, by assumption.   Hence, there is an integer in the range $(L, K]$ s.t. $m/n$ is an upper bound for $E$, and $(m-1)/n$ is not. Highlight whole TreeViewItem line in WPF What's the best way to version CSS and JS URLs?