How can I freeze the first row (one) and the first and second column (A and B) in Excel 2013? I've try to select rows one and two and columns A, B and C and select freeze but it doesn't work.

How can I lock both column and rows at the same time using the 'freeze panes' in Excel?     I can manage to freeze either columns or rows, but not both. I can do a similar thing with "split panes",  but this isn't quite what I want.


I have a very basic and conceptual doubt regarding the function of the permutation formula. I am going to ask them through some examples in which I applied them and could not proceed.  The first basic thing is that let us say I have four dice and I want two of my dice to show exactly $3$ and the rest can show any number except $3$.  Now my line of thought was that we fix two places where we fill in $3$ and the rest two places can be filled in $5$ ways each. the first die can show in $5$ ways, the second can also show $5$ ways, the third and fourth can show in $1$ ways each, so the total number of arrangement should be $5 \cdot 5 \cdot1 \cdot 1$. My first doubt is - Does this thing need arrangement and rearrangement or is this automatically arranged? If not then how do I write it using the permutation formula so that the direct result which comes out is automatically arranged and I don't need to look for ways to arrange it.

We have four dice and we want to know the number of ways in which at lease one dice shows 3. This is pretty simple if we judge it directly by saying that the number of ways in which all the dice can show any number is $6^4$ and the number of ways in which $3$ does not appear anywhere is $5^4$. Subtracting the two gives us the right answer i.e $679$.  I am new to combinatorics and hence when I tried to solve it sequentially by writing out things like the number of ways through permutation formula in which we count the number of ways one by one, first assuming that we have only one $3$, then two $3s$ and so on, I get confused a lot.  Can anybody help me with the procedure of solving this by writing permutation formula for each and every sequence (one three at a time, two threes at a time etc.) That would be of great help since I can find no other way through which I can remove my doubts.


Let $A$ and $B$ be two matrices. How can I prove that $$ \text{tr}\left(A^T B\right) \le \|A\|_{op} \|B\|_1$$  where $\|\cdot\|_{op}$ is the largest singular value of $A$, and $\|B\|_1$ is the sum of all singular values of $B$? I can see this is true if $A=B$ by using SVD, but don't know how to prove this more general statement.

I'm looking for a reference for a matrix-norm inequality that I used in , which has a few equivalent forms.  I will use notation that applies to complex vector spaces with a sesquilinear inner product, but of course the same applies over real matrices.  The statement is as follows:     Take $A,B \in \Bbb F^{n \times n}$.  Then    $$\vert\operatorname{tr}(A^*B)\vert \leq \sigma_1(A)\sum_{i=1}^n \sigma_i(B) = \|A\| \operatorname{tr}|B|$$   where $\sigma_i$ denotes the $i$th singular value, $|B| = (B^*B)^{1/2}$, and $\|\cdot\|$ denotes the spectral norm (induced Euclidean norm).   I did manage to find some references, but they're overkill, and the texts themselves are not readily accessible to the faint of heart (Bhatia's text is dense and Pedersen's is not about matrices in particular).    A suitable reference would be greatly appreciated.


how much of a effect do gravity shown in atomic level. how significant or negligible is it. i am guessing the effect is small because the mass of nucleus and electron is small. But the distance between them is also small as well so i am confused whether the effect of gravity is taken into consideration in the study of atomic structure.

Has there been any experiments, or are there any references, demonstrating gravity between atoms? If so, what are the key experiments/papers? Or if not, what is the smallest thing that has actually experimentally been shown to be affected by gravity?  I don't know of specific papers demonstrating gravity between larger objects, but I can vaguely remember learning about them in my classical physics class as an undergraduate. However, I have never heard of experiments demonstrating gravity at atomic or subatomic levels.  I don't have a physics background so it's not obvious to me, so just looking to see the actual research/evidence behind it, so I can start to try to imagine how gravity works at a quantum level.


I am attempting to center two subfigures relative to the page. However due to \setlength\oddsidemargin{15mm}, the figures are slightly shifted to the right. I have uploaded the current output in the first output below. The second figure is the output I wanted. Thank you for your help.

I have a figure that is wider than the \textwidth of my document. (I don't want to change the \textwidth.) As a result, the leftmost part of the figure is flush with the left margin, while the rightmost part spills into the right margin too much. I'd like to center the figure, so that it will exceed the \textwidth equally on both sides.


I wondered if anyone could help me with a couple of proofs.  The question is: Let $A$ be a given $n \times m$ matrix. The collection of scalars $\lambda_i$ and associated $n \times 1$ vectors $q_i$ that solve the equation $Aq=\lambda q$ are known as eigenvalues and eigenvectors of $A$, respectively show that:  i. Suppose $n=m$. Then for any non-singular $n \times n$ square matrix $G$ the eigenvalues of $G^{-1}AG$ are the same as those of $A$.  ii. If $A^{-1}$ exists then it shares the same eigenvectors $q_i$ as $A$ with corresponding eigenvalues $\lambda_i^{-1}$  Thanks in advance!

So $Ax=\lambda x$ where $A$ is the matrix, $\lambda$ and $x$ its eigenvalue and eigenvector resptectively.  Now I have another matrix similar to $A$ i.e. $B=TAT^{-1}$  I'll let a vector $y$ which is an eigenvector of $B$, i.e. $By=\mu y$ where $\mu$ is its ($B$'s) eigenvalue.  I have to now prove that  $By=\mu x$.  Some maths leads me to  $By = TAT^{-1}y$ but here I'm stuck.  answers wants me to assume $y=Tx$ which will essentially solve it but why/how is $y=Tx$?


In some situations, I want to validate data in a React application by comparing the current state with the original data obtained from the API. I have issues preserving the original data when I need to modify a nested element inside an array. For example, with this data: {   id: 1,   items: [{name: "foo"}, {name: "bar"}] }  And the following React component excerpt: constructor(props) {   super(props);   this.state = {     originalData: null,     items: [],   }; }  componentDidMount() {   Api.get("/data").then(res => {     this.setState({       originalData: res.data,       items: res.data.items,     }   });   }  If this.state.items[0] becomes {name: "baz"}, this.state.originalData.items[0] will also be modified. I tried to use res.data.items.slice() and [...res.data.items] to make a copy of the array when setting the this.state.items but it did not help. The two solutions I can see are:  Call the API to get the original data when it's time to validate the current state Use JSON.parse(JSON.stringify(res.data)) to store a new object not referencing res.data inside this.state.originalData.  Is there a more elegant solution?

What is the most efficient way to clone a JavaScript object? I've seen obj = eval(uneval(o)); being used, but . I've done things like obj = JSON.parse(JSON.stringify(o)); but question the efficiency.  I've also seen recursive copying functions with various flaws.  I'm surprised no canonical solution exists.


I am Java beginner. I dont understand why .toLowerCase() is not working when placed in if condition. A simple version of my code: if ( recType.toLowerCase() == "device") {           System.out.println("done");       }  it works when recType= "device" ofcourse but when recType="Device", it doesnt convert it to "device" so whats inside the if condition is not implemented!!. Any ideas?

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I have a dell laptop that came with windows 8 (OEM) I upgraded to 8.1 and yesterday I had to reinstall the windows so I created a windows 8.1 usb using an iso from the internet (windows 8.1 pro 64 bits which is the same version that I had) but my windows 8.1 installation didn't recognize my windows 8 OEM key so I used the Windows 8.1 default key to complete my install, off course the default key is invalid but my windows 8.1 wont accept the OEM key that I found cracking my bios....  How can I make windows 8.1 accept my OEM key?

I have recently acquired a laptop with an OEM Windows 8 product key.  I am interested in a clean install of Windows 8.1.  I do not have any original install media, only recovery disks, and the recovery disks perform a pre-programmed install which does not have the correct partition scheme that I need, and also install lots of programs that I do not want.  The common way to clean install Windows 8.1 with a Windows 8 key shown on websites is to use Microsoft's upgrade site to download the install media by starting the Windows 8 download first, pausing it, then starting the Windows 8.1 download.  My Windows 8 OEM key is rejected with the message This product key cannot be used to install a retail version of Windows 8.  I have tried using the generic keys provided in numerous threads, but these are all rejected with the message We can't connect right now (research shows that this is due to a key problem and not a network problem, I have confirmed the network is fine.)  If I was to obtain the 8.1 install media, am I right in thinking that I could install using the dummy key and later legitimately activate with my Win8 OEM key?  If not, could I do the equivalent for Windows 8 install media?  A clean Win8 upgraded through to 8.1 is still preferable to the wrongly-partitioned OEM version.  Is this even possible?  If it's not possible, are the manufacturer under obligation to provide me with "clean" install disks on request?


Arguably- “I’m a little confused about the usage of this word.   "Roger Federer is arguably the best tennis player ever.   This is what I heard in a conversation.     My point is does the statement seem to imply that what they’re   saying is unarguable,  and exactly correct in their opinion. or   the use of adverb is daring you to argue with that statement.

According to , the adjective arguable has two definitions        susceptible to debate, challenge, or doubt; questionable: Whether   this is the best plan of action or not is arguable.   susceptible to being supported by convincing or persuasive   argument: Admirers agree that it is arguable he is the finest pianist   of his generation.      I find that these two definitions are a bit contrary to each other. The first one emphasizes that something is doubtful, while the other means that something is probably convincing. How to distinguish between the two definitions from a sentence? Example from google news (including the adverb "arguably")        Carl Lewis, arguably the world's greatest-ever Olympian, is involved    in another running battle – to become a politician.   Here, the appellants have an arguable case that the minister's decision exceeded his jurisdiction


Recently I saw the local media (Romania) presenting a case that was initially considered COVID-19 positive and two subsequent tests led to negative results. As far as I know no official bothered to offer an explanation and I assume that this is expected in some cases (e.g. initial test was not done correctly).  Like any other tests, I expect to have an accuracy < 100% and I am wondering what that accuracy is for current tests.  I have read here about  and  shows how tests are done in China:     (..) the main way to test patients is using the Reverse Transcriptase   Polymerase Chain Reaction (RT-PCR) technique.    deals with RT-PCR accuracy, but I cannot understand its conclusions.  By accuracy I mean (total tests - false positives - false negatives) / total tests.  Is there any figure about the accuracy of COVID-19 tests?

As of time of writing it's quite common to see headlines about so-and-so who have tested positive for Covid-19, e.g.   However, these articles don't usually say how reliable the testing is. I couldn't find any recent information on it via Google, either (there are some results, e.g. , but they are old).  How accurate are the tests? What are the odds that Sophie Trudeau's results are a false positive, or that Justin Trudeau's negative result is a false negative?


I have purchased a domain and uploaded with HTML Page and When I search in Google it shows my website.  Now my question is   How Google will discover my new website? I have not used     sitemap,robot.txt and not included any kind Google plugin or     tools.    Question is already posted but there is no perfect answer for that question so I asked once again.

I recently registered a new domain, pointed it to my existing server, and set up a minimal page just saying "test" and nothing else.  I just discovered tonight that the page is already indexed in Google! There are no links to the site (I haven't even told anyone about the domain since I haven't done anything with it yet).  Is Google trawling WHOIS records or something?


I know this has been told many times but I've been programming with java for about 3 weeks and I've just been having some fun making stuff. Most of the other reports people have made did not fix my problem. The screen displays but not the rect. Here is my code:  import java.awt.Rectangle; import javax.swing.JFrame; import java.awt.Color;  public class something {     public static int SCREEN_WIDTH = 500;     public static int SCREEN_HEIGHT = 500;     public static int Y = 10;     public static int X = 10;     public static int Width = 50;     public static int Height = 50;     public static Color player_color = Color.black;     public static Graphics g;      public static void screen() {         JFrame screen = new JFrame();         screen.setVisible(true);         screen.setSize(SCREEN_WIDTH, SCREEN_HEIGHT);         screen.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);         screen.setTitle("test");         screen.setResizable(false);     }      public static void player() {         Rectangle r = new Rectangle(Y, X, Width, Height);         g.fillRect((int)r.getX(), (int)r.getY(), (int)r.getWidth(), (int)r.getHeight());         g.setColor(player_color);     }      public static void main(String[] args) {         screen();         player();     } }   By the way I am using Eclipse and I think the problem means I'm using a value which has a null value? Correct me if I'm wrong.

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I have spent enough time on google to get the satiesfied answer, but couldn't get any luck.  Finally, I decided to post a question over here.  Generally, using JAVA we are able to read the OS environment variable using the following code:  String value = System.getenv(env); or  Map<String, String> env = System.getenv();   Now, i am looking for System.setenv(key, value) kind of thing.  I am using jdk-1.8 & currently working on the Windows but looking for cross platform.  Thank you in advance if any one can help me at this point of time.  UPDATED :-     If this is duplicate then give me the answered URL of this question   which needs to be satisfy me.   I Believe, The  is not correctly touch the point what i am asking.

How do I set environment variables from Java?  I see that I can do this for subprocesses using . I have several subprocesses to start, though, so I'd rather modify the current process's environment and let the subprocesses inherit it.  There's a System.getenv(String) for getting a single environment variable. I can also get a Map of the complete set of environment variables with System.getenv(). But, calling put() on that Map throws an UnsupportedOperationException -- apparently they mean for the environment to be read only. And, there's no System.setenv().  So, is there any way to set environment variables in the currently running process?  If so, how?  If not, what's the rationale?  (Is it because this is Java and therefore I shouldn't be doing evil nonportable obsolete things like touching my environment?)  And if not, any good suggestions for managing the environment variable changes that I'm going to need to be feeding to several subprocesses?


I have a statement which I want to use as an answer. The statement runs as follows:  Barack Obama is the 44th president of the United States of America.   Here the emphasis lies on the number 44.  What would be the question for the above statement? Please help.

I want to make a question having an answer as follows:     5 is the third prime number.   The bold part is the answer. How to phrase the question?


there is an exercise in a book on complex analysis:  "Let $f$ is a holomorphic function on $\mathbb{C}$ such that exists $a>0$ with property $f(z) = f(z+a) = f(z+ja)$ for each $z \in \mathbb{C}$. Show, that f must be necessarily constant."  The hint is to use Liouville theorem: "Every bounded entire function must be constant. That is, every holomorphic function f for which there exists a positive number $M$ such that $|f(z)| \le M$ for all $z \in \mathbb{C}$ is constant."  So to finish the exercise it suffices to show $f(z$) is bounded for all $z \in \mathbb{C}$. Could someone help me? Or miss i something trivial?  Thank you.

Let $f: \Bbb C \to \Bbb C$ be an entire (analytic on the whole plane) function such that exists $\omega_1,\omega_2 \in \mathbb{S}^1$, linearly independent over $\Bbb R$ such that: $$f(z+\omega_1)=f(z)=f(z+\omega_2), \quad \forall\,z\in \Bbb C.$$Prove that $f$ is constant.   The intuition seems clear to me, we have the three vertices of a triangle given by $0$, $\omega_1$ and $\omega_2$. All points in the plane are one of the vertices of that triangle under a suitable parallel translation. The constant value will be $f(0)$, fine. Throwing values for $z$ there, I have found that $$f(n\omega_1) = f(\omega_1) = f(0)=f(\omega_2) = f(n\omega_2), \quad \forall\, n \in \Bbb Z.$$  I don't know how to improve the above for, say, rationals (at least). Some another ideas would be:   Checking that $f' \equiv 0$. I don't have a clue of how to do that. Write $w = a\omega_1+b\omega_2$, with $a,b \in \Bbb R$, do stuff and conclude that $f(w) = f(0)$. This approach doesn't seem good, because I only have a weak result with integers above. Finding that $f$ coincides with $f(0)$ on a set with an accumulation point. This seems also bad: the set on with $f$ coincides with $f(0)$ by which I found above is discrete.    Nothing works and this is getting annoying... And I don't see how analyticity comes in there. I'll be very thankful if someone can give me an idea.  (On a side note.. I know that this title is not informative at all. Feel free to edit if you come up with something better.)


Is that "log on" the website or "log onto" the website? What is a difference?

When writing an instruction about connecting to a computer using ssh, telnet, etc., I'm not sure what spacing to use in this familiar spoken phrase:   "Log in to host.com" "Log into host.com" "Login to host.com"   Maybe this is entirely subjective or the realm of industry jargon, but I couldn't think of anywhere else to ask.  Any insight?


We have to prove that $$\sum_{i=1}^n a_i e^{\alpha_ix}=0,a_i\neq0,\alpha_i\neq\alpha_j\forall i\neq j$$ has at most $n-1$ real solutions.  I tried differentiating and other stuff but was unable to do anything... Any suggestions will be helpful.

For non-zero $a_1, a_2, \ldots , a_n$ and for $\alpha_1, \alpha_2, \ldots , \alpha_n$ such that $\alpha_i \neq \alpha_j$ for $i \neq j$, show that the equation $$a_1e^{\alpha_1x} + a_2e^{\alpha_2x} + \cdots + a_ne^{\alpha_nx} = 0$$ has at most $n - 1$ real roots.  I thought of applying Rolle's theorem to the function $f(x) = a_1e^{\alpha_1x} + a_2e^{\alpha_2x} + \cdots + a_ne^{\alpha_nx}$ and reach a contradiction, but I can't find a way to use it.


My current strategy is to shoot all walls in treasure rooms and if I haven't found a secret area yet I'll shoot the exit elevator walls. I'd say I find 1 secret entrance every 2 levels or so. Is there a better system?

I'm looking for some tips and tricks to more effectively find secret rooms in Enter the Gungeon. The rules don't seem as straightforward as Binding of Isaac, which has similar gameplay/mechanics. I once found a Map item which showed all rooms on the floor, including 2 secret rooms. However, I've so far not been able to figure out their placement logic.  I do know that you need to  to break open walls to secret rooms. But blanks on each floor are limited. Can enemies accidentally reveal secret rooms like in Isaac?  How can I  most efficiently find secret rooms, given the ammo limitation? I don't want to just randomly shoot walls in every single room, seeing as the starter guns (with infinite ammo) will not reveal them. Or am I wrong in assuming that there is more internal logic to it?


#include<stdio.h>  #include<stdlib.h> int* twoSum(int* nums, int numsSize, int target) {     int *a=(int *)malloc(2*sizeof(int));     int i,j;     for(i=0;i<numsSize;i++)          for(j=i+1;j<numsSize;j++)     if(nums[i]+nums[j]==target)     {a[0]=i;a[1]=j;}     return a; } void main(){     int target,i;     int numsSize;     int b[2];     int num[10];     int *s;     s=b;     printf("Please input numsSize");     scanf("%d",&numsSize);     for(i=0;i<numsSize;i++)     scanf("%d",&num[i]);     printf("Please input target");     scanf("%d",&target);      s=twoSum(num,numsSize,target);     printf("【%d,%d】",s[0],s[1]); }   what's wrong with my code? I could run it smoothly on Visual Basic C++,but on the platform it implies that Line 58: conflicting types for 'main',i don't know what happened.

What is the correct (most efficient) way to define the main() function in C and C++ — int main() or void main() — and why? And how about the arguments? If int main() then return 1 or return 0?  There are numerous duplicates of this question, including:       — For C++, with a very good answer indeed.     Related:


During a Clash of Clans war, which team is determined to win when the star total is even and the total destruction is also even?

In Clash of Clans there was an update on 9/16 adding a Tie-breaker into the wars, can anybody explain in detail how this mechanism works?


I'm trying to add validation the type = "month" field on my form so that if the date entered is not greater then-current date it will give an alert.  So far iv managed to link function to my submit button using onlcick, iv got a variable that gets the current date and stores it in another variable, and iv attempted to write if/else statements but I believe the logic is incorrect.  I'll only show the code that applies to my question, if more code is required I can provide.  My form:
     <form method="post" action="www.someplace.php" id="MovieForm">
             Expiry Date             <input type="month" id="expmonth" name="expmonth">

         <button type="submit"  onclick="return ValidateForm();"  id="btn">Proceed to checkout </button>
       </form>   My JS Function:

Can someone suggest a way to compare the values of two dates greater than, less than, and not in the past using JavaScript? The values will be coming from text boxes.


I have a project that includes back and front.  Smth like:  myProject/back myProject/front   I want to create another repository and move front into it with its commit story. What are my ways?

I have a  repository which contains a number of subdirectories. Now I have found that one of the subdirectories is unrelated to the other and should be detached to a separate repository.  How can I do this while keeping the history of the files within the subdirectory?  I guess I could make a clone and remove the unwanted parts of each clone, but I suppose this would give me the complete tree when checking out an older revision etc. This might be acceptable, but I would prefer to be able to pretend that the two repositories doesn't have a shared history.  Just to make it clear, I have the following structure:  XYZ/     .git/     XY1/     ABC/     XY2/   But I would like this instead:  XYZ/     .git/     XY1/     XY2/ ABC/     .git/     ABC/


If $A^2=0$, then show that $I−A$ is invertible.  I am getting nowhere that leads me to the hint: $I+A$.

Let $A$ be a squared matrix, and suppose there exists an $n\in \Bbb N$ in a way that $A^n=0$. Show that $I-A$ is invertible and that $(I-A)^{-1}=I+A+\cdots+A^{n-1}$    I don't have a clue where to start from.


Consider:  public static void main(String[] args) {      String s = "AbcD";      System.out.println(s.contains("ABCD"));     System.out.println(s.contains("AbcD")); }   Output:  false true   I need the result to be true in both cases regardless of the case. Is it possible?

Say I have two strings,  String s1 = "AbBaCca"; String s2 = "bac";   I want to perform a check returning that s2 is contained within s1. I can do this with:  return s1.contains(s2);   I am pretty sure that contains() is case sensitive, however I can't determine this for sure from reading the documentation. If it is then I suppose my best method would be something like:  return s1.toLowerCase().contains(s2.toLowerCase());   All this aside, is there another (possibly better) way to accomplish this without caring about case-sensitivity?


In a list, should it be 'A,' 'B,' 'C,', etc., or 'A', 'B', 'C'?  Should commas go inside or outside?

The American convention in quotations is (typically) to place punctuation inside quoted text. But I always run into situations where the punctuation of the quote interferes with the punctuation of the sentence. How would you punctuate this (American, non technical)?     When my friends ask, "What do you want for your birthday?", I never know how to respond.   It seems odd to place the last comma outside the quote simply because of the question mark. Is that the preferred (i.e. most often accepted) standard?


I would like to get a hint how to integrate following function:  $$\int_{0}^{\infty} \frac{\sin(t)}{e^t-1} dt$$  I guess i have to multiply or add some constant t somewhere, then differentiate the "inner" term for d/dt and then smartly substitute to get an answer which should (i guess again) have the form of sin and exp. And in the last step I would have to get the right value for t, to get back to the original integral.  The following task would be to show the equality of $ \int_{0}^{\infty} \frac{\sin(t)}{e^t-1} dt = \sum_{n=1}^{\infty} \frac{1}{1+n^2}$. That's why I think the solution is some representation of sin and exp. With a representation of the integral in sin and exp terms, this part would get easy.  Greetings

The following integral has been on my mind for a while $$\int_0^\infty \frac{\sin(x)}{e^x-1}\,\mathrm d x \tag{$\dagger$}$$    Let us indicate the integrand as $f(x)=\frac{\sin(x)}{e^x-1}$. The following are a couple of observations.   The integrand can be extended by continuity in $0$ since $$\lim_{x\to 0}f(x)=\lim_{x\to 0}\frac{\frac{\sin(x)}{x}}{\frac{e^x-1}{x}}=1$$ This is the original reason I started playing around with this integral. Mathematica yields the result $$\int_0^\infty \frac{\sin(x)}{e^x-1}\,\mathrm d x=\frac{\pi}{2}\textrm{Coth}(\pi)-\frac 12 \approx 1.076674047$$ which, following numerical evidence, seems correct. Complex analysis may be useful here, since the integrand is a holomorphic function on $\mathbb C$. I tried writing $\sin(z)=\frac{e^{iz}-e^{-iz}}{2i}$, but I was not able to find an appropriate integration contour to solve the problem. The $-1$ in the denominator breaks the simmetry of the expression. This made most of my substitutions useless.   Can this integral be evaluated correctly, preferrably through complex analytic methods?


I am an Indian citizen living in London. I have a long-term UK resident permit.  I would like to apply for a multiple-entry Schengen visa, as I am planning to make two trips to Germany to visit my friend. The first is from December 29 to January 6, and the second one is from January 15 to 19.  I am not sure how to fill the intended day of arrival and departure in the application form. Shall I fill the arrival date as December 29 and departure as January 19? (If that's the case, do I need to show money for the whole duration i.e. 20 days?)  How do I mention two separate trips in the application form? I am concerned that if I mention only my first trip, then I might get the visa for that specified duration.  PS: I already have received a Schengen visa in 2015. Any help would be appreciated.

I'm planning to travel to France a few times in the next few months (tourist). Since I need a Schengen visa, I just don't know how to fill out the forms (which only have questions about travel dates of ONE single trip).  How do I report that I am traveling a few times, because if I don't they might only give me a single entry visa (or a visa not valid long enough for my next trips). I can only see that I'm requesting a multiple entry visa, nothing else about how long I need it to be valid.  Do I need to provide proof of hotel/flight reservations and travel insurance for all the trips or would the first one suffice?  How do I approach this issue so that I get a Schengen visa for at least 4.5 months? I am applying in the UK at their London application centre.


For the past few days, the icons in the Hot Network Question bar have been wrong. Some are okay, but others are not, which makes me think maybe an index is shifted somewhere. It looks like this was a problem before () but it seems to be occurring again.  For example, right now I see the following icon/site pairings:   WorldBuilding icon -> Workplace site MotorVehicles icon -> MathOverflow site Writing icon -> WorldBuilding site Skeptics icon -> Sitecore site Physics icon -> Photos site Security icon -> Scify site (kind of my favorite mistake actually) SuperUser icon -> Stats site   It looks like things in the letter M onwards get messed up. Magneto site shows an "MA" icon, which I think is right (but I'm not positive).   This is happening on Windows, Linux, and Android (website). Using both Firefox and Chrome. I see it on most of the sites (Physics is my home, where the list above came from), although it looks like it's okay on this site. Clicking on a random site (Sitecore), it is wrong there too.   This is a screenshot of the problem:

Self descript. I know it's already been asked  and . But apparently it's still an issue. This only started happening to me this week that I've noticed. Per the comments in the linked answer, a hard refresh should fix it but alas, it does not. Firefox 57.0. Works on SE but doesn't work on SO or many of the other sites I visit.   I disabled my add-ons and did a hard refresh but still to no avail. I've exited my browser cleared my temp stuffs as well.


Here is my question:     Give a formal set theoretic argument to prove that, for all sets $X, Y$ and $Z$, $$X\setminus(Y\setminus Z)=(X\setminus Y)\cup(X\cap Z)\;.$$   I know this is true, using the identity found , so I'm unsure how to answer the question as it appears to be an identity in itself?!  How do you think I should answer it?  EDIT: This is my final answer (thank you for your help). Is it correct?  //My interpretation of the half of your answer $$\begin{align*} &\text{Suppose }X\setminus(Y\setminus Z)\\ &\implies a\in X\setminus(Y\setminus Z)\\ &\implies a\in X\land a\notin (Y\setminus Z) &\quad\text{[Definition of complement]}\\ &\implies (a\in X\land a\notin Y)\lor (a\in X\land (a\in Y\land a\in Z)) &\quad\text{[distributive law]}\\ &\implies X\setminus Y\cup (X\cap Y\cap Z) &\quad\text{[associative law]}\\ &\implies X\setminus Y\cup (X\cap Y\cap Z)\subseteq X\setminus Y\cup (Y\cap Z) &\quad\text{[}A\cap B\subseteq A\text{]} \end{align*}$$  //My half of the answer  $$\begin{align*} &\text{Suppose }X\setminus Y\cup (X\cap Z)\\ &\implies a\in (X\setminus Y\cup (X\cap Z)) \\ &\implies a\in (X\setminus Y)\lor a\in(X\cap Z) &\text{[definition of union]}\\ &\implies (a\in X\land a\notin Y)\lor (a\in X\land a\in Z)&\text{[def of complement and intersection]}\\ &\implies a\in X\land (a\notin Y\lor a\in Z) &\text{[Distributive Law]}\\ &\implies a\in X\land (T\land (A\notin Y\lor a\in Z))&\text{[Identity]}\\ &\implies a\in X\land ((a\notin Y\lor a\in Y)\land (a\notin Y\lor a\in Z)) &\text{[Excluded middle]}\\ &\implies a\in X\land (a\notin Y\lor(a\in Y\land a\in Z)) &\text{[Distributive law]}\\ &\implies a\in X\land a\notin(Y\setminus Z) &\text{[Definition of complement]}\\ &\implies a\in X\setminus(Y\setminus Z)&\text{[Definition of complement]}\\ &\implies (X\setminus Y)\cup (X\cap Z) \subseteq X\setminus (Y\setminus Z) \end{align*}$$  Since A ⊆ B, and B ⊆ A, sets A and B are equal.

Show that  $A \setminus ( B \setminus C ) \equiv ( A \setminus B) \cup ( A \cap C )$  This is an exercise I was trying to do ( not homework ) and I got stuck as follows:  Working from $A \setminus ( B \setminus C )$:  $x \in A \wedge x \notin ( B \setminus C )$ $x \in A \wedge ((x \in B \wedge x \in C) \vee (x \notin B \wedge x \in C) \vee (x \notin B \wedge x \notin C) )$  At this point I'm not sure how to proceed.  Working from the other side $ ( A \setminus B) \cup ( A \cap C ) $:  $ x \in ( A \setminus B) \cup ( A \cap C ) $  $ x \in ( A \setminus B) \vee x \in ( A \cap C ) $  $ ( x \in A \wedge x \notin B ) \vee ( x \in A \wedge x \notin C ) $  $ x \in A \wedge (x \notin B \vee x \notin C ) $  $ x \in A \wedge x \notin ( B \cap C ) $  $ A \setminus ( B \cap C ) $  I could also use some formating tips like how display logical not and how to get the lines to display properly without blank lines inbetween. :-)


This probably sounds really naive. But, a strange discussion came up on Quora about computers possibly weighing more when information is added to them.   I tried looking around but couldn't find a definitive answer. There are a few threads where people have tried to ask something similar.  1)   2)   Both threads have people arguing about the possibilities, but I'm sure a more definitive, and painfully detailed answer must exist. I hope you have a good laugh and then help me out!  I don't have the rep to post more than two links so I'll just put the original thread in the comments.  Thank you!

Browsing Quora, I saw the following  with contradicting answers.  For the :     The bits are represented by certain orientations of magnetic fields   which shouldn't have any effect on gravitational mass.   But,  contradicts that one:     Most importantly, higher information content correlates with a more   energetic configuration and this is true regardless of the particular   type of storage... Now, as per Einstein's most famous formula, energy   is equivalent to mass.   Which answer is correct?


How to make the mesh not bumpy? (Like the images below) It has subsurf modifiers and adding loop cut isn't work anyone know how to handle it thanks

Is there a way that when something is subdivided, it can be constrained from making the zig-zag flower petal pointed edges?


I am trying to find the tags on Stack Overflow Careers that have the most jobs. On most Stack Exchange sites, I can easily do this by clicking on the "Tags" link from the home page, but I don't see this link on Careers. How can I view the most popular tags?  EDIT: I tried accessing the URL  and that didn't work.

On Careers I thought it wold be nice to be able to filter by , possibly multiple, in additional to location.  Nothing fancy, but something like ....        The image of tags is stolen from the SO side to convey the idea. I suspect functionality on the Careers side would need to be a bit different.  Recent tags would likely make sense.  Favorite tags, particularly the more specific ones might not (e.g., a job posting for , ).  Anyway, the image is just to give a sense of the idea.


I am using the Latex interpreter for the figures, which I create and save as a .eps-file in matlab. The problem is that I want to change some names of the labels of the axis in these .eps files and I don't have any more the original .fig file or my original matlab-code/-data from which I have created these .eps-files.  If I open the .eps files with Inkscape, it doesn't recognize the font of the x- and y-labels and the legend. It just recognize the numbers on the x- and y-tick. Is there any way to recognize the fonts in the .eps-file and change the names of the labels?  Thank you very much.

For some complicated diagrams, I need to use something like Adobe Illustrator or Inkscape, and would like to include nicely typeset labels. (I'm aware of post-processing solutions, such as pinlabel.) One way to do this is to use a closely-matching font, and then convert fonts to outlines. Better, however, would be to use Computer Modern directly in Illustrator.  Where can I find a Computer Modern font compatible with Adobe Illustrator?


I'm probably doing this the wrong way. I'm trying to model a vodka bottle. Although, I'm stuck at one step. I have everything there except the text. I used two different methods of projecting the text as a decal using images as planes and both gave undesirable results. I have my bottle textured with a generated gradient. I don't want to combine the text and gradient into one uv map as I could deform the text and gradient in trying to map it to the correct place. What should I do? I feel like there's a simple solution that I'm not aware of...

I'm designing this animal-type creature, and want to add a transparent .png image to its face with the face features (object has a subsurf). On the left is the image with the features, on the right is the part of the object where I want it to be.    I tried to import the image as a plane, but matching the shape of the plane with the face didn't work, and the lines of the face left shadows on the head, and could be seen as a different object from some angles (although it's the closest I've gotten yet). It looked like this:    So , I tried selecting the faces of the head that the features should go over, and create a new material for it. Unfortunately, since the .png is transparent, the result produced was this:    (where it's impossible to tell the transparency from a black background default color, and where I wouldn't know where to start to adjust size and position).  I also tried UV mapping, but then the whole object became black with the features repeated all over.   Is it something I have to go into Nodes for? I'm kind of stuck here. Creating a new material and applying it is simple, but applying a material that is an image is a bit more complex it seems... Ideally, I would reproduce the same technique for the adhesive bandage on its arm (seen on the right of image 1).


I was recently working on an application and it was showing its status as "Running", and this thought popped up in my head: why "run" and not "walk"?   What's the origin of this difference?  Tried to search but couldn't find an explanation.

Historically speaking, it makes sense to me someone would say run "the computer". Early computers (not a human computer) were mechanical machines with moving parts that could achieve a velocity deemed "running" from the perspective of a human being. I don't know for sure if that is the reason why, but that seems plausible.  But why run the "program", "code" or "software"?


The test data set is used for an independent assessment of the selected model, can anybody explain how this process works?

How would you describe  to someone without a data analysis background?


Problem : I would like to call a function "test " with passing parameters using the click event of the button.  using addEventListener ('click', test ); works.  using addEventListener ('click', test(parameter)); the function is activated automatically when loading and not to click on the button .   Question: how to pass parameters ?  //create 3 button (n is a counter):     var btn = document.createElement("INPUT");         btn.setAttribute("id", "demo"+n);         btn.setAttribute("type", "button");         btn.setAttribute("value", ("click"));         document.body.appendChild(btn);   call Without parameters works correcty:  function test(m) {     alert("YOU CLICKED ME!"); }  var m=0; while(m!=3){         document.getElementById("demo"+m).addEventListener("click", test);         m=m+1; }      `  with parameters not works (the function is activated immediately):  function test(m) {     alert("YOU CLICKED ME!"+m); }  var m=0; while(m!=3){     document.getElementById("demo"+m).addEventListener("click", test(m));             m=m+1; }

The situation is somewhat like-  var someVar = some_other_function(); someObj.addEventListener("click", function(){     some_function(someVar); }, false);   The problem is that the value of someVar is not visible inside the listener function of the addEventListener, where it is probably being treated as a new variable.


I have recently been promoted to associate professor with tenure. But I want to relocate to another institution of similar rating. Is it possible to get an offer with tenure from another institution in the US? How common/uncommon is it in the US? Advices on the procedure with respect to the US academia will be highly appreciated. The central part of my question is about the possibility for retaining the 'tenured' status at the mid-career move (e.g., how common it is and how to negotiate).

I am starting a permanent position this year, and while I am very happy here, the admin part seems a bit overbearing. I know from my previous positions as a postdoc, that other places are not that bad. And it made me think about changing universities in some ten years or so. But that raises the obvious question. If I were to look for a new job now (not that there are any, with the global recession), I'd just apply like everyone else, and go through the usual hiring process. How do senior faculty change universities? Do you apply for a job ad, or do you talk to your colleagues at another university, or does the department hear that you're unhappy and they make you an offer directly? Do you need to get recommendation letters at all (I know mostly these things happen "in secret until they're public") or would that be just a formality at the end? I've seen a handful of people change universities immediately after being tenured, or even when they were full professors. And I always found it a bit odd.


If two particles are entangled at a distance of light years, does changing one affect the other instantaneously, or does it take years to occur?   What gives us the answer to this question?

The phenomenon of observing one entangled particle and noticing the other take on corresponding values... Does this take a finite speed at all or is it instantaneous?


Why does the share value decrease significantly every year but the growth of hypothetical 10k skyrocket?  The value of a share went from 14.12 Feb 2012 to 7.78 as of today.   I am unsure when to sell my shares in this fund due the significant loss in value over time. Is the yield supposed to make this a worthwhile investment that it can somehow combat the funds losses with reinvestment?

From , page 209:     Dividends   Dividends are income paid by investments. Both bond funds   and stocks can  pay dividends. Bond fund dividends (the interest paid   by the individual  bonds in a fund) tend to be higher (as a percentage   of the amount you have  invested in a fund). When a dividend   distribution is made, you can receive  it as cash (which is good if   you need money to live on) or reinvest it into  more shares in the   fund. In either case, the share price of the fund drops to  offset the   payout. So if you’re hoping to strike it rich by buying into a bunch    of funds just before their dividends are paid, don’t bother. You’ll   just end up  paying more in income taxes.    It is talking about mutual funds.   I've never played with stocks.  However, I would like to know more about it.  Does the bold text imply the stock price will drop because of a company giving out a dividend?


... so that the cost of such a broadcast stays zero.   Is this sentence correct ? or should I omit the a?  Thank you!

Should you put an “a” here in the blank after such?     Alpha is supposed to warrant the connection between Beta and Gamma. But ____ connection seems to be already warranted.    Which one is correct instead of ____, such or such a?


I have a list of dictionaries which look like the following:  my_list = [           {'1200' : [10, 'A']},           {'1000' : [24, 'C']},           {'9564' : [6, 'D']},           ]   All dictionaries in the list have one key-value pair.  I want to sort it based on the first element of each dictionaries value which is a list, so the sorted list would look like:  my_list_sorted = [           {'9564' : [6, 'D']},           {'1200' : [10, 'A']},           {'1000' : [24, 'C']},           ]   As you can see the keys have different names and that's why I could not use answers from, for example, the following post:

I have a list of dictionaries and want each item to be sorted by a specific value. Take into consideration the list: [{'name':'Homer', 'age':39}, {'name':'Bart', 'age':10}]  When sorted by name, it should become: [{'name':'Bart', 'age':10}, {'name':'Homer', 'age':39}]


Given the definition of a Matrix Lie Group as a subgroup of $GL(n,\mathbb{C})$ such that for every sequence $A_n$ its limit $A$ is either in the subgroup or it is not invertible, what are the known examples for which the limit $A$ is invertible but is not contained in the subgroup, hence subgroups of $GL(n,\mathbb{C})$ that are not matrix Lie groups?

Let $G$ be a matrix Lie group and let $H$ be a Lie subgroup of $G$. My understanding is that all $g \in G$ are matrices, since $G$ is a subgroup of the general linear group. Then aren’t all elements $h \in H$ matrices, since $h \in G$?  From what I can gather $H$ is a matrix Lie group if $H$ is a closed subset of $G$. But if $H$ is not a closed subset of $G$, why is it not a matrix Lie group? Is the reasoning in the first paragraph wrong?


I am used to install and remove various operating systems in my PCs, even having several at a time.  Usually, to install a new OS means:   Burn the ISO to a CD/DVD/USB. Insert it. Boot. (Maybe you have to tweak a bit the BIOS first).   The only difference between PCs is its CPU architecture: x86, x86_64, arm, etc. Depending on that, you have to download one ISO or another. But I never have to worry about which graphic card, mouse, keyboard, screen, network card, etc. it has. The install wizard automatically detects that and installs the corresponding drivers. Sometimes, if they are not bundled, the installer also downloads them. Anyway, the key point here is that the ISO is always the same.  Now, many mobile OS come out: Ubuntu, Tizen, Firefox OS, the omnipresent Android, and why not any Linux ARM distro out there!. Sadly I have a random chinese mobile, that surely will never get official support in any platform, and I will never be able to test them.  But... Are not today's phones just tiny ARM PCs? Why is installation that different? Why do I always need to have a precompiled monolithic ROM specific for my phone model? Why not just a single "ISO" per OS for any phone that detects and installs automatically the needed drivers, just like always has been in the PC market?  Note: I understand the problem with privative drivers, but I remember Debian asking me for those when there were no libre alternatives at installation, and I could install them then or later. I suppose that workaround could be used in those cases too. Correct me if I'm wrong.

Are there any technical or others reasons why Android is still a firmware and not an OS which can be just installed without a lot of hassle?  Why there is no universal image which could detect appropriate drivers (kernel modules), partition NAND in some standard way and configure boot loader to boot updated OS version?  What stops Google from making a real (less firmware-like) OS (an OS for small ARM, x86 etc. devices)?


Evaluate the following integral $$\displaystyle I=\int_{0}^{1}\frac{x-1}{(x+1)(\ln x)} \mathrm{d}x $$ My work: I tried it by letting $\displaystyle I(a)=\int_{0}^{1}\frac{(x-1)x^a}{(x+1)(\ln x)} \mathrm{d}x$ and then $\displaystyle I'(a)=\int_{0}^{1}\frac{(x-1)x^a}{x+1} \mathrm{d}x$. Now $\displaystyle I'(a)=\int_{0}^{1}x^a \mathrm{d}x-\int_{0}^{1}\frac{2x^a}{x+1} \mathrm{d}x$ Now if $\displaystyle J(a)=\int_{0}^{1}\frac{x^a}{x+1}\mathrm{d}x$ , then by applying integration by parts, we get the reccurence relation $J(a)+J(a-1)=\dfrac{1}{a}$ and we can solve it then, but the thing is, we neet to find $I(0)$ ,so even if we compute $J(a)$, it wouldn't be defined at $0$ and so would $I(a)$, then how do I find $I'(a)$ by other method? I also tried the substitution $x \to \frac{1}{x}$, which yields $\displaystyle I=\int_{1}^{\infty}\frac{(x-1)}{(x+1)(\ln x)} \mathrm{d}x$ and when I saw their graphs, it clearly doesn't seem that the area under the graph of this function from $0$ to $1$ and from $1$ to $\infty$ are equal. I would appreciate if someone could  continue from my method and other solutions are also welcomed...

Evaluate: $$ I(n) = \int_0^1\left(\frac{x-1}{x+1}\right)^n\frac{1}{\ln x} \,dx$$ For $n \in \mathbb N$.  I started by noticing that $\int_0^1 x^y \,dy = (x-1)/\ln x$ So I can convert this into a double integral as follows: $$I(n) = \int_0^1\int_0^1\frac{(x-1)^{n-1}x^y}{(x+1)^n}\,dy\,dx$$ Changing the order of integration and plugging in $x \rightarrow \cos 2\theta$, I get: $$I(n) = 2(-1)^n\int_0^1 \int_0^{\pi/4}\tan^{2n-1}\theta \cos^y 2\theta \,d\theta \,dy$$ I have a feeling that I can somehow transform the inner integral into a Beta function, but the $\pi/4$ and $2\theta$ are a bit irritating and hard to get rid of. Any methods to tackle this?


In Overwatch, a player can be issued medals for peak performance in 4 categories; Eliminations, Damage, Healing, and Objective Time, and Objective Kills. Bronze, Silver, and Gold medals are awarded for 3rd, 2nd, and 1st in that category, respectively.  How is EXP gain calculated from these medals? What are the specific EXP numbers gained from the different categories of medals? Will multiple Gold medals stack their EXP? Can EXP from multiple categories of medals stack, or is only the highest achieved counted?  All this time playing the game, and I still don't know how medals work...

At the end of the game, how are medals awarded?   As a secondary, what is the relation between bronze silver and gold medals, and how much experience do they reward?


am trying to authenticate using an Active Directory User on a Apache with nested Groups.  Apache 2.4.7 Ubuntu 14.4  I have a Group with Name test in this Group i have a few nested Groups If i put the user in the test goup directly all fine. The user get authenticated. But if i put the user in a nested Group and put the nested Group in the Group test i get the errormessage.  didnt match with attr member [Comparison false (cached)] [5 - Compare false]  authoritation denied for user xyz  My Subgroupdepth is just one.  Anyone a idea ?  Best regards mobios  My Config:  <AuthnProviderAlias ldap users> AuthLDAPBindDN "CN=ldapbind,OU=Services,OU=Administration,DC=test,DC=tc" AuthLDAPBindPassword Password AuthLDAPURL "ldap://10.0.100.1:389/CN=Users,DC=test,DC=tc?sAMAccountName?sub" </AuthnProviderAlias>   <AuthnProviderAlias ldap project> AuthLDAPBindDN "CN=ldapbind,OU=Services,OU=Administration,DC=test,DC=tc" AuthLDAPBindPassword Password AuthLDAPURL "ldap://10.0.100.1:389/OU=Projects,DC=test,DC=tc?sAMAccountName?sub" </AuthnProviderAlias>  <AuthzProviderAlias ldap-group test CN=test,CN=Users,,DC=test,DC=tc> AuthLDAPBindDN "CN=ldapbind,OU=Services,OU=Administration,DC=test,DC=tc" AuthLDAPBindPassword Password AuthLDAPURL "ldap://10.0.100.1:389/CN=Users,DC=test,DC=tc?sAMAccountName?sub" </AuthzProviderAlias>  Alias /production /srv/webdav/production  <Location "/production"> SSLRequireSSL  DAV On  Options None  AuthType Basic  AuthUserFile /dev/null  AuthName "Repository production"  AuthBasicProvider project users  AuthLDAPMAxSubGroupDepth 10 AuthLDAPSubGroupAttribute member AuthLDAPSubGroupClass Group AuthLDAPGroupAttribute member AuthLDAPGroupAttributeIsDN on Require test Options Indexes FollowSymLinks MultiViews  Order Deny,Allow  </Location>   My active Directory Details are:  test.tc | |--(CN)Users--(CN)test | |--(OU)Projects--(OU)Group1--(CN)Group1    This are my Details in my active Directory. (CN)test is the main Group and (CN)Group1 are nested in (CN)test.  Additionally i tried: Require ldap-filter memberof:1.2.840.113556.1.4.1941:=CN=test,CN=Users,dc=test,dc=tc  unfortunately dont work :(

I've working LDAP authentication with the following setup   AuthName            "whatever"  AuthType            Basic  AuthBasicProvider   ldap  AuthLDAPUrl         "ldap://server/OU=SBSUsers,OU=Users,OU=MyBusiness,DC=company,DC=local?sAMAccountName?sub?(objectClass=*)"  Require ldap-group  CN=MySpecificGroup,OU=Security Groups,OU=MyBusiness,DC=company,DC=local   This works, however I've to put all users I want to authenticate into MySpecificGroup. But on LDAP server I've configured that MySpecificGroup also contains the group MyOtherGroup with another list of users.  But those users in MyOtherGroup are not authenticated, I've to manually add them all to MySpecificGroup and basically can't use the nested grouping. I'm using Windows SBS 2003.  Is there a way to configure Apache LDAP to do this? Or is there a problem with possible infinite recursion and thus not allowed?


The only thing I know about $(\Bbb{R},\,\cdot\,)$ is that it is isomorphic to $GL_n (\Bbb{R}) / SL_n (\Bbb{R})$. In general, I find it difficult to show that there is an isomorphism between two groups, unless they are cosciennt groups. That is easier because I can use the isomorphism theorems, but when I fall into these cases, I have no idea what to do.

Let $(\mathbb K,+,\cdot)$ be a field. Is there a group isomorphism between $(\mathbb K,+)$ and $(\mathbb K^\times,\cdot) $ ?  The answer should clearly be negative. I tried to proceed via contradiction, but this has not led me very far. Since it's some kind of "trick problem", I'm merely looking for hints.


I've read several stackoverflow answers related to my problem saying that when you dynamically add a row, the best way to make to new row respond to events is to have a $('.class_name').on('click',function(e) {  declaration instead of $('.class_name').click(function() {  That made sense to me so I tried it and it still doesn't work.  Nothing happens when I click the inserted link in the inserted row.  I've put the code in a JSFiddle here:   Or pasted below.  Here is my HTML

1	Harry

2	Sally

3	Wally

 <input type='button' id='add-row' value='Add Row'>

 <input type='text' id='write-rank' curcnt='0' style='width: 15px;'>   and here is my javascript:  $('.num-link').on('click',function(e) {      var cnt = $(this).attr('cnt');     $("#write-rank").attr('curcnt', cnt);     var x = $(this).position();     $("#write-rank").val('');     $("#write-rank").css({top: x.top - 4, left: x.left - 5, position:'absolute'});       $("#write-rank").show();     $("#write-rank").focus(); });  $('#add-row').on('click',function(e) {      add_row_for_new_user('Pablo'); });  function add_row_for_new_user(new_user_name) {       var dis = $(".num-link:first");       var $curRow = $(dis).closest('tr');       $newRow = get_blank_row(new_user_name);       $curRow.before($newRow);     }  function get_blank_row(new_user_name) {    var ret = '
0	'+new_user_name+'
';   return ret;      }   Any ideas?

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


I have a Linux machine (which I want to use as a gateway) and two other machines A and B. Gateway machine has eth0, eth1, and eth2.  eth1 connects to machine A and eth2 connects to machine B. I want to be able to ping from A to B and the other way around. I tried to do it using iptables, and added FOWARDING rules:  iptables -A FORWARD -i eth1 -o eth2 -j ACCEPT iptables -A FORWARD -i eth2 -o eth1 -j ACCEPT   But I am getting "host is unreachable" when trying to ping.  When I run  iptables -L -n -V   I can see that the forwarding rules got 0 packets and 0 bytes. Now I know I might missing a few more things, but it looks like the FORWARDING chain is never reached. When according to documentation if it’s not the destination it will go to FORWARDING chain.   EDIT 1: i cleaned the iptables and started from scratch using the following commnads      iptables -A FORWARD  -i eth1 -o eth2 -j ACCEPT     iptables -A FORWARD  -i eth2 -o eth1 -j ACCEPT      iptables -t nat -A PREROUTING -i eth1 -j DNAT --to-destination y.y.y.y     iptables -t nat -A PREROUTING -i eth2 -j DNAT --to-destination x.x.x.x      iptables -t nat -A POSTROUTING -o eth2 -d y.y.y.y -j SNAT --to-source x.x.x.x     iptables -t nat -A POSTROUTING -o eth1 -d x.x.x.x -j SNAT --to-source y.y.y.y   Still getting "network is unreachable"

I have two Ethernet interface being configured to use as system gateway ex:    eth1: 10.10.1.0 eth2: 10.10.2.0   I want to forward all the packets which are coming to the 10.10.2.0 gateway contacting 10.10.1.x via eth1 (10.10.1.0), and the reverse as packets coming to 10.10.1.x, contacting 10.10.2.0 machines via eth2.    How can I write iptables rules for this?


It is obvious that   $\sum_{n=1}^{+\infty} \frac{(-1)^{n-1}(2n-1)}{2^{n-1}}$  is alternating series, therefore, before we could talk about finding the sum of the series, we have to check if it's unconditionally convergent, if we look at $a_n=\frac{2n-1}{2^{n-1}}$ it is obvious that we could use d'Alembert's test and easily prove that this is unconditionally convergent series. So now, we should find the sum:  $S_n=\sum_{k=1}^{\infty} \frac{(-1)^{n-1}(2n-1)}{2^{n-1}}$  because of the denominator, it really looks like geometric series, but i could't find a way to simplify it in order to determine the sum. Any ideas?

How can I evaluate $$\sum_{n=1}^\infty\frac{2n}{3^{n+1}}$$? I know the answer thanks to , but I'm more concerned with how I can derive that answer. It cites tests to prove that it is convergent, but my class has never learned these before. So I feel that there must be a simpler method.  In general, how can I evaluate $$\sum_{n=0}^\infty (n+1)x^n?$$


I typically leave messages as unread if I need to remember to read them later.  Also I like to keep my inbox clean, so I delete mail I don't care about saving.  When I select a message and press delete, the selection jumps to the next item in the list. Many times, this is the item I just marked as unread for later.  How can I avoid this?

Is there a way to stop Mail from automatically selecting messages? For example when I delete a message, it will immediately select the next one and mark it read. Then if I don't want to read the message yet, I need to mark it as unread.


I’m not a professional academician by any means. I’m just a medical student trying to write a paper in my spare time.  I don’t have an excellent grasp of the literature in this field. A lot of the information I’m learning comes from a single excellent review article/book chapter.  Here lies my question. This book chapter will say, e.g., ”such and such [1][2]”. Do I just cite the book chapter when I describe such and such in my background? I think not; I should probably cite [1], [2], or both.  So, the real question: is it OK/acceptable/ethical to just believe that [1] and [2] contain such and such; and just cite them without actually reading the papers? To be able to do this would save me quite a bit of time.

Suppose I see that Book X is cited by several papers with reference to some particular Fact Y. I wish to cite Fact Y. As far as I know, Book X is the only reference for Fact Y.   I have never looked at Book X. Nonetheless, I cite it like this:  'Fact Y' (see Book X)  My question is: Is this ethical, given that I've never looked at Book X?  More context for my question. I am NOT asking whether this is good scientific practice. I am NOT asking how a good scientist should actually go about citing Fact Y. I am NOT asking if this could undermine your credibility as a scientist.  Instead, I am asking this question because it seems to be a somewhat-common practice. And moreover, as far as I know, no scientist has ever been issued even an official rebuke (much less fired) for engaging in such practice. This would suggest to me that this practice is not considered to be unethical.   Of course, it is not binary as to whether a practice is unethical. But I would simply like to know whether the academic community in general considers this to be even a mildly unethical practice. Or if it is perhaps very slightly unethical, but not a big deal. Or if it is not in the least bit unethical.


There is some historical usage of diacritics in English, like naïve, résumé or even façade. I've been once told that these are used to mark a different spelling, and it may be used like in coöperative instead of co-operative to split the 'oo'.  I've checked with Wikipedia:     The main use of diacritical marks in the Latin script is to change the sound-value of the letter to which they are added. Examples from English are the diaereses in naïve and Noël, which show that the vowel with the diaeresis mark is pronounced separately from the preceding vowel;   Such a situation frequently happens in word formation, where joining a prefix that ends with a vowel and a word that starts with one. For example: coinduction, preimage, prainvention, etc. Normally one could use a hyphen, but that might be undesirable, and without anything words like bioracle (joining bi- and -oracle, whatever that would mean) could be understood as bio-rackle (I'm sure there are better examples). For example, co-op is sometimes written coöp, stretching it, bioracle could be written biöracle (I admit, it does not look good).  I know this is not a real issue, as most prefixes are known and it is possible to recover the source given context. However, technically, is this correct? To give a more concrete motivation, would it be plausible that in some future version of English (e.g. in a novel) such use of diacritics would be more frequent?

As I understand, ö in coöperation is considered archaic (or is it?) and words like résumé, cliché and naïve are copied directly from foreign languages. Are there any contemporary native (non-borrowed) English words left that contain characters with diacritics? Update: Note that a word from any contemporary dialect of English would work for this question. Also, of course, as is noted in answers below, besides borrowed foreign language words, there are English words with diacritics, that were created from non-English given names — like  for example. Such words, arguably, also can be considered borrowed. And, at least with ångström, Wikipedia claims that version with diacritics is archaic as well. Update 2: To clarify:  Contemporary = was a norm in XX century at least (preferably after twenties as well). When I said "archaic" in comments, I meant "non-contemporary".  Diacritics, which appeared in anglicization of a borrowed word (i.e. foreign original does not have diacritics), is acceptable. (So, Brontë surname would be good if survived into XX century.) (Anyway, is there a source where I can read about the rules which guide when diacritics should appear during "contemporary" anglicization?)  I'm not sure if proper nouns are in the spirit of the question — but if you know one that fits and is not synthetic (i.e. employs "metal umlauts" or imitates some foreign language), please share.


When I enter my terminal with "sudo apt-get update" the following jumps up:  Err:19 http://ppa.launchpad.net/flimm/ooo-thumbnailer/ubuntu bionic Release     404  Not Found [IP: 91.189.95.83 80]  Get:20 http://gb.archive.ubuntu.com/ubuntu bionic-updates/main amd64 Packages [644 kB]  Err:21 http://ppa.launchpad.net/gwibber-daily/ppa/ubuntu bionic Release         404  Not Found [IP: 91.189.95.83 80]  Get:22 http://gb.archive.ubuntu.com/ubuntu bionic-updates/universe i386 Packages [941 kB]  Get:23 http://gb.archive.ubuntu.com/ubuntu bionic-updates/universe amd64 Packages [954 kB]  Err:24 http://ppa.launchpad.net/pcf/miro-releases/ubuntu bionic Release         404  Not Found [IP: 91.189.95.83 80]  Err:25 http://ppa.launchpad.net/ubuntuone/nightlies/ubuntu bionic Release       404  Not Found [IP: 91.189.95.83 80]  Reading package lists... Done   E: The repository 'http://ppa.launchpad.net/flimm/ooo-thumbnailer/ubuntu bionic Release' does not have a Release file.  N: Updating from such a repository can't be done securely, and is therefore disabled by default.  N: See apt-secure(8) manpage for repository creation and user configuration details.  E: The repository 'http://ppa.launchpad.net/gwibber-daily/ppa/ubuntu bionic Release' does not have a Release file.  N: Updating from such a repository can't be done securely, and is therefore disabled by default.  N: See apt-secure(8) manpage for repository creation and user configuration details. E: The repository 'http://ppa.launchpad.net/pcf/miro-releases/ubuntu bionic Release' does not have a Release file.  N: Updating from such a repository can't be done securely, and is therefore disabled by default.  N: See apt-secure(8) manpage for repository creation and user configuration details.  E: The repository 'http://ppa.launchpad.net/ubuntuone/nightlies/ubuntu bionic Release' does not have a Release file.  N: Updating from such a repository can't be done securely, and is therefore disabled by default.   So, the question is, how to do update properly? Or else, how to correct the obvious previous mistakes?

When updating, I get the following error message:   W: The repository 'http://ppa.launchpad.net/mc3man/trusty-media/ubuntu xenial Release' does not have a Release file.   Here, I find another statement on this error:   This recommends removing certain PPAs; and, I'm not sure if I should do that since it might mean not getting the updates that I need.    Is this what I should do?


How do we prove the above proposition? $(AA)(ij)=1$ for  $i=j$ , $0$ for $i\ne j $. So, $[AA]_{ij} = \sum_k [A]_{ik} [A]_{kj}$. How can I proceed from this point?

So I'm studying linear algebra and one of the self-study exercises has a set of true or false questions. One of the questions is this:     If $A^2 = I$ (Identity Matrix), then $A = \pm I$ ?   I'm pretty sure it is true but the answer says it's false. How can this be false (maybe it's a typography error in the book)?


$\dfrac{\max|X_i|}{n}$ tends almost surely to $0$ where '$X_i$' has a distribution with finite $2$nd order moments. Can anyone here provide me with the proof?

I found an assertion in  at the beginning of page 6, but i can't see how to justify it: Let $X_n \geq 0$ i.i.d. with finite expectation then: $$ \frac1n\max\limits_{k \leq n}X_k \to 0 \quad\text{almost surely as  } \,n \to \infty$$   As Davide posted . I was wondering if it is evident that we have almost sure convergence also.


I need to know, what are installed packages for Ubuntu Server for the first time?  I need the output of dpkg -l of freshly installed 32-bit ubuntu-server (just openssh server, without mail, file, web server packages)  I need the list of installed packages so I could uninstall/clean up packages that not installed by default on my computer (without reinstalling the ubuntu) that was installed by my friend.

I am developing an offline installer for all versions of Ubuntu, and I need Ubuntu's default installed packages list. Is there a way to get this information from any server (web server)? Any script to fetch any Ubuntu version's default installed packages list.  I will give the Ubuntu version, and the script will fetch the packages list.  Note: I need at least a server address. I can write a script for this.


I want to insert a few fairly large endnotes. The problem is that if I insert them with \endnote{text text} it makes it very difficult to follow the flow of the main text (as the endnote spans a few paragraphs). Is there a package that would allow me to separate the place where the endnote is invoked from its contents? Something like say \lendnote{Label1} to invoke and \begin{lendnote}\label{Label1}<<here goes the endnote body>>\end{lendnote}

I often write documents with fairly lengthy discursive footnotes to discuss tangents or secondary issues without interrupting the flow of the main text. However, this can make it difficult to edit, since the body of the text is broken by sometimes-quite-long notes. What I would like is a way to move the text of the footnote (while still keeping it within the same file) away from the footnote mark without breaking the default placement rules for footnotes.  I have tried using \footnotemark and \footnotetext, like so:  Paragraph containing a footnote\footnotemark and some more text afterward.    \footnotetext{A very long footnote that now doesn't have to appear in the middle of a  sentence in my source file.}   However, this causes my footnote text to sometimes appear on a page following the footnote mark rather than always appearing on the same page as the mark. (Also it gets a bit messy when I have multiple notes in a paragraph.)  Is there a way to separate the footnote text from the location of the footnote mark within the source code while having the output come out as though the \footnote{was in the middle of the text}? (And preferably allowing for multiple footnotes per paragraph?) Apologies if there is an obvious answer; I've been searching around for a while now I and haven't found anything.  MWE (edited to wrap lines):  \documentclass{article} \begin{document}  A paragraph that has a footnote\footnote{Like this one here but even longer and more  intrusive so that it makes reading and editing the text very difficult. It probably goes  on and on and might even have \\ multiple \\ long \\ paragraphs inside of it.} in the  middle of it. The footnote is placed correctly, but the source is difficult to read and  edit.  A paragraph with a footnote in the middle of it\footnotemark{} that then continues onto a  new page. The source is easy to read and edit, but the footnote lands in the wrong place. \newpage    \footnotetext{A footnote that I would like to have appear on the same page as the  footnote mark, but without having the footnote text in the middle of my paragraph in the  source.}  \end{document}


I want to get the date 7 days from what the current date is. I am not to sure what code would be needed.    The code I have to find the current date is:  DateFormat dateFormat = new SimpleDateFormat("MM/dd/yyyy"); Calendar cal = Calendar.getInstance(); String date = dateFormat.format(cal.getTime());

I'm working with a date in this format: yyyy-mm-dd.  How can I increment this date by one day?


I think it is crazy on this option to send an email everytime.  This feature was added so if you lost your phone it could be found but it is also a good tool to check on your children or (spouse).  I do not like that it sends my child an email everytime I check it.  That should be parental control.  Makes you want to get an android that doesn't notify the person their phone was checked up on.

Is the email notification from Apple that your device has been tracked using Find My iPhone a new feature?


I'm trying to make a world background by enclosing the whole area in a big sphere, and projecting a spherical map onto that sphere, as per a tutorial on youtube that I can't post because it won't let me post more than 2 links, but it's called "Blender Game Tutorial (2.6): Building a 3D Game - Part 1".  The sphere looks normal in the 3d viewport. Here it is with 3d display mode set to Solid, and inset in that image is with 3d display mode set to Material, showing that my image successfully mapped onto the sphere to make a space background to the world.    But when I go into active camera view (numpad 0), part of the sphere disappears!    The same thing happens when I render with F12 (I can't post more than two images though).  It does not seem to be an issue clipping/camera distance. I varied the max camera distance to quite a wide range of values, and it didn't affect this phenomenon at all.  I'm fairly new at Blender, thanks for any help you can give.

I have created a simple model here   When rendering it the end of it is cut off   How can I get the camera to render a longer distance?


I have several systems. Some are 16.04 mini-servers and I cannot update the OS yet. The others have been updated to Ubuntu 18.04. (The 18.04 version I used has Python 3.6.5 on it).

I want to install the latest Python tarball on Ubuntu, downloaded from .  Is this is a correct way to install?  ./configure make make install   If not, how do I do that?


I have a sum() function. I need to catch all overflow.  I searched website but didn't find a good way to do so.  So...any thoughts?

I was writing a program in C++ to find all solutions of ab = c, where a, b and c together use all the digits 0-9 exactly once. The program looped over values of a and b, and it ran a digit-counting routine each time on a, b and ab to check if the digits condition was satisfied.  However, spurious solutions can be generated when ab overflows the integer limit. I ended up checking for this using code like:  unsigned long b, c, c_test; ... c_test=c*b;         // Possible overflow if (c_test/b != c) {/* There has been an overflow*/} else c=c_test;      // No overflow   Is there a better way of testing for overflow? I know that some chips have an internal flag that is set when overflow occurs, but I've never seen it accessed through C or C++.    Beware that signed int overflow is undefined behaviour in C and C++, and thus you have to detect it without actually causing it. For signed int overflow before addition, see .


Prove that every integer is a sum of two squares and a cube of integer.  Probably the only connected result I know, is the Fermat's theorem on sums of two squares. But I don't know how to prove that in other cases (for numbers not being of the form $x^2+y^2=x^2+y^2+0^3$) one can choose such two squares that the remainder will be a cube.


Among the effects of Wild Shapes, these two:     Your game Statistics are replaced by the Statistics of the beast, but   you retain your alignment, personality, and Intelligence, Wisdom, and   Charisma scores. You also retain all of your skill and saving throw   proficiencies, in addition to gaining those of the creature. If the   creature has the same proficiency as you and the bonus in its stat   block is higher than yours, use the creature's bonus instead of yours.   If the creature has any legendary or lair actions, you can't use them.      You retain the benefit of any features from your class, race, or other   source and can use them if the new form is physically capable of doing   so. However, you can't use any of your Special senses, such as   Darkvision, unless your new form also has that sense (PHB p.67, "Wild Shape")   Seem to come into conflict with each other when things like Draconic Resilience:     When you aren't wearing armor, your AC equals 13 + your Dexterity   modifier. (PHB p.102, "Draconic Bloodline")   How would this resolve?

Among the effects of Wild Shapes, these two:     Your game Statistics are replaced by the Statistics of the beast, but   you retain your alignment, personality, and Intelligence, Wisdom, and   Charisma scores. You also retain all of your skill and saving throw   proficiencies, in addition to gaining those of the creature. If the   creature has the same proficiency as you and the bonus in its stat   block is higher than yours, use the creature's bonus instead of yours.   If the creature has any legendary or lair actions, you can't use them.      You retain the benefit of any features from your class, race, or other   source and can use them if the new form is physically capable of doing   so. However, you can't use any of your Special senses, such as   Darkvision, unless your new form also has that sense (PHB p.67, "Wild Shape")   Seem to come into conflict with each other when things like Draconic Resilience:     When you aren't wearing armor, your AC equals 13 + your Dexterity   modifier. (PHB p.102, "Draconic Bloodline")   and Barbarians:     While you are not wearing any armor, your Armor Class equals 10 + your Dexterity modifier + your Constitution modifier. You can use a Shield and still gain this benefit.   and Monks:     Beginning at 1st level, while you are wearing no armor and not wielding a Shield, your AC equals 10 + your Dexterity modifier + your Wisdom modifier.   and Stone Sorcerers:     As an action, you can gain a base AC of 13 + your Constitution   modifier if you aren’t wearing armor, and your skin assumes a stony   appearance. This effect lasts until you end it as a bonus action, you   are incapacitated, or you don armor other than a shield.   How would these resolve?


I have a system in production that started having problems. The code targets .NET Framework 4.5.2. I have the following issues:  there is no formalized build and deployment process. So I don't know which version of the code is deployed Judging from comparing the available source with decompiled DLLs from production, I don't seem to have a match on any branch. It looks like someone made a version outside source control and manually derployed it people who worked on the system have left the company years ago, and nobody who's left has any knowledge of the system  I've been trying to restore the code by decompiling the dlls, with plans to add logging and hot-swap the dll to trace the issue. I have problems with some of the dlls (3 projects out of 11, maybe 10 classes in total). For some of the classes the decompiler produces a lot of code that looks like this:   [AsyncStateMachine(typeof(<AcceptSalesAgentLeadAssignment>d__9)), HttpPost]         public Task<bool> AcceptSalesAgentLeadAssignment(SalesAgentWithLeadAssignmentsUpdateModel leadAssignment, string accountGuidAuth)         {             <AcceptSalesAgentLeadAssignment>d__9 d__;             d__.leadAssignment = leadAssignment;             d__.accountGuidAuth = accountGuidAuth;             d__.<>t__builder = AsyncTaskMethodBuilder<bool>.Create();             d__.<>1__state = -1;  From what I could find online this has to do with anonymous functions being present in the original source code. This in itself wouldn't be so bad, but the problem is this code is unbuildable. It's generating literally thousands of errors such as the following: The name d__9 does not exist in the current context.  I have tried the following tools: JetBrains DotPeek, dnSpy, Telerik JustDecompile, .NET Reflector from redgate. They all produced this unbuildable code. I don't need the resulting code to be fully human-readable. I just need to be able to produce dlls that are functionally identical to what's in production, so that I can gradually add log statements and trace the issue. I understand that the decompiler can't work out what the man-made code used to look like, but it should at least be able to produce something that's logically equivalent and buildable. Is there a way to achieve this?

I wrote a C# application for a client a couple of years ago, but I no longer have the source code.  All I have is the EXE that I deployed on the client's PC.  Is there a way I can generate C# source code from the EXE?


Usually, the zero vector in a vector space can be found quite easily. Often it's just the intuitive sense of 'zero' in the set that the vector space is defined over.   For example, if we consider the vector space of real continuous functions in an interval, then the zero vector is simply the zero function.  If we consider the vector space of complex numbers, the zero vector is simply $0+0i$.   What is an example of a vector space where the zero vector is non-trivial?  Obviously the idea of non-triviality is somewhat subjective, but that is very much unavoidable for a question of this nature.

I know that every vector space needs to contain a zero vector. But all the vector spaces I've seen have the zero vector actually being zero (e.g. $\mathbf{0}=\langle0,0,\ldots,0\rangle$). Can't the "zero vector" not involve zero, as long as it acts as the additive identity? If that's the case then are there any graphical representations of a vector space that does not contain the origin?


For people who go an extra mile to make others comfortable, be it friends, family, etc. I need an adjective or a noun, most probably one word, that can describe people who always keep others above or ahead of themselves.

Specifically, I am looking to describe a person whose only purpose is to help others, not caring about what happens to  himself or herself (physically or otherwise), though without actively seeking pain.


$$    [\exists x \in U, P(x) \land Q(x)]   \Leftrightarrow [(\exists x \in U, P(x)) \land (\exists x \in U, Q(x))] $$

Context  I'm having trouble understanding the limited situations in which qualifiers can be distributed.  I am given that the rules are:  $$\forall x\left[P(x)\land Q(x)\right]\equiv\forall xP(x) \land\forall xQ(x) \tag{1}$$ $$\exists x\left[P(x)\lor Q(x)\right]\equiv\exists xP(x) \lor\exists xQ(x) \tag{2}$$  $$\forall x\left[P(x)\lor Q(x)\right]\not\equiv\forall xP(x) \lor\forall xQ(x) \tag{3}$$ $$\exists x\left[P(x)\land Q(x)\right]\not\equiv\exists xP(x) \land\exists xQ(x) \tag{4}$$    Questions   What are examples of $P(x)$ and $Q(x)$ that illustrate when these statements are true? How can I show these statements always hold using proofs? Why can't "$\forall x$" be distributed in example 3 or "$\exists x$" in example 4?


This is my first question here. I am in my academic level. I know html, and a bit of css. I want my career in graphics and web design. As a startup, other than Html and css how many tools and softwares do i need to learn? Is knowing Javascript is mandatory for this filed?

I'm very interested in learning web development and have learned some basics regarding HTML and CSS a few years back from W3Schools, but I never learned how to develop websites that are up to today's standards, i.e. free-flowing sites without the use of tables to govern the design of the site.  What are some good resources that I can start with?


I recentely tried to log-in / sign-up for  using my SE account (which works on ,  and sign-up here) but it showed me an OpenID related error. (See below)  I could reproduce this error across multiple days and browser refreshes and using my other OpenID provider.  Error message (shown in red, obfuscated my e-mail address):  Unable to log in with your OpenID provider:  The openid.return_to parameter (http://area51.stackexchange.com/users/authenticate/?s=bd394805-cf55-4e8e-ad73-21485a09a989&dnoa.userSuppliedIdentifier=https%3A%2F%2Fopenid.stackexchange.com%2Fuser%2F642b1038-5c91-40d4-83ab-eb92db46c3d1) does not match the actual URL (https://area51.stackexchange.com/users/authenticate/?s=bd394805-cf55-4e8e-ad73-21485a09a989&dnoa.userSuppliedIdentifier=https%3A%2F%2Fopenid.stackexchange.com%2Fuser%2F642b1038-5c91-40d4-83ab-eb92db46c3d1&openid.claimed_id=https%3A%2F%2Fopenid.stackexchange.com%2Fuser%2F642b1038-5c91-40d4-83ab-eb92db46c3d1&openid.identity=https%3A%2F%2Fopenid.stackexchange.com%2Fuser%2F642b1038-5c91-40d4-83ab-eb92db46c3d1&openid.sig=4emyzuA31ChHU0LabPGJXldbN8GeKN%2FFBJXJy69yD10%3D&openid.signed=claimed_id%2Cidentity%2Cassoc_handle%2Cop_endpoint%2Creturn_to%2Cresponse_nonce%2Cns.alias3%2Calias3.mode%2Calias3.type.alias1%2Calias3.value.alias1%2Calias3.type.alias2%2Calias3.value.alias2&openid.assoc_handle=hrQL%21IAAAAGzBtFeNGBLU2o04XSWr7ISRAbO-B2tZCK3L61IzAsuQQQAAAAEdoTN6rf9fqaP1oekJGXGXJeB8fNSVuByptp5yx1VpQbAzQwF6HJzh6a0DwedydNJ-wwpJQoN5dOLEFmndZt-L&openid.op_endpoint=https%3A%2F%2Fopenid.stackexchange.com%2Fopenid%2Fprovider&openid.return_to=http%3A%2F%2Farea51.stackexchange.com%2Fusers%2Fauthenticate%2F%3Fs%3Dbd394805-cf55-4e8e-ad73-21485a09a989%26dnoa.userSuppliedIdentifier%3Dhttps%253A%252F%252Fopenid.stackexchange.com%252Fuser%252F642b1038-5c91-40d4-83ab-eb92db46c3d1&openid.response_nonce=2015-06-12T12%3A30%3A42Z7tADDeYZ&openid.mode=id_res&openid.ns=http%3A%2F%2Fspecs.openid.net%2Fauth%2F2.0&openid.ns.alias3=http%3A%2F%2Fopenid.net%2Fsrv%2Fax%2F1.0&openid.alias3.mode=fetch_response&openid.alias3.type.alias1=http%3A%2F%2Faxschema.org%2Fcontact%2Femail&openid.alias3.value.alias1=mycorrectaddress%40web.de&openid.alias3.type.alias2=http%3A%2F%2Faxschema.org%2FnamePerson&openid.alias3.value.alias2=SOJPM) the request was made with.    As noted in the comments I'm not the only one, so I'd guess it may be not something I can fix. So will this be fixed?  Repro steps (using SE OpenID):   Get an Stackexchange OpenID account (like I have) (optional?) Add other OpenID providers and check they're working (StartSSL in my case) Please note: "You" don't have an "account" for the Area 51 subpage yet and still need to do the initial sign-in. Go to the Area 51 SE page Hit "Log-in" in the top-bar Hit the "log-in using stackexchange" button Enter your e-mail and password and submit Get the above error   Repro steps (using other OpenID)   Perform as above (until step 4), but this time step 2 is mandatory Hit "more OpenID options" Provide your OpenID link XXX.provider.com (works on crypto, server fault, ...) Authenticate against your provider Receive a variation of the above error (can be included if needed)

I recently tried many times to log into Area 51 with my Stack Exchange OpenID. Each time, I got this:    Then, I went to my OpenID account, and I saw this:    ...what is going on??  I have chrome, and extensions that block 3rd party cookies... is that the problem?


When I do some computation, I get a number as follows. I cannot use this in my further computations as it requires it to be a number and not to have characters in between. How can I expand this number to an actual number?  2.725808E8

I have a problem with the interpretation of a test result in which the p-value is 8.6e-28. How should it be interpreted? What is the e for?  Specifically, I used White's Test for the homoscedasticity assumption of a linear regression:  White's general test statistic :  150.0535  Chi-sq( 9)  P-value =  8.6e-28


In part of a city, I am trying to count rooftops on a basemap/Google satellite in QGIS and create several polygons around x number of rooftops in the area. One similar question like mine was previously asked, but the response was only explained how to do it in Arcmap, not QGIS.   Is there anyway to do it in QGIS?

I need to identify the roofs of buildings using a satellite image, something like what is available in OSM  (something like the image).  Is there anyway to do this in Qgis, R, Arcmap?


– Schematic created using   The basic data structure for the machine I want to build is a shift register. Quite some time back someone told me that if I could implement it without a master/slave architecture then I really should. So I came up with the following schematic for a shift register of four bits. I'm banking rather heavily on my ability to time each assertion of (shift) just long enough to move each bit of data from one position to the right, perhaps a little over two transistor delays, and definitely less than three transistor delays.  I may be able to get this to work for four bits, but my machine is going to need a shift register as large as four billion bits long to do what it needs to do. If I extend this schematic to four billion bits, can I realistically expect to be able to assert (shift) long enough to move each of the four billion bits just one position to the right and no further?  This article was marked as a duplicate of another article, and I was told that if I disagreed that it was a duplicate I should edit it to point out why it's not a duplicate. The original article used BJTs instead of MOSFETs. I was told that the output of M1 and M2 couldn't be amplified by M3. I changed all the BJTs to MOSFETs in an attempt to fix that, but nobody commented on the change. So I started this article out with MOSFETs instead of BJTs in order to prompt people to tell me what's wrong with my design, to tell me why it won't work as a shift register. That's the difference from the original article.

– Schematic created using   Will this work as a four-bit shift register? (And by extension a shift register of any size?) Each vertical PMOS / NMOS transistor pair acts as a multiplexer, and the PMOS transistor to its left amplifies the voltage back up to close to V_high. I'd be interested in hearing people's feedback on this. Right now I have only three transistors (and a resistor) per bit. Can I really get it that small a ratio, or are there reasons why I need more transistors per bit?  It's probably worth noting that I don't have master/slave here, so I can only assert (Shift) long enough to move one bit toward the right and no more.  Furthermore, I'm not trying to say that I need a resistor with 100 ohms. That appeared to be the only resistor I could use to make this schematic! What I want is a resistor that has significantly less resistance than the PMOS it's next to when it's at high impedance, but enough resistance to prevent a short circuit from V_high to ground when that transistor is conducting.  Okay, now I've changed each of the BJT's to MOSFET's, and reduced the resistance of each resistor from 100 ohms to 10 ohms. I'm still going on the assumption that (shift) will only be asserted long enough for the gate delays of M4 and M5, and then of M6, so the value of (dataIn) will only make it to M6's output, and won't move to M8 until the next time (shift) is asserted. Is this enough to get this circuit behaving like a four-bit shift register?


I am trying to recreate the following images but so far I have only been able to replicate the two semi-circles intersecting.              \documentclass[a4paper,12pt]{article}      \usepackage{tikz}     \usetikzlibrary{angles, calc, intersections, positioning, quotes, backgrounds}     \usepackage{pgfplots,caption}     \pgfplotsset{compat=1.9}     \begin{document}      \begin{center}             \begin{tikzpicture}                 \begin{scope}                      \clip (-3.5,0) rectangle (3.5,2);                      \draw (0,0) circle(1.1);                      \draw(1.8,0) circle(1.6);                  \end{scope}                         \draw (-2,0) -- (4,0);           \node at (-1.1, 0)[below] (1){ -6};          \node at (1.1, 0)[below] (2){  6};          \node at (0.2, 0)[below] (3){  $4\sqrt{2}$};          \node at (3.4, 0)[below] (4){  $6\sqrt{2}$};             \end{tikzpicture}         \end{center} \end{document}   So far I only have this

I am trying to recreate this image in LaTeX:    So far, I have the following:   \documentclass[a4paper,12pt]{article}  \usepackage{tikz} \begin{document}  \begin{center}     \begin{tikzpicture}      \draw (2,3) circle (1.5cm);      \draw (4.5,3) circle (1.5cm);       \draw[red] (2,3)--(4.5,3)--(3.25,3.85)--cycle;      \filldraw[red] (2, 3) circle (1pt) node[left] {$c_{1}$};         \filldraw[red] (4.5, 3) circle (1pt)node[right] {$c_{2}$};        \end{tikzpicture} \end{center}  \end{document}


I've accidentally deleted today the /var/www with 2 Joomla-Homepages on it. Is there any possibility to recover all these files? I'm using PhotoRec right know, but the recovered files are named like: f3411984.html  I have not create backups, which I should have. I there a better way to recover these files.

I have a NAS (mybook world white light) in my living room where all my music and stuff is stored. I've mounted the music folder of the nas in the local music folder of my home directory on my desktop computer.  My fstab entry looks like this:  //192.168.2.222/Public/Shared\040Music/ /home/simon/Musik/ cifs credentials=/home/simon/.smbcredentials,defaults 0 0   A few minutes ago, I moved my home directory on my local desktop computer with the help of .  At first everything looks great, but then I realised that my music folder was empty. I think I deleted everything in this step during the tutorial:  umount /home rm -rf /home/*    Because the music folder was still mounted to /home/simon/Musik :/  Is there a possibility to recover something of the data? As I realized what happened, I shut down the NAS.


I created a torrent in qbittorent and saved it on the desktop . When I deleted it some folders also got deleted . What I basically did was created torrent of desktop itself by mistake . How can I recover these folders . Please help .

What steps can I take to try to recover lost or inaccessible data from any storage device?  Answers:   This applies to any computer storage device, e.g. internal/external hard drives, USB sticks, flash memory. The most important thing is to STOP using it, any type of I/O can ruin your chances of a recovery.     We have separate questions covering common problems with USB flash drives in greater detail:


What spin is described by which rotation group? I always only find information about spin-1/2

In a QM text I am using (Sakurai 2nd edition 'Modern Quantum Mechanics'), he describes two rotation groups, namely the $\mathrm{SO}(3)$ rotation group and $\mathrm{SU}(2)$ rotation group (unitary unimodular group).   He defines $\mathrm{SO}(3)$ as a group with matrix multiplication on a set of orthogonal matrices (which are matrices which satisfy $R^TR = 1 = RR^T$), he then states that this group only includes rotational operators (and not also inverse operators which would be the group $\mathrm{O}(3)$). He does not ever rigorously define 'rotational  operation'.    How you would distinguish between rotational operators and inverse operators, would a sufficient definition be that rotational operators is a transformation with one fixed point?   He also defines the the group $\mathrm{SU}(2)$ which consists of unitary unimodular matrices, and states that the most general unitary matrix in two dimensions has four independent parameters and it is defined as $$U = e^{i \gamma}   \left( {\begin{array}{cc}    a & b \\    -b^* & a^* \\   \end{array} } \right) $$  where $|a|^2 + |b|^2 = 1,~~~\gamma^* = \gamma.$   Am I right to assume that the $\mathrm{SO}(3)$ rotation group does not have much of application in quantum mechanics but is rather used more in classical mechanics whereas $\mathrm{SU}(2)$ is used more in quantum mechanics, particularly for $s =\frac{1}{2}$ spin systems where we work in a two dimensional Hilbert space? How does it follow that there are four independent parameters for the general unitary matrix, the way I see it there are three independent parameters, namely, $a$, $b$ and $\gamma$?


I am from Iran. I am a Master's student at City university of London. Although my student visa is approved, I am still in my country because I have a physical disability called Cerebral Palsy, and I cannot travel and live alone. I applied for a visitor visa for my mother to come to the UK temporarily and make the required arrangements with a nursing company. However, her visa has been refused yesterday. Her refusal letter:    How can I arrange for my mother to be able to accompany and help me?

Many of the UK visa refusals we see here share a common pattern and the prevailing reasons refer to V 4.2 (a) and (c).    I do understand that, while the applicants may describe very different individual circumstances, there's a consistent pattern and, broadly, fall into specific categories:    Credibility (lifestyle, lack of ties, visit history, lies & omissions) Funding (insufficient funds, provenance of funds, funds parking) Sponsorship (family, friends, employer)   Question: What most commonly triggers a UK visa refusal where V 4.2 (a) and (c) are given as the grounds?  Secondarily: Given that there is a clear pattern, to what extent are these refusals predictable? Does sponsorship make a difference? Is there a set of personal circumstances, however abstract, where a refusal is all but guaranteed? For example, why do those we see here on TSE who sought entry for the PLAB or British Army appear to be refused with a common theme? Is there a uniform shortcoming or is it just discrimination?   PLAB: What is about applications for a visa, for the purpose of sitting the Professional and Linguistic Assessments Board (PLAB) exam, that seem to invite refusals. After all, the test is given so that international medical graduates can show that they qualify to practise medicine in the UK. The first part, PLAB 1, can be taken in centres outside of the UK. However, PLAB 2 can be taken only in the UK. Why can't you can't get a visa just to sit the exam, promising that you'll leave immediately after?    British Army: Since Commonwealth citizens are eligible to apply online to join, even those who don't reside in the UK, why is it so difficult to get a visa just to attend an interview to see whether you are suitable? Even with an invitation from the Army, such visa applications seem to be unsuccessful. Isn't a career in the British Army a valid reason?     Lastly:  After such a refusal, what approaches would increase the chance of a successful application?


Is it based on duration of the match, stats, who won or something else?

What in game events affect how many points I earn? Is there a cap to how many I can earn in one match? Do I get points regardless of winning or losing?


I looked at a previous question  and I am still having trouble performing the upload. I have downloaded a file to my computer and I am looking to upload this to my server.  The file name is bomb.tar.  I went with:  scp bomb.tar tim@example.com:.    I am getting an error there is no such file or directory, is there more that I would need to add on to the file name?

I am trying to upload local files to server by using Putty or SSH but not getting upload there.  Is there any direct method to upload file from local to server from Linux terminal without using FTP etc ?


When a moderator election is held on a graduated Stack Exchange site, which users get to vote for moderator candidates?  I tried to look at  and  but the threads there didn't seem to list this information.  The information wasn't easy to find on Meta SE either.  So I'm asking this question hoping that it will make this pieces of information easier to find.

The  says that there is a moderator election occurring.   How does the election work and how can I get involved?