Let's say I wish to create an alias for the command: find /path -not -path '*/\.*' Specifically, I'd like an alias nfind so that I can type nfind /my/path Setting: alias nfind='find /path -not -path '*/\.*'' this of course doesn't work, since I have no way to change the /path via calling the alias nfind. Is there a way I can make this happen?
For bash script, I can use "$@" to access arguments. What's the equivalent when I use an alias?
When you pass a collection like list, array to another function in python, does it make a copy of it, or is it just a pointer? Story with multiple 'third planet' races I'm looking for the name and author of a novel (or possibly novella). I first read this in the seventies, and might be older than that. It might have been written for teenagers.  The story takes place on a planet inhabited by a primitive humanoid race, roughly stone age if I remember rightly. Visiting this planet is a small team from a more advanced race, also humanoid and with spacefaring technology (obviously!). They are either there to help or observe, no nefarious purposes. I think they are avoiding contact with the primitives, at least initially. It's explicitly mentioned that the planet they are visiting is the third one of a medium sized star, just like their own homeworld. Also orbiting round the planet is an even more advanced race, using high tech to remain hidden from both the others. They are observing the whole situation, and again its mentioned that this is a 'third planet', like their own homeworld.  I'm a little bit hazy on the rest of the plot, but I think the super-advanced race end up revealing themselves, even though they are not supposed to.  The story is told from the viewpoints of both the second and third races (maybe also the first, I forget)  EDIT: For the record it turns out my recollection was faulty, and the second race are indeed coming to the planet for nefarious purposes. And the planet is at the medieval stage, not stone age. Can you give a simple intuitive explanation of IRLS method to find the MLE of a GLM? Background:   I'm trying to follow .  I understand the basics of MLE estimation: likelihood, score, observed and expected Fisher information and the Fisher scoring technique. And I know how to justify .    The question:   I can't understand even the first line of this method :(   What's the intuition behind the $z_i$ working variables defined as:  $$ z_i = \hat\eta_i + (y_i -\hat\mu_i)\frac{d\eta_i}{d\mu_i}$$  Why are they used instead of $y_i$ to estimate $\beta$?   And what's their relation with the response/link function which is the connection between $\eta$ and $\mu$  If anyone has a simple explanation or can direct me to a more basic-level text about this I would be grateful. How to filter string for unwanted characters using regex? Disfigured Feynman Diagrams! Difference between "theoretical computer science" and (beta) "computer science" Possible Duplicate:          Title says it all. From what I can see, "theoretical computer science" questions seem to be slightly more isolated to discussing algorithms, whereas "computer science" seems to have questions that are slightly broader and higher-level. Is there any place on the Stack Exchange sites where they give a longer description?  I'm just curious as to what niche the beta "computer science" site is meant to fill, as I see many topics in both forums that overlap. Irreducibility check for polynomials not satisfying Eisenstein Criterion. My Question is to check Irreducibility for polynomials not satisfying Eisenstein Criterion.  As an Illustration, to check whether $x^{p-1}+.....+x+1$ for p a prime is irreducible or not, we replaced $x$ by $x+1$ and by using Eisenstein's Criterion for the resulting polynomial we conclude that resulting polynomial is irreducible and so is the original polynomial.  In general, for a given irreducible polynomial $f(x)$ with coefficients in a known U.F.D, is there some element $a$ such that we can apply Eisenstein's criterion to $f(x+a)$?  I am sure there would be no general structure for this but I expect there to be at least some special cases.   Any Reference/suggestion would be appreciated.  Thank You. How does the Commander interact with Banishing Light or Oblivion Ring? What happens if a commander is sent to the command zone via  and then enchantment is destroyed? Can the commander return to the battlefield from the command zone?.  I think that  would not allow that to happen. How to format table with long column head entries? sum of the residue at all poles of the rational function p/q is 0. We are given two polynomials p, q with deg(q)>1+deg(p). Show that the sum of the residue at all poles of the rational function p/q is 0.   How do I go about solving this? How can I combine two plots? My installer build "signs" a DLL using a Code Signing certificate during the build process.   I've noticed that if I try to build twice in succession, the second build fails because the DLL is already signed so signcode chokes. Obviously I can fix this by signing a copy of the DLL in the build, but the problem intrigued me:   Is it possible to "unsign" a DLL, and if not, why not...? I like some of the features provided by the Vim-LaTeX suite, but not all of them.  In particular, I dislike all of the mappings like [[ = \left[ \right] and the automatic placeholder stuff with &lt;++&gt;. I am a very fast typist but with that comes more typing mistakes, which I correct almost instantly by pressing backspace. Unfortunately, if something has automatically added a bunch of place-holders or expanded some expression, I then have to move around the document and remove more characters than necessary. For example, if I accidentally press [ twice, instead of only having to delete one character, I have to delete 10.  Having already looked through the documentation, and some of the source, I have managed to disable some of these "features", but not all of them:  In particular:  let g:Tex_SmartKeyBS = 0 let g:Tex_SmartKeyQuote = 0 let g:Tex_SmartKeyDot = 0   (Turn off maps for backspace, double quote and triple dot.)  let g:Imap_UsePlaceHolders = 0   (Turn off &lt;++&gt; placeholder insertion.)  But I can't seem to find a way of turning off the other stuff. Anyone have any suggestions?  Edit: I was able to "disable" some more things by setting:  let g:Tex_Leader = '`tex' let g:Tex_Leader2 = ',tex'   (Which stops some expansions but still not all. It's not really disabling it but just making it less likely that you're going to type in `texa as opposed to the potentially more common `a, for example.)  PS: Personally, I think it is very poor practice to make an optional package that, when installed, greatly changes the default handling of your system. I don't mind some intelligent source highlighting etc, or some new commands (that don't clobber any old ones), but it seems unhelpful to enable this drastic kind of key remapping by default. The  mentions that it's possible to post one more question after a six-months waiting period and if the question is good enough, the question ban can be lifted:     If you're unable to improve your existing questions, you'll get the chance to ask one new one 6 months after your last question. If that question is positively received, you may be able to continue asking questions; if not, then the ban will be reinstated.   What is positively received in this context? Is it enough if the question has a zero score and is not closed? Or does it have to have a positive score?  How long does the system wait after posting this new question to evaluate this criteria and possibly lift (or reinstate) the question ban? First, my apologies if this has already been asked/answered.  I wasn't able to find this question via search.  My question comes from Rudin's "Principles of Mathematical Analysis," or "Baby Rudin," Ch 1, Example 1.1 on p. 2.  In the second version of the proof, showing that sets A and B do not have greatest or lowest elements respectively, he presents a seemingly arbitrary assignment of a number $q$ that satisfies equations (3) and (4), plus other conditions needed to show that $q$ is the right number for the proof.  As an exercise, I tried to derive his choice of $q$ so that I may learn more about the problem.  If we write equations (3) as $q = p - (p^2 - 2)x$, we can write (4) as   $$ q^2 - 2 = (p^2 - 2)[1 - 2px + (p^2 - 2)x^2]. $$  Here, we need a rational $x &gt; 0$, chosen such that the expression in $[...]$ is positive.  Using the quadratic formula and the sign of $(p^2 - 2)$, it can be shown that we need   $$ x \in \left(0, \frac{1}{p + \sqrt{2}}\right) \mbox{ for } p \in A, $$  or, for $p \in B$, $x &lt; 1/\left(p + \sqrt{2}\right)$ or $x &gt; 1/\left(p - \sqrt{2}\right)$.  Notice that there are MANY solutions to these equations! The easiest to see, perhaps, is letting $x = 1/(p + n)$ for $n \geq 2$.  Notice that Rudin chooses $n = 2$ for his answer, but it checks out easily for other $n$.  The Question:  Why does Rudin choose $x = 1/(p + 2)$ specifically?  Is it just to make the expressions work out clearly algebraically?  Why doesn't he comment on his particular choice or the nature of the set of solutions that will work for the proof?  Is there a simpler derivation for the number $q$ that I am missing? I cant change to faces or edges view! Automatically building a database of forward and backward citations My goal is to produce a graph showing the linkages (and lack there of) between several fields that share a common subproblem by showing who cites whom.  There are many databases that show citations between papers: , , and Google Scholar.  However none allows me to download even part of their database.  Is there some database I have overlooked?  Has someone written a scrapper for one of these websites?    For reference, the fields I'm considering are Mechanics, Magnetic Resonance Imaging, Signal Processing, Geophysics, and several others. How to add a list of vectors (lists) to a directed graph as an edge weight? Postfix Connection Timed out I used the  tutorial below to setup postfix and dovecot on a Digital Ocean server. But I'm getting "Connection Timed out" when postfix/smtp tries to deliver an email to a remote host like gmail or yahoo..      RECEIVING A NEW MESSAGE /var/log/mail.log    Feb 2 22:33:38 localhost dovecot: auth-worker: Debug: Loading modules from directory: /usr/lib/dovecot/modules/auth  Feb 2 22:33:38 localhost dovecot: auth-worker: Debug: pam(app,189.63.49.XXX): lookup service=dovecot  Feb 2 22:33:38 localhost dovecot: auth-worker: Debug: pam(app,189.63.49.XXX): #1/1 style=1 msg=Password:   Feb 2 22:33:38 localhost dovecot: auth: Debug: client out: OK#0111#011user=app  Feb 2 22:33:40 localhost postfix/submission/smtpd[1045]: E9AA724264: client=unknown[189.63.49.XXX], sasl_method=PLAIN, sasl_username=app  Feb 2 22:33:43 localhost postfix/cleanup[1052]: E9AA724264: message-id=  Feb 2 22:33:43 localhost postfix/qmgr[32661]: E9AA724264: from=, size=485, nrcpt=1 (queue active)  Feb 2 22:33:45 localhost postfix/submission/smtpd[1045]: disconnect from unknown[189.63.49.XXX]  Feb 2 22:34:14 localhost postfix/smtp[1053]: connect to mta5.am0.yahoodns.net[98.136.216.25]:25: Connection timed out    Feb 2 22:24:21 localhost postfix/smtp[1013]: connect to mta6.am0.yahoodns.net[98.136.217.202]:25: Connection timed out  Feb 2 22:24:21 localhost postfix/smtp[1014]: connect to gmail-smtp-in.l.google.com[173.194.76.27]:25: Connection timed out  Feb 2 22:24:21 localhost postfix/smtp[1015]: connect to gmail-smtp-in.l.google.com[173.194.76.27]:25: Connection timed out  Feb 2 22:24:21 localhost postfix/smtp[1012]: connect to aspmx.l.google.com[173.194.68.27]:25: Connection timed out    Here is /etc/postfix/main.cf   /etc/postfix/master.cf   Result from #> netstat -nlptu I'm trying to search and replace a string in all files matched by grep: grep -n 'foo' * will give me output in the form: [filename]:[line number]:[text]  For each file returned by grep, I'd like to modify the file by replacing foo with bar.