Update ESTA information?
Do I need to change my ESTA address when visiting the US?
Change Shapefile data source encoding? I tried to change the only the shapefile datasource encoding through properties and also  but it doesn't change it.   Without saving the QGIS project can't I directly change the shapefile datasource encoding?  I also tried this code, it shows change encoding but as I open the shapefile again it show the same old system encoding:  for layer in QgsMapLayerRegistry.instance().mapLayers().values():     layer.setProviderEncoding(u'UTF-8')     layer.dataProvider().setEncoding(u'UTF-8')     print layer.name(), layer.dataProvider().encoding()     (I am not saving QGIS project, just accessing and saving shapefile directly. When I save the project and do this task then it work correctly) Understanding the length extension attack I have been trying to understand exactly how a length extension attack works on SHA-1. I'll detail below what I've understood so far, so that I can convey my understanding of the same and hopefully get advice on where I'm going wrong.  Lets assume that for a message $m$, a secret $s$ is appended to it and the SHA-1 hash is calculated. If $\textrm{len}(m) + \textrm{len}(s)$ is not a multiple of the block size, a certain amount of padding is added to it to make it a multiple, and the hash is generated using what is essentially $s || m || \textrm{padding}$.  Now SHA-1 internally uses 5 registers — it takes in an block, generates new register values, turns the crank, takes in another block, generates new register values, turns the crank ... and so on till the end. When all blocks are exhausted, the register values are concatenated and spit out.  Assume that an attacker knows a certain value of $m$, for which he also knows the hashed key. In such a case, he knows the state of the 5 registers when $(s || m || \textrm{padding}$ was processed. Lets also assume that the attacker knows the length of $s$, so that he can predict how much padding was added.  Here is where I get confused. From what I've read so far, the attack involves taking the known hash, adding a certain amount of padding and then the value that we want. However, isn't the padding already used up in creating the hash? Why are we using padding in our attack? ExitCodes bigger than 255, possible? If yes, on which operating system, shell or whatever?  Consider the following java program (I'm using java just as an example, any language would be good for this question, which is more about operation systems):  public class ExitCode {     public static void main(String args[]) {         System.exit(Integer.parseInt(args[0]));     } }   Running it on Linux and bash, it returns always values less equal 255, e.g. (echo $? prints the exit code of the previous executed command)  &gt; java ExitCode 2; echo $? 2  &gt; java ExitCode 128; echo $? 128  &gt; java ExitCode 255; echo $? 255  &gt; java ExitCode 256; echo $? 0  &gt; java ExitCode 65536; echo $? 0     EDITED: the (only, so far) answer below fully  explain what happens on UNIXes. I'm still wondering about other OSes. I've installed Ubuntu 13.04 two times on my PC. Each on a different partition. I would like to delete the one which I'm not using. How would I do that? Creating Workflow -> Error When I try to create a new WF in my Sharepoint Designer I get following error:     The list of workflow actions on the server references an assembly that   does not exist. Some actions will not be avaliable. The assembly   strong name is "Microsoft.SharePoint.WorkFlowActions,   Version=14.0.0.0,Cultureneutral,PublickeyToke=   Does any on know how to fix this problem? Verify that $4(29!)+5!$ is divisible by $31$. Tensor product in dual-space I am a bid confused regarding the notation for tensor products when going into dual-space  If $\left| \Psi \rangle \right. = \left| A \rangle \right. \left| B \rangle \right.$ is $ \left. \langle \Psi \right| = \left. \langle A \right| \left. \langle B \right|$ or $\left. \langle B  \right| \left. \langle A \right|$?  My guess is the last choice, since operators should act on   $\left| 0 \rangle \right. = \left( \begin{matrix}   1 \\   0  \end{matrix} \right) $  $\left| 1 \rangle \right. = \left( \begin{matrix}   0 \\   1  \end{matrix} \right) $  so  $\left| 01 \rangle \right. = \left| 0 \rangle \right. \left| 1 \rangle \right. = \left( \begin{matrix}   0 \\   1 \\   0 \\   0  \end{matrix} \right) $  But then, for me, it should be  $\left( \begin{matrix}   0 &amp; 1 &amp; 0 &amp; 0  \end{matrix} \right) = \left \langle 10 \right|$ But this is not correct if i calculate the tensor product, since   $\left \langle 1 \right| \left \langle 0 \right| = \left( \begin{matrix}   0 &amp; 0 &amp; 1 &amp; 0  \end{matrix} \right)$  For instance, shoulden't it be  $\left| 01 \rangle \right. \left \langle 10 \right| = \left( \begin{matrix}   0 &amp; 0 &amp; 0 &amp; 0\\   0 &amp; 1 &amp; 0 &amp; 0\\   0 &amp; 0 &amp; 0 &amp; 0\\   0 &amp; 0 &amp; 0 &amp; 0\\  \end{matrix} \right) $ ?  I hope I have made my confusion clear I am learning basics of the category theory (CT).  I do understand that CT is a modern powerful framework to describe various branches of mathematics in a unified way.  I do admit that category's definition tells a lot about the whole thing and focuses on the most important properties, shadowing unnecessary details. However, the more I go forward, the more it feels like it should explicitly require a notion of morphisms equality (like it does with morphism composition). It feels so because equality or inequality of morphisms arises everywhere, since the very beginning: any commutative diagram eventually reduces to an equality of two different paths and many other things involve equality as well. Even composition is defined grounding upon an (implicit) equality!  I'll try to give an example of my concern. Consider $\mathbb{SET}$. Its objects are sets and morphisms are functions. Now, let's recall that functions are sets as well - to be more precise, a function $f : A \mapsto B$ is a subset of a $A \times B$ obeying certain properties, which I omit. Thus, one could argue that $f$ is both a morphism between objects $A, B \in Obj(\mathbb{SET})$ and an object defined as a set of pairs $\{ (a_1 \in A, b_1 \in B), ..., (a_n \in A, b_n \in B) \}$ and those are equal because both are essentially exactly the same thing.  I hope my concern is clear and I need some kind of "conceptual insight" from knowledgeable people to move forward. Please give me the right perspective. If the distribution of test statistic is bimodal, does p-value mean anything? Conditional probability and venn diagram I am trying to prove that:  Let $f$ be analytic in the closed unit disc with $f(z)\leq 1$ for $|z|\leq1$.  For a given $0&lt;r&lt;1$ and $|z_1|,|z_2|\leq r$, $z_1\neq z_2$ then,   $$\left|\frac{f(z_2)-f(z_1)}{z_2-z_1}\right|\leq \frac{1}{(1-r)^2}.$$  My attempt is: part a  of the question asks to prove $$\left|\sum_k^\infty a_nz^n\right|\leq \frac{ |z^k|}{1-|z|}.$$   So, \begin{eqnarray*}  \left|\frac{f(z_2)-f(z_1)}{z_2-z_1}\right|&amp;=&amp; \frac{|\sum_1^\infty a_nz_2^n-\sum_1^\infty a_nz_1^n|}{|z_2-z_1|}\\  &amp;\leq&amp; \frac{\frac{ |z_1 |}{1-|z_1|}+\frac{ |z _2|}{1-|z_2|}}{|z_2-z_1|}\\  &amp;\leq&amp;\frac{1}{(1-r)^2} \frac{   |z_2| ({1-|z_1|})+  |z _1| (1-|z_2|) }{|z_2-z_1|}\\ \end{eqnarray*} But could not prove that the last term is controlled by 1. "A flea hops randomly on the vertices of a triangle with vertices labeled 1,2 and 3, hopping to each of the other vertices with equal probability. If the flea starts at vertex 1, find the probability that after n hops the flea is back to vertex 1."  Could someone provide a hint to help me start this? Relation between intensity of light and refractive index When does Ubuntu 16.04 use /etc/apache2/ssl/apache.crt? I have some Ubuntu 16.04 server running and set up one vhost in apache2 which uses (or should use) ssl.  &lt;IfModule mod_ssl.c&gt;         &lt;VirtualHost *:443&gt;          ServerAdmin myemail@mailhoster.xx         ServerName my.domain.name.de         DocumentRoot /var/www/mysslsite          &lt;Directory /var/www/mysslsite&gt;                 Options FollowSymLinks MultiViews                 AllowOverride All                 Order allow,deny                 allow from all         &lt;/Directory&gt;          ErrorLog ${APACHE_LOG_DIR}/mysite.ssl.error.log         CustomLog ${APACHE_LOG_DIR}/mysite.ssl.access.log combined          &lt;/VirtualHost&gt; &lt;/IfModule&gt;   I did NOT enable the standard sites-available/default-ssl.conf.  I am able now to browse to  and it is asking in firefox to add some exception which is totally normal if i did not buy any certificate.  But I was wondering where it is set up that it should use the certificates in /etc/apache2/ssl/ directory. I can not find any config where it is told to use that. I all the time was thinking that it will use something from /etc/ssl folder.   Or did I maybe not activate SSL correctly? After upgrading to 12.10 quantal, the packaged version of fglrx no longer works. I discovered that this is because there is a separate 'legacy' fglrx driver for the HD 2k-4k series cards, but it is incompatible with the xorg server on 12.10.  This is the most current version of the driver for HD 2000 through HD 4000 series cards. You can't use the non-legacy fglrx driver, but you can use the open-source radeon driver if you prefer your WM compositing to be laggy and your YouTube videos to play like they would on a Pentium MMX series:    Usually this driver can be installed in the following way, necessary because apt-get install fglrx would pull in the non-legacy driver:  wget http://www2.ati.com/drivers/legacy/amd-driver-installer-12.6-legacy-x86.x86_64.zip unzip amd-driver-installer-* sudo sh ./amd-driver-installer-*.run --buildpkg Ubuntu/quantal sudo dpkg -i fglrx*.deb sudo aticonfig --initial -f   If you use a different version of fglrx (for example, a newer 12.9 that doesn't support those cards) then the final command will give you an error no supported hardware detected or something similar. However, everything works at this point and you will get a reasonable xorg.conf:  ... other stuff  Section "Device"         Identifier  "aticonfig-Device[0]-0"         Driver      "fglrx"         BusID       "PCI:1:5:0" EndSection  ... other stuff   At this point you're supposed to reboot and everything will be working with the fglrx driver. However, upon rebooting, you'll be treated to the following errors in Xorg.0.log when fglrx attempts to load:  (EE) Failed to load /usr/lib/xorg/modules/drivers/fglrx_drv.so: /usr/lib/xorg/modules/drivers/fglrx_drv.so: undefined symbol: noXFree86DRIExtension   Some searching around will show that this is a problem with the legacy ATI drivers not supporting xserver 1.13 or newer. () ATI has released a fixed driver for its most recent (HD 5000 series or later) cards, but not for the 'legacy' cards yet. The non-legacy ATI drivers can't be used with the old cards.  What should an Ubuntu user, using one of these HD 2000-4000 series cards, do?    Wait for an updated 'legacy' ATI driver that properly works with xserver 1.13?   Downgrade back to 12.04 Precise, which uses xserver 1.11? Try to downgrade xserver on 12.10 Quantal to 1.12, which could possibly break Unity and GNOME? Forced upgrade to HD 5000 series or later card? (Not possible with integrated graphics...) Some other 1337 action that fixes this problem painlessly? Installing Nvidia drivers on Red Hat Java multiline string If $\sum a_n$ converges and $b_n=\sum\limits_{k=n}^{\infty}a_k $, prove that $\sum \frac{a_n}{b_n}$ diverges Let $\displaystyle \sum a_n$ be  convergent series of positive terms and set  $\displaystyle b_n=\sum_{k=n}^{\infty}a_k$ , then prove that $\displaystyle\sum \frac{a_n}{b_n}$ diverges.   I could see that $\{b_n\}$ is monotonically decreasing sequence converging to $0$ and I can write $\displaystyle\sum \frac{a_n}{b_n}=\sum\frac{b_n-b_{n+1}}{b_n}$, how shall I proceed further? What are "Community Wiki" posts? Some questions and answers are marked Community Wiki and are owned by a community wiki user:  (In fact, this very question is one of them)  Why have Community Wiki posts? How do Community Wiki posts work? How does a post become a Community Wiki post? How can the Community Wiki status be removed from a post? How can I find Community Wiki posts? Downloading files using wget I am trying to download files from .  The URL is:   When I use this command:  wget http://www.ncbi.nlm.nih.gov/geo/download/?acc=GSE48191&amp;format=file    I get only index.html?acc=GSE48191 which is some kind of binary format.  How can I download the files from this HTTP site?