I am trying to move one a bunch of files at once, one directory up.  This is what I tried, but did not work:     mv ./*/__test__/index.js ./*/data.js   . ├── alpha │   ├── __test__ │   │   └── index.js │   ├── index.js │   └── test.js └── beta     ├── __test__     │   └── index.js     ├── index.js     └── test.js   To this:  . ├── alpha │   ├── data.js │   ├── index.js │   └── test.js └── beta     ├── data.js     ├── index.js     └── test.js   How can I do this in unix?
I am trying to copy multiple files named "F3.bam" two level of directories to up and then rename these files with the name of the sub-directory after copy.  For example:  /samples/mydata1/RUN1/ID_date/PCR2/TIME1/F3.bam /samples/mydata2/RUN1/ID2_date4/PCR2/TIME7/F3.bam /samples/mydataxxx/RUN1/IDxxx_datexxx/PCR2/TIMExxx/F3.bam   Expected results:  1. The files are first copied two directories level up:  /samples/mydata1/RUN1/ID_date/F3.bam /samples/mydata2/RUN1/ID2_date4/F3.bam /samples/mydataxxx/RUN1/IDxxx_datexxx/F3.bam   2. The files are renamed according to the name of the current sub-directory:  /samples/mydata1/RUN1/ID_date/ID_date_F3.bam /samples/mydata2/RUN1/ID2_date4/ID2_date4_F3.bam /samples/mydataxxx/RUN1/IDxxx_datexxx/IDxxx_datexxx_F3.bam   Ideally a bash loop would be great (working on a Mac).
I'm trying to prove that if there are to numbers $n,m$ (natural numbers), and their smallest common multiple is $k$, so that $k = n·i$ and $k = m·j$ for some $i,j$ natural numbers, any common multiple $q$ of $n,m$ is a multiple of $k$, so that there exists a $g$ so that $q=k·g$.  Logically it seems correct, but I can't seem to prove it... Any help? What can I do to lift a 10 year ban for making a mistake in my UK visa application? I am a Nigerian citizen.  In 2007 I was twice denied a visa to the UK.  Recently I was filling out an application for another UK visitor visa and by mistake I answered no to the question whether I had ever been denied a UK visa, instead of yes.  When reviewing my application, the visa officer found out about the previous visa rejections and as a result I got a 10 year ban on travel to the UK.  What can I do to lift my 10 year ban?   Will this ban affect my chances of obtaining a visitor visa to the USA? How do I unload (reload) a Python module? I have a long-running Python server and would like to be able to upgrade a service without restarting the server. What's the best way do do this?  if foo.py has changed:     unimport foo  &lt;-- How do I do this?     import foo     myfoo = foo.Foo() How to run both Intel and Nvidia graphics card driver on dual monitor setup? I'm trying to get Intel and Nvidia graphics card working together with two monitors. One monitor should use the Intel card and the other the Nvidia card. Of course, I want to use only one keyboard and one mouse to switch between both screens. Bumblebee didn't work for me.  I don't want to use the xserver-xorg-video-all package because I need the Nvidia card for gaming and I can't use only one graphics card because I need one for KVM virtualisation and the other one for my Linux desktop  So I tried to install the drivers and to configure the Xserver manually. The Nvidia driver is working and I get a video output. But I don't get a video output with the Intel card.  I followed   The config files: Footnote in tabular environment When umpire change the cricket ball, was the old ball thrown as waste or keep for reuse? Can Ubuntu really run all Windows programs? What's the NB30 or MM-TD in an iPhone description in GSX? What's the NB30 or  MM-TD in an iPhone description? I always see these nomenclatures Non block, etc, what does it mean? $H_0(X,A) = 0 \iff A \cap X_i \neq \emptyset \forall $ path-components $X_i$ I've been doing some more exercises in , in particular the following:  Show that $H_0(X,A) = 0$ iff $A$ meets each path-component of $X$.  "$\Leftarrow$": Let $x_i \in A \cap X_i \neq \emptyset \forall $ path-components $X_i$. Then for any $x \in X_i$ there is a path $\gamma$ from $x_i$ to $x$. They therefore differ by a boundary: $\partial \gamma = x - x_i$ and therefore $\{&#160;x \} = \{ x_i \}$ in $H_0(X,A) $. Therefore $H_0(X,A) = 0$.  "$\Rightarrow$" Now for this direction I'm not so sure and I'd be glad if you could give me a hint. Let $H_0(X,A) = 0$. By definition, the relative homology group is calculated from the following sequence of chain groups:  $$ 0 \rightarrow C_0(A) \rightarrow C_0(X) \xrightarrow{\partial_1} C_0(X) / C_0(A) \xrightarrow{\partial_0} 0$$  Then $H_0(X, A) = H_0(C_0(X) / C_0(A)) = ker \partial_0 / im \partial_0 = (C_0(X) / C_0(A) ) / im \partial_1 = 0$.  There are two cases where this equality holds:  (i) $C_0(X) / C_0(A) = 0$  (ii) $im \partial_1 = C_0(X) / C_0(A)$  In case (i), $A \cap X_i \neq \emptyset$ for all $X_i$.  In case (ii) I'm not sure how to proceed. Can you give me a hint? Many thanks for your help!  Edit Or maybe I could do the second direction like this:  $$0 = H_0(X,A) = \oplus_i H_0(X_i, A) \implies  H_0(X_i, A) = 0 \forall i$$  $$ \implies A \cap X_i \neq \emptyset \forall i$$? What is syntax highlighting and how does it work? Are upvotes on competing posts counted per question or per answer for Sportsmanship? The definition of the :     Up voted 100 competing answers   doesn't specify whether each upvote on competing answers to the same question counts towards this criteria, or if it's limited to one "point" per question no matter how many additional competing answers you upvote. Can someone explain how it works? Why are my textures pink? PHB says 'once per turn,' so, it would seem that a Rogue with Sentinel, for example, could "consistently" deal Sneak attack twice per round (whether the enemy triggers an OA or the melee weapon attack provided by the Feat).  So, can rogues deal sneak attack damage with any weapon attack outside their turn? (obv. one that meets the standard requirements--finesse, adv or adj ally) Is there a shortcode for linking to a user profile in an answer? Sometimes I want to refer to a specific user in an answer.  Something along the lines of      "From the answers of UserA and UserB I have crafted this super useful solution..."   Is there a shortcode creating a link to a user profile using the user name? Similar to the @ we have in the comments, but in an answer. This question led to a new package:      How can I display the full path of the tex file that I compile? It is a simple file, no include or input present.  Edit: I use MiKTeX 2.9 on a Windows 7 64-bit.  Less demanding: If not possible, then I will be satisfied with a partial path (at least one or two folders up + the filename). I want to color sketches in Photoshop, but when I prepared the sketch (using Levels, Hue, and other modifications) to turn it into workable line art, some details were missing. I think it depends on how you draw your sketch.  What are important steps for drawing a sketch (with pen or pencil) that is to be colored in Photoshop? A step-by-step instruction would be appreciated.  For instance, here it is the sketch    This is after my preparations in Photoshop Show that there exists a unique $v_0 \in H^1(0,1)$ such that $u(0)=\int_0^1(u'v_0'+uv_0), \forall u \in H^1(0,1)$ From Wikipedia: Fermi was known for his ability to make good approximate calculations with little or no actual data, hence the name. One example is his estimate of the strength of the atomic bomb detonated at the Trinity test, based on the distance travelled by pieces of paper dropped from his hand during the blast. Fermi's estimate of 10 kilotons of TNT was remarkably close to the now-accepted value of around 20 kilotons, a difference of less than one order of magnitude.  I have not been able to find any references explaining how he made this calculation. Please provide a reference or an example calculation.  See also: How to install Eclipse? I want to install the latest version of Eclipse but the Ubuntu Software Centre contains an older version.  Is there a PPA or some other way to install latest Eclipse? Please describe the steps for full installation. Significance contradiction in linear regression: significant t-test for a coefficient vs non-significant overall F-statistic