I would like to print something as 5,4,3,2,1.  This is my program, but it prints the numbers vertically.  numbers=5 i=1 while [ "$i" -le "$numbers" ] do echo “$i” i=$(( $i + 1 )) done   Do you have any solution that could help me?
I have iterate over numbers in various order. I am able to display them in increasing order, even with steps like:  $ seq --separator="," 1 10 1,2,3,4,5,6,7,8,9,10 $ seq --separator="," 1 2 10 1,3,5,7,9   I am also able to display them in reverse order, neither continuous nor step wise.  $ seq --separator="," 10 1    $ seq --separator="," 10 2 1   No output for above commands.   My shell details:  $ bash --version GNU bash, version 3.2.25(1)-release (x86_64-redhat-linux-gnu) Copyright (C) 2005 Free Software Foundation, Inc.   Let me know how I would be able to display the numbers in descending order?
I'm asking about someone who's employed by a company and does different jobs (both a qualified and unqualified person). Who knows; maybe in English those two are two different words? What are they called in English?  All I know is a navvy but that usually means physical work.  Let me just try a few things here. These are just wild guesses, nothing more.    odd job man/worker   shiftman   (unskilled) labourer Regression without intercept: deriving $\hat{\beta}_1$ in least squares (no matrices) Google Docs thumbnails do not update, can I force an update? I was reading a website where common English sentence errors are written -     INCORRECT - He doesn't know to swim.      CORRECT - He doesn't know how to swim.   I know He doesn't know how to swim is a correct sentence. But why is the other one wrong, is my question?  I know that know is a transitive verb. So, the following are correct -   i) He knows swimming.  Swimming is a gerund. We can also use the infinitive form here - to swim  ii) He knows to swim. Stringification of a macro value I am trying to add a list into an another nested list before adding values of a list to nested list it is getting the correct value but after adding i am getting (already output) in debug log when i checked.    public List&lt;String&gt; fieldName {get;set;}  public List&lt;List&lt;String&gt;&gt; fileValuesXML; // To get the field values of xml  for(Dom.XMLNode child : SalesforceObjecet.getChildElements()) {                        objecetName = child.getText();             system.debug('Object Name in XML field  ' + objecetName );              for(Dom.XMLNode subchild : child.getChildElements())              {                 system.debug('Sub child ' + subchild.getText() );                 for(Dom.XMLNode subchildfield : subchild.getChildElements())                 {                     system.debug('Sub child Field ' + subchildfield );                     fName  = subchildfield.getText();                     fieldName.add(fName);                     //fileValuesXML.add(fieldName);                     //system.debug('Filed Name in XML field  ' + fieldName);                 }                  system.debug('Filed Name before affing to filevalueXML  ' + fieldName);                                     fileValuesXML.add(fieldName);                 fieldName.clear();                 system.debug('Filed Name after affing to filevalueXML  ' + fileValuesXML);             }    }    I am getting values in debug log as:     Filed Name before affing to filevalueXML  (AccountSource, field3)   Filed Name after affing to filevalueXML  ((), (already output),   (already output)) How to install the Pantheon desktop environment? Add a list of questions selected for HNQ to the 10k tools Now that questions selected for Hot Network Questions have a record attached to them, those can be queried for in the Data Explorer. However, the Data Explorer is only updated once a week. It would be nice to also have a full list of questions that are selected for Hot Network Questions and the times they were selected added to the 10k tools. In my opinion, it adds to the &quot;bird's eye view&quot; of the site that is afforded to them, and is in line with other similar lists (e.g. migrated questions, protected questions, etc.). Also, a list of questions that were removed from Hot Network Questions by a moderator would be very nice as well. Why use gradient descent with neural networks? When training a neural network using the back-propagation algorithm, the gradient descent method is used to determine the weight updates. My question is: Rather than using gradient descent method to slowly locate the minimum point with respect to a certain weight, why don't we just set the derivative $\frac{d(\text{Error})}{dw}=0$, and find the value of weight $w$ which minimizes the error? Also, why are we sure that the error function in back-propagation will be a minimum? Can't it turn out the error function is a maximum instead? Is there a specific property of the squashing functions that guarantees that a network with any number of hidden nodes with arbitrary weights and input vectors will always give an error function that has some minima? Why are RSA key sizes almost always a power of two? I know that other bit sizes are possible, e.g. this HTTPS server seems to have a 9000 bit key , but it's very rare that one sees a key not of size 1024, 2048, 4096, etc. bits in common usage - what is the reason for this? Is it just customary, or is there a cryptographic advantage? Got a working screen via HDMI, but the DVI won't go past 1360x768 (a PackardBell Maestro monitor). Had no issues in Windows 7.  I've tried all the xrandr tricks, see the output below:   xrandr  Screen 0: minimum 8 x 8, current 3280 x 1080, maximum 16384 x 16384 VGA-0 disconnected (normal left inverted right x axis y axis) DVI-D-0 disconnected (normal left inverted right x axis y axis) HDMI-0 connected primary 1920x1080+1360+0 (normal left inverted right x axis y axis) 510mm x 287mm    1920x1080      60.0*+   59.9     50.0      1680x1050      60.0      1600x900       60.0      1440x900       59.9      1280x1024      75.0     60.0      1280x800       59.8      1280x720       60.0     59.9     50.0      1152x864       75.0      1024x768       75.0     70.1     60.0      800x600        75.0     72.2     60.3     56.2      720x576        50.0      720x480        59.9      640x480        75.0     72.8     59.9   DVI-D-1 connected 1360x768+0+0 (normal left inverted right x axis y axis) 0mm x 0mm    1024x768       60.0 +    1360x768       60.0*    59.8      1152x864       60.0      800x600        72.2     60.3     56.2      680x384        60.0     59.8      640x480        59.9      512x384        60.0      400x300        72.2      320x240        60.1     cvt 1920 1080 # 1920x1080 59.96 Hz (CVT 2.07M9) hsync: 67.16 kHz; pclk: 173.00 MHz Modeline "1920x1080_60.00"  173.00  1920 2048 2248 2576  1080 1083 1088 1120 -hsync +vsync  xrandr --newmode "test" 173.00  1920 2048 2248 2576  1080 1083 1088 1120 -hsync +vsync  xrandr --addmode DVI-D-1 test X Error of failed request:  BadMatch (invalid parameter attributes)   Major opcode of failed request:  140 (RANDR)   Minor opcode of failed request:  18 (RRAddOutputMode)   Serial number of failed request:  37   Current serial number in output stream:  38    I'm using the latest driver from Nvidia (binary, 352.63) because Nouveau would show a black screen on my second monitor.  I got stuck on manually finding/creating a xorg.conf file and adding some monitor hacks, can anyone help me? I have a problem understanding the proof of Rencontres numbers (Derangements) Sequential Update of Bayesian I am currently reading Murphy's ML: A Probabilistic Perspective. In CH 3 he explains that a batch update of the posterior is equivalent to a sequential update of the posterior, and I am trying to understand this in the context of his example.  Suppose $D_a$ and $D_b$ are two data sets and $\theta$ is the parameter to our model. We are trying to update the posterior $P(\theta \mid D_a, D_b)$. In a sequential update, he states that, $$ (1) \ \ \ \ \ \ \ \  P(\theta \mid D_{a}, D_{b}) \propto P(D_b \mid \theta) P(\theta \mid D_a) $$ However, I am slightly confused as to how he got this mathematically. Conceptually, I understand that he is saying the posterior $P(\theta \mid D_a)$ is now a prior used to update the new posterior, which includes the new data $D_b$, and is multiplying this prior with the likelihood $P(D_b \mid \theta)$. Expanding the last statement out, I have, $$  P(D_b \mid \theta) P(\theta \mid D_a) = P(D_b \mid \theta) P(D_a \mid \theta) P(\theta) $$  but are we allowed to say $P(D_a \mid \theta) P(D_b \mid \theta) = P(D_a, D_b \mid \theta)$ in order to make the connection in (1)? Graphics issues after/while installing Ubuntu 16.04/16.10 with NVIDIA graphics Is it posible to upload file in Lists Attachments in SharePoint in custom way could you help me on this integral ? $$\int \frac{1}{\cos(x)}\,\mathrm dx$$ Here's what I've started : $$\int \frac{1}{\cos(x)}\,\mathrm dx = \int \frac{\cos(x)}{\cos(x)^2}\,\mathrm dx = \int \frac{\cos(x)}{1-\sin(x)^2}\,\mathrm dx$$ Now, I did : $u = \sin(x)$, so $\mathrm du = 1$. Now I have : $$\int \frac{\text{???}}{1-u^2}\,\mathrm du$$ But at this point, I think I did the most of the job but I'm stuck. Could you help me to solve this integral please (to the integration by substitution at the end) ? Thanks EDIT : Now I follow the steps and I got : $$\int \frac{1}{1-u^2}\,\mathrm du$$ Doing the partial fraction I got $A = 1/2$ and $B = 1/2$. So basically I have : \begin{align} &amp; \int \frac{1}{1-u^2}\,\mathrm du = \int \frac{1/2}{1+u}\,\mathrm du + \int \frac{1/2}{1-u}\,\mathrm du \\[8pt] = {} &amp; \frac 1 2 \left(\int \frac{1}{1+u} \, du - \int \frac{1}{1-u} \, du\right) \\[8pt] = {} &amp; \frac 1 2 \ln\left(\frac{1+u}{1-u}\right) = \ln\left(\left(\frac{1+\sin(x)}{1-\sin(x)}\right)^{1/2}\right) \\[8pt] = {} &amp; \ln \left(\frac{\sqrt{1+\sin(x)}}{\sqrt{1-\sin(x)}}\right) = \ln\left(\frac{\sqrt{1+\sin(x)}}{\sqrt{\cos(x)^2}}\right) \\[8pt] = {} &amp; \ln\left(\frac{\sqrt{1+\sin(x)}}{\cos(x)}\right) \end{align} Here's what my teacher got :  What's wrong with what I did ? Did I miss something ? Do you need to submit an itinerary to get a Russian visa? And do you have to stick to it? Free GIS workshops, tutorials, and applied learning material This Q&amp;A lists free as in $0 workshops in GIS and related fields that have their material available to view or download online. The list is not limited to FOSS GIS, as GISers usually use a combination of open and closed source tools to accomplish their tasks. Some of these tools are easier than others and some are better documented. This list will be a great benefit to the community especially for new comers to the field. General GIS   from   from   from   from   Open-source GIS   from   from   from   from   from   ESRI Products   from   from   Transportation These links include either theoretical or applied transportation knowledge in transportation planning          Disaster Management    Databases   from   Geo Statistics    from Constants of motion vs. integrals of motion vs. first integrals Since the equation of mechanics are of second order in time, we know that for $N$ degrees of freedom we have to specify $2N$ initial conditions. One of them is the initial time $t_0$ and the rest of them, $2N-1$ are initial positions and velocity. Any function of these initial condition is a constant of motion, by definition. Also, there should be exactly $2N-1$ algebraically independent constants of motion.  On the other hand, Noether's procedure gives us integrals of motion as a result of variational symmetries of the action. These integrals of motion are also conserved but they are not always $2N-1$ in number. In consequence, we classify the system by their integrability.  So, what is the difference between the  and ? Why do non- have less integrals of motion when they should always have $2N-1$ constants of motion? Is it possible to speed up the gzip process?  I'm using  mysqldump "$database_name" | gzip &gt; $BACKUP_DIR/$database_name.sql.gz   to backup a database into a directory, $BACKUP_DIR.  the manpage says:     -# --fast --best             Regulate  the  speed  of compression using the             specified digit #, where -1  or  --fast  indi‐             cates  the  fastest  compression  method (less             compression) and -9 or  --best  indicates  the             slowest compression method (best compression).             The default compression level is -6 (that  is,             biased  towards high compression at expense of             speed).    How effective would it be to use --fast? Is this effectively lowering the CPU usage on a modern computer?   My test results  I didn't notice any acceleration:   7 min, 47 seconds (with default ratio -6) 8 min, 36 seconds (with ratio --fast ( = 9 ))   So it seems it takes even longer to use the fast compression?  Only higher compression really slows it down:   11 min, 57 seconds (with ratio --best ( = 1 ))   After getting the Idea with lzop I tested that too and it really is faster:   6 min, 14 seconds with lzop -1 -f -o $BACKUP_DIR/$database_name.sql.lzo