How many times can one enter Thailand with a tourist visa in these circumstances?
Thailand visa exemption: any rule limiting number of entries per year?
The result set has no current row while using JDBC I am using the following code in selenium, but I am not able to retrieve data from database. I am getting the errors "The result set has no current row"  My code is   public class Auto {      public static void main(String[] args) throws InterruptedException, SQLException, ClassNotFoundException, InstantiationException, IllegalAccessException     {           Class.forName("com.microsoft.sqlserver.jdbc.SQLServerDriver");         System.out.println("Driver loaded");           Connection con=DriverManager.getConnection("jdbc:sqlserver://192.168.*****\\SQLEXPRESS/*****_DW/EPS:****;user=******;password=******; ");          System.out.println("Driver loadedd");       java.sql.Statement stmt= con.createStatement();     ResultSet rs=stmt.executeQuery("select * from [*****_DW].[dbo].dim_grantee ");      System.out.println("Query executed");      while (rs.next());     {         String Name=rs.getString("NAME");          System.out.println("Name is");     }   } Can I boot memtest86+ if I'm using UEFI? Downloaded the Ubuntu 16.04.2 .iso install disk and flashed it onto a USB stick.  Booting on the USB stick, there is no memtest86+ option (along with "Try Ubuntu").  Is there a way to add it to the install options?  (it's for a UEFI boot PC running normally Windows, its owner does not want to install Ubuntu. "memtest86+" is completely free (unlike "memtest86"), but is quite old, and does not offer a UEFI boot - this is why having it within the Ubuntu options makes things easier) Why aren't there any fighter carriers in the Star Trek universe? All of the ships of every species seem to be medium to large vessels with multiple crew members. Why aren't there single fighter craft and carrier ships to transport them in mass?  I've just noticed the difference between Battlestar Galactica and Star Trek, where the former has primarily aircraft carriers, and the latter has battleships.   Wouldn't a huge fleet of small fighters be extremely maneuverable and possibly stealthy?  Update:  For clarity, my question is not about the Federation and their choice of ships, but the universe at large. I would think there would be some diversity in space warfare strategy, such as huge armadas of fighters with base stations / carriers. Number of Homomorphisms from $\Bbb{Z}_m$ to $\Bbb{Z}_n$ This question coutesy of Allan Clark's "Elements of Abstract Algebra" (60$\zeta$).   Find the number of homomorphisms from $\Bbb{Z}_m\to \Bbb{Z}_n$ as a function of $m$ and $n$.  This is stumping me, can anyone help? Short Story about interminable rain on Venus Proving that free modules are flat (without appealing projective modules) Suppose $R\neq 0$ is a commutative ring with $1$. Let $M$ be a free $R$-module. I would like to prove that $M$ is a flat $R$-module. Everywhere I have looked (mostly online) this is proved by first proving that every free module is projective, and then proving that every projective module is flat. Unfortunately, Atiyah &amp; Macdonald's "Introduction to Commutative Algebra" (Chapter 2) does not discuss projective modules. But the result that every free module is flat comes very handy in the exercises.   So my question is,     Is it possible to prove that every free module is flat just by   definitions and without appealing to projective modules?   Thanks! I have keypair (u,r), and two pieces of data, X and Y.  I reveal X publicly but keep Y secret. Y has high entropy.  I then concatenate X and Y, into Z.  I encrypt Z, into "encrypt(Z,u) = Q". r is needed to decrypt Q back into Z.  Later, (when it doesn't matter), r will be revealed and everyone will decrypt Q into Z. At that point, everyone will know that, all along, Q "contained" X. Can I prove that Q contains X before r is revealed (including interactive zero-knowledge proofs)? Parser for C# Which parsers are available for parsing C# code?  I'm looking for a C# parser that can be used in C# and give me access to line and file informations about each artefact of the analysed code. Facebook: Ways to preserve image quality of uploaded images? After uploading an image, Facebook converts it to a new image.  Their conversion process introduces artifacts and mottling to the magenta-ish parts of the image.  Original image:   Facebook's conversion:   Are there ways to preserve the original quality of this image and have the image appearance on Facebook reflect more of the original quality? "Heard me [infinitive]" vs. "heard me [present participle]"             At that time, you wouldn't have heard me talk about it.   At that time, you wouldn't have heard me talking about it.         At that time, you wouldn't have heard me condemn it.   At that time, you wouldn't have heard me condemning it.         Which one of the above sentences are incorrect and why? Cyclic vectors in a real vector space Let $V$ be an n-dimensional vector space over $\mathbb{R}$ and $T:V \rightarrow V$ be linear. Call a vector $v \in V$ cyclic if $V$ is spanned by $\{v, \ Tv, \ T^2v,..\}$.  Question:  Show that $v$ is cyclic for $T$ then there is some $k \geq 1$ such that   $$B=\{v, \ Tv,..T^{k-1}v \}$$ is linearly independent in $V$ and that $T^kv$ lies in  the span of $B$.  Thoughts:  If we suppose that no such $k$ exists, then every subset of the form $\{v, \ Tv,..T^{l-1}v \}$ is linearly dependent, or it is linearly dependent with $T^lv$ not lying in it span.  There are in effect then two cases to consider.  Suppose every subset of the form $\{v, \ Tv,..T^{l-1}v \}$ is linearly dependent. Then $T^{l-1}$ can be expressed as a linear combination of $v,...,T^{l-2}v$. Now, $\{v, \ Tv,..T^{l-2}v \}$ is also linearly dependent by assumption and so we can express $T^{l-2}$ as a linear combination of  $v,...,T^{l-3}v$ etc... Continuing in this way, we show that $T^{l-1}v= \lambda v$ for some $\lambda \in \mathbb{R}$. Thus $$B=\{ \mu v \ | \ \mu \ \text{is an eigenvalue of} \ T^mv \ \text{for some} \ m \}$$ This is 'at best' countably infinite, and therefore could not span $V$ even if it were 1-dimensional, wince our base field is $\mathbb{R}$, which is uncountable.  Suppose then that $B$ is linearly independent for some $k$ but that $T^kv$ does not lie in its span. I can't see how to progress this argument.  Note: This question is for second year Undergraduates, and I think there must be some more simple approach; even the first part surprises me if we need to argue using the uncountability of $\mathbb{R}$, so any alternative approaches are also appreciated. The difference between 'credit' and 'accredit'? Both verbs seem to mean the same thing -- to attribute 'X' to Mr. 'Y'. On looking it up, I found:  credit - publicly acknowledge a contributor's role in the production of (something published or broadcast).  accredit - give credit to (someone) for something.  Am I overthinking this, or is there really a difference I should know of? The client can do several actions per frame, for instance, requesting a movement, shooting etc. Should i send a packet to the server for each action the client performed during the frame, or should i stack them in an unique packet and send it at the end of the frame?  EDIT: i'm using Jmonkeyengine and the provided network API SpiderMonkey. Alternating sum of binomial coefficients multiplied by (1/k+1) I'm trying to prove that  $$\sum_{k=0}^n {n \choose k} (-1)^k \frac{1}{k+1} = \frac{1}{n+1}$$  So far I've tried induction (which doesn't really work at all), using well known facts such as  $$\sum_{k=0}^n {n \choose k} (-1)^k = 0$$  and trying to apply identities like  $${n \choose k} = {n-1 \choose k-1} + {n-1 \choose k}$$  Would anyone be able to point me towards the right method? Should I be looking to apply an identity or is there a method I'm missing? Check for column name in a SqlDataReader object Why does printf() not print anything before sleep()? What evidence is there that 'to' belongs to any particular part of speech? Reopen note:  There is a quite finite and modest amount of evidence in the literature about this issue, which members can record here as they see fit. Less than there is for example about what a noun is or what a verb is, or how to tell what the Subject of a sentence is. It's a simple question, that people need to be able to get answered on a site such as this. It is of continuing interest as more recent questions such as  attest to. The fact that people disagree about the outcome of the evidence does not mean that there is too much evidence to be documented. Quite the reverse. They disagree because there is relatively little evidence altogether. However, it is seriously interesting evidence.   The question   What part of speech is to as in:   I need to know. To err is human, to forgive divine. What am I to do?   This question is not really about the difference in meaning between the examples. It is a question about what grammatical or syntactic reasons we have to classify this item as a particular part of speech. If arguing that it is 'its own part of speech', I'd like to know what grammatical - but not historical - reasons you have for your claim.   Just to clarify, I'm not asking about what assignment any particular authority or publication gives it. I'm interested to know the reasons why. Your own personal insights are also very welcome.  If you're a grammar anorak - like me - then you may want a list of the contenders out there from other grammarians. In no particular order:   preposition subordinator non-finite auxiliary verb modal verb inflectional element   Can you help? Hiding and redirecting extensions on my webpage The migration is from the local environment to the production environment. The production environment has run some time and created a lot of articles.   In order to add new things to my site, I added a custom theme and installed CCK, Views and other modules in my local test environment. Now that the local test environment is finished, how do I migrate it to the production environment, without destroying the content of its database? Now that  is in effect, people who have visited Iraq, Syria, Iran, or Sudan since 2011 are banned from entering the US under the Visa Waiver Program. However it's unclear to me how could the US officials prove one has set foot in those countries, unless:   There's a stamp in one's passport indicating so, which can be side-stepped by getting a fresh passport One mentions the fact on the ESTA application form, which is obviously easy to avoid   Is there any other way the US might be able to identify such individuals?  NB: I'm not eligible for the VWP myself and don't plan to travel to the four countries above, so it's a purely theorethical question