MikTeX difference between Maintenance and Maintenance (Admin)
Difference between administrative and user mode of MiKTeX
SQL Services Wont Start After Removing TLS Why am I getting black photos when I use the Manual feature on my DSLR? I just installed Ubuntu alongside to Windows 7, and now Windows 7 will not boot.  When the system starts, it shows me entry for Windows 7 in the boot menu, when I click on the Windows 7 option in the boot menu, after few seconds it will show me the boot menu again and Windows will not boot. It shows me no error message. Windows 7 option is available in the boot menu but it just does not boot.  Here are my boot info results   update - 30/01/2012 I tried windows recovery - fix startup issues - that showed no problems but issues were not resolved  Then I tried the widnows recovery console and run following commands  bootrec /fixboot bootrec/ fixmbr bootrec /RebuildBCD   But that does not help, Now neither ubuntu nor windows will boot. When I boot from windows CD it shows me a valid windows installation in c:\ drive.  update After a lot of help I got from #ubuntu channel and trying out different things, ultimately I can now boot both windows and ubuntu, still, the issue is not completely resolved though.  Here's what made it work  Boot using ubuntu live CD and then run the testdisk utility as steps mentioned  Restart system and I was able to see the boot menu and boot into Ubuntu, then put the following code in boot/grub/custom.cfg. Restart and now I can see one more entry to boot win7, clicking on it boots windows.  menuentry "Windows 7 (loader) with grub ntldr workaround" --class windows --class os   {     insmod part_msdos     insmod ntfs     set root='(hd0,msdos1)'     search --no-floppy --fs-uuid --set=root FAF0F57DF0F54085     ntldr /bootmgr }   It will make windows boot probably but now windows have a dependency on Ubuntu and I can not remove Ubuntu or else windows will stop working.  Credit goes to 'Jordan_U' on #ubuntu channel.   update Here are the win7 boot details I got from EasyBCD  Windows Boot Manager -------------------- identifier              {9dea862c-5cdd-4e70-acc1-f32b344d4795} device                  partition=C: path                    \bootmgr description             Windows Boot Manager locale                  en-US default                 {04fe8f95-4b17-11e1-a45c-909d3d25f938} displayorder            {04fe8f95-4b17-11e1-a45c-909d3d25f938} timeout                 30  Windows Boot Loader ------------------- identifier              {04fe8f95-4b17-11e1-a45c-909d3d25f938} device                  partition=C: path                    \Windows\system32\winload.exe description             Windows 7 Home Premium locale                  en-US osdevice                partition=C: systemroot              \Windows resumeobject            {8d25a443-4b0a-11e1-a835-806e6f6e6963}   Note Still, I am looking for how can I have everything clean and how can I boot windows without having a dependency on Ubuntu. so that if ever I have to remove ubuntu, windows will keep booting file without ubuntu. Difference estimate & confidence intervals for $\chi^2$ test between 2 proportions I am using a chi-sq test between two proportions (). I am using this over the z-test for proportions because I do not think my data is normal.   My question is how do I get the difference (shift) estimate &amp; confidence intervals for this test.   For example,     Data1: 193/252=.77   Data2: 154/227=.68   P-value=.032 (I used the formula in the link above. I will also add my exact code below)  Shift Estimate: I assume its the difference between proportions, ie .77-.68=.09. Is this correct?   Confidence Interval: ??????????????????  Code for generating P-value (matlab):   % Pooled estimate of proportion  p0 = (n1+n2) / (N1+N2); % Expected counts under H0 (null hypothesis)  n10 = N1 * p0;  n20 = N2 * p0; % Chi-square test, by hand  observed = [n1 N1-n1 n2 N2-n2];  expected = [n10 N1-n10 n20 N2-n20];  chi2stat = sum((observed-expected).^2 ./ expected);  p = 1 - chi2cdf(chi2stat,1);  H=0; if(p&lt;.05), H=1; end Today I was thinking about composition of functions.  It has nice properties, its always associative, there is an identity, and if we restrict to bijective functions then we have an inverse.  But then I thought about commutativity.  My first intuition was that bijective self maps of a space should commute but then I saw some counter-examples. The symmetric group is only abelian if $n \le 2$ so clearly there need to be more restrictions on functions than bijectivity for them to commute.  The only examples I could think of were boring things like multiplying by a constant or maximal tori of groups like $O(n)$ (maybe less boring).  My question: In a euclidean space, what are (edit) some nice characterizations of sets of functions that commute? What about in a more general space?   Bonus: Is this notion of commutativity important anywhere in analysis? Location of /etc/fstab in El Capitan I want to activate the . But I can't find the /etc/fstab on my mac. osx 10.11.5 El Capitan What's the term for design ala "object.method1().method2().method3()"? What's the term for this design?  object.method1().method2().method3()   ..when all methods return *this?  I found the term for this a while ago, but lost it meanwhile. I have no clue how to search for this on google :) Also if anyone can think of a better title for the question, feel free to change it.  Thanks  Update-Gishu: After reading about it, I feel that your question is misleading w.r.t. code snippet provided.. (Feel free to rollback)  Method Chaining  object.method1().method2().method3()   Fluent Interfaces  private void makeFluent(Customer customer) {         customer.newOrder()                 .with(6, "TAL")                 .with(5, "HPK").skippable()                 .with(3, "LGV")                 .priorityRush();     } I'm looking for a way to reinterpret an array of type byte[] as a different type, say short[]. In C++ this would be achieved by a simple cast but in C# I haven't found a way to achieve this without resorting to duplicating the entire buffer.  Any ideas? Inner join vs Where Is there a difference in performance (in oracle) between  Select * from Table1 T1  Inner Join Table2 T2 On T1.ID = T2.ID   And  Select * from Table1 T1, Table2 T2  Where T1.ID = T2.ID   ? Why are mathematical proofs that rely on computers controversial? There are many theorems in mathematics that have been proved with the assistance of computers, take the famous  for example. Such proofs are often controversial among some mathematicians. Why is it so?  I my opinion, shifting from manual proofs to computer-assisted proofs is a giant leap forward for mathematics. Other fields of science rely on it heavily. Physics experiments are simulated in computers. Chemical reactions are simulated in supercomputers. Even evolution can be simulated in an advanced enough computer. All of this can help us understand these phenomena better.   But why are mathematicians so reluctant? What is moiré? How can we avoid it? What is the image defect called "moiré"? What causes it, and how can we avoid or reduce it? Is it related to "false color"? When is mapping $g$ to $g^{-1}$ a group homomorphism? It just means that the map maps the identity to the identity and inverses to inverses. So does that mean it's only a homomorphism if the inverse is itself? Gradient steepest direction and normal to surface? From this , I now understand the gradient to be the directional derivative that returns the steepest slope at a point. However, reading my textbooks, they all say that the gradient is normal to the tangent plane. In the above SE question, the gradient sounds like it should be parallel to a direction in the $xy$ plane, not actually up on the surface.   My question is therefore do I have a misunderstanding of the tangent plane, gradient or directional derivative?   In addition, I question how the gradient always passes through the origin or the $xy$ plane? If for instance in the graphic, the gradient had been another direction (say horizontal), then it wouldn't pass through the origin! In addition, the gradient of other points in the graphic would satisfy this example. Many thanks! Identification of mid-80s time travel tv show Why does Lang describe a field as a union and compositum of its subfields in this manner? I am reading Serge Lang's Algebra, revised 3rd edition, and on page 226, the author makes the following definitions and observations:   If $E,F \subset L$, the compositum of $E$ and $F$ in $L$ is defined to be the smallest subfield of $L$ containing both $E$ and $F$. It is denoted $EF$. If $k \subset E$ and $\alpha_1,\dots,\alpha_n \in E$, then $k(\alpha_1,\dots,\alpha_n)$ is defined to be the smallest subfield of $E$ containing $k$ and $\alpha_1,\dots,\alpha_n$. Observe that $$ E = \bigcup k(\alpha_1,\dots,\alpha_n), $$ where the union is taken over all finite families $\{ \alpha_1,\dots,\alpha_n \}$ of elements of $E$. The compositum of an arbitrary family of subfields of a field $L$ is defined as the smallest subfield of $L$ containing all fields in the family. $E$ is finitely generated over $k$ if there is a finite family $\{ \alpha_1,\dots,\alpha_n \}$ of elements of $E$ such that $E = k(\alpha_1,\dots,\alpha_n)$. Observe that $E$ is the compositum of all its finitely generated subfields over $k$.   My question is regarding the two observations (point nos. 3 and 6). It appears to me that it is enough to take union (and compositum) over all subfields generated by a single element. For example for point no. 3, I can write $$ E = \bigcup_{\alpha \in E} k(\alpha) $$ because $E$ is clearly contained in the RHS, and each $k(\alpha)$ is contained in $E$ and hence so is the union, implying that $E$ contains the RHS. Similarly for point no. 6.  So, why does Lang emphasise to take the union and compositum over all finitely generated subfields? Is there some perspective that he wishes to emphasise that I am missing? Any help in understanding this will be appreciated. If two ends were a certain "length" apart were they therefore at rest (or at least rigid) to each other? Is it mandatory to have published papers while applying for PhD? I've heard from people saying that while applying for PhD, you need to have past experience in researching something and should have international publications. I was like more concentrated towards practical experience and have't had any publications. If I am aspiring to do PhD and want to apply, it would be impossible if such a criteria exists! dynamically change UIKeyboards return key How does accepting an answer work? How to create a permanent "alias"? If you create an alias for example:   alias cls="clear"   It exists untill you kill terminall session. When you start a new terminal window the alias doesn't exist any more. How to create "permanent" alias, one that exists in every terminal session?