Got my B1/B2 visa refused 20 days ago under 214-B. He just asked normal questions like why, with whom, for how many days, how much experience I have and how much I earn... and refused it.  I have 1.8 yrs experience and have a package of 240000 INR per year. I needed to re-apply asap.  What should be the best route I take to get it approved? When can be the best time? Will the bond of 3 yrs work? or what type of strong evidences I can show?
I went for B1 U.S. Visa at the U.S. Embassy in Delhi.   Interviewer: *Good Morning*. Me: *Good Morning* Interviewer: *What is your designation?* Me: *I am a Software Engineer.* Interviewer: *What is the name of your company?* Me: *It is XXX (I replied).* Interviewer: *What is the name of your client?* Me: *It is YYY (I replied).* Interviewer: *Have you ever been to U.S. before?* Me: *NO* Interviewer: *Have you ever been abroad before?* Me: *NO*   At this point he rejected my Visa with letter mentioning 214 (b) as the reason. I don't know why he actually rejected it.  But, I have decent 2+ years of experience with my company. And, I was going on a business meeting with the client. I would have come back after 2 weeks.  I don't know if re applying will help.
Hyperlinks clicked in evince document viewer are not opening, any ideas on how to fix? As it was instructed in another thread here in the forums, I opened the /usr/share/applications/mimeinfo.cache file to check for correct references. And noticed this doesn't seem to be the problem, there even are 3 optional browsers to use.  x-scheme-handler/http=google-chrome.desktop;chromium-browser.desktop;firefox.desktop; x-scheme-handler/https=google-chrome.desktop;chromium-browser.desktop;firefox.desktop;   I already checked that the programs are correctly named, using the "which" command in the terminal, like this:  $ which google-chrome $ /usr/bin/google-chrome   So google-chrome should be the first option and yet the order to open a url doesn't seem to be arriving to the program, not even to the 2nd or 3rd option for that matter anyways.  Also, the 'Get help online...' command in the 'Help' menu doesn't work. So it is not a problem with the specific document file either.  I'm running Ubuntu 12.04 LTS. If you need to ask for more relevant details, please do. It would be nice to have various opinions on how to solve this, thank you :-)  UPDATE: I ran evince from the terminal as asked. This is what I'm getting when trying to open a link:  /opt/google/chrome/google-chrome: line 42: /opt/google/chrome/chrome: Permission denied /opt/google/chrome/google-chrome: line 42: /opt/google/chrome/chrome: Success   Should I try the fix you suggested even if my error log is different?  UPDATE: Tried @maggotbrain's solution and BINGO, now I can study pdf references faster thanks to you bro! I am stuck with the proof of below expression;  "If F is an infinite field, then no infinite subgroup of F* (the multiplicative group of F) is cyclic."  anyone can help? Finding an Inverse Function and Composition of Functions? Derivative of determinant of a matrix I would like to know how to calculate:  $$\frac{d}{dt}\det \big(A_1(t), A_2(t), \ldots, A_n (t) \big).$$ After installing Windows 10 on my  it took my user name 'Jeremy' and created a user folder named C:\Users\jerem.  I want to rename the folder C:\Users\Jeremy.  does not work. There are a couple of reasons.   OneDrive is now a fully integrated part of the OS, and it completely breaks.  A find/replace in the registry seems to work, but it's hard to be confident in that approach. When the computer is rebooted, the TabletInputService writes a TextHarvester.dat file to the old user profile location (creating it if needed). This makes it impossible to keep the folder deleted. An old  doesn't work. This issue also causes an error message to pop up every time the computer boots. Make square image Cannot dismiss scrollbar in code box, blocks view This question is a duplicate of  (but this question can't be marked as a duplicate because that question is on meta.stackoverflow.com, and this question is on meta.stackexchange.com).  I'm seeing a bug on stackoverflow.com. I'm not sure if the culprit is Stack Overflow, Google Chrome, or macOS.  (Below I refer to a "code box". By that I mean some text that begins with 4 spaces when editing a question or answer.)  When I hover over a code box that contains one long line of code, a horizontal scrollbar appears. When I stop hovering over the code box, very frequently (maybe 3 out of 4 times) the scrollbar does not disappear. Clicking elsewhere on the page also does not dismiss the scrollbar. The only way to dismiss it is to refresh the page.  ...After experimenting more, it appears to always happen if I enter the box from below, but not always when I enter from above. It seems to be triggered by hovering over the lower half of the box.  Also if I enter from the top and scroll to the right, then until I refresh the page again that scrollbox will behave normally (only show a scrollbar when scrolling, and disappear after). In that case the scrollbar also has a different appearance, being much less tall (maybe a quarter of the height of the code box rather than half as tall).  Further, if I get a box and scrollbar into that functional state and then hover over the lower part of the box for a bit, then sometimes eventually it will break and stay broken until refresh again.  And in any case hovering over the lower part of the box causes the scrollbar to get taller.  Here is a screenshot of the issue:        Google Chrome 71.0.3578.98 (Official Build) (64-bit)  macOS High Sierra 10.13.6  Here is a code box that repros the issue for me:  fooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo   Here is another:  foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo foo Why is there no analog for $\Theta_\text{QCD}$ for the weak interaction? Is this topological term generated? If not, why not? Is this related to the fact that $SU(2)_L$ is broken? numbers of pages don't appear on pdf printed Celebrating the same new year several times over? Column validation for US phone number format Difference between "I'm home" vs "I'm at home" What's the difference between these two sentences? And which one's grammatically correct? Calculate a determinant with pattern Nested sequences of balls in a Banach space This seems to be a fairly easy question but I'm looking for new points of view on it and was wondering if anyone might be able to help.  (By the way- this question does come from home-work, but I've already solved and handed it, and I'm posting this out of interest, so no HW tag.)     Let $B_n=B(x_n,r_n)$ be a sequence of nested closed balls in a Banach space $X$. Prove that $\bigcap_{n=1}^\infty B_n\neq\varnothing$.   As I said before, it should be rather simple. When the radii decrease to 0, it's just a matter of selecting any sequence of points in $B_n$, and it must be Cauchy- and the limit is in the intersection.  My question is what to do when the radii do not decrease to 0? I got some tips about multiplying the balls by a sequence of decreasing scalars, or reducing the radii so that they decrease to 0, but found too many pathological cases for both methods.  Finally- I used a geometric arguemnt (which i've shown to work in any normed space) that if $B(x_1,r_1)\subset B(x_2,r_2)$ then $\| x_1-x_2\|\leq|r_1-r_2|$. This turned out to be some kind of technical catastrophe, but it worked...  Still, if anyone knows of a more elegant solution, I'd love to hear about it. Why is the node editor showing different kinds of nodes? I have been following  tutorial until I started adding nodes. The problem is that he has completely different nodes than I have. Even nodes that are created at start are different (I have Material and Output and he has Render Layers and Composite). Have I missed something or should I use different nodes than he? Essentially, all is in the title: Is it possible to compute the integral $$\int_1^{+ \infty} \frac{dx}{x^2(1+e^x)} \hspace{1cm} ?$$  I suspected some relation with a , but I was not able to find something explicit. In Guardians of the Galaxy vol. 2, we see long-distance space travel. It involves piloting your ship into some sort of "jump point" that opens up in space, taking the shape of a honeycomb-like structure with a single hex missing.  The way it's describe, these points are fixed in space: early in the movie, the Guardians have to out-run an enemy fleet to reach the one they need; later on, we see them fly through a very long series of them in sequence. It's also made clear that doing too many of these "jumps" in a row has consequences for the passengers.  The process seems to be similar to, say, the Mass Effect relay setup, mixed with a bit of Star Wars hyperspace travel.  Is this the first time we have seen long-distance space travel in the MCU? Is there anything from the source material that explains how this works from a logistical standpoint? If there's any information on the "science" behind it, that would also be helpful. I asked a question regarding a very specific feature of a program and whether or not it works with a larger program.  Within hours someone had marked it with "This question may already have an answer here of a similar question, but not related to my question.  The question I asked IS NOT ADDRESSED in the referred-to question. It's frustrating to spend half an hour putting together an intelligent and specific question, and then have someone mark it as a duplicate (or possible duplicate), which apparently causes people to skip over my question. I haven't received any more responses since the question was flagged.   Two questions:  (1) How do I get this flagging removed and (2) what's the best way to prevent these "helpful" flaggings in the future? I know there must be something unmathematical in the following but I don't know where it is: \begin{align} \sqrt{-1} &amp;= i \\\\\ \frac1{\sqrt{-1}} &amp;= \frac1i \\\\  \frac{\sqrt1}{\sqrt{-1}} &amp;= \frac1i \\\\  \sqrt{\frac1{-1}} &amp;= \frac1i \\\\  \sqrt{\frac{-1}1} &amp;= \frac1i \\\\  \sqrt{-1} &amp;= \frac1i \\\\  i &amp;= \frac1i \\\\  i^2 &amp;= 1 \\\\  -1 &amp;= 1 \quad !!? \end{align} Testing stored procedure scalability I have an email application that will be called upon to deliver to the UI the number of new messages for a given user on each page load. I have a few variations of things I am testing on the DB level but all are abstracted by the stored proc call.  I'm trying to slam the DB to see what the breaking point (# of requests per second) would be.   In a nutshell, I have a table such as this userId, newMsgCount with a clustered index on userId. SQL should be able to server hundreds or thousands of these responses per second. I think the laggard is my .NET app.  How can I make this a good test to achieve the test results based on SQL performance?  Is there a tool for this that i can give it a stored proc name and param for it to pund my  DB?  I want to see if the DB can return a min. of 250 responses per second.