I am trying to read a string in from a text file, split the string whenever there are spaces, and store each word in an array of strings:  eg. input "Hello i am a sentence"  output [Hello, i, am, a, sentence]  I currently have the following  Scanner sc = null;       try       {         sc = new Scanner(new FileReader(args[0]));         LinkedList&lt;String&gt; list = new LinkedList&lt;String&gt;();         String str = sc.nextLine();         for(String i:str.split(" ")){            list.add(i);         }         String[] arguments = list.toArray(new String[list.size()]);         System.out.println(arguments);       }       catch (FileNotFoundException e) {}       finally       {           if (sc != null) sc.close();       }   But i am unable to convert the list into an array and i get the following output  [Ljava.lang.String;@45ee12a7
In Java, arrays don't override toString(), so if you try to print one directly, you get the className + '@' + the hex of the  of the array, as defined by Object.toString():  int[] intArray = new int[] {1, 2, 3, 4, 5}; System.out.println(intArray);     // prints something like '[I@3343c8b3'   But usually, we'd actually want something more like [1, 2, 3, 4, 5]. What's the simplest way of doing that? Here are some example inputs and outputs:  // Array of primitives: int[] intArray = new int[] {1, 2, 3, 4, 5}; //output: [1, 2, 3, 4, 5]  // Array of object references: String[] strArray = new String[] {"John", "Mary", "Bob"}; //output: [John, Mary, Bob]
Cannot create custom config entity fails because ID is blank "did shoot" vs "shot" This morning I read this sentence (see ):     On July 24th and again on July 29th,   Egyptian police did shoot dead unarmed   African migrants attempting to cross   that border.   Why "did shoot" and not "shot"? What attracted Padmé to Anakin? What is the LaTeX command for "em dash" (—)? I am trying to insert the symbol in the title of the question, which I copied from a PDF article, but it appears as space in the output file. What is the corresponding LaTeX command? How does one show that $$\sum_{k=0}^{n}\binom{n+k}{k}\frac{1}{2^k}=2^{n}$$ for each nonnegative integer $n$?  I tried using the  but I guess I am applying it incorrectly. With the snake oil technique we have $$F(x)= \sum_{n=0}^{\infty}\left\{\sum_{k=0}^{n}\binom{n+k}{k}\frac{1}{2^k}\right\}x^{n}.$$ I think I have to interchage the summation and do something. But I am not quite comfortable in interchanging the summation. Like after interchaging the summation will $$F(x)=\sum_{k=0}^{n}\sum_{n=0}^{\infty}\binom{n+k}{k}\frac{1}{2^k}x^{n}?$$ Even if I continue with this I am unable to get the correct answer.  How does one prove this using the Snake oil technique?  A combinatorial proof is also welcome, as are other kinds of proofs. Proof that Conditional of Poisson distribution is Binomial Suppose you have an object with zero for the value of all the derivatives of position. In order to get the object moving you would need to increase the value of the velocity from zero to some finite value. A change is velocity is acceleration, so the value of the acceleration would have to increase from zero to some value. You would also need to increase the jerk from zero to some value to have a change in acceleration.  Is there an infinite series of higher derivatives of position for this to work? Or am I missing something? There's a part in my apps that displays the file path loaded by the user through OpenFileDialog. It's taking up too much space to display the whole path, but I don't want to display only the filename as it might be ambiguous. So I would prefer to show the file path relative to the assembly/exe directory.  For example, the assembly resides at C:\Program Files\Dummy Folder\MyProgram and the file at C:\Program Files\Dummy Folder\MyProgram\Data\datafile1.dat then I would like it to show .\Data\datafile1.dat. If the file is in C:\Program Files\Dummy Folder\datafile1.dat, then I would want ..\datafile1.dat. But if the file is at the root directory or 1 directory below root, then display the full path.   What solution would you recommend? Regex?  Basically I want to display useful file path info without taking too much screen space.  EDIT: Just to clarify a little bit more. The purpose of this solution is to help user or myself knowing which file did I loaded last and roughly from which directory was it from. I'm using a readonly textbox to display the path. Most of the time, the file path is much longer than the display space of the textbox. The path is supposed to be informative but not important enough as to take up more screen space.  Alex Brault comment was good, so is Jonathan Leffler. The Win32 function provided by DavidK only help with part of the problem, not the whole of it, but thanks anyway. As for James Newton-King solution, I'll give it a try later when I'm free. What does different focal length offer me? How to show that $f_{0}f_{1}+f_{1}f_{2}+...+f_{2n-1}f_{2n} = f^{2}_{2n}$ The following problem:  The Fibonacci number is denoted by  $f_{n}$, show that the following holds when $n$ is a positive integer:  $f_{0}f_{1}+f_{1}f_{2}+...+f_{2n-1}f_{2n} = f^{2}_{2n}$  My idea was to do an induction proof, which holds for $n$ = 1  $f_{0}f_{1} + f_{1}f_{2} = f^{2}_{2}$  So we assume it holds for $n$ and show for $n+1$  $f_{0}f_{1}+f_{1}f_{2}+...+f_{2n-1}f_{2n} + f_{2n}f_{2n+1} = f^{2}_{2n} + f_{2n}f_{2n+1}$  I fail to get  $f^{2}_{2n+1}$ out of the term  $f^{2}_{2n} + f_{2n}f_{2n+1}$  Is there a difference between "show that" and "prove that". So might be induction the wrong tool here?  Many thanks for your hints in advance :-) I am looking to create realistic car movement using vectors What is truecm? In examples found around the web, some people specify lengths such as width=5truecm with \includegraphics or the geometry package. How is this different from regular 5cm? Train loss and accuracy In theory, is it possible that the loss on the train set will increase together with the train set accuracy? (in the normal case the train set loss should go down) And vice versa, can the train loss decrease along with the accuracy?   Note: This is obviously different than the classic underfit / overfit cases which are easier to grasp. Prove that $\sum^{n}_{r=0}(-1)^r\cdot \large\frac{\binom{n}{r}}{\binom{r+3}{r}} = \frac{3!}{2(n+3)}$ Prove that $\displaystyle \sum^{n}_{r=0}(-1)^r\cdot \large\frac{\binom{n}{r}}{\binom{r+3}{r}} = \frac{3!}{2(n+3)}$   $\bf{My\; Try::}$ We can write $$\frac{\binom{n}{r}}{\binom{r+3}{r}} = \frac{n!}{r!\times (n-r)!}\times \frac{r!\times 3!}{(r+3)!} = \frac{3!\times n!}{(n-r)!\times (r+3)!}$$  So our sum is $$ 3!\sum^{n}_{r=0}(-1)^r\frac{n!}{(n-r)!\times (r+3)!} = \frac{3!}{(n+1)(n+2)(n+3)}\sum^{n}_{r=0}(-1)^r\frac{(n+3)!}{(r+3)!\times (n-r)!}$$  So we get Sum $$ \frac{3!}{(n+1)(n+2)(n+3)}\sum^{n}_{r=0}(-1)^r\binom{n+3}{r+3} = -\frac{3!}{(n+1)(n+2)}\sum^{n}_{r=0}(-1)^{r+3}\binom{n+3}{r+3}$$  $$  = -\frac{3!}{(n+1)(n+2)(n+3)}\left[-\binom{n+3}{3}+\binom{n+3}{4}-\binom{n+3}{5}--.......+(-1)^{n+3}\binom{n+3}{n+3}\right]$$  $$=-\frac{3!}{(n+1)(n+2)(n+3)}\left[\binom{n+3}{0}-\binom{n+3}{1}+\binom{n+3}{2}-\binom{n+3}{3}+\binom{n+3}{4}-\binom{n+3}{5}--.......+(-1)^{n+3}\binom{n+3}{n+3}\right]+\frac{3!}{(n+1)(n+2)(n+3)}\left[\binom{n+3}{0}-\binom{n+3}{1}+\binom{n+3}{2}\right]$$  So we get $$ = \frac{3!}{(n+1)(n+2)(n+3)}\left[1-(n+3)+\frac{(n+3)(n+2)}{2}\right] = \frac{3!}{(n+1)(n+2)}\times \frac{n^2+3n+2}{2} = \frac{3!}{(n+1)(n+2)(n+3)}\times \frac{(n+1)(n+2)}{2} = \frac{3!}{2(n+3)}$$  Can we prove it Using Combinatorial way,bcz above method is very lengthy  If yes then plz explain here  Thanks Make links posted by users open in a new window Most of the time when I follow a user's link, I just want to see their site, look it over, then return to answer their question (not leave SO completely and not come back). Could we make the links users post open in a new window please?  EDIT: I originally wanted this implemented because it's what some other sites did, but I now definitely prefer SO's way. If I want to open a new tab, I middle-click/control-click (or whatever); if not, I just click. I'm in control of what happens. Would never want to go back now. Is it possible to switch a certain Stack Exchange site's interface (as a personal preference) to the theme used by beta sites?  Some sites have flashy decorations or unreadable fonts (I prefer to disable antialiasing on fonts). It would be nice to have an option to see a site with the "beta" theme.  If there's a solution using custom styles, I would accept that as an answer. What is batch size in neural network? I'm using Python Keras package for neural network. This is the . Is batch_size equals to number of test samples? From Wikipedia we have  information:     However, in other cases, evaluating the sum-gradient may require   expensive evaluations of the gradients from all summand functions.   When the training set is enormous and no simple formulas exist,   evaluating the sums of gradients becomes very expensive, because   evaluating the gradient requires evaluating all the summand functions'   gradients. To economize on the computational cost at every iteration,   stochastic gradient descent samples a subset of summand functions at   every step. This is very effective in the case of large-scale machine   learning problems.   Above information is describing test data? Is this same as batch_size in keras (Number of samples per gradient update)? skype 4.3 cannot connect to account on ubuntu 14.04 LTS I have being using Skype for a long time on my Ubuntu 14.04 LTS. From this morning on, Skype simple cannot connect to my account anymore.  That is my Skype version:     Skype 4.3.0.37   © 2014 Skype and/or Microsoft   My Ubuntu system:  LSB Version:    core-2.0-amd64:core-2.0-noarch:core-3.0-amd64:core-3.0-noarch:core-3.1-amd64:core-3.1-noarch:core-3.2-amd64:core-3.2-noarch:core-4.0-amd64:core-4.0-noarch:core-4.1-amd64:core-4.1-noarch:cxx-3.0-amd64:cxx-3.0-noarch:cxx-3.1-amd64:cxx-3.1-noarch:cxx-3.2-amd64:cxx-3.2-noarch:cxx-4.0-amd64:cxx-4.0-noarch:cxx-4.1-amd64:cxx-4.1-noarch:desktop-3.1-amd64:desktop-3.1-noarch:desktop-3.2-amd64:desktop-3.2-noarch:desktop-4.0-amd64:desktop-4.0-noarch:desktop-4.1-amd64:desktop-4.1-noarch:graphics-2.0-amd64:graphics-2.0-noarch:graphics-3.0-amd64:graphics-3.0-noarch:graphics-3.1-amd64:graphics-3.1-noarch:graphics-3.2-amd64:graphics-3.2-noarch:graphics-4.0-amd64:graphics-4.0-noarch:graphics-4.1-amd64:graphics-4.1-noarch:languages-3.2-amd64:languages-3.2-noarch:languages-4.0-amd64:languages-4.0-noarch:languages-4.1-amd64:languages-4.1-noarch:multimedia-3.2-amd64:multimedia-3.2-noarch:multimedia-4.0-amd64:multimedia-4.0-noarch:multimedia-4.1-amd64:multimedia-4.1-noarch:printing-3.2-amd64:printing-3.2-noarch:printing-4.0-amd64:printing-4.0-noarch:printing-4.1-amd64:printing-4.1-noarch:qt4-3.1-amd64:qt4-3.1-noarch:security-4.0-amd64:security-4.0-noarch:security-4.1-amd64:security-4.1-noarch Distributor ID: Ubuntu Description:    Ubuntu 14.04.3 LTS Release:    14.04 Codename:   trusty   Any suggestion why or how to fix it?  Thanks in advance. When I open the file in Vim, I see strange ^M characters.  Unfortunately, the world's favorite search engine does not do well with special characters in queries, so I'm asking here:   What is this ^M character? How could it have got there? How do I get rid of it? Is there any way to know when I will receive my UK visa?