We have a sandbox with a Connected App configured to use the JWT flow for machine-to-machine authentication in a CI/CD setup. We would like to run a nightly refresh from production, but this broke the JWT flow: although the key associated to the connected app we use to sign the JWT is not changed during sandbox refresh, the consumer id is changed every time we refresh the sandbox. Looks like it is expected as per this  Can anyone please advise how can we get access to the sandbox after we have refreshed it, in CI/CD? If we have access to production, is there a way we can use it to get login access to sandbox? Or there are other automated ways? Also, came across this  but it talks about using new consumer key and not automation. Thanks for the inputs
I'm trying to connect to a sandbox using the sfdx cli and the JWT flow through force:auth:jwt:grant. According to , we can use the same connected app information from Production to connect to our Scratch Org.  Is it something that should work for sandbox too ? I'm getting a "Failed: Not approved" error.  Connected app in sandbox comes from the refresh but has a different consumer key. The Permission set is set correctly on my user.  Is there a way to connect to a recently refreshed sandbox using the JWT flow (without manually changing something like the consumer key) ?
Why are papers without code but with results accepted? I just started reading some papers (Computer Science, specifically Computer Vision) and thought "now let's look at the source code" and was quite astonished that most of the papers don't have any source code implementing the described methods to look at, while claiming some performance or being better than other papers.  How do these papers get accepted in journals / conferences? Do people have to submit their source code privately to the reviewers at least, so that they can reproduce the experiment if possible.  Do most journals / conferences just "trust" that people who submit the paper really implemented the theory and got those exact results?  I always had this idea that any experiment should be reproducible by others else it's not scientific justified. Been wondering about this the last few days. Proving bessel identity $[J_0(x)]^2 + 2[J_1(x)]^2 + 2[J_2(x)]^2 + \cdots = 1$ and $|J_0(x)|\le 1$ The generating function for a Bessel equation is:      $$g(x,t) = e^{(x/2)(t-1/t))}$$      Using the product $g(x,t)\cdot g(x,-t)$ show that:      a) $$[J_0(x)]^2 + 2[J_1(x)]^2 + 2[J_2(x)]^2 + \cdots = 1$$      and consequently:      b)      $$|J_0(x)|\le 1, \forall x$$      c) $$|J_n(x)| \le \frac{1}{\sqrt{2}}; n=1,2,3,\cdots$$   For a) I tried the product:  $$e^{(x/2)(t-1/t))}\cdot e^{(x/2)(-t+1/t))} = 1$$  I at least arrived at the right side of the equation. Since this generates the bessel functions, I should arrive at something related to $J_n$ in the left side. I know that  $$e^{(x/2)(t-1/t))} = \sum_{n=0\infty}^{\infty} J_n(x)t^n$$  $$e^{(x/2)(-t+1/t))} = \sum_{n=0\infty}^{\infty} J_n(x)(-t)^n$$  but it's not just a matter of multiplying coefficients from the two infinite series, right?  For $b$, I tried to use  but it's not as obvious  I have no idea how to deal with $c$, could somebody help me? What happens when I run the command cat /proc/cpuinfo? What happens when I write cat /proc/cpuinfo. Is that a named pipe (or something else) to the OS which reads the CPU info on the fly and generate that text each time I call it? I am making a Minecraft Mini Game adventure map, and one of the levels has a /setblock command, I am using the command in a way to spawn an item in a chest (Wooden Button) I need the wooden button to have CanPlaceOn tag so it can be placed on a log. I have tried this command: setblock 294 5 -1251 minecraft:chest 0 replace {Items:[{Count:1,Slot:0,id:minecraft:wooden_button,CanPlaceOn:[log]}]}` Change this behavior to allow for spelling corrections and the like: "Edits must be at least 6 characters" Now, it is easy to workaround this: add 10 characters, plus your one-character change, then remove these 10 characters in the next edit for the same post.  But this can hardly be what the designers intended. Instead, my suggestion is to change it to something like on Wikipedia, where you can mark an edit as "minor". Something like this:     Edits must be at least 6 characters, or select the checkbox "Minor, spelling or punctuational correction."   Edits like that will, of course, not count toward the edit-limit (before it becomes Community Wiki).  The suggestion often seen on Meta Stack Overflow is "just edit more in that post". But sometimes the post is just right, and there aren't any other spelling mistakes to correct. Why force a user to change more than necessary, or use an ugly hack? I'm not normally a fan of mac software implementations, but recently I saw a copy of Parallels Desktop for mac that I was very much impressed by. I looked into parallel's offerings for Linux (I was initially excited that they developed for *nix) but found that it has essentially the same features as VMware.   Does anyone know if there is a software solution for linux that offers the level of integration that the current Parallels Deesktop for mac has?  I looked into wine for the programs I want to run and was very frustrated. I feel like all the ratings in their application database were fabricated honesty. I've tried wine once every Ubuntu release since 8.10 and have never gotten it to work stably. $ac\equiv bc \pmod{\!m}\!\!\iff\!\! a\equiv b \pmod{\!\!\frac{m}{(c,m)}}$ [Euclid's Lemma, congruence form] I came across this theorem:   For all integers a,b,c and m&gt;0, if d = GCD(c,m) then a*c ≡ b*c (mod m) iff a ≡ b (mod m/d).  The =&gt;proof states this:  a*c ≡ b*c (mod m) =&gt; m|(a-b)*c                    =&gt; m/d | (a-b)*c/d                   =&gt; m/d | (a-b)                   =&gt; a ≡ b (mod m/d)   I don't understand how to go from step 2 to step 3. The proof states that this is possible because m/d and c/d are coprime. To me this means GCD(m/d, c/d) = 1 but how does this cancel out the whole term? Meaning of probability notations $P(z;d,w)$ and $P(z|d,w)$ What is the difference in meaning between the notation $P(z;d,w)$ and $P(z|d,w)$ which are commonly used in many books and papers? I have a table with a column for ID, Date and Frequency of occurrence for that particular date and ID.  ID    date          Frequency 1     2014-05-18      5 1     2014-05-19      4 1     2014-05-20      25 2     2014-05-20      7 3     2014-05-18      4 3     2014-05-20      1 4     2014-05-18      6   I'm looking to insert the dates for each ID that aren't currently there (assuming that the date ranges from 2014-05-18 to 2014-05-20) and add a value of 0 in Frequency for those.  For example, you can see that  ID 1 has an observation for all three dates;  ID 2 is missing 2014-05-18 and 2014-05-19;   ID 3 is missing 2014-05-19;   ID 4 is missing 2014-05-19 and 2014-05-20.  Therefore, the output should look like this  ID    date          Frequency 1     2014-05-18      5 1     2014-05-19      4 1     2014-05-20      25 2     2014-05-18      0 2     2014-05-19      0 2     2014-05-20      7 3     2014-05-18      4 3     2014-05-19      0 3     2014-05-20      1 4     2014-05-18      6 4     2014-05-19      0 4     2014-05-20      0   I've attempted the following from . However, that will only add dates with 0 Frequency that aren't present throughout the entire table instead of on an ID level.   DECLARE @s DATE = '20140518', @e DATE = '20140520';  SELECT c.date, Frequency = COALESCE(a.Frequency,0) FROM dbo.Calendar AS c LEFT OUTER JOIN dbo.table AS a ON c.date = s.[date] WHERE c.d &gt;= @s AND c.d &lt; DATEADD(DAY, 1, @e); Proving there are infinitely many pairs of square-full consecutive integers So the question goes like this :  A positive integer $n$ is called square-full if for every prime $p$, $p \, | \, n$ implies $p^2 \, | \, n$, i.e. every prime power factor of $n$ occurs at least at the second power. This is equivalent to saying that there is no prime $p$ such that $p \, \| \, n$.  Show that there are infinitely many consecutive pairs of square-full numbers, i.e. infinitely many $n$ such that $n$ and $n+1$ are square-full.  The context of the question highly suggests that this can be proved by induction and it is the solution that I am looking for. It is not a homework, just something that caught my attention because I couldn't find any natural answer to it... I hope I'm not missing something trivial!  I've tried assuming $n_1, n_2, \dots, n_k$ were the first $n_k$ integers such that $n_i$ and $n_i+1$ are square-full, and then generate some polynomial in those $2k$ integers to get a new couple $n_{k+1}$, $n_{k+1} + 1$ but after a few natural tries I got nothing good out of it. Any ideas? With the Superman lore, we know that light from a yellow star gives him his powers, light from blue stars makes him stronger, and light from red stars weakens him.  However, what happens if he is near a white dwarf, or a neutron star?  Has there been any evidence of Superman visiting a star system that wasn't red/yellow/blue? GTA V Online Character Transfer PS3 to PS4 Find the set of $n\in\Bbb Z^+$ with $M=\{n,n+1,n+2,n+3,n+4,n+5\}$ partitionable into two sets Find the set of all positive integers $n$ with the property that the set $M=\{n, n + 1,n + 2,n + 3,n + 4,n + 5\}$ can be partitioned into two sets such that the product of the numbers in one set equals the product of the numbers in the other set.   If $n=1$ them $M=\{1,2,3,4,5,6\}$ and there is no such partition, so $n \ge 2$.  If the prime $p|n$ then either $p|2$ or $p|3$ or $p|5$ which means either $p=2$ or $p=3$ or $p=5$.  Suppose $n=2k$. Then $M=\{2k, 2k + 1,2k + 2,2k + 3,2k + 4,2k + 5\}$. I have no idea how to proceed. Windows Batch recursive delete old files Get the cartesian product of a series of lists? How can I get the Cartesian product (every possible combination of values) from a group of lists?  Input:   somelists = [    [1, 2, 3],    ['a', 'b'],    [4, 5] ]   Desired output:  [(1, 'a', 4), (1, 'a', 5), (1, 'b', 4), (1, 'b', 5), (2, 'a', 4), (2, 'a', 5) ...] This might be subjective, I don't know. However, it's a serious problem for me. My electrical bill is outrageous. It's three times as large as my next-door neighbor, and four or five times the size of my neighbor's across the street. It's worse in the summer (I live in central TX), but I've had the air conditioner inspected, and while the house is right at the maximum capacity for our unit, the unit should still be able to take care of the load. That also doesn't explain why our winter bills are larger than the comparables.  What I would like to do is check the amount of current drawn by each running appliance and calculate where all my money is going. I just don't know how to go about doing this. Is it possible to obtain AES-128 key from a known ciphertext-plaintext pair? I have a file, which was encrypted with AES-128 in ECB mode. I know the format of the original file and know that all files in this format have the same headers. So, I have an encrypted block and the original block.  Can I get the encryption key, using this information? Closed ball not a manifold. My book on differential geometry claims that a closed ball in $\Bbb R^n$ can never be a differentiable manifold because of the boundary points. The book doesn't really give an explanation for why this is true. Could someone provide more details please? thanks In  (the original movie), Marty comes back from 1955 10 mins early to prevent Doc from being shot (which he fails at). He then rolls up to the Lone Pine Mall and sees himself hit 88 mph and shoot back to 1955 (again). Marty then carries on with this life as usual. What happens to the Marty that goes back to 1955 at the end of the film?  This obviously is a recursive problem where it would create another timeline and Marty would keep coming back 10 mins early to view another Marty zip back to 1955? Looking to draw this block diagram in Tikz I'm looking to create something like this in Tikz environment. Any tips? help?