I installed winamp 5.6 under wine in ubuntu. Now I have a winamp icon in the desktop, winamp menu entries under the wine menu in the "Application" menu, but worse of all: in nautilus some files (*.mp3 files) are associated with winamp.  This seems to be because ubuntu is trying to "better integrate wine". Here are some specs which all seem to be outdated:         How can I disable this integration?   File associations should never be set outside of wine. Menu entries should never be created outside of wine. Icons should never be created outside of wine. Basically what goes in wine should stay in wine.   Using ubuntu lucid.


Put a meta link for the current site in the Android app's side bar

Currently, the only way I know of to visit a site's meta via the Android app (1.0.16) is to pin its meta to my sites in the sidebar. It's a really good thing I can do this for the metas I visit frequently, and I don't want to see it go, but it's also inconvenient if it's the only way to reach a meta.  Could we have a sidebar item that takes us to the meta site for whatever SE site we currently have open? (Or, if we're already in their meta, to their main site)  To illustrate my point, here's a before & after:


I am trying to understand a piece of code here and as I am not an expert on bash, I am struggling to find out what the below if does:   if [[ "$4" == *"-a "* ]]; then  I understand the $4 is the fourth parameter, but I am not getting the rest... Why the condition is between *? Thank you folks, appreciate any help. Regards, Thiago


What is the number of invertible $n\times n$ matrices in $\operatorname{GL}_n(F)$?

$F$ is a finite field of order $q$. What is the size of $\operatorname{GL}_n(F)$ ?  I am reading Dummit and Foote "Abstract Algebra".  The following formula is given:  $(q^n - 1)(q^n - q)\cdots(q^n - q^{n-1})$.  The case for $n = 1$ is trivial.  I understand that for $n = 2$  the first row of the matrix can be any ordered pair of field elements except for $0,0$. and the second row can be any ordered pair of field elements that is not a multiple of the first row.  So for $n = 2$  there are $(q^n - 1)(q^n - q)$ invertible matrices.  For $n\geq 3$, I cannot seem to understand why  the formula works.  I have looked at Sloane's OEIS A002884.  I have also constructed and stared at a list of all $168$ $3\times 3$ invertible matrices over $GF(2)$.  I would most appreciate a concrete and detailed explanation of how say $(2^3 - 1)(2^3 - 2)(2^3 - 2^2)$ counts these $168$ matrices.


How to draw straight line in a tikz diagram?

I need to draw line from my central node to every other node. I know how to draw from point to point:           \draw[darkblue2, thick](virt-manager)--(libVIRT);   I know also that I can specify where the draw goes out/in with:  \draw[darkblue2, thick][out=270](virt-manager)to[in=110];   But the draw are rounded and that's not what I want. Here is the code, in black this is what I need:  \documentclass{article} \usepackage[margin=2.5cm]{geometry} \usepackage{tikz} \usetikzlibrary{arrows.meta,                 backgrounds, bending,                 calc, chains,                 %decorations.pathmorphing,                 fit,                 %petri,                 positioning,                 quotes,                 shapes.misc}  \definecolor{darkblue}{RGB}{31,22,70} \definecolor{darkblue2}{RGB}{21,126,251} \usepackage{graphicx} \usepackage{float} \begin{document}   \begin{figure}[H]   \centering      \begin{tikzpicture}[     mynode/.style={fill=#1,minimum height=1cm,minimum width=5cm,rounded corners,                    draw=white,very thick,font=\sffamily\color{white}},     mynode/.default=gray!20]         \node[mynode=darkblue!50] (libVIRT)at (b) {libVIRT};         \node[above  = of libVIRT,mynode=darkblue!20, minimum width = 2cm] (OpenStack) {OpenStack};         \node[left = of OpenStack,mynode=darkblue!20, minimum width = 2cm] (virsh) {virsh};         \node[left = of virsh,mynode=darkblue!20, minimum width = 2cm] (virt-manager) {virt-manager};         \node[right =of OpenStack,mynode=darkblue!20, minimum width = 2cm] (oVirt) {oVirt};         \node[right =of oVirt,mynode=darkblue!20, minimum width = 2cm] (else) {autres};          \node[below = of libVIRT,mynode=darkblue!80, minimum width = 2cm] (kvm) {kvm};         \node[left =of kvm,mynode=darkblue!80, minimum width = 2cm] (ESX) {ESX};         \node[left =of ESX,mynode=darkblue!80, minimum width = 2cm] (LXC) {LXC};         \node[right =of kvm,mynode=darkblue!80, minimum width = 2cm] (Xen) {Xen};         \node[right =of Xen,mynode=darkblue!80, minimum width = 2cm] (autres) {autres};          \draw[darkblue2, thick][out=270](virt-manager)to[in=110](libVIRT);      \end{tikzpicture}        \caption{blabla} \end{figure}       \end{document}


Can a creature target itself with an effect that sacrifices itself?

The card  lets you sacrifice it to remove all counters from target permanent. Can it target itself with this effect?   I know a creature can target itself unless it says otherwise (), but I do not know how a card that sacrifices itself would work.


Derived sets - prove $(A \cup B)' = A' \cup B'$

I'm trying to prove $(A \cup B)' = A' \cup B'$ where $S'$ denotes the derived set of some subset $S$ of a topological space $X$.  A derived set $S'$ of a set $S$ is the set of $x \in X$ such that $x$ is in the closure of $S-\{x\}$.  I'm having troubling showing that $(A \cup B)' \subseteq A' \cup B'$.   What I've done so far: Suppose $x \in (A \cup B)'$.  Then for any neighborhood $U$ of $x$ it follows that $U$ intersects $(A \cup B)-\{x\}$ so $U$ intersects $A-\{x\}$ or $B-\{x\}$.  But I don't see why we couldn't have one neighborhood of $x$, $U_{1}$, which intersects $A-\{x\}$ but not $B-\{x\}$ and another neighborhood $U_{2}$ which does the opposite.  In this case $x$ would be in neither $A'$ nor $B'$.  We can say that $U_{1} \cap U_{2}$ is not only $\{x\}$ because then $\{x\}$ would be open contradicting $x \in (A \cup B)'$.


showing a collection of sets contain all closed sets

Let $X$ be infinite set and $a \in X $. Let $$\mathscr{F} = \{ A \subset X: |A| \; \; finite \; \;, a \notin A \}$$  Then $\mathscr{F}$ is the set all of all closed sets for some topology $\mathcal{T} $ on $X$. Also, any two continuous maps $f,g: (X, \mathscr{T}) \to Y$ ( $Y$ is metric space) have the property that if $f(b) = g(b)$ for all $b \neq a $, then $f(a) = g(a)$.  In my notes my professor posted this theorem without proof, so I was wondering what is best way to proof this theorem.


Fighter (Eldritch Knight)/Wizard multiclass spell known

I'm about to start a campaign and I wish to play an Eldritch Knight/Wizard multiclass. I've read the chapter 6 part for spellcasting:     You determine    what spells you know and can    prepare for each class   individually, as if you were a   single-classed m em ber of    that class. If you are a ranger   4/w izard 3, for example,    you know three 1st-level ranger   spells based on your    levels in the ranger class.   Now, since in that peculiar case the spells are from the same spellcasting class (the wizard), can I learn spells of higher level, for which I have spell slots, even if my single class level could not permit it? For example: if I'm an EK-7/Wizard-3 (so with 4th level spell slots) can I learn 4th level spells?


What does Kousei mean by not being able to hear the piano?

In Your Lie in April, what does Kousei mean by not being able to hear the piano? I play the piano and the more I play, I tend to just look at my hands while it's moving and I can't hear anything except for the noise in the background. It's like the sound is fading away as I play longer. Sometimes I have to focus real hard just to make out the sound of the piano. Is this what Kousei means?


Sugar daddy wants full name and email address?

Please help! I’m new to the sugar daddy world and he’s willing to pay me through email by sending me a check? He’s asking for me to provide my full name and email address. Is this fraud or no?


How do I edit metadata in QGIS?   I found the plugin Metatools which is experimental and did not work for me.  In Metatools I always get the information      ...unsupported metadata standard! Only ISO19115 supported now!   I then exported the metadata of the shapefile to xml with the same name as the shapefile, expecting to get the metadata in ISO standard but that is still not working.  My System: Linux Mint 17; QGIS 2.6.0 Brighton; Metatool 0.3.0


I'm hoping someone out there might be able to help or suggest some tests to try and resolve some very odd QGIS behaviour of late...  Our core GIS team of 4 users has been testing v2.10 prior to roll-out for the remainder of the organization.  In the past couple of weeks we have had some very odd shapefile corruption things happening and are yet to isolate or identify a potential cause...  These have included:   Editing one line (using the scissor tool to split into two records) and having the resulting records attributes completely replaced by attributes from another geometry no-where near the edited row (spatially or in the attribute dbf) Line geometries completely disappear while their attributes get associated with an unrelated geometry  Line geometry get partially deleted and replaced with a vertice in infinity (line visually extends beyond the dataset and no matter how far zoomed out you never see the end)   The above is happening in a polyline layer, that we did discover has some multi-line geometries..? Perhaps this is impacting... but never saw this issue with v2.8 and the same layer. The layer has undergone MANY save-as's in the past week and many verify geometry checks as we thought invalid geometry may have been the cause...  In another separate layer yesterday, to a separate user (me) i created a layer with approx 30 polygons... adding, deleting some and doing some 'avoid intersection' to remove overlaps. Layer looks fine in qgis, saved and also a save-as to a completely new file but when i load into ArcGIS online (and later is ArcMap as a test) some of the overlaps and deleted objects are still there. Close and reopen qgis,  reopen the file and they are definitely not.  The project was created in v2.8 that i was editing in (but had been saved in 2.10).  Does anyone have any ideas/suggestions.  We do still have 2.8 installed as well as 2.10? We have never encountered issues like this when testing other new qgis versions while still running old ones?


How do I display the absolute file (or directory) path in the UI

I've seen a number of answers on here and other places that if I have a file path in Blender, I can use bpy.path.abspath(file_path) and get the absolute path to a file or directory. My problem is that I have a StringProperty with subtype = 'DIR_PATH' set and I'm having problems with what it displays:  The path is set to /User/<my_name>/Documents/Dev/3DGraphics/3DExperiments, however notice only two slashes show. The StringProperty is showing a path relative to the current file in Blender. When I select another directory, it still gives me a relative path. I'm using this structure: class BluePrinterData(bpy.types.PropertyGroup):     status: bpy.props.StringProperty(         name="status",         default="Waiting for Cameras to be Added"         )     project_name: bpy.props.StringProperty(         name="project_name"         )     save_directory: bpy.props.StringProperty(         name = "",         description = "Output Directory",         default = '',         maxlen = 1024,         subtype = 'DIR_PATH'         )     file_format: bpy.props.EnumProperty(         name = 'File Output Format',         description = 'File format for saving images',         items = {('png', 'PNG', 'Save as PNG'),                  ('pdf', 'PDF', 'Save as PDF'),                  ('bmp', 'BMP', 'Save as BMP'),                  ('tiff', 'TIFF', 'Save as TIFF')},         default = 'png'         )  Note the 3rd property down, save_directory, is the one I'm talking about and I've set the subtype as needed. I've tried adding an if statement to change the path to absolute if it isn't, but that doesn't make a difference. The one thing I'm trying to do here is make sure that instead of seeing the relative path in the StringProperty, I see the absolute path. I've looked over API docs, but I can't find what I have to change to display an absolute path. (Again, please note I know when I need that absolute path in Python, I can convert - but I can't find a way to convert what the StringProperty with the subtype = 'DIR_PATH' to show the absolute path.)


Why is the set of physically acceptable solutions to the time-independent Schrodinger equation discrete?

The time-independent Schrodinger equation for a particle moving along the x-axis is: $$H\psi (x) + V(x) \psi (x) = E \psi(x)$$  I know that the physically acceptable solutions to this equation can only be found for a specific value of E (so there are $n$ solutions for each $E_1$, $E_2$, ... , $E_n$). Why in general (I am aware that this is the case for the infinite square well for example), mathematically, is that the case?


Topology: Proof that a finitely generated cone is closed

Looking for the proof of the lemma asserting that the conical surface (envelope) is a closed space. Thank you.


Is it possible to change the lengths of bike cranks?

ive had debilitating arthritis since I was five and whilst I was younger I enjoyed riding a bike. Unfortunately due to degradation of my hip and lower back joints I am unable to use bikes with long cranks as my hips and back don't allow for the upwards movement.  There is some rotation and upward movement within my hips and back still - I'm able to climb stairs just about for instance.  As I say, would it be possible to adjust the crank length? Would this need to be specialist or would my local second hand dealer be able to do this?  Any help would be greatly appreciated!  Thanks


Show that $F+G$ is closed when $G$ a closed subspace of normed space $E$ and $F$ a finite dimensional subspace of $E$.

Question: Let $E$ be a normed space. Let $G$ be a closed subspace of $E$ and let $F$ be a finite dimensional subspace of $E$. Show that $F+G$ is a subspace of $E$ and is closed.  I'm having trouble in showing $F+G$ to be closed. I know that $F$ is itself closed and complete, as it is a finite dimensional subspace of a normed space, and that if $F$ were compact that $G+F$ would be closed. I also know that the closed unit ball of any finite dimensional normed space is compact.  I tried two methods. One was to take a convergent sequence $(x_n)_{n \in \mathbb N}$ in $G+F$. Then we can write $x_n = f_n + g_n$ where $f_n$ and $g_n$ are sequences in $F$ and $G$ respectively, and I attempted to find a way to force the individual components $f_n$ and $g_n$ inside the unit ball which would enable me to say that they had convergent subsequences. I couldn't see how to do this, however.   The other thought was to try and show that $F$ is compact, but I don't see a way to do this as I can't imagine it to be simply true without some other conditions on $F$.  Are one of these methods the right way to go? Or should I go another direction? I would appreciate any help I can get, although I would prefer not to be presented with a full proof so that I can do some work for myself. Thanks!


Absolute continuity of distributions --- why do we need this?

Why do we define continuous probability distribution as those with absolutely continuous CDF, instead of just continuous CDF?


Database general error: 2006 MySQL server has gone away

Recently I started getting an error every time I try and add a content no matter what type.  This is the error that shows up in the browser:     Additional uncaught exception thrown while handling exception.        Original   PDOException: SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: SELECT COUNT(cid) FROM {comment} WHERE status = :status; Array ( [:status] => 0 ) in comment_count_unpublished() (line 313 of /Applications/MAMP/htdocs/modules/comment/comment.module).        Additional      PDOException: SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: INSERT INTO {watchdog} (uid, type, message, variables, severity, link, location, referer, hostname, timestamp) VALUES (:db_insert_placeholder_0, :db_insert_placeholder_1, :db_insert_placeholder_2, :db_insert_placeholder_3, :db_insert_placeholder_4, :db_insert_placeholder_5, :db_insert_placeholder_6, :db_insert_placeholder_7, :db_insert_placeholder_8, :db_insert_placeholder_9); Array ( [:db_insert_placeholder_0] => 1 [:db_insert_placeholder_1] => php [:db_insert_placeholder_2] => %type: !message in %function (line %line of %file). [:db_insert_placeholder_3] => a:6:{s:5:"%type";s:12:"PDOException";s:8:"!message";s:154:"SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: SELECT COUNT(cid) FROM {comment} WHERE status = :status; Array ( [:status] =&gt; 0 ) ";s:9:"%function";s:27:"comment_count_unpublished()";s:5:"%file";s:56:"/Applications/MAMP/htdocs/modules/comment/comment.module";s:5:"%line";i:313;s:14:"severity_level";i:3;} [:db_insert_placeholder_4] => 3 [:db_insert_placeholder_5] => [:db_insert_placeholder_6] => ; [:db_insert_placeholder_7] =>  [:db_insert_placeholder_8] => 127.0.0.1 [:db_insert_placeholder_9] => 1338336955 ) in dblog_watchdog() (line 154 of /Applications/MAMP/htdocs/modules/dblog/dblog.module).   I also get the following error in my php error file:     PHP Fatal error:  Uncaught exception 'PDOException' with message 'SQLSTATE[HY000]: General error: 2006 MySQL server has gone away' in /Applications/MAMP/htdocs/includes/database/database.inc:2136        Stack trace:   0 /Applications/MAMP/htdocs/includes/database/database.inc(2136): PDOStatement->execute(Array)   1 /Applications/MAMP/htdocs/includes/database/database.inc(664): DatabaseStatementBase->execute(Array, Array)   2 /Applications/MAMP/htdocs/includes/database/database.inc(2315): DatabaseConnection->query('SELECT expire, ...', Array, Array)   3 /Applications/MAMP/htdocs/includes/lock.inc(167): db_query('SELECT expire, ...', Array)   4 /Applications/MAMP/htdocs/includes/lock.inc(146): lock_may_be_available('theme_registry:...')   5 /Applications/MAMP/htdocs/includes/theme.inc(447): lock_acquire('theme_registry:...')   6 /Applications/MAMP/htdocs/includes/bootstrap.inc(427): ThemeRegistry->set(Array)   7 [internal function]: DrupalCacheArray->__destruct()   8 {main}         thrown in /Applications/MAMP/htdocs/includes/database/database.inc on line 2136   I am having a little trouble deciphering these error messages. Could anyone help me understand what's going on here?


Can I deal combat damage with a 1/1 Walking Ballista and deal damage with its ability?

Rules Question:     Player A attack with 1/2 creature Player B block with  with 1 +1/+1 counter And now can player B use Walking Ballista activation ability, after combat damage but before it go to graveyard, to kill 1/2 creature?


I used the following template for my CV :. I can build it on Overleaf, but not with Textworks. I've specified to use Xelatex as compiler.  This is the output that I get with Textworks:  ! LaTeX3 Error: Command '\FA' already defined!  For immediate help type H <return>.       ...                                                    l.166 \newfontfamily                         \headerfont[     ? H      You have used \NewDocumentCommand with a command that already has a     definition.      The existing definition of '\FA' will not be altered.      ?    And here is the log file : . Can someone help me? Thanks for the help,  Warok


How to make an indicator to run various commands?

How would I go about making an indicator for the panel on Unity?  I want a button that shows a menu and when you click on the menu items they run commands.    How do I do this?


Given G is a cyclic group of order $9$,Question asks to find the number of non-isomorphic subgroups of $G$.I am literally confused what exactly ask in question.Are they asking for the number of subgroups of $G$ which are non-isomorphic to $G$.Then since $G$ has exactly three subgroups of order $1,3,9$.Then subgroups of order $1,3$ must be non-isomorphic to $G$.So, I think answer is $2$.I have seen one related question asked on site and there it was given cyclic group of order $12$ and same question was asked.The answer given for that question says there are $6$ such subgroups but I got confused since $G$ is of course isomorphic to itself so remaining $5$ are non-isomorphic to $G$.Am I understanding question wrongly?


how to i generate random numbers within the user range?

Im making a program to take the user input which stands for how many numbers they want, and i have to show as many random numbers as they say. heres the little part i have so far:  if(selection==3) {     System.out.print("How many numbers would you like to see?");     int ran=kb.nextInt();  }   (theres more code but i just cant figure out how to di this part. any help? thank you :)


What's the difference between package managers?

What are the differences between apt-get, aptitude, and synaptic, and which one is the recommended choice for normal day-to-day package management?  This is a basic question, but I think it'd be good information to have on the site, and besides I am relatively new to Ubuntu so I could use an expert explanation.


The values of $$I=\int_{0}^{1} {x^4} ({1-x})^4\dfrac1{1+x^2}dx$$ My Failed Attempt   I tried applying F(x)  =F(a+b-x)  in hopes the denominator will cancel out but it's not. I tried to further simplify the expression but with no luck   $$I=\int_{0}^{1} {x^4} ({1-x})^4\dfrac1{1+({1-x})^2}dx$$  Adding both integral isn't helping me much


Let $(\Omega,\mathcal{F},(\mathcal{F_n})_n,P)$ be a filtered probability space, $p \in (1,\infty)$, and $M_n$ an $\mathcal{F_n}$ martingale uniformly bounded in $L^p$.  I used this fact to show that $(M_n)_n$ is uniformly integrable and that it converges in $L^1$ to some integrable $M_{\infty}$ and $(M_n)_{\mathbb{N} \cup \infty}$ is a martingale.  How can I show that $|M_n-M_\infty|^p$ is uniformly integrable which will imply $M_n \to M_\infty$ in $L^p$?


Fan prob with toString() method -- Simple

I am trying to create a program where you can change a fans speed, color, radius, and whether you can turn the fan on or off, I have the fan class working fine, except for the toString() method, for some reason when I set some values in the test program, it just defaults to the regular values, any help is accepted.  Thank you.  public class Fan { final int SLOW = 1; final int MEDIUM = 2; final int FAST = 3;  public int speed = SLOW; public boolean on = false; public double radius = 5; public String color = new String("blue"); //fan on boolean fanOn() {    on = true;    return on; } //fan off boolean fanOff() {    on = false;    return on; } //sets fan speed String setSpeed(String speed) { if (speed == "SLOW"){    speed = String.valueOf(SLOW); } else if (speed == "MEDIUM") {    speed = String.valueOf(MEDIUM); } else if (speed == "FAST") {    speed = String.valueOf(FAST); } else {    speed = "Please enter 'SLOW', 'MEDIUM' or 'FAST' to change the speed of the fan."; }    return speed; } //sets custom radius double setRadius(double rad) {    rad = radius;    return rad; } //sets custom color String setColor(String colorType) {    return colorType; } //toString() method public String toString() {    return ("Speed: " + speed + "\nRadius: " + radius + "\nColor: " + "\nOn: " + on);  } }  //test program   public class TestFan {  public static void main(String[] args) {    Fan fan1 = new Fan();    fan1.setColor("green");    fan1.setSpeed("FAST");    fan1.setRadius(3.5);    fan1.fanOff();    System.out.println(fan1.toString());   } }   This just outputs:  Speed: 1 Radius: 5.0 Color:  On: false


If evolution is true, how do all organisms have varying amount of chromosomes?

I thought genetic mutation changes genes and therefore evolution happens, but it doesn't explain how  chromosomes are created/removed if the first organism had a set amount and now all the organisms have different numbers of chromosomes. How does this happen?


The following  (links to pdf) in the  has no provided source. The book  by Ash and Gross seems to use a similar style. Where can I find hints for typesetting publication standard articles/books as above in TeX. I looked around a bit but couldnt find much from else from keyword searches.  Particularly, I am looking at the chapter headings, title page design, and the mirror effect. Sorry for the title, as I dont really know what its called.


Is there a way to block all normal ftp traffic, and only allow the sftp protocol in sftp?  edit:  sorry my bad!  for secure ftp i must use the ftpes protocol...


Let $G$ be a group and $a,b\in G$. Suppose that $$a^{-1}b^2a=b^3$$ and $$b^{-1}a^2b=a^3$$ Show that $a=b=1$.  If we can show that $a=b$, then from the two relations clearly $a=b=1$. I observe that each relation can be rewritten as $[a^{-1},b^2]=b$ and $[b^{-1},a^2]=a$. Also they can be written as $(a^{-1}ba)^2=b^3$ and $(b^{-1}ab)^2=a^3$.    I need some guidance to solve this kind of problem. I did some guess but they did not lead to the result.


How can I strikeout words in math mode (similar to \sout with \usepackage{ulem} in text mode)? I've tried \usepackage{cancel} and \(\cancel{1+1=2}\) but that draws a diagonal line.


How can I proof this:     Show that no application $f: \mathbb{R}^2 \rightarrow \mathbb{R}$, of $C^k$ class, $k \geq 1$ can be injective, i.e., there are $A,B \in \mathbb{R}^2$ such that $A \neq B$ and $f(A) = f(B)$ (Hint: show that given $(a,b) \in \mathbb{R}^2$ in every open neighbourhood of $(a,b)$ there are points $(c,d),(c_1,d_1)$ where ${\partial}_1f(c,d) \neq 0$ or ${\partial}_1f(c_1,d_1) \neq 0$).   The problem is that I have no idea how to use the hint.  Thanks for all your comments.


Word for two collections that do not have any elements in common

I'm looking for a word for when you have a collection A and a collection B and they have no overlap.  In mathematical terms: the relation between two sets where the intersection is empty. Like in this Venn diagram:    The word that keeps popping up in my mind is disparate sets, but I don't feel that completely covers the meaning when I look at the definition, because that doesn't seem to preclude overlapping sets that are different:     disparate   1. distinct in kind; essentially different; dissimilar:   disparate ideas.


Adding a class to an ArrayList, but got NullPointerException

So, I was trying to add a class to an ArrayList, but when I do it gives me a Null Pointer Exception. I'm sure I am just overlooking a variable that I thought was initialized, but I can't figure it out.   This is the class:  enum WebType { GoogleResult, Webpage }; public class Webpage {  WebType type;  String pageName; String content; String url; String MLA = "";  public Webpage(String pageName, String content, String url, WebType type){     this.type = type;     this.pageName = pageName;     this.content = content;     this.url = url;     this.MLA = ""; // Temp }  // TODO: Make Citation Maker   }  This is where I add the class to the ArrayList:      public void Start(){     for(Integer i = 0; i < tags.size(); i++){         if(tags.get(i) == null)             return;         Webpage page = Google(tags.get(i));         parseList.add(page); // The Error is on this line!         log.append("Added " + page.url + " to parse list");     }     for(Integer i = 0; i < parseList.size(); i++){         ParsePageCode(parseList.get(i));     } }   Here is the Google function, it googles whatever you tell it to and returns the page information:      public Webpage Google(String search){     String url = "https://www.google.com/search?q=" + search;     String content = "";     try {         URLEncoder.encode(url, "UTF-8");     } catch (UnsupportedEncodingException e) {         log.append("\n Unsupported Encoding Contacting Google");     }     try {         content = GetPageCode(url);     } catch (IOException e) {         log.append("\n Unable To Reach Google");         log.append(e.getMessage());     }     Webpage w = new Webpage("Google Result For " + search, content, url, WebType.GoogleResult);     // System.out.println(search + url + WebType.GoogleResult);     return w; }   Any Ideas?


I get this problem every time I try and get wine 1.6 on Ubuntu 12.04. I have no idea how to fix it!  It just says:  The following packages have unmet dependencies:  wine1.6 : Depends: libgettextpo0 but it is not installable            Depends: wine1.6-i386 (= 1.7.1-actually1.6-0ubuntu1)            Depends: binfmt-support (>= 1.1.2) but it is not installable            Recommends: gnome-exe-thumbnailer but it is not going to be installed or                        kde-runtime but it is not going to be installed            Recommends: fonts-droid but it is not installable            Recommends: ttf-mscorefonts-installer but it is not installable            Recommends: fonts-horai-umefont but it is not installable            Recommends: fonts-unfonts-core but it is not installable            Recommends: winbind but it is not going to be installed            Recommends: winetricks but it is not going to be installed E: Unable to correct problems, you have held broken packages.


How to advance lab assistants to researchers?

I can't find a list of needs for lab assistants. I gave them everything (they have carbon to upgrade). What else am I missing? I read researched on the internet and couldn't find a solution.


I am unable to install anything including updates!

Whenever I try and install anything including system updates I get this error: The following packages have unmet dependencies:  gstreamer1.0-plugins-bad : Depends: libgstreamer-plugins-bad1.0-0 (= 1.16.2-2.1+b1) but 1.14.5-0ubuntu1~18.04.1 is installed                             Depends: libgstreamer-plugins-base1.0-0 (>= 1.16.2) but 1.14.5-0ubuntu1~18.04.1 is installed  gstreamer1.0-plugins-good : Depends: libgstreamer-plugins-base1.0-0 (>= 1.16.2) but 1.14.5-0ubuntu1~18.04.1 is installed  gstreamer1.0-plugins-good:i386 : Depends: libgstreamer-plugins-base1.0-0:i386 (>= 1.16.2) but 1.14.5-0ubuntu1~18.04.1 is installed  gstreamer1.0-x : Depends: libgstreamer-plugins-base1.0-0 (>= 1.16.2) but 1.14.5-0ubuntu1~18.04.1 is installed  gstreamer1.0-x:i386 : Depends: libgstreamer-plugins-base1.0-0:i386 (>= 1.16.2) but 1.14.5-0ubuntu1~18.04.1 is installed  and whenever I run apt --fix-broken install this will appear: Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... failed. The following packages have unmet dependencies:  gstreamer1.0-plugins-bad : Depends: libgstreamer-plugins-bad1.0-0 (= 1.16.2-2.1+b1) but 1.14.5-0ubuntu1~18.04.1 is installed                             Depends: libgstreamer-plugins-base1.0-0 (>= 1.16.2) but 1.14.5-0ubuntu1~18.04.1 is installed  gstreamer1.0-plugins-good : Depends: libgstreamer-plugins-base1.0-0 (>= 1.16.2) but 1.14.5-0ubuntu1~18.04.1 is installed  gstreamer1.0-plugins-good:i386 : Depends: libgstreamer-plugins-base1.0-0:i386 (>= 1.16.2) but 1.14.5-0ubuntu1~18.04.1 is installed  gstreamer1.0-x : Depends: libgstreamer-plugins-base1.0-0 (>= 1.16.2) but 1.14.5-0ubuntu1~18.04.1 is installed  gstreamer1.0-x:i386 : Depends: libgstreamer-plugins-base1.0-0:i386 (>= 1.16.2) but 1.14.5-0ubuntu1~18.04.1 is installed E: Error, pkgProblemResolver::Resolve generated breaks, this may be caused by held packages. E: Unable to correct dependencies   I also can't open any system apps like system setting system updater and most of my other software besides google and terminal and wireshark. I've run apt-cache policy gstreamer1.0-plugins-bad and I ended up getting this: $ apt-cache policy gstreamer1.0-plugins-bad gstreamer1.0-plugins-bad:   Installed: 1.16.2-2.1+b1   Candidate: 1.18.0-2+b1   Version table:      1.18.0-2+b1 500         500 http://http.kali.org/kali kali-rolling/main amd64 Packages  *** 1.16.2-2.1+b1 100         100 /var/lib/dpkg/status      1.14.5-0ubuntu1~18.04.1 500         500 http://archive.ubuntu.com/ubuntu bionic-updates/universe amd64 Packages      1.14.0-1ubuntu1 500         500 http://archive.ubuntu.com/ubuntu bionic/universe amd64 Packages


Can an adult be killed using the Death Note, by remembering their childhood face while writing the name?

To kill a person using the Death Note, you are required to think of their face while writing their name.   If the Death Note user last saw a person decades ago when he was a child, but has no idea what he looks like now, can he kill the person by remembering the childhood face?


With the code below, baz is nested in bar. What I'd like to do is break this nesting, in other word make it look like a section as if there were no preceding chapters.   \documentclass{scrreprt}  \begin{document}  \tableofcontents  \chapter{foo}  \chapter{bar}  % Sectioning break where  % Everything that follows % belongs to the document, not nested in preceding chapters  \section{baz}  \end{document}


Complexity of finite group isomorphism problem

Consider the next decision problem: Given two finite groups represented by their multiplicity table, determine if they are isomorphic or not. Clearly, this problem belongs to NP since given a witness in the form of an isomorphism between the groups it can be verified in polynomial time (to the input size). But what more can be said about this problem in terms of complexity?


Here is the expression $$\sum_{k=0}^n\frac{1}{2^{k}}\binom{n+k}{n} = 2^{n}$$ How to go about proving this? I tried expanding the expression and it seems that $n+1$ must be even. But it isn't helping much. Can someone please help? Can this be proved using generating functions or combinatorics?


I want to create a list like toc, lof, lot. Is should be called listofsongs or similar. The question is: Is there any package which allows me to create similar lists or do I have to do this all by myself?  Is there a list of already used file extensions in LaTeX? i.e. I shouldnt use MyDocument.toc because this would cause conflicts with tableofcontents.  In the end, I should be able to write \listofsongs like I write \tableofcontents and it should behave similar.


Why do (ACH) payments that withdraw or deposit on my bank account require 1+ business days to complete?

Based on , I figured that there might be multiple questions for distinct locales. Why do the most common transactions to or from bank accounts in the US require waiting one or more days before they are completed? In the information age, it seems like we should be able to transfer money instantly (or nearly so).


Calculate nearest age by birth date in c#

I want to calculate the age based on birth date and it should rounded to the nearest  i.e. 19/03/1988 would be resultant into 26 and 19/09/1988 to 25.  Below is the current implementation.  var ts = DateTime.Now - dtBirthdate; var age = ts.Days / 365;


I created a navbar in my header and aligned it with another element so that they were centered. However, after adding an image to the header, one of the elements is no longer centered:    #header nav {   display: inline; } #header {   background: #5D6D63;   padding: 28px 0 26px;   position: fixed;   top: 0;   left: 0;   z-index: 1000;   width: 100%; } #header nav ul {   float: right;   margin: 0px;   margin-right: 100px; } li {   list-style-type: none;   float: left;   margin-left: 46px; } a[href^="#"] {   color: #fff;   font-size: 20px;   font-weight: bold;   letter-spacing: -1px;   text-decoration: none } a[href="#top"] {   margin-left: 100px; }    Name

Link 1

Link 2

Link 3

         The issue is the vertical alignment of the Name anchor tag. It should be centered with the the github image and the navbar. If I remove the github image, it works fine and it is aligned. Why is the github image causing the Name anchor tag to be pushed down a few pixels?  Here are pictures to show it misaligned (with image) and aligned (without image)


At a movie theatre, $m+n$ people stand in line to buy tickets. The ticket price is \$5. Suppose $m\geq n$, and $m$ of those people only has \$5 bills and the remaining $n$ people only has \$10 bills. At the beginning, no change is available at the ticket counter. It is desirable to arrange the order of these $m+n$ people in the line so that nobody needs to wait for change when buying the ticket, or exchange bills among each other. In how many ways can this be done?  Sorry for the lack of mathjax and the simplicity of this problem because I am just learning combinatorics.


I have been getting following error while running  sudo apt-get update  W: GPG error: https://download.01.org trusty InRelease: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY A902DDA375E52366 E: Encountered a section with no Package: header E: Problem with MergeList /var/lib/apt/lists/security.ubuntu.com_ubuntu_dists_trusty-security_main_i18n_Translation-en E: The package lists or status file could not be parsed or opened.   What should I do to fix this problem?    Also sometimes I get a red icon in the Task Bar pane.


I stumbled upon "the God proof" which goes:  $0 = 0 + 0 + 0...$  $  = (1-1) + (1-1) + (1-1) + ...$  $= 1 - 1 + 1 - 1 + 1 - 1 + ...$   $= 1 + (-1+1) + (-1+1) + (-1+1) + ...$   $= 1$  Even though this result is obviously wrong, I can't quite pinpoint exactly what the 'illegal' operation here is? I know that it's possible to make a conditionally convergent infinite series converge to any value, so that can't be the issue (?).  It makes me think there's something dangerous about representing numbers by infinite series that aren't absolutely convergent, but I haven't been able to find something that specifically addresses this, if someone could tell me where to look for more information, I'd be grateful.  [background: undergrad student]


Aligning the image inside the text to fit the text

How can we position the coin so that it fits the text? So far as you see the coin is a bit upper than the median line of the text.    .coins_plans {    font-size: 1rem;     margin-top: 0;     margin-bottom: 30px;     text-align: center; }  .coins_plans img {  width: 30px;  height: 30px; }
all  s you got till now.
     Here is what I want:


If $f: \mathbb R^2 \rightarrow \mathbb R$ is a continuous function such that $f(x)=0$ for only finitely many values of $x$, then prove/disprove the following :   $(a)$ Either $f(x) \geq 0 ~~\forall x\in  \mathbb R^2  $ or $f(x) \leq 0 ~~\forall x\in  \mathbb R^2  $  $(b)f $ is onto  $(c)$ $f$ is one-one  Attempt: I have an intuition that the continuous nature of function $f$ would play a part in this problem. however, unfortunately, I am not able to decipher how to move ahead.  Any directions on this problem shall be really great.  Thank you.


Making an addon, how do I pass information between a UI panel button press and my custom operator?

I have a UI panel for my addon, with a couple of buttons that should all invoke a custom operator class which append objects from another blend file.   My questions is how do I append specific object based on what specific button is pressed without making a new class (with an execute function attached) for each button.   I have a decent amount of scripting experience but classes and Blender's addon making are super mysterious to me. I know how to pass variable into functions, which is a technique I use when scripting, but have no idea how to do this within classes.  That's my ui_panel.py, which currently has one button but ultimately should have multiple buttons that append different objects from a blend file which store all my assets:  class UI_PT_Panel(bpy.types.Panel):     bl_idname = "UI_PT_Panel"     bl_label = "My Panel"     bl_category = "My Addon"     bl_space_type = "VIEW_3D"     bl_region_type = "UI"      def draw(self, context):         layout = self.layout          row = layout.row()         row.operator('wm.appending_basic_objects', text = "Append object")   And this is my append_operator.py, which should have a variable handling which object is appended based on which button is pressed in the UI (or something equivalent to that):  class Append_OT_Operator(bpy.types.Operator):     bl_idname = "wm.appending_basic_objects"     bl_label = "Append the basic objects"      def execute(self, context):         path = (r'C:/Users/')         blendfile = "Assets" + ".blend"          bpy.ops.wm.append(             filepath = blendfile,             directory = path + '/' + blendfile + "/Object/",             filename = 'my_object')           return {'FINISHED'}   Finally I have an init.py which only register and unregister classes (still have no idea what this mean but I know it's necessary).


Is there a limit to how much quarried stone you can mine?

I just installed the DLC, bought Lakeview Manor, and now I have to furnish the inside. It seems that I can only find a few quarry stones in the chest and next to a hill, but on the hill was a stone quarry vein.    So I mined it. It took forever and ever and I tried to wait before it depletes. It didn't. Here are my theories:   The quarry gives you a huge amount of quarried stone before depletion. The quarry give you unlimited amounts of quarried stone, so you won't have to find another vein.   So which theory is true? Is there a limit to how much quarried stone can be mined? Or does it go forever until you press a button?


I am getting "Insufficinet Space" errors when I try to update whatsapp on my HTC desire. I am running CyanogenMod 7.  My filesystem usage looks like this:  df -h Filesystem                Size      Used Available Use% Mounted on tmpfs                   202.8M     32.0K    202.7M   0% /dev tmpfs                   202.8M         0    202.8M   0% /mnt/asec tmpfs                   202.8M         0    202.8M   0% /mnt/obb /dev/block/mtdblock3    250.0M    118.3M    131.7M  47% /system /dev/block/mtdblock5    147.6M    122.6M     25.0M  83% /data /dev/block/mmcblk0p2    961.1M     16.0M    896.3M   2% /sd-ext /dev/block/vold/179:1                       2.6G    952.7M      1.7G  36% /mnt/sdcard /dev/block/vold/179:1                       2.6G    952.7M      1.7G  36% /mnt/secure/asec /dev/block/dm-0           3.1M      1.6M      1.5M  52% /mnt/asec/com.opera.mini.android-2 /dev/block/dm-1           9.1M      7.2M      2.0M  78% /mnt/asec/com.google.android.apps.maps-1 /dev/block/dm-2          16.2M     14.1M      2.1M  87% /mnt/asec/com.google.android.apps.plus-1 /dev/block/dm-3          20.3M     18.9M      1.4M  93% /mnt/asec/com.google.android.gms-1 /dev/block/dm-4           6.1M      4.9M      1.2M  81% /mnt/asec/org.xbmc.android.remote-1 /dev/block/dm-5           4.1M      2.3M      1.8M  56% /mnt/asec/com.google.android.gm-1 /dev/block/dm-6          17.2M     15.6M      1.7M  90% /mnt/asec/com.whatsapp-2   What I would like to know is exactly what partition I need to free up this missing space on. /system and /data all seem to have 25M +, and I am trying to update Whatsapp. The current Whatsapp app is just a little over 10M so should fit as far as I can see from this.  I appreciate that similar questions have been asked on this site before but I have tried various solutions mentioned there already such as removing unused apps and re-mounting the cache partition to the sd card.


jQuery functions not working after click button?

What I want to happen   When press the add button, a row will be added underneath the add button's row When press the remove button, that row will be removed. When hover or click on a certain input text, an add button will show up next to it.    When mouse is not hovering over the input text or the input text is not selected, then the add button should disappear.  When hover over a certain bullet, a remove button will show up in place of the bullet.    When mouse moves away from remove button, it will revert back to a bullet.    I suspect some of my problems are occurring b/c I'm putting all my functions in $(document).ready(). If someone could type out the jQuery code that I should be using I would be really grateful!  What is happening  The Add Button   Only the first add button works.  The Remove button  The other added rows' remove buttons only show up when hover over the first bullet.   The remove button only works once. After remove one row, the remove button & add button lose their functionality. The remove and add button also don't disappear as they should.  My code  HMTL  This is the row I want to add

                                  <button type="button" class="btn btn-default button-remove" aria-label="Remove">                                                                      </button>                                 <button type="button" class="btn btn-default button-bullet" aria-label="Bullet">                                                                      </button>
                              <input type="text" name="Worksheet-Problem" class="form-control" placeholder="Problem..." aria-label="Write worksheet problem here">
                                   <button type="button" class="btn btn-default button-add" aria-label="Add">                                                                      </button>

   jQuery  These are the functions I'm using to animate the buttons and add/remove rows.  $(document).ready(function(){     $("input[type='text'][name='Worksheet-Problem']").closest('.row').hover(function()      {         $(".button-add").fadeToggle(300);     })     $(".button-bullet").closest('.input-group-btn').hover(function(){         $('.button-bullet').toggle();         $(".button-remove").toggle();     })      $(".button-add").click(function(){         var $row = $(this).closest('.row');         var $wsProbRow = $row.clone();         $wsProbRow.insertAfter($row);         console.log("Add-Button pressed");     })     $(".button-remove").click(function(){         $(this).closest('.row').remove();         console.log("Remove-Button pressed");     }) })


How to add a zero in front of an integer value

I'm trying to calculate the future time when a user inputs hours and minutes separated by a space.  I'm stuck on when the user inputs minutes that calculates the future minutes to be less than 10.  For example, if the current time now is 10:04 and the user inputs 1 hour, 4 minutes, the future time SHOULD be 11:08.  Instead, I get printed 11:8  int extraHours = minutesGiven/60; hoursGiven = hoursGiven+extraHours; // System.out.println("hoursGiven= " + hoursGiven); int extraMinutes = minutesGiven%60;  if((minutesNow + extraMinutes)>59){     minutesNow = minutesNow + extraMinutes-60; }else if((minutesNow+hoursGiven)<10){     minutesNow = minutesNow + extraMinutes;     String padded = String.format("%02d" , minutesNow); }else{     minutesNow = minutesNow + extraMinutes; }  //calculate the future hour int futureHours = 0; if(minutesGiven==30){     futureHours = (hourNow + hoursGiven +1)%24; }else{     futureHours = (hourNow + hoursGiven)%24; } //print the time System.out.println("The time will be " + futureHours + ":" + minutesNow);  // LocalTime noon = LocalTime.of(12, 0); //12 hours, 0 minutes //System.out.println("Noon printed as a LocalTime object: " + noon);


How to display last two digits as to make it meaningful money

How can i round of to two decimal points with last decimal point can be either 0 , or 5   import java.text.DecimalFormat; import java.util.Collections; import java.util.HashMap; import java.util.Map;  public class Test {      public static void main(String args[]) {         String selling_price_beMod = "23.31";         double sell_price_d = Double.parseDouble(selling_price_beMod);         String selling_price = round(sell_price_d);         System.out.println(selling_price);     }      public static String round(double value) {          DecimalFormat df = new DecimalFormat("#.00");         return df.format(value);     }  }   When i run the below program the output is   23.31  In this case i want to make it display as 23.35  Please excuse if this is a wrong question and should be approached in a different way .


Pseudocompactness does not imply compactness

It is well known that compactness implies pseudocompactness; this follows from . I know that the converse does not hold, but what is a counterexample?  (A  is a topological space $S = \langle X,{\mathfrak I}\rangle$ such that every continuous function $f:S\to\Bbb R$ has bounded range.)


Solve a differential equation : m*(dv/dt)=-m g - r v

How to solve this differential equation:  $$ m*(dv/dt)=-m g- r v$$  where m, r and g are constants.  I am trying to rewrite the equation as dv=dt form, but I do not know how to do it. I get the solution from the mathematica as   $$ (mg/r+v)*e^{(-rt/m)}-(mg/r)$$


Problem about LFT carries one pair of concentric circles into another pair of concentric circles

While I tried to prove a problem,          Suppose that a linear fractional transformation carries one pair of concentric circles into another pair of concentric circles. Prove that the ratios of the radii must be the same.      Following is my try     Suppose concentric circles $z_1=\alpha+Re^{i\theta}$ and $z_2=\alpha+t Re^{i\theta}$, where $t>0,\ \theta\in [0,2\pi)$, through LFT $\frac{az+b}{cz+d}$ mapping to          $$     \omega_1=\frac{a Re^{i\theta}+a\alpha+b}{cRe^{i\theta}+c\alpha +d};\\   \omega_2=\frac{a tRe^{i\theta}+a\alpha+b}{ctRe^{i\theta}+c\alpha +d}.    $$      According to condition the mapping maps the concentric circles to concentric circles, so $\omega_1$ and $\omega_2$ are concentric. Suppose $\omega_1=\beta_1+R_1e^{i\theta}$ and $\omega_2=\beta_2+R_2e^{i\theta}$, solve the equations, we get the results as follows,         $$   \beta_1\to \frac{(a \alpha+b) (\alpha c+d)-a c R^2}{(\alpha  c+d)^2-c^2 R^2},R_1\to \frac{R (a d-b c)}{(\alpha  c+d)^2-c^2 R^2};    $$         $$   \beta_2\to \frac{(a \alpha+b) (\alpha c+d)-a c R^2 t^2}{(\alpha c+d)^2-c^2 R^2 t^2},R_2\to \frac{R t (a d-b c)}{(\alpha c+d)^2-c^2 R^2 t^2}.    $$           We simplify $\beta_1-\beta_2=0$, that is          $$     c(c\alpha+ d)=0.    $$   (i)$c=0$, $R_2/R_1=t$.      (ii)$c\alpha+d=0$, $R_2/R_1=1/t$.   Now my question is the first situation is normal and second one seems like the original proposition is not right, what's wrong?   Besides, I think my way to solve this question especially solving the equations are complicated, it there any other simpler solution? Thanks!


I was wondering something about the $ of jQuery. I know that it refers to jQuery object, but I a found something a bit different today : $parent In the code I'm working on, that's a substitute to $(this).parent : eg : var $parent = $(this).parent();  So my question is, why $parent and not parent ? Is that the only selector ? How to use it this way ? And I'm not talking about the dotted functions like $.ajax or $.post.  Thaks for helping


Prove that these definitions of $e$ are equivalent

Im sorry if this is stupid or obvious, but why   $$ e=\lim_{n\rightarrow \infty}\left(1+\frac{1}{n}\right)^n$$  AND  $e$ is the unique positive number for which $$ \lim_{h\rightarrow 0}\frac{e^h-1}{h}=1$$?  I mean, how do we know that these two definitions are equivalent?   Again, maybe it's easy, but I'm just beginning calculus and our teacher just dropped those two definitions...


Is it possible to download a previous version of minecraft_server.jar?

I am trying to set up a Tekkit-like server (+ some different mods). Most mods are not 1.4.2-compatible, yet, so the server runs 1.3.2. I can use MCNostalgia to downgrade the client, but is there any way to downgrade the server or download an old version?


Winter-Bash dropdown behavior inconsistent with other dropdowns in the top bar

The new winterbash dropdown and the help dropdown in the top bar behaves different from the other dropdowns:   If an other dropdown is open I can hover over other normal dropdown triggers to open that instead. This does not work for the winterbash dropdown. E.g. if I press on the inbox dropdown and hover over the reputation dropdown, the reputation dropdown opens. Simmilary, if the winterbash dropdown is open hovering over the other dropdown items doesn't have any effect. Closing the winterbash dropdown with a click on the snow star adds a hash (#) at the end of the current URL. When the help dropdown is open and I hover over the inbox (or other dropdown menus) the other menu will not open. When an other dropdown than the help menu is open and I hove over the help dropdown the help dropdown does not open.


The WinSXS folder on my PC currently holds over 6.9GB of data, which is a few hundred files inside the folder named like amd64microsoft-******.  I have read, and read but just can’t seem to find an trustworthy answer on the following questions:   What does MRT.exe do?


'execfile' not defined in apache2 config

I want to deploy two different Django apps in the same host with the different virtual environment (python2.7 and python 3.6). I had followed the tutorial  to deploy. one of my WSGI scripts is   import os import sys import site   site.addsitedir('~/.virtualenvs/myprojectenv/local/lib/python2.7/site-packages')  sys.path.append('/home/django_projects/MyProject') sys.path.append('/home/django_projects/MyProject/myproject')  os.environ['DJANGO_SETTINGS_MODULE'] = 'myproject.settings'  activate_env=os.path.expanduser("~/.virtualenvs/myprojectenv/bin/activate_this.py") execfile(activate_env, dict(__file__=activate_env))  import django.core.handlers.wsgi application = django.core.handlers.wsgi.WSGIHandler()   when I run apache server I get an error ---> Nameserver: name 'execfile' is not defined  When I searched for this error I found execfile is not supported in Python 3.X. But I have 2 Django app to deploy. Please help me to find the solution. Is there any detail you need let me know


How can I get rid of 'in' in front of journal title?

I am a Lyx user, and very new to this program (new to LaTex). I first made a reference today(using a database), and 'in' was added in front of journal titles unexpectedly. I want to erase 'in' using \DefineBibliographyExtras but don't know what kind of formatting commands. Please give me a tip.  And if anyone knows how to erase 'in' permanently, please let me know. I really hate that 'in'. I make a database with JabRef


Are there conventions for signing JSON as a tree, to allow proofs of signed subtrees?

Given some JSON with a chosen encoding, you can obviously cryptographically-sign the whole thing as a binary blob.   However, it might be useful if the logical structure of the JSON-compatible object were leveraged to control what is signed, in such a way that you could later provide compact proofs that some subtree of the JSON object was signed (without necessarily providing the full JSON object).  For the purposes of illustration, assume the JSON object is a large dictionary, mapping short names to longer blobs, as might be constructed by the following Javascript.   json = { 'A': 'rfhserusliurslierfsieursiuebr',          'B': '384ur3984hfe98r9e8hjf8ej4fj04',          ...          'Z': 'xcvubxudgoxduhf9xd88hxd9fybdf', }   I'm hoping for some robust deterministic convention, already hammered out in a mature spec, for providing a "signature" of this object that does more than a plain signature-of-its-JSON-serialization.   Then, consider a 3rd party that has that signature, plus the full JSON, but only wants/needs to show that the original signer signed something containing:  subset = { 'B': '384ur3984hfe98r9e8hjf8ej4fj04', }   I'm hoping the convention also specifies how this 3rd party can construct a combination of that subset, the signature, and something else about the elided ranges – that still proves the original signer committed to just that subset.   It seems this might already exist – if not already for JSON, then for some other similar hierarchical object model.   One natural approach that 1st comes to mind would involve composing the keys/values/slots of the entire object into a hash tree, and then signing the root. With suitable tricks, this might allow the 3rd party to prove any subset, like the one above, in a compact (or even fixed-size) way. (But maybe there are other techniques, involving composable signatures, zk-proofs, redactable-hashing, etc - the goal is more important than the mechanism.)  Does anyone know of applicable conventions/standards/published-techniques? Just names or references of related prior work, for further searching/reading, would be great answers.


Help understanding predicate logic question/proof

Can someone help me? I can't even understand what the question is asking for.     Let $S = \{x_1,x_2,x_3,\ldots,x_n\}$. Show that ${\sim}[\forall x\in S,P(x)\lor Q(x)]\iff \exists x\in S,[{\sim}P(x)\land {\sim}Q(x)]$


Custom command to explorer context menu (for currently browsing folder or desktop)

I use Command Prompt (and other programs) really often.   What i want is add them as custom command for context menu of Windows Explorer. But not for specific file extension or folder, or all extensions, but to see it when an empty area of current folder (or desktop) clicked by the user.  I think this could be done with Windows factory tools (Windows Registry), but i am not sure how exactly.  I want to make this command to run in current directory (path where explorer is currently opened in). I also want to add icons and titles to that menu items.  Is there any article or example of making this?


Learning General Relativity from a mathematical and physical point of view

I am an undergraduate in Mathematics writing his dissertation on General Relativity this year. The next couple of months will be dedicated to learning the math (geometry) and the physics, and to this end I am looking for must-read/must-watch material on the topic.  General book recommendations are welcome, but keep in mind I can use Google! I am mainly looking for really good introductory content that I would have a hard time finding myself, whether it be videos, course notes, books or blog posts.  My apologies if this is a duplicate!


What is the purpose of the bin directory? What are some examples?


Vertical loop/block lines in algorithmicx with 'noend' option

I am using the algorithmicx package to write an algorithm. However I am using the noend option:  \usepackage[noend]{algpseudocode}   Is there anyway to get vertical lines for each block of code? This question has been answered here:    However, it does not work when using the noend option.  EDIT: I'm looking for something like the algorithms here:


Constant acceleration space travel: velocity relative to the Earth?

Suppose we are in a spacecraft that is moving away from the Earth along a straight line with a constant acceleration of $1G$, and that this acceleration can be sustained indefinitely.  Accelerating at $1G$ seems to suggest at first glance that we should move 10m/s faster every second relative to the Earth, but does not sound right since that would take us a finite amount of time to reach the speed of light if that were true. What velocity and time are we talking about? What does constant acceleration mean and in what frame, and what is our speed relative to the Earth at any given time $t$?


How can I change the language of the blender to understand it?

Help me please translate Blender into my language.


Is there a term for sharing a word between multiple lines of a poem/song?

In Jonathan Coulton's "Sticking It To Myself," the first word or phrase in one line (bolded) often also serves as the last word in the next line without repetition:  And I heard everything you said Those things to try to get inside my head Is full ...   Sticking it to my- Self-control That's not the only thing I lack A plan Just my own gun against my Back down now and let this hostage Go away  This is as opposed to the chorus of The Wanted's "Glad You Came," which does something similar but repeats the word on the next line:  Turn the lights out now Now I'll take you by the hand Hand you another drink Drink it if you can Can you spend a little time? Time is slipping away Away from us, so stay Stay with me, I can make Make you glad you came  What The Wanted's "Glad You Came" does by repeating the last words of one line in the start of the next line is called anadiplosis, but the name of the rhetorical scheme or literary device I'm seeking is that of the first example where the words at the end of one line are not repeated but instead themselves become the words that start the next line. Is there a name for this rhetorical scheme or literary device? If so, what is it?


Alleles refer to duplicate genes, where one allele can be dominant over the other. What makes an allele dominant or recessive, given that both code for a single protein?.


Error123: Attempt to invoke virtual method 'boolean java.lang.Object.equals(java.lang.Object)' on a null object reference

please do not mark this question as duplicate, because I have all of the solutions on similar questions to this, and they haven't worked. Not saying that those answers were wrong, just that it isn't working for me at least. Thanks.  Here is my if statement:                  if (dataSnapshot.exists() && !dataSnapshot.child("connections").child("nope").hasChild(currentUId) && !dataSnapshot.child("connections").child("yes").hasChild(currentUId)){                 String profileImageUrl = "default";                 if (profileImageUrl !=null && !dataSnapshot.child("profileImageUrl").getValue().equals("default")){                     profileImageUrl = dataSnapshot.child("profileImageUrl").getValue().toString();                 }                 com.example.tiarnan.tinder.cards item = new com.example.tiarnan.tinder.cards(dataSnapshot.getKey(), dataSnapshot.child("name").getValue().toString(), profileImageUrl);                 rowItems.add(item);                 arrayAdapter.notifyDataSetChanged();             }   As you can see, I did try to put a != null, but it still isn't working. That was the most seen solution on the duplicate questions.  Thanks in advance, and I hope you guys can help me solve this.


my google account and password is correct but it keeps saying you entered the wrong password or your account has changed. it still has me logged in on the email but this error sign will not go away.


How can I serialize an object to JSON without properties that are null?

To communicate with a REST interface on a private system, I need to send a JSON message from a trigger. I have a message object that has some fields, lists and a child object:  public class MerchantConfig {  public class MIDConfig {     public String mid;     public String currencyCode;     public String cardTemplateName;     public String paymentPanelRestriction;     public List<String> restrictedCountries;      public String paymentPanelRestrictionForCountries; }  public String merchantName; public String sopgTemplateName; public Integer dispositionTimeWindowInMinutes; public List<String> features; public Boolean activateImmediately; public List<MIDConfig> midConfiguration; }   I can serialize it to JSON using the built-in serializer:  String body = JSON.serializePretty([MerchantConfig instance]);   The result:  {   "sopgTemplateName" : null,   "midConfiguration" : [ {     "restrictionCountries" : [ "DE", "AT" ],     "paymentPanelRestrictionForCountries" : "MANDATORY",     "paymentPanelRestriction" : "OPTIONAL",     "mid" : "1000000001",     "currencyCode" : "EUR",     "cardTemplateName" : null   }, {     "restrictionCountries" : [ ],     "paymentPanelRestrictionForCountries" : "",     "paymentPanelRestriction" : "OPTIONAL",     "mid" : "1000000002",     "currencyCode" : "USD",     "cardTemplateName" : null   }, {     "restrictionCountries" : [ ],     "paymentPanelRestrictionForCountries" : "",     "paymentPanelRestriction" : "PROHIBITED",     "mid" : "1000000003",     "currencyCode" : "AUD",     "cardTemplateName" : null   } ],   "merchantName" : "Test Merchant",   "features" : [ XYZ ],   "dispositionTimeWindowInMinutes" : 10,   "activateImmediately" : true }   How can I serialize this object so that all properties that are null don't show up in the JSON string?   In this example, "sopgTemplateName" and all "cardTemplateName" properties are null and should not appear in the JSON string. The empty list "restrictionCountries" should still appear as an empty list, though.


What is the remainder when $1!+2!+3!....+100!$ is divided by $3$ and please can you explain the formula for finding sum of factorials?  Also is there a sequence for last digits when a factorial sum is divided by a prime number?


Compile Error: Class Batch_Class must implement the method: void Database.Batchable.execute(Database.BatchableContext, List)

global class Batch_Class implements Database.Batchable<sObject>{      public String Field;     public String Query;     public String Value;      public Batch_Class (String f, String q, String v){          Field = f;         Query = q;         Value = v;      }     global Database.QueryLocator start(Database.BatchableContext bc){             return Database.getQueryLocator(Query);         }              global void excute(Database.BatchableContext bc,List<Account>scope){          for(Account a: scope){             a.put(Field,Value);          }         update scope;     }     global void finish(Database.BatchableContext bc){}  }


Where should I post question about authenticating users?

I want to ask a question about authenticating users, specifically validating that an individual is an employee at one of a large number of companies (probably using their company's email address, which I don't know before hand). Based on my prelim research there seems to be the most overlap with IT security exchange.


Script to output information of foreign keys

I would like to know the detail about  my foreign keys.  I tried this  SELECT * FROM sys.foreign_keys;   But I need more than the information I can get now.  Is there a way to know the columns they are refering to by using scripts like this ?


Different behaviour of \color in "tabular... m" and "tabular... p"

The following MWE :  \documentclass[10pt]{article} \usepackage[french]{babel} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc}   \usepackage{color} \usepackage{array,float}  \begin{document}     \begin{tabular}{|*{3}{>{\centering}p{1cm}|}}         \hline \color{red}A&B&C\tabularnewline \hline     \end{tabular}      \begin{tabular}{|*{3}{>{\centering}m{1cm}|}}         \hline \color{blue}A&B&C\tabularnewline \hline     \end{tabular}      Some blablah... \end{document}   gives me :    The blue color continues after the cell, and even after the tabular !  I know that I can basically solve the problem with braces around  \color{blue}A   but I want to understand why, if I use "m" parameter instead of "p" in tabular, \color has this strange behaviour... (Otherwise, why, in the first tabular, cells are higher and A in the bottom of his cell ?)


How can I write a double closed path integral? I have searched and I have found only single closed loop integral.


How do I turn off syntax highlighting in minted?  Defining my DSL with a CFG and then a PEG; and the syntax highlighting is getting in the way.


Random Effect Model or Fixed Effect Model in meta-analysis?

I am investigating the prophylactically effect of drug A regarding onset of epileptic seizures. Drug A is given to the test group and not the control group. The hypothesis is that drug A does not prevent seizures.   I am comparing 17 studies in a meta-analysis regarding brain tumors. They differ greatly; the median age, gender ratio, location of tumor, tumor histology (benign vs. malignant tumor), follow up, publish year, prescribed medicine etc.  I would intuitively choose the Random Effect Model as all beforementioned factors are associated with the risk of developing seizures.   The RE model reveals the following about heterogeniety: I^2=0.0%, p=0.27, Q=8.5.  This indicates homogeniety between the studies - should I use til Fixed Model? And why/why not?  Thank you, C.


Is there any way to restore/recover the previous version of a file that was saved over?

I just wrote an extensive essay, ironically the last one of my academic career, and then, for the first time in my life, saved over it with an empty document by accident.  Is all hope lost?  Is there any way to restore it to its last version?


Which font might produce the following output?

The following image is a scanned page from a book, whose fonts I like to use. Which fonts do youthink can produce the following math-output?


How to map stock ticker symbols to ISIN (International Securities Identification Number)?

How can I can convert ticker symbols (which include information on the exchange) to an International Securities Identification Number (ISIN) (which contains no information on the exchange)? Also I am interested in the other way round — given an ISIN and a market identification code (MIC) how can I determine the ticker symbol? Any databases around?


Give a badge to users who improve closed questions

We should give a badge to editors who improve closed questions so much that they get reopened.  David Fullerton suggested this badge as part of , which explains the motivation. I just thought it deserved a full-fledged, standalone request. (Actually, when I read his answer, the idea felt very familiar, and I was certain that it had been proposed before. However, I couldn't find any existing proposal after a relatively long search.)  There are lots of possible variants on this idea, which I'll let people hash out in discussion. Things to consider:   How many questions do you need to get reopened to earn the badge? What if there are already reopen votes on a question you're editing? What if a question gets re-closed after reopening? Re-reopened? Should it matter if the question you edit is your own? If some user posts a bad question, a couple people vote to close, a Good Samaritan edits the question into shape, and no more close votes get cast, should the Good Sam get the badge? What's a good name? David suggested "Resurrection." I'm not a huge fan of that, for two reasons. First, it sounds too much like Revival and Necromancer, but this badge doesn't work like either of those. Second, it implies that closed questions are dead, which is exactly the image that we're trying to eliminate. Bronze, silver or gold?


Why do I need the execute permission to upload files via SFTP?

I have an directory with 664 permission so the owner and group should be able to read and write.  drw-rw-r-- 2 sftpuser   sftpusers 4096 Aug  8 14:02 sftp  But when I try to upload a file via sftp I get the following error:  Command:   put "C:\Users\Public\Pictures\Sample Pictures\Chrysanthemum.jpg" "Chrysanthemum.jpg" Error:     /Data/sftp/Chrysanthemum.jpg: open for write: permission denied   After changing the permissions to 774 it works.  Why do I need the execute permission to write a file?


Say I am ssh-ing into server A to copy some files onto server B (I need to ssh because I don't exactly know where the file is located):  ssh A@ip_A  scp some_file B@ip_B:/path/on/B(input the password for the B server)   Now my question is: Does the password for B get stored/saved somewhere in the filesystem of server A?


Show the closed form of the sum $\sum_{i=0}^{n-1} i x^i$

Can anybody help me to show that when $x\neq 1$  $$\large \sum_{i=0}^{n-1} i\, x^i = \frac{1-n\, x^{n-1}+(n-1)\,x^n}{(1-x)^2}$$


Searching for Google contacts not in Groups

Possible Duplicate:          In Google Contacts, I've had Groups set up which look like this: All Contacts.. Family.. School.. Work.. etc.  Each contact I have is assigned to All Contacts. In addition, it is assigned to at least one more Group.  Sometimes when I add contacts, I forgot to bucket them in the respective groups, so I was wondering is there anyway I could do a search for contact that belongs toAll Contact-group, but does not belong to any other group ?


$H$ is a subgroup of $G$ with $\phi(H) = H$  $\forall \phi \in Aut(G) \Rightarrow $ $H$ is normal in $G$    I'm not sure where to begin.  Perhaps we can use this corollary of the First Isomorphism Theorem   $N_G(H)/C_G(H) \cong Aut(H)$   But I'm not sure if this is helpful.


Sci-fi book with a scientist discovers and goes to an alternate reality, where items improve with use

I'm looking for a sci-fi book I read some time ago, where items improve with use in an alternate universe that was discovered in a lab.  A scientist goes to this universe not knowing this, and all of his technology improves over time. The people in this world don't have guns, and don't have the wheel.  I remember the main character learns a zipper into a saw, and breaks out of jail.


What technique/pattern does cin/cout use allowing e.g. cout << x << y?

In C++, we usually use many << operator to output to console like below:  cout << "x = " << x; // Output, for ex: x = 5   I know each << operator return cout again, the code should be similar with:  some_class& do_some_thing(int x) {     // process or print x     return *this; }   But I don't know what is this technique or pattern called and in what case we should use it?  Should this technique be implemented on another programming language, such as C#, which I'm using for my work.


I read that every prime number is of the form $6k\pm1$, is this a correct approach to find out if a number is prime?  auto isPrime = [&](int num) {       if (num == 0 || num == 1)         return false;       if (num == 2 || num == 3)         return true;       if ((num - 1) % 6 == 0 || (num + 1) % 6 == 0)         return true;       else         return false;     };


Is $M=\{(x,|x|): x \in (-1, 1)\}$ not a differentiable manifold?

Let $M=\{(x,|x|): x \in (-1, 1)\}$. Then there is an atlas with only one coordinate chart $(M, (x, |x|) \mapsto x)$ for $M$. We don't need any coordinate transformation maps to worry about differentiablity. So I thought $M$ is a differentiable manifold. However my teacher says it is not. He says the sharp corner at $x = 0$ is a problem. I can't understand why it is a problem.


What happens to Concentration spells while Blinking?

I regularly see blink praised as a particularly good defensive third-level spell because, unlike many spells with persistent effects, it does not require concentration.  It does, however, state that "you can only affect and be affected by other creatures in the Material Plane."  I am uncertain about what exactly this means for concentration spells that are cast before the caster begins to blink.  So here are some specific questions:   If I cast hold person and then blink, is the target still affected by hold person while I am on the Ethereal Plane?  (I believe the answer is no.) Targets can save from hold person at the end of their turn.  If the answer to the previous question is no, can the target save while they're not technically affected by the spell?  (I believe the answer is no, but this seems to be getting into weird territory, since they can only save when I fail to blink?)


What do the slashes mean in the character tables?

I've been reading the PF core rulebook, but confused over some of the data in the Character tables, and not found anywhere in the book that explains it, so wondering if someone could explain it?  Taking the Monk class table for example:     Level | Base Attack Bonus | ..... | Flurry of Blows Bonus      1st       |       +0          |   ....    |        -1/-1      2nd       |       +1          |   ....    |        +0/+0      ...      ...      16th  |       +12/+7/+2   |   ....    |        +14/+14/+9/+9/+4/+4/-1      17th  |       +12/+7/+2   |   ....    |        +15/+15/+10/+10/+5/+5/+0      18th  |       +13/+8/+3   |   ....    |        +16/+16/+11/+10/+6/+6/+1   What do the slashes between the bonuses mean?


The winter hats stay wherever they are when Code Snippet is opened and they don't move away or update their location. A demo of it can be seen here:


Proof that $\sqrt[n]{a+1}$ and $\sqrt[n]{a-1}$ cannot be both rationals

Let $a \neq 0$ be a natural number. How can be proved that $\sqrt[n] {a+1}$ and $\sqrt[n]{a-1}$ cannot be both rational numbers?


Purpose of capacitor across transformer in AC-DC power supply?

I have been looking to buy a AC-DC 5v power supply module to power a mains relay in a circuit I am making. I came across a couple of different models on eBay and am trying to understand their basic working design.   has good resolution pictures. To my untrained eye, a lot of thought seems to have gone into the separation of the AC mains and DC output. The underside of the board (see second photo) shows that the PCB has been milled under the yellow thing (transformer?). However there are two other components next to this transformer(?); on one side is a black chip which I believe is an optocoupler (I looked up a part number from another photo I saw of the same board), but on the other side is a capacitor labelled C5.   My main question is what is the purpose of this C5, given that it seems to be going from the AC side to the DC side? Wouldn't that defeat the purpose of the separation? My guess is that the larger capacitors provide filtering, but I can't work out what C5 is doing there. Secondary questions are how I should approach understanding a circuit like this? Is this a common design for a AC-DC power supply? Could you explain in simple terms what this circuit is doing?   Here is my guess of the circuit functioning: The power comes in and goes some kind of filtering and over-current protection (NTC thermistor). Then it passes into a full-wave rectifier (D4) and the black coils (another transformer?), in some order. I assume then that after this the voltage is a bit lower. The 400V cap on that side helps smooth this rectified output. There is an IC just visible on the top of the board under the black coils which I'm guessing does some PWM with feedback from the optocoupler driven by the DC output; this feeds the yellow transformer which then somehow induces a DC voltage on the other side (I thought that transformers only did AC-AC, but maybe this is not right?) Finally the output, which should be 5V at this stage, goes through some final caps for filtering and into the optocoupler for feedback. Is any of this right?  For what it's worth, the other power supply module I was looking at was  which is a bit cheaper, but doesn't seem to have the same level of input filtering or isolation (also, no black coil thing?)


How come some posts lack 'active' hyperlink?

Some posts don't have a link on the right (named active) that would take me to the latest edited post on a thread. What are the criteria?


In the TV series Game of Thrones, now that as of Season 8 Episode 3, "The Long Night", the      Night King is defeated and the White Walkers and their wights are dead along with anyone (presumably) who was behind the Wall prior to season 8,   are the Night's Watch still required?


I am working on a LaTeX document that includes lots of pgfplots. I would like to disable them for the time being until I work on the rest of the text so that I can build the document fast. If I include the option draft to the document class the figures are no longer included but the pgfplots are created and they take a considerable amount of time. Is there an easy way to disable/enable these plots without having to go through the document commenting/uncommenting text?


Suppose that $g$ is a primitive root modulo $p$. Show that, modulo $p^h$ for $h\geq 2$, every primitive root has the form $g'=g+np$ for a certain integer $n$.  The proof of the previous statement should appear in every book of elementary number theory but, in this moment, I don't have any book with me and I should prove this.  My attempt: I believe one possible way to prove it is to show that $g'\equiv g$ mod $p$, that is every primitive root modulo $p^h$ is also a primitive root modulo $p$, but I'm stuck on how to prove this simple statement.  Thanks in advance for any help.  P.S.  Of course I'd appreciate every possible proof...I believe that this can be proved in several ways.


Using regression equation to estimate values outside of the range of data?

I recall reading that this is a no-no.  Makes sense, b/c the pattern/relationship may dramatically change outside of the interval.  My question is:  Is there a rule for this convention?  Interpolation vs. extrapolation?    Like if you have a correlation between auto price to auto mileage, and the range of miles is within 0 to 100k miles, you should not try to estimate the cost of a car with 120k miles.  Just estimate cars with 0 to 100k miles.    Is "extrapolation" totally invalid, or simply done with a disclaimer?


What happens to photons when they hit our eye? where do they end up? if they generate heat, why our eye don't get overheated?  Similarly what happens to electrons when the light hits certain metals, which causes "weakly connected" electrons to get hit out?  Shouldn't then light constantly shining on a piece of metal eventually cause it to decay, and get split to electrons, and other particles?  (sorry if I'm not using right scientific terminology)


Understanding the functionality of a button with a rotating arrow in GNOME 3 status menu

There are no tool tips for buttons in GNOME Status menu. I wanted to know the function of the 2nd button from left at bottom in the following image:    It shows a lock sign when clicked.    OS: Ubuntu 18.04


What's the word for words that roll off the tongue?

I'm looking for a single word for words that are fun/easy/pleasant to say—words that roll off the tongue, so to speak.


How to complete Borderlands 2 missions in right order?

I already completed Borderlands 2 on normal mode many month's ago. But without any DLC. Now I have all released 4 DLC and my version is 1.7.0. I want start play again from level 1. But I'm completely confusing how to play. Can you tell me like below:   Complete all main & optimal missions in normal mode. Teleport to "name here" for "name here" DLC, and complete it. Teleport to "name here" for "name here" DLC, and complete it. Teleport to "name here" for "name here" DLC, and complete it. Teleport to "name here" for "name here" DLC, and complete it. Change difficult mode to "mode here". Repeat again.   I don't know which DLC requires what level. I don't know how to reach those DLC zones. I don't know which DLC should I play first and which one later.  edit: wtf is that playthrough 1, playthrough 2, playthrough 2.5 things?


Does linear ordering need the Axiom of Choice?

Consider this statement: "every set can be linearly ordered." Can we prove it without AC?


Does SOQL query get consumed when querying from an empty set?

Let's say I have a following piece of code:  Set<Id> accountIds = new Set<Id>();  for(Contact c : [SELECT Name FROM Contact WHERE AccountId IN :accountIds]){     System.debug(c); }   The accountIds set is obviously empty in the example above, but will my Apex code consume 1 SOQL query?


Please differentiate between  v(rms) and V(avg/dc) of an Ac signal .  Why do we use rms and why is vrms called effective value; why is vp not so called or (v(avg))? And why we use v rms to calculate power (avg)?


Why does windows not let me to uninstall some apps?

I'm running Windows 10. I've found that uninstall button is grayed out for some apps at Start > Settings > System > Apps & features. Which means I can't uninstall such apps. For example here is a screen-shot for Movies & TV app which I want to uninstall:        So, why is Windows not letting me uninstalling some apps? Are those apps essential to have or without which Windows may not work?  And how do I uninstall those apps that I feel no need and want to uninstall? I've also tried Control panel but it doesn't list those apps at Control Panel > Programs & Features > Uninstall a program.


Centering displayed math within enumerate environment

This is my first post so apologies if there are any community rules that I overlooked. If I write something in displayed math within an enumerate environment this is not centered with respect to the enumerate environment but with respect to the whole text. The following image shows what I mean:  The code for reproducing the above is as follows. I use the geometry, enumitem and parskip packages but similar situation occurs without them as well. I include them in the code since I would like a solution compatible with those packages. \documentclass[a4paper,12pt]{amsart} \usepackage[margin=1in]{geometry}  \usepackage{enumitem} \usepackage{parskip}   \begin{document}  \begin{enumerate} \item This is the first item. I am just writing some nonsense to fill up the line. Now for a long displayed formula \[1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1\] \end{enumerate} This is some text following the enumerate environment to indicate that the formula is aligning with respect to this text rather than within the environment. \end{document}  I find the above rather ugly and I prefer instead the following image:  This was produced by adding \hspace{0.5\labelwidth} \hspace{0.5\labelsep} \hspace{0.5\leftmargin} inside the displayed math. My two questions are:  Am I wrong in preferring the second image to the first? What is the best way of obtaining the second image?


Creating simple maps to view on Mobile devices?

My organization wants to create a few maps that will be interactive and viewable via phones (android, iphones,etc) and ipads.  We already have a solution using Geocortex (Silverlight) for browser which cannot display on most devices.  I've been looking into HTML5, Javascript and ArcGIS Online.  What I need is something that displays nicely for mobile use and that is easy to set up. Looking at Javascript is slightly intimidating to me and ArcGIS Online maps don't display well in the phone's browser.  I do not come from a Comp Sci or development background so if there's already an existing interface that makes it easily to display for mobile I'd prefer that rather than messing with code. The map would contain point features with hopefully a pop-up containing a picture and a short description of the property.   I'm pretty computer savvy but I'd like this to be as painless as possible.  Are there any other interfaces that exist that make this easier?  The mobile map will be only for viewing purposing, no editing or capture.  I'm open to looking at other platforms outside of ArcGIS as well.  As an added bonus (but not mandatory), I've been looking into Story Maps and plan on using one in the future, specifically the Short List. However, I don't see this working out for a mobile device as its very picture heavy and would crowd the display. If anyone has any other alternative ideas I'm open to them!  I've been looking at Leaflet and Mapbox as a possible solution for mobile use - there is plenty of documentation - but still a lot of code!  For now we've gained access to HTML5 viewer for geocortex and will be using it for our mobile sites. If there are any other alternatives I haven't already listed above - that are about on-par with ArcGIS Online for ease of use for non-programmers, I would be interested to hear about them.


All checks pass - Mail still goes into spam

I got a self-hosted mail server using nethserver.  No matter what I do, the mail I send still goes into the unwanted mail on Gmail and Office365.  It's exclusively personal mail.  My IP nor my Domain are on any blacklist.  check-auth@verifier.port25.com results:     SPF check:          pass "iprev" check:      pass DKIM check:         pass SpamAssassin check: ham  HELO hostname:  i.domain.tld Source IP:      xxx.xxx.xxx.xxx mail-from:      info@domain.tld  ---------------------------------------------------------- SPF check details: ---------------------------------------------------------- Result:         pass ID(s) verified: smtp.mailfrom=info@domain.tld  DNS record(s):     domain.tld. 60 IN TXT "v=spf1 ptr ip4:xxx.xxx.xxx.xxx/32 a:i.domain.tld a:mail.domain.tld -all"     xxx.xxx.xxx.xxx.in-addr.arpa. 60 IN PTR domain.tld.     domain.tld. 60 IN A xxx.xxx.xxx.xxx   ---------------------------------------------------------- "iprev" check details: ---------------------------------------------------------- Result:         pass (matches domain.tld) ID(s) verified: policy.iprev=xxx.xxx.xxx.xxx  DNS record(s):     xxx.xxx.xxx.xxx.in-addr.arpa. 60 IN PTR domain.tld.     domain.tld. 60 IN A xxx.xxx.xxx.xxx   ---------------------------------------------------------- DKIM check details: ---------------------------------------------------------- Result:         pass (matches From: info@domain.tld) ID(s) verified: header.d=domain.tld  Canonicalized Headers:     to:check-auth@verifier.port25.com'0D''0A'     from:Raylin'20'<info@domain.tld>'0D''0A'     subject:Werkt'20'dit?'0D''0A'     date:Fri,'20'12'20'Apr'20'2019'20'12:18:45'20'+0200'0D''0A'     dkim-signature:v=1;'20'a=rsa-sha256;'20'c=relaxed/relaxed;'20'd=domain.tld;'20's=default;'20't=1555064325;'20'bh=1RpqxxjguSMkMVzn75FFHRz1u2KEM0ZVTOYlX8HAKE8=;'20'h=To:From:Subject:Date:From;'20'b= ---------------------------------------------------------- SpamAssassin check details: ---------------------------------------------------------- SpamAssassin v3.4.0 (2014-02-07)  Result:         ham (-2.0 points, 5.0 required)   pts rule name              description ---- ---------------------- -------------------------------------------------- -1.9 BAYES_00               BODY: Bayes spam probability is 0 to 1%                             [score: 0.0000]  0.0 URIBL_BLOCKED          ADMINISTRATOR NOTICE: The query to URIBL was blocked.                             See                             http://wiki.apache.org/spamassassin/DnsBlocklists#dnsbl-block                              for more information.                             [URIs: domain.tld] -0.0 SPF_PASS               SPF: sender matches SPF record  0.0 HTML_MESSAGE           BODY: HTML included in message -0.1 DKIM_VALID_AU          Message has a valid DKIM or DK signature from author's                             domain -0.1 DKIM_VALID             Message has at least one valid DKIM or DK signature  0.1 DKIM_SIGNED            Message has a DKIM or DK signature, not necessarily valid   does anybody have an idea what the cause of this is?


I usually compile .tex files online. Though I will be without Internet connection for the following days and yet absolutely must work with some .tex stuff.  Now I know this is the stereotypical question that warrants a "UTFSE" response, but believe me when I say I have been fiercely looking for "tutorials" on how to do that on the Internet but to be completely honest, so far they couldn't be less useful for me --- all go over my head. I am not a programmer and just can't follow the lingo. MikTeX site is down. I downloaded proTeXt but that seems to be for Linux; "pdflatex mydocument.tex" did not work, there was no file such as pdflatex on any of the folders in proTeXt. As per someone else's suggestion, I am downloading TeX Live, but it is looking like it ain't gonna be straightforward.  Can anyone break it down to me plain and simple?


Is there a reference of all the user data structures used over linux (gcc)

where is the type size_t  defined what are the other types like this , Is there a reference of the all the user defined  types and data structures in linux (gcc) . for example a reference guide on    sockaddr_in6   sockaddr_in  mm_struct  pci_dev   sk_buff    tq_struct   ...


how prove $\sum_{n=1}^\infty\frac{a_n}{b_n+a_n} $is convergent?

Let$a_n,b_n\in\mathbb R$ and $(a_n+b_n)b_n\neq 0\quad \forall n\in \mathbb{N}$. The series $\sum_{n=1}^\infty\frac{a_n}{b_n} $ and $\sum_{n=1}^\infty(\frac{a_n}{b_n})^2 $ are convergent.  How to prove that$$\sum_{n=1}^\infty\frac{a_n}{b_n+a_n} $$ is convergent.  Thanks in advance


In higher-order derivatives, such as $\frac{d^2y}{dx^2}$, why is the exponent on $d$ in the numerator and $x$ in the denominator?

Why are the exponents in higher order derivatives the following: $$ \frac{d^2y}{dx^2} $$  Why is the exponent on the $d$ in the numerator and $x$ in the denominator?


I am calling on those of you who are bilingual in both Ruby and PHP. I am using an API call to place an order. Most of the parameter are strings. However, the API call also allows a file parameter (called 'FILE' in API docs) to upload a pdf or word document. Can I simply use File.open(...) as a parameter value for the call? I do not see anything about multi-part forms in the API documentation. What is the Ruby equivalent of “@packingslip.doc” in the example below?  From the API docs, here is a description of the file parameter:  Name: packingslip,  Description: Packing Slip,  Format: FILE – (Only Pdf,docx and doc files are allowed)  From the API example in PHP: (most parameter omitted for clarity)  $postfields["packingslip"] = “@packingslip.doc”;  $ch = curl_init(); curl_setopt($ch, CURLOPT_URL, $url); curl_setopt($ch, CURLOPT_POST, 1); curl_setopt($ch, CURLOPT_TIMEOUT, 20); curl_setopt($ch, CURLOPT_FRESH_CONNECT, 1); curl_setopt($ch, CURLOPT_SSL_VERIFYPEER, false); curl_setopt($ch, CURLOPT_SSL_VERIFYHOST, false); curl_setopt($ch, CURLOPT_HEADER, 0); curl_setopt($ch, CURLOPT_RETURNTRANSFER, 1); curl_setopt($ch, CURLOPT_POSTFIELDS, $postfields); $data = curl_exec($ch); curl_close($ch);   I would like to be able to call the API with Net::HTTP.post (as I have been able to without the file parameter):  @result = Net::HTTP.post_form(uri, {key: key,                                        hash: hash,                                       method: 'addorder',                                       email: 'email@myemail.com',                                       address: user.address,                                       city: user.city                                       file: ??? }).body


Newton's third law does not apply to the kinetic energy formula?

Here is a classic problem:     A 60kg boy and a 40kg girl are sitting in front of each other on skateboards on a frictionless horizontal surface. The boy pushes the girl and the girl gains a velocity of 0.3m/s during the 0.5s the boys hand was in contact with her. What is the boy's resulting velocity?   Considering Newton's Third Law, the best way is to find the total force applied and rearrange the formula to find the boy's speed.  Newton's Law Method:  $F = m*a$  $a=\frac{0.3m/s}{0.5s}$  $F = 40kg * 0.6m/s^2$  $F = 24N$  Therefore the boy's speed will be:   $\frac{24N}{60kg} = a$  $a = 0.4m/s^2$  $v = 0.4m/s^2 * 0.5s$  $v = 0.2m/s$  Kinetic Energy Method:  $E_{k}=\frac{1}{2}*m*v^2$ the girl's kinetic energy  $E_{k}=\frac{1}{2}*40kg*(0.3m/s)^2$  $E_{k}=1.8J$  Since every action has an equal and opposite reaction the boy should have the same amount of kinetic energy.  $E_{k}=\frac{1}{2}*60kg*(0.2m/s)^2$  $E_{k}=1.2J$  As you can see, using Newton's Third Law, the kinetic energy was not the same. So what's going on here? I thought that in this case they should both have the same amount of kinetic energy due to Newton's Law. I must be missing something since there is more energy going in one direction than the other after meeting. My book used the first method as the answer and, well, it feels wrong.


Rational numbers as vectors in infinite dimensional space with the basis $( \log 2,\log 3, \log 5, \log 7, \dots, \log p, \dots) $

Since every natural number can be represented as $a=2^{n_1}3^{n_2}5^{n_3}7^{n_4}\cdots p_k^{n_k}\cdots$ it makes sense to represent natural numbers by vectors, using the properties of logarithms:  $$\log a=n_1 \log 2+n_2 \log3+n_3 \log5+\cdots$$  This space appears to be similar to the usual Euclidean space if we extend it to an infinite number of dimensions.   If we allow negative coordinates, we can also put all rational numbers in this space. For example, here is part of the plane $(\log 2, \log 3)$:       Does this space have any application in number theory? If it is studied, then how is it usually defined? Are the usual Cartesian vector dot product and the usual Euclidean norm used? Or does it make sense to use a different norm (for example, taxicab norm)?


Why is expected value of random variable equal to mean

While learning about Random variables I came across the mean of random variable X.  The definition says that the expected value of random variable E(X) = Mean of Random variable X  I am not able to understand why is that so. Can any one please help me with it


Since the Players's handbook only mentions that when you mount, the mount's initiative overlaps with yours, I'm wondering if can you move your mount (for example) 30 feet, attack and then move the remaining 30 feet?


I installed 12.04 over a prior (experimental) install of 10.10. Somehow in the setup, I did not specify that /home be set to a separate (extended) partition (/dev/sda7). So the install set up /home on the /root partition, and I am now in a right serious muddle.  I would like to   1) tell it to set /home to sda7 (permanently so that it boots each time that  way), and  2) move my existing /home from my old workhorse 10.04 to /home on this 12.04 computer. (I remember that one creates a tarball on the source computer, copies it over to the target computer, then extracts the tarball on the new computer. But I don't know, and don't seem to find, the correct steps to do this.  How to resolve this?  Any guidance will be much appreciated. I use my computer heavily, but don't seem to have many problems and consequently never get much past the noobie stage of Linux in terms of using the terminal, so your kindness in laying out the steps will be most helpful.


The latest stable kernel (4.15) is supposed to fix some issues with my t300 chi Bluetooth touchpad keyboard. But my current version is 4.13.0-36-generic. I tried using UKUU but this doesn't seem to provide the option I want to try. Help would be appreciated to install this version if it is possible. Thanks.


Let $X_1, X_2, \ldots , X_n$ be a random sample from a distribution with the following pdf  $$f(x|\theta) =  \begin{cases} 1/(\theta_2−\theta_1), &\quad\text {for}\quad \theta_1 \leq x\leq \theta_2\\ 0 &\quad\text { otherwise}\quad \end{cases}$$ Suppose that $\theta_1$ and $\theta_2$ are unknown.  How would I go about writing the likelihood function for this distribution on $\theta_1$ and $\theta_2$.


The Taylor series of the squared logarithm

Prove that the Taylor series about the origin of the function $[\log(1-z)]^2$ is given by    $$\sum_{n=1}^{\infty} \frac{2H_{n}}{n+1} z^{n+1}$$   where    $$H_{n} = \sum_{j=1}^{n}\frac{1}{j}$$   is the $n$-th partial sum of the harmonic series.   (Hint: Write $\log(1-z)$ as a power series for $|z| < 1$ and use Cauchy products for $[\log(1-z)]^2$)   I've been working on this question since last night and I've been trying to follow the hint and look at the derivative of $\log(1-z)$ and then integrate that, but all attempts have been futile.   Really lost here...