Misty Step and Manifest Mind Order of scribes
Interaction of Invoke Duplicity and Misty Step
Is there a command to show the directory/file name when cat files?  For example: assume two files f1.txt and f2.txt are under ./tmp  ./tmp/f1.txt ./tmp/f2.txt    Then when I do cat ./tmp/*.txt, only the content of files will be shown. But how to firstly show the file name, then the content?, e.g.:   (The needed command):  ./tmp/f1.txt:    This is from f1.txt  and so on  ./tmp/f1.txt:  This is from f2.txt ...   Is there a command to do it? (There seems to be no option for 'cat' to show the file names) Choosing my name as an author when publishing a scientific paper, can I use my "unofficial" first name? I have one official first name which appears on my ID card. I have another first name which friends call me by. Is it possible to use my unofficial first name and official family name to publish scientific papers? How can I prove to someone that I am one of the authors? Hyphen or no hyphen when modifying an adjective with a quantity? After upgrading from 10.04 to 12.04 I am trying to install different packages.  For instance ia32-libs and skype (4.0).  When trying to install these, I am getting the 'Unable to correct problems, you have held broken packages' error message.   Output of commands:  sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   After running this:  sudo dpkg --configure -a foo@foo:~$ sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. General misconception about $\sqrt x$ I need to find a way of proving that the square roots of a finite set    of different primes are linearly independent over the field of    rationals.    I've tried to solve the problem using elementary algebra  and also using the theory of field extensions, without success. To  prove linear independence of two primes is easy but then my problems  arise. I would be very thankful for an answer to this question. Laplace transform of $1/t$ How do I earn SC2's "Hurry up, it's raid night" achievement? The "Hurry up, it's raid night" achievement in Starcraft 2 involves "beating Wings of Liberty, on normal, in 8 hours or less."  Is there a recommended mission path to take? Which mission should I take for the branching paths? Does it count time spent on the Hyperion in between missions, or is it exclusively time elapsed on missions. Does replaying a mission affect the time? General tips / hints from those who've unlocked the achievement?  Edit: Just got this achievement tonight, finally! The answer was perfect. What is the simplest way of proving (to a non-mathematician) that the power set of the set of natural numbers has the same cardinality as the set of the real numbers, i.e. how to construct a bijection from $\mathcal{P}(\mathbb{N})$ to $\mathbb{R}$? Here is the problem:  Suppose that $*$ is an associative binary operation on a set $S$. Let  $$H:= \{a \in  S\mid a * x = x * a \mbox{ for all }x\in S\}.$$  In other words, $H$ is consisting of all the elements of $S$ that commute with every element in $S$.  Show that $H$ is closed under $*$. Sophomore's dream: $\int_0^{1} x^{-x} \; dx = \sum_{n=1}^\infty n^{-n}$ In the solution of the so-called , one of the key steps is to compute $$\int_0^1 x^n (\log x)^n~\mathrm dx$$ using the change of variables $x = \exp\left(-\frac{u}{n+1}\right)$ to obtain the Gamma function.  This substitution to me, looks like it was pulled out of thin air. Can someone help me motivate it? How would I have thought of this substitution? I have read that a holomorphic function in an open disc has a primitive in that disc. Does this mean that for any holomorphic function $f$ in any open set $U,$ that $f$ has a primitive? I say this because I can take a large enough open disc to cover the open set $U$ and find its primitive there. Is this a correct way of thinking? Sum with binomial coefficients: $\sum_{k=0}^{n}{2n\choose 2k}$ I'm repeating material for test and I came across the example that I can not do. How to calculate this sum: $\displaystyle\sum_{k=0}^{n}{2n\choose 2k}$? Monty hall problem extended. I just learned about the Monty Hall problem and found it quite amazing. So I thought about extending the problem a bit to understand more about it. In this modification of the Monty Hall Problem, instead of three doors, we have four (or maybe $n$) doors, one with a car and the other three (or $n-1$) with a goat each (I want the car).  We need to choose any one of the doors. After we have chosen the door, Monty deliberately reveals one of the doors that has a goat and asks us if we wish to change our choice.  So should we switch the door we have chosen, or does it not matter if we switch or stay with our choice?  It would be even better if we knew the probability of winning upon switching given that Monty opens $k$ doors. First off, here is some code:  int main()  {     int days[] = {1,2,3,4,5};     int *ptr = days;     printf("%u\n", sizeof(days));     printf("%u\n", sizeof(ptr));      return 0; }   Is there a way to find out the size of the array that ptr is pointing to (instead of just giving its size, which is four bytes on a 32-bit system)? How to determine the amount of experience needed for leveling up Related questions under this topic might include:   How should I base how much experience points it takes to get to the next level? What factors are involved in this? How do I keep the player not entertained long enough till he levels up? How can I vary the way the player gets experience points? (Before anyone jumps to the conclusion that this is the same question as , please read it through. Also I am looking for more comprehensive and detailed data than the poster in .)  Many years ago I used to use a tool called Line Speed Meter (or Monitor) by TCPIQ. This was a brilliant piece of software that would sit quietly in the background and several times a day (according to a selectable frequency) would reach out and test internet line performance against servers all over the world. In the course of a week (or more), thousands of servers would be tested and enough data would accumulate that one could analyze performance according to time of day, day of week, location of server, etc. Drill-down was possible to the point where you could see every server that was tested.  This data was invaluable in determining if one really was getting the performance being paid for. It was also infinitely more valuable than spot checks you perform at sites like  or even the better-regarded ones like  or  (both of which, incidentally, are biased toward USA users - which I am not one of anymore).  Unfortunately Line Speed Meter is no longer supported and the company that made it now has instead a tool called isposure that is nowhere near as flexible or transparent - it is geared to supplying data to ISPs rather than to the consumers. For example, according to their FAQ, it usually runs only once a day automatically - I'd like to start with running it every couple of hours for a week or two - and scale back once I have a good basis so that I can notice when performance changes. Also, the details of the tests are no longer visible to the consumer-user.  My question: is there a (preferably free) tool/service available today to automatically collect comprehensive line speed metrics so I can map out and analyze the performance I am getting on my Broadband internet connection?  EDIT 2012-02-13: I left something out of the above.  In my country, each ISP sells a package that implies performance beyond the borders of my small country. They own (or lease) the lines going across the ocean. They have full control of the bandwidth leading from their servers to the backbones in the USA and EU. Peformance through the cloud is very much relevant and although not entirely, certainly largely under the local ISP's control, since traditionally, the bottleneck has been traffic out of the country.  As an example, at the moment, my ISP is advertising widely their new transatlantic cable and how their performance now outstrips everyone else's. I haven't "felt" it - so I want a tool to quantify it.  Performance within my country is usually good. The problem is that almost all my work involves access to the Internet in North America, Europe, Pacific Rim and others. So I care about and want to document the end-to-end performance I am getting from my ISP - and if I switch, compare to what I get at a new ISP.  EDIT 2013-03-07: As @harrymc pointed out I neglected to mention OS. All the machines on my home LAN are (sadly) Windows (XP or 7). If A tool requires *nix, I have a couple ancient machines in storage I could probably re-purpose - but my preference is for a Windows-based tool. Thanks.  EDIT 2013-03-10: As a further clarification - a method to monitor speeds achieved during regular work provides half of what I'm looking for. What was nice about TCPIQ is that it would ferret out thousands of sites around the world and do brief d/l &amp; u/l tests against them to check speed and then log the results. This gave a valuable statistical database for analysis of speed overall, as well as during times of day, days of week and according to geographical targets. That's the sort of functionality I'd like to achieve (again). Assume $f:\mathbb R\rightarrow  {\mathbb R} $ is Lebesgue integrable, prove $\sum_{n\in\mathbb N } f(x+n)$ converges for almost everywhere x. This is a question discussed with friends. Thanks According to , the SE chat sites may have individual Easter eggs, depending on the site. If you find them, please post. Because it's so easy to make this stuff up, a screenshot as proof would be nice. (Although Photoshop isn't that hard either...) How to saveHTML of DOMDocument without HTML wrapper?