"Access is Denied" on contentDocument in IE9 on same domain
"Access is denied" JavaScript error when trying to access the document object of a programmatically-created  (IE-only)
Auto confirm when running bash scripts? Get the equation of a circle when given 3 points How to use GROUP BY to concatenate strings in MySQL? If I inherit from a base class and want to pass something from the constructor of the inherited class to the constructor of the base class, how do I do that?  For example, if I inherit from the Exception class I want to do something like this:  class MyExceptionClass : Exception {      public MyExceptionClass(string message, string extraInfo)      {          //This is where it's all falling apart          base(message);      } }   Basically what I want is to be able to pass the string message to the base Exception class. Wires do not connect in Circuitikz I've been trying to use relative coordinates to make my drawings more precise but it seems I don't know how the command \node works since I've been having this problem while connecting a circuit element to another:    I'm trying to eliminate the blank between the two wires.  This is the minimal code:  \documentclass{book} \usepackage[siunitx,RPvoltages]{circuitikz} %Circuit Schematics/Diagram \usetikzlibrary{arrows,shapes,calc,positioning} \begin{document}     \begin{circuitikz}             \path (0,0) coordinate (C);             % Comparatore             \path (C) + (0,-1) + (1,0) coordinate (com) node[above]{};             \path (com) + (1.5,-1) node[op amp] (comp) {};             % Collegamenti Comparatore             \node (G1) at ([shift=({-1.3cm,0cm})]comp.-) {};             \draw (G1) -- (comp.-);             \node (G2) at ([shift=({-1.3cm,0cm})]comp.+) {};             \draw (G2) -- (comp.+);             \draw (C) -- (G1); % Collegamento Rettificatore - Comparatore         \end{circuitikz} \end{document}   Thanks for any help! Does anyone know of any interesting subsets of the Cantor set? When I first started thinking about this, I thought that since the Cantor set $C$ is the intersection of disjoint unions of closed sets, those particular closed sets would be subsets of $C$. Those sets, however, happen to be intervals! The Cantor set contains no isolated points nor (open) intervals, so then what subsets does it contain besides $\varnothing$ and itself? Merging two xml files in C# without appending and without deleting anything (example given) I accidently ran  sudo chmod 755 -R /   instead of  sudo chmod 755 -R ./   I stopped it after few seconds, but now there is some problems such as  sudo: must be setuid root   How can I revert permissions back? How to start a background process in Python? Setting background-image using jQuery CSS property I'm trying to compile a document that only works with an up-to-date distribution, so I'd like to know: how do I update my distribution? Please provide screenshots where appropriate.  List of answers           To keep an eye on what’s going on at CTAN you may subscribe to the  or the RSS feed feed://www.mail-archive.com/ctan-ann@dante.de/maillist.xml How do I make Ubuntu not require a password to supend? Visiting two Schengen countries, coming back home in between, do I apply for single-entry or multiple-entry visa? Why are z-values replaced with zero after in_memory use in Python? Let $L,M$ two subspaces of the vector space, $V$ such that both $L,M \ne V$.   Prove: $L\cup M \ne V$.     I think this is a case of a proof by contradiction. Lets assume $L \cup M = V$.   Hence, $$\dim(V) = \dim(L) + \dim(M) - \dim(L\cap M)$$  How to proceed? We've never had an explicit policy around downvoting -- users are free to, if they like, cast all their votes as downvotes. Whether this behavior is desirable or not is another matter.   Now, we do discourage downvoting by making downvotes cost -1 rep to the casting voter. But, there's nothing in our policy that says continual downvoting is bad or wrong or inappropriate.  However, my thoughts on this are changing. I no longer think it is community friendly behavior to cast an extreme number of downvotes, and I am considering an explicit policy forbidding it.  Some data points (as of today):  Total SO upvotes cast: 45,555,530  Total downvotes cast: 365,192  users with more than 100 downvotes cast: 596  users with > 100 downvotes and the lowest ratio of upvotes to downvotes:           |           |         | up:down user id | downvotes | upvotes |  ratio --------+-----------+---------+---------  187712 |       201 |      37 |    0.18    2525 |       580 |     149 |    0.25  136829 |       137 |      43 |    0.31   55943 |       438 |     140 |    0.31   19405 |       236 |      94 |    0.39    5640 |      3299 |    1337 |    0.40  180659 |       126 |      66 |    0.52   78613 |       348 |     198 |    0.56   39892 |       181 |     109 |    0.60     432 |       310 |     197 |    0.63  238704 |       198 |     132 |    0.66   12643 |       170 |     116 |    0.68   18256 |       219 |     152 |    0.69  122428 |       167 |     118 |    0.70  118854 |       120 |      86 |    0.71  105662 |       273 |     201 |    0.73  187690 |       135 |     101 |    0.74    1782 |       573 |     430 |    0.75   (this is a complete list, there are no more below this threshold.)  Based on this data I am leaning towards enforcing a "no more downvotes may be cast" if    You have at least (n) votes cast total Your upvote to downvote ratio is lower than ~ 0.5 Order of an element in a finite cyclic group Let $G$ be a cyclic group of order $m$ generated by an element $a$.  I want to show that the order of $a^k$ is $m/d$, where $d:=\gcd(k,m)$.  I have a simple proof, but want to make sure I haven't overlooked anything since the other proofs I've seen (such as in Dummit and Foote) look more complicated.    The order of $a^k$ is the cardinality of the set $\{a^{ks}: s \in \mathbb{Z}\}$, which equals the cardinality of the set $\{a^{ks} a^{mt}: s,t \in \mathbb{Z} \}$ since $a^m$ is the identity.  But the set $\{ks+mt: s,t \in \mathbb{Z} \}$ is the set $d \mathbb{Z}$ by the basic properties of integers. So we have that the cardinality of the set is $| \langle a^k \rangle| = |\{1, a^d, a^{2d}, \ldots, a^{m-d} \}| = m/d$. How to prove $|a^k|=n/\gcd(n,k)$ whenever $|a|=n$? How does Hextech Crafting work? How do you earn free loot?  What's the deal with essences and why are they so important?  What do the different options mean when dealing with Redeeming Rerolling Disenchanting and Upgrading?  How does it all work? I have 2 1tb hard drives on my computer with Windows 8 on the first hard drive and nothing on the other.  I want to install Ubuntu 14 on the second hard drive. I've looked up some guides and they all say to install Ubuntu on the sdb partition when booting off a usb stick. I have also seen some say to unplug the Windows HDD and then install Ubuntu onto the second HDD, and Ubuntu will automatically detect Windows and ask what you want to boot into upon boot.   I am really concerned about this - Will it ask me to choose what OS I want to boot into? Is there something like rEFInd(Mac) for Windows? Can anyone please give me a guide on how to do it without ruining my computer?  Thanks