I'm using ubuntu 15.10 and when I try to install application from software center after installation I got this error.when I click Ok I can see that application on my pc but I can't open it.Help me  installArchives() failed: Selecting previously unselected package libkeybinder-3.0-0:amd64. (Reading database ...  (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 231567 files and directories currently installed.) Preparing to unpack .../libkeybinder-3.0-0_0.3.0-1_amd64.deb ... Unpacking libkeybinder-3.0-0:amd64 (0.3.0-1) ... Selecting previously unselected package libopencore-amrnb0:amd64. Preparing to unpack .../libopencore-amrnb0_0.1.3-2.1_amd64.deb ... Unpacking libopencore-amrnb0:amd64 (0.1.3-2.1) ... Selecting previously unselected package libopencore-amrwb0:amd64. Preparing to unpack .../libopencore-amrwb0_0.1.3-2.1_amd64.deb ... Unpacking libopencore-amrwb0:amd64 (0.1.3-2.1) ... Selecting previously unselected package gir1.2-keybinder-3.0. Preparing to unpack .../gir1.2-keybinder-3.0_0.3.0-1_amd64.deb ... Unpacking gir1.2-keybinder-3.0 (0.3.0-1) ... Selecting previously unselected package gstreamer1.0-plugins-ugly-amr:amd64. Preparing to unpack .../gstreamer1.0-plugins-ugly-amr_1.6.0-1ubuntu1_amd64.deb ... Unpacking gstreamer1.0-plugins-ugly-amr:amd64 (1.6.0-1ubuntu1) ... Selecting previously unselected package libsidplay1v5. Preparing to unpack .../libsidplay1v5_1.36.59-8_amd64.deb ... Unpacking libsidplay1v5 (1.36.59-8) ... Selecting previously unselected package gstreamer1.0-plugins-ugly:amd64. Preparing to unpack .../gstreamer1.0-plugins-ugly_1.6.0-1ubuntu1_amd64.deb ... Unpacking gstreamer1.0-plugins-ugly:amd64 (1.6.0-1ubuntu1) ... Selecting previously unselected package kazam. Preparing to unpack .../archives/kazam_1.4.5-2_all.deb ... Unpacking kazam (1.4.5-2) ... Processing triggers for gnome-menus (3.13.3-6ubuntu1) ... Processing triggers for desktop-file-utils (0.22-1ubuntu3) ... Processing triggers for bamfdaemon (0.5.2~bzr0+15.10.20150627.1-0ubuntu1) ... Rebuilding /usr/share/applications/bamf-2.index... Processing triggers for mime-support (3.58ubuntu1) ... Processing triggers for man-db (2.7.4-1) ... Processing triggers for hicolor-icon-theme (0.15-0ubuntu1) ... Setting up runit (2.1.2-3ubuntu1) ... start: Job is already running: runsvdir dpkg: error processing package runit (--configure):  subprocess installed post-installation script returned error exit status 1 dpkg: dependency problems prevent configuration of git-daemon-run:  git-daemon-run depends on runit; however:   Package runit is not configured yet.  dpkg: error processing package git-daemon-run (--configure):  dependency problems - leaving unconfigured Setting up libkeybinder-3.0-0:amd64 (0.3.0-1) ... No apport report written because the error message indicates its a followup error from a previous failure. Setting up libopencore-amrnb0:amd64 (0.1.3-2.1) ... Setting up libopencore-amrwb0:amd64 (0.1.3-2.1) ... Setting up gir1.2-keybinder-3.0 (0.3.0-1) ... Setting up gstreamer1.0-plugins-ugly-amr:amd64 (1.6.0-1ubuntu1) ... Setting up libsidplay1v5 (1.36.59-8) ... Setting up gstreamer1.0-plugins-ugly:amd64 (1.6.0-1ubuntu1) ... Setting up kazam (1.4.5-2) ... Processing triggers for libc-bin (2.21-0ubuntu4) ... Errors were encountered while processing:  runit  git-daemon-run Error in function:  dpkg: dependency problems prevent configuration of git-daemon-run:  git-daemon-run depends on runit; however:   Package runit is not configured yet.  dpkg: error processing package git-daemon-run (--configure):  dependency problems - leaving unconfigured
I am using 15.04.   So I'm working with git and I installed the standard version. I set up the ssh keys and was able to clone one of my repositories to the correct folder. Everything was working great and then I decided it was a good idea to install more packages. I ran sudo apt-get install git-all. I'm looking at error codes now having to deal with upstart.  start: Unable to connect to Upstart: Failed to connect to socket /com/ubuntu/upstart: Connection refused No apport report written because the error message indicates its a followup error from a previous failure. dpkg: error processing package runit (--configure):  subprocess installed post-installation script returned error exit status 1 dpkg: dependency problems prevent configuration of git-daemon-run:  git-daemon-run depends on runit; however:   Package runit is not configured yet.  dpkg: error processing package git-daemon-run (--configure):  dependency problems - leaving unconfigured Errors were encountered while processing:  runit  git-daemon-run E: Sub-process /usr/bin/dpkg returned an error code (1)   This is what happens when I even update/upgrade my system. At this point all I'm looking to do is be able to install software and update my current software. Is there any way I can potentially reverse this issue or at least correct it?   Edit: Thankfully this issue was solved only a day or two after it happened. The accepted answer worked perfectly and took care of my issue
Are {/bin, /lib, /sbin} symlinks into /usr in Ubuntu? I do not have access to an Ubuntu system or chroot. I was hoping if someone could tell me if the  is accurate in saying:     For Quantal, merged /usr should be supported. On new systems installer should create {/bin, /lib, /sbin} symlinks into /usr. As far as I can tell, it's something like this:  damage reduction = armor / (armor + 100)   Is this accurate? Is there any software package to solve the linear regression with the objective of minimizing the L-infinity norm. Calculus function create Create an example of a function $f: \mathbb{R} \to \mathbb{R}$ such that $f(f(f(\mathbb{R}))) = f(f(\mathbb{R})) \neq f(\mathbb{R})$. The value of $\lim_{n \to \infty}\int_{0}^{1}nx^ne^{x^2}dx$ is _____ I tried by taking the odd $n$ values as in that case, the integral I suppose was easier to calculate. So, denote $I_n=n\int_{0}^{1}e^{x^2}x^ndx$, then we have : $I_1=\frac{e-1}{2},\\I_3=\frac{3}{2},\\I_5=5(\frac{e}{2}-1),\\I_7=7(3-e)$ Then I tried calculating (random) values using calculator as integration was getting cumbersome. $I_{31}=2.488$, $I_{51}=2.57$. I do not see any kind of recurrence so that I can find a general term for odd $n$. I also tried the method given . The idea was that since integral doesn't depend on $n$ considering $I(n)=\int_{0}^{1}e^{x^2}x^ndx$, then $I'(n)=\int_{0}^{1}x^n\ln(x)e^{x^2}dx$, but this also doesn't lead me to any conclusion as well. I believe I couldn't get to a proper approach to tackle this question. Can someone please help with the idea that involves in solving these type of questions? What lens characteristics are important in star photography? PostgreSQL CPU 100% after configure Wal log shipping hot standby I have configured Hight Avaliabily WAL Log Shipping Hot Standby (SSL) with one node. But after I configure, both hosts (primary and secondary) take 100% CPU usage. The most strange is because I have only one database called &quot;TESTE&quot; with one table called &quot;EXAMPLE&quot; to check if replication was OK. The replication worked perfectly but I don't understand why my CPU takes 100% usage because I don't have any application connect on my cluster. I ran HTOP command and get this results: Image 1 - Primary Server HTOP Info  Image 2 - Secondary Server HTOP info  S.O. version: No LSB modules are available. Distributor ID: Debian Description:    Debian GNU/Linux 10 (buster) Release:        10 Codename:       buster  PostgreSQL version: postgres (PostgreSQL) 12.3 (Debian 12.3-1.pgdg100+1)  Primary server postgres.conf file: max_connections = 100 SSL = on shared_buffers = 2GB work_mem = 10485kb maintenance_work_mem = 512MB dynamic_shared_memory_type = posix effective_io_concurrency = 200 max_worker_processes = 4 max_parallel_maintenance_workers = 2 max_parallel_workers_per_gather = 2 max_parallel_workers = 4 wal_level = replica wal_buffers = 16MB max_wal_size = 200MB min_wal_size = 80MB checkpoint_completion_target = 0.7 archive_mode = on max_wal_senders = 3 wal_keep_segments = 8 hot_standby = on hot_standby_feedback = on random_page_cost = 1.1 effective_cache_size = 6GB default_statistics_target = 100  pg_stat_activity info:  pg_stat_archiver info:  pg_stat_replication info:  If I stop postgres service in both servers the CPU still has 100% usage. Anyone can help me? Disable flagging on old chat messages In response to the effect  is referring, I am proposing one of two possible scenarios:   Disallow flags on chat messages older than X hours, or Remove old flagged posts from the transcript, but no suspension occurs (as in the aforementioned question). Is there a symmetry associated to the conservation of information? Conservation of information seems to be a deep physical principle. For instance, Unitarity is a key concept in Quantum Mechanics and Quantum Field Theory.  We may wonder if there is an underlying symmetry, in some space, which may explain this conservation of information. I have a question about editing practices:  Does it look good to edit a question you have just answered?  For example: say I had just answered a question, then saw that the question had some minor formatting issues. Should I edit it? Does it turn up voters off when they see that I am answering a question I changed, possibly to better suit my answer? Find the population size that maximizes the probability that two random samples of size $20$ will have exactly $2$ members in common Ten fish are caught in a lake, marked, and then returned to the lake. Two days later 20 fish are again caught, 2 of which have been marked.  (a) Find the probability of 2 of the 20 fish being marked if the lake has $k$ fish (assuming the fish are caught at random). (b) What value of k maximizes the probability?    Progress:     I got the (a), $$\binom{10}{2}\binom{k-10}{18}\bigg/ \binom{k}{20}$$ But how do I get part (b) where $k$ is to maximize the probability? Key Derivation Functions vs. Password Hashing Schemes Key derivation functions, such as HKDF (standardized in ), are meant to stretch some initial keying material having enough entropy, like a Diffie-Hellman shared value, into one or more strong cryptographic secret keys.   Password-hashing schemes, such as the  winner , are meant to hash usually low-entropy passwords with the goal of making the hash digest inversion as costly as possible for an adversary with respect to CPU and memory consumption, as well as parallelization.  Is it exact to consider that password-hashing schemes are actually key derivation functions specialized for low-entropy inputs? Or is there any other essential difference of theoretical nature between these two types of cryptographic schemes? Describe in English a Turing machine that semidecides the following language - Is this solution correct? The language being L, which is described as follows:  $L$ = { $&lt;M&gt;$ | $M$ accepts the binary encodings of at least 4 odd numbers } .  My solution:  M generates the binary encodings in $\Sigma_M*$ in ascending order and uses dovetailing to interleave the computation of M on those binary encodings. As soon as four computations accept, M halts and accepts.  Is this correct? What corrections would have to be made if not? I am not sure if I am providing enough details in my solution which may cause it to be incorrect. Fact  The intersection of a closed set $A$ and a compact set $B$ is closed.  Background  I wanted to prove that the intersection of closed and compact sets is compact. There might be other ways, but I am not interested in them for now and am looking to prove the above statement.  Relevant Facts  I don't have much idea what to use. $A^c$ is open. Every cover $\cup_{i\ge1}U_i$ of $B$ contains a subcover $\cup_{i=1}^kU_i$. I might want to prove $A\cap B^c$ is open. Limit points may be another points to consider but I don't get any idea in that direction.  I also don't have that $B$ is closed otherwise it would be trivial.  Some Clarification  I am aware that compact sets are not closed in arbitrary topological spaces. The reason why I was motivated to believe tha intersection of closed and compact set is compact is true is: See Matt E.'s Answer      So if $K$ is compact in an arbitrary topological space (which is just to say that   it is a compact topological space when given its induced topology) and     $L$ is closed then $K \cap L$ is a closed subset of $K$ in its induced topology   Is it true if $A$ and $B$ are not whole spaces?  I would appreciate any hints. A contractive mapping on $M$ is a function $f$ from the metric space $(M,d)$ into itself satisfying $$d(f(x),f(y))&lt;d(x,y)$$ whenever $x,y\in M$ with $x\ne y$. Prove that if $f$ is a contractive mapping on a compact metric space $M$, there exists a unique point $x\in M$ with $f(x)=x$.   Consider the function $g(x)=d(f(x),x)$. Note that   \begin{align*}d(f(x),x)-d(f(y),y)&amp;\leq (d(x,y)+d(y,f(x))-(d(y,f(x)-d(f(x),f(y)) \\ &amp;=d(x,y)+d(f(x),f(y)) \\ &amp;&lt;2d(x,y)  \end{align*}  And similarly for $d(f(y),y)-d(f(x),x)$, so we have $|d(f(x),x)-d(f(y),y)|&lt;2d(x,y)$. This means $g(x)$ is continuous.  So $g(x)$ is a real-valued continuous function on a compact space, so must be bounded and has a minimum $c$, i.e. there exists $x_0$ such that $d(f(x_0),x_0)$ equals the minimum $c$. What then? Yesterday, I have downloaded and installed Windows 8 Professional, after downloading it (legally) and burning it to a DVD, on my 3-year-old  (Intel Core Duo 2x2.4&nbsp;GHz, 4&nbsp;GB RAM,  hard disk drive).   The installation failed two or three times, each time differently (error codes, for example 0xc000021a, with an infinite boot loop), but finally I completely formatted the hard drive and installed. Seemingly, everything was OK.  However, after booting successfully, the OS is extremely slow. When I open the task manager, it shows that the HDD is at 100% - however, no application or background process or Windows process can be made responsible. I searched the Internet and found that Windows might try to "index" the hard drive, but I did't find a process that isn't also on my second computer, which still uses the Release Preview (restarting every two hours). Also, the startup is empty, and HD Tune and HDD Health show that the drive health is OK, even though I don't know how reliable these two programs are.  I looked for diagnose software from Toshiba, but they only offer tools for "Fujitsu branded Toshiba devices"; I tried it out, and it did not work on my hard drive.  Does this sound like a hard drive failure? The laptop is 3.5-years-old, has been carried around sometimes roughly and was used (and on) most of the time. However, it would have failed exactly the night before installing Windows&nbsp;8 Profesional, which seems - unlikely.  If this is a software error - then what did I do wrong if this occurs from the moment of installation (even the personalization at the end of installation took half an hour)? How can I fix this? “situation where” vs. “situation in which” When articles are placed after adjectives? I couldn't afford that big a car. It was so warm a day that I could hardly work.   The sentences stated above have been taken from Practical English Usage by Michael Swan. If I write-   I couldn't afford that big car. It was so warm day that I could hardly work.   These make sense. But placement of article a makes these sentences awkward to me. Please say why and when articles are placed after adjectives. And what are the differences among 1, 2 and 3, 4. I have a very strange behavior on an Android device (Nexus 7) when trying to access local network applications. Instead of getting the actual IP of the machine on LAN, the Android device gets the public IP, which means that Chrome, Firefox or any other browser simply shows the web page of the router.  I have an internal DNS server which handles the local networks. Doing ping from a PC works correctly:  $ ping s.pelicandd.com  PING pelicandd.com (192.168.1.15) 56(84) bytes of data. 64 bytes from front.pelicandd.com (192.168.1.15): icmp_seq=1 ttl=64 time=0.524 ms 64 bytes from front.pelicandd.com (192.168.1.15): icmp_seq=2 ttl=64 time=0.578 ms ^C   On an HTC One device (accessed with adb shell), it works well too:  shell@m7:/ $ ping s.pelicandd.com  PING pelicandd.com (192.168.1.15) 56(84) bytes of data. 64 bytes from front.pelicandd.com (192.168.1.15): icmp_seq=1 ttl=64 time=2.56 ms 64 bytes from front.pelicandd.com (192.168.1.15): icmp_seq=2 ttl=64 time=27.8 ms ^C   However, this is what I get when doing the same ping from Nexus 7:  shell@flo:/ $ ping s.pelicandd.com  PING pelicandd.com (90.78.26.42) 56(84) bytes of data. 64 bytes from LFbn-1-2441-42.w90-78.abo.wanadoo.fr (90.78.26.42): icmp_seq=1 ttl=64 time=2.56 ms 64 bytes from LFbn-1-2441-42.w90-78.abo.wanadoo.fr (90.78.26.42): icmp_seq=2 ttl=64 time=8.63 ms ^C   Instead of resolving to the internal IP, it resolves to the public one.  The network configuration is—except the IP address of the device—exactly the same on both devices: IP settings are set to Static, and DNS servers are the internal ones. Both Android devices are connected through Wi-Fi (unlike the PC). A major difference, however, is that Nexus 7 is using Android 6.0.1, while HTC One uses Android 5.0.2.  There is no nm-tool, dig or nslookup on Nexus 7. The device is not rooted.  The problem existed since I bought the device a few weeks ago, so it could hardly be the issue with DNS cache.  What can I do to further inspect this issue? Dealing with "Find out who's going to buy the croissants" On Stack Overflow at the moment, there is a popular question which is currently high in the Hot Questions feed:   So far it has been closed twice (once by the community and a moderator and once by a moderator alone) but re-opened twice by the community. It is clearly not a [so] Stack Overflow question. Reading between the lines, there could be a valid Software Engineering question there, but it would be a very basic one (at the fizz-buzz competency level) and looks more like a populist attempt to farm reputation than a serious question.  Worst of all, even though there are some interesting answers on this question, they are all going to be completely useless to future visitors to the site, since they will be completely undiscoverable. If the question were at least "What is the best fair distribution algorithm?" it would still be off-topic (primarily opinion based), but at least it might help someone once the topic falls off the Hot Questions feed.  Although this has turned into just a bit of fun, and I don't want to kill that, enough is enough. While this question is open, unlocked, and still seen as a valid question, it is setting a bad example for the whole Stack Exchange network.   questions like this, especially on the grandfather Stack Exchange site, devalue the work we are putting in on every other site by making it appear acceptable to re-open populist questions like this after two moderators have classified it as off-topic.  What should we do about this question?   Should it be left open? Power to the people? Closed and locked by a moderator? Migrated to another site? &hellip;or something else?