I was using Drush version 5.3 in my remote server with no problem at all. I got it working just uploading the the tar.gz from drupal.org to the root of my server. Then I could use commands like: drush/drush cc all, drush/drush cron,... So far so good.  Now I need to update Drush, then I downloaded drush from:  and did the same: I uploaded the drush folder to the root of my server. But when I try to run a command like drush/drush cron I get this message:  Unable to load autoload.php. Drush now requires Composer in order to install its dependencies and autoload classes. Please see README.md  What does this mean?
I've installed drush in /usr/local/lib/drush/drush and composer in /usr/local/bin/composer.  When I try to run drush /usr/local/lib/drush/drush I get the following:     /usr/local/lib/drush/drush: line 129: /Applications/MAMP/bin/php/php5.2.17/bin: is a directory /usr/local/lib/drush/drush: line 129: exec: /Applications/MAMP/bin/php/php5.2.17/bin: cannot execute: Undefined error: 0 –    OR the following:     Unable to load autoload.php. Drush now requires Composer in order to install its depedencies and autoload classes. Please see README.md   What am I doing wrong? I'd like to install drush to use with MAMP if anyone has any suggestions. I've done through the readme and nothing seems to be working.
During self-study, I ran across the question of how many ways six numbers can be chosen from the numbers 1 - 49 without replacement, stipulating that no two of the numbers be consecutive.  I can obtain a simple lower bound by saying that, in the worst-case scenario, when you choose a particular number, there are now three numbers that cannot be chosen next.  For example, if I first pick 17, then I can't choose 16, 17, or 18 for the remaining choices.  This gives me the lower bound  $$\frac{49*46*43*40*37*34}{6!} = 6,773,770 \frac{8}{9}$$  This is about 48% of ${}_{49}C_6 =  13,983,816$.  The real answer must be bigger (and an integer).  I haven't found a way to calculate it, though.  The original problem asked to show that the probability of having non-consecutive integers when you choose six is greater than 50%, so if the problem is complicated to count exactly, better approximations that show the answer is above 50% would also be appreciated.   Of course, I can use a computer to do the counting, but I'm interested in learning what methods I'm missing. How to change the forgotten root password? I forgot my root password...actually I think I know what it is because it is the same password I have for pretty much everything but in the Terminal in tell me "Sorry, try again." Is there a way to reset the password? If so how? UK coastline shapefile? In Quantum Mechanics we usually consider operator-valued functions: these are functions that take in real numbers and gives back operators on the Hilbert space of the quantum system.  There are several examples of these. One of them is when we work with the Heisenberg picture, where we need to consider functions $\alpha : \mathbb{R}\to \mathcal{L}(\mathcal{H})$ such that $\alpha(t)$ is the operator at time $t$.  Another example is when we deal with exponentiation of operators, like when building the time evolution operator:  $$U(t,t_0)=\exp\left(-i\frac{H}{\hbar}(t-t_0)\right),$$  Here, the $\exp$ is usually understood as being defined via the eigenvalues of $H$.  The point is, the idea of a function $\alpha : \mathbb{R}\to \mathcal{L}(\mathcal{H})$ appears quite often in Quantum Mechanics, and sometimes one needs to differentiate these. In practice we do it formally, using all the properties we would expect, but I'm curious about how one would properly define this.  If we were dealing with bounded operators, then we could use the operator norm, which is available for this kind of operator, and define the derivative as we can usually we do when there's some norm around.  The point is that in Quantum Mechanics most of the time operators are unbounded.  So in the general case, how can one define the derivative of one operator-valued function? To mean "He is a friend of mine who I love" or "He is a friend of mine that I love", can I say "He is a friend of mine I love"? When I omit "who" or "that" in that sentence, it sounds wrong to me. I think I am not used to that structure. What do you think?  Note: I know (that) relative pronouns can be dropped like in "He is someone (that/who) I love", but in the sentence I gave, I think it is wrong to omit it because "a friend" was already modified by "of mine".  Context: I am talking about a friend, and I am saying I love him. What is the use of the square brackets [] in sql statements? I've noticed that Visual Studio 2008 is placing square brackets around column names in sql. Do the brackets offer any advantage? When I hand code T-SQL I've never bothered with them.  Example:  Visual Studio:  SELECT [column1], [column2] etc...   My own way:  SELECT column1, column2 etc... Intersection of two lists in Bash How are the degrees of freedom in the emmeans package calculated? - R Is there a way to tell Nautilus not to generate previews of PDF files? I tend to download lots of articles as PDFs, and I find that when I browse a directory of these Nautilus takes 1 minute to load the directory. I assume that's because it's generating previews of their front pages. That feature is useless to me, alas.  I'd like to tell it not to do that. I'm having difficulty with exercise 1.43 of Lang's Algebra. The question states     Let $H$ be a subgroup of a finite abelian group $G$. Show that $G$ has a subgroup that is isomorphic to $G/H$.   Thinking about this for a bit, the only reasonable approach I could think of was to construct some surjective homomorphism $\phi\colon G\to K$ for $K\leq G$, and $\ker\phi=H$, and then just use the isomorphism theorems to get the result.  After a while of trying, I've failed to come up with a good map, since $H$ seems so arbitrary. I'm curious, how can one construct the desired homomorphism? This is just the approach I thought of, if there's a better one, I wouldn't mind seeing that either/instead. Thank you. I'm trying to change the cpu frequency on my laptop (running Linux), and not having any success. Here are some details:    # uname -a Linux yoga 3.12.21-gentoo-r1 #4 SMP Thu Jul 10 17:32:31 HKT 2014 x86_64 Intel(R) Core(TM) i5-3317U CPU @ 1.70GHz GenuineIntel GNU/Linux  # cpufreq-info cpufrequtils 008: cpufreq-info (C) Dominik Brodowski 2004-2009 Report errors and bugs to cpufreq@vger.kernel.org, please. analyzing CPU 0:   driver: intel_pstate   CPUs which run at the same hardware frequency: 0   CPUs which need to have their frequency coordinated by software: 0   maximum transition latency: 0.97 ms.   hardware limits: 800 MHz - 2.60 GHz   available cpufreq governors: performance, powersave   current policy: frequency should be within 800 MHz and 2.60 GHz.                   The governor "powersave" may decide which speed to use                   within this range.   current CPU frequency is 2.42 GHz (asserted by call to hardware). (similar information for cpus 1, 2 and 3)  # cat /sys/devices/system/cpu/cpu0/cpufreq/scaling_available_governors performance powersave   I initially had the userspace governor built into the kernel, but then I also tried building it as a module (with the same results); it was loaded while running the above commands (and I couldn't find any system messages when loading it):  # lsmod Module                  Size  Used by cpufreq_userspace       1525  0 (some other modules)   And here are the commands I tried for changing the frequency:  # cpufreq-set -f 800MHz Error setting new values. Common errors: - Do you have proper administration rights? (super-user?) - Is the governor you requested available and modprobed? - Trying to set an invalid policy? - Trying to set a specific frequency, but userspace governor is not available,    for example because of hardware which cannot be set to a specific frequency    or because the userspace governor isn't loaded?  # cpufreq-set -g userspace   Error setting new values. Common errors: - Do you have proper administration rights? (super-user?) - Is the governor you requested available and modprobed? - Trying to set an invalid policy? - Trying to set a specific frequency, but userspace governor is not available,    for example because of hardware which cannot be set to a specific frequency    or because the userspace governor isn't loaded?   Any ideas? fontenc vs inputenc My daughter is a US Citizen. We (parents)are also planning to permanently settle in US. We will go their as Permanent Resident,as per US Law. We have a house here in India worth Rs.2 Crores.  We want to sell it and take money with us. We have ordinary savings Bank account here in India.  My US Citizen Daughter is a Income Tax payer.  Now your advises are required as under:   What are the routes to take money from India to US and our tax liabilities Can I gift this whole amount to my US Citizen Daughter or what is the maximum limit of Gift amount.  What will be the tax liability on me and on my Daughter in case of Gift   Whether I have to show it in my Income Tax Return or in my Daughter's Tax Return. What US Income Tax Laws says. What will be the procedure to send money as Gift to my Daughter. Will the money will go directly from my Bank Act.to my Daughter's Bank Account. Will there will be wire transfer from bank to bank Can I send money through other money sender Certified Companies also.    Please advise. If there is something more on the subject to make me understand, please advise. Thanks, After I installed Ubuntu 13.04, I can't mount my NTFS partition.  Error mounting /dev/sda5 at /media/mrxfly/xFLyDiskData: Command-line `mount -t "ntfs" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000,dmask=0077,fmask=0177" "/dev/sda5" "/media/mrxfly/xFLyDiskData"' exited with non-zero exit status 14: The disk contains an unclean file system (0, 0). Metadata kept in Windows cache, refused to mount. Failed to mount '/dev/sda5': Operation not permitted The NTFS partition is in an unsafe state. Please resume and shutdown Windows fully (no hibernation or fast restarting), or mount the volume read-only with the 'ro' mount option. Is selenium webdriver capable of database testing? After reading so many answers and forums it makes me confused. Some people say: Selenium webdriver is a browser automation tool and it has nothing to do with the database. And some other showing JARs and code that how we can connect selenium to the database and we can test database using selenium webdriver. So I would really like to know if we can do database testing using selenium? If yes then which databases tool it supports like Mysql, SQL server, Oracle... And if selenium is not suitable for database testing then please recommend to me the best tool for database testing. If the dual spaces are isometrically isomorphic are the spaces isomorphic? Is it possible for reviewers to mistakenly reject a quality paper? Example of a finitely generated faithful torsion module over a commutative ring Can a finitely generated module $M$ over a commutative ring have $\operatorname{Ann}(x) \neq 0$ for all $x \in M$ while $\operatorname{Ann}(M) = 0$?  It's not difficult to show that there is no such module if the ring is a integral domain. For general, I guess the answer is yes. But I failed to find a desired example. Let $m$ be Lebesgue measure and $a \in R$. Suppose that $f : R \to R$ is integrable, and $\int_a^xf(y) \, dy = 0$ for all $x$. Then $f = 0$ a.e. This is a corollary to a proof in Bass, but I don't understand why it follows from the proof he gives. I follow everything up until the last statement. Why is it that proving that the integral is $0$ for all Borel measurable sets guarantees it is true for all Lebesgue measurable sets? Am I missing something vital about the relationship between Lebesgue measurable sets and Borel measurable sets? Statement: Let $m$ be Lebesgue measure and $a \in\mathbb R$. Suppose that $f : \mathbb R \to\mathbb R$ is integrable, and $\int_a^xf(y) \, dy = 0$ for all $x$. Then $f = 0$ a.e. Proof: We prove the conclusion first for intervals, then for unions of intervals, then for open sets, then for Borel measurable sets. For any interval $(c,d)$, we have $$\int_c^df = \int_a^d f - \int^c_a f = 0.$$ By linearity, if $G$ is the finite union of disjoint open intervals, then $\int_G f = 0$. Now, if $G$ is open, then $G$ is the countable union of disjoint, open intervals, $G = \bigcup^n_{i=1}I_i$. We have $$\int_G f = \int \lim_{n\to\infty} f \cdot \chi_{\bigcup^n_{i=1} I_i}$$ and since $f_n$ is integrable for all $n$, and $|f_n| \le f$ for all $n$, by the dominated convergence theorem, $$\int_G f = \lim_{n\to\infty} \int_{\bigcup^n_{i=1}I_i} f =0.$$ Now, if $G_n$ is a decreasing sequence of open sets converging to $H$, since $|f \cdot \chi_{G_n}| \le f \cdot \chi_{G_1}$ for all $n$, we again have by the DCT that $\int_H f = 0 = \lim_{n\to\infty} \int_{G_n}f = 0$. Finally, if $G$ is a Borel measurable set, then we know that there exists a sequence $G_n$ of decreasing, open sets, that converge to some set $H$, where $H \setminus G$ is a null set. Thus, $$\int_G f = \int_H f = 0.$$ We have found that for every Borel measurable set $G$, $\int_G f =0$. Since $f$ is real valued and measurable, $f = 0$ a.e. Let $q \in \mathbb C$, $\|q\|=1$ and $q^n \neq 1, \forall n \in \mathbb N$. Show that $\{q^n: n \in \mathbb N\}$ is dense in $S^1$ Let $q \in \mathbb C$, $|q|=1$ and $q^n \neq 1, \forall n \in \mathbb N$. Show that $\{q^n:  n \in \mathbb N\}$ is dense in $S^1$.  My attempt: As $(q^n)$ is limited, there is subsequence $(q^{n_j})$ convergent. So given $\epsilon &gt; 0, \exists j_0 \in \mathbb N, \quad |q^{n_j} - q^{n_k}| &lt; \epsilon, \quad \forall j,k \geq j_0$. Supose that $n_j &gt; n_k$, then  $|q^{n_j} - q^{n_k}| = |q^{n_k}||q^{n_j - n_k} - 1| = |q^{n_j - n_k} - 1| &lt; \epsilon, \quad \forall j, k \geq j_0$. So, there is a subsequence of $(q^n)$ that converges to $1$.  Using this fact, how can I ensure that for all $w \in S^1$ there is a subsequence of $(q^n)$ that converges to  $w$?