I have submitted all proof including CA certificate for fund into my parent's bank account.  Fund in my parent's account was deposited by me two years ago and I have provided proof in second application. They mentioned in first rejection letter about this fund. The proof of funds in my brother and sister in law’s account was explained in the letter and supported by tax return.  I am planning for JRS.
Over the course of time here on TSE, I have observed individuals whose pattern of visa applications is best described as ''...     serial refusals - Two or more consecutive visa refusals issued by the same regime to the same person. Commonly for the same, or nearly the same, reasons. In some visa regimes Serial refusals can have a cumulative effect wherein the applicant's credibility is increasingly eroded, especially when the application pattern suggests a secondary agenda.   A common thread appears to be the need to visit the destination country (especially Schengen, the USA, or the UK) with a special sense of urgency. Also common in these cases are the following types of questions...   Should I just reapply once again? What are my chances? What can I do to improve my odds in the future? Can I somehow address the previous refusals to avoid them being a burden on all future applications? How can I break the pattern?      NB: This question is intended as a canonical about serial refusals. I have never been personally denied a visa.
Prove that at most $2k+1$ independent sets form the set of vertices of a graph, where $k$ is the maximum degree. Access user fields? $account = \Drupal::currentUser() loads the user object into $account, but how do I access custom fields I've created on the user object (via the admin UI)?  With dpm($account) I can't see any of my custom fields. Let $G$ be a group, where $(ab)^3=a^3b^3$ and $(ab)^5=a^5b^5$. Prove that $G $ is an abelian group. Let G be a group, where $(ab)^3=(a^3)(b^3)$ and $(ab)^5=(a^5)(b^5)$. Prove that $G$ is abelian group.  Thank you in advance. Any help is appreciated. I have damaged the screen on my phone, so much so, it will not allow me to get the data to transfer onto my laptop. On opening Samsung Kies, it is saying that the connected device is locked. Please enter password on the connected device. I can only assume its the pattern lock they are referring to as I have managed to unlock the sim.  As I am unable to do this due to the screen being cracked, I wondered whether there is any other way of doing this, before sending the same onto my insurance company, as they are saying that I will lose all the data! Cant see why seeing as its just the hardware that is damaged and not the software. Sophix tablet will not work without an SD card My Sophix tablet was working without the SD card, but now the camera will not work. I get the following error message:     Insert a SD card before using. If a microsite uses the same logo as the main site, which "home" should it link to? Which 'home' should the microsite's logo link to - the main site or the microsite?  Consider that...    The content and layout of the microsite is the only differentiator  Half the users reach the microsite from the main site.   The microsite doesn't have it's own URL (it's www.mainurl/microsite) The microsite has the same logo and header style (so you almost can't tell you've left the main site) How to achieve nomenclature entries like: symbol, Description, Dimension and unit, etc? The title is pretty much I want to ask. More detail, the nomenclature entries should be sorted in groups like:   Nomenclature     Acronyms     Symbol  Description     % no Dimensions and Units      ...     Greek Symbols     Symbol  Description             Dimensions     Units     ...     Roman Symbols     Symbol  Description             Dimensions     Units     S       Surface area vector     L^2            m^2     ...    Superscripts     Symbol  Description     % no Dimensions and Units      ...    Dimensionless Numbers     Symbol  Description     Definition     ...   e.g. expected entries like this:       My current nomenclature settings for grouping [book class]:  %---------------------------------------------------------- %                        Nomenclature %---------------------------------------------------------- %\renewcommand{\nomname}{List of Symbols and Abbrev.} \renewcommand\nomgroup[1]{%   \ifthenelse{\equal{#1}{A}}{%    \item[\textbf{Acronyms}] }{%                  A - Acronyms     \ifthenelse{\equal{#1}{R}}{%      \item[\textbf{Roman Symbols}]}{%            R - Roman       \ifthenelse{\equal{#1}{G}}{%         \item[\textbf{•} Symbols }]}{%          G - Greek           \ifthenelse{\equal{#1}{S}}{%            \item[\textbf{Superscripts  }]}{{%          S - Superscripts         \ifthenelse{\equal{#1}{U}}{%          \item[\textbf{Subscripts }]}{{%                 U - Subscripts         \ifthenelse{\equal{#1}{X}}{%          \item[\textbf{Other Symbols }]}%            X - Other Symbols                     {{}}}}}}}}}} %\ifpdf \renewcommand{\nomlabel}[1]{\hspace{1 em}#1}%{\hspace{1.5 em}#1} \renewcommand*{\nompreamble}{\markboth{\nomname}{\nomname}}   But how to extend it with Dimensions and Units? Why didn't Dumbledore simply cut off his hand and make a new one? I can't seem to get Python to import a module in a subfolder. I get the error when I try to create an instance of the class from the imported module, but the import itself succeeds. Here is my directory structure:  Server     -server.py     -Models         --user.py   Here's the contents of server.py:  from sys import path from os import getcwd path.append(getcwd() + "\\models") #Yes, i'm on windows print path import user  u=user.User() #error on this line   And user.py:  class User(Entity):     using_options(tablename='users')      username = Field(String(15))     password = Field(String(64))     email    = Field(String(50))     status   = Field(Integer)     created  = Field(DateTime)   The error is: AttributeError: 'module' object has no attribute 'User' Can I get more than 1000 records from a DirectorySearcher? I just noticed that the return list for results is limited to 1000. I have more than 1000 groups in my domain (HUGE domain). How can I get more than 1000 records? Can I start at a later record? Can I cut it up into multiple searches?  Here is my query:  DirectoryEntry dirEnt = new DirectoryEntry("LDAP://dhuba1kwtn004"); string[] loadProps = new string[] { "cn", "samaccountname", "name", "distinguishedname" }; DirectorySearcher srch = new DirectorySearcher(dirEnt, "(objectClass=Group)", loadProps); var results = srch.FindAll();   I have tried to set srch.SizeLimit = 2000;, but that doesn't seem to work. Any ideas? unable to reset root password of mysql XTerm only display part of some unicodes and Urxvt displays nothing In my case, (U)XTerm does display some unicodes, but only partially. For exmaple: for letters are: 𝒫φϕ𝒟. Here is a screenshot of UXTerm and Urxvt respectively   It seems that the problem is related to the letter space or letter length. By the way, everything is fine with gnome-terminal.  My current .Xresources file is: Xft.dpi:       120 Xft.antialias: true Xft.hinting:   true Xft.rgba:      rgb Xft.autohint:  false Xft.hintstyle: hintslight Xft.lcdfilter: lcddefault  XTerm*faceName:          Fixed XTerm*faceSize:          14 XTerm*reverseVideo:      false XTerm*selectToClipboard: true  UXTerm.vt100*faceName:          Fixed UXTerm.vt100*faceSize:          14 UXTerm.vt100*reverseVideo:      false UXTerm*selectToClipboard: true  URxvt.font:            xft:Fixed:pixelsize=18  URxvt.depth:                      32 URxvt.background:                 #222D31 URxvt*scrollBar:                  false URxvt*mouseWheelScrollPage:       false URxvt*cursorBlink:                true URxvt*background:                 black URxvt*foreground:                 grey URxvt*saveLines:                  5000  How to make XTerm and Urxvt to display those characters correctly? Is it possible? Proving there are infinitely many pairs of square-full consecutive integers So the question goes like this :  A positive integer $n$ is called square-full if for every prime $p$, $p \, | \, n$ implies $p^2 \, | \, n$, i.e. every prime power factor of $n$ occurs at least at the second power. This is equivalent to saying that there is no prime $p$ such that $p \, \| \, n$.  Show that there are infinitely many consecutive pairs of square-full numbers, i.e. infinitely many $n$ such that $n$ and $n+1$ are square-full.  The context of the question highly suggests that this can be proved by induction and it is the solution that I am looking for. It is not a homework, just something that caught my attention because I couldn't find any natural answer to it... I hope I'm not missing something trivial!  I've tried assuming $n_1, n_2, \dots, n_k$ were the first $n_k$ integers such that $n_i$ and $n_i+1$ are square-full, and then generate some polynomial in those $2k$ integers to get a new couple $n_{k+1}$, $n_{k+1} + 1$ but after a few natural tries I got nothing good out of it. Any ideas? Turn off buffering in pipe I have a script which calls two commands:  long_running_command | print_progress   The long_running_command prints progress but I'm unhappy with it. I'm using print_progress to make it nicer (namely, I print the progress in a single line).  The problem: Connection a pipe to stdout also activates a 4K buffer, so the nice print program gets nothing ... nothing ... nothing ... a whole lot ... :)  How can I disable the 4K buffer for the long_running_command (no, I do not have the source)? Non-Affine image transformations in .NET Are there any classes, methods in the .NET library, or any algorithms in general, to perform non- transformations? (i.e. transformations that involve more than just rotation, scale, translation and shear)  e.g.:      (source: )      Is there another term for s? Is there a modal command for MakeLowercase? Analog to  question I've been wondering WHAT is to \lowercase as \bfseries is to \textbf? (... and for uppercase, or \MakeLowercase and MakeUppercase, etc., which also seem to be text-block commands as explained .)  Is there a "switch"/"declaration"/"modal command" (what is the correct term here?, is there a difference between them?) that would allow one to turn something into lowercase/uppercase in the same way that one would use \scshape for example, i.e., not as text-block command with the curly braces?  Or how to create such a command?  I couldn't find any clue on the forum. What is the maximum RAM supported by the desktop and server editions? I have just downloaded "ubuntu-14.04.1-desktop-amd64.iso" and "ubuntu-14.04.1-server-amd64.iso" through "".   Please can someone confirm the maximum RAM that is supported.  According to many sites, Maximum RAM supported by the OS  ubuntu-14.04.1-desktop : " 2^64 bytes " -- Kindly confirm  ubuntu-14.04.1-server : " 2^64 bytes " -- Kindly confirm How to validate phone numbers using regex I'm trying to put together a comprehensive regex to validate phone numbers. Ideally it would handle international formats, but it must handle US formats, including the following:   1-234-567-8901 1-234-567-8901 x1234 1-234-567-8901 ext1234 1 (234) 567-8901 1.234.567.8901 1/234/567/8901 12345678901   I'll answer with my current attempt, but I'm hoping somebody has something better and/or more elegant. Am I being scammed by a sugar daddy? How to filter string for unwanted characters using regex?