I am using Ubuntu 18.04 (Bionic Beaver). When I launch software updater from the launcher it does not connect to the server to download updates. It always posts "Try again." I always check network settings &amp; I am connected. If I click ok after and try it again, it downloads the updates - so how do I fix this issue? I have tried to delete it just to reinstall it but no luck
I havent used my Ubuntu for quite a long time.  Today, when I booted Ubuntu (14.04 LTS), the software updater and Software &amp; Updates (from Settings) are not working.  The software updater's window will show up for around 1 sec, but it will close automatically. Software &amp; Updates is never shown, no matter how many times I click the icon. Note that neither of them show any error message.  Those 2 features were working perfectly the last time I used Ubuntu. I want to do some system upgrade and update.  For now, I use sudo apt-get update &amp;&amp; sudo apt-get upgrade. This command runs very fast, meaning (I think) my Ubuntu is not updated properly. The update from software updater always has a big size hence the download should be slower.  What should I do?   Can I just uninstall and reinstall both of them? If I can, how to do it?  Just to clarify, I don't want to upgrade my Ubuntu version (I want the LTS one), I just want to upgrade the software/packages I used.  Thanks for your time.
`apt update` failed on Debian Linux Attempting to upgrade testing/stretch Debian Linux:  $ sudo apt update  Ign:1 http://dl.google.com/linux/talkplugin/deb stable InRelease Hit:2 http://dl.google.com/linux/talkplugin/deb stable Release                                                                    ... Get:25 http://mirror.vorboss.net/debian unstable/main i386 Packages 2016-03-25-1456.28.pdiff [15.0 kB]              Fetched 686 kB in 7s (89.5 kB/s)                                                                                                                                                         Reading package lists... Done W: gpgv:/var/lib/apt/lists/dl.google.com_linux_talkplugin_deb_dists_stable_Release.gpg: The repository is insufficiently signed by key 4CCA1EAF950CEE4AB83976DCA040830F7FAC5991 (weak digest) W: gpgv:/var/lib/apt/lists/deb.opera.com_opera_dists_stable_InRelease: The repository is insufficiently signed by key 419D0ACF314E8E993F7F92E563F7D4AFF6D61D45 (weak digest) W: Failed to fetch http://dl.google.com/linux/talkplugin/deb/dists/stable/Release  No Hash entry in Release file /var/lib/apt/lists/dl.google.com_linux_talkplugin_deb_dists_stable_Release, which is considered strong enough for security purposes E: Some index files failed to download. They have been ignored, or old ones used instead.  What's wrong? How to fix it? Its a .vbproj and looks like this  &lt;Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003"&gt;     &lt;PropertyGroup&gt;         &lt;ProjectGuid&gt;15a7ee82-9020-4fda-a7fb-85a61664692d&lt;/ProjectGuid&gt;   all i want to get is the ProjectGuid but it does not work when a namespace is there...   Dim xmlDoc As New XmlDocument()  Dim filePath As String = Path.Combine(mDirectory, name + "\" + name + ".vbproj")  xmlDoc.Load(filePath)  Dim value As Object = xmlDoc.SelectNodes("/Project/PropertyGroup/ProjectGuid")   what can i do to fix this? Pass Method as Parameter using C# Why is moving directories to /dev/null dangerous? Deep cloning objects Find the Galois group of $x^3-5$ over $\mathbb{Q}$. In this case, the roots of $x^3-5$ are $\{\sqrt[3]{5},\omega\sqrt[3]{5},\omega^2\sqrt[3]{5}\}.$ I think $\mathbb{Q}(\sqrt[3]{5},\omega\sqrt[3]{5})$ is the splitting field of $x^3-5.$ Then, $[\mathbb{Q}(\sqrt[3]{5},\omega\sqrt[3]{5}):\mathbb{Q}]=3,$ I think the automorphisms are: $$id$$ $$\sigma:\sigma(\sqrt[3]{5})=-\sqrt[3]{5}$$ $$\tau:\tau(\omega\sqrt[3]{5})=-\omega\sqrt[3]{5}$$ I'm not sure about what I have done. But how to determine the Galois group based on this? And how to determine the solvability of this polynomial? biblatex: separator for citing multiple sources, some of them with page, some not I'm using biblatex for my references.  Normally, if I use \cite{source1, source2, source3}, I get a citation like  [3, 45, 98]   If I now want to give a page number for one of them, it looks confusing imho, as I should get (did not try it out up to now, honestly)   [3, 45, 78, p. 23f, 98]   So imho it would make sense to change one of the separator from a comma to e. g. a semicolon like:  [3; 45; 78, p. 23f; 98]   Question 1: Does that make sense, or are there other conventions for citing sources with and without page numbers together?  (Up to now I collected the citations without page number in one cite command and added singular \cite[][p. xy]{} commands for those with page numbers., so I'd get:   [3, 45, 98][78, p. 23f]   )  the \cites[]{}[]{}[]{} could also do that, but it also uses the same separators for entries and postnotes.  Question 2: How could I change the separator globally for those number-citations from comma to semicolon in biblatex? How to write ≙ in latex Explanation of the binomial theorem and the associated Big O notation Why must I wait two days before accepting my own answer? I got this message today while trying to accept my answer on my own question.  Why must I wait this time, if I am sure that the answer I answered is the right one, just want to understand the point of view?  I faced that just today on Super user and didn't get this message before. Creating a new DOM element from an HTML string using built-in DOM methods or Prototype I have an HTML string representing an element: '&lt;li&gt;text&lt;/li&gt;'. I'd like to append it to an element in the DOM (a ul in my case). How can I do this with Prototype or with DOM methods?  (I know i could do this easily in jQuery, but unfortunately we're not using jQuery.) Don't remember the exact start to the story, but it went something like "walking along a path" or something, and when he hears what sounds like a shotgun blast behind him, he then feels something strike him in the butt. He passes out, and when he awakens, he discovers that the "shotgun blast" was actually a miniature spaceship that exploded and shot miniature aliens into his body. The aliens prove to be very beneficial because they clean up all the toxins and other poisons in his body. They can be transmitted through kissing or sexual activity.  Any help with the name of the story would be greatly appreciated.  Dan This is what I would like to do:  morekeywords={SENÃO, ENTÃO, FAÇA, ATÉ, ENQUANTO, PARA, SE, DECLARA, DECLARE, E, OU, FIM_ENQUANTO, FIM_PARA}   I'm defining a new language, and I would like to use natural language words as keywords.  The problem is with keywords: SENÃO, ENTÃO, FAÇA, ATÉ.  I have solved the first problem, in showing special chars with:   The alsoletter here, doesn't work for me, I got an error when using it: alsoletter={Ç,É,Ã}.  test.tex  \documentclass{article}  \usepackage[brazilian]{babel} \usepackage[T1]{fontenc}  \usepackage[utf8]{inputenc} \usepackage{listingsutf8}  \usepackage{listings}  \lstset{%         inputencoding=utf8,         extendedchars=true,         literate=%         {é}{{\'{e}}}1         {è}{{\`{e}}}1         {ê}{{\^{e}}}1         {ë}{{\¨{e}}}1         {É}{{\'{E}}}1         {Ê}{{\^{E}}}1         {û}{{\^{u}}}1         {ù}{{\`{u}}}1         {â}{{\^{a}}}1         {à}{{\`{a}}}1         {á}{{\'{a}}}1         {ã}{{\~{a}}}1         {Á}{{\'{A}}}1         {Â}{{\^{A}}}1         {Ã}{{\~{A}}}1         {ç}{{\c{c}}}1         {Ç}{{\c{C}}}1         {õ}{{\~{o}}}1         {ó}{{\'{o}}}1         {ô}{{\^{o}}}1         {Õ}{{\~{O}}}1         {Ó}{{\'{O}}}1         {Ô}{{\^{O}}}1         {î}{{\^{i}}}1         {Î}{{\^{I}}}1         {í}{{\'{i}}}1         {Í}{{\~{Í}}}1 }  \lstdefinelanguage{pseudo} { extendedchars=true, alsoletter={_}, morekeywords={ENQUANTO,PARA,SE,SEN\~{A}O,ENTÃO,ATÉ,FA\c{C}A,DECLARA,DECLARE,E,OU,FIM_ENQUANTO,FIM_PARA,FAÇA}, ndkeywords={NUMERO,TEXTO,LEIA,ESCREVA}, sensitive=true, morecomment=[l]{//}, morecomment=[s]{/*}{*/}, morestring=[b]" }  \begin{document} \lstinputlisting[language=pseudo]{foo.pseudo} \end{document}   foo.pseudo  ENQUANTO nota != -1 FAÇA // Comment example  LEIA nota  SE nota &gt;= 7 ENTÃO    ESCREVA "Aprovado"  SENÃO    ESCREVA "Reprovado"    TEST "Algo mais" /* mais  comentário */  FIM_ENQUANTO    I have seen: How to delete an element from an array in C# Lets say I have this array,  int[] numbers = {1, 3, 4, 9, 2};   How can I delete an element by "name"? , lets say number 4?  Even ArrayList didn't help to delete?  string strNumbers = " 1, 3, 4, 9, 2"; ArrayList numbers = new ArrayList(strNumbers.Split(new char[] { ',' })); numbers.RemoveAt(numbers.IndexOf(4)); foreach (var n in numbers) {     Response.Write(n); } How to compute the following integral?  $$\int\log(\sin x)\,dx$$    Motivation: Since $\log(\sin x)'=\cot x$, the antiderivative $\int\log(\sin x)\,dx$ has the nice property $F''(x)=\cot x$. Can we find $F$ explicitly? Failing that, can we find the definite integral over one of intervals where $\log (\sin x)$ is defined? What is *.pkinfo file? What is a *.pkinfo file?   Google Search results talk about Package Info files and how they contain map documents and layers, so I don't see how this is different from a .mpk file.    I also have not found anything about how to create a *.pkinfo file. Prove there's a simple path of length $k$ in a simple graph $G$ where all the vertices have degree of at least $k$.   Relevant definitions:  $G$ is a simple graph that consists of a vertex set $V(G) = \{v_1, v_2, ..., v_n\}$ and an edge set $E(G) = \{e_1, e_2, ..., e_m\}$ where each edge is an ordered pair of vertices. The edge $\{u,v\}$ is denoted $uv$.  A walk of length $k$ is a sequence $v_0,e_1,v_1,e_2,...,e_k,v_k$ of vertices and edges such that $e_i=v_{i-1}v_i$ for all $i$. A path is a walk with no repeated vertex.   My attempt:  Induction, for $k=1$ it's obvious.  Suppose for $k-1$ and we'll prove for $k$.  Let $G$ be a simple graph such that $\forall v \in V : d(v)\ge k$.  We can assume that there are at least $k+1$ vertices since there are $k$ neighbours to every vertex.  Let $v_0$ be some vertex, it has $k$ neighbours, we'll move to one of its neighbours say $v_1$ and remove $v_0$. So now there are $k$ vertices with a degree of at least $k-1$ and from the induction hypothesis we'll have a path of length $k$.  Is using only $k$ vertices from $n$ right? Does it keep the generality when using only all the neighbours of $v_0$? How do I block unwanted callers without jailbreaking? Non-pejorative synonym of "notoriety" I'm trying to say:       He probably gained some __________ [good notoriety] from this picture.   I was thinking publicity, but that connotes some kind of negative to me as well (like the stuff you see in gossip magazines at the checkout line).  I want a word as powerfully positive as notoriety is powerfully negative. I am currently running a Dungeons and Dragons 4 campaign for a group of 9 players.  Whittling the group down to a more manageable size is not really an option since they are all family.  When we do combat it takes forever even if I have one player help me and allow them to go 2 at a time.  When we do story based adventure there are 2-3 players that do most of the talking and the others twiddle their thumbs.  I've tried encounters with many foes, encounters with only a few tough foes, dialog only encounters, social puzzle encounters, everything I can think of.  What else can I try to get this group more engaged?