Get filename and add to list
Given a filesystem path, is there a shorter way to extract the filename without its extension?
I need to run Firefox browser from terminal. Browser works fine, but terminal still waits for Firefox to return and if I do CTRL+C, it terminates Firefox. How to run command to make Firefox work independently from terminal? how to add xsl attribute It is a common practice to apply PCA (principal component analysis) before a clustering algorithm (such as k-means). It is believed that it improves the clustering results in practice (noise reduction).   However I am interested in a comparative and in-depth study of the relationship between PCA and k-means. For example, Chris Ding and Xiaofeng He, 2004,  showed that "principal components are the continuous solutions to the discrete cluster membership indicators for K-means clustering". However, I have hard time understanding this paper, and Wikipedia actually .  Also, the results of the two methods are somewhat different in the sense that PCA helps to reduce the number of "features" while preserving the variance, whereas clustering reduces the number of "data-points" by summarizing several points by their expectations/means (in the case of k-means). So if the dataset consists in $N$ points with $T$ features each, PCA aims at compressing the $T$ features whereas clustering aims at compressing the $N$ data-points.  I am looking for a layman explanation of the relations between these two techniques + some more technical papers relating the two techniques. How do I locate all files that include specific word as part of name and end with specific extension? From what I know, it is unknown whether $x_n=x_{n-1}^2 + 1$ has a closed form. Is there a recurrence relation which is known to have no closed form with a proof of inexistence?  Assuming a closed form is a non recursive description using the elementary operations of addition multiplication and power, or, assuming any other good definition of "closed form".  Edit  There are similar questions out there, but the answers are a little bit going around the question.   So is there one with proof or is it unknown? And if it depends on the definition of a closed form, then what are the (or some) options? How strong can a closed form definition be to still have a recursive relation that can be proved to not being able to have its form?  Update  Because it is a big question, and I don't want to open a new small one, I think a good representative small question about this subject is:  Is there a recurrence relation with a domain of the natural numbers, described by elementary functions, which has no closed form defined as:  A closed form of a recurrence relation with a domain of natural numbers is a function $f$ that can be described as a composition of a constant number of elementary functions without reccursion. i.e, $f(n) = f_1(f_2( \dots (f_k(n))) \dots) $ where $f_i$ is elementary for all $1 \leq i \leq k$   I think this definition is the most intuitive and basic.  For example, the relation $x_n = x_{n-1}+1$ has a closed form in this sense: $$f(n) = f_1(f_2(f_3(f_4(n))))$$  Where $f_1$ is division, $f_2(n)=(n,2)$, $f_3$ is multiplication and $f_4(n) = (n,n+1)$   Is there a recurrence relation which has no closed form in this sense? How to make a film in black and white and add color to some objects? How is a movie made to show selective colors. For instance, in  a sister and brother are transported to the universe of an old black and white TV show, and the movie switches to being B&amp;W. Then, as the protagonists cause the inhabitants to have 'real' emotions, like fright, anger, or love, things (people, places, etc.) start having color. In the middle of the movie, many objects are still B&amp;W, yet many more are now colorized.   also used this effect (the whole film was initially shot in full color, and was converted to black-and-white. Colorization is used on certain subjects in a scene), for example.  How is this effect achieved? Is it post-production editing? What techniques might a director employ to do this? Prove the following using epsilon-delta definition:  Let $a \in \mathbb{R}$ and $f,g$ be defined on $\mathbb{R}$.  If  $$\lim_{x\to a} f(x) = 647 \tag 1$$  and $$\lim_{x\to a} g(x) = \infty \tag 2$$ then   $$\lim_{x\to a} f(x) + g(x) = \infty.$$  $$(1) \implies\forall \epsilon &gt; 0, \exists \delta &gt; 0, s.t. |x-a|&lt;\delta \implies |f(x)-647| &lt; \epsilon$$  $$(2) \implies \forall M &gt; 0, \exists \delta_2 &gt; 0, s.t. |x-a|&lt;\delta_2 \implies |g(x)| &gt; M$$  Not sure about this... I've set up the definitions. I believe we will have to take a minimum between the deltas for first two limits then use it in the third.  Anyone have any clues? Wikipedia says "In the mathematical discipline of linear algebra, a matrix decomposition or matrix factorization is a factorization of a matrix into a product of matrices. There are many different matrix decompositions; each finds use among a particular class of problems."  But in my opinion decomposition term should be used to represent breaking a matrix in different sub-matrices or some new matrices created after some operation on original matrix which if used together and passed through some algorithm(not necessarily product), shall reproduce the original matrix.  Is there some different terminology to represent what I am expecting to say? limit of integral $n\int_{0}^{1} x^n f(x) \text{d}x$ as $n\rightarrow \infty$ I am trying to solve the following problem at the level of a senior undergrad analysis level. So, the problem is as follows: We are given a function $f$ which is continuous on the interval $\left [ 0,1 \right ]$, and the question is to find the limit: $$\lim_{n\rightarrow \infty}\int_{0}^{1}x^{n}f(x)dx\;.$$ The second part of the problem is to deduce the following limit: $$\lim_{n\rightarrow \infty}n\int_{0}^{1}x^{n}f(x)dx\;.$$  For the first part: I just did the following: For every $0\leq x&lt; 1$: $x\leq M$, where $0&lt; M&lt; 1$. Then: $$\int_{0}^{1}x^{n}f(x)dx\leq M^{n}\int_{0}^{1}f(x)dx\;.$$ Then: $$\lim_{n\rightarrow \infty }\int_{0}^{1}x^{n}f(x)dx\leq \lim_{n\rightarrow \infty }M^{n}\int_{0}^{1}f(x)dx= 0.\int_{0}^{1}f(x)dx=0\;,$$ so $$\lim_{n\rightarrow \infty }\int_{0}^{1}x^{n}f(x)dx=\lim_{n\rightarrow \infty }f(1)\int_{0}^{1}1dx=f(1)\;.$$ Does that make sense? If not, please show me the correct one.  As for the second part, I have no idea what to do. Any help? I am working on plugin to Drupal Commerce, and I started getting this error:   DatabaseTransactionOutOfOrderException: in DatabaseConnection-&gt;rollback() (line 1058 of /Library/WebServer/Documents/includes/database/database.inc).   Can anyone shed some light on what this error means? If I install a fresh drupal and reinstall my plugin, is that likely to clear things up?   Any advice?   Thanks! Prove $\sup(f+g) \le \sup f + \sup g$ Suppose $D$ is a nonempty bounded subset of reals. Let $f:D \to \mathbb R$ and $g:D \to \mathbb R$. Define $(f+g)(x)=f(x)+g(x)$. Prove $\sup(f+g)(D) \le \sup f(D) + \sup g(D)$ (also prove that $\sup (f+g)$ exists).   I understand why this is the case, just not how to prove it. Left side is pretty much $\sup  (f(x)+g(x))$ and right side is $\sup (f(x) + g(y))$ for $x,\,y \in D$. Basically $f+g$ has to use the same variable and $f(D)+g(D)$ use different ones. But I don't know how to go about proving this.     The second part of the question is to find a specific example where strict inequality holds.    Let $D=\{a,b\}$ and $f: a \to 1,\, b\to 0, \,g: a \to 0,\, b\to 1$. $\sup f(D) = 1,\, \sup g(D) = 1,\, \sup f(D) + \sup g(D) = 2.$ $\sup (f+g)(D) = 1$ (if we choose a, $f+g = 1+0,\, b,\, f+g=0+1$). 6-digit password - a special decoding method What is the life expectancy of a Wookiee? At lunch, my coworkers and I were discussing The Force Awakens, and started questioning Chewbacca's age.  A quick check of  and it says he is possibly about 230 years old as of Episode VII.  Following the  link on that page, Wookieepedia claims that they live to be 400 years old.  Do we know from canon what the average life expectancy of a Wookiee is? How to change from German to English in the File Manager in Ubuntu 15.10? My months and days in my File Manager are in German, how do I change that? On the photo you see 'Dez' : It means Dezember (German for December). I also saw one day Mittwoch (German for Wednesday). How do I change that German issue? This is only my File Manager and not completly but partially. Weird. Grant group traversal rights on a folder Function with limits only at irrational points This is the starred example 5.1.8 in Krantz' Real Analysis and Foundations.     Give an example of a function $f: \mathbb{R} \rightarrow \mathbb{R}$ so that $\lim_{x\rightarrow c} f(x)$ exists when $c$ is irrational but does not exist when $c$ is rational.   I'm aware of the Dirichlet and Thomae functions but this seems slightly different. I'm not even sure a solution exists. Thanks for any help! I'm looking for a story that was probably written somewhere from the 1940s to the 1960s. I think I read it in an anthology, possibly in the 1970s.  A group of human explorers landed on a planet with primitive aliens, living in hunter-gatherer villages. They hoped to make a profit from trading our goods for—well, I'm not clear on what they wanted from the aliens.  The native people learned the human language before the explorers could learn theirs. Then the natives suddenly started producing technological innovations far beyond what they originally used. I remember that wooden sailing ships suddenly replaced their canoes. All the natives had to do was hear a story once from the explorers before copying the technology in the story.  Finally, the explorers realized that the natives were much, much smarter than us and that Earth faced a serious problem.  I'm fairly certain that it wasn't a Heinlein story, but I remember that it had some qualities similar to his work. How does the double strike mechanic interact with other mechanics like lifelink or trample? Side effects of changing blackboard bold font with \setmathfont Proving that $\frac{1}{1\cdot 2} + \frac{1}{2\cdot 3} + \frac{1}{3 \cdot 4} +\ldots + \frac{1}{n(n+1)} = \frac{n}{n+1}$ How would we go about proving that $$\frac{1}{1\cdot 2} + \frac{1}{2\cdot 3} + \frac{1}{3 \cdot 4} +\ldots +\frac{1}{n(n+1)} = \frac{n}{n+1}$$