Find the sum to $n$ terms of the given series:  $$0.3+0.33+0.333+0.3333+\cdots$$  My Attempt: Let  $$S=0.3+0.33+0.333+0.3333+\cdots \text{ to $n$ terms}$$  $$=\frac {3}{10}+\frac {33}{100}+\frac {333}{1000} + \frac {3333}{10000}+\cdots$$ $$=\frac {3}{10} \left[1+\frac {11}{10}+\frac {111}{100}+\frac {1111}{1000}+\cdots \text{ to $n$ terms}\right]$$  How do I continue from here?
I'm looking for a closed-form expression (in terms of $n$), that will give the sequence  $$ (s_n) = \left( \frac{3}{10}, \, \frac{3}{10} + \frac{33}{100}, \, \frac{3}{10} + \frac{33}{100} + \frac{333}{1000}, \dots \right). $$  Can anyone think of one? I made a related post to this question several minutes ago but I realized I was interpreting the sequence wrong.
When I use the -a option as is asked and answered in , I got a lot of "rsync: failed to set permissions on" errors.  rsync: failed to set permissions on "/ata/text/RCS/jvlc,v": Operation not permitted (1) rsync: failed to set permissions on "/ata/text/RCS/jvm,v": Operation not permitted (1) rsync: failed to set permissions on ...   Why is this? The files are normal files with permission of 0664. In natural language parsing, what is the feature function? I'm working in the area of natural language processing, to be specific I'm reviewing the parsers that take advantage of data-mining techniques.   I've read an introduction to natural language processing, specifically the  by Della Pietra and others. In that paper, the authors explain that features are indicator functions that take into account certain aspects of the text. The problem is that this aspects affect the maximum entropy function.  In the case of parsing, I have problems understanding the concept of features. For parsing one must have:   Two sets, $X$ for the sentences and $Y$ for the parses For each sentence $x \in X$, one must have the N-best list of candidate parses; denoted $GEN(x) \subset Y$. Training samples $(x_j,y_j)$. The $x_j$ are sentences and the $y_j$ are parses. And a feature mapping $\Phi(X,Y)$ that maps each pair (x,y) to a vector of feature values.   The problem of parsing will consist of finding the weight vector such that the following expression is minimized  $$ -\sum log P(y_j|x_j,w) + \lambda ||w||_1 $$  where   $$ P(y_j|x_j,w) = \frac{exp \{w^T \Phi(x_j,y_j)\}   }{ \sum_{u \in GEN(x)} exp\{ w^T\Phi(x_j,u) \}  } $$  My question is, what are the features in this case? Some codified version of the parsing tree? Are the features a statistical concept?  I will also appreciate any bibliography that can be useful in tackling this issue.  UPDATE: I've talked to a professor and he had just told me that the features are obtained after doing a classification algorithm based on the parse-tree. Do you know what kind of classification is done with the parse tree? Finding an item in a List using C# Show OPs if someone is answering, live I ask a lot of question on SO, so this recommendation/idea comes from that experience. I'm not really sure how this would fit in with the current structure of SE.   Oftentimes after asking a question, maybe after an hour or so, I end up finding the answer I needed somewhere. And it comes time for me to answer the most difficult question of all: do I delete this question, or do I keep it in case someone answers and others may benefit from it. The problem is, if I don't delete it and no one answers, my acceptance rate goes down. So usually I'll just delete it.  However, sometimes I fear that someone is typing a really really long answer to my question since itäs only been an hour, and so I imagine the nightmare that person experiences when they find out their essay will be gone to waste. Overall, this never-to-be-seen-again answer could have benefitted many people had the question remained.  Since SE has gone "live-happy" lately, where answers and comments refresh live, I thought it might be interesting if the original asker of the question (or anyone else for that matter) could see how many people are currently responding to the question (just count, not necessary to display their names). This way, if I know someone is replying, I won't delete the question, and others can benefit from it. Make a table span multiple pages I have a table that takes up a full page, but I want it to start on a page that already has some text and then continue onto the next page (i.e. it's ok if the table gets broken up and spans two pages). It is a simple two column table:  \begin{table}[h] \centering \begin{tabular}{| p{.20\textwidth} | p{.80\textwidth} |}  \hline foo &amp; bar \\ \hline  foo &amp; bar \\ \hline  ... \end{tabular} \end{table}   I guess I need longtable? How do I use it? In a letter-class document that had no previous errors I am suddenly getting the error message:  "There's no line here to end" \opening{text}   I've used this file many times and today it starts giving this error. How do I troubleshoot this? How can I optimise a Minecraft-esque voxel world? I found Minecraft's marvelous large worlds extremely slow to navigate, even with a quad core and meaty graphics card.  I assume Minecraft's slowness comes from:   Java, as spatial partitioning and memory management are faster in native C++. Weak world partitioning.   I could be wrong on both assumptions. However, this got me thinking about the best way to manage large voxel worlds. As it is a true 3D world, where a block can exist in any part of the world, it is basically a big 3D array [x][y][z], where each block in the world has a type (i.e BlockType.Empty = 0, BlockType.Dirt = 1, etc.)  I assume that to make this sort of world perform well, you would need to:   Use a tree of some variety (//) to split all the cubes out; it seems like an oct/kd would be the better option, as you can just partition on a per cube level not a per triangle level. Use some algorithm to work out which blocks can currently be seen, as blocks closer to the user could obfuscate the blocks behind, making it pointless to render them. Keep the block object themselves lightweight, so it is quick to add and remove them from the trees.   I guess there is no right answer to this, but I would be interested to see peoples' opinions on the subject.  How would you improve performance in a large voxel-based world? How to change text entry in Ubuntu 18.04 I was using Ubuntu 16.04. There it was so easy to change the text entry option. Settings > Text entry.  But when I switch to Ubuntu 18.04 I can't find such option. So how can I write in another language? How to change text entry i.e. by super+shift or something like that? Can the editor for editing tag descriptions get updated to match the normal questions/answers editor? The text editor that is shown when editing tag descriptions still uses the previous behaviour for inserting links and images. Also, the placeholder text for links is still http:// instead of https:// compared to the new editor. Another &quot;nice to have&quot; feature that exists in the main editor is the ability to paste an image from clipboard directly to the text editor without having to press the &quot;insert image&quot; toolbar-icon first. Can it get updated to match the editor we use for questions and answers?  The following screenshot is an example of how it looks if I try to insert a link for a tag description:  In comparison, this is how it looks in the new editor: I am aware it is common practice to standardize the features for ridge and lasso regression, however, would it ever be more practical to normalize the features on a (0,1) scale as an alternative to z-score standardization for these regression methods? How do I get %LocalAppData% in c#? Replacing a toilet, when I turn the water valve off there is still water running into toilet? When trying to replace a toilet, the water valve to toilet will not stop water supply even when valve is shut off. I have opened and closed the valve several times but water continues to be supplied to toilet. I'm thinking about installing Ubuntu Desktop, but I don't know what flavor is the best for my system. What are the minimum and recommended hardware requirements? What kind of CPU? How much memory? Should I have Hardware Acceleration? What flavor should I use?  This is an attempt of a canonical answer. My answers have the &quot;official  requirements&quot;, the recommended are a mix of official sources and opinion based (along with the answer it's told the source). You can comment or edit if you feel that the information is obsolete or incomplete. It is a good rule of thumb that any system capable of running Windows Vista, 7, 8, x86 (Intel) OS X will almost always be a lot faster with any Ubuntu flavor even if they are lower-spec than described below. How can I create that glitter tears effect and the sparkles? Let $A, B \in \mathcal M_n(\mathbb C)$, we want to know if there's any relation between their spectral radius and the spectral radius of $A + B$.  The first part of this exercise is giving examples of the three posibilities: $\rho(A) + \rho(B) &lt; \rho(A+B)$ ; $\rho(A) + \rho(B) &gt; \rho(A+B)$ and $\rho(A)+ \rho(B) =\rho(A+B)$. This part was easy because there are no conditions about A or B.  The second part is proving that if A and B are normal matrixes, (i.e. $ AA^* =A^*A$, where $A^*$ is its conjugate transpose), then $ \rho(A+B) \le \rho(A) + \rho(B) $.   So my first attempt was using the Schur's decomposition, so $A=U^{-1}D_AU$ where $D_A$ is a diagonal matrix with the eigenvalues of $A$ in its diagonal and U is an unitary matrix. Similarly, B is similar to a diagonal matrix $D_B$ with the eigenvalues of B in its diagonal. That way I have $\rho(A) = \rho(D_A)$ and $\rho(B) = \rho(D_B)$ so now since $D_A + D_B$ is a diagonal matrix with $\lambda_i + \mu_i$ for $ 1\le i \le n $, where $\lambda_i$ and $\mu_i$ are the eigenvalues of $A$ and $B$ respectively. From here it's easy to see that $ \rho(D_A+D_B) \le \rho(D_A) + \rho(D_B) $, since $ |\lambda_i+\mu_i|\le|\lambda_i|+|\mu_i| \ \forall i$. But I don't see how to include $\rho(A+B)$ in this.  And the last part of the exercise is proving that if $ \{X_i\}$ is a basis of eigenvectors, which is common to A and B, then $ \rho(A+B) \le \rho(A) + \rho(B) $.  Here's my attempt, but I would like to know if it's correct:  Let $\lambda_i$ and $\mu_i$ be eigenvalues of A and B associated to the vector $X_i$, then $AX_i=\lambda_i X_i$ and $BX_i = \mu_iX_i$, and if we sum both equalities, we have $AX_i + BX_i = \lambda_iX_i + \mu_iXi$ so $(A+B)X_i=(\lambda_i+\mu_i)X_i$ so $(\lambda_i+\mu_i)$ is an eigenvalor of $(A+B)$ associated to the eigenvector $X_i$. Then is again clear that $|\lambda_i+\mu_i|\le|\lambda_i|+|\mu_i| \le \rho(A) + \rho(B)\ \forall i$, and particularly, for $\max_i |\lambda_i+\mu_i| = \rho(A+B)$ so $ \rho(A+B)\le \rho(A) + \rho(B)$  Any kind of help is appreciated and thank you very much in advance! I want to upgrade the hard drive in my 2012 Macbook Pro to an SSD. I have the parts, but had a question about how to clone the contents of my current drive so I can install it onto the SSD.  I've seen tutorials where people suggest connecting the new SSD to the Macbook prior to installation and using a Carbon Copy Cloner to clone the drive, and then installing the SSD drive.  My question is, can I do a Time Machine backup of my current hard drive on an external hard drive, install the SSD, and then use the Time Machine backup from the external to transfer it onto the newly installed SSD? Is this the same as using the clone program above? I had created the xml document with xml version="1.0".  In that document I need to use the greater than symbol &gt; and less than symbol &lt;.  How should I include those symbols? It's not working.  &amp;gt; and &amp;lt; are not working for me.  Is there any special encoder for this? How to Prevent the System.QueryException I am getting "Error System.QueryException: List has no rows for assignment to SObject".   Line 1: Account ac = [select id from Account where name='testaccount' limit 1] Line 2: if(ac != null) {           //do something         }   I got the above error in line 2 if there is no record.   Any help? I've checked in the home folder but this is all I see. Ubuntu 16.04 has been hanging on me ~1x per day.  This happens when I am in the middle of web browsing or using a desktop application, not when booting.  When it does, the mouse pointer will still move freely, but clicking or keystrokes have no effect on my system until I do a hard reboot.  What is the best way for me to debug this?  Here is some information:  selah@selah-Precision-Tower-5810:~$ uname -a Linux selah-Precision-Tower-5810 4.4.0-59-generic #80-Ubuntu SMP Fri Jan 6 17:47:47 UTC 2017 x86_64 x86_64 x86_64 GNU/Linux   Also, in case it is relevant, I have a "very big" monitor, a Dell 42" at 3840x2160 resolution.  selah@selah-Precision-Tower-5810:~$ lspci | grep VGA 03:00.0 VGA compatible controller: NVIDIA Corporation GM107GL [Quadro K2200] (rev a2)     UPDATE:  Following Artyom's advice I found the following message in my error logs:   Apr 27 09:47:25 selah-Precision-Tower-5810 kernel: nouveau 0000:03:00.0: fifo: SCHED_ERROR 0a [CTXSW_TIMEOUT] Apr 27 09:47:29 selah-Precision-Tower-5810 kernel: nouveau 0000:03:00.0: fifo: SCHED_ERROR 0a [CTXSW_TIMEOUT] Apr 27 09:47:33 selah-Precision-Tower-5810 kernel: nouveau 0000:03:00.0: fifo: SCHED_ERROR 0a [CTXSW_TIMEOUT]   Which has let me to this bug which describes similar behavior: