Hypernym for "audio podcast", "radio drama", and "audiobook"
Hypernym for "audiobook", "podcast", "speech", etc.?
It  to disable internet search results in start menu searches before the Windows 10 Creators Update, but I've just clean installed a new Windows 10 Pro image and that setting is gone. Is there some way to disable it through editing the registry/etc? Review sections to be always in the same place System.QueryException: List has no rows for assignment to SObject I have this controller but I am getting this error      System.QueryException: List has no rows for assignment to SObject   public class MyController {     private final Account account;      public MyController() {         account = [SELECT Id, Name, Site FROM Account                     WHERE Id = :ApexPages.currentPage().getParameters().get('id')];             }      public Account getAccount() {         return account;     }      public PageReference save() {         update account;         return null;     } } How do I use the Tooling API to create a new Apex Trigger? How do I use the Tooling API to create a new Apex Trigger (rather than update an existing one)?  According to the  I need to specify the ContentEntityId as an existing Trigger Id. But in my case I don't have an Id because I've trying to create a new sObject.  If I omit the ContentEntityId I get an error back in the SaveResult:     Status Code: INSUFFICIENT_ACCESS_ON_CROSS_REFERENCE_ENTITY   Message: "insufficient access rights on cross-reference id"   The following is more or less a test case in C# that attempts to use the SOAP tooling API to create the new trigger.  SforceService toolingService = //... Get instance of the Tooling API  MetadataContainer container = new MetadataContainer(); container.Name = "Test" + DateTime.Now.Ticks;  SaveResult[] saveResult = toolingService.create(new sObject[] { container }); string metaDataContainerId = saveResult[0].id;  ApexTriggerMember apexTriggerMember = new ApexTriggerMember(); apexTriggerMember.MetadataContainerId = metaDataContainerId; apexTriggerMember.Body = "trigger TestOpportunityBeforeUpdate on Opportunity (before update) {\n//Horray\n}";     // Adding this will successfuly update the existing trigger //apexTriggerMember.ContentEntityId = "01q70000000GuzP";  SaveResult[] triggerSaveResults = toolingService.create(new sObject[] { apexTriggerMember }); Assert.AreEqual(1, triggerSaveResults.Length); SaveResult triggerSaveResult = triggerSaveResults[0]; if (!triggerSaveResult.success) {     Assert.Fail(triggerSaveResult.errors[0].message); } Assert.IsTrue(triggerSaveResult.success);  ContainerAsyncRequest containerRequest = new ContainerAsyncRequest(); containerRequest.MetadataContainerId = metaDataContainerId; containerRequest.IsCheckOnly = false;  SaveResult[] containerResults = toolingService.create(new sObject[] { containerRequest }); Basic photo editing on OS X Questions can be protected (i.e. marked "highly active").   What does it mean for a question to be protected? Why are some questions protected? Who can protect and unprotect questions? Who can answer a protected question? How are protected questions displayed? When should I protect or unprotect a question? When does the Community user protect a question? How do I stop my rim brakes making a squeaking/squealing sound? I bought a Schwinn Frontier Sport few months ago and started riding happily. After a few weeks my front rim brakes started creaking. It's so annoying in public places. My rear brake doesn't produce any sound but isn't as powerful as the front brake.  The retailer says cleaning would solve the front brake's issues and I got it cleaned, but nothing changed. Is there something I can do something myself to fix this? Proving $\lim_{n\to\infty} a^{\frac{1}{n}}=1$ by definition of limit given a sequence $a_n=a^{\frac{1}{n}}$ for $n\in\mathbb{N}^*$, $a\in\mathbb{R},a&gt;1$ then proof that $\lim\limits_{n\to+\infty}a_n=1$ by definition.   proof:  given $a_n=a^{\frac{1}{n}}$ for $a\in\mathbb{R},a&gt;1$.  for $n\in\mathbb{N}^*,n+1&gt;n\Rightarrow \frac{1}{n+1}&lt;\frac{1}{n}$ and because $a&gt;1$ we gets $a^{\frac{1}{n+1}}&lt;a^{\frac{1}{n}}$, since $\frac{1}{n+1}&gt;0$, then $1=a^{0}&lt;a^{\frac{1}{n+1}}&lt;a^{\frac{1}{n}}\Rightarrow 1&lt;a_{n+1}&lt;a_{n}$.  then we proof that $\lim\limits_{n\to+\infty}a_n=1$ we need to show that $\forall\epsilon&gt;0,\exists N,\forall n&gt;N,|a_n-1|&lt;\epsilon$  then for $\epsilon&gt;0$, choose $N=\frac{1}{\log_a(\epsilon+1)}$, since $a&gt;1$ we gets that $$\forall n&gt;N,1&lt;a^{\frac{1}{n}}&lt;a^\frac{1}{N}\Rightarrow0&lt;a^{\frac{1}{n}}-1&lt;a^{\frac{1}{N}}-1\Rightarrow |a^{\frac{1}{n}}-1|&lt;|a^{\frac{1}{N}}-1|=|a^{\log_a(\epsilon+1)}-1|=|\epsilon+1-1|=\epsilon\Rightarrow |a^{\frac{1}{n}}-1|&lt;\epsilon$$  wich implies that $\lim\limits_{n\to+\infty}a_n=1\square$  my proof to the limit is correct? I checked this  but didn't fully understand it.   I know that the volume of a right circular cone is $V = \frac{1}{3}\pi x^2h$  I know that I must take the first derivative and set it equal to zero, which will find the maximum.   My problem is how to deal with the variable $h$, the height?   How can I rewrite that in terms of $x$ or $r$.      I have tried to implicitly differentiate this equation, but that wasn't helpful for me. What to do when visa admission expires during lockdown? Understanding MCMC and the Metropolis-Hastings algorithm Over the past few days I have been trying to understand how Markov Chain Monte Carlo (MCMC) works. In particular I have been trying to understand and implement the Metropolis-Hastings algorithm. So far I think I have an overall understanding of the algorithm but there are a couple of things that are not clear to me yet. I want to use MCMC to fit some models to data. Because of this I will describe my understanding of Metropolis-Hastings algorithm for fitting a straight line $f(x)=ax$ to some observed data $D$:  1) Make an initial guess for $a$. Set this $a$ as our current $a$ ($a_0$). Also add $a$ at the end of the Markov Chain ($C$).  2) Repeat the steps bellow a number of times.  3) Evaluate current likelihood (${\cal L_0}$) given $a_0$ and $D$.  4) Propose a new $a$ ($a_1$) by sampling from a normal distribution with $\mu=a_0$ and $\sigma=stepsize$. For now, $stepsize$ is constant.  5) Evaluate new likelihood (${\cal L_1}$) given $a_1$ and $D$.  6) If ${\cal L_1}$ is bigger than ${\cal L_0}$, accept $a_1$ as the new $a_0$, append it at the end of $C$ and go to step 2.  7) If ${\cal L_1}$ is smaller than ${\cal L_0}$ generate a number ($U$) in range [0,1] from a uniform distribution  8) If $U$ is smaller than the difference between the two likelihoods (${\cal L_1}$ - ${\cal L_0}$), accept $a_1$ as the new $a_0$, append it at the end of $C$ and go to step 2.  9) If $U$ is bigger than the difference between the two likelihoods (${\cal L_1}$ - ${\cal L_0}$), append the $a_0$ at the end of $C$, keep using the same $a_0$, go to step 2.  10) End of Repeat.  11) Remove some elements from the start of $C$ (burn-in phase).  12) Now take the average of the values in $C$. This average is the estimated $a$.  Now I have some questions regarding the above steps:   How do I construct the likelihood function for $f(x)=ax$ but also for any arbitrary function? Is this a correct implementation of Metropolis-Hastings algorithm? How the selection of the random number generation method at Step 7 can change the results? How is this algorithm going to change if I have multiple model parameters? For example, if I had the model $f(x)=ax+b$.   Notes/Credits: The main structure of the algorithm described above is based on the code from an MPIA Python Workshop. I was reading about the equipartition theorem and I got the following quotations from my books:  A diatomic molecule like oxygen can rotate about two different axes. But rotation about the axis down the length of the molecule doesn't count. - Daniel V. Schröder's Thermal Physics. A diatomic molecule can rotate like a top only about axes perpendicular to the line connecting the atoms but not about that line itself. - Resnick, Halliday, Walker s' Fundamentals of Physics.  Why is it so? Doesn't the rotation take place that way? Virtual Box Toolbar Hidden. How to show? How to determine the direction of a wave propagation? In the textbook, it said a wave in the form $y(x, t) = A\cos(\omega t + \beta x + \varphi)$ propagates along negative $x$ direction and $y(x, t) = A\cos(\omega t - \beta x + \varphi)$ propagates along positive $x$ direction. This statement looks really confusing because when it says the wave is propagating along $\pm$ x direction, to my understanding, we can drop the time term and ignore the initial phase $\varphi$ while analyzing the direction, i.e. $y(x, 0) = A\cos(\pm\beta x)$, however, because of the symmetry of the cosine function, $\cos(\beta x)\equiv \cos(-\beta x)$, so how can we determine the direction of propagation from that?  I know my reasoning must be incorrect but I don't know how to determine the direction. So if we don't go over the math, how to figure out the direction of propagation from the physical point of view? Why $-\beta x$ corresponding to the propagation on positive x direction but not the opposite? When is the Killing form null? When is the Killing form $\kappa$ of a Lie algebra $\mathfrak g$ null, i.e. $\kappa(\cdot,\cdot)=0$? Surely this is true for any Lie algebra with trivial bracket, but is this the only case? I can't seem to find any nontrivial examples. Keeping chunks loaded in minecraft I have built an iron farm somewhere far away from my actual spawn chunks in my single player world. In hindsight, this was a dumb idea, but I can't exactly change it anymore. I'd like to keep the thing running all the time, so I'm looking for a way to keep the chunks loaded.  I'm running minecraft 1.12.1, is it possible at the moment? I have looked at some chunk loader mods, but chicken chunk loader hasn't been updated yet, and the others simply didn't work.  I have tried moving the spawn chunks, but that hasn't done anything either.  Edit: I have worked this out with IronAnvil, and it ended up being a render setting in optifine which didn't load them correctly somehow. It has been working fine after I reset my optifine settings to default. We need to prove that $$\dfrac{\sin\theta - \cos\theta + 1}{\sin\theta + \cos\theta - 1} = \frac 1{\sec\theta - \tan\theta}$$  I have tried and it gets confusing. How to use \graphicspath? I am using MikTex 2.9 and TeXstudio for my TeX preparation. I would like to set the path to my figures folder, which contains all the figures, plots etc. required for my work.   I used \graphicspath to set the directory, but it gives me an error message:  \documentclass[12pt]{article}  \usepackage{graphicx}  \graphicspath{D:/LATEX/Reports@IIT/figures}  \begin{document} \includegraphics[width=4.5cm,height=4cm,angle=0]{logo.jpg}  \end{document}      Error: Package pdftex.def Error: File `logo.jpg' not found   However, when I prepend the filenames of the images with the same path in the \includegraphics command, it works just fine:  \documentclass[12pt]{article}  \usepackage{graphicx}  \begin{document}  \includegraphics[width=4.5cm,height=4cm,angle=0]{D:/LATEX/Reports@IIT/figures/logo.jpg}  \end{document}   Why is \graphicspath not setting the path? How to delete a file from Time Machine backups in Big Sur? Show that a connected metric space is $\epsilon$-chainable for $\epsilon>0$ Show a connected metric space (X,d) is $\epsilon$-chainable for $\epsilon &gt;0$       $\epsilon$-chainable Definition      (X,d) is $\epsilon$-chainable if given any two points $a,b \in X$, $\exists$ a finite set $\{ x_0,x_1,...,x_n\}$ of points in X with $x_0 = a$, $x_n=b$ and $d(x_{n-1},x_n)&lt;\epsilon$, $\forall$ n      Clopen Definition      A set is clopen $iff$ its boundary is empty      Connected Metric Definition      Let $(X,d)$ be a metric space. It is connected $iff$ it has no proper subsets which are clopen      The following are equivalent:         $X$ is connected   The only subsets of $X$ that are clopen are $\emptyset$ and $X$   $\nexists$ non-empty, disjoint, open sets $A$ and $B$ such that $X=A\bigcup B$   $\nexists$ non-empty, disjoint, closed sets $A$ and $B$ such that $X=A\bigcup B$         Theorem      Let $(X,d)$ be a metric space, and let $S$ be any subset of $X$. Then $S$ is closed $iff$ $S^c$ is open.     So how would someone show this exactly?  Let the set $A$ be the set of all elements in $(X,d)$ that can be reached from $a\in X$ in a finite number of steps with length less than $\epsilon$.  Does this mean that there should be no isolated points? (an isolated point would be at distance infinity from any other point, or distance zero from itself, since $\epsilon &gt;0$ we don't want this?)  Knowing that $X$ is connected $\implies$the only subsets of X that are clopen are $\emptyset$ and $X$  Also, by construction of A;   A is the set of all $\epsilon$-chains between any element and $a$  And, so $A^c = \emptyset$ if $A$ was $\epsilon$-chainable (because A has to have a path from all elements to a, for this to be true, the complement wouldn't have anything in it)  Leaving only $A$ as the remaining clopen set  Does this make any sense? Or should an alternative be used, and how to formalize it.  Thanks.