Query Feature License total count
Query Feature and Usage based entitlements license
Use dynamic variable names in JavaScript This afternoon I set up a Win Server 2008 R2 system for use with Team Foundation source code control. In order to give my team-mates the right to connect, I had to create a user account for each person, 10 in total. (I can't, and I don't want to create a domain).  Now, after doing this, all user accounts are displayed in the login screen.  What can I do so that all the accounts are not displayed there? Background process of subshell strange behaviour I wonder why some similar bash commands behave the way they do.  I have a bash script foo:  #!/usr/bin/env bash  while true do     echo "reading"     read data     echo $data     echo "stderr msg" &gt;&amp;2     sleep 1 done   It's an infinite loop which reads one line at a time from stdin and outputs that same line. I also have a bash script bar:  #!/usr/bin/env bash  ./foo &amp;   The following commands were run in bash (v. 4.4.19) in a terminal on Ubuntu 18.04 (let's assume the scripts reside in the working directory):   ./foo &amp;   Stops when it tries to read from stdin, in accordance with . Killed when controlling terminal is killed, as expected.  (./foo &amp;)   Appears to be automagically continuously fed with new input from stdin. Shouldn't it too stop when attempting to read from stdin? Whatever it's getting it doesn't show when echoed, thus I'm guessing it's EOF characters.  Continues running even after the controlling terminal is killed. Looking at the output of ps, the controlling terminal changes from pts/x to ?. How did this happen without the use of either disown or nohup? (However, after killing the originally controlling terminal, it yields a "write error: Input/output error" on every write, which I suppose is because its stdout was tied to the now closed terminal. Correct?)  bash -c "./foo &amp;"  Appears to behave exactly like 2). ./bar  Appears to behave exactly like 2) and 3). Adding bash -c "~/foo" (no &amp;) as a startup application  Behaves similarly to 2), 3) and 4), with the differences:   Its controlling terminal is the desktop ttyx. You can't (can you?) kill its controlling terminal.   None of those differences seem odd to me, just the fact that it's continuously fed with new input.   My guess is that 2) - 5) all use a subshell of sorts whose stdin is redirected to something like /dev/null, though I'm very unsure and seek a more exact answer. For $a, b \geq 0$, $0 < x < 1$, show $(a+b)^x \leq a^x + b^x$ Let $a, b$ be positive real numbers. Let $0 &lt; x &lt; 1$. Show that  $(a+b)^x &lt; a^x + b^x$.  The function $f(x) = (a+b)^x -a^x - b^x$ has $f(0) = -1$, $f(1) = 0$ and it seems to be an increasing function. But I am unable to show that it is increasing function. Solve $x=y\frac{dy}{dx}-\left(\frac{dy}{dx}\right)^{2}$ so I am trying to show that $f(x)$ divides $g(x)$ for all polynomials $g(x)$ satisfying that $g(A)=0$ where $f(x)$ is the minimal polynomial of a square matrix $A$.  I know from my professor that $f(x)$ is the minimal polynomial of $A$ so $f(A)=0$ so then $g(A)=0$. Therefore, $f(x)$ divides $g(x)$, i.e. $g(x)=f(x)h(x)$ where $h(x)$ is some other polynomial.  My prof told us to solve this question we need to let $b(x)=gcd((f(x),g(x))$ and by using Bezout's Identity, we need to show that $b(A)=0$. I am just having a little trouble trying to prove this. I know that this identity says:     For two polynomials $f_1(x)$ and $f_2(x)$, there exist polynomials   $g_1(x)$ and $g_2(x)$ such that $g_1(x)f_1(x) + g_2(x)f_2(x) = &gt; gcd(f_1(x), f_2(x))$.   And the uniqueness of minimal polynomial theorem is:     For a square matrix $A$, if $f_1(A) = f_2(A) = 0$ for two polynomials   $f_1(x)$ and $f_2(x)$, then $g(A) = 0$ for $g(x) = gcd(f_1(x), &gt; f_2(x))$. So the minimal polynomial of $A$ is unique up to a scalar.   So since $f(x)$ is already the minimal polynomial, I know that the $deg(b(x))=deg(f(x))$. I know how to prove the Bezout identity using the Euclidean algorithm, I'm just not exactly sure how I would show all of this using the notation he gave us of $b(x)=gcd((f(x),g(x))$. Any help at all would be appreciated. I don't know why but now, when i go in material preview or rendered (in solid mode it works fine), my object is entirely gray, or invisible idk, because it has the same color of the background. I've been working for days on this project without having this issue, it suddenly showed up. I tried opening other old projects and suddenly they all do the same so i guess it is some blender program setting that applies for all the projects, but idk how it happened cuz i didn't change anything :/, anyone got any tips? This question was triggered by .  Basically, it goes like this: If you have a weapon with a certain magical effect, let's say the minor property unbreakable (can not be broken, requires special means) or temperate (no harm in temperatures between -20 to 120 F), it can bypass the immunity of something like a Werewolf because it is magical instead of mundane. This goes for any minor property because those properties are under the Magic Items portion of the DMG on pg.143.  How does this differ from a pair of gauntlets with the exact same effect being used as an improvised weapon (emphasis added for clarity) from dealing damage in the same manner to the same Werewolf? Or something that's clearly not a weapon like a Shield of Missile Snaring being used to bash an opponent? Let $H$ be a subgroup of a group $G$ such that $x^2 \in H$, $\forall x\in G$. Prove that $H$ is a normal subgroup of $G$.    I have tried to using the definition but failed. Can someone help me please. System Load Indicator only shows as a line unless hovered I installed the  GNOME extension on my Ubuntu 18.04, but for some reason, instead of showing a proper graph for CPU usage, it only shows a very thin line that seems to be a small portion of the actual graph. If I hover over it, the proper graph shows. How to make it show the whole graph all the time? What's the difference between  and ,  and ? What's the difference between &lt;b&gt; and &lt;strong&gt;, &lt;i&gt; and &lt;em&gt; in HTML/XHTML? When should you use each? Performance impact of updating target columns with same values ON CONFLICT This is a question about the inner-workings of Postgres (v10) and performance.  Given a table, github_repos, with a multi-column unique index on org_id and github_id columns, is there any performance difference (or other issues to be aware of) between the two bulk upsert operations below? The difference is that in the first query, the org_id and github_id columns are included in the UPDATE, whereas in the second query they are not. Since the UPDATE runs ON CONFLICT, the updated values of org_id and github_id will be the same as the old values, but those columns are included in the UPDATE because the underlying library I am using is designed that way. I'm wondering if its safe to use as-is or whether I should be explicitly excluding those columns in the UPDATE.  Query #1:  INSERT INTO "github_repos" ("org_id","github_id","name") VALUES (1,1,'foo') ON CONFLICT (org_id, github_id) DO UPDATE SET "org_id"=EXCLUDED."org_id","github_id"=EXCLUDED."github_id","name"=EXCLUDED."name" RETURNING "id"   Query #2:  INSERT INTO "github_repos" ("org_id","github_id","name") VALUES (1,1,'foo') ON CONFLICT (org_id, github_id) DO UPDATE SET "name"=EXCLUDED."name" RETURNING "id"   github_repos table:        Column       |       Type        | Collation | Nullable  -------------------+-------------------+-----------+----------+  id                | bigint            |           | not null |  org_id            | bigint            |           | not null |  github_id         | bigint            |           | not null |  name              | character varying |           | not null |  Indexes:     "github_repos_pkey" PRIMARY KEY, btree (id)     "unique_repos" UNIQUE, btree (org_id, github_id) How do we know the Taylor expansion for $e^x$ works for all $x$? Or that it's analytic? What is the value of $\sum\limits_{i=1}^\infty\frac{1}{p_{p_i}}$ where $p_{i}$ is the $i$th prime? What is the value of $\sum\limits_{i=1}^\infty\dfrac{1}{p_{p_i}}$ where $p_n$ is the nth prime (and so $p_{p_n}$ is the $k$th prime, where $k$ is the $n$th prime) ?  Thus $\frac{1}{3}+\frac{1}{5}+\frac{1}{11}+...=$ ??  How do I efficiently decide if $\sum_{i=1}^\infty\dfrac{1}{p_{p_i}}\gt1$ is true without using a computer ?  I assume this infinite sum is an irrational number. Has this already been proven ? General closed form of $\int_{0}^{\theta_0} \frac{1}{\sqrt{\cos \theta-\cos \theta_0}} d\theta$ I once asked a  about how to integrate the reciprocal of the square root of cosine.  Is  there a general closed form for the integral $$\int_{0}^{\theta_0} \frac{1}{\sqrt{\cos \theta-\cos \theta_0}} d\theta$$   in terms of the gamma function?  Thank you. Drawing a square root spiral How to display all the tables with more information (create date, size,...) in a MySQL database? How to put legend below the chart? I have the following code that produces a line chart:  \begin{figure}[p]     \centering \begin{tikzpicture}     \begin{axis}[     use units,     cycle list name=exotic, %This defines the color. It produces nicer colors         width=15cm, height=8cm,     % size of the image         grid = major,         grid style={dashed, gray!30},         %xmode=log,log basis x=10,         %ymode=log,log basis y=10,         xmin=0,     % start the diagram at this x-coordinate         ymin=0,     % start the diagram at this y-coordinate         %/pgfplots/xtick={0,5,...,60}, % make steps of length 5         %extra x ticks={23},         %extra y ticks={0.507297},         axis background/.style={fill=white},         ylabel=Time,         xlabel=Number of Datapoints (n),         y unit=s,y unit prefix=m,         tick align=outside]        % import the correct data from a CSV file       \addplot table [col sep=comma,trim cells=true,y=Best Case (Ascending)] {datasets/time_mergesort.txt};           \addplot table [col sep=comma,trim cells=true,y=Average Case (Random)] {datasets/time_mergesort.txt};                     \addplot table [col sep=comma,trim cells=true,y=Worst Case (Descending)] {datasets/time_mergesort.txt};                      \legend{Ascending,Random,Descending}     \end{axis}  \end{tikzpicture}     \caption{Mergesort Run Time for Sorting Random Data}     \label{fig:merge_sort_from_csv} \end{figure}   And at the moment the legend appears on the chart on the upper right corner. I need to move that below the chart, or even to leave that on the chart but to move that on the upper left corner.   I have tried the solution mentioned at , but it did not work for me.  How can I move the axis in a different position? In my profile my hat is on the correct position, but not in the top-bar. This is new. It worked until now.    Works neither in Chrome nor in Firefox. I know that non-married lovers address each other by saying “This is my girlfriend/boyfriend.” I know that married couples address each other by calling “my wife/husband”.  I also know that gay lovers who are not married (yet?) address each other by saying "my boyfriend" (for gays) and "my girlfriend" (for lesbians).  But if they are married, how do they address each other?  And how do we describe them? I mean if they are gays, are they “husband and husband” or “husband and wife” (one of them acts like the wife)? And if they are lesbians, are they “wife and wife” or “husband and wife” (one of them acts as the husband)?  I know they can be referred to as a gay couple or gay lovers from , but I couldn't find the answer to address each of the two.