I have an upcoming trip to London from Washington DC via Iceland. I hold an Indian passport, H1B visa in US, and visitor visa for UK. I have booked WOW air and it has a stop in KEF airport in Iceland. I have researched the immigration websites and saw that I may not need a transit visa. I did not get any information from the embassies through email and phone calls. Can anyone who has done this in the past, please advise on this?
I found many related questions on this site but I am still not sure about the rules. How can I decide if I need a visa to transit? Schengen members as of May 2021 are as follows:  Austria Belgium Czech Republic Denmark (excluding Greenland and the Faroe Islands - but an open border with the Schengen Area is maintained) Estonia Finland France (excluding overseas departments and collectivities) Germany Greece Hungary Iceland Italy Latvia Liechtenstein Lithuania Luxembourg Malta Netherlands (excluding Aruba, Curaçao, Sint Maarten and the Caribbean Netherlands) Norway (excluding Svalbard) Poland Portugal Slovakia Slovenia Spain (except Ceuta and Melilla) Sweden Switzerland
I have a complex embedded Linux software running on a gentoo derivative, on which a certain piece of code gets executed regularly every ~84 minutes. Sweeping through the main code to find places where this code might get executed was unsuccessful, and crontab also seems no possible explanation.   My question: Is it possible, by modifying the code in question, to find out which other process/code/file/service started it in the first place? Are there some information in the /proc directory I can use? Or is it impossible to find out the process that executed the given code? How to add and sync folders outside SkyDrive folder? I have folders with documents all over my hard drive, some which I would like to include in SkyDrive without moving them into the SkyDrive folder.  E.g. my SkyDrive folder is in C:\Users\Name\SkyDrive, but I have some files in C:\Users\Name\SyncMePlz that I also would like to be synced with SkyDrive so that I can reach them from other devices.  How can this be achieved? Seem to have lost 4 Silver badges and 10 Bronze badges Creating Centrelines from Road Polygons/Casings using ArcGIS Desktop? I want to create center lines from road polygons.   Are there any automated tools in ArcGIS for Desktop to do this?  I am including a Screenshot of my vector file below. Can anybody explain the UNABLE_TO_LOCK_ROW error? how to sort file by DD-MM-YYYY dates in a file containing :  ... 18-11-2018:othercharacters 10-11-2018:othercharacters 03-10-2018:othercharacters 30-10-2018:othercharacters 27-09-2018:othercharacters 03-12-2018:othercharacters ...   the command :  sort -t- -k2 -k1    does not sort by date, what am I missing ? Add AD users to sudo group not working | CentOS 6.7 Why is $\mathbb{C}[x,y]/(y^2 - x^3 + 1)$ normal? $f(z)$ and $\overline{f(\overline{z})}$ simultaneously holomorphic basic geometry angle problem Two straight lines, AB and AD, lie in the same vertical plane. AB makes an angle of 25 degrees with the horizontal, and AD makes 32 degrees with the vertical. What is the angle between AB and AD?  The answer is 33 degrees or 93 degrees.   I cannot visualize what this question is asking. It says both AD and AD lie on the same vertical plane, then immediately says AD makes 32 degrees with the vertical. Isn't this a contradiction? How does a cell phone charger work? I have studied that there is a transformer which steps down the ac voltage after then bridge rectifier to convert into ac to dc and then given to filter, this is what I have learnt in books, but when I open a mobile charger I couldn't figure it out how it actually works? This is a doubt from Milnor's "Topology from a Differentiable Viewpoint".     For a smooth $f:M\to N$, with $M$ compact, and a regular value $y\in N$, we define $n(f^{-1}(y))$ to be the number of points in $f^{-1}(y)$. It is easy to see that $n(f^{-1}(y))$ is finite. It can also be seen that $n(f^{-1}(y))$ is locally constant; i.e. there is a neighbourhood of $y$ such that for every point $y'$ in that neighbourhood, $n(f^{-1}(y'))=n(f^{-1}(y))$.   The proof for the statement in bold is the following:     Let $x_1,x_2,\dots,x_n$ be the points of $f^{-1}(y)$, and choose disjoint neighbourhoods $U_1,U_2,\dots,U_n$ of these points, which are mapped diffeomorphically into neighbourhoods $V_1,V_2,\dots,V_n$ of $y$. The required neighbourhood is $(V_1\cap V_2\cap\dots V_n)-f(M-U_1-U_2-\dots U_n)$.   I don't understand how $(V_1\cap V_2\cap\dots V_n)-f(M-U_1-U_2-\dots U_n)$ is open. I know that $(V_1\cap V_2\cap\dots V_n)$ is open. However, how can one prove that $f(M-U_1-U_2-\dots U_n)$ is closed? I can see this working if $f$ is surjective, but not otherwise. Why is it impossible, without attempting I/O, to detect that TCP socket was gracefully closed by peer? As a follow up to a , I wonder why it is impossible in Java, without attempting reading/writing on a TCP socket, to detect that the socket has been gracefully closed by the peer? This seems to be the case regardless of whether one uses the pre-NIO Socket or the NIO SocketChannel.  When a peer gracefully closes a TCP connection, the TCP stacks on both sides of the connection know about the fact. The server-side (the one that initiates the shutdown) ends up in state FIN_WAIT2, whereas the client-side (the one that does not explicitly respond to the shutdown) ends up in state CLOSE_WAIT. Why isn't there a method in Socket or SocketChannel that can query the TCP stack to see whether the underlying TCP connection has been terminated? Is it that the TCP stack doesn't provide such status information? Or is it a design decision to avoid a costly call into the kernel?  With the help of the users who have already posted some answers to this question, I think I see where the issue might be coming from. The side that doesn't explicitly close the connection ends up in TCP state CLOSE_WAIT meaning that the connection is in the process of shutting down and waits for the side to issue its own CLOSE operation. I suppose it's fair enough that isConnected returns true and isClosed returns false, but why isn't there something like isClosing?  Below are the test classes that use pre-NIO sockets. But identical results are obtained using NIO.  import java.net.ServerSocket; import java.net.Socket;  public class MyServer {   public static void main(String[] args) throws Exception {     final ServerSocket ss = new ServerSocket(12345);     final Socket cs = ss.accept();     System.out.println("Accepted connection");     Thread.sleep(5000);     cs.close();     System.out.println("Closed connection");     ss.close();     Thread.sleep(100000);   } }   import java.net.Socket;  public class MyClient {   public static void main(String[] args) throws Exception {     final Socket s = new Socket("localhost", 12345);     for (int i = 0; i &lt; 10; i++) {       System.out.println("connected: " + s.isConnected() +          ", closed: " + s.isClosed());       Thread.sleep(1000);     }     Thread.sleep(100000);   } }   When the test client connects to the test server the output remains unchanged even after the server initiates the shutdown of the connection:  connected: true, closed: false connected: true, closed: false ... Does disabling root login enhance security? Help with this trigonometry problem I'm desperatly confused by notations and formulations so if someone could clarify the following things a little Í would be deeply grateful. The Lie algebra $\mathfrak{so}(1,3)_+^{\uparrow}$ of the proper orthochronous Lorentz group $SO(1,3)_+^{\uparrow}$ is given by \begin{equation} [J_i,J_j]=i \epsilon_{ijk} J_k \end{equation} \begin{equation} [J_i,K_j]=i \epsilon_{ijk} K_k \end{equation} \begin{equation} [K_i,K_j]=- i \epsilon_{ijk} J_k \end{equation} We can now define new generators with the old ones $N^{\pm}_i= \frac{1}{2}(J_i \pm i K_i)$ which satisfy \begin{equation} [N^{+}_i,N^{+}_j] = i \epsilon_{ijk} N^{+}_k ,\end{equation} \begin{equation} [N^{-}_i,N^{-}_j] = i \epsilon_{ijk} N^{-}_k ,\end{equation} \begin{equation} [N^{+}_i,N^{-}_j] = 0. \end{equation} where we can see that $N^{+}_i$ and $N^{-}_i$ make up a copy of the Lie algebra $\mathfrak{su}(2)$ each. My problem is to get what is going one here mathematically precise. Are the following statements correct and if not why:  When we build the new operators from the old generators we complexified $\mathfrak{so}(1,3)_+^{\uparrow}$ \begin{equation}(\mathfrak{so}(1,3)_+^{\uparrow})_\mathbb{C} = \mathfrak{so}(1,3)_+^{\uparrow}\otimes \mathbb{C} \end{equation} We saw that $\mathfrak{so}(1,3)_+^{\uparrow})_\mathbb{C}$ is isomorph to two copies of the complexified Lie algebra of $\mathfrak{su(2)}$: $(\mathfrak{so}(1,3)_+^{\uparrow})_\mathbb{C} \simeq \mathfrak{su(2)}_{\mathbb{C}} \oplus \mathfrak{su(2)}_{\mathbb{C}} $. Where exactly did we need that $\mathfrak{su(2)}$ is complexified here? The Lie algebras defined by $N^{\pm}_i$ are exactly those of $\mathfrak{su(2)}$ and we never use complex linear combination of $N^{\pm}_i$ or am I wrong here? $\mathfrak{su(2)}_{\mathbb{C}}$ is isomorph to $(\mathfrak{sl}(2,\mathbb{C}))_\mathbb{C}$: \begin{equation}\mathfrak{su(2)}_{\mathbb{C}} \simeq (\mathfrak{sl}(2,\mathbb{C}))_\mathbb{C} \end{equation} Here $(\mathfrak{sl}(2, \mathbb{C}))_\mathbb{C}$ denotes the complexified Lie algebra of $SL(2,\mathbb{C})$ Is $(\mathfrak{so}(1,3)_+^{\uparrow})_\mathbb{C} \simeq (\mathfrak{sl}(2, \mathbb{C}))_\mathbb{R}$ correct?  Here $(\mathfrak{sl}(2, \mathbb{C}))_\mathbb{R}$ denotes the real Lie algebra of $SL(2,\mathbb{C})$ Is $(\mathfrak{so}(1,3)_+^{\uparrow})_\mathbb{C} \simeq (\mathfrak{sl}(2, \mathbb{C}))_\mathbb{C} \oplus (\mathfrak{sl}(2, \mathbb{C}))_\mathbb{C}$ correct?  I looked this topic up in different books and each seemed to state something different. One book even used three differrent versions of $\mathfrak{sl}(2,\mathbb{C}) $ namely: $\mathfrak{sl}(2,\mathbb{C}) $, $(\mathfrak{sl}(2,\mathbb{C}))_\mathbb{C}$ and $(\mathfrak{sl}(2,\mathbb{C}))_\mathbb{R}$.  states simply that $\mathfrak{sl}(2,\mathbb{C}) $ is the complexification of $\mathfrak{su(2)}$ without making any reference to $SL(2,\mathbb{C})$ which does not help me either. Any help would be great. Something very odd is happening here.   I have a query that looks like this.  SELECT CAST(FT.DOP AS SMALLINT) FROM TRACKING_DATA WHERE date &gt; @mydate and identifier = 0000000000   When run as a raw query it returns data just fine.  When i place it in a stored procedure that alters the where clause it throws this error.  Msg 244, Level 16, State 2, Procedure myprocedure, Line 107 [Batch Start Line 2] The conversion of the varchar value '58629' overflowed an INT2 column. Use a larger integer column.   So here is the oddity. I go through all the possible data for that where clause with a query like this.  SELECT DISTINCT DOP FROM TRACKING_DATA where identifier = 000000000000   and  SELECT DISTINCT CAST(DOP AS smallint) FROM TRACKING_DATA where identifier = 000000000000   And this is what i get back.  17 12 9 19 8 14 6 16 11 13 7 10 0 18 5 15 4   Nowhere does it have anything remotely too large for a SMALLINT. So i thought, ok maybe its a non-printable ASCII character. But i can't find any.  I'm a little perplexed at the moment. It runs find as a raw query, explodes as a procedure and all possible data based on the where is valid. My only suspicion is that the query plan is doing something odd with filtering or maybe runs with different validation when run as a procedure. command not running in cron (systemctl suspend) Where do I find the client id and client secret of an existing connected app? How to find roots of $X^5 - 1$? How to find roots of $X^5 - 1$? (Or any polynomial of that form where $X$ has an odd power.)