display 1st and 10th line of user login
How do I retrieve only the needed line from terminal output?
Where the property "__proto_" is stored? When I try to upload an image, I'm presented with the following dialog box,    The dialog box does not allow uploading either from my computer or by posting a link.  This happens only on Chrome browser (running on Windows). Clearing cache and cookies, and restarting computer do not resolve.  Is this just my computer? Or is this a site-wide bug?  Additional info:  Clicking on 'click' to upload does nothing. Dragging an image onto dialog redirects me to the file location on my computer. Clicking 'Add picture' redirects me to http://[SE-domain].com/upload/image?https=true.  UPDATE: A Norton extension for Chrome was the source of the problem. "Important to me" or "Important for me" I cannot easily figure out which one is more appropriate to use:     It's important to me.        It's important for me.   Are they the same? If not, what's the difference? Suppress "In:" biblatex Need Help Fixing Grub after Installing Ubuntu 13.04 x64 Alongside Windows 8 on a Lenovo IdeaPad Y400 with UEFI I have a Lenovo IdeaPad Y400 that came pre-installed with Windows 8. I would like to run Ubuntu alongside it in a dual-boot configuration. I've spent the past week fiddling around, re-installing both Windows and Linux in various configurations, and I've come awfully close to success, but seem to have hit a snag with Grub.  For my most recent attempt, I took the following steps:   Disabled Secure Boot Re-imaged Windows 8 from a hidden recovery partition, effectively restoring the machine to factory state Activated an option called Legacy Support in the BIOS (or is it UEFI now?) Booted Ubuntu 13.04 x64 from a USB stick, chose "install alongside Windows" and accepted all default options After a restart, found that I could boot Ubuntu, but could not boot Windows Once into Ubuntu, I ran Boot Repair with recommended settings and accepted all defaults. When Boot Repair finished, I was presented with the following message:      The boot files of [The OS now in use - Ubuntu 13.04] are far from the   start of the disk. Your BIOS may not detect them. You may want to   retry after creating a /boot partition (EXT4, >200MB, start of the   disk). This can be performed via tools such as gParted. Then select   this partition via the [Separate /boot partition:] option of [Boot   Repair]. ()    I followed the instructions at the url in the message, creating a 1GB EXT 4 partition near the start of the drive  when I tried to run Boot Repair again, the "Separate /boot partition" option on the "Grub Location" tab was disabled.  The new partition is /dev/sda11 and has the label GRUB. On restart, I get the following error message:      error: file '/boot/grub/i386-pc/normal.mod' not found.    grub rescue>    However, if I manually choose the boot partition by hitting F12, I can boot into Windows no problems. Selecting Ubuntu from the boot device menu gives me a Grub menu with the following options:      Ubuntu      Advanced options for Ubuntu       Windows UEFI recovery bootmgfw.efi      Windows Boot UEFI recovery       Windows UEFI recovery LrsBootmgr.efi      Windows Boot UEFI recovery bkpbootx64.efi       Windows Recovery Environment (loader) (on /dev/sda3)       Windows 8 (loader) (on /dev/sda5) System setup    Selecting Ubuntu from this menu allows me to get to my Ubuntu desktop. I haven't tried the other options yet for fear of losing the progress that I've made.   So it looks like I have successfully dual-booted the machine, but that Grub is broken for some reason or another.   My current partition scheme can be seen at:   Thanks in advance - Jonathan How to truncate a file in C? One of the topics that seems to come up regularly on mailing lists and online discussions is the merits (or lack thereof) of doing a Computer Science Degree. An argument that seems to come up time and again for the negative party is that they have been coding for some number of years and they have never used recursion.  So the question is:   What is recursion? When would I use recursion? Why don't people use recursion? Evaluate $$ 1 + \frac{1}{3}\frac{1}{4}+\frac{1}{5}\frac{1}{4^2}+\frac{1}{7}\frac{1}{4^3}+\dots$$  All i could do was to see that $$\frac{1}{3}=\frac{1}{2.1+1},\frac{1}{5}=\frac{1}{2.2+1},\frac{1}{7}=\frac{1}{2.3+1},\dots$$  SO, we should be able to write   $$ 1 + \frac{1}{3}\frac{1}{4}+\frac{1}{5}\frac{1}{4^2}+\frac{1}{7}\frac{1}{4^3}+\dots=1+\sum_{n=1}^{\infty}\frac{1}{2n+1}.\frac{1}{4^n}$$  This is what i could simplify the given question to...   But, this is doing me no good.. I could not go any further..  I would be thankful if some one can help me to clear this.  I would request users who are trying to help me to just give necessary hints but not post it as answer.  Thank You. Delegate OpenID to Google (NOT Google Apps) How to down-weight older data in time series regression In a regression fit of vectors varying with time $t$ $\qquad y \sim [x_t\ x_{t-1}\ x_{t-2}\ ...] \cdot [c_t\ c_{t-1}\ c_{t-2} \ ...] $ , how can one down-weight the older $x_t$ to model "older is less relevant" (than the regression gives) ? Say that rows in data matrix $X$ are observables (stocks, market segments ...) and columns are times. Correct me,   weights rows; how does one weight columns, times ?  Added: Down-weighting older data in time series looks complex, much more so than linear least squares with i.i.d. errors in rows (observations) -- just divide through by $\sigma_i$; or classification  with i.i.d. errors in columns (e.g. features) -- just centre each column. Can anyone say either   yes, I downweight time series; here are some examples on the web no: down-weighting time series is complex, not for novices.   (  discussed this question 10 years ago, mentioning Kalman filters and hierarchical Bayes, but with no examples.) I have an exercise found on a list but I didn't know how to proceed. Please, any tips?  Let $X$ be a connected subset of a connected metric space $M$. Show that for each connected component $C$ of $M\setminus X$ that $M\setminus C$ is connected. Why the $(n+1)$th prime number cannot exceed the smallest prime divisor of $p_1\dotsc p_n + 1$ Let $p_n$ be the $n$th prime number in its natural order. We want to show that  $$p_{n+1} \leq p_1\dotsc p_n + 1 \tag{1}$$  I know $p_1\dotsc p_n + 1 &gt; 1$, so it has at least one prime divisor, but the text says that $p_{n+1}$ cannot exceed the smallest of these divisors, but I cannot understand why, especially when I imagine $p_{n+1}$ being very large. Although some examples confirm that this statement is true, I cannot make a connection as to why the $n+1$ prime number cannot exceed the smallest prime divisor. Once this has been shown to be true, $(1)$ immediately follows. Determining size of grid cells created by vector grid tool of QGIS? I am working with QGIS 1.8.0 and Im making a vector grid on a map. Does someone know how big are the squares if the grid settings look like in the picture? How to Store Fresh Herbs The set of functions which map convergent series to convergent series Suppose $f$ is some real function with the above property, i.e.  if $\sum\limits_{n = 0}^\infty {x_n}$ converges, then $\sum\limits_{n = 0}^\infty {f(x_n)}$ also converges.   My question is: can anything interesting be said regarding the behavior of such a function close to $0$, other than the fact that $f(0)=0$? Is it theoretically possible that every person in this village has a different jar of coins? A village has about $1$ million residents. Suppose each resident has a jar with $100$ coins in it.Two jars are considered to be “equivalent” if they have the same number of 10c, 20c, 50c, $\$$1 and $\$$2 coins in them. How many different (i.e. nonequivalent) jars of coins exist? Is it theoretically possible that every person in this village has a different jar of coins?  I understood that if we have $k_1$ 10 coins in the jar where $k_1$ is between $0$ and $100$ inclusive, then there are $100-k_1$ coins of other denominations in the jar. Likewise, we also have $k_2$ 20c coins in the jar where $k_2$ is between $0$ and $100$ inclusive, so the combined number of 50c, $\$$1, and $\$$2 coins in the jar is $100-k_1-k_2$. And we always have some $k_1, k_2, k_3, k_4, k_5$, let's say, so that the sum of those $k$'s is $100$.  I got stuck since I don't know how to 'compare' the number of coins in jars for different residents. How do you correctly say large numbers I saw a post on  which links to a video where a person . Is he saying a large portion of the numbers wrong? Back in high school my algebra teacher was extremely picky.  If we were going to say the number 135, we would say one hundred thirty-five.  If a person said one hundred and thirty-five my teacher would interpret that to mean 100.35.  Was my algebra teacher wrong, or did Jon just waste over 80 hours counting to 100,000 incorrectly. I tried searching the web, but searching for ‘numbers and’  doesn’t work very well.  Can you point me to a reference or style guide that describes how to properly say large numbers? 32-bit, 64-bit CPU op-mode on Linux Why did the TIE fighter in The Force Awakens have life support? How to show a binomial random variable dominates another binomial random variable with a smaller success value? Let $X\sim B(n,p_h)$ and $Y\sim B(n,p_\ell)$ be two random variables following a respective binomial distribution, where $p_h&gt;p_\ell$. I want to show that  $$P(X\ge\alpha)\ge P(Y\ge\alpha),$$ for any $\alpha\in\{0,1,\dots,n\}$. In other words, I want to show  $$P(X\ge\alpha)=\sum_{i=\alpha}^{n}\binom{n}{i}p_h^i(1-p_h)^{n-i}\ge P(Y\ge\alpha)=\sum_{i=\alpha}^{n}\binom{n}{i}p_\ell^i(1-p_\ell)^{n-i}.$$  The statement to be proven is obviously true, but proving it is extremely difficult (at least for me). Can anyone give me some guidance on proving it?  It would be nice if someone can give an algebraic proof too, that is, show that  $$\sum_{i=\alpha}^{n}\binom{n}{i}p_h^i(1-p_h)^{n-i}\ge \sum_{i=\alpha}^{n}\binom{n}{i}p_\ell^i(1-p_\ell)^{n-i}.$$  Thank you very much!