Unable to update existing lead from force.com site
Workarounds for Sites page to update standard object?
Can you end Beast Form early? Is there any way to end beast form early? I find myself using it to clear out a particularly hard portion of a dungeon at times, but then I have to sit around for 2-5 minutes so I can be my human character again (I have to feed to keep my health up, so I'm a werewolf longer than the 2.5 minutes).  Is there anyway to end it early? Find a function value given 2 points Given $f(x)$, which is differentiable at every point such that: $f'(x) \ge -5$ for every $ x \in R$   $f(2) = -13$, $f(9) = -48$  Prove that:$ f(3) = -18$  Now it's quite obvious that $ f(3) = -18$ since that if we know that the lowest value of the derivative is -5, the difference between $f(2)$ and $f(9)$ is $-48-(-13)=-35$  that means that that in the area $[2,9]$, $f'(x)=-5$ right? that's why I told that $f(3) = -18$, but I feel that my proof is insufficient, probably because I'm missing some theorems or such. can someone help me structure this proof into something RIGHT :)?  Thanks a lot! Show that $\int_{\partial P}z\frac {f'(z)} {f(z)} dz $ is on the lattice $\Lambda$ Restore deleted photos A formula for Perspective measurement If I have a photograph of a rectangular object whose image recedes with perspective, is it possible to work out the scale of measurements along that object?  For example: I have a photograph of a (metric) ruler.  The ruler is graduated in centimetres as shown, 30 cms.  Is it possible to work out the distance between each centimetre?  The screenshot shows the photograph.  The representation on the Picture Plane shows the nearest edge of the ruler to be 50mm and the farthest edge to be 15mm. By measuring the photo, I see that the distance between 0 and 1 is 7.5mm and the distance between 27 and 28 is 0.9mm.  Is there a way to get these results from a formula?  It doesn't need to be 100% accurate: it's for photometric software I'm writing, so it's only going to be used as a rough guide. I've used recursion quite a lot on my many years of programming to solve simple problems, but I'm fully aware that sometimes you need iteration due to memory/speed problems.  So, sometime in the very far past I went to try and find if there existed any "pattern" or text-book way of transforming a common recursion approach to iteration and found nothing. Or at least nothing that I can remember it would help.   Are there general rules? Is there a "pattern"? It appears that in anticipation of D&amp;D Next Wizards of the Coast has removed much of the Dungeons and Dragons, 3rd Edition Web content. I didn't perform a thorough search to determine if all the content is removed (e.g. I know the Three Dragon Ante Web enhancement  and the Mind's Eye column about psionic tattoos  are both gone--better not to ask why those are my go-to articles), but it all might be.  What's the best way--and by best I mean both legal and convenient--to continue to access this content? What should I do when my neural network doesn't learn? I'm training a neural network but the training loss doesn't decrease. How can I fix this?  I'm not asking about overfitting or regularization. I'm asking about how to solve the problem where my network's performance doesn't improve on the training set.    This question is intentionally general so that other questions about how to train a neural network can be closed as a duplicate of this one, with the attitude that "if you give a man a fish you feed him for a day, but if you teach a man to fish, you can feed him for the rest of his life." See this Meta thread for a discussion:   If your neural network does not generalize well, see: Is it consistent with ZF for there to exist a set $S$ such that the power set $P(S)$ is countable? If so, what is the weakest form of the axiom of choice needed to prove that no such set exists? What form of the verb is used with compound subjects containing "or"? Why do corn flakes clump together in milk when stirred? The Cheerios Effect is the name the scientific community has given to this phenomenon. When cornflakes or oats are mixed with milk and stirred, they tend to clump together. Why does this happen? Can physics explain this? Born rule and unitary evolution Is the  a fundamental , or can it be inferred from unitary evolution? popping to root view in navigation controller Interaction of Invoke Duplicity and Misty Step How would I verify the following double angle identity. $$ \sin(A+B)\sin(A-B)=\sin^2A-\sin^2B $$ So far I have done this. $$ (\sin A\cos B+\cos A\sin B)(\sin A\cos B-\cos A\sin B)  $$But I am not sure how to proceed. Canonical copies of sets Sometimes one needs two disjoint copies of a given set $X$. This can be canonically done by taking $\{0\} × X$ and $\{1\} × X$. Sometimes we want to identify one of the copies with the original set $X$. So I wonder, is it possible to take a disjoint copy of $X$ straight ahead? And can this be done canonically? More precisely, are the following claims true? $ \def\dom{\operatorname{dom}} \def\rng{\operatorname{rng}} \def\On{\mathbf{On}} $   For every $X$ there is a one-to-one function $f$ such that $\dom(f) = X$ and $\rng(X) ∩ X = ∅$. There is an explicit formula $φ(X, f)$ such that for every $X$ there is exactly one $f$ satisfying $φ(X, f)$ and this $f$ satisfies 1. for $X$.   Since such construction of a disjoint copy is intuitively trivial, I'm interested in proofs of 1. and 2. without using regularity, choice, or infinity.   Some ideas:   We may simply put $f(x) := (x, X)$, but we need regularity to show that $(x, X) ∉ X$. We may consider $α = \sup(X ∩ \On)$ and pair members of $X$ with some ordinals above $α$, but we need AC to well-order $X$, and we need global choice to obtain 2. Let $&lt;$ be the transitive hull of $∈$. If the relation $&lt;$ is narrow, i.e. $\{y: y &lt; x\}$ is a set for every $x$, then we may choose $z ∉ ⋃\{(\leftarrow, x)_&lt;: x ∈ X\}$ and put $f(x) := (x, z)$ since $(x, z) = y ∈ X$ would imply $z &lt; y$. Note that we don't need the axiom of infinity to define $&lt;$, but I don't know how to prove its narrowness without infinity. How to render a 30K image with cycles? I have to render an image of 27000 x 7000 for a 150dpi print. The scene is quite big, but cycles preview and a render in 2700x7000 works as expected.  If I hit render my memory raises up to 20gb, but my cpu usage is at 5%. Why cycles does not using the full cpu power during the render process?  Here are my rendersettings:  Pathtracing Samples:3000 Tilesize: 64x64 Bounces: Max 12 | Min 3 Diffuse: 4 Glossy: 4 Transmission: 12 Volume: 1   Is there a way to optimize things? Prove that $\gcd(a^n - 1, a^m - 1) = a^{\gcd(n, m)} - 1$ For all $a, m, n \in \mathbb{Z}^+$,   $$\gcd(a^n - 1, a^m - 1) = a^{\gcd(n, m)} - 1$$ How do I Insert a carriage return on a card in Trello? How to store credit card info on iphone?