I have an overfull line in my bibliography (BibLaTeX) that I can't get rid of, see the image below. I would assume that this behavior is caused by the hyphenated double word &quot;Password-Scrambling&quot;. For long URLs I have managed to properly break the lines using the following commands, where a high penalty value is defined for URL characters: \setcounter{biburllcpenalty}{9000}% Lowercase \setcounter{biburlucpenalty}{9000}% Uppercase  However, I cannot find anything about how I could get this hyphenated word to correctly break. Thank you so much!
Here's my MWE (this is an actual bibliography item, the draft option is there to show the overfull hbox):  \documentclass[draft]{article}  \usepackage{filecontents} \begin{filecontents*}{x.bib} @BOOK{LV12,   title = {Algebraic operads},   publisher = {Springer},   year = {2012},   author = {Loday, Jean-Louis and Vallette, Bruno},   volume = {346},   pages = {xxiv+634},   series = {Grundlehren der Mathematischen Wissenschaften [Fundamental Principles     of Mathematical Sciences]},   address = {Heidelberg},   doi = {10.1007/978-3-642-30362-3},   isbn = {978-3-642-30361-6}, } \end{filecontents*}  \usepackage{biblatex} \addbibresource{x.bib}  \begin{document} \nocite{*} \printbibliography \end{document}   This produces:     Overfull \hbox (15.12822pt too wide) in paragraph at lines 27--27   I'm generally aware of how to fix overfull hbox from text I wrote myself, but not when the text is produced by a package. What is the best course of action here? Altering the entry is not an option.
How to install bicycle pedals without a notch on the spindle? I bought a pair of bicycle pedals that to my surprise had no notches on the pedal spindle to use when tightening them. I managed to screw them in by hand, but they are not quite tight since I can't use a spanner on them. So what would be the correct way to tighten them? Are there any special tools or similar that I'm supposed to use?  The offending pedals can be seen below. The spindle is, as you can see, completely smooth. When logging in C#, how can I learn the name of the method that called the current method? I know all about System.Reflection.MethodBase.GetCurrentMethod(), but I want to go one step beneath this in the stack trace. I've considered parsing the stack trace, but I am hoping to find a cleaner more explicit way, something like Assembly.GetCallingAssembly() but for methods. What is the purpose of the thin wire at the top of power transmission lines? I know a power transmission line carries usually two sets of 3 phase conductors. But I have noticed a relatively thin wire at the center-top of the power transmission line. What is the purpose of this thin wire? Can you release your zanpakuto if you are mute? So, this sounds like a stupid question I know but in the bleachverse 'names' are very important and you can only unleash the power of your zanpakuto if you can call out its name. Therefore, if a shinigami is mute, will they ever be able to achieve shikai/bankai? If so then how? Only one case that I know of is for shinigamis who have already achieved bankai to be able to release their shikais without a command.  Answers based on LN are welcome, but if you are citing from a dubious source or a source whose canon status can be question, please specifically mention it. I am mostly interested in an answer based on a  canon source. What's the function of the ~ bitwise operator (Tilde) I recently upgraded from Ubuntu 11.10 to 12.04. If it makes any difference, my system is a Dell Inspiron 1520.   I encounter a problem whenever I shutdown or restart; it kills all running processes (as far as I can tell), but once I get past the shutdown text screen and the screen goes black,  my computer doesn't power off. The fans still run and the screen is still on, etc. I have to hold down the power button in order to complety shut down.   Does anyone know how to resolve this problem? Is it Possible to Disable Feed and Topics for an Object Completely at Profile Level / Page LayOuts Variation of the metric with respect to the metric For a variation of the metric $g^{\mu\nu}$ with respect to $g^{\alpha\beta}$ you might expect the result (at least I did):  \begin{equation} \frac{\delta g^{\mu\nu}}{\delta g^{\alpha\beta}}= \delta^\mu_\alpha\delta^\nu_\beta. \end{equation}  but then to preserve the fact that $g^{\mu\nu}$ is symmetric under interchange of $\mu$ and $\nu$ we should probably symmetrise the right hand side like this:  \begin{equation}\frac{\delta g^{\mu\nu}}{\delta g^{\alpha\beta}}= \delta^\mu_\alpha\delta^\nu_\beta + \delta^\mu_\beta\delta^\nu_\alpha.\end{equation}  Is this reasonable/correct? If not, why not?  It seems that I can derive some weird results if this is right (or maybe I'm just making other mistakes). In the book Thomas's Calculus (11th edition) it is mentioned (Section 3.8 pg 225) that the derivative $dy/dx$ is not a ratio. Couldn't it be interpreted as a ratio, because according to the formula $dy = f'(x)dx$ we are able to plug in values for $dx$ and calculate a $dy$ (differential). Then if we rearrange we get $dy/dx$ which could be seen as a ratio.   I wonder if the author says this because $dx$ is an independent variable, and $dy$ is a dependent variable, for $dy/dx$ to be a ratio both variables need to be independent.. maybe? Getting MAC Address I need a cross platform method of determining the MAC address of a computer at run time.  For windows the 'wmi' module can be used and the only method under Linux I could find was to run ifconfig and run a regex across its output.  I don't like using a package that only works on one OS, and parsing the output of another program doesn't seem very elegant not to mention error prone.   Does anyone know a cross platform method (windows and linux) method to get the MAC address?    If not, does anyone know any more elegant methods then those I listed above? This or That person Will taking a gap year after my Master's degree improve or degrade my potential of doing a PhD? What is this agglomeration of pink cells I found attached to a stone? "is" operator behaves unexpectedly with integers Why does the following behave unexpectedly in Python?  &gt;&gt;&gt; a = 256 &gt;&gt;&gt; b = 256 &gt;&gt;&gt; a is b True           # This is an expected result &gt;&gt;&gt; a = 257 &gt;&gt;&gt; b = 257 &gt;&gt;&gt; a is b False          # What happened here? Why is this False? &gt;&gt;&gt; 257 is 257 True           # Yet the literal numbers compare properly   I am using Python 2.5.2. Trying some different versions of Python, it appears that Python 2.3.3 shows the above behaviour between 99 and 100.  Based on the above, I can hypothesize that Python is internally implemented such that "small" integers are stored in a different way than larger integers and the is operator can tell the difference. Why the leaky abstraction? What is a better way of comparing two arbitrary objects to see whether they are the same when I don't know in advance whether they are numbers or not? Lazy loading properties after an insert Can we switch terminals at Heathrow (LHR) for shopping only? We will be flying into and out of Terminal 5 at Heathrow. Now, my wife has taken fancy to a certain duty-free store located at Terminal 3. Assuming we factor in enough time before boarding our outbound flight from Terminal 5, are we allowed to enter Heathrow from Terminal 3, shop and then shuttle over to Terminal 5? Can't login with Stack Exchange OpenID when HTTPS-Everywhere plugin is active - apparent protocol mismatch I can't seem to log in with my Stack Exchange OpenID. When I try, I get the error message:     Unable to log in with your OpenID provider:      The openid.return_to parameter (.) does not match the actual URL (.) the request was made with.   It works if I disable the HTTPS-Everywhere plugin in Firefox, but if I then re-enable the plugin and go to a site on which I am not logged in (in which case login is normally nearly seamless), it fails again with the same error message, or at least something very similar.  I'm not aware of having done anything that might have caused this, although I will admit I don't recall seeing https:// in the address bar on Stack Exchange before (I do now, and that's a good thing IMO!). I was using the site  and it worked fine then, but not now... My interest in combinatorics was recently sparked when I read about the many things that the Catalan numbers count, as found by Richard Stanley. I picked up a copy of Brualdi's Combinatorics, and while browsing the section on counting sequences I found a nice little puzzle that has definitely puzzled me.     Let $m$ and $n$ be nonnegative integers with $n\geq m$. There are $m+n$ people in line to get into a theater for which admission if $50$ cents. Of the $m+n$ people, $n$ have a $50$-cent piece and $m$ have a $\$ 1$ dollar bill. The box offices opens with an empty cash register. Show that the number of ways the people can line up so that change is available when needed is   $$ \frac{n-m+1}{n+1}\binom{m+n}{m}. $$     I first noted that the first person to enter must be one of the $n$ with a half-dollar. Now the register has a half-dollar change. The second person can be either a person with a half-dollar or a dollar. In the first case, the register will now have two half-dollars, in the second case, the register will now have one dollar bill. So it seems to me that when one of the $n$ people with a half-dollar enters, the number of half-dollars in the register increases by $1$, and when one of the $m$ people with a bill enters, the number of half-dollars decreases by $1$ but the number of bills increases by $1$.   I tried to model this by looking at paths in $\mathbb{Z}^2$. The $x$-axis is like the number of half-dollars, and the $y$-axis is the number of bills. You start at $(0,0)$, and you can take steps forward $(1,0)$ or backwards diagonally $(-1,1)$ corresponding to who enters, but you must always stay in the first quadrant of the plane without crossing over the axes. The goal is to make $m+n$ moves, and I figured maybe the number of such paths is counted by $\frac{n-m+1}{n+1}\binom{m+n}{m}$, but I'm not sure how to show this. I don't know if this observation simplifies the problem at all, as I don't know how to finish up. I'd be happy to see how this problem is done, thank you. In his 1984 paper , Paul Holland raised one of the most fundamental questions in statistics:     What can a statistical model say about   causation?   This led to his motto:     NO CAUSATION WITHOUT MANIPULATION   which emphasized the importance of restrictions around experiments that consider causation.  Andrew Gelman makes :     "To find out what happens when you change something, it is necessary to change it."...There are things you learn from perturbing a system that you'll never find out from any amount of passive observation.   His ideas are summarized in .  What considerations should be made when making a causal inference from a statistical model? Keep items in inventory on death in Minecraft