What does in GIS buffer [:-4] Python
Understanding slice notation
Wrap text at any point if normal hyphenation not possible I have data (generated from a database, not manually typed in) that mostly fits into a table cell with fixed width, but sometimes overflows because there are long words for which no hyphenation is found.  The problem can be demonstrated with the following example:  \documentclass{article} \usepackage[utf8]{inputenc} \begin{document} \begin{tabular}{|p{1cm}|p{4cm}|} 1 &amp; Cell where normal hyphenation is possible ÄÖÜ \\ 2 &amp; CellwherenormalhyphenationisnotpossiblebutshouldwrapinsteadofoverflowÄÖÜ \end{tabular} \end{document}   My requirements are:   Text never overflows the cell (assuming some minimum width such that at least a handful characters have place) First priority measure to achieve 1. is the normal hyphenation If 2. fails, it is allowed to break the word at any character, so fill the line and break just before overflow would happen (disregarding normal hyphenation rules)   In the example, the overflow in cell 1 is prevented by measure 2., the normal hyphenation. The second cell overflows. I would like to have this cell treated by measure 3.  For the answer please consider:   Package seqsplit didn't help me The custom macro \wrap proposed in the answer to  comes near my wish, but can't handle the non-ascii characters ÄÖÜ (independent if they are input with utf8 input encoding or with \"A\"O\"U) As the text comes from a database, no manual editing of the cell content is wanted.   One of my ideas was to insert \linebreak[0] after every character, to tell LaTeX that a break can be made if no better opportunities exist. But this doesn't work like intended.  Thanks for your suggestions! Force fsck.ext4 on reboot, but really "forceful" One of my Ubuntu 10.04 servers is giving me trouble. When I run fsck.ext4 -n /dev/sda5 it tells me there are errors in the free inode count, free block count, and more.  I have tried:  touch /forcefsck   Also tried:  shutdown -rF now   and still, after reboot, I see errors.  I also just checked on my eeePC netbook, Ubuntu 10.10, and have the same issue!  How can I force a really "forced" "forceful" "seriously fix my filesystem" fsck of the "/" filesystem on reboot?  Clarification: I run fsck.ext4 -n because it's a mounted filesystem, to check if there are errors. This tells me that there are. I thought that the automatic fsck every 30 mounts during the boot-up process is precisely to take care of errors in the root filesystem. But it doesn't do it in my case. I could reboot with a LiveCD and fix the errors, and then reboot again, but that's some serious downtime for a live server. A reboot, auto fsck, then continue booting is much more sustainable on a live server, and I believe should be the right behaviour.  Additional info: Here is the output. It looks like something that the autofsck would fix, doesn't it?  root@server:~# fsck.ext4 -n /dev/sda5 e2fsck 1.41.11 (14-Mar-2010) Warning!  /dev/sda5 is mounted. Warning: skipping journal recovery because doing a read-only filesystem check. /dev/sda5 contains a file system with errors, check forced. Pass 1: Checking inodes, blocks, and sizes Pass 2: Checking directory structure Pass 3: Checking directory connectivity Pass 4: Checking reference counts Pass 5: Checking group summary information Free blocks count wrong (1849368, counted=1948909). Fix? no  Free inodes count wrong (545504, counted=552134). Fix? no   /dev/sda5: ********** WARNING: Filesystem still has errors **********  /dev/sda5: 116752/662256 files (0.2% non-contiguous), 795324/2644692 blocks Can you decide to counterspell after another counterspell has failed? Sugar as a defence against bacteria? mentions that sugar "at a certain level acts as a preservative". I've always been taught that microorganisms eat sugar and expel acids, that is why sugary food are damaging to teeth. How is it that sugar acts as a preservative, then?  Googling the question I've found   though I don't credit the sources as being especially reputable. What is the real reason that sugar can act as a preservative? I have a script which calls two commands:  long_running_command | print_progress   The long_running_command prints progress but I'm unhappy with it. I'm using print_progress to make it nicer (namely, I print the progress in a single line).  The problem: Connection a pipe to stdout also activates a 4K buffer, so the nice print program gets nothing ... nothing ... nothing ... a whole lot ... :)  How can I disable the 4K buffer for the long_running_command (no, I do not have the source)? I have two related problems that are causing me big trouble:  Let $\;a_1,...,a_n\in\Bbb R\;,\;\;a_i\neq 0\;\;\forall\;i\;$ , and let $\;b_1,...,b_n\in\Bbb R\;,\;\;b_i\neq b_j\;\;\forall\,i\neq j\;$ .  (1) Prove that the equation  $$a_1x^{b_1}+\ldots+a_nx^{b_n}=0$$  has at most $\;n-1\;$ different zeros in $\;(0,\infty)\;$ (Hint: Use induction)  (2) Prove that the equation  $$a_1e^{b_1x}+\ldots+a_ne^{b_nx}=0$$  has at most $\;n-1\;$ different zeros in $\;\Bbb R\;$ .  Now, the following is what I've done so far: for a differentiable function $\;f\;$ ,  I can prove that if $\;f'(x)=0\;$ has $\;n-1\;$ different zeros, then $\;f(x)\;$ has at most $\;n\;$ different zeros, using the mean value theorem, say.  But I can't see how to use induction in this case: if I differentiate in the first problem, I get $$0=f'(x)=a_1b_1x^{b_1-1}+\ldots +a_nb_nx^{b_n-1}=\frac1x\sum_{i=1}^na_ib_ix^{b_i}$$  ...and now?! How does induction kick in here? I though perhap something like: if we suppose WLOG $\;b_1&lt;b_2&lt;...&lt;b_n\;$ , then perhaps inducting on $\;\lfloor b_n\rfloor\;$, but it gets messy and blurry if $\;b_n&lt;0\;$...  Any help, hints are very much appreciated. display only 3 foreach result per row How can I pass arguments to a batch file? Is $0 \, \mathrm m = 0 \, \mathrm s = 0 \,\mathrm {kg} = 0$? How do we define $[0 \, \mathrm m]$?  I once was given an assignment where I was asked to deduce and write down some physical quantity. It turned out that this quantity was $0$ in one unit or another, so I decided to drop the physical units because I figured that it didn't matter anyhow.  But I got to thinking:  If $0 \, \mathrm m = 0$, then we could add units of different dimensions (an operation not normally defined) like so: $5 + 0 \,\mathrm m = 5$.   Does $[ \cdot ]$ map $0 \, \mathrm m$ to both $0$ and $L$? Is there an established regime of thinking about physical quantities as an abstract algebra? Perhaps as a vector space where formal sums such as $5 \, \mathrm m + 10 \, \mathrm s$ are allowed? Would it be improper to drop the units of measurement of $0 \,\mathrm m$ like this in an academic paper? Opposite of caregiver I want to write a book about the unfair expectations of a caregiver. A caregiver refers to somebody to looks after somebody else.  What is the term for that 'somebody else'.  'Patient' doesn't seem all encompassing. I have reviewed this:   but it does not answer my question. The suggested fixes in this question is to set up FB, IG, and other social media pages. We have had these for months. We have 576 Instagram followers, 293 followers on Facebook, 17,425 views on Vimeo, Youtube, Pinterest and LinkedIn presence. Here is the response in a YouTube search:  Let's be clear. If you search for my company name and product name YT changes the spelling to something that doesn't exist and suggests a video with no matching result terms (using either spelling) disparaging OTHER luxury handbags, while insinuating it is referring to my handbags. When a user searches for our business, , Google and Youtube changes the spelling to Aslan Vaughn and displays these results:  For the first few months it just seemed like it was taking some time to percolate, but over 7 months we have had 17,500 unique visitors and nearly 90 backlinks.  The only results for Aslan Vaugn is the birth announcement of the second child of a musician in New Jersey. It is a Facebook post and has 14 likes. Google is favoring a spelling that has only two results with 14+ views over dozens of links and tens of thousands of views. How is this possible? An FB post with 14 likes is that much more popular than a business with 17,500 unique visitors (despite the Google obfuscation)? Is my company on some list? On other search engines my company covers the first few pages in results. Through Google, you cannot find our company no matter how many pages in you go. Unless you search for the term in quotes, . In which case we cover the first few pages here as well: Repeat String - Javascript My inline-block elements are not lining up properly "Arnold raced out of the door": grammatical or not? Finding center and radius of circumcircle Find the center and radius of the circle which circumscribes the triangle with (complex) vertices $a_1,a_2,a_3$. Express the result in symmetric form.   I'm not sure where to start in this question. The circumcenter is the intersection of the perpendicular bisectors, but I don't know how to calculate the line equation of the perpendicular bisectors yet. As for the radius, after we find the circumcenter $c$ we can calculate it using $|c-a_1|$ (or $|c-a_2|$ or $|c-a_3|$; all three should be equal.) So how can I calculate the circumcenter? Does this recursive sequence have a closed-form? In the book I'm reading at the moment () it says that if you don't declare a default constructor for a class, the compiler supplies one for you, which "zeroes out each data member". I've experimented with this, and I'm not seeing any zeroing -out behaviour. I also can't find anything that mentions this on Google. Is this just an error or a quirk of a specific compiler? Whenever I boot Ubuntu, I get a message that it cannot mount my windows partition, and I can choose to either wait, skip or manually mount.  When I try to enter my Windows partition through Nautilus I get a message saying that this partition is hibernated and that I need to enter the file system and properly close it, something I have done with no problem so I don't know why this happens.    Here's my partition table, if any more data is needed please let me know.     Device Boot      Start         End      Blocks   Id  System /dev/sda1            2048    20000767     9999360   83  Linux /dev/sda2        20002814   478001151   228999169    5  Extended /dev/sda3   *   478001152   622532607    72265728    7  HPFS/NTFS/exFAT /dev/sda4       622532608   625141759     1304576   82  Linux swap / Solaris /dev/sda5        20002816   478001151   228999168   83  Linux Has the concept of non-integer $(n+m)$-dimensional spacetime ever been investigated by theoretical physicists? The following image serves to aid the reader in understanding the "privileged character" of $3+1$-spacetime.    The wikipedia article on , and the  "The priveleged character of $3+1$-dimensional spacetime" in particular, made me think a bit about the possibility that we might live in a non-integer amount of spatial and/or time dimensions.   The notion of attaching a non-negative real number to a metric space has at least mathematically already been described by such concepts as "" and "".   This may sound silly/ignorant/absurd to professional practicing theoretical physicists. To me (a layman), however, it doesn't sound much stranger than the idea of wrapping up six extra dimensions (which is, from what I understand, considered to be a serious possibility by those who study $10$-dimensional String Theory) into intricate shapes called "Calabi-Yau Manifolds".   Has any research on $(a +b)$-dimensional spacetime (where $a,b \in \mathbb{R}_{\geq 0} $) ever been done? If so, what where the findings? If not, why not? Suppose $p$ is a prime number such that $(p-1)/4$ and $(p+1)/2$ are also primes. Show that $p=13$ Suppose $p$ is a prime number such that $(p-1)/4$ and $(p+1)/2$ are also primes. Show that $p=13$.   My approach:   Since $p$ is prime, it is of the form $6k+1$ or $6k-1$. Now if $p$ is of the form $6k-1$ then $(p+1)/2 = 3k$ which is not possible as $3|3k$.   So $p$ is of the form $6k+1$. Now $(p-1)/4 = 3k/2$ so $2\mid k$. So $p$ is of the form $12k+1$. But now, how to prove $k=1$?  Please help!