We have a connected app which is android mobile app. We want the Users using that app to force logout of the app and re-login again. To do so, I have given the session time out value to 15 mins in connected app and session settings and set "force logout on session end" to true, even then, the User is logged in when I checked after 15 mins. even then, the User is logged in when I checked after 15 mins.   When I revoke the access for the user by manually revoking or immediately expiring the refresh token, when the app is opened, I am getting the error as "Check your internet connection" rather than user logout  Is there any way to force logout User from Connected App
NOTE: I am not interested in calling /secur/logout.jsp since it ends all the active salesforce sessions.  I am developing a web application that is registered on salesforce as a connected app, so I am using salesforce credentials to authorize the user.  Application is developed in REST API and the communication with salesforce is happening in restful manner.   Auth url:   Authorization:  Method 1: If there is no salesforce session active, The user is taken to salesforce login page, where he enters his salesforce details to be authorized and after which he is taken to home page of my web application.  Method 2: If there is already a salesforce session active in another tab, the user is directly authorized and is taken to home page of my web application.  Now I am trying to implement logout button for my application, such that the following scenarios are covered,  Scene 1: The user is authorized using method1, and the user press the logout. Upon trying to logback the user is prompted for credentials.  Scene 2:  The user is authorized using method2, and the user should use logout to logout of the web application (not from active sessions). Upon login, the user should be again able to login using method2.  Can someone help me on how to implement the logout button such that it covers scenario 1 &amp; 2.  Thanks in advance.
Embed vimeo video into the body field As opposed to the generic polynomial form for utilizing the Eisenstein Criterion ($a_nx^n+a_{n-1}x^{n-1}+\dots+a_0\in\mathbb{Z}[x]$ is irreducible in $\mathbb{Q}$) how do we prove that if $p$ is a prime, $x^{p-1}+x^{p-2}+\dots+x+1$ is irreducible over $\mathbb{Q}$? Proving the so-called "Well Ordering Principle" The client can do several actions per frame, for instance, requesting a movement, shooting etc. Should i send a packet to the server for each action the client performed during the frame, or should i stack them in an unique packet and send it at the end of the frame?  EDIT: i'm using Jmonkeyengine and the provided network API SpiderMonkey. Let me say first that I am fairly new here (about 3 weeks) and absolutely love Stack Overflow. At first I let some of the negative attitudes get to me a little, left a few snarky comments, but that phase has passed. I see the tremendous value for this site in the long run and sincerely do want to help make it a better place.  I find myself going for  the downvote very frequently -- currently about 35% of my votes are downvotes. I even make an extra effort to upvote good content to offset this a bit, so the number should probably be more like 60%. I always try to leave constructive comments and try to help out the confused ones who are really trying.  I truly can't tell if it is just me, or if these folks deserve it. I don't know if you guys noticed, but there are a lot of really bad questions being posted, and a lot of people trying to pass off things like "use jQuery", "use Firebug", and "use Google" as good answers (and getting upvotes!). I even saw someone copy/paste my "What does Firebug say?" comment as an answer and get 3 votes within moments. Sometimes This answer is unclear or not useful just doesn't do it justice.  I feel like some of the people just drive me nuts, but then again I feel this way IRL :) Am I being too harsh, or is it really that bad on SO? Has there recently been a surge of new users, and the quality of content is degrading, or was it like this in the "good old days"? Have I perhaps misunderstood the expected behavior on Stack Overflow -- should I just ignore these crappy questions and answers rather than downvote them? Counting the number of surjections. How many functions from set $\{1,2,3,\ldots,n\}$ to $\{A,B,C\}$ are surjections? $n \geq 3$  Attempt  I was hoping to count the number of surjections by treating $A,B,C$ like bins, and counting the number of ways to fill them with $1,2,3,\ldots,n$ such that no bins are empty. This is equivalent to putting two "separator" bars in between the $n$ numbers or $n-1 \choose 2$.  However, I think I am missing a step here: prior to putting in the separator bars, I should permutate the $n$ elements. So, multiply by $n!$.  The order of elements in the same bins do not matter. So I should be divided by the number of permutations of the elements in each bins. This is where I am stuck.  Additional Info  I made the question up myself. Feel free to modify the question into a more solvable form if it is too difficult/complicated. What are 'user' and 'system' times measuring in R system.time(exp) output? Does anyone know the name of travel posters from the 1930s? prints out a lot of very detailed protocol statistics like number of TCP reset messages received or number of ICMP "echo request" messages sent or number of packets dropped because of a missing route.  When in Linux netstat is considered deprecated at nowadays, then is there an alternative?  Statistics provided by ss -s are superficial compared to the ones provided by netstat. What hardware does Ubuntu Touch support? With the announcement of the Ubuntu Phone OS I'd like to know what phone (and tablet) models are supported at this time.  Note from foss &amp; Oli: We are making this the master question for all future "Will this work on &lt;insert random tablet/phone/device here&gt;?!" questions How do I use filenames that start with a dash "-" as command arguments? This may be a simple question, but how do I use files starting with "-" with command line programs?   For example,  I am trying to use pdfgrep on a file named -2013-01-01.pdf but it complains that there are no options defined for 2, 0, 1, 3 and so on.  Changing the filename to something that does not start with "-" solves it, but this is not an option since the files aren't created by me. I simply want to check for a specific change I know is coming. JSF 2.0 File upload How to implement Enums in Ruby? What's the best way to implement the enum idiom in Ruby? I'm looking for something which I can use (almost) like the Java/C# enums. Consider the equation $$|2^x-3^y|=1$$ in the unknowns $x \in \mathbb{N}$ and $y \in \mathbb{N}$. Is it possible to prove that the only solutions are $(1,1)$, $(2,1)$ and $(3,2)$? How to prove Vandermonde's Identity: $\sum_{k=0}^{n}\binom{R}{k}\binom{M}{n-k}=\binom{R+M}{n}$? How can we prove that     $$\sum_{k=0}^{n}\binom{R}{k}\binom{M}{n-k}=\binom{R+M}{n}?$$   (Presumptive) Source: Theoretical Exercise 8, Ch 1, A First Course in Probability, 8th ed by Sheldon Ross. I have run a multiple linear regression using stepwise regression to select the best model, however the best model returned has a non-significant variable. When I remove this the AIC value goes up indicating the model without the significant variable is a worse fit. Should I remove the non-significant predictor or should I leave it in as it is a better model? "1 out of 100 chickens is" or "1 out of 100 chickens are"? I'm in an argument. To me "are" makes more sense. I understand the rationale for is because it's only one chicken, but chickens itself is plural. Help? I have a training set with about 3000 positive instances and 3000 negative instances. But my test data set is pretty much un-balanced. The positive set only has 50 instances and negative has 1500 instances.This causes the precision very low. Are there any approaches to solve this problem? I use SVM to build classifier. Let $G$ be a group. Show that a nonempty subset $H$ is a subgroup of $G$ if any only if $ab^{-1} \in H $ for any $a,b \in H$.  The forward direction is quite easy. Suppose $H$ is a subgroup. Then by closure, $ab \in H$ for any $a,b \in H$. Every element has an inverse. Hence, if $b \in H $, then $b^{-1} \in H$. Hence, by closure again, $ab^{-1} \in H$.   Backward direction, suppose $ab^{-1} \in H $ for any $a,b \in H$. Let $a=b$. Then we have $bb^{-1}=1_H\in H$. Let $a=1_H$ , we have $1_Hb^{-1}=b^{-1} \in H$. I don't know how to show closure.  Reference: Fraleigh p. 58  Question 5.45 in A First Course in Abstract Algebra Optimization used in latex