What is the estimated variance of residuals? From R
Interpretation of R's lm() output
Is it possible to read a .PST file using C#? I would like to do this as a standalone application, not as an Outlook addin (if that is possible).   If have seen     to this mention  but I am looking to do this programmatically in C#.  I have looked at the  namespace but that appears to be just for Outlook addins.  appears to be able to read PST files, but this is in C (sorry Joel, I didn't ).  Any help would be greatly appreciated, thanks!  EDIT:   Thank you all for the responses! I accepted Matthew Ruston's response as the answer because it ultimately led me to the code I was looking for. Here is a simple example of what I got to work (You will need to add a reference to Microsoft.Office.Interop.Outlook):  using System; using System.Collections.Generic; using Microsoft.Office.Interop.Outlook;  namespace PSTReader {     class Program {         static void Main () {             try {                 IEnumerable&lt;MailItem&gt; mailItems = readPst(@"C:\temp\PST\Test.pst", "Test PST");                 foreach (MailItem mailItem in mailItems) {                     Console.WriteLine(mailItem.SenderName + " - " + mailItem.Subject);                 }             } catch (System.Exception ex) {                 Console.WriteLine(ex.Message);             }             Console.ReadLine();         }          private static IEnumerable&lt;MailItem&gt; readPst(string pstFilePath, string pstName) {             List&lt;MailItem&gt; mailItems = new List&lt;MailItem&gt;();             Application app = new Application();             NameSpace outlookNs = app.GetNamespace("MAPI");             // Add PST file (Outlook Data File) to Default Profile             outlookNs.AddStore(pstFilePath);             MAPIFolder rootFolder = outlookNs.Stores[pstName].GetRootFolder();             // Traverse through all folders in the PST file             // TODO: This is not recursive, refactor             Folders subFolders = rootFolder.Folders;             foreach (Folder folder in subFolders) {                 Items items = folder.Items;                 foreach (object item in items) {                     if (item is MailItem) {                         MailItem mailItem = item as MailItem;                         mailItems.Add(mailItem);                     }                 }             }             // Remove PST file from Default Profile             outlookNs.RemoveStore(rootFolder);             return mailItems;         }     } }   Note: This code assumes that Outlook is installed and already configured for the current user. It uses the Default Profile (you can edit the default profile by going to Mail in the Control Panel). One major improvement on this code would be to create a temporary profile to use instead of the Default, then destroy it once completed. How can I get dramatic shallow DOF with a kit lens? I'm currently using an entry-level DSLR with 18-55mm lens and having great trouble trying to creating a blurred background effect in my photos. Now matter what aperture or shutter speed I choose, I'm not able to get it.  There's a general question about , but what specific things can I do to get this effect with an entry-level lens? Move rigidbody using WASD keys but rotate it based on camera/mouse movement I am very new to unity and my scripts are based on some scripts found on the web.   I want to make a first person view so the camera is attached to my rigidbodys head. Then i want to move my rigidbody based on keyboard input (wasd) and rotate it using the mouse movement.  Until now, i used the following code for moving my rigidbody:  void Update() {      /* calculate rigidbody movement */     movement = new Vector3( Input.GetAxisRaw("Horizontal"), 0, Input.GetAxisRaw("Vertical")).normalized;      /* calculate mouse look to rotate the rigidbody*/     mouseDelta = new Vector2(Input.GetAxisRaw("Mouse X"), Input.GetAxisRaw("Mouse Y"));     mouseDelta = Vector2.Scale(mouseDelta, new Vector2(sensitivity * smoothing, sensitivity * smoothing));     smoothV.x = Mathf.Lerp(smoothV.x, mouseDelta.x, 1f / smoothing);     smoothV.y = Mathf.Lerp(smoothV.y, mouseDelta.y, 1f / smoothing);     mouseLook += smoothV;  }  void FixedUpdate() {         /* apply rigidbody movement from Update() */     transform.Translate( movement * moveSpeed * Time.deltaTime );             /* apply rigidbody rotation from Update() */     transform.localRotation = Quaternion.AngleAxis(mouseLook.x, transform.up);             /* apply camera rotation from Update() */     Camera.main.transform.localRotation = Quaternion.AngleAxis(-mouseLook.y, Vector3.right);    }   I learned today that i dont have to move a rigidbody's transform but now i am totally confused and it seems i have to restart my whole (first!) project.  So when i use MovePosition and MoveRotation, how do i rotate it based on the camera perspective/mouse movement?  I think the movement Vector is ok so i can simply rewrite the FixedUpdate to something like  rigidbody.MovePosition(movement * speed * Time.deltaTime)   but i am totally stuck on how to apply the camera rotation to my rigidbody to use it like  void FixedUpdate() {      /* move the rigidbody */                rigidbody.MovePosition(movement * moveSpeed * Time.deltaTime);     /* rotate the camera */     camera.transform.localRotation = Quaternion.AngleAxis(-mouseLook.y, Vector3.right);      /* but how can i rotate the rigidbody based on the cameras rotation??? */     rigidbody.MoveRotation(?????);  }   I hope its clear what i want, thank you! How can I minimize Thunderbird 60.2.1 to tray after "MinimizeToTray revived" add-on stopped working? After update, my Thunderbird stopped getting minimized with the "MinimizeToTray revived" add-on. Is there any way to minimize my Thunderbird? Any other add-on that works with the new version? Doubts on the axiom of union? I'm reading Guerino Mazzolla's Comprehensive Mathematics for Computer Scientists 1:     Axiom 3 (Axiom of Union) If $a$ is a set, then there is a set      $$\{x| \text{ there exists an element } b \in a \text{ such that } x\in b \}$$      This set is denoted by $\cup a$ and is called the union of $a$.    This axiom seems to take elements from inside of a set of sets, for example in the set: $a=\{\{u_1,u_2 \},\{u_3,u_4 \} \}$, there are two elements $b\in a$, then the mentioned set created by the axiom is $\{u_1,u_2,u_3,u_4 \}$.           The axiom seems to imply that the set $a$ must have a set inside of it for it to work, what if it  have an element that is not a set? (I'm not sure if this is possible, but I remember of having read something about the difference of sets and elements).         There's also an extension of my proposal, In the same book (and also in others) I've seen that the natural numbers are defined as:   $$\begin{eqnarray*}   {0}&amp;=&amp;{\emptyset} \\    {1}&amp;=&amp;{\{\emptyset\}} \\    {2}&amp;=&amp;{\{ \{\emptyset\}\}} \\    {3}&amp;=&amp;{\{ \{ \{\emptyset\}\}\}} \\   {\vdots}&amp;=&amp;{\vdots} \end{eqnarray*}$$  Then the singleton $\{ 3\}$ could be seen as $\{ \{ \{ \{\emptyset\}\}\}\}$, which could mean that   $$\cup \{ 3 \}=\cup\{ \{ \{ \{\emptyset\}\}\}\}= \{ \{ \{\emptyset\}\}\}=\{2 \}$$          Then the union could also be seen as the antecessor of a number?            Using the framework I provided, I see some ambiguity, look:   $$\{ \{ \{\emptyset\}\}\}=\{2 \}$$          I decided to interpretate it this way, but from the notation it's not clear in which pair of brackets I should stop, I guess that $\{ \{ \{\emptyset\}\}\}=\{2 \}$ but it could also be the case that $\{ \{ \{\emptyset\}\}\}=3$. I could want a singleton with a $2$ inside of it and a $3$ outside a set, no? How do I remove old kernel versions to clean up the boot menu? Every time I install a new Linux kernel, it gets left in the grub_config, making the boot menu longer each time.    I know I can manually search through the installed packages and remove them.  Does Ubuntu provide any easier way to clean them up or keep them from showing in the boot list? How can I get my graphics card to be recognized in System Info? Identifying a quotient group (NBHM-$2014$) Let $\mathbb C^*$ denote the multiplicative group of non-zero complex numbers and let $P$ denote the subgroup of positive real numbers. Identify the quotient group.    My thought $$\frac{\mathbb C^*}{P}=\{P,-P,iP,-iP\}.$$ Is it right? How do I add "citations" at the end of the document as done here? What do damage buffs affect? In Overwatch, there are several ways to buff the damage dealt by a hero: the alternate fire of Mercy's Caduceus Staff, Ana's Nano Boost, and Orisa's Supercharger. Are they all governed by the same rules? What can they affect, or not affect?  This question exists to have a single reference point for the many, many questions that have been asked, instead of having to update each answer individually when game mechanics change proving that elements of a sequence are pairwise coprime For the sequence $a_n = 6^{2^n} + 1$:   How can I prove that the elements of this sequence are pairwise coprime, i.e. prove that if $m$ is not equal to $n$ then $\gcd(a_m, a_n) = 1$. (begin by proving that $a_n∣ (a_{n+1} - 2)$) Can I fine-tune my screen brightness? My laptop is Lenovo T400, and my OS is Ubuntu 10.10. I change the brightness of my screen by pressing the FN key and one of the two keys for increasing/decreasing brightness.  The brightness I feel comfortable is between two consecutive levels that are offered. So I wonder if it is possible to fine-tune the screen's brightness? Finding specific users by their location and a tag score I am trying to draw a partial box around one or more words within a paragraph--that is, a rectangle with one or more sides missing. I have read the documentation for the fancybox package and it doesn't seem to be able to do what I want. I was able to produce thus ugly hack:    That's just a vertical bar | followed by a word with \overline and \uline. The trick is to connect the vertical and horizontal lines so that you have a rectangle missing just one side.  Is there an easy, general way to do this, perhaps with Tikz? I don't know enough about that package to be able to do this myself, but I'm wondering if there might be other solutions too. Determining the dimension of span$\{AB-BA : A,B \in M_{n \times n}(\mathbb R) \}$ Let $S$ be the subspace , of  $M_{n \times n}(\mathbb R)$ (the vector space of all $n \times n$ real matrices ) , generated by matrices of the form $AB-BA$ , where $A,B \in M_{n \times n}(\mathbb R)$ , then how do we prove that $\dim S=n^2-1$ ? The only thing that I can determine is that the trace of all matrices of $S$ is $0$ . Please help Why is the observable universe so big? The Ball From A Pass Is there an official C# guideline for the order of items in terms of class structure?  Does it go:   Public Fields Private Fields Properties Constructors Methods ?   I'm curious if there is a hard and fast rule about the order of items? I'm kind of all over the place. I want to stick with a particular standard so I can do it everywhere.  The real problem is my more complex properties end up looking a lot like methods and they feel out of place at the top before the constructor.  Any tips/suggestions? Card game probability 3 players I don’t know how to handle this 3 players case, may anyone give a hand? Thanks!     When playing card game, there are 3 players playing 32 cards, each   receive 10 cards, 2 remind on the table. Overall are 4 aces and 4   kings in the game. How likely is P (E | D)? D = "The table remains 2   aces" E = "I (at least) get one king".   I guess I should have steps as follows.   P(E) = P(1King)+P(2K)+P(3K)+P(4K) P(D) = (4/32) * (4/32) = 1/256 P (E | D) = P(E) + P(D)   Equations may be used:  Counting combinations      The number of combinations of n objects taken r at a time is     nCr = n(n - 1)(n - 2) . . . (n - r + 1)/r! = n! / r!(n - r)!                 Number of favorable outcomes P(I) =     Total number of possible outcome Every $R$-module is a quotient of a free module I'm reading through my notes, and I have a theorem as the title says. As proof I have only a picture.    where $v:m\mapsto(0,...,0,1,0,...,0)$ and 1 is at $m$-th position. I know, that $\oplus_M R$ is a free module generated by set  $M$, but is this all? I do not see how the statement is proved.