I tried this:  ➜  /etc dpkg -l |grep php rc  php7.1-cli                        7.1.17-1+ubuntu17.10.1+deb.sury.org+1   amd64        command-line interpreter for the PHP scripting language rc  php7.1-fpm                            7.1.17-1+ubuntu17.10.1+deb.sury.org+1   amd64        server-side, HTML-embedded scripting language (FPM-CGI binary) rc  php7.1-json                           7.1.17-1+ubuntu17.10.1+deb.sury.org+1   amd64        JSON module for PHP rc  php7.1-mysql                          7.1.17-1+ubuntu17.10.1+deb.sury.org+1   amd64        MySQL module for PHP rc  php7.1-opcache                        7.1.17-1+ubuntu17.10.1+deb.sury.org+1   amd64        Zend OpCache module for PHP rc  php7.1-readline                       7.1.17-1+ubuntu17.10.1+deb.sury.org+1   amd64        readline module for PHP rc  phpmyadmin                            4:4.6.6-5                               all          MySQL web administration tool   And then I tried this:  ➜  /etc apt remove php7.1-cli php7.1-fpm php7.1-json php7.1-mysql php7.1-opache php7.1-readline phpmyadmin Reading package lists... Done Building dependency tree Reading state information... Done E: Unable to locate package php7.1-opache E: Couldn't find any package by glob 'php7.1-opache' E: Couldn't find any package by regex 'php7.1-opache'   How can I remove the remaining?  Edit: Sorry for the typo, but I corrected and ran it again. This is what I got:  ➜  /etc apt remove php7.1-cli php7.1-fpm php7.1-json php7.1-mysql php7.1-opcache php7.1-readline phpmyadmin Reading package lists... Done Building dependency tree Reading state information... Done Package 'phpmyadmin' is not installed, so not removed Package 'php7.1-readline' is not installed, so not removed Package 'php7.1-mysql' is not installed, so not removed Package 'php7.1-fpm' is not installed, so not removed Package 'php7.1-cli' is not installed, so not removed Package 'php7.1-json' is not installed, so not removed Package 'php7.1-opcache' is not installed, so not removed 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.
I suspected that installing xfce4 cause some issues in Ubuntu so I removed them using apt-get remove xfce4 xfce4-goodeis.  But when I ran 'dpkg -l' I still can see some libraries and packages for xfce4:  $ dpkg -l | grep -i xfce rc  libexo-1-0:amd64                              0.10.2-2                                 amd64        Library with extensions for Xfce rc  libgarcon-1-0                                 0.2.1-1                                  amd64        freedesktop.org compliant menu implementation for Xfce rc  libxfce4ui-1-0                                4.11.0-0ubuntu1~ppa0.13.10.1             amd64        widget library for Xfce - Gtk+2 variant rc  libxfce4ui-common                             4.11.0-0ubuntu1~ppa0.13.10.1             all          common files for libxfce4ui rc  libxfce4util6                                 4.10.1-1                                 amd64        Utility functions library for Xfce4 rc  libxfcegui4-4                                 4.10.0-2                                 amd64        Basic GUI C functions for Xfce4 rc  libxfconf-0-2                                 4.10.0-2                                 amd64        Client library for Xfce4 configure interface rc  mousepad                                      0.3.0-2                                  amd64        simple Xfce oriented text editor rc  thunar                                        1.6.3-1ubuntu1                           amd64        File Manager for Xfce rc  xfce4-appfinder                               4.10.1-1                                 amd64        Application finder for the Xfce4 Desktop Environment rc  xfce4-clipman                                 2:1.2.3-2ubuntu1                         amd64        clipboard history utility rc  xfce4-mixer                                   1:4.10.0-1ubuntu2                        amd64        Xfce mixer application rc  xfce4-notes                                   1.7.7-3ubuntu2                           amd64        Notes application for the Xfce4 desktop rc  xfce4-panel                                   4.10.1-1ubuntu1                          amd64        panel for Xfce4 desktop environment rc  xfce4-power-manager                           1.2.0-2ubuntu1                           amd64        power manager for Xfce desktop rc  xfce4-session                                 4.10.1-1ubuntu1                          amd64        Xfce4 Session Manager rc  xfce4-settings                                4.11.1-0ubuntu1~ppa0.13.10.1             amd64        graphical application for managing Xfce settings rc  xfce4-terminal                                0.6.2-3ubuntu1.1                         amd64        Xfce terminal emulator rc  xfce4-volumed                                 0.2.0-0ubuntu1                           amd64        volume keys daemon rc  xfdesktop4                                    4.11.2-0ubuntu1~ppa0.13.10.1             amd64        xfce desktop background, icons and root menu manager rc  xfwm4                                         4.11.1-0ubuntu1~ppa0.13.10.1             amd64        window manager of the Xfce project   I copy-pasted all these packages\libraries to form an apt-get remove command to remove all of these dependencies, and the command ran normally, but running dpkg -l | grep -i xfce showed these dependencies again !  Why are these dependencies still installed ?
Format SQL in SQL Server Management Studio In Visual Studio &amp; other IDEs, you can easily auto format your code with a keyboard shortcut, through the menu, or automatically as you type.  I was wondering if there is yet a way to enable this standard feature in SQL Server Management Studio?  I'm working with some large-ish stored procs that are a mangled mess of poorly formatted SQL and it'd be nice if I could just go "Select All -> Format SQL" English proverb for when a solution comes too late In Flemish we have a saying "Vijgen na pasen". Translated: "figs after Easter". It means a solution comes too late to be of any use.  What is the English equivalent for this?  Some googling gives me "Closing the barn door when the cow has bolted", but the explanation seems to point more towards the wrong solution for a problem. Django model with 2 foreign keys from the same table Beamer - place text of footnote in footline I must place footnotes and footcites at the bottom of the frames, like shown in the picture:   The line above the footnotes must always be there, and it must have a minimum distance to the bottom of lets say 2.5em.  So I see two possible solutions:   Add the footnote via \setbeamertemplate to the footline. Change the format of the footnoteline and let it always appear, even if no footnote was used.   For the last hours, I tried to accomplish point 1, but I had absolutely no success. Can you please help me? Otherwise I have to use *whisper* Powerpoint. ;)    EDIT: Do you know the phenomenon that only after you ask someone, you can get the right ideas? ;)  Here is a MWE of my current solution:  \documentclass[xcolor={dvipsnames}]{beamer}  \usepackage[absolute, overlay]{textpos} \usepackage{environ}   \usetheme{default} \setbeamertemplate{navigation symbols}{}%remove navigation symbols   \newcommand{\makemyrule}{%     \setlength{\unitlength}{14pt}%      minimum distance to bottom     \ifdim\footnoteheight&gt;\unitlength \setlength{\unitlength}{\footnoteheight} \fi%     check which distance is bigger     \begin{textblock*}{\linewidth}(0pt,\dimexpr\textheight-\unitlength)%    place with use of textpos         \textcolor{blue}{\rule{\paperwidth}{.3ex}}     \end{textblock*} }   \let\oldfootnote\footnote%      redefine the footnote command \renewcommand{\footnote}[1]{\Addheight{#1}\oldfootnote{#1}}  \newlength{\footnoteheight} \newsavebox{\mytext} \newcommand{\Addheight}[1]%     measure height of the text         {%                 \savebox{\mytext}{\small\strut\parbox{\textwidth}%                 {\hspace*{2em}\thefootnote#1}\strut}%       approximated by eye, not perfect!                 \addtolength{\footnoteheight}{\ht\mytext}%                 \addtolength{\footnoteheight}{\dp\mytext}%         }     \NewEnviron{myframe}[1]{%     \begin{frame}{#1}%     \setlength{\footnoteheight}{0pt}%     \BODY%     \makemyrule%     \end{frame}%     }    \renewcommand\footnoterule{}  \begin{document} \begin{myframe}{} \frametitle{Beamer example} using\footnote{Y LUSPIN, et al} footnotes\footnote{P. GHOSEZ, et al and a lot more information to create a linebreak} excessively \footnote{You do not need to read this, this is only blindtext to create even more and more text. Blindtext will go on forever, nobody can stop the allmighty blindtext. I think I am a blindtext author.} \end{myframe}{} \begin{myframe} \frametitle{Beamer example} using\footnote{Y LUSPIN, et al} footnotes\footnote{P. GHOSEZ, et al} \end{myframe}{} \begin{myframe} \frametitle{Another example} without footnotes\\ \end{myframe} \end{document}   What this does: At the beginning of each myframe-environment, the length \footnoteheight is reseted to zero. When a \footnote is placed, the height of the text is added to this length. At the end of each frame, via \makemyrule the bottom rule is created, which is above the footnote texts (my solution is not perfect) or, if there are no footnotes, at least 14pt above the bottom.  My wishes (not real problems, but I want it to work better) are   The height of the footnotetext is only approximated. I would like a solution where you can measure the height of the formatted footnote. The frame environment needs to be renamed to myframe. I would like a solution which works without changing the document. But it all failed, because I could not execute \makemyrule before \end{frame} automatically. Number formation from given digits I was asked this question in a recent interview. You are given two digits $0$ and $9$. Using only these two digits you must form the least positive number that is a multiple of a given '$n$' . The value of $n$ will be provided before hand. For example if we are given $n$ as $7$ then the answer will be $9009$ .  I tried using some basic divisibility principles but was not able to come up with a correct solution and code it up. Probably I need some help in number theory When applying to a PhD program in the US, how does the admissions process work? If an applicant is weak in a particular area, is it possible to offset that by being strong in a different area?  Note that this question originated from this . Please feel free to edit the question to improve it. Can we get x comment votes per y minutes, rather than one vote per 5 seconds? I quite often will read a thread of comments, and want to vote up a few of them. I vote one up, read the next few comments, vote up another and get a *giant red box*.  I've seen that "You can only submit a comment vote every 5 seconds" box far too often. Can I vote for 12 comments per minute, rather than 1 comment every 5 seconds? What is the meaning of the third derivative of a function at a point (Originally  by AJAY.)  What is the geometric, physical, or other meaning of the third derivative of a function at a point?  If you have interesting things to say about the meaning of the first and second derivatives, please do so. The Wikipedia article on  mentions two methods of sampling "small" polynomials namely uniform sampling and discrete Gaussian sampling. Uniform sampling is clearly the simplest, involving simply uniformly selecting the coefficients from the set of small coefficients, thereby guaranteeing they will be small. However, the articles mention that security proofs rely on discrete Gaussian sampling.  However, I have a bit of difficulty wrapping my head around    Why discrete Gaussian sampling would be better than uniform, security-wise?   I mean, usually uniform is preferable - it maximizes the entropy/information in each sample, making the outcome more unpredictable. I could understand it if the Gaussian sampling technique would somehow serve to avoid (at least with high probability) "weak" parts of the space of outcomes but I have found no information/justification that this is the case.  Another reason I can see why discrete Gaussian might be better is that there is, after all, a chance (albeit a small one) one would select a non-small coefficient, so the space of outcomes is actually larger. However, given that this probability of hitting this extra space is (by design) quite small but also that one would likely immediately reject such a sample (because the algorithm calls for a small polynomial), this seems to be irrelevant.  It is not because I am against discrete Gaussian sampling I just want to understand why it is more secure. Also, I want to understand if it really IS more secure or it is simply easier to prove security in that model. I would actually consider that very interesting if it is the case because it raises the question of why is it easier to prove the security under conditions that are intuitively worse (i.e. discrete Gaussian vs the intuitively better uniform case)? If it is so intuitively clear that uniform sampling is better, surely it must be possible to transform that intuition into a security proof of RWE also under uniform sampling. Otherwise, I would fear the intuition must with high likelihood be wrong or at least dubious. I'm new with LaTeX and I'm trying to make a table with the elements centered vertically and horizontally. I've searched for this question, it seems like most people were trying to do things a little more complicated than this, resulting in complicated answers I couldn't understand. The table below is already centered horizontally, but the elements are aligned to the top of the cells instead of the center. How do I fix this?      \begin{tabular}{*{5}{|c}|}         \hline         $p$ &amp; $q$ &amp; $p \land q$ &amp; $p \lor q$ &amp; $p \to q$\\         \hline         T &amp; T &amp; T &amp; T &amp; T\\         \hline         T &amp; F &amp; F &amp; T &amp; F\\         \hline         F &amp; T &amp; F &amp; T &amp; T\\         \hline         F &amp; F &amp; F &amp; F &amp; T\\         \hline     \end{tabular} Is there a way to block a list of specific apps on macOS?  I have looked up solutions such as Cisdem, but there are some holes in the way it works that I don't like.   Unless you also block Activity Monitor, Terminal, and System Preferences, you can simply quit the Cisdem process or create a new user to get around it. You have to block Activity Monitor, Terminal, and System Preferences to make it work well.   I want to block an app from running or even being installed on my Mac. The app can be installed via the App Store and the web. Not sure how to go about this. Enabling Parental Controls won't work as Administrator privileges are needed.   The specific app I want to block is Apple Configurator.  Any ideas? High-Swing Cascode Current Mirror I am currently dealing with current mirrors and came across the circuit shown below, a High-Swing Cascode Current Mirror. I read that this implementation, as the name suggests, has the advantage of a high voltage headroom, since the minimum potential at the drain terminal of M4 is: $$ V_{D4\_min}=V_{DS4}+V_{DS2}=(V_{GS4}-V_{TH})+(V_{GS2}-V_{TH}) $$ So the drain potential at M4 only needs to be twice the overdrive voltage, in case of same transistor dimensions, in order to hold M2 and M4 in saturation. But cannot this be said for many other cascode current mirrors, since that behaviour simply occurs by "stacking" together two transistors (M2 and M4)? Additionally, why is there a connection from the gate of M1 to the drain of M3? I have a hard time understanding whats going on in this circuit, help is greatly appreciated.    EDIT: A bias voltage source is setting the potential at the gate of M3/4. Sorry its not shown in the circuit.  EDIT 2: I just read that the mentioned bias voltage is implemented by a MOSFET in diode configuration, . For further discussion lets call it M5. How to install a Brother dcp-135c printer? Recently moved over onto Ubuntu. First time for anything like this for me as I'm coming from Windows but I'm here and ready to learn. The only problems Ive experienced so are saving in Libre office doc as a word doc file and then losing the formatting upon receival via email. However the more pressing issue is getting my old Brother DCP 135 c to work. Ive scanned a few help blogs and have found them frankly quite frightening.  Would it be possible for someone to write u a step by step guide (including explanations of terminology)  For those of us new to this magic world? Site choice dropdown cannot be shown on Android app Steps to reproduce:   Ask a question, open the "Ask on which site?" dropdown menu. Press the back button.   Issue: the menu will disappear and you can't bring it back by tapping the arrow or the field. Only typing text or selecting another field then tapping back will return the dropdown menu. Can I transfer trophies and data to a new account? Okay I have created a sub account on my ps3 as a new user. I wanted to change my psn online id. So I have copied all game data from the old account to my new account, but when I go to play the game it still says the trophies and data belong to the old account. I don't want to delete the old one and lose all my saved games and trophies, is there a way to either unlock and allow my new user to own the data and trophies or transfer the trophies and data so that my new account may own it? How can one derive Schrödinger equation? Syntax error while defining an array as a property of a class Why is Array.Length an int, and not a uint. This bothers me (just a bit) because a length value can never be negative.   This also forced me to use an int for a length-property on my own class, because when you  specify an int-value, this needs to be cast explicitly...  So the ultimate question is: is there any use for an unsigned int (uint)? Even Microsoft seems not to use them. Overfull hbox using biblatex Let's have 2 numbers, N and K, where K divides N. The number of K-combinations from a given set S of N elements is a well known formula. Let's concatenate N/K groups (resulting in N elements) such as the resulting set is N. How many possibilities are there, i.e. what's the formula?  For instance:    N=4, K=2, C(4, 2) = 6 {1,2},{1,3},{1,4},{2,3},{2,4},{3,4}   The 3 possibilities are:     {1,2},{3,4}   {1,3},{2,4}   {1,4},{2,3}   I generated these combinations and I think the number goes like this:  (4, 2): 3 (6, 3): 10 (6, 2): 15 (10, 5): 126 (9, 3): 280 (10, 2): 945 (14, 7): 1716 (12, 4): 5775 (15, 5): 126126 (15, 3): 1401400   Apparently, the result always divides with (N-1).