Suggestions on learning new languages allowed here?
Give each site a parallel site for polling, recommendations and subjective-ish stuff
How to change user in WinSCP? I'm using WinSCP to access Unix computers. How can I change user after I have logged into a Unix server using WinSCP?  E.g. I have personal account in Unix computer A. I can log into this computer using PuTTY and then change user to root user  $sudo /usr/bin/su - rootuser   How can I do the same thing using WinSCP? I don't know the password for rootuser. Symmetrical twin paradox in a closed universe Take the following gedankenexperiment in which two astronauts meet each other again and again in a perfectly symmetrical setting - a hyperspherical (3-manifold) universe in which the 3 dimensions are curved into the 4. dimension so that they can travel without acceleration in straight opposite directions and yet meet each other time after time.  On the one hand this situation is perfectly symmetrical - even in terms of homotopy and winding number. On the other hand the Lorentz invariance should break down according to , so that one frame is preferred - but which one?  So the question is: Who will be older? And why?  And even if there is one prefered inertial frame - the frame of the other astronaut should be identical with respect to all relevant parameters so that both get older at the same rate. Which again seems to be a violation of SRT in which the other twin seems to be getting older faster/slower...  How should one find out what the preferred frame is when everything is symmetrical - even in terms of GRT?  And if we are back to a situation with a preferred frame: what is the difference to the classical Galilean transform? Don't we get all the problems back that seemed to be solved by RT - e.g. the speed limit of light, because if there was a preferred frame you should be allowed to classically add velocities and therefore also get speeds bigger than c ?!? (I know  is only a local theory but I don't understand why the global preferred frame should not 'override' the local one).  Could anyone please enlighten me (please in a not too technical way because otherwise I wouldn't understand!)  EDIT Because there are still things that are unclear to me I posted a follow-up question: Declaring Text Decorations such as Underline, Strikethrough in a Style How do I include text decorations such as Underline, Strikethrough etc in a Style definition:  &lt;Style x:Key="UnderlinedLabel"&gt;      &lt;Setter Property="Control.FontFamily" Value="Trebuchet MS" /&gt;      &lt;Setter Property="Control.FontSize" Value="14" /&gt;      &lt;!-- Next line fails --&gt;      &lt;Setter Property="Control.TextDecorations" Value="Underline" /&gt; &lt;/Style&gt;   I'm familiar with using the following XAML to underline text:  &lt;TextBlock&gt;    &lt;Underline&gt;        Underlined text    &lt;/Underline&gt; &lt;/TextBlock&gt;   However text decoration is just another style, I want to be able to define it declaritively like FontWeight, FontSize etc.  [Update]  I was applying this style to a Label control.  This was my main problem.  It appears you can't underline text in a Label.  Change to a TextBlock (thanks gix) and all is well. I've seen references to curried functions in several articles and blogs but I can't find a good explanation (or at least one that makes sense!) I'm trying to work out this shoulder deformation. I can't figure it out.  Is there anything wrong in my armature? Should i add bones and keep more control of my mesh or use shape keys? Here is my file blend. Small snap loop devices visible in gnome-disk-utility OR what is the function of snap ubuntu-core Is for open connected $U$ the set $U_\varepsilon$ for small $\varepsilon$ connected? Let for an open connected subset $U\subset \mathbb R^n$ and a number $\varepsilon &gt;0$: $$ U_\varepsilon=\{x\in U: dist (x, \partial U)&gt; \varepsilon \}. $$ Then  $U_\varepsilon$ is open but in general not connected.  But I suppose that for sufficiently small $\varepsilon &gt;0$ also  $U_\varepsilon$ is connected. How to prove its?  Edit. Let's assume that additionally $U$ is bounded. Is then $U_\varepsilon$ connected? Just ran the latest batch of updates on 20.04 (Xubuntu), and now I'm getting a GRUB error: symbol 'grub_calloc' not found  I'm dropped into the 'grub rescue' shell, but have no idea what to do there that might be useful. To me, 'symbol not found' implies some sort of build error with the grub package, but I don't really know how grub works. I noticed that this update also included 'firmware', not sure if that could be related. Is my best bet just to boot from a live CD and see if I can roll back the update to grub somehow? Edited to add: OK, thanks to lots of people ! Here's what I think I now understand.  On 'non-UEFI' systems, grub is installed in two separate parts. The first, most basic, part is the part that is started on bootup. But for most of it's functionality, it needs the second part. These parts must be aligned - neither part must require any functionality from the other part which is not actually there. The visible, run-time problem occurs when these parts are not aligned, and the function grub_calloc is not supplied. It's not 100% clear to me if grub_calloc belongs in the second, larger part or the first. I would have expected the second, but the grub build system is a work of considerable art, so I don't know :).  The root cause of the problem is that the grub update has not ensured that both parts have been updated. Ideally, failure to do this should cause grub installation to fail, and the system should be reverted to a safe state. This does not happen. This is actually still a bit of a mystery to me. All that the update needs to do by default is put each part where the current parts are, because obviously that worked. If the install locations/drives are configuration - driven, and one of these locations can't be reached, then somehow a mismatch has arisen between that configuration data and reality. This might not show up as a problem as long as no new dependency was introduced between the parts.   All flavours of solution involve reinstalling grub to ensure that the two parts are aligned. It's not actually necessary to go back to the previous version ( although that will work ), because it's not the grub runtime per se that is broken. There are numerous ways to achieve this, depending on your environment, but running the Boot-repair live disk worked for me. It may be useful, for the purpose of avoiding such a misalignment in future, to ensure that the grub installer on your system is configured to install to the correct devices. This update resolves some important bugs (). If you have reverted grub to resolve this problem, be aware that you are exposed to these issues. I'm new in LaTex. I need to draw a graphic like the image and each rectangles of image must have the size shown in Figure. I drwan it by MS power point but I need to do by LaTex. Can you help me? Thank you in advance for your help and collaboration!  Thank you in advance for your help and collaboration! After using gdalwarp to project and align-to-grid (via -tap) a number of rasters I noticed that the output rasters were significantly larger than the original rasters. A fairly thorough web search turned up :  Frank Warmerdam explained the reason: &quot;On careful review, the difference in the file in question is because gdal_translate uses the TIFFWriteScanline() interface to write the output file from within GTiffDataset::CreateCopy?(), and this only writes as much of the final 'strip' of the file as is required to complete image area. But gdalwarp goes through the blockio interface which writes the complete final strip, even the portion that falls off the end of the file.&quot;  This Trac issue is ~7 years old, however, and I know some changes to the GDAL utilities, including gdalwarp have been made since. I'd like to know if the above reasoning still holds and if the file size inflation I'm seeing is &quot;normal.&quot; The word &quot;normal&quot; here might be taken to mean unsurprising or expected but, more importantly: is there anything that can be done to mitigate the effects i.e. reduce the output raster file size? Below is a table of the file size inflation I'm experiencing. Input File Size (bytes)     Output File Size (bytes)    Inflation 1437380431                  1698334217                   18% 1428001178                  1698334433                   19%   41683165                   137036637                  228%  The input TIFF files were created in ArcGIS and thus have external Worldfiles, XML and DBF files but these do not make up the difference in file size. Here is a sample gdalwarp call as I've used it in all of these cases; the actual execution was handled by a Python subprocess (subprocess.Popen): $ gdalwarp -tap -tr 30 30 -t_srs &quot;+proj=aea +lat_1=20 +lat_2=60 +lat_0=40 +lon_0=-96 +x_0=0 +y_0=0 +ellps=GRS80 +datum=NAD83 +units=m +no_defs&quot; -co &quot;COMPRESS=LZW&quot; input_file.tif output_file.tif  I understand that in rare cases compression makes a larger file, but the effect is the same without the LZW compression. The ratios in the table are with LZW compression. How to show textures in the 3D View editor? Is there a simple way to convert a string to Title Case? E.g. john smith becomes John Smith. I'm not looking for something complicated like , just (hopefully) some kind of one- or two-liner. Show  $$\int_0^\infty \frac{\ln(x)}{e^x} = -\gamma$$ (gamma is Euler-Mascheroni constant).  Can anyone please prove this result?  Also  $$ \int_0^\infty \frac{\left( \ln(x) \right)^2}{e^x}\mathrm dx. $$ $\require{enclose}\enclose{horizontalstrike}{\rm Greatest}\!$ Least prime factor of $n$ is less than square root of $n$, proof I remember reading this somewhere but I cannot locate the proof. How does one prove that every finite group is isomorphic to a subgroup of an alternating group? During the next quarter at uni, I'll be taking a course in real analysis and since I prefer studying with an additional text I thought I'd come here to look for some book recommendations.  My background: I'm comfortable with linear algebra and single variable calculus, but shakey on multivariable calculus. I did have a slight introduction in to geometry.  For linear algebra I found the common recommendation of Hoffman &amp; Kunze to be very helpful (although the abstractness came as a bit of a kicker at first).   For Single variable calculus I used the book Calculus by Adams and Essex, which I found frustrating to work with, because it often left me guessing at what they were trying to do or why they were doing it. I also felt that they exercised a certain lack of rigour. (Which may be due to the subject which would make it hard to derive from axioms.)  Details: Though it would be a complementary text, I'd prefer one which will still hold value as a work of reference at a later point in my studies. I've heard that Rudin's Principles of mathematical analysis is one of the better textst out there, but also read several comments discouraging Rudin's book as a first introduction to real analysis, hence my quest to gather more information and maybe get some more personalised recommendations.  The course: The mandatory course literature will consist of lecture notes, but 4 texts are suggested as recommended reading.   T.M. Apostol, Mathematical analysis. Addison-Wesley (1974) J. Dieudonné, Foundations of Modern Analysis. Academic Press (1960) A. van Rooij, Analyse voor Beginners.Epsilon Uitgaven, no. 6 (2003)   R.S. Strichartz, The way of analysis (1995)   Thanks in advance! Is zero input impedance good or possible when considering impedance matching? For RF applications, we are usually considering of impedance matching to choose load impedance as the conjugate of the source input impedance for the maximum transferred power. But how about design the source having zero input impedance? Is it even possible or good? A naive thought is that all the power will be on the load if so. I might think it is true for DC case and for amplifier design to have a small output impedance and big input impedance. I lack the knowledge to find the missed chain to put all the knowledge together. How do you think? Thanks! Implement numbering scheme like A,B,C... AA,AB,... AAA..., similar to converting a number to radix26 I want to implement numbering scheme like Microsoft Word uses for numbering.  first one gets = A,next is  B, next is C, .... then AA, then AB,....and so on.  as shown below   A        B  C  .   .  AA  AB  AC  .  .  AAA  AAB  ....   '=>' here means converted to.  some examples:       1 =&gt; A 26 =&gt; Z 27 =&gt; AA 52 =&gt; AZ 53 =&gt; BA   and heres the code for it:     var convertToNumberingScheme = function(n){         var x = n-1,             r26 = x.toString(26),             baseCharCode = "A".charCodeAt(0);          var arr = r26.split(''),             len = arr.length;          var newArr =arr.map(function(val,i){             val = parseInt(val,26);              if( (i === 0) &amp;&amp; ( len &gt; 1)){                 val = val-1;             }              return String.fromCharCode(baseCharCode + val);         });         return newArr.join('');     }   It seems to work fine, but any ideas if there are some potential bugs or ways to  optimize this. Determine Which of the following Sets is a Vector Space Determine which of the following sets is a vector space.  $V$ is the line $y=x$, in the $xy$-plane: $V =\{[x,y]: \; y=x\}$  $W$ is the union of the first and second quadrants in the $xy$-plane: $W=\{[x,y]: \; y\geq0\}$  $U$ is the line $y = x+1$ in the $xy$-plane: $U=\{[x,y]: \; y=x+1\}$    I know that the answer is that "$V$" is the only vector space. However how do I come up with a quick proof to show that $V $is a vector space and that the other $2$ aren't? When is a cellular automaton "bidirectional"? From .   "A (bi-directional, deterministic) cellular automaton is a triplet $A = (S;N;\delta)$, where $S$ is an non-empty state set, $N$ is the neighborhood system, and $\delta$ is the local transition function (rule). This function deﬁnes the rule of calculating the cell’s state at $t +1$ time step, given the states of the neighborhood cells at previous time step $t$"  I haven't found other "bidirectional" CA via Google, so I wonder what does the term say about this automaton's properties. Does it mean that the state $t+1$ can be used to find out the state t?