I am trying to install the DNA-Analyzer  but I am running into a few issues. After following the advice in  I got the Promethease executable to run but it looks like the GUI is corrupted. Instead of characters I only see squares.  This is the corresponding output when running Promethease from a terminal:  nuc@nuc:~/Downloads$ sudo ./promethease python version 2.7.3 (default, Sep 26 2013, 20:13:52)  [GCC 4.6.3] using 64bit using frozen  /tmp/_MEIgwdF7c temp is /tmp/tmpAFAjuq I am: 0 terminal_interface loaded can't use mwparserfromhell argv ['/home/nuc/Downloads/promethease'] ui is starting wizard Fontconfig error: "/etc/fonts/conf.d/10-scale-bitmap-fonts.conf", line 70: non-double matrix element Fontconfig error: "/etc/fonts/conf.d/10-scale-bitmap-fonts.conf", line 70: non-double matrix element Fontconfig warning: "/etc/fonts/conf.d/10-scale-bitmap-fonts.conf", line 78: saw unknown, expected number UI logging to /home/nuc/Downloads/promethease.log CWD:  /home/nuc/Downloads Redirecting logging to /home/nuc/Downloads/promethease.log  (promethease:14629): Pango-CRITICAL **: No modules found: No builtin or dynamically loaded modules were found. PangoFc will not work correctly. This probably means there was an error in the creation of:   '/etc/pango/pango.modules' You should create this file by running:   pango-querymodules &gt; '/etc/pango/pango.modules'  (promethease:14629): Pango-WARNING **: failed to choose a font, expect ugly output. engine-type='PangoRenderFc', script='latin'  (promethease:14629): Pango-WARNING **: failed to choose a font, expect ugly output. engine-type='PangoRenderFc', script='common' CWD:  /home/nuc/Downloads logged to /home/nuc/Downloads/promethease.log user interface completed with status=0   How can I fix these issues and get Promethease to work properly?
I want to update Acrobat Reader for Firefox, but the download has the .bin extension. How can I install it?
Knowing the interface of ubuntu and editing them Where are the files for the desktop or the interface that appears on the screen stored? And how can we edit them. How are they programmed?  What programming language is used to built the interfaces? Tikzpicture-figure: Order plot data (asc/desc)? I am using a tikzpicture for plotting. the values I want to plot are typical (X,Y) pairs. The x-value is an uninteresting id-value. I want to order the bins ascending/descending according to the y-value, but how do I do that? The figure seems to automatically take the x-values for ordering, how can I override that? (I am not particularly fixed to tikzpicture - its just the first thing that actually worked and displayed the plot....) Following minimal-working example, how could I achieve a reordering according to the y-value?  \documentclass{article} \usepackage[english]{babel} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage{relsize} \usepackage{times} \usepackage{url} \usepackage{latexsym} \usepackage{graphicx} \usepackage{colortbl} \usepackage{color} \usepackage{caption} \usepackage{pgfplots, pgfplotstable} \usetikzlibrary{arrows} \usepackage{amsmath} \usepackage{multirow} \usepackage{booktabs}  \usepackage{filecontents} \definecolor{OgAns}{rgb}{0, 0.8, 0.4}  \begin{filecontents}{testdata.dat} 1   30 2   44 4   26 3   39 \end{filecontents}  \begin{document} \begin{figure} \begin{tikzpicture}         \begin{axis}[                ybar stacked,             ymin=0,             ymax=100,             bar width=5pt,             legend style={at={(0.35, -0.4)},anchor=south west},             legend columns=-1                       ]           \addplot[ybar,fill=OgAns]  file {testdata.dat};          \end{axis}     \end{tikzpicture} \end{figure}   \end{document} Let $\{a_n\}$ be an unbounded, strictly increasing sequence of positive real numbers and let $x_k=\frac{a_{k+1}-a_{k}}{a_{k+1}}$. Which of the following statements is/are correct? (CSIR NET December 2014)         For all $n\geq m, \sum\limits^{n}_{k=m}x_k&gt;1-\bf{\frac{a_m}{a_n}}$   There exist $n\geq m, \sum\limits^{n}_{k=m}x_k&gt;\frac{1}{2}$      My attempt:  Analysing question in light of $a_k=k\implies x_k=\frac{k+1-k}{k+1}=\frac1{k+1}$, I feel both are correct, I doubt if  I can generalise the result in light of this one example.   Any way to prove that this true for general case?    Note: Please do not confuse  with my question. The first two options are different, I've marked the difference in bold. No feedback when comment fails to post on Android 2.3.5 In the mobile theme on Android 2.3.5, comments that do not meet the minimum length will fail to post but no feedback message is displayed to the user.  The submit button changes to its active state, but nothing else happens. To debug a JACK/Pulseaudio issue, I want to understand when and why the pulseaudio daemon is started by systemd (on Fedora).  Using:  $ ps -o'pid,ppid,args' `pgrep pulse`   I see that the pulseaudio daemon is being started by systemd (pid=1)   PID  PPID COMMAND 2738     1 /usr/bin/pulseaudio --start   However, I was unable to find any unit-file on my system containing pulseaudio or even just pulse.  My specific questions are:  A) Is there a way to determine the systemd unit that caused the creation of a specific process (in my example output, process 2738, the PA daemon)?  B) Are there alternative approaches to find out which unit-dependency chain or other settings of systemd resulted in the invocation of /usr/bin/pulseaudio --start? Let $T$ be a self adjoint operator on a finite dimensional inner product space. And let $4$ and $5$ be the only eigenvalues of $T$. Show $T^2-9T + 20I = 0$ .  proof:Let $T$ be a self adjoint. And let $4 , 5$ be the only eigenvalues of $T$. Then $Tv = 4v, Tv = 5v$ for some $v \neq 0$. Then $Tv = 4v, Tv = 5v$ if and only if $(T-4I)v = 0, (T-5I)v=0$.  Then $ (T-4I) (T-5I)v=0$ implies $(T^2 -5T -4T + 20I^2)v = 0$, implies   $(T^2 -9T + 20I)v = 0$, so we have  $T^2 -9T + 20I = 0  $. Can someone please check this? if it's not correct, could I please have some help on it? Thank you I'm trying to prove that ${n \choose r}$ is equal to ${{n-1} \choose {r-1}}+{{n-1} \choose r}$ when $1\leq r\leq n$.  I suppose I could use the counting rules in probability, perhaps combination= ${{n} \choose {r}}=\frac{n!}{r!(n-r!)}$.  I want to see an actual proof behind this equation.  Does anyone have any ideas? Moving status bar in iOS 7 How to add \part only to TOC? So, I thought I had a good understanding of this, but just ran a test (in response to a conversation where I disagreed with someone) and found that my understanding is flawed...  In as much detail as possible what exactly happens when I execute a file in my shell? What I mean is, if I type: ./somefile some arguments into my shell and press return (and somefile exists in the cwd, and I have read+execute permissions on somefile) then what happens under the hood?  I thought the answer was:   The shell make a syscall to exec, passing the path to somefile The kernel examines somefile and looks at  of the file to determine if it is a format the processor can handle If the magic number indicates that the file is in a format the processor can execute, then   a new process is created (with an entry in the process table) somefile is read/mapped to memory. A stack is created and execution jumps to the entry point of the code of somefile, with ARGV initialized to an array of the parameters (a char**, ["some","arguments"])  If the magic number is a  then exec() spawns a new process as above, but the executable used is the interpreter referenced by the shebang (e.g. /bin/bash or /bin/perl) and somefile is passed to STDIN If the file doesn't have a valid magic number, then an error like "invalid file (bad magic number): Exec format error" occurs   However someone told me that if the file is plain text, then the shell tries to execute the commands (as if I had typed bash somefile). I didn't believe this, but I just tried it, and it was correct. So I clearly have some misconceptions about what actually happens here, and would like to understand the mechanics.  What exactly happens when I execute a file in my shell? (in as much detail is reasonable...) I have an equation like this:     \begin{align}       P(A \cup B) = \sum_{\omega \in A \cup B} P(\omega) = \sum_{\omega \in A} P(\omega) + \sum_{\omega \in B} P(\omega)       = P(A) + P(B)     \end{align}   For some reason, LaTeX is automatically labeling the equation. How do I turn that off? Secondly how do I write something in LaTeX on this site. I tried enclosing in '$' but it doesn't work. Can I disable charging peripherals via USB? I have an external DAC with it's own source of power. However when I connect it to the phone, it drains the phones battery. Is it possible to disable charging via USB on a rooted phone? Or at least slow it down?  My phone is Samsung Galaxy S3, Android 6, CyanogenMod How can I encode and decode percent-encoded strings on the command line? Reviewing suggested edit of own post after completing 20 reviews I've completed 20 suggested edits reviews today. Then, I came across a  and I approved it.   Then, I had a doubt that whether the review count has incremented or not, oh! it's not incrementing. System works fine.  But, take a look at review page,     The edit was already reviewed by one reviewer and then I reviewed it. As I'm the Owner of the post it's enough to approve the edit. But, the review history doesn't show the detail that I had approved it. It's misleading that only one vote of a reviewer who is neither the community user nor the OP nor the moderator, is enough.  So, what should we do in this type of situation?  Is it correct to make OP to review the suggested edit after completing daily limit?  Should we need to display/hide the OP has approved the edit in the review history? Predict probabilities from Firth logistic regression in R I'm using the logistf package in R to perform Firth logistic regression on an unbalanced dataset. I have a logistf object:  fit = logistf(a~b)   Is there a predict() function like on that's used in the lm class to predict probabilities for future data points? Or do I have to manually input the estimated parameters from the Firth regression. Prove that the additive group $ℚ$ is not isomorphic with the multiplicative group $ℚ^*$. Prove that $ℚ^*_{&gt;0}$ is not isomorphic with $ℚ$. I have to give low and high bounds for the following:  $$ \sum_{n=1}^\infty \frac{1}{2^n - 3^n } $$  How do I determine an upper bound? How can I show this sum exists?  edit: removed erroneous conclusion. Libraries module. Where to extract? How can I install more recent versions of software than what Debian provides? How to handle :java.util.concurrent.TimeoutException: android.os.BinderProxy.finalize() timed out after 10 seconds errors?