I am trying to understand what additional security the the consumer secret(client_secret) for OAuth 2.0 provides. If one want to avoid using the consumer secret when authenticating you can use the User Agent flow rather than Web Server flow.  As far as I can see there is no way to restrict which flow that you allow to be used for your connected app. So what is the purpose of the consumer secret when anyone can easily avoid using consumer secret for authentication by selecting a different response_type(=token) in order to retrieve an access token?  Is this not just like having two doors into the same house. One with two locks, and the other with just one?
After looking into the different OAuth types and reading , I'm still confused on the specific pros and cons of user-agent vs web server flows.  The best explanation I can find says that user-agent tends to be used for mobile but it seems that they can both be used for desktop.   What makes it more appropriate to use one over the other in certain scenarios?
Centering in tabularx and X columns How can I center the column when using X in tabularx environment like in this example?  \begin{tabularx}{\textwidth}{@{}lXXXXX@{}}  1 &amp; 2 &amp; 3 &amp; 4 &amp; 5 \\    \end{tabularx} Pgfplots: Linewidth when using \ref in custom legend Showing a function on $[0,1]$ is the zero function Suppose $f$ is continuous on $[0,1]$ and   $$ \int\limits_0^1 f(x) x^n d x = 0 $$   for all $n=0,1,2,...$. Then, $f(x) = 0$  I was trying to use by parts  $$ 0 = f(x) \frac{x^{n+1}}{n+1} \bigg|_0^1 - \int\limits_0^1 \frac{x^{n+1}}{n+1} f(x) dx $$  Thus,  $$ \frac{f(1)}{n+1} = \int\limits_0^1 \frac{ x^{n+1} f(x) dx }{n+1} \implies f(1) = \int\limits_0^1 x^{n+1} f(x) dx $$  but here I am stuck. Maybe my idea is not the best one? How would you approach this problem? Variation of Pythagorean triplets: $x^2+y^2 = z^3$ I need to prove that the equation $x^2 + y^2  = z^3$ has infinitely many solutions for positive $x, y$ and $z$. I got to as far as $4^3 = 8^2$ but that seems to be of no help.  Can some one help me with it? Are there any Combinatoric proofs of Bertrand's postulate? I feel like there must exist a combinatoric proof of a theorem like: There is a prime between $n$ and $2n$, or $p$ and $p^2$ or anything similar to this stronger than there is a prime between $p$ and $(\prod_p p) + 1$ (Euclid's theorem).  I was trying to prove one by the Sieve on this grid      1     2     3     4 ... p   p+1   p+2   p+3   p+4 ... 2p  2p+1  2p+2  2p+3  2p+4 ... 3p ........................... ........................... ........................... p^2 p^2+1 p^2+2 p^2+3 p^2+4 ...   but it did not work.  Do any good arguments like this exist? I don't expect anything as strong as Prime Number Theorem or even Bertrand, but surely a direct combination proof can prove that there are lots of primes? If every real-valued continuous function is bounded on $X$ (metric space), then $X$ is compact. FFmpeg - Apply blur over face Using lasso for feature selection, followed by a non-regularized regression I use Lasso logistic regression in order to identify a smaller subset of important variables. I start with N=51 (28/23) and 32 predictors.   So far it looks pretty promising, because I can identify four important predictors in my optimal model.   Now I would like to take those four predictors and examine them along with some control variables in a standard logistic regression.   My question is, does that analysis strategy make sense? Is there a better way to include controls or other variables that might be interesting?  For a better understanding:   Identify important variables via Lasso logistic regression Do further analysis including identified predictors and other control variables using standard logistic regression (using AIC to check model fit) Can I have multiple DHCP servers on one network? This is a  about Redundant DHCP Servers.   Is it possible to have more than one DHCP server on the same LAN? What are the implications of doing this?    What happens if there is more than one DHCP server available? How do my clients know which one to use?  How can I have DHCP servers supplying addresses to more than one subnet\network segment? How can I configure multiple DHCP servers to supply addresses for the same subnet. How do I prepare best for my first wedding photography event? I am going to shoot a wedding this weekend, and I want to do my best for my friend's big day.    What can I do to prepare for the day in order to minimize failures and mistakes? How do I avoid missing important shots? What backup plan should I have?   I have been shooting for 6 years or so, and I know wedding is one of the hardest thing to do. I have told my friend what I end up producing will be of no match with the work of dedicated wedding photographers, not even the ones that are about to fall out of business.  They are on a tight budget, they said some photos are still better than none, they really must minimize the cost as much as they can. I exaggerated again that my photos will be worse off than the cheapest wedding photographer you can find.  She has been a close friends for years, I want to do everything I can to help her.  Their wedding is at 12:30pm coming Sunday, I have visited the venue last Sunday at 12:30pm to check traffic condition and also the lighting.  The setup is mainly outdoor (no church), the indoor area will not have a good ceiling for bounce. Being at the middle of the day, this can mean some tricky fill flash. I have jot down a list of must-have shots. I am also asking for the seating plan and the event run-down.  Gear:   Canon EOS 60D , EF-S 15-85mm f/3.5-5.6 IS USM Canon EOS 450D (or I can borrow a 550D), EF 50mm f/1.4 Speedlite 580 EXII Speedlite 270 EXII Yongnuo 460 (a cheap but powerful manual flash as backup) Samsung EX-1 f/1.8 point and shoot (backup of a backup...?)   Other lenses that I have but I don't think will be useful:   50mm f/1.8 EF-S 50-250mm f/4.0-5.6 IS II EF-S 18-135mm f/3.5-5.6 IS (I have the better 15-85 on 60D, should I put this on the 450D as a backup allrounder?) EF-S 60mm f/2.8 Macro (should I replace 50mm f/1.4 with this for added macro? You can hardly use f/1.4 under direct sunlight if you want to have fill-flash)   I have two batteries for all cameras (60D 450D and EX1). I have like in total 64GB SD card (I am really inclined to get more, or bring a laptop for on-the-fly backup, or do both). I recently repaired my 580EXII, it has a brand new flash head so the recycle time is as good as it can be, I just need a tonne of batteries. No I don't have external power pack or battery grip for my cameras.  I have a great monopod, but a cheap tripod.  I am happy to bring everything, just putting them in the boot of my car. The carpark is on-site, walking from venue to my car is under 1 minute.  I will have my girlfriend carry the 450D and shoot details / non-portraits.  One concern that I have is fill flash, I really do not have a large surface to bounce off  from. I have shot events before but they are not as dynamic/critical as a wedding.  How do I prepare for differing weather conditions?  If its sunny, fill flash is probably going to be in every single shot. If its cloudy, I probably will turn off the flash. If it rains, my 60D should be fine I have used it in slight rain before, but I really don't know their plan and if they have extendable shelters etc.  What else should I prepare for? Having no experience I want to be as prepared as I can be. Maybe I have overlooked something, maybe there is something else I can do to ensure the shooting will go smoothly. Your help is greatly appreciated! why each left ideal of this is minimal? Is it true that a dihedral group is nonabelian? Is it true that a dihedral group is nonabelian?  I'm not sure if the result is true. I checked it for some lower order and I think the result may correct.   But I failed to prove/disprove the result. How to run Java code using Java code? Low-RAM Linux Distro Specifically for serving static sites I'm looking for a near-zero-configuration linux distro that is designed specifically for serving static web sites and nothing else on a low-RAM machine (I'm planning on 128MB, but the option of less would be nice).  Any ideas of a linux distro specifically tuned for serving static sites in a small footprint? After closing paint the last used settings went back to default. I want them to be saved. Like the selected Brush-Tool, Color, Line-strength, etc.  Either after every usage or I define one I use most. Maybe through the registry or by start parameters? Prove universal morphism is unique up to unique isomorphism. I'm following along Wikipedia page() on universal property, and this seems it should be trivial, but I couldn't finish the proof.  The definition I am working with:   The problem   So I want to prove that if $(A, u)$ and $(A', u')$ are universal morphism from $X$ to $F$, then there exists unique isomorphism $k: A \rightarrow A'$ such that $u' = F(k) \circ u$.   My attempt:   For any $B \in C$ and $f: X \rightarrow F(B)$, there exists unique $h: A \rightarrow B$ such that $f = h \circ u$.  Letting $B = A'$ and $f = u'$, we see that there exists unique $k: A \rightarrow A'$ such that $Fk \circ u = u'$.  This shows existence and uniqueness. We only need that $k$ is isomorphism, but this is the part I cannot prove.   Similarly, there exists unique $k': A' \rightarrow A$ such that $Fk' \circ u' = u$.  Plugging into each equation, we get  $$Fk \circ Fk' \circ u' = F(k \circ k') \circ u' = u'$$  $$Fk' \circ Fk \circ u = F(k' \circ k) \circ u = u$$  but this of course doesn't imply $F(k \circ k') = id$, so it seems useless.   Thanks for your help! Which is correct, "you and I" or "you and me"? return eats exception I found the following behavior at least weird:  def errors():     try:         ErrorErrorError     finally:         return 10  print errors() # prints: 10 # It should raise: NameError: name 'ErrorErrorError' is not defined   The exception disappears when you use return inside a finally clause. Is that a bug? Is that documented anywhere?  But the real question (and the answer I will mark as correct) is: What is the python developers' reason to allow that odd behavior? "contribute to investigating" or "contribute to investigate" I'm trying to find, which of the following sentences is correct?  A) We try to highlight how they contribute to investigate their importance. B) We try to highlight how they contribute to investigating their importance.  I found that both cases were used frequently in formal writing. Edited: Sources for each case: For A: &quot;Their multifaceted nature means that there are very many routes to investigating their importance for understanding social change&quot; in &quot;A lineage for contemporary inter-city studies&quot; book. B: &quot;More factors are analysed to investigate their importance in scoring from shots and shot probabilities&quot; in &quot;Applications of logistic regression to shots at goal at association football&quot; book. I'm very new to classical propositional logic, and my lecturer is using a system with the following axioms:  A1. X→(Y→X)  A2. (X→(Y→Z))→((X→Y)→(X→Z))  A3. (¬Y→¬X)→(X→Y)  Use uniform substitution and Modes Ponens (MP) as rule of inference. Deduction Theorem also allowed.  I'd like to deduce the following:  (a) X, Y ⊢ ¬(X→(¬Y)) (conjunction, but expressed in terms of NOT and IMPLIES)  (b) X→((X→Y)→Y)  (c) (X→Y)→(((¬Y)→X)→Y)  (d) (((¬Y)→X)→Y)→(X→Y)  Remark: The last two are to show that the axiom (A3) can be replaced with a different axiom:  B3. (¬Y→¬X)→(((¬Y)→X)→Y).  Solution: Bram28 proves (b) and (c) below. I demonstrate (a) and (d).  (d) is alright; first, I claim that X, ((¬Y→X)→Y) ⊢ Y.  Axiom (A1) gives ⊢X→(¬Y→X) so that ((¬Y→X)→Y)⊢X→Y by Hypothetical Syllogism (HS), which Bram28 shows to be valid.  Now that we have ((¬Y→X)→Y)⊢X→Y just apply the deduction theorem to get what we want: ⊢((¬Y→X)→Y)→(X→Y).  (a) is slightly trickier. Axiom (A1) gives ⊢ Y→(X→Y) so that X, Y ⊢ (X→Y).  Next, by part (b), we have as a theorem that ⊢X→((X→¬Y)→¬Y).  Therefore X, Y ⊢(X→¬Y)→¬Y.  But ⊢(¬¬(X→¬Y))→(X→¬Y) by DN Elim, which Bram28 shows to be valid.  By HS, X, Y ⊢(¬¬(X→¬Y))→¬Y.  By Axiom (A3) and MP, X, Y ⊢(Y→¬(X→¬Y)).  Also, rather trivially X, Y ⊢Y.  Finally by MP we conclude X, Y ⊢¬(X→¬Y) as required.