Changing System name
How do I change the computer name?
How to fix "-5 No address associated with hostname error" while updating? NEWID() In Joined Virtual Table Causes Unintended Cross Apply Behavior My actual work query was an inner join, but this simple example with cross join seems to nearly always reproduce the problem.  SELECT * FROM (     SELECT 1 UNION ALL     SELECT 2 ) AA ( A ) CROSS JOIN (     SELECT NEWID() TEST_ID ) BB ( B )   With my inner join I had many rows for which I added to each a GUID using the NEWID() function, and for about 9 out of 10 such rows the multiplication with the 2-row virtual table produced the expected results, just 2 copies of the same GUID, while 1 out of 10 would produce different results. This was unexpected to say the least and gave me a really hard time trying to find this bug in my test data generation script.  If you take a look at the following queries using as well non-deterministic getdate and sysdatetime functions, you won't see this, I don't anyway-I always see the same datetime value in both final result rows.  SELECT * FROM (     SELECT 1 UNION ALL     SELECT 2 ) AA ( A ) CROSS JOIN (     SELECT GETDATE() TEST_ID ) BB ( B )  SELECT * FROM (     SELECT 1 UNION ALL     SELECT 2 ) AA ( A ) CROSS JOIN (     SELECT SYSDATETIME() TEST_ID ) BB ( B )   I'm currently using SQL Server 2008 and my work around for now is to load my rows with GUIDs into a table variable before finishing out my random data generation script. Once I have them as values in a table as opposed to virtual table, the problem goes away.  I have a workaround, but I'm looking for the ways to workaround without actual tables or table variables.  While writing this I tried without success these possibilities: 1) placing the newid() into a nested virtual table:  SELECT * FROM (     SELECT 1 UNION ALL     SELECT 2 ) AA ( A ) CROSS JOIN (     SELECT TEST_ID     FROM (         SELECT NEWID() TEST_ID     ) TT ) BB ( B )   2) wrapping the newid() within a cast expression such as:  SELECT CAST(NEWID() AS VARCHAR(100)) TEST_ID   3) reversing the order of appearance of the virtual tables within the join expression  SELECT * FROM (     SELECT NEWID() TEST_ID ) BB ( B ) CROSS JOIN (     SELECT 1 UNION ALL     SELECT 2 ) AA ( A )   4) using uncorrelated cross apply  SELECT * FROM (     SELECT NEWID() TEST_ID ) BB ( B ) CROSS APPLY (     SELECT 1 UNION ALL     SELECT 2 ) AA ( A )   Just before finally posting this question, now I tried this with success it seems, a correlated cross apply:  SELECT * FROM (     SELECT NEWID() TEST_ID ) BB ( B ) CROSS APPLY (     SELECT A     FROM (         SELECT 1 UNION ALL         SELECT 2     ) TT ( A )     WHERE BB.B IS NOT NULL ) AA ( A )   Anyone have any other more elegant, simpler workaround? I really don't want to use cross apply or correlation for a simple row multiplication if I don't have to. How to delete empty folder with thumbs.db without disabling thumbnails I often have problem to delete a folder that contains a thumbs.db file. Also tools like  fail. It seems to be loccked by os for some unknown reason. The only solution i found in the net was to disabling thumbnails in windows but this is a bad workaround isn't it?  Is there a "normal"(or official, supported by MS) way to delete an empty folder that only contains a thumbs.db? "I want you succeeding" vs. "I want your succeeding" First off, this is a question about a desktop application using Windows Forms, not an  question.  I need to interact with controls on other forms. I am trying to access the controls by using, for example, the following...  otherForm.Controls["nameOfControl"].Visible = false;   It doesn't work the way I would expect. I end up with an exception thrown from Main. However, if I make the controls public instead of private, I can then access them directly, as so...  otherForm.nameOfControl.Visible = false;   But is that the best way to do it? Is making the controls public on the other form considered "best practice"? Is there a "better" way to access controls on another form?  Further Explanation:  This is actually a sort of follow-up to another question I asked, . The answer I got was great and solved many, many organizational problems I was having in terms of keeping the UI straight and easy to work with both in run-time and design-time. However, it did bring up this one niggling issue of easily controlling other aspects of the interface.  Basically, I have a root form that instantiates a lot of other forms that sit in a panel on the root form. So, for instance, a radio button on one of those sub-forms might need to alter the state of a status strip icon on the main, root form. In that case, I need the sub-form to talk to the control in the status strip of the parent (root) form. (I hope that makes sense, not in a "who's on first" kind of way.) I installed the WSL Bash on Windows 10 and set my user to e.g. 'abc' but now I want to change it to something else.  How can I change the user name of the user I'm logged in as?  When I open bash it automatically logs me in with my current user. What is a complete list of the usual assumptions for linear regression? What are the usual assumptions for linear regression?   Do they include:   a linear relationship between the independent and dependent variable independent errors normal distribution of errors homoscedasticity   Are there any others? When I'm using  find . -type f -name "*.htm*" -o -name "*.js*" -o -name "*.txt"  it finds all the types of file. But when I add -exec at the end:  find . -type f -name "*.htm*" -o -name "*.js*" -o -name "*.txt" -exec sh -c 'echo "$0"' {} \;  it seems it only prints .txt files. What am I doing wrong?  Note: using MINGW (Git Bash) If $p,q$ are positive quantities and $0 \leq m\leq 1$ then Prove that $$(p+q)^m \leq p^m+q^m$$    Trial: For $m=0$, $(p+q)^0=1 &lt; 2= p^0+q^0$  and for $m=1$, $(p+q)^1=p+q =p^1+q^1$.   So, For $m=0,1$ the inequality is true.How I show that the inequality is also true for $0 &lt; m &lt; 1$.   Please help. An inequality from Littlewood's Miscellany If $T^n$ is $q$-contractive, $T$ exactly has one fixed point Consider a complete metric space $(X,d)$ and $T\colon X\to X$. Suppose there exists $n\in\mathbb{N}$ such that the n-th power of $T$ is $q$-contractive. Show that then $T$ has exactly one fixed point $\overline{x}\in X$.      The n-th power is defined inductively: $$ T^{n+1}(x):=T(T^{n}(x)), n\in\mathbb{N}. $$ And for a function $T\colon X\to X$, $q$-contractive means  $$ \exists 0\leq q&lt;1~\forall~x,y\in X: d(T(x),T(y))\leq q d(x,y). $$    Now to the proof.  I think I have to show, that $T$ is q-contractive, because then it follows with Banach, that $T$ does have exactly one fixed point. So I have to show, that there exists a $0\leq q&lt;1$ so that for all $x,y\in X$ it is $$ d(T(x),T(y))\leq q\cdot d(x,y). $$ And most likely I have to use the q-contractivity of $T^n$, i.e. that there exists a $0\leq q &lt;1$ so that for all $x,y\in X$ it is $$ d(T^n(x),T^n(y))\leq q\cdot d(x,y). $$  Can you help me? What exactly is a photon? Consider the question, .  The answers say, "an elementary particle" and not much else. They don't actually answer the question. Moreover, the question is flagged as a duplicate of,  &ndash; the answers there don't tell me what a photon is either. Nor do any of the answers to  mentioned in the comments. When I search on , I can't find anything useful. Questions such as,  look promising, but bear no fruit.  say things like, "the photon is an excitation of the photon field." That tells me  nothing. Nor does the , which says:     The photon is the quantum of the electromagnetic four-potential, and therefore the massless bosonic particle associated with the electromagnetic force, commonly also called the 'particle of light'...   I'd say that's less than helpful because it gives the impression that photons are forever popping into existence and flying back and forth exerting force. This same concept is in the  too - but it isn't true. As , "Virtual particles only exist in the mathematics of the model." So, who can tell me what a real photon is, or refer me to some kind of authoritative informative definition that is accepted and trusted by particle physicists? I say all this because I think it's of paramount importance. If we have no clear idea of what a photon actually is, we lack foundation. It's like what :     Photons seem to be one of the foundation ideas of quantum mechanics, so I am concerned that without a clear definition or set of concrete examples, the basis for understanding quantum experiments is a little fuzzy.   I second that, only more so. How can we understand pair production if we don't understand what the photon is? Or the electron? Or the electromagnetic field? Or everything else? It all starts with the photon.   I will give a 400-point bounty to the least-worst answer to the question. One answer will get the bounty, even if I don't like it. And the question is this:    What exactly is a photon? What's going on with "compact implies sequentially compact"? I've seen both counterexamples and proofs to &quot;compact implies sequentially compact&quot;, and I'm not sure what's going on. Apparently there are compact spaces which are not sequentially compact; quick googling and wikipedia checks will turn up examples floating around; they tend to be variants of $[0,1]^{[0,1]}$ with the product topology.  Here's a demonstration(?):  $[0,1]^{[0,1]}$ is compact by Tychonoff's theorem.  So, we demonstrate failure of sequential compactness. Choose a unique binary representation for each $x\in [0,1]$. For each $n\in\mathbb{N}$, let $f_n : [0,1]\to[0,1]$ (an element of $[0,1]^{[0,1]}$) be the function which maps each $x$ to its $n$-th place digit in its binary expansion. Let $f_{n_k}$ be a subsequence of this sequence. Let $x'\in [0,1]$ be such that the $n_{2m}$-th digit is $0$ and the $n_{2m+1}$-th digit is $1$, for all $m\in\mathbb{N}$. Then $f_{n_k} (x')$ does not converge (it alternates between $0$ and $1$), and hence $f_{n_k}$ cannot converge. Thus we have found a sequence in $[0,1]^{[0,1]}$ without any convergent subsequence and so it is not sequentially compact.  (Aside: this is apparently based off of an example in Steen's Counterexamples in Topology, according to  ) Nevertheless, there's also some proofs(?) floating around that compactness of a space implies sequential compactness, along these lines (this proof(?) is of the contrapositive):  Suppose $X$ is not sequentially compact. By definition, this means there is some sequence $(x_n)$ over $X$ with no convergent subsequence. If any $x\in X$ had for each of its neighborhood $U$ infinitely many $n$ for which $x_n \in U$, then we could define a convergent subsequence of $(x_n)$, contradicting our assumption.  (Presumably this is done by choosing for each neighborhood a sufficiently-large-indexed term in that neighborhood.) Thus, for each $x \in X$ we can select an open set $U_x$ such that $x\in U_x$ but with $x_n \in U_x$ for only finitely many $n$. The collection $\mathcal{U}=\{U_x : x\in X\}$ is clearly an open cover of $X$. If $\mathcal{U}$ had a finite subcover $\{U_1, \dots, U_k\}$ then the union $U_1 \cup \cdots \cup U_k$ would contain all of $X$ but only contain $x_n$ for finitely many $n$, which is impossible. Thus $X$ is not compact, since we have found an open cover without a finite subcover.  (Aside: this proof is essentially the same as the proof appearing in Rudin's Principles of Mathematical Analysis for Thm 2.37 that infinite subsets of compact spaces have limit points.) So, what's going on here?  It can't be that what both the counterexample and the proof are telling us is correct.  Is there some subtle (or more embarassingly for me -- glaring) flaw in the proof? How can I have  for Ubuntu? Even when I start a brand new file in Blender, I only get four video output file options: AVI raw, AVI JPEG, Frame Server, FFMpeg Video.  I am running version 2.78.5 (I'm using the beta so that I can use denoising.  How can I get access to all the other video outputs other people have? Like this: How do you transpose tensors? We transpose a matrix $A$ by replacing $A_{ij}$ with $A_{ji}$, for all $i$ and $j$.  However, in case $A$ has more than two dimensions (that is, it is a tensor), I don't know how to apply the transpose operation.   If A has dimensions $3\times 3 \times 8$, then what will replace $A_{ijk}$?  If $A$ has shape $3\times 3\times 8\times 8$, then what will replace $A_{ijkl}$? Turning fullscreen on made Minecraft crash, and now it crashes on start every time I switched to full screen on minecraft, the screen turned black as if it were loading it took a while so i closed minecraft and reopened it. When I logged on it gave me a program on my taskbar saying "minecraft minecraft" then when i closed the program it gave me this error message:   java(tm) platform SE binary has stopped working.    Is there a way to fix this? I'm trying to use grep to show only lines containing either of the two words, if only one of them appears in the line, but not if they are in the same line.  So far I've tried  grep pattern1 | grep pattern2 | ... but didn't get the result I expected. I would like to either prevent or handle a StackOverflowException that I am getting from a call to the XslCompiledTransform.Transform method within an Xsl Editor I am writing. The problem seems to be that the user can write an Xsl script that is infinitely recursive, and it just blows up on the call to the Transform method.  (That is, the problem is not just the typical programmatic error, which is usually the cause of such an exception.)  Is there a way to detect and/or limit how many recursions are allowed?  Or any other ideas to keep this code from just blowing up on me? Let $f$ be a continuous and open map from $\mathbb R $ to $\mathbb R$.Prove that $f$ is monotonic. Let $f$ be  a continuous and open map from $\mathbb R $ to $\mathbb R$.Prove that $f$ is monotonic.  Suppose that $f$ is not monotonic.Then $\exists a,b;a&gt;b$ such that $f(a)&lt;f(b)$ and $c,d;c&lt;d$ such that $f(c)&gt;f(d)$.Since $f$ is continuous then there exists no break in the graph of $f$. But how should I use the fact that $f$ is open.Any help on how should I do the proof?