How to find a matrix representation of a linear transformation?
Matrix representation of linear transformation
multiple prints on the same line in Python Compute $\mathbb{P}\{ W_t < 0 \, \, \text{for all} \, \, 1 < t < 2\}$ for a Brownian motion $(W_t)_{t \geq 0}$ Let $(W_t)_{t \ge 0}$ be a standard one-dimensional Brownian motion. Calculate $$\mathbb{P}\{ W_t &lt; 0 \, \, \text{for all} \, \, 1 &lt; t &lt; 2\}.$$ I can only think that this will be conditional on $W_1$. Please tell how to proceed? When can I make opportunity attacks? What provokes an opportunity attack?  In 3.X moving out of a threatened square, standing up from prone, casting a spell (unless cast defensively), or making a ranged attack provoked, while in 4e moving out of a threatened square or making a ranged/area attack provoked. I have an external HDD and I kind of messed up the file permissions but when fixing it I thought it is ok bc with my username I can access the files perfectly fine. Now that I use this with two PC (actually ATM I don't have access to my other PC) I can't access these files.  The problem is this directory has hundreds of folders with no permission for "everyone". I would like to give it the default permissions including have all access for the user "everyone". How do I do that via command line for these hundreds of folders? How can I make 3D Text in Russian? I've seen a similar question on BSE about entering foreign languages into 3D Text, but it doesn't help. I've tried using two different fonts (both of which support Russian). I've tried enabling International Fonts in Blender's User Preferences, but it doesn't work as well. It either types English text with Greek letters or displays empty vertical rectangles.   If anyone has been able to add text in any foreign language, please let me know.  I actually found out that it can be easily done through Text Editor, which would be probably the best way for me since I would prefer to paste my text. Can anyone perhaps guide me through? Bug with Excavator Badge I edited this post today  on stack overflow. I was approved of the edit, so I waited a few minutes to get my  badge because this answer was posted on Jan 28 '10 at 1:06, but it never came. I have read multiple articles on meta that there have been bugs with this badge, but they have been about winning it multiple times (), or earning it then losing it (). Am I missing something here? What is there to do after beating the Elite Four/Champion (Post-Game)? I've defeated the Elite Four and the Champion. The credits rolled and I've been teleported to my home in Vaniville Town. What is there to do now? Any specific events/features that are unlocked now?  I already know of and caught Mewtwo and Zyrgarde. I have a problem understanding the proof of Rencontres numbers (Derangements) Does javascript use immutable or mutable strings? Do I need a "string builder"? I can buy Dell Latitude E7270 through my employer. It will come with Windows, but I would like to install Ubuntu (most likely 14.04). This model does not appear on the list of certified hardware, however. Does anyone know whether I should anticipate any problems with his laptop? Thanks! I have an ArrayList of objects in Java.  The objects have four fields, two of which I'd use to consider the object equal to another.  I'm looking for the most efficient way, given those two fields, to see if the array contains that object.  The wrench is that these classes are generated based on XSD objects, so I can't modify the classes themselves to overwrite the .equals.    Is there any better way than just looping through and manually comparing the two fields for each object and then breaking when found?  That just seems so messy, looking for a better way.  Edit: the ArrayList comes from a SOAP response that is unmarshalled into objects. Mathematical journal for an undergraduate I want to make someone a present by subscribing for him to a mathematical journal. (It should appear every month or every two months). The contents should be comprehensible to an undergraduate in mathematics, and be about a broad selection of topics (for example not only analysis).   I expect the content to be something like proposing interesting problems and then giving solutions with some references for further study. Are there some famous journals you could suggest me? Should you declare methods using overloads or optional parameters in C# 4.0? I was watching , and it got me thinking about when optional parameters are available in C# what is going to be the recommended way to declare methods that do not need all parameters specified?  For example something like the FileStream class has about fifteen different constructors which can be divided into logical 'families' e.g. the ones below from a string, the ones from an IntPtr and the ones from a SafeFileHandle.  FileStream(string,FileMode); FileStream(string,FileMode,FileAccess); FileStream(string,FileMode,FileAccess,FileShare); FileStream(string,FileMode,FileAccess,FileShare,int); FileStream(string,FileMode,FileAccess,FileShare,int,bool);   It seems to me that this type of pattern could be simplified by having three constructors instead, and using optional parameters for the ones that can be defaulted, which would make the different families of constructors more distinct [note: I know this change will not be made in the BCL, I'm talking hypothetically for this type of situation].  What do you think? From C# 4.0 will it make more sense to make closely related groups of constructors and methods a single method with optional parameters, or is there a good reason to stick with the traditional many-overload mechanism? When to use "do" in phrases which are not questions? Editing LaTeX generated PDF Is there an application (in Windows, Unix, or Mac) that allows you to edit the LaTeX generated PDF. I know there is pdfsync, but it only gives you the line, and then you have to search where in the line you want to make the change. This is OK sometimes, for a couple of changes, but when there are lots of changes it becomes really tedious.  I would really like to accelerate this process of correcting mistakes (mostly grammar, missing commas etc.). in my document, without going through all the markup. Has the Doctor’s memory been reset? At the end of The Time of the Doctor, it is shown that Matt Smith has received an entire new regeneration cycle and using it he regenerates into Peter Capaldi. Capaldi's first question to Clara is about how to fly the TARDIS. Does this mean there has been a memory reset for the Doctor?  If so, has he forgotten his true name?  If he has forgotten his true name, then he can't bring back the Time Lords now can he? Quantum mechanical books for mathematicians I'm a mathematician. I have good knowledge of superior analysis, distribution theory, Hilbert spaces, Sobolev spaces, and applications to PDE theory. I also have good knowledge of differential geometry. I would like to study the Semiclassic Analysis, but perhaps I must first study the foundations of quantum mechanics. So I would like to know what book you recommend me to begin studying quantum mechanics. I'm primarily interested in a mathematical point of view. I have seen some books of this type, but I would like to have some other opinion.  Thanks for every reply Topologist's Sine Curve: A rigorous proof of why $\overline{S} = S \cup V$ Let $S$ and $V$ be the following subsets of $\mathbb{R}^2$.  $$ S = \left\{ \ x \times \sin \frac{1}{x} \ \colon  \ 0 &lt; x \leq 1 \ \right\}, \qquad V = \left\{ \ 0 \times y \ \colon \ -1 \leq y \leq 1 \ \right\} = \{ 0 \} \times [-1, 1]. $$ Then how to show rigorously that the closure $\overline{S}$ of $S$ is given by  $$ \overline{S} = S \cup V? $$  By rigorously, I mean using the smme kind of argument as is used in real analysis or topology, such as in (most of) the proofs in Rudin or Munkres.   Intuitively, it is clear that as $x \to 0+0$, then $\sin \frac{1}{x}$ will fluctuate its full range of $[-1, 1]$, and for any point $0 \times y$, where $y \in [-1, 1]$, there will be points of $S$ arbitrarily close to it.   But I'm unable to rigorously show this. Is it possible to identify the font used in a specific document/picture?  Answers to this question should identify:   Possible methods to do this (perhaps one answer per method) and adequately describe how to use it (as opposed to merely stating it); Ways of finding the identified fonts, if possible (free or not); and Any prerequisites associated with the method used, if required (for example, "In order to use method X, your document has to be in format Y").   This question is meant as an FAQ, based on an . Its aim is to facilitate the community with the general procedures involved in font identification. Similar cases are solved on a per-usage basis on 's  tag. Would it be possible to break an RSA key, in for example 1 week of time, if the cracker have already spent X number of years building an index of primes by performing every permutation of existing prime keys up to $2^{2048}$?  I understand this would take an immense amount of time to do, but it would only be done once. Obviously, computing such an index would take a considerable amount of time and would have to be done with someone having the right amount of resource. Given the public key, you would be able to look up what the two primes are, and hence retrieve the private key instantly.  Breaking an 256 AES would then be easier, as AES keys are often generated using the RSA private key.  Would it be possible to build such an index? How long would that take in permutations and perhaps with the fastest computer in the world?