I just bought a Nokia 6.1 phone. On the whole I like it, but today this popped up:    The app is called "NPS" ("Net Promoter Score"?) version 9.0010.50. I found a discussion of it , but the only way mentioned to disable it doesn't work (my "User Experience Program/Diagnostic Report" option is already off).  I don't like my time being wasted, but I like even less the idea that the phone is "phoning home" to yet another company.  Any suggestions for how to disable or get rid of this app? (I'm tempted to respond as negatively as possible to every question the app poses...)
I'm using a Samsung I9000 and I have some annoying apps that came pre installed by the phone vendor, like a music store, a custom web browser and other memory leaking apps.  Those crappy apps can't be uninstalled neither by Manage applications tool, nor by editing the apps tiles in the front menu.  I guess I have to be a root user or something to get rid of those apps, but I don't know how.
Do you think there is a big difference in for...in and for loops? What kind of "for" do you prefer to use and why?  Let's say we have an array of associative arrays:  var myArray = [{'key': 'value'}, {'key': 'value1'}];   So we can iterate:  for (var i = 0; i &lt; myArray.length; i++)   And:  for (var i in myArray)   I don't see a big difference. Are there any performance issues? How to partition an encrypted disk Why is usable RAM less than total RAM? My girlfriend bought a laptop last week. It's a core 2 duo with 4 GB  We installed vista 64bit, and one of the first things we did was right click on "My computer" to see gthe properties. Immediately we noticed something strange about her RAM, the line said: Installed memory (RAM): 4,00 GB (3,68 GB usable)  I told her not to worry, thinking it must be something about the laptop hardware (considering her vista installation came from the same DVD as mine, and I never noticed anything like that on my 4 GB desktop). One hour ago, it got worse. We looked at Properties again, and it now says: Installed memory (RAM): 4,00 GB (2,98 GB usable)  What does that mean? Are those 1,02 GB missing or being used by the system?  EDIT: There is a possibility that the sytem information is wrong. I just noticed that it reports an intel T6500 processor, when it's actually a T6400.  How can I find out how much RAM is really available to the system?  EDIT2: Checking the resource monitors, it says 1003 MB are reserved for the hardware. Is that good or bad? Thanks How can one differentiate between "who" and "whom"? Internet Accounts spontaneously forgets passwords and I can't reauthorize them I've had this problem before, but I was able to resolve it that time. macOS 10.13.4, everything up to date. Yesterday, Internet Accounts forgot my LinkedIn password and would not reauthenticate. Today, it forgot my Facebook password.   I've tried:   App specific password. Removing the account and re-adding it. Turning off 2-factor authentication. Deleting associated entries from Keychain. Logging out of iCloud, deleting Keychain entries, removing and re-adding the account, then logging back in.   First of all, what the hell—why does this keep happening?! Secondly, what else can I do to fix this short of reinstalling macOS? Intersection of Adiabatic curves Can paths of two adiabatic process intersect on a plot? This question is for both reversible and irreversible processes. There are some , but they mostly address only for reversible adiabatic processes. Also, I want a physical interpretation of the processes that is, if they don't intersect then why don't and what it would be like, physically for a system. Show that function $f$ has a continuous extension to $[a,b]$ iff $f$ is uniformly continuous on $(a,b)$ Let $E \subset F \subset X$ and $f:E\rightarrow Y$. We say that the function $g:F\rightarrow Y$ is an extension of $f$ if $g(x) = f(x)$ for all $x \in E$.   Let $f: (a, b) \rightarrow \mathbb{R}$. Show that $f$ has a continuous extension to $[a, b]$ if and only if $f$ is uniformly continuous on $(a, b)$.   $(X,d)$ is a metric space.  Hint: To prove $\Leftarrow$ start by showing that $f$ maps Cauchy sequences to Cauchy sequences. Then how should you define $g(a)$ and $g(b)$?  The $\Rightarrow$ part of the proof was quite simple, but even with the hint, the other way seems a bit difficult. Doesn't the first part of the "hint" follow from the way we defined $f$? If so, how do I prove this? Help/Hints appreciated! How to get a list of current open windows/process with Java? Does any one know how do I get the current open windows or process of a local machine using Java?    What I'm trying to do is: list the current open task, windows or process open, like in  Windows Taskmanager, but using a multi-platform approach - using only Java if it's possible. Where did dedicated.abac.net. come from in my rDNS and PTR records? So I followed this guide to the letter:   I did so for 3 domains.  When I "test" the records and enter: host 64.150.176.81 on my linux machine, it shows me 81.172.150.64.in-addr.arpa domain name pointer 64-150-172-81.dedicated.abac.net.  when it should be showing me 81.176.150.64.in-addr.arpa domain name pointer 64-150-172-81.example.com.  Has anybody encountered a similar problem?  I am hosting with codero, not abac.net btw. Is there a built-in method to compare collections? I would like to compare the contents of a couple of collections in my Equals method.  I have a Dictionary and an IList.  Is there a built-in method to do this?  Edited: I want to compare two Dictionaries and two ILists, so I think what equality means is clear - if the two dictionaries contain the same keys mapped to the same values, then they're equal. How do I theme the Nautilus background image? I want to change the background image in the Nautilus file browser. My idea is to put my own style in the background. I'm using Ubuntu 11.10 and Nautilus is version 3.  I know that I have to change the nautilus.css file of the theme, but the problem is that there is not a parameter for the background. I just want to apply an image but I can't find the file or parameter to change it.  The CSS file is in the directory /home/UserName/.theme/MyTheme/gtk-3.0/apps. I've changed the nautilus.css file. I wrote two new lines using CSS style but I don't know where the correct place is to put it. The lines are:   background-image: url("carbon.jpg"); background-repeat: repeat;   Obviously I put the image called carbon.jpg in the same directory of nautilus.css, but this change doesn't work because I need to know whichs class displays the Nautilus file browsing frame. If I find this class I guess that this code will work.  If someone knows how to do it, please tell me because I really want to make this change. "India has" or "India have" Change style of labels of Tikz nodes of a given style How can all labels of a given type of node be restyled in Tikz?  Imagine that there are nodes of different styles, and that only the nodes of style X should have red labels. Is this possible without having to change all labels one by one of nodes of style X? I've already done a lot of searching (in particular: ) to try to prove this statement:      $f: A \to B$ is injective if and only if it has a left inverse. [I'm going to also assume $A$ and $B$ are nonempty.]   My attempt so far:     $\Leftarrow$ Suppose $f$ has a left inverse and $f(a_1) = f(a_2)$ for    $a_1, a_2 \in A$. Then there is a function $g: B \to A$ such that   $g\left(f(a_1)\right) = a_1$ and $g\left(f(a_2)\right) = a_2$. Since   $g$ is well-defined, it follows that $g\left(f(a_1)\right) =  g\left(f(a_2)\right)$, and hence $a_1 = a_2$.         $\Rightarrow$Now   suppose $f$ is injective. Then $f(a_1) = f(a_2) \implies a_1 = a_2$.   Furthermore, since $A$ is nonempty, there is an element $x \in A$.   Define $g: B \to A$ by  \begin{equation*} g(b) = \begin{cases}  f^{-1}(b), &amp; b \in \text{Im}(f) \\ x, &amp; b \in A \setminus  \text{Im}(f)\text{.} \end{cases} \end{equation*} This mapping is   well-defined, since if $f$ is injective, $f^{-1}(b)$ is unique.   My main question: does this imply that if $f: A \to B$ is injective that any mapping $g: \text{Im}(f) \to A$ is bijective? Otherwise, I don't understand why we can even use $f^{-1}$ on an element. [Please read the link above for more details - in proof 1.] How do I pass a function as a parameter to in elisp? I'm trying to pass one method to another in elisp, and then have that method execute it.  Here is an example:  (defun t1 ()   "t1")  (defun t2 ()   "t1")  (defun call-t (t)   ; how do I execute "t"?   (t))  ; How do I pass in method reference? (call-t 't1) Group theory proof of existence of a solution to $x^2\equiv -1\pmod p$ iff $p\equiv 1 \pmod 4$ I've read through the elementary proof of why there exists a solution $x$ to $x^2\equiv -1\pmod p$ iff $p\equiv 1 \pmod 4$ for $p$ an odd prime. Is there a group theory generalization for this fact as well? Enumerated list with square brackets I want to make an enumerated list in the following format:  [1] foo foo [2] foo foo ...    How I can do that using enumerated lists? I have tried the following:  \begin{enumerate}[\left[ 1 \right]]   but it does not work. What is the importance of the Diophantine inequality $\frac{1}{p} + \frac{1}{q} + \frac{1}{r} > 1$? In Humphreys' book  Introduction to Lie algebras and Representation Theory(3rd printing, p.62), the Diophantine inequality $$\frac{1}{p} + \frac{1}{q} + \frac{1}{r} &gt; 1$$ appeared while classifying all Coxeter graphs of irreducible root systems. Under the assumption $p \geq q \geq r \geq 2 $, the possible triples turn out to be $(p,2,2), (3,3,2),(4,3,2),(5,3,2)$, which correspond to the Coxeter graph $\text{D}_{p+2}, \text{E}_6, \text{E}_7, \text{E}_8$, respectively.  It seems quite straightforward to solve the inequality in positive integers, but Humphreys said that      This inequality, by the way, has a long mathematical history.   without further comment. So I want to know if this Diophantine inequality has any important significance, or if it has appeared in other context (maybe relevant history) before. Get the coordinates from ContourPlot and RegionPlot How could I go about detecting (returning true/false) whether an ArrayList contains more than one of the same element in Java?  Many thanks, Terry  Edit Forgot to mention that I am not looking to compare "Blocks" with each other but their integer values. Each "block" has an int and this is what makes them different. I find the int of a particular Block by calling a method named "getNum" (e.g. table1[0][2].getNum();