Last night I was watching the movie in which I heard this phrase     "I am home"   Actually, I am looking for explanations. How can it be possible to say, I am home?   Is it the same like      I am at home   Please explain it to me in details.
What's the difference between these two sentences? And which one's grammatically correct?
The code for reference is this  @article{matcontcl,  title= {MATCONT and CL MATCONT},  author = {A. Dhooge, W. Govaerts, Yu.A. Kuznetsov, W. Mestrom, A.M. Riet and  B.Sautois},  year = {2006},  journal = {Continuation toolboxes in matlab}, }   This is the error that follows  This is BibTeX, Version 0.99d (TeX Live 2015/W32TeX) The top-level auxiliary file: PropuestaInvestigacion.aux The style file: abbrv.bst Database file #1: biblio.bib Too many commas in name 1 of "A. Dhooge, W. Govaerts, Yu.A. Kuznetsov, W. Mestrom, A.M. Riet and B.Sautois" for entry matcontcl while executing---line 1049 of file abbrv.bst Too many commas in name 1 of "A. Dhooge, W. Govaerts, Yu.A. Kuznetsov, W. Mestrom, A.M. Riet and B.Sautois" for entry matcontcl while executing---line 1049 of file abbrv.bst Too many commas in name 1 of "A. Dhooge, W. Govaerts, Yu.A. Kuznetsov, W. Mestrom, A.M. Riet and B.Sautois" for entry matcontcl while executing---line 1090 of file abbrv.bst Too many commas in name 1 of "A. Dhooge, W. Govaerts, Yu.A. Kuznetsov, W. Mestrom, A.M. Riet and B.Sautois" for entry matcontcl while executing---line 1090 of file abbrv.bst (There were 4 error messages)   How could I fix it? Can't see a glass object through another glass object in Eevee It's driving me nuts! I just want to transfer one simple file from laptop to server.  I'm using ubuntu on both machines.  So I have:  -rwxr-xr-x 1 sandro    414622 2011-10-14 23:42 sandrophoto-html.tar.gz   And I'm sending it using:  sudo scp -P XXXX sandrophoto-html.tar.gz usern@server.local:/media/xx/xx/xx   And I get: scp: /media/xx/xx/xx/sandrophoto-html.tar.gz: Permission denied  p.s. I might be doing this other way around - I want to send file tar.gz that is located on my desktop, to remote server into the folder /media/yadayda Proving at least 99 pairwise sums of the reals are non-negative Suppose, one hundred real numbers are given and their sum is 0.Then how can I prove that at least 99 of the pairwise sums of these hundred numbers are non-negative?  I tried this: Let the real numbers be $a_i$,$1\leq i\leq100$. By the given condition, $a_1+a_2+\dots +a_{100}=0$.Suppose for the sake of contradiction, that at most 98 of the pairwise sums of these given reals are non-negative.I just tried to examine the case when exactly 98 of them are non-negative. I labelled the sums $S_1$,$S_2,\dots S_{4950}$,WLOG assume that sums $S_1,S_2,\dots S_{4852}$ are negative, the rest are non-negative. $$S_1+S_2+\dots +S_{4950}=99(\sum_{i=1}^na_i)=0$$ Case I: $S_{4853}+a_{4854}+\dots +a_{4950}=0$.That simply means that $S_1+S_2+\dots +S_{4852}=0$.But, by the given condition, $S_1+S_2+\dots +S_{4852}&lt;0$,a contradiction.After that, I am not able to make any progress.  Can anyone please suggest a more efficient method to solve this problem.I feel this approach will involve enormous case work. Has it been practically proven that quantum superposition exists ? If yes, how does it even work? How can I make my touchpad scroll either vertically or horizontally, but not both? If I'm browsing the internet and a page has both horizontal and vertical scroll bars it becomes really irritating to scroll with my touchpad. It keeps scrolling horizontally as well as vertically!  I'm using Ubuntu 16.04  and below are touchpad settings  Device 'SynPS/2 Synaptics TouchPad':     Device Enabled (160):   1     Coordinate Transformation Matrix (162): 1.000000, 0.000000, 0.000000, 0.000000, 1.000000, 0.000000, 0.000000, 0.000000, 1.000000     Device Accel Profile (282): 1     Device Accel Constant Deceleration (283):   2.500000     Device Accel Adaptive Deceleration (284):   1.000000     Device Accel Velocity Scaling (285):    12.500000     Synaptics Edges (286):  1769, 5431, 1652, 4658     Synaptics Finger (287): 25, 30, 0     Synaptics Tap Time (288):   180     Synaptics Tap Move (289):   242     Synaptics Tap Durations (290):  180, 100, 100     Synaptics ClickPad (291):   0     Synaptics Middle Button Timeout (292):  75     Synaptics Two-Finger Pressure (293):    282     Synaptics Two-Finger Width (294):   7     Synaptics Scrolling Distance (295): 200, 200     Synaptics Edge Scrolling (296): 0, 0, 0     Synaptics Two-Finger Scrolling (297):   1, 1     Synaptics Move Speed (298): 1.000000, 1.750000, 0.036300, 0.000000     Synaptics Off (299):    1     Synaptics Locked Drags (300):   0     Synaptics Locked Drags Timeout (301):   5000     Synaptics Tap Action (302): 2, 0, 0, 0, 1, 3, 0     Synaptics Click Action (303):   1, 1, 0     Synaptics Circular Scrolling (304): 0     Synaptics Circular Scrolling Distance (305):    0.100007     Synaptics Circular Scrolling Trigger (306): 0     Synaptics Circular Pad (307):   0     Synaptics Palm Detection (308): 0     Synaptics Palm Dimensions (309):    10, 200     Synaptics Coasting Speed (310): 21.120001, 50.000000     Synaptics Pressure Motion (311):    30, 160     Synaptics Pressure Motion Factor (312): 1.000000, 1.000000     Synaptics Resolution Detect (313):  1     Synaptics Grab Event Device (314):  0     Synaptics Gestures (315):   1     Synaptics Capabilities (316):   1, 0, 1, 1, 1, 1, 1     Synaptics Pad Resolution (317): 83, 46     Synaptics Area (318):   0, 0, 0, 0     Synaptics Noise Cancellation (319): 8, 8     Device Product ID (277):    2, 7     Device Node (278):  "/dev/input/event6" How to install brackets.io from the command line? For some reason the gnome installer that handles .deb packages on my system is not working. I'm not concerned.  How would one install the Brackets.io program from the terminal? Why is it that Android still can't be installed as regular OS? Are there any technical or others reasons why Android is still a firmware and not an OS which can be just installed without a lot of hassle?  Why there is no universal image which could detect appropriate drivers (kernel modules), partition NAND in some standard way and configure boot loader to boot updated OS version?  What stops Google from making a real (less firmware-like) OS (an OS for small ARM, x86 etc. devices)? Proof: Every convergent sequence of real numbers is bounded Limiting OpenVPN bandwidth I'd like to give users a certain amount of traffic. Let's say user A gets 1 GB and user B get 5 GB.  I have a great script which does log all this info, however this script is called when the user disconnects (client-disconnect).  Now, my problem is the following: what if user A uses up 1 GB of data and simply never disconnects? He would be able to use thousands of GB's. Is there any way run a specific script periodically within OpenVPN (so no crontab, since OpenVPN passes environment variables). I use the babel package in order to write in greek with font "kerkis".  I want to add code in english ("courier new" font) to my latex document but I get some difficulties.  Can anybody help me, please. Thank you in advance.  \documentclass[12pt]{article} \usepackage[english,greek]{babel} \usepackage[utf8x]{inputenc} \usepackage{graphicx} \usepackage{fancybox} \usepackage{verbatim} \usepackage{courier} \usepackage{kerkis} \usepackage{float} \usepackage{geometry} \usepackage{fancyhdr} \usepackage{titlesec} \usepackage{tocloft} \usepackage{hyperref} \usepackage{afterpage} \usepackage{color}    \usepackage{listings}  \renewcommand{\lstlistingname}{Κώδικας}  \lstset{  %matlab   backgroundcolor=\color{white},     basicstyle=\normalsize,    % COURIER NEW?        commentstyle=\color{green},    % comment style   escapeinside={\%*}{*)},           extendedchars=true,               frame=single,                              keywordstyle=\color{blue},       % keyword style   numbers=left,                     numbersep=5pt,                     numberstyle=\normalsize\color{black},    rulecolor=\color{black},           stepnumber=1,                      stringstyle=\color{magenta},     % string style }   \begin{document}  \selectlanguage{greek} Ελληνικά: \textlatin{this word means greek}  \selectlanguage{english} Now I write in english  \selectlanguage{greek} Ελληνικά  %\selectlanguage{english}???  \begin{lstlisting}[caption = \textlatin{example1.m}] { % Entropy E = 0; for i = 1:J     if p(i) ~= 0         E = E + p(i)*log2(1/p(i));     end end } \end{lstlisting}  \end{document} "Can’t help but" vs. "can help but" Convergence of the sequence $\sqrt{1+2\sqrt{1}},\sqrt{1+2\sqrt{1+3\sqrt{1}}},\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1}}}},\cdots$ I recently came across this problem     Q1 Show that $\lim\limits_{n \rightarrow \infty} \underbrace{{\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1+\cdots+n\sqrt{1}}}}}}}_{n \textrm{ times  }} = 3$   After trying it I looked at the solution from that book which was very ingenious but it was incomplete because it assumed that the limit already exists.  So my question is     Q2 Prove that the sequence$$\sqrt{1+2\sqrt{1}},\sqrt{1+2\sqrt{1+3\sqrt{1}}},\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1}}}},\cdots,\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1+\cdots+n\sqrt{1}}}}}$$ converges.   Though I only need solution for Q2, if you happen to know any complete solution for Q1 it would be a great help .  If the solution from that book is required I can post it but it is not complete as I mentioned.   Edit: I see that a similar question was asked before on this site but it was not proved that limit should exist. What is the association bonus, and how does it work? I was just awarded +100 reputation on all of my Stack Exchange accounts.  What is this bonus for? It simply says "Association Bonus" on my reputation overview.  Also:   What privileges does the association bonus grant users? Can I lose the association bonus? Does it make my reputation 101 everywhere? Can I earn the association bonus on sites I haven't joined yet? Does it matter which site I earn the 200 reputation on? Will I get an association bonus every time my reputation on a site crosses 200 points? Does the association bonus allow me to answer protected questions? Does the association bonus count towards the reputation cap? Can I get the association bonus if I only have a profile on one site? What else is there to know about the association bonus? Upgrade Debian Jessie (8) to Buster (10) possible or need to go sequential in versions upgrades? Just started working with a Debian Jessie (8) in a production environnent. While presently deployed it is not seeing any heavy use yet. I was looking at the OS , and I was thinking about how convenient it would be to just upgrade it before is start seeing some more steady use in our environment and possibly making things more complicated with a later upgrade.  I was looking for a procedure to upgrade from Debian v.8 to v.10 but most documented  are sequential in order (e.g. 8 -> 9, or 9 -> 10).  My question: should I upgrade sequentially, or there is some proper documented way to skip a main version while upgrading? As of today I only knew about ubuntu-bug which I could use to report bugs about a specific program. But now I learned about apport-collect and apport-bug which basically are:  apport-bug - Reports problems to launchpad using Apport to collect a lot of information about your system to help the developers fix the problem and avoid unnecessary questions and answers.  apport-collect - Works as apport-bug but it send the information to an already existing bug report. In my case it was apport-collect 1060268 Thanks to Brad Figg in Launchpad.  Are there any other tools to report bugs? I'm looking for a time and memory efficient solution to calculate a  in C. I need to avoid dividing because I'm on a PIC 16 which has no dedicated division unit.  At the moment, I just store all values in a  and simply store and update the sum each time a new value arrives. This is really efficient, but unfortunately uses most of my available memory... I try to write a simple Markdown parser in JavaScript. Therefore I want to check for the [link content][link id] syntax. I use the following code:  data = data.replace( /\[(.*?)\][ ]*\[([0-9]+)\]/g, '&lt;a href="$2"&gt;$1&lt;/a&gt;' );   It works well, but now I want to do this with a RegExp object. So I set up the following bit of code:  var r = new RegExp( '\[(.*?)\][ ]*\[([0-9]+)\]', 'g' ); data = data.replace( r, '&lt;a href="$2"&gt;$1&lt;/a&gt;' );   But it doesn't work. It even says that my regular expression (which works since the first example does a good job) is invalid:     unmatched ) in regular expression   I think it must have to do with some RegExp-object peculiarities I am not aware of. What am I doing wrong and how can the problem be solved? I have a log file being written by another process which I want to watch for changes. Each time a change occurs I'd like to read the new data in to do some processing on it.  What's the best way to do this? I was hoping there'd be some sort of hook from the PyWin32 library. I've found the win32file.FindNextChangeNotification function but have no idea how to ask it to watch a specific file.  If anyone's done anything like this I'd be really grateful to hear how...  [Edit] I should have mentioned that I was after a solution that doesn't require polling.  [Edit] Curses! It seems this doesn't work over a mapped network drive. I'm guessing windows doesn't 'hear' any updates to the file the way it does on a local disk. Is there a way to access Windows file with administrative rights using WSL?  sudo vi /mnt/c/Users/a/admin/file.txt