I am confused over the use of 'the' and capitalization.
Holmby Hall is a landmark site in Los Angeles. The Wikipedia page doesn't use "the" before Holmby Hall, but has used the before The Fox Theatre.
How do I change which audio jacks are used for input and output? I'm using a Realtek HD audio card built-in my motherboard. The Windows driver comes with a control panel that allows me to select which back panel jacks are used for what. So for example I can make both the blue jack and green jack for output and only the red one for mic-in. (Whereas by default, the blue jack is for line in, which I never need.)  How can I do the same under Linux? If possible, please don't suggest something that involves PulseAudio or JACK; I'd like to do it the plain way, e.g. by editing ALSA configuration files, if possible. The way I understand it, my problem should have nothing to do with software servers redirecting streams, just instructing the driver to treat this jack as so and so because it's hardware supported.  Thank you very much! Obtaining knowledge from a random forest Random forests are considered to be black boxes, but recently I was thinking what knowledge can be obtained from a random forest?  The most obvious thing is the importance of the variables, in the simplest variant it can be done just by calculating the number of occurrences of a variable. The second thing I was thinking about are interactions. I think that if the number of trees is sufficiently large then the number of occurrences of pairs of variables can be tested (something like chi square independence).  The third thing are nonlinearities of variables. My first idea was just to look at a chart of a variable  Vs score, but I'm not sure yet whether it makes any sense.    Added 23.01.2012 Motivation    I want to use this knowledge to improve a logit model. I think (or at least I hope) that it is possible to find interactions and nonlinearities that were overlooked. Suppose $X_1,\ldots,X_n$ are a random sample of $U(-\theta,\theta)$ with $\theta&gt;0$. How can find $$ E\left(|X_1|\ \big|\max |X_i| \right) $$ that $1\leq i\leq n$? Is it worth it to buy an FD-EOS adapter, or is it better to exchange a misbought lens? I recently bought a manual-focus (since manual doesn't bother me) . However, I didn't notice at the time of purchase that it was an FD lens. (I'm a hobbyist; I didn't know Canon had actually changed lens mounts at some point.)  On the one hand, I kind of want to experiment with this guy. And quality FD lenses are relatively cheap on the used market, so if the adapters were worth it, I could probably get more (and more varied) glass. On the other hand, everything I read about the FD-EOS adapters is highly contradictory. As in, some people swear by them, and others think they're outright tripe.  I am still within the exchange period, and can easily exchange this lens for this  that I'd been tossing up about buying anyway, as they are the same price.  Which would be the wiser choice? In The Matrix Reloaded, the Architect reveals to Neo that Trinity is about to die. I can't help but wonder if Neo would still choose the left door if the Architect had withheld that information.  The Architect could have designed a better choice mechanism so as to trick Neo into making a choice in the machine's favor rather than a highly risky one.   Did I miss anything important in the movie? How to test randomness (case in point - Shuffling) First off, this question is ripped out from  question. I did it because I think this part is bigger than a sub-part of a longer question. If it offends, please pardon me.  Assume that you have a algorithm that generates randomness. Now how do you test it? Or to be more direct - Assume you have an algorithm that shuffles a deck of cards, how do you test that it's a perfectly random algorithm?  To add some theory to the problem - A deck of cards can be shuffled in 52! (52 factorial) different ways. Take a deck of cards, shuffle it by hand and write down the order of all cards. What is the probability that you would have gotten exactly that shuffle? Answer: 1 / 52!.  What is the chance that you, after shuffling, will get A, K, Q, J ... of each suit in a sequence? Answer 1 / 52!  So, just shuffling once and looking at the result will give you absolutely no information about your shuffling algorithms randomness. Twice and you have more information, Three even more...  How would you black box test a shuffling algorithm for randomness? Closed form for $\sum_{k=0}^{m} {\binom {m}{k}} a^{k} (b+ck)^N$ Is there a closed form for the following?   $$\sum_{k=0}^{m}  {\binom {m}{k}} a^{k} (b+ck)^N$$      how about a pretty limit for large $b$.   I have tried using the binomial expansion for the $(b+ck)^N$ to convert the above expression to double sum and then tried to simplify the double sum which was not successful. Any idea if I have find a closed form for it? Notice: Undefined variable: logged in C:\xampp\htdocs\Site\Site\view_category.php What is "my guy syndrome" and how do I handle it? I've been reading forum posts and blogs who mention "my guy" syndrome as a specific type of difficult player, but I can't seem to find a solid definition for the term. Can someone explain this particular kind of problem player to me? How do you deal with this kind of problem? I have customers who want to buy large amount of flash memories but he wants to copyright all files inside it.   The flash will contain files that will be delivered for his customers but they're not allowed to copy or delete any of the files the only allowed permission is to ready the files.   I searched and found many solutions but all have on function it WriteProtect the USB though I can't add files to Drive at all but I can delete or copy any file in the drive.   Is there any way to protect the flash memory so I can't copy data out of it? $$A=\begin{array}{ccc} 0 &amp; 1/2 &amp; 0 &amp; \cdots &amp; 0 \\ 1/2 &amp; 0 &amp; 1/2 &amp;\cdots&amp; 0\\ 0 &amp; 1/2 &amp; 0 &amp; \cdots &amp; 0\\ \vdots &amp; \vdots &amp; \vdots &amp;\ddots &amp; 1/2\\ 0 &amp; 0 &amp; 0 &amp; 1/2 &amp; 0 \end{array}$$  I need to know the spectral radius of $A$ in function of the dimension of the matrix $n$. I know only one way to know the spectral radius, using the definition I find all eigenvalues and then find the maximum. but it very hard if $n$ is changing. Some help please!  I did some iteration by   $$det(\lambda I-A)$$  $$n=2 \quad r=\frac{\sqrt{1}}{2}$$ $$n=3 \quad r=\frac{\sqrt{2}}{2}$$  for $n=2$ and $n=3$ are correct.  and if we take this rule, for   $$n=5\quad \quad r=\frac{\sqrt{4}}{2}$$  but this isn´t true since I know radius for this matrix should be $&lt; 1$ and if we take this rule  for $n=5$ we have  $$\frac{\sqrt4}{2}=1$$   Some hint? Use abbreviations for 1000+ score in linked posts I don't really enjoy the ragged view of linked posts:    This feature request is to use a format that suggested in ; something that matches the user-profile tags page in terms of the tally:    That is, use abbreviations for 1000+ (k for 1,000+, m for 1,000,000+, ...). How can I gear my follower post 2.0? I'm a little confused as to how I'm supposed to gear up my follower since the installation of smart loot in Loot 2.0. My follower still has most pre loot 2.0 items because I have yet to find comparables that are rolling with the right affixes.   To be clear, I play a DH and so I used the Templar as my tank. I very rarely find items that roll with Strength because smart loot sees my DH and rolls Dex for me instead. With the use of the Enchantress I thought it would get better because I could replace Dex with Strength...but that's not true. It seems as though the Enchantress will only roll Dex for me too.   With the auction house down for good, no outlet for trading, and the installation of smart loot, it seems that gearing a follower has become almost impossible unless I want to jump on another character that uses strength and get items that way. I want to find items that I can use while I'm playing. How do I gear my follower post Loot 2.0? Do I have any options other than character jumping? Why does my grep expression need to use $'string' to match tab characters? How can you combine all lines that end with a backslash character? Using a common command line tool like sed or awk, is it possible to join all lines that end with a given character, like a backslash?  For example, given the file:  foo bar \ bash \ baz dude \ happy   I would like to get this output:  foo bar bash baz dude happy NSInvocation for Dummies? How exactly does NSInvocation work? Is there a good introduction?  I’m specifically having issues understanding how the following code (from Cocoa Programming for Mac OS X, 3rd Edition) works, but then also be able to apply the concepts independently of the tutorial sample. The code:  - (void)insertObject:(Person *)p inEmployeesAtIndex:(int)index {     NSLog(@"adding %@ to %@", p, employees);     // Add inverse of this operation to undo stack     NSUndoManager *undo = [self undoManager];     [[undo prepareWithInvocationTarget:self] removeObjectFromEmployeesAtIndex:index];     if (![undo isUndoing])         [undo setActionName:@"Insert Person"];      // Finally, add person to the array     [employees insertObject:p atIndex:index]; }  - (void)removeObjectFromEmployeesAtIndex:(int)index {     Person *p = [employees objectAtIndex:index];     NSLog(@"removing %@ from %@", p, employees);     // Add inverse of this operation to undo stack     NSUndoManager *undo = [self undoManager];     [[undo prepareWithInvocationTarget:self] insertObject:p                                        inEmployeesAtIndex:index];     if (![undo isUndoing])         [undo setActionName:@"Delete Person"];      // Finally, remove person from array     [employees removeObjectAtIndex:index]; }   I get what it’s trying to do. (BTW, employees is an NSArray of a custom Person class.)  Being a .NET guy, I try to associate unfamiliar Obj-C and Cocoa concepts to roughly analogous .NET concepts. Is this similar to .NET’s delegate concept, but untyped?   This isn’t 100% clear from the book, so I’m looking for something supplemental from real Cocoa/Obj-C experts, again with the goal that I understand the fundamental concept beneath the simple(-ish) example. I'm really looking to be able to independently apply the knowledge -- up until chapter 9, I was having no difficulty doing that. But now ...    Thanks in advance! I'm trying to show that for $b&gt;1$, $x&gt;0$ and $x$ irrational, that $$\sup \{b^p:p\in Q,\;0&lt;p&lt;x\} = \inf\{b^q:q\in Q,\;x&lt;q\}$$ I know this follows immediately if we define $b^x=\exp(x\log(b))$ and use the fact that the exponential function is strictly increasing and continuous over $\mathbb R$, but I'm not allowed to do that. In fact, I only have that $b^{m/n}=(b^{1/n})^m$, where $b^{1/n}$ means the positive $n^{th}$ root of $b$; $b^x$ is not yet defined for irrational $x$.  I know that the supremum and infimum both exist because if $b&gt;1$ and $p&lt;q$, then $b^p&lt;b^q$. Also, by assuming that the inf $&lt;$ sup, I got a contradiction. The part I'm stuck on is deriving a contradiction from assuming that sup $&lt;$ inf. Does anybody have any ideas?  Thank you. Populating cascading dropdown lists in JSP/Servlet For various such sentences in many cases I get confused, it seems different for different cases. I want to know if someone left doing something for permanantly then what should be used? Also give some examples for different cases. Suppose... "I left my bag" means "I forgot my bag". but If I want to say the same for permanentaly "I left bringing my bag". Where should we use "stop" and "quit" then? Algebraic proof that if $a>0$ then $1+a^9 \leq \frac{1}{a}+a^{10} $ Prove that if $a&gt;0$ then $1+a^9 \leq \frac{1}{a}+a^{10} $.   Using the fact that $a \gt 0$, multiply by $a$ on both sides and get everything to one side we have; $a^{11}-a^{10}-a+1 \geq 0$. By factoring $(a^{10}-1)(a-1) \geq 0 $.  I am not sure how to proceed any further.