Why can't we use entanglement to defy Heisenberg's Uncertainty Principle?

In principle, it is possible to entangle any property of two particles, including speed and momentum. Surely then, this could be used to defy the Uncertainty Principle, which states that the momentum and position of a particle cannot be together measured with accuracy, but the more accurate one gets, the less accurate the other becomes:  $$\Delta x\Delta p=\dfrac{\hbar}{2}.$$  If one was to set up an experiment where two particles are entangled, one could then measure the position of one particle with great accurary at the same time as measuring the momentum of the other particle with great accuracy, which would mean that, as the two particles are entangled, one would then know the momentum of the particle they measured the position of.  Therefore, the Uncertainty Principle would have been defied, as both momentum and position have been measured with a high accuracy.  However, this can't be true, as someone would have thought of this before.  So why wouldn't this work?


Patch request throwing INVALID_FIELD error from workbench

/services/data/v45.0/sobjects/CustomObject__C/External_Field_ID__c/455488  Request Body [{      "Custom_field_1": "1990-01-19",     "Custom_field_2": "ABC" }]  Response body [ { "message" : "Json Deserialization failed on token 'null' and has left off in the middle of parsing a row. Will go to end of row to begin parsing the next row", "errorCode" : "INVALID_FIELD" } ]


NFL overtime: after a field goal, clock runs out on second team's possession

Under the NFL's current "modified sudden death" overtime rules, if the first team scores a field goal, the second team is entitled to one more possession.  What happens if the clock runs out during that possession?  Suppose the score is tied 20-20 at the end of the 4th quarter. Team A wins the overtime coin toss and receives the kickoff to begin overtime.  After a long slow drive, Team A scores a field goal to make the score 23-20.  Now they kick off to Team B.  Team B is not able to score, and the overtime period ends with Team B still in possession.  What happens?   is not very explicit on this point.  Article 4 (a) says:     There shall be a maximum of one 15-minute period, even if the second team has not had an opportunity to possess the ball or if its initial possession has not ended. If the score is tied at the end of the period, the game shall result in a tie.   I think this means that Team A wins, 23-20, but I am not completely sure.  Has this ever happened in a regular-season NFL game?


A point $p$ in a metric space $X$ is a boundary point of the set $A$, if any neighbourhood of $p$ has points of both $A$ and $X-A$.Prove that the set of all boundary points of $A$ is closed.  My attempt: By definition of an open set this means that for every $x$ in the boundary there is an open ball centred at $x$ contained in the boundary. An open ball is a neighbourhood of $x$, which implies it contains points of $A$ and $X - A$, which in turn implies there are points in both $A$ and $X - A$ that are in the boundary of $A$.  If $A$ is open, then pick any such point in $A$ that is also in the boundary. This point cannot be in $X - A$ by definition of set subtraction. Further, because $A$ is open there exists an open ball centred around this point contained in $A$. Again, an open ball is a neighbourhood, which means a neighborhood of this point does not contain points of $X - A$, implying it cannot be in the boundary, a contradiction. If A is closed then $X - A$ is open and a symmetric argument holds. Hence the boundary is closed.  Is my work correct?


prove every connected manifold is path connected manifold .       my thought:      connected space : Let $ X$  be a topological space. A separation of $ X $ is a pair $U, V$ of disjoint    nonempty open subsets of $ X $ whose union is $X$. The space $ X $ is said to be connected    if there does not exist a separation of  $X$ .      Components: Given  $X$ , define an equivalence relation on $X$ by setting x~y if there    is a connected subspace of $X$  containing both $ x$  and $ y$ . The equivalence classes are    called the components (or the "connected components") of $ X$.       Path Component: I define another equivalence relation on the space $ X$  by defining x ~ у    if there is a path in $ X$  from $ x$  to $ y$ . The equivalence classes are called the path components of $ X$ .       Theorem  : The path components of $ X$  are path connected disjoint subspaces    of $X$  whose union is $X$ , such that each nonempty path connected subspace of $X$  intersects only one of them.       thank you so much


Confused about kurtosis and tails compared with normal distribution

In a book (SAS Essentials: A Guide to Mastering SAS for Research 2009 page 143) it says:    However, when I look at this picture (not from the book, from the web):    Or also this picture, in case the first one is maybe wrong (also from the web):    So the leptokurtic (thin) green curve has a Kurtosis which is positive, it is more peaked. Ok, clear to me. But what about the tails? When I look at the right and the left tail, the red mesokurtic curve has heavier tails? I mean there is clearly more area under the curve under the red curve than under the green curve?


How do I pick up the shrine orb in Kakariko Village?

Next to Impa there is an orange orb like you find at shrines. On one of the hills above Kakariko Village, there is a pedestal with a slot for an orb. If I try to pick up the orb, Impa tells me off.  How do I pick up the orb?


I am looking to create a cleric in e5 DnD. I was wondering if it is possible, to make a neutral good cleric, that still uses Death Domain.  My idea was, that he sheperds the souls of the dead to their corresponding plane (of death?). That would be a good deed.


Is there a difference in whether brother is explicitly possessive in sentences like this?   A friend of her brother's called  A friend of her brother called    Perhaps both are correct; do they have a subtle (or not-so-subtle) difference?


all my materials applied to my model is not being rendered out when i go in for the final render. as shown here. PS look closely its not just a black bachground the bottom picture is what is suppposed to be rendered  any help would be appreciated


If not, is it impossible for DNA to have enzymatic activity?


How can I set keyboard layout for the guest session?

First, my ultimate goal is the same as in . I am a Dvorak user, but I want QWERTY, not Dvorak, to be the default keyboard layout in a guest session. If you know a direct answer to that instead of to the question below, that will also be appreciated.    I can change the keyboard layout to QWERTY with setxkbmap -layout us.  Some googling tells me that if I create a shell script /etc/guest-session/prefs.sh, it will be run when the guest session starts.  So I created a prefs.sh file containing just that command:  setxkbmap -layout us   What I expected to happen was to be able to run a guest session and automatically have the keyboard layout set to QWERTY. What actually happened was that when I tried running a guest session, it simply failed and brought me back to the login screen.  I must be misunderstanding something, but I don't know what. Any ideas?  If relevant: I'm using Ubuntu 12.04.


Something strange about $\sqrt{ 4+ \sqrt{ 4 + \sqrt{ 4-x}}}=x$ and its friends

can be generalized to,  $$\begin{align} \sqrt{ 2+ \sqrt{ 2 + \sqrt{ 2-x}}}=x&,\quad\quad x = -2\cos\left(\frac{8\pi}{9}\right)=1.8793\dots\quad\quad\quad \\ \\ \sqrt{ 4+ \sqrt{ 4 + \sqrt{ 4-x}}}=x&,\quad\quad x = 2\sum_{n=1}^3\cos\left(\frac{2\pi\, s_1(n)}{19}\right)=2.5070\dots\quad\\ \\ \sqrt{ 8+ \sqrt{ 8 + \sqrt{ 8-x}}}=x&,\quad\quad x = -1-2\sum_{n=1}^6\cos\left(\frac{2\pi\, s_2(n)}{37}\right)=3.3447\dots\\ \\ \sqrt{ 14+ \sqrt{ 14 + \sqrt{14-x}}}=x&,\quad\quad x =\, \color{red}? \pm 2\sum_{n=1}^{\color{red}{7\,?}}\cos\left(\frac{2\pi\, s_3(n)}{\color{red}{63\,?}}\right)=\dots\quad\quad\quad\quad\\ \\ \sqrt{ 22+ \sqrt{ 22 + \sqrt{22-x}}}=x&,\quad\quad x = -1+2\sum_{n=1}^{16}\cos\left(\frac{2\pi\, s_4(n)}{97}\right)=5.2065\dots\\ \\ \sqrt{ 32+ \sqrt{ 32 + \sqrt{ 32-x}}}=x&,\quad\quad x = -2-2\sum_{n=1}^{23}\cos\left(\frac{2\pi\, s_5(n)}{139}\right)=6.1716\dots \end{align}$$  and so on, where the sequences $s_k(n)$ are,  $$\begin{aligned} s_1(n) &= 2, 3, 5.\\ s_2(n) &= 2, 9, 12, 15, 16, 17.\\ s_3(n) &=\, \color{red}?\\ s_4(n) &= 4, 6, 9, 10, 11, 14, 15, 17, 21, 23, 25, 26, 32, 35, 39, 48. \end{aligned}$$  etc. Note that by repeated squaring, we get,  $$((x^2 - a)^2 - a)^2 - a + x = 0$$  which has two cubic factors when $a=k^2+k+2$, with the $x_i$ above as sums of $\cos(z)$, and a root of the same cubic family,  $$x^3 + k x^2 - (k^2 + 2k + 3)x - ((k + 1)^3 - k^2)=0$$  This has a negative discriminant, $D  =-(4k^2+6k+9)^2$, implying all roots are real.  $$\begin{array}{|c|c|c|} k&a&\sqrt{D}\\ 0&2&9\,i\\ 1&4&19\,i\\ 2&8&37\,i\\ 3&14&\color{red}{63}\,i\\ 4&22&97\,i\\ 5&32&139\,i\\ \end{array}$$  Questions:   Can anybody find the sequence $s_3(n)$? (I used Mathematica's PowerMod, but it only works for primes.) Why do the others have a constant (namely $-1,-1,-2$) added to the sum of cosines? Can we predict its value, or can it be found only by trial and error?


Send current location in Messages app running iOS 12

In older versions of iOS, the Messages app had an i character in a circle which allowed us to send our current location to the other person. The location could be one-time snapshot of location, or a location updateable for a certain amount of time.   The i-in-circle is gone in current iOS.   Can I send current location in Messages?


Javascript, event handler cannot be named click

Today I was implementing a click listerener and stumbled on the following:    function click (val) {   console.log(val) }   function random (val) {   console.log(val) }  div:hover { background-color: blue; cursor: pointer; }
test1

test2
     The method for handling events cannot be named 'click'. Click is not a reserved keyword like for, if or while so why can't I use it? Are there any other function names which I cannot use?


Why mean in Gaussian Process is not so important?

Source of my doubt is the section 2.7 of , an screenshot of the book is attached below. Much of my confusion is clarified by .   If mean of GP is not estimated and it is taken as zero or any constant, then outside the range of the observations the estimate would converge to 0/constant. But suppose if I am interested in prediction within the domain of training data.  What would happen if I vary the mean of GP? Would the parameters of covariance function tune themselves accordingly?


How to use the different equality operator

For example if I do  if ("11" == 11) this will give true because the string will be converted to number so it will be like testing if (11 == 11) and that is true  It I instead use if ("11" === 11) this will give false because no conversion is made.  I can understand this but now to my question.  So because of my test previously it seems like we should always use === to prevent any automatic conversion when testing for equality.  So what guideline exist when to use == for equality and when to use === for equality.


Making Excel functions affect 'other' cells

Let's say that I create a Sub (not a function) whose mission in life is to take the active cell (i.e. Selection) and set an adjacent cell to some value.  This works fine.  When you try to convert that Sub to a Function and try to evaluate it from from spreadsheet (i.e. setting it's formula to "=MyFunction()")  Excel will bark at the fact that you are trying to affect the value of the non-active cell, and simply force the function to return #VALUE without touching the adjacent cell.  Is it possible to turn off this protective behavior?  If not, what's a good way to get around it?  I am looking for something a competent developer could accomplish over a 1-2 week period, if possible.  Regards, Alan.  Note: I am using 2002, so I would favor a solution that would work for that version.  Having that said, if future versions make this significantly easier, I'd like to know about it too.


How can I get the windows console window to span multiple monitors?

Is there a way to make the windows commandline span multiple monitors?   I'm trying to view a console application that I've written, but it's output is too large for the default window size, I've tried decreasing the fonts and increasing buffers and layouts, and also tried console2, but no matter what I do, I can't seem to get the console as large as I'd like.  I'm streaming video to the console in the form of numbers, so I can't have it wrapping the text.  I'm using windows 10


Prove the following alternative group definition.

Motivation: If operation is change, and there is no change, then there is no operation. Then the meaning of  1+0 =1 is not in the equality itself but in the comparison with other equalities as  1+2=3. The following definition does not use the meaningless equality  1+0 =1, or generally a*e=a. I guess that trying to prove statements using the next definition, matters/problems will arise that do not arise with the standard definition. Let be the non empty set G = {a,b,c,d,.....z} with the operation *, satisfy the following 3 conditions:  a(bc) = (ab)c, for every a, b, c ∈ G (associative law). For every a,b there is c (unique) such that ac = b. (c  is the "path" from a to b). For every a,b there is d (unique) such that bd = a. (d is the "path" back from b to a).  P.S.: the meaning of 2) and 3) is the possibility to "go"/"move" from any member to any member, through the same path (if a->b->c then c->b->a as in the Klein group) or through other path (if a->b->c then c->X->a). Prove: G,*  is a group. Proof: Associativity: From 1) Identity element: Let's prove for every a there is e such that ae=ea=a. Proof: According to 2) For every a,a there is e such that ae = a. (3) According to 2) for every e,a there is x such that ex=a, that means ae =ex =a (4) Let's proof x=a. Multiply by a on the left, such that the result is some g ∈ G: ae = ex = a (4) <---> (a)ae = (a)ex = aa =g <---> aae = (ae)x = aa =g (associative) <---> <---> aae = ax = aa =g (3). (5) According to 2) for every a,g there is x (unique) such that aa=g and ax=g , then a and x are the same, and it's proved x=a. Then replacing in (5): ae = ea = a. Inverse element: Let's prove that for every a, there is b such that a ⋅ b = e and b ⋅ a = e According to 2) for every a,e there is b such that ab = e. (6) According to 2) for every b,e there is X such that bX=e. (7) Let's proof that X=a ab = bX = e (6),(7) Multiply be a on the right: aba =ea a(ba) = ea; Associativity ea = a; Identity element a(ba) = a; then ba = e bX=e according to (7) ba = bX = e; according to 2) for every b,e there is x unique such that bX = e then x=a and it's proved that for every a, there is b such that a ⋅ b = e and b ⋅ a = e.


Spring Integration - ErrorMessageExceptionTypeRouter NullPointerException - how to fix it?

I made a simple test and it dosen't work.  @RunWith(SpringRunner.class) @SpringBootTest @ContextConfiguration(classes = {SIConfiguration.class, ExceptionTypeRouter.class}) public class ExceptionTypeRouterTest {      @Autowired     @Qualifier("inDefaultChannel")     private DirectChannel in;      @Test     public void fistRouteTest() {          in.send(new GenericMessage<>("ready!"));      } }   @Configuration @Slf4j public class ExceptionTypeRouter {      @Bean     @Qualifier("inDefaultChannel")     public DirectChannel inDefaultChannel() {         return MessageChannels                 .direct()                 .get();     }      @Bean     @Qualifier("directErrorChannel")     public DirectChannel directErrorChannel() {         return MessageChannels                 .direct()                 .get();     }      @Bean     public ErrorMessageExceptionTypeRouter errorMessageExceptionTypeRouter() {         ErrorMessageExceptionTypeRouter router = new ErrorMessageExceptionTypeRouter();         router.setChannelMapping(IOException.class.getName(), "directErrorChannel");         router.setChannelMapping(NullPointerException.class.getName(), "directErrorChannel");         router.setDefaultOutputChannel(outDefaultChannel());          return router;     } }       The proplem is somwhere here. Caze this.getApplicationContext() is null.   private Class<?> resolveClassFromName(String className) {         try {             return ClassUtils.forName(className, this.getApplicationContext().getClassLoader());         } catch (ClassNotFoundException var3) {             throw new IllegalStateException("Cannot load class for channel mapping.", var3);         }     }   Error log:     org.springframework.beans.factory.BeanCreationException: Error creating bean with name 'errorMessageExceptionTypeRouter'   defined in integration.exceptiondemo.configuration.router.ExceptionTypeRouter: Bean instantiation via factory method     failed; nested exception is org.springframework.beans.BeanInstantiationException: Failed to instantiate [org.springframework.   integration.router.ErrorMessageExceptionTypeRouter]: Factory method 'errorMessageExceptionTypeRouter' threw exception; nested     exception is java.lang.NullPointerException


Can CSS choose a different default font and size depending on Language

I have the following CSS fragment:  INPUT{ font-family: Raavi; font-size: 14px;}   Which works fine when the textbox contains some Punjabi script like this: ਪੰਜਾਬੀ  But the user might enter English instead, and I would rather use the Verdana font with a different size, since the English letters in the Raavi font are real funky and the size is wrong.  So my question could be stated as:   Is there any type of conditional font-family and size selection within CSS based on the input Is there anyway for CSS to know about the input language?   So I could create the following PSEUDO_CSS:  INPUT{ EN-font-family: Verdana; EN-font-size: 12px; PA-font-family; Raavi; EN-font-size: 14px;}   or  INPUT.EN{ font-family: Verdana; font-size: 12px;} INPUT.PA{ font-family: Raavi; font-size: 14px;}


Definite integral $\int_{\frac{1}{a}}^a \frac{\arctan(x)}{x}$

I have to fund the value of the above integral $$\int_{\frac{1}{a}}^a \frac{\arctan(x)}{x}$$ for $a=2014$.   I just saw that integral of $\frac{\arctan(x)}{x}$ does not have a closed form. So I used the substitution $x=tan(\theta)$ and then used integration by parts but did not get a result.


Could you please explain clustering in SQL server?

I'm new to clustering concepts. I would like to know more parallel processing with multiple DB nodes to have load balancing for the incoming requests. Our main goal is to achieve performance and lot of queries held in queue that come from for BI applications.   Is there any built in mechanism in SQL server to redirect requests to secondary node? We have huge volume of queries that runs on specific day and we need to distribute to secondary node.  We have SQL server 2012 in place and one database server up and running.


What's the total size of all games I have on Steam?

I have a lot of games on Steam, far more than my puny hard drive can hold at once. However, in the future I may want to store all of them locally.   Is there any way to figure out about how much hard drive space I'll need to install all of my Steam games, including the ones that I don't currently have installed, without sitting down with a calculator and manually adding everything up?


How can I lock an application (and all its new windows) into a specific workspace?

I run a Matlab script in the workspace 1. This generates several plots. In the mean time I switch to workspace 2 and working there. My problem is that the plots are popping up in workspace 2. Is it possible to lock on software into a workspace. So while Matlab generates the plots in workspace 1, I can work in workspace 2 without the disruption of the poping up plots?


For repeated, linear factors, (the term $(x-r)^m$ appears in the denominators for some integer $r$ and $m$, where $m > 1$) there is a partial fraction for each power upto and including $m$. Why?  Why can't you just have one partial fraction for the term with the $m^{th}$ power? Could someone give me an explanation about why you need a partial fraction for each power?


How to know about the methods present inside a python module?

I am new to python, i have a confusion about when we import a module, e.g. import os or any other module, how to know the available methods in each of the module i have imported? Please help.


How to determine the number of factors in principle component analysis (PCA) when scree plot is ambiguous?

I've been running PCA using SPSS and here are the things I have done so far:  N = 105. The number isn’t exactly ideal for PCA and accordingly to majority of the studies, but I did find a few sources which claim that at least 100 is okay. All 38 items of both EQ and QCAE questionnaires were chosen (these two scales measure empathy) The Kaiser-Meyer-Olkin measure of sampling adequacy indicated a value of 0.73, which was above the recommended value of 0.5. Bartlett’s test of sphericity was significant (suitable for data reduction). To identify problematic variables, KMO statistics for individual variables were examined from the anti-image matrix. All of the variables had correlation above 0.5 and thus no problematic variables were found. Average communalities had a value of 0.65, which was adequate for a sample size between 100 and 200 (MacCallum et al., 1999). To choose an appropriate number of factors to extract, I used Kaiser’s eigenvalue criterion (>1) and thus retained 10 factors. Ten factors in combination explained 65% of the variance, which is ok good I used varimax rotation method to extract component matrix  Here are my problems: #Problem 1: Upon the inspection of scree plot, points of reflects were observed at both 2 and 3 factors. It was not really aligned with the convergence of Kaiser’s criterion, but the rule itself has received a lot of criticisms of course. What do I do? (See the image)  #Problem 2: After an examination of the matrix, I started to think that the I should have just retained 2 factors, but the two-factor component would only explain 29.53% of the total variance, which is quite low. However, you can already see that cognitive empathy (online simulation, perspective taking) had a large representation in the factor loading, while mixing with a few EQ items. I have to think of something to explain this qualitatively of course.. Based on these problems, how can I determine the correct numbers of factors in my PCA?


Should gaps be left between sheets of drywall for any reason?

My cousin says I should leave 1/4" space between all edges of drywall so that mud can be pressed into it. Everything I've read online say to butt them tight. When is leaving a gap a good idea?


In a sequence of positive terms, $\lim \frac{a_{n+1}}{a_n} = L \Rightarrow \lim (a_n)^{\frac{1}{n}} = L$.

Here's the question:     Let $(a_n)$ be a sequence of positive reals. Assume that $\lim \frac{a_{n+1}}{a_n} = L$. Then show that $\lim (a_n)^{\frac{1}{n}} = L$.   I tried everything including using the definition of convergence to prove it but nothing seems to work. There's no hint in the textbook as well. I'd appreciate if someone drops me some hint. I have been stuck in this problem for almost an hour!


Find the sampling distribution of the MLE of the uniform distribution

The MLE is $ \theta = max [x1,...,xn] $ And $ P(max [Xi] < t) = P(Xi < t)^n = P(t/\theta) $  But the question asks me to show that $ P(max[Xi]< t) = (min[\theta, t]/ \theta)^n * I[t>0] $  Where I is the indicator function. How do I show this please?


If $f: D(0,1)\to \mathbb C$ is holomorphic, then there is a sequence $\{z_n\}$ in $D(0,1)$ such that $|z_n| \to 1$ and $\{f(z_n)\}$ is bounded

Let $f: D(0,1)\to \mathbb C$ be a holomorphic function. How to show that there exists a sequence $\{z_n\}$ in $D(0,1)$ such that $|z_n| \to 1$ and $\exists M>0$ such that $|f(z_n)|<M,\forall n \ge 1$ ?   My try: If not, then $\lim_{|z|\to 1} |f(z)|=\infty$. So in particular, $f$ has finitely many zeroes in $D(0,1)$. Also, $1/f$ is meromorphic in $D(0,1)$ with $\lim _{|z|\to 1}\dfrac {1}{|f(z)|}=0$. I am not sure where to go from here. Please help.


Development of the Idea of the Determinant

While I basically understand what a determinant is, I wonder how this idea was developed?  What was the principal idea behind its origination?  I would like to know this so that I can have a better conceptualization of the determinant.


C++ linker error when access to static member in nested class

GCC 4.8 can't compile following code:  struct A {   struct Impl;   void f(); };  struct A::Impl {   static int stat; };  void A::f(){   A::Impl::stat=1; }  int main(int argc, char** argv) { return 0; }   and raise error:     cppbug.cpp:(.text+0xa): undefined reference to `A::Impl::stat'   collect2: error: ld returned 1 exit status   but similar inline declaraton compiled as well:  struct A {   struct Impl {     static int stat;   };    void f(){     A::Impl::stat=1;   } };  int main(int argc, char** argv) { return 0; }


EDIT:  It is known that  $$ \sum_{k=0}^{\infty} x^k = \frac{1}{1-x} $$  Therefore, is it also possible to simplify  $$\sum_{k=0}^{\infty} x^ky^{\frac{k(k+1)}{2}}$$ into something similar to the infinite geometric series sum?


Can I install Ubuntu using Ubuntu 13.04 Live CD on Ubuntu 12.10?

And, will may my applications be as is? Am I going to have any compatibilty issues with applications? Is it possible even using a live cd to install the newest version of Ubuntu over the existing one.


Are you able to beat Exodia?  I think you must destroy one of the pieces to him or you can't. Is this true?


Raspberry Pi 3 ubuntu mate Failed to start load kernel modules

I have installed Ubuntu MATE on Raspberry Pi3 and it works, but on startup I see this message  Failed to start load kernel modules   Any idea on how to fix it?  I did already apt-get update && sudo-apt get upgrade and dist-upgrade  I also tried to follow .


Showing that a function has the intermediate value property

Here's the question:     Let $f(x)=\sin \left( \frac{1}{x} \right)$ for $x\ne 0$ and let   $f(0)=0$. Show that $f$ is discontinuous on $\mathbb{R}$ and still has   the intermediate value property on $\mathbb{R}$.   It's easy to show that $f$ is discontinuous at $x=0$. Now, I go on to prove that $f$ has the intermediate value property. Let $a,b \in \mathbb{R}$ with $a<b$. Assume that $y$ be some real such that $f(a) < y < f(b)$. If $y=0$ we are done for $f(0)=y$. If $y\ne 0$, I was hoping to use the continuity of sine on $\mathbb{R}$ but nothing seems work out.  Hints would be appreciated. I do not need full solution.


Is there any way to recover a Pokemon lost in a Pokemon Go app crash?

I finally found a Squirtle and caught it, but then the app froze and I lost it.  However, my Pokedex still shows a picture of a Squirtle, but I don't actually have it. This isn't the first time this has happened to me, is there anything I can do to recover the Pokemon that this happened to? Any way I can fix this? Just an annoying bug?


Trying to organize files by extension using a script (grep, for, foreach, find), but I'm overwhelmed. Looking for advice

I want to iterate through all files in the Source directory and stick them into the Dest directory.  Example list of files:  /source/folder/text.txt /source/folder/document.pdf /source/folder/that/is/deeper/picture.jpg /source/folder/picture2.JPG   After the script is run, I'd like the dest folder to look like:  /dest/folder/txt/text.txt /dest/folder/pdf/document.pdf /dest/folder/jpg/picture1.jpg /dest/folder/jpg/picture2.JPG   I've learned I can chain -exec commands on the back of find, but I don't think that's what I want.  grep might be useful, but since it's a one-liner, I think writing it will be complex.  A forloop seems to be the best way, but I cannot for the life of me figure out how to extract the file name.  SOURCE=/my/source/dir/  for f in $SOURCE do   echo $f done   $f appears to be only the directory and does not list the actual file name.


ScholarOne Manuscripts status is 'Awaiting Referee selection' for nearly 3 months

I submitted an article to a journal using ScholarOne manuscripts on 20th February. it is now nearly 3 months and it hasn't got beyond 'awaiting referee selection'. I have emailed to ask, politely, if it will be sent to reviewers and if I can help by suggesting reviewers' names. I have received no reply.  Do people think this is normal / reasonable?  What, if anything, should I do next? Thanks.


VirtualBox - How to solve "VT-x not available" when VT-x is turned on in BIOS?

I have a VirtualBox that was working before I installed Docker for windows.  Now when I try to open a VM (64bit) that was working I get the follow error:  VT-x is not available (VERR_VMX_NO_VMX).   Result Code:  E_FAIL (0x80004005) Component:  ConsoleWrap Interface:  IConsole {872da645-4a9b-1727-bee2-5585105b9eed}   Now when I try to create a new VM I can only do it for 32bit, not 64bit any more. And if I try to create a 32bit I get a blue screen from windows.  Inside the bios I have Virtualization and VT-x enabled.  My OS is Windows 10, 64bit  How to solve this issue?


Operations research - summation notation

Outline: Hermione has been thinking about the imminent return of the Dark Lord, so she has been busy packing her bag with all the items required for her survival. Because she has so many different items, it is impossible to list them all here; however she knows that she can formulate the problem even without knowing those (trivial) details. She has $N$ items indexed from $1$ to $N$; each item $x_i$ is associated with a value $c_i$, weight $w_i$ and volume $v_i$. She cannot carry more than $W$ in weight, and the bag can only hold up to $V$ in volume. Items must either be in the backpack or not; i.e. we cannot put half a book in the bag! She needs to maximize the value of the items that she is carrying, because she knows she will not be able to replenish these for a very long time.  How would I formulate this problem using summation notation?


sorry for duplicate.  I wrote this code  <!DOCTYPE html>    <html> <head> <meta charset="utf-8" /> <title></title> </head> <body> <script src="http://code.jquery.com/jquery-1.6.3.min.js"></script> <script src="jquery.cookie.js"></script> <script> //set cookie $.cookie('score', 'test');  </script>  </body> </html>   And ran it in chrome. Went to resources => cookies, and it says the site doesn't have cookies. Am I doing something wrong? (jquery.cookie.js is in the same directory as my .html file which I'm running)


If $x_{m+n} \le x_n+x_m$, then $\lim x_n/n$ exists and is equal to $\inf x_n/n$

Let $(x_n)_{n \ge 1}$ be a sequence of real numbers satisfying  $$x_{m+n} \le x_n+x_m$$  $m,n \ge 1$. Show that $\lim \limits_{n \to \infty} \dfrac{x_n}{n}$ exists and is equal to $\inf  \left \{\dfrac{x_n}{n}; n\ge 1 \right \}$.


It's very simple. I don't know how to interpret these symbols (highlighted in image below) in the context of this example. So, can someone tell me how to read them?


I need an elegant solution to store my dotfiles on GitHub for easy access. I tried to create a dotfiles directory and symlink all the dotfiles into there. Then I tried adding the symlinks to git and committing in that directory, but git saves the links not the contents of the files it points to. Is there a way to do this or something similar?


Linking search box to dataset column in Carto?

The search box in a published map of CartoDB isn't linked to the dataset which is shown in the CartoDB map. How can I link the search box to a certain column of a dataset?


I'm a masters degree student trying to figure out how publications and co-authorship work.  I know that the school/PI retains legal ownership of any monetary profits that may result from the work, so please don't mention this in your response as it is irrelevant to what I'm asking.  I WANT TO BE PUBLISHED AND DO NOT CARE ABOUT MONEY.  I just want to ensure that I get academic credit/recognition this time since some of my work was previously passed off as another student's work in a different lab.  I'm concerned because the new PI and another professor working on the project seem to want me to do all the grunt work/data collection, but according to the previous student that worked on the project, they prefer to keep the analysis to themselves even though I'm willing [to try] to learn how to do this myself...  What protections do student have against others taking credit for their work, not giving them even partial credit/co-author status, and/or allowing another student to take credit who didn't help?  Should I mail copies of my data to myself and retain a sealed copy?  How do/did (when you were a grad student) you guys protect yourselves?  Please list some measures/methods you use to prove that work you did was done by you as opposed to someone else in the lab.  As things stand now, it seems like my PI, in theory, could hand over my work to another student who he likes more, who's viewed as younger/more promising, or who has a rich/important Daddy.  Not saying he'd do this, but hey, its happened to me before, so yeah - just looking for some solid concrete measures I can implement to protect myself.  I don't feel comfortable discusses this with my PI for reasons that should be obvious to anyone with a modicum of common sense, so please don't refer me to my PI.  If you can't/don't want to help, fine, but please don't down vote me as somebody else may have some insight that would help me.  Thanks.


Does a Vietnamese citizen need a transit visa for South Korea?

I am a Vietnamese passport holder. I'm going back to Viet Nam from Montreal this December, and I will transit at Incheon Airport for a few hours. Do I need a Korean visa just for transiting, either from Montreal to Hanoi or from Hanoi back to Montreal?


I restored my iPhone from back up as I accidentally deleted some messages that I needed. But, I have lost all my photos as they were not selected to be included in back up and iPhone photo library wasn’t enabled. Is there any way I can get them back? I haven’t synced to iTunes for a long while.


cli or command that convert the CSV file to XLS

I am searching for tool or CLI that can be download and by this tool , we can use it to convert CSV file to XLS  any idea from were to get it?


Proving $f$ is Lipschitz given $f_{n}\rightarrow f$ and $f_{n}$ is uniformly Lipschitz

Given $f_{n} : [a,b]\rightarrow \mathbb R$ is uniformly Lipschitz and $f_{n}\rightarrow f$, how can I show that $f$ is Lipschitz?  $f_{n}$ is uniformly Lipschitz $\leftrightarrow \exists K > 0$ such that for all $n$ and for every $x,y\in [a,b]$ we have $|f_{n}(x)-f_{n}(y)| < K|x-y|$.  $f_{n}\rightarrow f \leftrightarrow \forall~\epsilon>0~~\exists~N$ such that $\forall~n>N$ we have $\mid f_{n}(x) - f(x)\mid<\epsilon~~~(=\mid x-y\mid?)$  Then we have  \begin{align} |f(x)-f(y)| &\leq |f(x)- f_{n}(x)| + |f_{n}(y)-f(y)| + |f_{n}(x)-f_{n}(y)| \\ &\leq |x-y| + |x-y| + K|x-y| \\ &\leq (K + 2) |x - y| \end{align}  which shows that $f$ is Lipschitz. Can anybody tell me if this makes sense? Sorry if layout is poor.


Find all primes such that $x^{2} = -1$ has no solution in $\mathbb{F}_p$

Find all the prime numbers such that $x^{2} = -1$ doesn't have a solution in $\mathbb{F}_p = \mathbb{Z}/p \mathbb{Z}$. I am not sure how to start this problem, but I have in intuition of the familie of prime numbers. My intuition is that $p = 3\mod 4$. If anyone as suggestions to give me, I would appreciate it.


RSA Encryption - What property of RSA keys is causing the output after 5x RSA to be the same as the input?

For example, R (R (R (R (R (m))))) = m where R(m) denotes the RSA encryption with public keys N and e.  What property of the RSA keys would cause this?


public int retrieveID()     {         int lastEntry = 0;         try         {             queryString = "Select ID  from Database";             myComm = new OleDbCommand(queryString, myConn);          }         catch (Exception ex)         {             MessageBox.Show(ex.Message);         }         return lastEntry;     }   I want to retrieve the last primary key used in access database, whereas i set my primary key as autonumber.  elaborating more..  I am working on a database application and want to utilize the primary key, eg if the last entry in the database was 10, i want to retrieve 10, i tried simple query but that didnot work.


Is there any way to set the display scaling back to default other than from the display settings dialog?

I scaled the UI from the display menu. Now it is way too big and I can't get to the slider to reset it.  Any ideas how I can change the scaling in Unity back to default without accessing the settings menu??  I tried   dconf reset -f /org/unity    with no luck.


How do I remove the driver installed from nvidia.com?

I have updated my graphics card with  NVIDIA-Linux-x86_64-295.20 driver and since then the screen turns white with black vertical lines at startup, shootoff and reboot.  Since then I have tryed to change it with the drivers at "Alternative Drivers" and none of them works right, the  same bug happens.  What can I do to solve this issue.  Thank you


Why after including lags do seasonal dummies become significant?

I am trying to model data that clearly looks like it has seasons. However I only pick up seasonality in very small subsets of the data and only after I add in lagged variables and eliminate trend.   I first found the trend the data is best approximated by, then determined the relevant seasonal dummies (which is none), and then looked at the correlogram of my new model to determine the AR process.  Once I added in my lagged variables my trend was rendered statistically insignificant, so I took the trend out. Additionally, I thought it was weird I got no seasonality. So just on a whim I decided to to input my seasonal dummy variable after I added in my lags. And season 4 was then highly significant!  I then played around with adding in different seasons and found the model with the lowest SIC(Schwarz Information Criterion, as listed in the output below) of all the models I constructed has two lags and one seasonal dummy.     The most important question is about the role of lags in my model. Why would controlling for serial correlation first allow me to see seasonality? Does the order of controlling for certain dynamics matter? Can I control for cycles, then seasons, then trend? Or should I control these dynamics in a specific sequence?


Finding the radius of curvature of mercury surface in a rotating cylinder

Let us imagine some amount of mercury $\left(\text{Hg}\right)$ contained in a cylinder. It is being rotated about the central axis at a constant angular velocity $ω$, and the system has moment of inertia $I$.  I want to find an expression for its radius of curvature. Let us place the cross section of the system on the $\left(x,\,y\right)$-plane such that the $y$-axis passes through the center of the surface and the $x$-axis tangents the surface in the following way:$\hspace{200px}$.  Now, if we can express this curvature as $y=f\left(x\right)$, then we can say that$$ r=\left| \frac{\left[1+\left(f^{'}\left(x\right)\right)^2 \right]^{3/2}}{f^{''}\left(x\right)} \right| \,.$$   Now, if we can find $f\left(x\right)$ in terms of the $I$ and/or $ω$ and any physical quantity like acceleration due to gravity, we would replace it in the previous equation and find $r$.   Please help me to proceed.  EDIT:  I read the page tagged. My Question is how did the get $y= \dfrac{(x^2 \cdot \omega^2)}{2g}$?


How much time should someone take to respond to a PhD admission offer?

I have received an admission offer for a PhD at a prestigious US university. However I am also currently working in another lab outside the US with a potential to also receive PhD admission there.  I think the deadline to respond to the US school is April 15 but the professor asked me politely to give an answer within a reasonable amount of time, also my former supervisor (which has no interest in the matter) suggest not to string along the US school and try to make a decision well before the deadline.  I feel it might be unethical to wait the last minute because I respect the professor and he might lose good potential candidates. On the other hand I want to wait and see if there is a concrete possibility of pursuing a PhD at this other place.


How to execute a JavaScript function when I have its name as a string

I have the name of a function in JavaScript as a string. How do I convert that into a function pointer so I can call it later?  Depending on the circumstances, I may need to pass various arguments into the method too.  Some of the functions may take the form of namespace.namespace.function(args[...]).


$(\Bbb Z\oplus \Bbb Z)[X] \not\cong \Bbb Z[X]\oplus \Bbb Z[X]\,$?

Well i tried to prove it but failed. They are both commutative and have the same set of units. So i can't see a property of one ring which the other ring does not possess. Thank you for any help.


Working with physically large (150''+) canvas sizes

I was given Illustrator templates for a trade show booth. Dimensions are roughly 150inches - 250inches and must be 150DPI. Whenever I try to import images, such as a logo or background, Illustrator bogs down and inevitably returns with a memory error. Not to mention that IA can barely process anything beforehand.  I need recommendations on working on large scale IA files properly.    Edit:  Using Macbook Pro with 8gigs of ram and Adobe CC


I want permanent storage that will be added to about every week. The old stuff needs to be kept secure and new stuff needs to be added every week. I am presently using DVD. This seems reasonably good. I have some older discs and most data seems retreivable. However, the last few files on every discs no longer seem accessible on most of my DVD readers. However, an old 10 years old DVD reader can still read those files, so it might be a case of the original DVD writer writing a little bit more data than the new DVD readers can read. Is my assumption that DVD writers write/read different amounts of data correct? In 2020 I am reading articles saying:  SSD drives can only be written to a certain number of times and then become unusable. I cannot find how permanent the data is once written. Does anyone know how long, once written, the data will last?  HDD only last about 3-5 years, so this seems a bad way of storing data long term. Is that correct? Is that due to the moving parts?  The DVD presently seems the most sturdy, but is obviously limited to about 4GB per disc. The data is on a disc which is disconnected from the reader with the moving parts than can be replaced. Would Blu Ray be a better/similar option. I think that is about 25GB per disc for a comparible price?  I am presently saving on DVD+R, but can only find BluRay-R. What is the difference? I was always told to buy +R DVDs as they were better, but I never knew why. Can someone explain?  Does anyone know any other, better long term storage device? What is everyone's personal choice they use? It has to be added to every week, but the old data needs to be kept secure.   PS. I do not want to use the cloud.


There are some cases of int to float casting, I found the original value changes.  For example:  int x = 49941310; float y = (float) (x); int z = (int) (y);  printf("%d, %f, %d",x,y,z);     Expecting: 49941310, 49941310.0000, 49941310... Actual:    49941310, 49941312.0000, 49941312...   In case of 18595769 I get 18595768.  I also tried static_cast in c++, same things happened. I know 23 bits to store the mantissa and 9 to store the sign and exponent. My question is, If I want original value back what should I do?


$(z_{2n})_{n\in \mathbb{N}}$ and $(z_{2n+1})_{n\in \mathbb{N}}$ converges to same limit. Show $(z_n)_{n\in \mathbb{N}}$ converges to the same limit.

$(z_n)_{n\in \mathbb{N}}$ is a complex valued sequence such that subsequences $(z_{2n})_{n\in \mathbb{N}}$ and $(z_{2n+1})_{n\in \mathbb{N}}$ converges to same limit.  How could I show that the sequence $(z_n)_{n\in \mathbb{N}}$ converges to the same limit using $\epsilon$, $N$ definition?    For every $\epsilon >0$,  $|z_{2n}-l|<\epsilon$ whenever $n>N_1$, and   $|z_{2n+1}-l|<\epsilon$ whenever $n>N_2$.  We want to show that for every $\epsilon >0$, there exists $N$ such that $|z_{n}-l|<\epsilon$ whenever $n>N$. I tried something like  $|z_{n}-l|\le|z_n-z_{2n}|+|z_{2n}-l|$ but wasn't sure what to do next


Does the Challenge Rating of a monster assume a party or a single PC?

I'm reading through the new DM D&D Basic Rules, but I'm confused about the challenge rating of a monster.  Does the challenge rating assume a single PC or a group of PC's? As a CR3 a challenge for 1 PC (like with 4th Edition), or for a group of PC's? If so, for how large a group? How should a DM choose monster with more or less PC's?


Convert JavaScript dotted string in an object

Given a JS string: var s = "deep.deeper.deepest", how can I convert this into object like this: deep: {deeper: {deepest: {}}}


Thanos is not the only one to wield 2 infinity stones

In the very first few minutes Ebony Maw presents Thanos with the space stone and says to him that no one has ever had the power and honor to wield 2 infinity stones at the same time.  Is this a mistake? In the first Avengers movie, Loki DID. He received the scepter that contained the mind stone (which we only discovered during "Age of Ultron") from Thanos himself, in the hopes that Loki would bring back the space stone from earth. Loki wielded both stones for the entire movie.  The question is, am I missing something? Is Ebony Maw wrong? Hard to imagine that being the case, since Thanos was deeply involved in Loki's actions in the first Avengers movie. Is this an oversight by the writers? Has there been any explanation for this?


Can I undo a `sudo chown -R /` on Mojave?

I ran a command that ended up executing as  sudo chown -R /   Can I revert / to default permissions?


$f$ entire, $g(x, y) := |f(x+iy)|$ integrable on $\mathbb{R}^{2}$ $\implies$ $f \equiv 0$.

Let $f \in H(\mathbb{C})$ and $g(x, y) := |f(x+iy)|$, and assume $g$ is integrable on $\mathbb{R}^{2}$. Show then that $f \equiv 0$.  Things I Know: $f$ is bounded on each $D(0, R)$ for $R > 0$, but the bounds must increase as $R \rightarrow \infty$. Intuitively, this should mean $\int_{\partial D(0, R)} |f(z)| dz \rightarrow \infty$ as $R \rightarrow \infty$ (assuming $f \not\equiv 0$), which could say something about $g$. But here I'm talking about upper bounds, which don't help. I could consider the infimum $f$ takes on $\partial D(0, r)$ to bound below, but these inf's don't necessarily grow larger as $R$ does.   My intuition tells me Liouville will come into play, but I'm not sure... Any ideas? Thank you!  Edit: Though this is the same as  essentially, I want to include proofs that use any complex analytic tools, while the linked question wants a solution based only in elementary calculus.


Why was the Sorcerer's Stone so poorly protected?

I understand that there is a similar question about this, but I would like to phrase this in a different way.  In Harry Potter and the Sorcerer's Stone there is a series of tests that someone attempting to get to the stone must pass. There is the locked door, Fluffy, Devil's Snare, the key room, the chess room, and the potion room. However, most of these tests could have been much better implemented.  For example, why a giant game of chess? It is made clear that if they didn't play the game, the stone statues wouldn't let them cross, but this is not very efficient. Lord Voldemort is a very smart wizard and would be able to win a simple game of chess. Instead, it could have been just an army of stone statues that attacked whoever came close.   Since the enchantments were made by Hogwarts teachers, if someone needed access, they would never actually do the tests, rather the professors would simply undo the enchantment to let (let's say) Dumbledore through.    Therefore, it seems pretty crappy to have these obstacles have a way around them. Why not just put it in a room with no doors that only Fawkes can apparate into? Then only Dumbledore would be able to get in with side-along-apparition.   Is Dumbledore intending Harry to fight Voldemort? Is there some reason someone, who was not well liked by the staff might need it who wasn't evil? They seem to be taking unnecessary risk. So, is there an actual reason? Or was it just a plot device?  Edit: As I said, I am aware of the similar question. That question asked IF the Stone was well protected. I am asking, rather, WHY was it NOT well protected? Why was there ANY possibility to bypass the protection? Why were there tests that could be passed, instead of obstacles that could not be circumvented?


I am trying to find $10^{1001}(\text{mod} \ 1001)$. It seemed appropriate to use Euler's theorem, as $\text{gcd}(10,1001)=1$. I have found that:  \begin{align} \phi(1001)&=\phi(7)\phi(11)\phi(13)=720 \ \ \ (\text{where $\phi$} \ \text{denotes Euler's phi-function}) \\ \implies 10^{1001}(\text{mod} \ 1001)&=10^{720+281} (\text{mod} \ 1001) \\ &=1^{720}\cdot10^{281}(\text{mod} \ 1001) \\ &=10^{281}(\text{mod} \ 1001). \end{align}  I don't know how to solve the problem from here. Any advice would be appreciated.


I have the following script  ssh user@host << EOF      STATUS="$(git status)"     SEARCH_STATUS="Not a git"      if [[ "$STATUS" == *$SEARCH_STATUS* ]]; then         echo "Not a git repository"     fi  EOF   I am getting the following error  -bash: line 3: file: No such file or directory   Which corresponds to this line  STATUS="$(git status)"   The issue here is, is that the above line is working, git does exist, and is executing as planned, and storing the output of the git command in STATUS, and the If statement is executing as planned as well, which echo's when the status of git matches the "Not a git" string...  what I don't understand is, is why it's throwing that error, any ideas?


How to change file size calculation in Nautilus from "decimal prefix" back to the normal "binary prefix"?

Ubuntu has used the "base-10"  for almost 3 years now, and being a full Ubuntu user from the awesome 10.10, personally I never was able to relate with it!  I'm not going to talk about how right/wrong this decision was in my opinion and many other Ubuntu users. Instead my question is if there is a clean solution to make the whole system or at least Nautilus use the "base-2" or "binary-prefix"?  I've seen , which the answer states that there is no solution to this problem (unless modifying the entire source of Ubuntu!!) but that post is old and for the times of Ubuntu-11.10. I was wondering if there has been any changes since then?  Not to mention that another post in that question states that KDE is able to do this in the System Settings! If this is true, why not also put an option in Unity ?!  I'm mostly an LTS user, currently using Ubuntu-12.04 (and looking forward to 14.04). If there isn't a way to configure the whole system to use the "binary-prefix", can I at least configure Nautilus to do this?


Unable to install Skype ("Unmet dependencies" error)

Trying to install skype on Ubuntu 12, I faced and issue. When I type:  sudo apt-get update sudo apt-get install skype   I get an error  Reading package lists... Done Building dependency tree        Reading state information... Done skype is already the newest version. You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies:  skype : Depends: lib32stdc++6 (>= 4.1.1-21) but it is not going to be installed          Depends: lib32asound2 (> 1.0.14) but it is not going to be installed          Depends: ia32-libs but it is not going to be installed          Depends: libc6-i386 (>= 2.7-1) but it is not going to be installed          Depends: lib32gcc1 (>= 1:4.1.1-21+ia32.libs.1.19) but it is not going to be installed E: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution).   How do I solve it? Is the way I'm using the right one to install skype?  UPDATE: If I try to do  sudo apt-get install lib32stdc++6 lib32asound2 ia32-libs libc6-i386 lib32gcc1 skype   then I get  Reading package lists... Done Building dependency tree        Reading state information... Done skype is already the newest version. You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies:  ia32-libs : Depends: ia32-libs-multiarch  lib32asound2 : Depends: libasound2 (= 1.0.25-1ubuntu10) E: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution).


Error trying to install wine in Ubuntu 14.10: missing or conflicting packages

I already tried to install it with the terminal as well as with the ubuntu-software-center, but I always get this:  This error could be caused by required additional software packages which are missing or not installable. Furthermore there could be a conflict between   software packages which are not allowed to be installed at the same time.


How is the default user avatar generated?

Is there a name for the default avatars that are generated for users who do not assign one themselves? Not the avatar of the blank user, but the one made up of shards, shapes, and colours:      Is there an online generator for something like that? See also:


Is there anyway to use the setblock command to when I hold an item in my hand (torch) it places a torch on the ground (bedrock edition)

Trying to create a dynamic lighting command that when you hold a torch in your hand a torch is placed at the charcters feet and when the torch is not in hand then the torch is no longer at the players feet.  Have been trying for several hours and cant find a solution.


DNS resolve to CNAME which is not my website. Can someone explain?

I have a website at www.grokit.ca hosted on google app engine. If I issue the following command:  nslookup -query=any -debug www.grokit.ca  ... I get the following output:  $ nslookup -query=any -debug www.grokit.ca Server:         X.Y.Z.12 Address:        X.Y.Z.12#53  ------------     QUESTIONS:         www.grokit.ca, type = ANY, class = IN     ANSWERS:     ->  www.grokit.ca         canonical name = ghs.googlehosted.com.         ttl = 400     AUTHORITY RECORDS:     ADDITIONAL RECORDS: ------------ Non-authoritative answer: www.grokit.ca   canonical name = ghs.googlehosted.com.   Same with dig: dig www.grokit.ca:  ; <<>> DiG 9.9.6 <<>> www.grokit.ca ;; global options: +cmd ;; Got answer: ;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: 34283 ;; flags: qr rd ra; QUERY: 1, ANSWER: 2, AUTHORITY: 0, ADDITIONAL: 1  ;; OPT PSEUDOSECTION: ; EDNS: version: 0, flags:; udp: 4000 ;; QUESTION SECTION: ;www.grokit.ca.                 IN      A  ;; ANSWER SECTION: www.grokit.ca.          865     IN      CNAME   ghs.googlehosted.com. ghs.googlehosted.com.   214     IN      A       74.125.28.121  ;; Query time: 55 msec ;; SERVER: X.Y.Z.12#53(X.Y.Z.12) ;; WHEN: Fri Dec 11 17:53:03 PST 2015 ;; MSG SIZE  rcvd: 92   So basically I get it, my domain is CNAME (~alias), which is linked to ghs.googlehosted.com, which is at IP address 74.125.28.121. However, if I point the browser to 74.125.28.121, this is just a default google website:   So my question is, where is the rest of the DNS lookup? How does the browser know where to issue the GET given that if it uses the IP resolved by DNS it will get a 404 (going to the website on a web browser from www.grokit.ca does work).


Tag badge count in Activity not updating

I just took these screenshots:      It has said this for a long time now (I now have 12 HP answers, not 9).  Why is my tag badge count not updating?   I have tried switching to tracking my next priv., and tracking a different tag badge. Nope.


What actions can be taken with lost and locked phone?

I lost my phone and I tracked it, but then suddenly I lost the location. Can the person make use of it if it is not screen locked? What other actions can he take with it.


Proving that any finite integral domain is a field.

Let $R$ be an integral domain, and let $a \in R, a \neq 0$. Let $f_a: R \rightarrow R$ be defined by $f_a(r)=ar$. Prove that $f$ is injective.   Then prove that every finite integral domain is a field.   My ideas and concept:   Can someone help articulate my understandings into a proper solution?


How can I prove $$\gcd(a,b) = \gcd(a, b +ax)$$  Thanks.


How to clone a Hard Drive to a slightly smaller Hard Drive?

I have a hard drive which is 153 GB with 116 GB free space. I would like to clone this drive to a hard drive which is a 149 GB big (this is the largest hard drive I have... It would be typical that my largest drive is only 4 GB to small).   Is there any way to do this (preferably with free or open source programs)? I am running Windows XP.


Why we use parent reference to child objects?

1) List <employee> l = new ArrayList ();  2) ArrayList <employee> l = new ArrayList ();  What is the advantages of (1) over (2)?


Is there a way to make a file readonly permanently in linux. Or can I put a password to a file to make it readonly, then apply that password again to change its permission, or before they can alter it.


A question on $p$-groups, and order of its commutator subgroup.

$\textbf{QUESTION-}$ Let $P$ be a p-group with $|P:Z(P)|\leq p^n$. Show that $|P'| \leq p^{n(n-1)/2}$.  If $P=Z(P)$ it is true. Now let $n > 1$, then  If I see $P$ as a nilpotent group and construct its upper central series, it will end , so let it be,  $e=Z_0<Z_1<Z_2<......<Z_r=P$   Now as $Z_{i+1}/Z_i=Z(P/Z_i)$, so if if I take some $x\in Z_2$\ $Z_1$ then $N$={$[x,y]|y\in P$} $\leq Z_1(P)$ and $N \triangleleft P $, so $P/N$ is a group with order $\leq p^{n-1}$.  Now if I let $H=P/N$ then obviously |$H/Z(H)$|$\leq p^{n-1}$.  Now $H'\cong P'N/N \cong P'/(P' \cap N)$ so from here I could finally bring $P'$ atleast into the picture, now |$P'$|=$|H'|.|P'\cap N|$ so $|P'|\leq |H'||N|$.   This is where I am $\textbf{STUCK}$  Now , from here how can I calculate or find some power $p$ bounds on $|H'|$ and $|N|$ so i could get my result.


Intuition explaining $\frac{\partial^2 f}{\partial x \partial y}$

This is probably something I should already know, but I would like to know an intuitive way to think about the partial x, partial y derivative of $f$. I understand that $\frac{\partial ^2 f}{\partial x^2} $ can be understood as the concavity in the x-direction. Is there a similar way of thinking about $\frac{\partial^2 f}{\partial x \partial y}$?


What types of damage are affected by the lance special rule?

When using a lance while charging on a mount, the rules say that it deals double damage.  My question is, what all damage is doubled? From what I can find, the die roll and strength bonus are doubled, but what about damage such as from a smite ability, or power attack? And how would it work on a crit? Is the damage doubled, then tripled? Or does it work more like vital strike?  I'm building a mounted paladin, and the rules for the lance are kind of vague.  EDIT:  Okay, so, I did find a partial answer.  Under Multiplying Damage, it states that you "Roll the damage (with all modifiers) multiple times and total the results," whenever you multiply damage, and then " When you multiply damage more than once, each multiplier works off the original, unmultiplied damage. So if you are asked to double the damage twice, the end result is three times the normal damage."  So, from what I can tell, on a critical you would just multiply the damage by four (2 for lance, three for lance crit) or five with the Spirited Charge feat.  However, that still makes me wonder about what falls under 'all modifiers.' Working with a fifth level paladin, average stats of 14 across the board (not likely, but not great stats and easier math) that means you could have 2d8+4(str. doubled from lance)+20(smite damage, double for first attack, double again for lance), for a total average of 33. One attack, at fifth level, dealing 33 damage seems a bit high, but not impossibly so.  Now, for my paladin, who's level 10, took spirited charge and power attack, and who has a +2 lance and a strength of 22 after magic items, and who two-hand wields it while charging. That works out to 3d8+27(three times 1 1/2 str. for two-hand wielding)+6(enchantment bonus on weapon)+27(two-hand wield power attack)+60(smite damage on first attack). That comes out to 133 damage, bypassing DR, and not even on a crit, or as min-maxed as I could make it. That seems ridiculous, which is why I'm wondering about it.


When did our universe and the Star Trek universe diverge?

Note that my question assumes as a given that Star Trek is in an alternate universe which diverged from ours at some point in history.  That seems really, really obvious and undeniable to me.  So the question then becomes: at what point in time did the two universes diverge and have different histories?


Please anyone tell me how I got 55 answer for the below code.  byte myByte = 067;  System.out.println("Byte value: " + myByte);   I got answer as below Byte value: 55  Thanks.


"There is" or "There are" when detailing things together: a theater, a cafe, and a shop?

Which one of the following is grammatically correct?     a) There is a theater, a cafe, and a shop near the park center.      b) There are a theater, a cafe, and a shop near the park center.


A folder and a file with the same name in the same location

I'm on 14.04 about to move up to 18.04. In that version of Ubuntu can I have a folder and a file in the same location with the same name?   My use case is that I have html files without the .html extension, that I push up to AWS S3, where I serve a few websites. Leaving off the .html extension enables me to have clean urls for the websites. And S3 is perfectly happy to have directories and files with the same name, and thankfully they serve the html file rather than a folder if you navigate to the URL that is a file and a folder.   This would be a nice to have in Ubuntu. I could have an html file called 'articles' and a folder called articles, and then my URLs would be "RESTful."  example.com/articles/title would give you the article with that title, and example.com/articles would serve up a list of articles.   Anyhow, AWS already does this, I was just hoping Nautilus, or Ubuntu could handle this so I don't have to go through an awkward coding nightmare where my local directories have different names from my server directories.   Does this work in 18.04 or can anyone think of a good work-around?


I need to put some text at the same height in my page, and I'm trying to do it with a minipage, but I'm not able to do it since they get centre-aligned.    This is the LaTeX for the figure I've uploaded:  \begin{minipage}[]{0.5\textwidth}     \begin{flushleft}         {\large \textit{Author}:\vspace*{0.5cm} \\          Me}     \end{flushleft} \end{minipage}% % \begin{minipage}[]{0.5\textwidth}     \begin{flushright}         {\large \textit{Supervisor}:\vspace*{0.5cm} \\          Him}\\         \vspace*{0.5cm}         {\large \textit{Advisor}:\vspace*{0.5cm} \\          Other Guy}     \end{flushright}     \end{minipage}%   Can you please explain me what I'm doing wrong?


I posted this question yesterday, and, despite getting answers, I am still confused how to solve it:     Use Taylor's theorem to prove that $\displaystyle\lim_{n \to \infty} n \ln\left(1+\frac{1}{n}\right)=1$   I know the Taylor expansion of ln(1+x) is $x-\frac{1}{2}x^2+ \frac{1}{3}x^3 ...$, but I don't see what this gives me.  Also, one respondent posted: ln(1+t)=t+o(t), and I don't understand how this follows by the Theorem...


When I open a window to air out the room, how does the smell disperse?

Let's say I'm in a room with some kind of noxious stink, possibly of flatulent nature.  The quickest way to right the world that comes to mind is to open a window.  When I open a window, how do the stank particles leave the room?


How can I get octal file permissions from command line?

There is a chmod command to set file permissions, but can I get file permissions in octal mode (such as 755) from the command line?


I have a new 16.04 install and ubuntu software is not working. how to install software without using ubuntu software? is there a way to see a list of software available?


function fun(){     eval("var key = 'value';");     return key; }  fun() //returns 'value' as expected   However, when I use eval inside a method in a class, I get a Reference Error, as shown below:  class c {    constructor() {    }    funInClass(){      var key1="value1"      eval("var key2 = 'value2';");      console.log(key1);      console.log(key2);    } }  var obj=new c(); obj.funInClass(); value1 //prints as expected ReferenceError: key2 is not defined  // was expecting eval to have declared/initialized key2   I understand eval should be avoided, nevertheless like to understand this behavior.


biological basis for excluding values outside 3 standard deviations from the mean?

Is there any biological basis for excluding outliers in a dataset of blood cytokine levels (e.g. values outside 3 standard deviations from the mean for each cytokine) as measured by multiplex technology? How may I distinguish values reflecting the potential heterogeneity of my sample cohort from real outliers (e.g. measurement or coding errors)?


Is "running" a gerund or a participial adjective?

An enlightening experiment   Google Books yields only , and instead asks me if I wanted to say “an enlightening experience”, and eagerly shows an impressive  when I click on their suggestion. But for my purposes, I want the noun experiment   A running experiment    suggests that running in 2.  must be an adjective     adjective           prevalent, as a condition or state:   running prices.   going or carried on continuously; sustained:   a running commentary.   extending or repeated continuously:   a running pattern.      We normally hear the plural form, running experiments, but the singular form is grammatical, and Google Books produces about .  Enlightening in "An enlightening experiment" is an adjective because I can use "very" to modify it:      A very enlightening experiment (YES)   but in sentence No.2, running cannot be modified by "very"      A very running experiment (NO)   It makes no sense, even though "running" appears to be an adjective. The comparative form,  “A more running experiment” is evidently wrong,  but with enlightening, the comparative is acceptable: “A more enlightening experiment”.   Does that mean running in sentence No.2 is a gerund?  How can I prove that running is a participial adjective or a gerund?     This question was inspired by this


Polymorphism not always working when using reference

I am having some unexpected behavior when using references on virtual methods. Basically if I take a reference to an object of the base class, then change that reference to an object of the derived class.  When I call the virtual method, the base class method is called.  But if I take a reference to the base class and initialize it to the derived class, the derived method is called. Here is some code.  // A base class with a virtual that prints the class class BaseClass {     public:             virtual void printMe(); };  class DerivedClass : public BaseClass {     public:             void printMe() override; };  void BaseClass::printMe() {     cout << "in Base"<<endl; }  void DerivedClass::printMe() {     cout << "in Derived"<<endl; }   int main () {     BaseClass bc = BaseClass();     DerivedClass dc = DerivedClass();      BaseClass * pbc = & bc ;     pbc->printMe();            // Prints in Base     pbc = & dc;     pbc->printMe();            // Prints in Derived      // Now with a reference     BaseClass & bcr = bc;     bcr.printMe();              // Prints in Base     bcr = dc;     bcr.printMe();              // Prints in Base   !!!       BaseClass & foo = dc;     foo.printMe();              // Prints in Derived !!!     return 0; }   if someone could explain why the fourth print is not "in Derived" and why the fifth one is "in Derived" I would be grateful.  I (now) understand what has been posted about slicing - but under that logic I don't understand why  BaseClass & foo = dc; foo.printMe()   calls the derived method  Nevermind   I see it now.


Process to calculate distance from points to line in QGIS

I am trying to calculate the distance between each point(as seen in the picture below) and its nearest line which is a road. I have tried to rasterize the data on all the roads and I end up with the rasterized output which can be seen in the second image. I am not sure why the output has those numbers.


Flow rates correlations or Flow rate correlations

I do have a rather basic question. Does one say: "Flow rates correlations" or "Flow rate correlations" in English. Is there some specific rule to follow here?


Does salt interfere with the yeast in the dough swelling process?

I was told by a friend that, when making pizza dough, I should add the salt at a later stage than the yeast, because it might disturbe the yeast from doing its thing...  I apologize for not having anymore concrete information, I just wanted to check this...


Why can I contract *across* a word, skipping the word in the middle?

I wrote this sentence:     Why wouldn't it be valid?   --and I realized that without the contraction it becomes:     Why would it not be valid?    As opposed to "why would not it be valid," as the contraction would imply.  What's going on here? Why can I contract across the middle word this way? Or, to put it the other way, why can't I "de-contract" this without moving the not over by a word?


i make PHP site  With USER / Pass Login  But USer can Skip This Page BY Use '=' 'or' ‘ or 1=1  Like this  Code Here In File Login_Check.php  `  include("includeszzz/host_conf.php"); include("includeszzz/mysql.lib.php"); $obj=new connect; $obj1=new connect; $username=$_GET["username"]; $password=$_GET["password"]; //echo $username; //echo $password; $sql="select username from  admin where username='$username'"; $obj->query($sql); $U_num=$obj->num_rows(); //echo $U_num; if($U_num!=0) { $sql1="select password from admin where username='$username' and password='$password'"; $obj1->query($sql1); $P_num=$obj1->num_rows();     if($P_num!=0) {         session_start();         $_SESSION["zizo"]="$username";     //header("location: welcome.php");     echo "1"; } else {     echo "Invalid Password Please Try Again"; } }  else { echo "Invalid Username Please Try Again"; }   `


I am trying to make conditions in for loop but i think it is not working for some reason

I have an array that consists of [A, C+] and I invoke it inside a method called getPoints(). The method's job is to check every element in the array and based on the conditions it should assign a number into another array, but it did not. I've been studying Java for 3 weeks now, so all I know is the basics. public static double[] getPoints(String[] grade) {     double[] points = new double[grade.length];          for (int i =0, j = 0; j < grade.length; i++,j++) {         if (grade[i] == "A+") {             points[j] = 4.0;}         else if (grade[i] == "A") {             points[j] = 3.75;}         else if (grade[i] == "B+") {             points[j] = 3.5;}         else if (grade[i] == "B") {             points[j] = 3.0;}         else if (grade[i] == "C+") {             points[j] = 2.5;}         else if (grade[i] == "C") {             points[j] = 2.0;}         else if (grade[i] == "D+") {             points[j] = 1.5;}         else             points[j] = 0.0;     }          return points; }


The abstract environment changes the \linewidth for the whole document

In the article class, it seems that using the abstract environment has an effect to the rest of the document. More precisely, it seems that it redefines the \linewidth, which equals \textwidth without abstract, is smaller with the abstract. My feeling is that \linewidth is redefined for the abstract environment, but the value is not reseted at the end of the abstract.  Here is a minimal example:  \documentclass{article} \begin{document} \abstract{This is an abstract. This is an abstract.}\bigskip  This is text. This is text. This is text. This is text. This is text. This is text.\\  \rule{\textwidth}{3em} \rule{\linewidth}{3em} \end{document}   The output is not the same if you comment the \abstract line or not.  Do you have the same problem as I do when you compile (if not, I will upload some PDF files to show)? Is this a (known) bug in LaTeX2e? How can we circumvent the problem?  Note: I compile with the pdflatex command, and I use pdfTeX, Version 3.1415926-1.40.10 (TeX Live 2009/Debian).


I am trying to delete all the duplicates but keeping single record only (shorter id). Following query deletes duplicates but take lot of iterations to delete all copies and keeping original ones. DELETE FROM emailTable WHERE id IN (  SELECT * FROM (     SELECT id FROM emailTable GROUP BY email HAVING ( COUNT(email) > 1 )  ) AS q )  Its MySQL. DDL CREATE TABLE `emailTable` (  `id` mediumint(9) NOT NULL auto_increment,  `email` varchar(200) NOT NULL default '',  PRIMARY KEY  (`id`) ) ENGINE=MyISAM AUTO_INCREMENT=298872 DEFAULT CHARSET=latin1


Understanding the basic concepts of quantum mechanics using a model

I'm not an expert and I don't know if already exists something like the following model, but I wrote a simple (mental) model to understand the basic concepts of quantum mechanics. I want to know if this model is valid or not.  Red-or-Black (RoB) Card Model     Suppose to have two cards, one is red and the other is black. Both the cards have the other side with the same color (e.g. white). A special machine can shuffle the cards truly random and then puts the cards turned down on the table with only the backs visible (i.e. the white side). Nobody knows where is the red and the black card, so each card is red or black with the 50% of probability. In other words each card is red and black at the same time (superposition).   This model seems work because when you turn up one of the two cards (measurement), you're fixing its state to a single state (or red or black). At the same time you're fixing also the state of the other card (entanglement). If you repeat the measure turning down and then turning up one of the two cards the result is always the same (the state is fixed). Also the no-cloning theorem works because you can't copy the color of a card until you turn up the card. Is this correct?  Another strange thing is the observer definition. If I view the color of a card I'll fix its state, but this is valid also if my cat views the color of that card. So, who/what is the observer? Can be the card itself? The card have the color printed over its surface, so the card knows its state, then I can't understand if it's right to say that the card is in a superposition because the state should be already fixed by itself (i.e. there is only a single state).


strcpy crash with char *[] (ARGV Structure)

I have a problem with the c function 'strcpy' that I have not been able to figure out.  it involves copying to a char *[]  like Argv (but not actually Argv). I can copy out of the structure but not in.  But only if I initially declare the entire Argv Structure in a single go.  I assume that a char *[] is and array of char*.  Here is a simple demo program of the issue:  #include <stdio.h> #include <stdlib.h> #include <string.h>  char FN[]="BBBB";     char *TL[]={  "a0                ",  "a1                ",  "a2                ",  "a3                ",  "a4                ",  "a5                "};   char BN[]="c1                    ";   char N0[]="N0                    ";  char N1[]="N1                    ";  char N2[]="N2                    ";  char N3[]="N3                    ";  char N4[]="N4                    ";  char N5[]="N5                    ";   char* TD[6];     int main ( int argc, char *argv[] )  {      // FN is a pointer to an array of chars     // BN is the same      //TL is an array of pointers (that each point to an array of chars)      //TL[1] is thus a pointer to an array of chars      //TL is the same structure as Argv      //TD is the same structure as Argv  (but built up from parts)     //  but is spread out across the globals and the main func.     //  thus less easy to read and understand then TL.      //TL[i], TD[i], and BN are initially allocated significantly larger than FN     //  to remove the worry of overruns.      //copy "a1                \0" into the space held by "c1   "     strcpy(BN,TL[1]); //works      //copy "BBBB\0" into the space held by "c1   "     strcpy(BN,FN); //works      TD[0]=N0;     TD[1]=N1;     TD[2]=N2;     TD[3]=N3;     TD[4]=N4;     TD[5]=N5;      //copy "BBBB\0" into the space held by "a1   "     strcpy(TD[1],FN); //works      //copy "BBBB\0" into the space held by "a1   "     //strcpy(TL[1],FN); //dies    }


Where can I learn the rules of representation decompositions?

I want to understand the rules of how to decompose representations of say $SU(N)$ to simpler representations. For example, in $SU(2)$ the representation $\mathbf{2}^{\otimes 2}$ decomposes as $\mathbf{1}\oplus \mathbf{3}$ but not as $\mathbf{2}\oplus \mathbf{2}$.  So, what is a nice place to learn these things for a physicist and for groups other than $SU(2)$? I am especially interested in this notation and not a "quantum mechanics" notation using raising and lowering operators on states.


Prove that $\lim_{n\to\infty} a_n^{1/k} = L^{1/k}$.

Suppose that ${a_n}$ is a convergent sequence of positive terms that converges to $L \geq 0$. Let $k \in \mathbb{N}$. Prove that $\lim_{n\to\infty} a_n^{1/k} = L^{1/k}$ .  I know I'll have $k \in \mathbb{N}$ and $a_n > 0$. I also know I'll have $|a^{1/k}_n - L^{1/k}| < \varepsilon$ and also $a_n - L = (a_n^{1/k})^k - (L^{1/k})^k$. This is as far as I have been able to get, any help is much appreciated!


How to scale tikz drawing to paperwidth?

For use as a headline in beamer, I would like to scale the following tikz image to \paperwidth, preserving the x-y-ratio. I seem to be too dumb to find this (easy?!) solution... Thanks for any help!  Example:  \documentclass{beamer} \usepackage{tikz} \begin{document} \begin{frame}{A Frame} \begin{tikzpicture} % \draw[color=blue, fill=blue] (0,0) .. controls (5.30, 1.76) and (10.55, 1.32) .. (10.61, 1.32) -- (10.61, 1.75) -- (0,1.75) -- (0,0);         \end{tikzpicture} \end{frame} \end{document}


Which one is correct way of asking question?  a ) From which site you downloaded this file ?  Or   b) From which site did you download this file ?  Similarly,  a) From where you got my number?  And   b) From Where did you get my number?


FormsAuthentication.SignOut() does not log the user out

Smashed my head against this a bit too long. How do I prevent a user from browsing a site's pages after they have been logged out using FormsAuthentication.SignOut? I would expect this to do it:  FormsAuthentication.SignOut(); Session.Abandon(); FormsAuthentication.RedirectToLoginPage();   But it doesn't. If I type in a URL directly, I can still browse to the page. I haven't used roll-your-own security in a while so I forget why this doesn't work.


I don't know how to make this code safe. I tried to use mysql_real_escape_string in the query variable like     $query = "select * from products where id= " . mysql_real_escape_string($products);    but didn't work, also tried to escape in the products variable, but got the same result. Any sugestions? Thanks.    <?php  / Define vars. $conn = mysql_connect('localhost', 'test', 'test'); $products = isset($_GET["products"]) ? $_GET["products"] : ""; $query = "select * from products where id=$products";  // List elements. if ($conn) {  mysql_select_db('testsqli');  $result = mysql_query($query);    // Table head.  echo '
';  echo '
';  echo 'Description	';  echo 'Price	';  echo '
';    // Empty table?  if (@mysql_num_rows($result)==0)  {   echo '
';   echo 'That\'s all!	';   echo '
';  }   // Listing data in table.   while ($row = @mysql_fetch_array($result))   {    echo ''.$row['Description'].'	';;    echo ''.$row['Price'].'	';;       }  echo '
'; } ?>


How can I control how quickly a character levels up in an RPG?

I am working on an RPG and I've mostly followed formulas from the Dragon Quest series and they've all been fairly simple. (For example, dmg = (Attack/2 - Defense/4), where Attack is Weapon Power+STR.)  Experience points are more complicated though. I want one of the characters to level more slowly compared to the others. I'm not comfortable with the maths, but how would I go about creating a suitable exponential growth formula that is slow from let's say levels 1 through 40 and then speeds up to 99?


PPA 404 error upon apt-get update? (related to php7)

I get a 404 error upon php7 update from url   Err ppa.launchpad.net wily/main amd64 Packages   404  Not Found  Err ppa.launchpad.net wily/main i386 Packages   404  Not Found Fetched 10.4 kB in 4s (2,397 B/s) W: Failed to fetch ppa.launchpad.net/ondrej/php-7.0/ubuntu/dists/wily/main/binary-amd64/Packages  404  Not Found  W: Failed to fetch ppa.launchpad.net/ondrej/php-7.0/ubuntu/dists/wily/main/binary-i386/Packages  404  Not Found  E: Some index files failed to download. They have been ignored, or old ones used instead.   Would anyone know what I should do? Is there another/new PPA for php7?  I removed the http before the ppa.* links because I'm not reputable enough to post more than two links. Thank you for reading.


How to Change DNS of network from Terminal?

I know how to change the DNS of my network from GUI :   Right click on the network manager icon in the panel and choose "Edit connections..." Select your connection from the wired or wireless tab, choose "Edit" Choose IPv4 settings tab Switch method to "Automatic (DHCP) addresses only" Enter the DNS you want in the box "Additional DNS servers" and press "Apply"   How do I do exactly the same thing from Terminal?


Pointing the camera in a particular direction programmatically

I'm trying to use Python to place a camera. I know the camera's location, and the forward and up vectors for the camera (i.e. the direction it's pointing and its orientation). How do I do this?  I know that it's possible to calculate a raw world matrix from the above information, which I can then apply to the camera, but I was rather hoping not to have to. Is there an easier way?


I'm using Lyx and I have problem with equations. I would like to add label to equation, but somehow I can't add label if formula is in table or float. Ok, I can take them outside and then I can label them. But(!), then I can't move the equations to left. Tried everything.  The best would be, if I can keep equations in table, so I can adjust them easily. The result should be same as the last three equations with label.  /poor English


How to create an engine glow effect for spaceships in cycles?

I want to create some kind of lighting effect for the engines but I quite new to lighting in general. To be honest, I'm used to sticking a single point lamp in.  From the tutorials I've seen, none of them are for cycles and focus on lighting a whole object anyway, not particular faces of it. The engines I want to add the effect to are the 3 on each wing and the 2 in the middle.  I tried following this () previously but none of it is making too much sense.  The first method shown was using volumetric materials. I've never heard of that before while working in Blender but I thought I myswell try it still but the whole method itself was just too complicated. I just didn't understand half of what it said.  With the composition method, I used the same nodes (with same values) as in  yet I didn't notice any change in my render whatsoever. I guess those effects were supposed to effect the picture as a whole? I don't have any experience with either nodes or composition previously before this.


Is there any way to disable a YouTube video from automatically starting in Firefox?

I have a couple of videos open on Firefox. As I refer to them often, I prefer to keep them as a tab rather than as a bookmark. However, every time I reboot Firefox, they start to play. Can I have them come up but not start to play until I select them to start? Thanks.


Maximum likelihood estimator of $\theta$ from a sample

Let $X_1,\ldots,X_n$ be a sample from the distribution whose probability density   function is:       $$f(x)=\begin{cases}\frac13e^{-\frac13(x-\theta)}&, x\ge\theta \\ 0&,x<\theta\end{cases}$$      Find the maximum likelihood estimator of $\theta$.   So the PDF is equal to:  $$f(x\mid \theta) = \frac{1}{3}e^{-\frac{1}{3}(x-\theta)}1_{\{x\geq \theta\}}$$  and thereby the likelihood will be:   $$\mathcal{L} = \prod_{i=1}^n f(x\mid \theta)= \prod_{i=1}^n  \frac{1}{3}e^{-\frac{1}{3}(x-\theta)}1_{\{x\geq \theta\}}$$


How to enhance website product pages for SEO (Opencart, Google)

I launched a UK wide furniture business, which I can appreciate is a very difficult industry to break into but none the less I have implemented the basics by ensuring I have:   Good meta data (titles, description, and keywords - eventhough it is ignored by Google) Adequate H1 and H2 tags Sitemap submission Good quality content trying to keep the keywords within a certain percentage of all the text (~4%?).    This has resulted in being within the top 10 SERP on Google for about 30 different keyword combinations as shown by GWT (Not the best of keywords but still giving me an online presence)  My question is what can I do to further improve my position? Any general advice which I and others can implement to take it to the next level?  Home page:  sample product page:


Bibliography in ieee format in beamer presentation

I can create bibliography at the end of my beamer presentation manually in IEEE style using  \begin{the bibliography} \bibitem{} \end{thebibliography}   When I do this, I do not get   [1] Author, Paper, etc...   but I get as shown in the attached image. I want square brackets with numbers. How to do it?


Variable inherited in the subshell without exporting in the main shell

I am having the below shell script  var="this is a test"  ls -ltr| while read file do      echo $var done echo $var   I am getting the below output:  this is a test this is a test this is a test   How am I getting the value of the variable "var" set to "this is a test" inside while loop since piping will spawn a new sub-shell and I am also not exporting my "var" variable in the main shell?  As far as I know, in order for the child to inherit the variable values from the parent shell, we need to export the variable, but in this case the variable value is getting inherited without the "export" statement.


How to restore Thinkpad W530 back to Windows

I installed Ubuntu onto my Thinkpad W530 awhile back via USB but now I need to get windows back on the machine and possibly dual boot Ubuntu instead. I have the recovery CD's for windows 8, I am just not sure how to go about restoring the laptop back to factory fresh.  Doesn't seem like there is a F11 recovery partition anymore either.


I need help regarding travel to Lisbon from Pakistan

I am traveling from Pakistan to Lisbon. I have a 30-day visa from Portugal.  I will be transiting in Barcelona. Do I need another transit visa for Spain? Can I use the transit area of the Barcelona airport?  Here is my itinerary:   Multan (Pakistan) - Doha (Qatar) Doha - Barcelona Barcelona - Lisbon


I have a unique need for ALL the webpage content to be aligned to the bottom. The reason is the body has a background image. If zoomed out, the content goes up with the page which happens to not be too readable because of the clouds in the image. So if someone zooms out the content needs to stay at the bottom where the lower part of the image is.  The problem is  position: absolute: bottom : 0;    Doesn't work because if they zoom in, or if the browser window is too short to fit all the content, and no scroll bar appears.   I have no idea how to fix this, without using dirty hacks.  How can I make the wrapper div (all the content) stay at the bottom like a footer when there is no other content, and not loose content when zooming in?  I am open to JS solutions if that is the only way.  EDIT:  One of the answers seem to think I am refering to CSS zoom. I am not. I am talking about browser zoom, ie Ctrl +  JSFIDDLE:   Light Result (not inside iframe):   Note, real page is not all text, so text alignment css is not an option.


New Ubuntu User Here, How Do You Get Wifi To Work

I just started using Ubuntu on my old MacBook, and the WiFi doesn't work. When I go to the WiFi settings, it says "No Wi-Fi Adapter Found". I went to Software & Updates>Additional Drivers, and tried to install network drivers, but when I clicked "apply changes" it said "error while applying changes pk-client-error-quark: Cannot download packages whilst offline (257)". Before I installed Ubuntu, I booted it off of a live USB, and the WiFi worked just fine, but now it doesn't. I can confirm that it is not a hardware problem, because when I booted into mac OS, the WiFi worked. I am using Ubuntu 20.04.1 LTS. 04:00.0 Network controller [0280]: Broadcom Inc. and subsidiaries BCM4331 802.11a/b/g/n [14e4:4331] (rev 02)     Subsystem: Apple Inc. AirPort Extreme [106b:00ef]     Control: I/O- Mem+ BusMaster+ SpecCycle- MemWINV- VGASnoop- ParErr- Stepping- SERR- FastB2B- DisINTx-     Status: Cap+ 66MHz- UDF- FastB2B- ParErr- DEVSEL=fast >TAbort- <TAbort- <MAbort- >SERR- <PERR- INTx-     Latency: 0, Cache Line Size: 256 bytes     Interrupt: pin A routed to IRQ 17     Region 0: Memory at c1900000 (64-bit, non-prefetchable) [size=16K]     Capabilities: <access denied>     Kernel driver in use: bcma-pci-bridge     Kernel modules: bcma


Im having trouble understanding what << means in C. Im supposed to explain some code as a homework assignment, but it's kinda difficult to find an answer by googling.  It's related to programming a multi function shield connected to arduino (atmega328p chip)  Here's the line:  PORTB = ~(money << 2);


Avoid conversion to CW at 10 edits: allow user option to not have post pushed to top of home page

I would very much like to be able to edit my posts beyond 9 times without them automatically being converted to Community Wiki. I am willing to forgo the "pop to top of home page" function as many times as necessary in order to have this, since apparently that is the true driving factor behind the CW flag being used after 10 edits when there is only a single editor--to discourage edits due to the "nudge" action this triggers.  You might ask me why I would ever edit a post that many times.  Well, take  for example (please do not upvote unless you REALLY want to--I am not trying to use meta to cruise for votes plus it's CW anyway). In it I use two SQL query techniques that I have never seen anyone else use (at least not in that exact form) and that together achieve a 100 times improvement in reads over the next best query (which itself is quite respectable). After my initial post, I added a huge explanation section. I added performance testing. I corrected typos and awkward wording. I ended up posting, the next day, a complete rewrite of the query that cut its CPU time in half and is substantially simpler. Coming up with the basic idea and turning it into the best query took me literally hours of tinkering, and required some really intense thinking.  I have flagged the question for moderator attention, and requested politely for CW status to be removed, but to no avail. (Is there some way to see if a moderator has decided on an action, or whether it is still in a queue somewhere?) So it appears that any future votes on what I consider a sublime work of art will not gain any value to me. (Please forgive me for the conceit of thinking that the child of my own brain is beautiful when it may in fact be ugly--I don't imagine myself a genius or something. It's just a really cool query that I got very excited about.)  It's not the first time this has happened to me--and the other times were on similar posts where I had a crazy query idea and started posting new versions plus performance data, and even 3D surface-area charts.  I'd be very happy to forgo pops to the top of the home page if I can just avoid Community Wiki on these posts that I put such time into (and community value, or so I hope it can be called such). Could we not offer people, at editing time, the option to not have this trigger occur? I realize we probably can't broadcast the "nudge" feature blatantly, as that would make system-gaming post-editing even more prevalent.  But it would be very much appreciated, at least at the 10th edit and onward, to offer this option. Or maybe there could be some analysis of length--given that many of my edits were quite substantial and many thousands of characters. Even make the posts go to the review queue for some evaluation of whether it was a substantial improvement or not. Something. Anything!  Frankly, I think my answer is good enough that it is almost worth deleting it and reposting the current version. Over time it could probably garner more rep than I lose by this action. But I shouldn't have to do that for what could be a great answer!  For the record my edits were, after the first post, in characters added unless otherwise noted: 521, 828, 270, 5670, 5670 (within 5 minutes, same content), 12, 12, adding a completely new improved query, adding headers to organize what was getting very long, 3031, 4 (typo correction) that triggered CW.


Possible Duplicate:          I'm taking elementary number theory and there is this one question that I don't know where to start at... Please help me, thanks!     Prove that if $n$ is composite, then $2^n - 1$ is composite.


"This is a favorite question" tooltip when not favorite

When viewing a question, when I hover over the star icon (under the voting module) the tooltip says I've made it a favorite when I haven't yet.


How to find out if a system uses SysV, Upstart or Systemd initsystem

Is there a simple way to find out which initsystem is being used e.g by a recent Debian wheezy or Fedora system?  I'm aware that Fedora 21 uses systemd initsystem but that is because I read that and because all relevant scripts/symlinks are stored in /etc/systemd/. However, I'm not sure about e.g Debian squeeze or CentOS 6 or 7 and so on.   Which techniques exist to verify such initsystem?


Lagrangian interpolation: degree of the interpolation polynomial

Given $n+1$ points in the plane, Lagrangian interpolation gives the unique polynomial of degree less or equal to $n$.  From the examples I've seen so far, interpolation polynomials all have degree exactly $n$ but I don't know if there might be a set of points for which the interpolation gives a polynomial of degree strictly less than $n$.  Many thanks for your answers.


Can I play an evil character without letting anyone but the DM know?

Basically, my character would be evil in secret until she could do a huge emotional betrayal and try to kill everyone. I'd have to lie to my friends and make up two separate character sheets if I did this - after all, even the least metagame-y people would change their reactions slightly if they knew one of their fellow travelers was evil. But it would be for the sake of the most epic betrayal ever and I'm pretty sure they would appreciate the cunning of it once they found out.   Is secretly playing an evil character against D&D etiquette?  Are there other ways to play an evil character in a good campaign, to avoid metagaming by the other players?


what does it mean ' infinity comes in different sizes'?

What does mean when mathematicians say infinity comes in different sizes ?


When do we use the gerund and when the noun form?

I ran into this sentence written by a student: there are different costs in face-to-face classes, such as the cost of commuting between university and home. Can we replace commuting with commute because commute is also a noun like the gerund 'commuting'? Also, when a noun form exists, when do we use the noun and when the gerund? Is either of them preferable? I couldn't find the answer anywhere I looked. Thanks in advance.


How do I call Google APIs fonts in CSS file?

<link href="https://fonts.googleapis.com/css?family=Montserrat:100,200,300,400,500,600,700,800,900" rel="stylesheet">   How do I call the above Google font family link in CSS file?


Does a command-line process need to be closed after exiting

I'm using ffprobe.exe to get info about video file.  Process probe = new Process(); probe.StartInfo.FileName = "\"" + ffmpegFolder + "ffprobe.exe\""; probe.StartInfo.Arguments = "-select_streams v -show_entries stream=duration \"" + path + name + "\""; probe.StartInfo.UseShellExecute = false; probe.StartInfo.RedirectStandardOutput = true; probe.Start(); string s = probe.StandardOutput.ReadToEnd(); probe.WaitForExit();   Do I need to call probe.Close() after process exits?


I am using VC++. Is assert(false) ignored in release mode?


How to create per-vertex normals when reusing vertex data?

I am displaying a cube using a vertex buffer object (gl.ELEMENT_ARRAY_BUFFER). This allows me to specify vertex indicies, rather than having duplicate vertexes. In the case of displaying a simple cube, this means I only need to have eight vertices total. Opposed to needing three vertices per triangle, times two triangles per face, times six faces. Sound correct so far?  My question is, how do I now deal with vertex attribute data such as color, texture coordinates, and normals when reusing vertices using the vertex buffer object?  If I am reusing the same vertex data in my indexed vertex buffer, how can I differentiate when vertex X is used as part of the cube's front face versus the cube's left face? In both cases I would like the surface normal and texture coordinates to be different. I understand I could average the surface normal, however I would like to render a cube. Also, this still doesn't work for texture coordinates.  Is there a way to save memory using a vertex buffer object while being able to provide different vertex attribute data based on context? (Per-triangle would be idea.)  Or should I just duplicate each vertex for each context in which it gets rendered. (So there is a one-to-one mapping between vertex, normal, color, etc.)  Note: I'm using OpenGL ES.


"Hidden layer sizes" vs "Hidden layers sizes"

I am writing a neural network application. In this application, a neural network can have one or more hidden layers, which can have different sizes (neuron counts).  Which label would be correct: "hidden layer sizes" or "hidden layers sizes" and why? I realize this is a more general grammar related question and I'd love to learn about it.  EDIT: the label is for a text box, where user will enter numbers separated by commas.


What is the difference between a Summation and an Integration?  Both of them add some values. Right? Then what is the difference?  Please, explain in layman's terms.