I am an Indian Citizen currently on H4 visa in USA. I will be travelling from Columbus to New Delhi (India) via amsterdam. Please help me out with information if I will need a transit visa to go via amsterdam or not. I have a 3hr stopover in amsterdam. I have a valid Indian Passport but my currently stamped H4 visa is expired. I have a visa approval document which I will use to get a H4 visa stamping in India. Please let me know if I need a Transit Visa in amsterdam based on my situation.
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
The most efficient method to obtain the total entries into a mysql table As you can see, objects are falling down when I run the game. Ground is unable to stop those obstacles. Obstacles are rapidly traveling through y axis. I tried by freezing y axis. And, unchecked Use Gravity. I tried by checking Is Kinematic also. But, if I freeze y axis. Than, obstacles completely freeze through y. If there was no ground than the objects don't fall. Same thing happen when I unchecked Use Gravity. I want those obstacles to move if Player hit them. How to stop those obstacles from falling down?   Info : I have the following data structure (a list of lists)  [  ['4', '21', '1', '14', '2008-10-24 15:42:58'],   ['3', '22', '4', '2somename', '2008-10-24 15:22:03'],   ['5', '21', '3', '19', '2008-10-24 15:45:45'],   ['6', '21', '1', '1somename', '2008-10-24 15:45:49'],   ['7', '22', '3', '2somename', '2008-10-24 15:45:51'] ]   I would like to be able to   Use a function to reorder the list so that I can group by each item in the list. For example I'd like to be able to group by the second column (so that all the 21's are together)  Use a function to only display certain values from each inner list. For example i'd like to reduce this list to only contain the 4th field value of '2somename'    so the list would look like this   [      ['3', '22', '4', '2somename', '2008-10-24 15:22:03'],       ['7', '22', '3', '2somename', '2008-10-24 15:45:51'] ] Evaluate $\int_0^\infty \frac{(\log x)^2}{1+x^2} dx$ using complex analysis How do I compute      $$\int_0^\infty \frac{(\log x)^2}{1+x^2} dx$$   What I am doing is take   $$f(z)=\frac{(\log z)^2}{1+z^2}$$  and calculating   $\text{Res}(f,z=i) = \dfrac{d}{dz} \dfrac{(\log z)^2}{1+z^2}$ which came out to be $\dfrac{\pi}{2}-\dfrac{i\pi^2}{8}+\dfrac{i\pi}{2}$  Im not too sure how to move on from here. the given answer is $\dfrac{\pi^3}{8}$  Any help will be appreciated. thank you in advanced. Reviewer Stats showing wrong count I have totally reviewed 716 suggested edits, but it shows I've approved 486 suggestions and rejected 228.     I searched about it on meta. But, can't get solution. I thought that some of my reviewed posts might get deleted. So, I went to the review history and found      .   It should be a bug. Ubuntu 20.04 interface font too small after restart, even with high scaling factor So I was configuring VS code on my Notebook when suddenly I noticed that my interface font got really small on my desktop, terminal and files. I use Gnome Tweaks Tool to increase my scaling factor to 1,15 , but, even though it was active, the font stayed tiny. The solution I found was moving my scaling factor, which instantly fixed my font issue, however, every time I restart my Notebook the font gets tiny again and I have to repeat the process. I tried reseting my font configuration using this command, but had no success. gsettings reset org.gnome.desktop.interface text-scaling-factor  I also tried using the command dconf reset -f /  Finally, I tried using dconf-editor, but still had no success altering the font rendering DPI or changing the scaling factor. All of the steps I mentioned fixed my fonts temporarily, but the issue still persists when I restart my Notebook I am out of ideas and even considered getting a fresh Ubuntu install by now... My video card: NVIDIA GeForce GTX 1050 GPU How to use THAT and WHO Left-align all equations in a block align environment without any explicit alignments points (given by &amp;) right justifies the equations in the block. They can be left justified by putting &amp; at the beginning of each equation. Is there any way to left justify them without starting &amp;-s? Maybe some special environment or option? It seems to be an extra work to tell the compiler again and again that I want left alignment on each line. Why is conservation of angular momentum considered a law? We know that angular momentum is defined as the cross product of position and linear momentum. By taking the time derivative, we can deduce that the time rate of change of the angular momentum equals the net torque.  Then why is the conservation of angular momentum considered a law, when we can easily show it is conserved when no net torque is applied, by using Newton's laws?  It truly confuses me. xargs and vi - "Input is not from a terminal" How do I count the number of occurrences of a char in a String? I have the string   a.b.c.d   I want to count the occurrences of '.' in an idiomatic way, preferably a one-liner.  (Previously I had expressed this constraint as "without a loop", in case you're wondering why everyone's trying to answer without using a loop). How can I recover files from partitioned disk? How to see time stamps in bash history? Is there any way I can see at what time the commands were executed from the bash history? We can see the order but is there any way I can get the time also?  Bottom-Line: Execution time in the Bash history Dupehammer creates and deletes a comment, causing notifications to go out Mount error: "unknown filesystem type 'exfat'" When trying to mount an exfat filesystem, I get the following error:  Error mounting /dev/sda6 at /media/gkp/Backup: Command-line  `mount -t "exfat" -o "uhelper=udisks2,nodev,nosuid" "/dev/sda6" "/media/gkp/Backup"'  exited with non-zero exit status 32: mount: unknown filesystem type 'exfat'   Exfat is used on some USB sticks and camera sd cards. What can I do to mount this type of filesystem? With a macro such as:  \def\naive{na\"{\i}ve}   I find that the space which I would hope to follow it, is absent. So, with  the \naive approach   I get     the naïveapproach   in the output. How do I bring back the space? Attempt to de-reference a null object: Trigger There were custom validation error(s) encountered while saving the affected record(s). The first validation error encountered was:      Apex trigger updatequotestatus caused an unexpected exception, contact your administrator: updatequotestatus: execution of AfterInsert caused by: System.NullPointerException: Attempt to de-reference a null object: Trigger.updatequotestatus line 5, column 1.   Error Occured at Line:     if((t.what.getsobjecttype() == quote__c.sobjecttype) &amp;&amp; (t.subject.substring(0,5) == 'Email')  trigger updatequotestatus on task (after insert, after update){     Set&lt;Id&gt; quoteIds = new Set&lt;Id&gt;();     List&lt;quote__c&gt; quotes = new List&lt;quote__c&gt;();      for(task t:trigger.new){         if(t.whatId!=null){             if((t.what.getsobjecttype() == quote__c.sobjecttype) &amp;&amp; (t.subject.substring(0,5) == 'Email')){                 quoteIds.add(t.whatId);             }         }     }      for(quote__c q:[select StageName__c from quote__c where Id IN : quoteIds]){         quote__c qt = new quote__c();         qt.Id = q.Id;         qt.StageName__c = 'Proposal Sent';         quotes.add(qt);     }      if(quotes.size()&gt;0){         update quotes;     } } Is the cardinality of the Cartesian product of two equinumerous infinite sets the same as the cardinality of any one of the sets? I couldn't find this explicitly stated in any handout or text. This certainly seems to be true from the examples I have seen:  The Cartesian product of two infinitely countable sets is again infinitely countable. The Cartesian product of two sets with cardinality of continuum again has cardinality of continuum. How to exit early on pipe close? I use golang for writing programs that are too complex to express as bash functions. The programs read stdin line by line and write modified output to stdout.  The problem with this iterating over all the lines in stdin approach, is that it doesn't exit early. For example, the following command will process all the lines instead of just 10:  cat largefile | custom-program | head -n 10   How do the native unix application manage to exit early and how can I do the same in my custom scripts? What is the optimal path between $2$ fixed points around an invisible obstructing wall? Every day you walk from point A to point B, which are $3$ miles apart. There is a $50$% chance each walk that there is an invisible wall somewhere strictly between the two points (never at A or B). The wall extends $1$ mile in each direction perpendicular to the line segment (direct path) between A and B, and its position can be at any random location between the two points. That is, it can be any distance between A and B such as $0.1$ miles away from A, $1.5$ miles away, $2.9$ miles away.... You don't know if the wall is present or where it is until you walk into it.  You must walk around the wall if present as there is no other way to circumvent it.  Assume the wall is negligible thickness (like a force field), all ground is perfectly flat, and the y coordinates at both A and B are $0$ (although I don't think the optimal path will change much if they weren't).  What strategy minimizes the average expected walk distance between A and B?  How do we know for certain this strategy yields the shortest average walking distance?  To get the $100$ bounty points, I would like a convincing argument from you as to why you feel your solution is optimal and cannot be beaten.  For those of you using computer simulation, anything reasonably close to optimal is a candidate for the bounty.   Can anyone beat the optimal solutions submitted so far?  There are still a few days to try.  Even a slight beat (if not due to roundoff error or some other error) would help prove previous solutions are non-optimal.  You can just use the table of $31$ points (x-y coordinates) and compute that path length and then if you can find better then I will accept that answer.  I think by Sunday night I may have to award the bounty otherwise it may get auto-awarded.