I am from Australia and planning to visit Canada and U.S this year. I got my ESTA approval but not sure about coming to U.S. twice in a month. I will be visiting NY from Toronto and then back to Toronto and then Vancouver. From there I am planning a trip to LV &amp; LA. Will there be an issue as my second visit will be in a couple of weeks time again to U.S.  Any help please as I am not sure about this, thanks.
Can I visit the US twice within a 90 day period under the Visa Waiver Programme? 2nd time is only to transfer (change terminal, not airside).
Holmby Hall is a landmark site in Los Angeles. The Wikipedia page doesn't use "the" before Holmby Hall, but has used the before The Fox Theatre. How do I handle elastic contacts in a simulation with friction I'm trying to simulate a wheel as it hits the ground.  Problem 1  Suppose a disc is dropped from a height. It has initial velocity of $-x,-y$ caused by throwing and gravity. It has no initial angular velocity. When it hits the ground it should have some rotation resulting from the collision.   How to calculate force that caused torque for that rotation?   Problem 2  The same disc is dropped from height. It doesn't have velocity on the side direction. It already spinning fast. When it hits the ground the spinning should cause some translation.   How to calculate force that caused this linear acceleration? Some rotation must be lost in the collision, how to calculate that?   To simplify assume static $friction = 1$ and $g = -10$. What are the big differences among the D&D editions? I've been out of the loop for a while, and I used to play AD&amp;D 2nd ed, but today I find there are a lot of different versions that have fairly different gameplay.   Can anyone summarize the really big differences, the ones (maybe top three?) that are the 'killer features' of the different editions? What makes each edition play differently than the others? My public website name and AD domain name are the same. How can I get to my external website from inside my network? I have a list of items   John ID Matt ID John ID Scott ID Matt ID John ID Lucas ID   I want to shove them back into a list like so which also means I want to sort by the highest number of duplicates.   John ID 3 Matt ID 2 Scott ID 1 Lucas ID 1   Let me know how I can do this with LINQ and C#.  Thanks All  EDIT 2 Showing Code:      List&lt;game&gt; inventory = new List&lt;game&gt;();     drinkingforDataContext db = new drinkingforDataContext();     foreach (string item in tbTitle.Text.Split(' '))     {          List&lt;game&gt; getItems = (from dfg in db.drinkingfor_Games                                where dfg.game_Name.Contains(tbTitle.Text)                                select new game                                {                                    gameName = dfg.game_Name,                                    gameID = Boomers.Utilities.Guids.Encoder.EncodeURLs(dfg.uid)                                }).ToList&lt;game&gt;();          for (int i = 0; i &lt; getItems.Count(); i++)         {             inventory.Add(getItems[i]);         }     }      var items = (from xx in inventory                  group xx by xx into g                  let count = g.Count()                  orderby count descending                  select new                     {                         Count = count,                         gameName = g.Key.gameName,                         gameID = g.Key.gameID                     });      lvRelatedGames.DataSource = items;     lvRelatedGames.DataBind();   This query displays these results:   1 hello world times 1 hello world times 1 Hello World. 1 hello world times 1 hello world times 1 hello world times 1 Hello World. 1 hello world times   It gives me the count and name, but it doesn't give me the ID of the game....  It should display:   6 hello world times   234234 2 Hello World.  23432432 Many LaTeX “hacks” begin with \makeatletter and end with \makeatother. What do these commands do? What does "I have got some time on my hands" mean? My shift at work's kinda long, so I've got some time on my hands to, you know...whatever. Think, I guess.   What does "I have got some time on my hands" mean in the above quote? Meaning of "* */1 * * *" cron entry? Somehow, I am finding it difficult to understand tweaking around * parameters with cron.  I wanted a job to run every hour and I used the below setting:  * */1 * * *   But it does not seem to do the job. Could someone please explain the meaning of above and what is needed for the job? A star's collapse can be halted by the  due to the Pauli exclusion principle. In extreme relativistic conditions, a star will continue to collapse regardless of the degeneracy pressure to form a black hole. Does this violate the Pauli exclusion principle? If so, are theorists ok with that? And if it doesn't violate the Pauli exclusion principle, why not? Here is a minimal example that showcases my problem:  \documentclass{article}  \usepackage{amsthm} \usepackage{hyperref} \usepackage{cleveref}  \newtheorem{thm}{Theorem} \newtheorem{lem}[thm]{Lemma}  \begin{document}  \begin{lem} Lemma \end{lem}  \end{document}   The warning I get is the following:  [1pdfTeX warning (ext4): destination with the same identifier (name{thm.1}) has been already used, duplicate ignored  \AtBegShi@Output ...ipout \box \AtBeginShipoutBox                                                    \fi \fi  l.16 \end{document}                    {&lt;install dir&gt;/MiKTeX/2.9/pdftex/config/pdftex.map}]   I know that it is just a warning and that, my document will still work perfectly fine with regards to cross-referencing and hyperlinking, but I would still like to know why I am getting this warning and if anything can be done to fix it without removing functionality of the included packages.   Bonus question: Whats going on behind the scenes when this warning (or any generic 'destination with the same identifier (name{XXX.YYY}) has been already used, duplicate ignored') is produced, as this is not limited to theorem environments.  From log file:  Package: amsthm 2004/08/06 v2.20 Package: hyperref 2011/04/17 v6.82g Hypertext links for LaTeX Package: cleveref.sty 2011/03/22 v0.17.9 Intelligent cross-referencing Package cleveref Info: `hyperref' support loaded on input line 2157. Package cleveref Info: `amsthm' support loaded on input line 2300. Let $\mathbb{R^{ n×n}}$ be the space of n × n real matrices. Show that if $ A(t) \in \mathbb{R ^{n×n}}$ is a differentiable function of $t$ then $\frac{d(det A(t))}{dt}$ is the sum of the determinants of $n$ matrices, in which the $i$th matrix is $A(t)$ except that the $i$th row is differentiated. Use this result to prove that the directional derivative of the determinant function at the matrix $A \in \mathbb{R ^{n×n}}$ along the direction $B \in \mathbb{R^{ n×n}}$ is given by $$(det)^{'} (A; B) = tr(Adj(A)B) = \langle Adj(A)^{T} , B \rangle $$ where $Adj(A)$ is the adjoint of $A$, and where the inner product on $\mathbb{R^{n×n}}$ is the trace inner product given by $\langle X, Y \rangle = tr(X^{T} Y )$ Conclude that $$D(det)(A) = Adj(A) ^T $$. Please note: I posted this question about an hour ago on my account (I just made it as I am new to the site). I revisited my post and saw that I had not given definitions of what I was asking (I thought they were common notations) and it would not let me edit the post for some reason so I will ask here now and hopefully someone can delete the other thread.  How to prove for a finite group $G$ that $|\langle g \rangle|=o(g)$?  Here are the definitions:  Let $G$ be a finite group and $g \in G$  $o(g)$ is the smallest $m \in \Bbb{N}$ such that $g^m=e$ (the identity element of the group). (If such an $m$ exists)  $\langle g \rangle=\{g^m : m \in \mathbb{Z}\}$  I really don't know how to show that this is true I tried to say let $o(g)=m$ and then show that $|\langle g \rangle|$ has exactly $m$ elements but I wasn't even sure it did because it would contain the elements $g^0,...g^{m-1}$ so that would mean it's true but what about $g^{-1}$ and the other elements with negative coefficients so it seems like it would actually be bigger than $m$?  Thanks. Can I choose to use only Shapiro-Wilk? Copy maintenance plans to a different server Is there a way to copy maintenance plans from one SQL Server 2012 to another? Both servers are not accessible via the same copy of Management Studio at the same time (on different networks). This is problem 6.2 from the 3rd edition of Principles of Mathematical Analysis.      Problem 6.2: Suppose $f\geq 0$, f is continuous on $[a, b]$, and $\int_a^b f(x) \, dx = 0$. Prove that $f(x)=0$ for all $x \in [a, b]$.   I'm looking for a critique of my proof. It's a pretty easy problem, but I am always wary of making too bold of assumptions, especially on these low level/fundamental proofs. I'll be using Rudin's notation and refer to theorems from the text (If I should include the text of each theorem, feel free to leave a comment... I'm lazy but could probably use the TeX practice :p)  Proof: Assume, for contradiction, that $f&gt;0$. Then, for any partition $P$ we have the Lower Riemann Sum: $L(P, f)=\sum_{i=1}^n m_i \, \Delta x_i$. At least one $\Delta x_i$ must be positive, since $a &lt; b$, and each $m_i$ must be positive since we have $f&gt;0$ by assumption, so certainly $\sup f &gt; 0$. That means $L(P, f)&gt;0$. Thus, we have: $$0 = 0(b-a) &lt; L(P,f)\leq \sup L(P, f) = \inf U(P,f) =L$$ where the last string of equalities holds because our function is continuous on a compact interval, so is integrable by theorems 6.8 and 6.6. So our integral has value $L&gt;0$. This is in contradiction to our given assumption that $\int_a^b f(x) \, dx = 0$, so we must have that $f=0$ on $[a, b]$. $\Box$  So, I am wondering if my proof is correct (and is presented well). Also if someone could enlighten me as to what Rudin means when he say "Compare this with exercise 1," I'd be appreciative. Is it a hint or is there something else he expects you to notice? there are a lot of things I could compare :)...  Exercise 6.1: Suppose $\alpha$ increases on $[a, b]$, $a \leq x_0 \leq b$, $\alpha$ is continuous at $x_0$, $f(x_0)=1$, and $f(x)=0$ if $x\neq x_0$. Prove that $f$ is Riemann-Stieltjes Integrable and that $\int f \, d\alpha = 0$ Index notation Lorentz transfromation matrix Prove that $g$ is tangent to the graph of $f$ Access denied when creating keystore for Android app We know that $1331$ is divisible by $11$. As per the $11$ divisibility test, we can say $1331$ is divisible by $11$. However we cannot get any quotient. If we subtract each unit digit in the following way, we can see the quotient when $1331$ is divided by $11$.  $1331 \implies 133 -1= 132$ $132 \implies 13 - 2= 11$ $11 \implies 1-1 = 0$, which is divisible by $11$.  Also the quotient is, arrange, all the subtracted  unit digits (in bold and italic) from bottom to top, we get $121$. Which is quotient. I want to know how this method is working? Please write a proof. Log color bar/meta data in PGFPLOT