Prevent GMail marking replies to clients as promotions or updates (not spam)

Edit: my question was marked as duplicate of "How can I prevent my mail from being classified as spam?". My messages are not classified as spam but updates or promotions. Setting SPF, domain keys, not using fake address or putting unsubscribe link was solution to question of which my question is allegedly duplicate.  I run a website with a simple contact form. Client asks a question, system sends it via email to official company's mail, and somebody answers the question. Reply is sent directly to client's email (TO field, not CC or BCC) from company's main email address.   We have a lot of complaints that we don't reply to emails, but we do. After short investigation it came out that our replies are marked by GMail as promotions or updates and are not shown in clients' inboxes.  Problem is we do not send adverts etc, we have commercial email account and provider doesn't add anything to our emails. Replies are send via provider's mail server.  Typical message looks like:     TO: client's-mail@gmail.com       FROM: office@company-domain.com      Re: Question asked by contact form      Hello,   This is my reply to client, written by human.      Jane Doe, Company-name   Street 12345   Postal-Code City Country   tel.+00 000 000 000   fax: +00 000 000 000   www.company-domain.com      The information transmitted is intended only for the person or company to which it is addressed and   may contain confidential and privileged material.  Any   review,dissemination, retransmission, or other use of, or taking of   any action in reliance upon, this information by persons or companies   other than the intended recipient is prohibited. If you received this   in error, please contact the sender and delete the material from any computer.      -----here is the same info about about privileged materials, but in polish----      7 nov 2014 o 18:14 Client  wrote:      Hi, this is my question.   What shall I do to prevent GMail from marking my messages as promotions and put my messages to client's inbox? Why message like this is classified as promotion anyway? We do not send newsletters or send mass correspondence.


It is well know that $SO(3)$ is a 3-dimensional Lie group. My question is  $SO(3)$ don't has 2-dimensional Lie subgroups?


force:recordData fetch the fields from controller

Ho to get the force:recordData fields in javascript controller?  cmp:   <aura:attribute name="recordId" type="Id" /> <aura:attribute name="contact" type="Object"/> <aura:attribute name="simpleContact" type="Object"/>  <aura:handler name="init" value="{!this}" action="{!c.createRecord}"/>  <aura:attribute name="recordError" type="String"/>     <force:recordData aura:id="contactRecordLoader"                   recordId="{!v.recordId}"                   fields="Id,Name,FirstName,AccountId"                   targetRecord="{!v.contact}"                   targetFields="{!v.simpleContact}"                   targetError="{!v.recordError}"                   />     JS:  ({     createRecord : function(component, event, helper) {         var con = component.get("v.simpleContact");                console.log("THis is contact FirstName "+con.FirstName);            } })   Error: I am getting null "console.log("THis is contact FirstName "+con.FirstName);   "


Let $E/F$ be a field extension and $a \in E$ ,$a$ algebraic over $F$. Prove that if the degree of the minimal polynomia of $a$ is an odd number then $F(a)=F(a^2)$.  The first step is to consider the extensions $F \leqslant F(a^2) \leqslant F(a)$.  We need need to show that $[F(a):F(a^2)]=1$  If  $[F(a):F(a^2)]=m>1$ then $m<n$ and $m=2k_0+1$ where $n=deg(irr(a,F))$($m$ cannot be an even number)and $[m/2]>k_0>1$.  So we have that $[F(a^2):F]=n/m=s$ for some $s<n$ is an odd number.  From the above  we see that  $deg(irr(a^2,F))=n/m=s$.  From this point i don't know how to proceed to derive a contradiction.  Can someone help me with this?


The Imitation Game - 10 men checking one setting a minute

In the movie when Cumberbatch said the following phrase      There are 159 million, million, million possible Enigma settings. All   we had to do was try each one. But if we had 10 men checking one   setting a minute for 24 hours every day and seven days every week   the sentence      10 men checking one setting a minute   does it mean 10 men checking on single setting in one single minute, or that each of the 10 men is checking a setting in a minute, which will make 10 settings for one minute?


Getting java edition, and play with a person on Bedrock Edition

My sister plays Minecraft: Bedrock Edition on a phone, I want to get Java edition but my sister is on Bedrock. Can we still play with each other? Or can I only play with people on Java Edition?


Is there a difference between an "object" and a pointer to some kind of struct?

All of my initial programming experience has been in object-oriented languages (Java, Python). I am now learning C, and it seems that there are still things that resemble objects.   Say for example, a FILE pointer created with the standard C library. This is just a pointer to the memory location of a struct. Is this essentially the same thing as an object in OO languages?  There are existing questions asking about the difference between a struct and a class, but I'm asking about how a program uses those things. A struct is used or accessed via a pointer, while an object is a particular instance of a class. In this sense, it seems that a class is more general than a struct. Though I really only added this paragraph to prevent this questions from being marked as a duplicate, and it strays from my original question.   If a FILE pointer is, indeed, comparable to some FILE object in a different language, then where is the key difference between how that "thing" called FILE will be handled in a object-oriented language vs a non-object-oriented language. Seems like the line starts to blur.


I'm trying to get my iso ready for my newbuild that doesn't have an o/s, but can't find the right download for my new processor.   When I download from my old computer the file name includes the processor (AMD 64) on this computer, which, I don't think would work on the new one (i7) I want it for.  How can I find the right one, please? Thanks


Finding an old savings account in Minneapolis Minnesota

I had a Franklin savings account opened in Minneapolis Minnesota over 30 years ago and I believe that I left money in it, how can I find out if I still have money?


Tensor calculus - Action of a 1-form on vector : changing of coordinates

Sorry for this naive question, but I try in this moment to revise my classis. Could you help me please to demonstrate : $$\frac{\partial T^{\prime\mu}}{\partial x^{\prime \alpha}}=\frac{\partial}{\partial x^{\prime \alpha}}\left(\frac{\partial x^{\prime \mu}}{\partial x^{v}} T^{v}\right)$$ i.e by using a changing of coordinates between $x^{\mu}$ and $x^{\prime\mu}$. $T^{\mu}$ represents the contravariant components of a "vector" (I mean a tensor of rank 1). That demostration would be done by  proving that : $$T'^{\mu}\text{d}x^{\nu}=T^{\nu}\text{d}x^{\prime\mu}$$ How to justify this equality if I apply a 1-form $\text{d}x^{\mu}$ or another 1-form $\text{d}x^{\prime\mu}$ on a vector $T$ ?


In Python, how do I get a function name as a string, without calling the function?  def my_function():     pass  print get_function_name_as_string(my_function) # my_function is not in quotes   should output "my_function".  Is such function available in Python? If not, any ideas on how to implement get_function_name_as_string, in Python?


Reprojecting MODIS Swath data to WGS84 using GDAL

Im new to GIS and now working with MODIS04L2 Aerosol Optical Thickness image. I need to reproject the image to other coordinate system such as WGS84 for later work but now Im stuck with it. I have try two ways:   Write my own code using python with gdal lib: I follow the tutorial which using GCPs point as paramater for gdalwarp command. The problem is I can't get the GCPs point. The dataset.GetGCPs() function return a zero-length array of GCPs. Using programs like HEG tool, MRT tool but both of it have issues. When I open MODIS file (with extension .hdf) with MRT tool I get the error "Error in Module: ReadHdrFile".   I download MODIS from ladsweb.nascom.nasa.gov/data/search.html with parameter: Satellite/Instrument:Terra, Group: Terra Atmosphere Level 2 Product, Products: MOD04L2_Leve 2 Aerrosol and Collection: MODIS Collection 5.1. I want to extract subdataset "mod04:Image_Optical_Depth_Land_And_Ocean" from hdf MODIS file to geotiff which reprojected to WGS84.  The sample hdf file  The log from gdalinfo:  Anyone here has experiment with this process?    It turns out that the gdal package on my computer is out of date so I cannot get the GCPs via gdalinfo. I updated the gdal to 1.10.0 and now everything is working fine.


Block computer from joining a domain if it has the same name as another computer object in ADUC

At work we have a Domain Controller running Server 2008 R2. Our desktop support group has the ability to join computers to the domain using their network credentials. We are now running into a problem where if the name of the computer that is being joined is the same as an existing computer on the domain, the existing computer will get a "The trust relationship has failed..." error and will not authenticate at all unless someone logs in as a local admin, changes the computer name and rejoins it to the domain.  I want to make it so that Desktop Support can only join computers with unique names to the domain. If the name already exists on the domain the operation should fail. Looking through TechNet it looks like this functionality exists but I can't seem to find out how to enable it.  Any ideas?


Proving that $\sum\limits_{k = 1}^n k! \cdot k = (n + 1)! - 1$

Someone may have already asked this question, but I was not able to find it.     Prove that   $$\sum_{k = 1}^n k! \cdot k = (n + 1)! - 1$$   I tried to use the method that is generally applied to geometric series, i.e. writing $S_n - \phi(\cdot)S_n = \dots$ in such a way that almost all terms cancel out. The problem is that in this case it does not work because there is nothing constant in the series' terms.


Please i want to understand this code, according to my understanding of super in class base programming i know its being used on the base class to access methods and attributes of the base class but here like in this code below   class Base:    def __init__(self,name, age):        self.name = name         self.age = age  class Sub(Base):         def __init__(self,name, age, first_name):         super().__init__(name, age)         self.first_name = first_name   But i cannot understand this code below seeing the super being called on the same class with the init function, what does this mean and how does it affect the program   class MyClass(object): def __init__(self):     super(MyClass, self).__init__()     self.numeric_var = 1


What is the simplest SQL Query to find the second largest value?

What is the simplest SQL query to find the second largest integer value in a specific column?   There are maybe duplicate values in the column.


regexp in javascript console.logging out characters instead of the entire pattern

I'm trying to use regexp in javascript to match a group of patterns but for some reason when I'm trying to console.log the group, it's just logging out characters instead of the entire pattern. What I am doing wrong? Also, the g flag is required for this pattern.  var string = "group1group2group3 group4group4group4 group1group2group3"; var matches = string.match(new RegExp("(group1)(group2)(group3)", "g"));  console.log(matches[0][0]+matches[0][1]+matches[0][2]);    Result:    gro   Expected Result:   group1group2group3


Using induction with $\sum_{i=0}^{k-1}2^i=2^k-1$

$\displaystyle\sum_{i=0}^{k-1}2^i=2^k-1$ for all $k \in\Bbb N$.  Clearly, the first step here is easy. You can start with k=1 and solve to get  $2^0=2^1-1$.  What is a bit more challenging is the induction step. I don't even know where to begin here. Where would I even begin?


Are there versions of Unix that don't have awk in default install?

Are there versions of Unix that don't have awk installed by default?   I am fine with an answer containing some really old outdated Unix variant which predates awk's creation; but would ideally prefer some specialist niche stripped down embedded modern one which excludes awk by design from core install.  (the impetus for asking: someone claimed that an SO answer using nothing but standard unix command line tools sans awk is useless, since every Unix has awk. I am pretty sure that last part is wrong, but don't recall any specific examples, just the fact that they exist).


I have a mantaflow liquid simulation in the 2.92 version of Blender. This simulation starts at the beginning of the animation but stops before the animation ends. When the animation plays past the last frame of the fluid sim, the domain becomes rendered as a giant cuboid because there is no more fluid data. I would like the fluid simulation to stay frozen on its last frame, rather than be a cuboid for the rest of the animation.  I know that it is possible to make a duplicate of the simulation with the fluid modifier applied on the last frame of the sim, but this causes shading inconsistencies and I would rather not do that.  Instead, is there a way to freeze the fluid simulation on the last frame without making duplicate objects? Possibly manipulating data, or a setting that I am not aware of?


How can I get rid of mouse lag under Ubuntu?

I experience mouse lag although the graphic card is recognized by the os. (I already had it on 15.10 and upgraded to 16.04). The mouse lag is not firefox or browser dependent. Is there anything I can do about it, without doing a clean install of my ubuntu system?  nuc@nuc:~$ sudo lshw -c video [sudo] password for nuc:    *-display                       description: VGA compatible controller        product: Haswell-ULT Integrated Graphics Controller        vendor: Intel Corporation        physical id: 2        bus info: pci@0000:00:02.0        version: 09        width: 64 bits        clock: 33MHz        capabilities: msi pm vga_controller bus_master cap_list rom        configuration: driver=i915 latency=0        resources: irq:45 memory:f7800000-f7bfffff memory:e0000000-efffffff ioport:f000(size=64)


The inequality $$\boxed{e^3 > 20}$$ is occasionally useful, including in the answer I wrote for  that comes from a GRE subject exam.  This bound is relatively tight: $$e^3 = 20.08553\!\ldots ,$$ a relative error of $< \frac{1}{200}$, which means establishing the inequality might be a little delicate. In a comment under the linked answer, TheSimpliFire posed the following natural question:     What is an efficient way to prove the inequality $e^3 > 20$ by hand?   (I would have guessed that this had been asked before, but neither the internal search nor searchonmath turned up any duplicates.)  A naive method is to use the series truncation $$e = \sum_{k = 0}^\infty \frac{1}{k!} > 1 + 1 + \frac{1}{2} + \frac{1}{6} + \frac{1}{24} + \frac{1}{120} = \frac{120 + 120 + 60 + 20 + 5 + 1}{160} = \frac{163}{60} .$$ Then, it suffices to prove that $\left(\frac{163}{60}\right)^3 > 20$, which is equivalent to $4\,330\,747 > 4\,320\,000$. This last step could even be outsourced to an enthusiastic primary school student, but it involves cubing a three-digit prime and so is slightly tedious.  One might try to refine this method by looking for rationals that are easier to cube, but the only rational numbers satisfying $\sqrt[3]{20} < q < e$ with denominator $< 60$ are $\frac{106}{39}, \frac{125}{46}, \frac{144}{53}$. It's again straightforward to show that the cube of any of these $> 20$, but doing so is no faster than cubing $\frac{163}{60}$ and one then has the additional burden of showing the number is $< e$.  One could also search for  for the difference $e^3 - 20$ (or to the difference corresponding to some other inequality equivalent thereto), by which I mean evidently positive definite integrals equal to that difference.  For example, some experimentation yields the definite integral \begin{align} &\int_1^2 - \frac{(x - 1) (2 - x) p(x) \,dx}{20 x (x^2 + 1)} \\ &\qquad = \int_1^2 \left(-\frac{1}{2} x^3 + \frac{63}{20} x^2 - \frac{153}{20} x + 9 - \frac{3}{x} - \frac{2 x}{x^2 + 1} \right) dx \\ &\qquad = 3 - \log 20 , \end{align} where $p(x) = 10 x^4 - 33 x^3 + 44 x^2 - 45 x + 30$. Computing gives that all of the coefficients of $p(x + 1)$ are positive, so $p$ is strictly positive for $x \geq 1$, and thus the integrand is strictly positive on $(1, 2)$. So, the integral is positive, that is, $3 > \log 20$, which is equivalent via exponentiation to $e^3 > 20$. This is again elementary, but not terribly fast.  Remark Incidentally this latter method lets us extract cheap but relatively sharp rational bounds on $\log 20$: Since $2 < x (x^2 + 1) < 10$ on the interval of integration, our integral is bounded by polynomial integrals: $$\int_1^2 - \frac{(x - 1) (2 - x) p(x) \,dx}{20 \cdot 10} < \int_1^2 - \frac{(x - 1) (2 - x) p(x) \,dx}{20 x (x^2 + 1)} < \int_1^2 - \frac{(x - 1) (2 - x) p(x) \,dx}{20 \cdot 2} .$$ Integrating gives $$\frac{163}{84000} < 3 - \log 20 < \frac{163}{16800},$$ and rearranging gives the bounds $$2.99027\!\ldots = \frac{251185}{84000} < \log 20 < \frac{251837}{84000} = 2.99805\!\ldots .$$


Screenshot+upload software for Ubuntu 18.04

I'm looking for a screenshot and upload tool similar to Gyazo and ShareX, that allows me to take screenshots of a certain area, or a whole window, etc and then gives me a link that it was uploaded to after.  Does anyone know of any decent software for this on Ubuntu 18?


I was doing some experiment about resource-accessing. By mistake, I executed this command, $ sudo mv /etc/passwd /etc/passwd.bak Then I could not execute any command with privilege(eg. sudo mv /etc/passwd.bak /etc/passwd). When I shut the system down, I could not boot it any more. Afterwards, I restored the passwd file with a LiveCD.  Any other approaches could make it?


Prove that $⌊ a ⌋ + ⌊ a + 0.5 ⌋ = ⌊ 2 a ⌋ $ for every $a \in \Bbb{R} $

I know there are two cases here: $𝜙 ≥ 0.5$  and $𝜙 < 0.5$.  Please help. Thanks.


Entire function $f(\frac{1}{p})=\frac{1}{1+p}$ for all prime $p$.

I'm working on this problem  "Find all entire functions $f(\frac{1}{p})=\frac{1}{1+p}$ for all prime $p$."  My approach is using identity theorem. But in this case it does not seem good. We have $$f(1/p)=\frac{1/p}{1+1/p}$$ So naturally, I set $g(z)=f(z)-\frac{z}{z+1}$. Consider the plane excluded a circle around $z=-1$. Then $g$ is analytic in that region. And $g=0$ on the set of $\{1/p\}$ which has a limit point. So $g=0$ on the constructed given. But how do I extend it to $-1$? Or I can't?


I'm trying to complete this dialogue but I've encountered a bit of trouble with the usage of 'all the more'. The dialogue is below.     Our bond is based on trust. We have no contract.   Trust? Then all the more ___ for me to break it.    Should I put the word: easy, easier or easily in the blank space?


Find string beetwen first occurence of word and before first occurence of special character

I have following log string and I need to get from them only MedSoftware part, which means   after .com\ before first occurence of \      SERVERNAME2018-03-08 18:40:28 File: "x:_default\app.address.com\MedSoftware.data\BackEnd.Technical.Dictionaries.Service-180308182311\Web.config", Name: "dictionaries_data_product", CS: "###connectionStrings.dictionariesdataproduct.connectionString" info: Format of the initialization string does not conform to specification starting at index 0. 6069   Now my regex looks like this:  ((?<=.com\\).*(?=\\))   and catches all after .com but goes to LAST occurence of \


I had a collection of classes and forms that I have since re-organised into folders. I thought I should rename the namespaces to match the folder structure, but now I have a whole heap of errors like      The name 'xyz' does not exist in the current context.   What is the proper process to rename a namespace in Visual Studio (2010)


I think I've gotten the wrong end of the stick when it comes to what and when the DM should be calling for rolls when the party is exploring a dungeon.   Picture your typical D&D dungeon crawl. There's winding passageways, a handful of monsters on the prowl, one or two traps and a couple of secrets. My party, understandably, wants to move stealthily, keep an eye out for traps, and watch for secrets. We're playing in roll20 with dynamic lighting on, so they can only see a few squares in all directions, making travel treacherous.   As it stands I end up having them advance a few squares at a time, calling for a new perception check every time they find a new passageway, asking for stealth checks every now and again and having the rogue roll to look for traps each time they wander down a new hall.   This feels clunky, repetitive, and subject to . The more they roll, the more likely it is someone will fail badly enough to be spotted by a monster or fall prey to a trap. However, running the entire dungeon on a single set of rolls seems to be against the whole spirit of dungeon crawling; why bother to explore a dungeon at all when a single roll has determined your fate?  I'm aware of the rationale  behind  in premade maps. In an ideal world you'd design a dungeon crawl that was only rooms, and parcel out your checks per room. But what about a cave system? There's no "rooms", per se... the whole map IS long, possibly empty "hallways". Sometimes you really are trying to navigate a large area with no obvious beginning or end.   I'm sure I'm missing something here... when, and how often, should players be rolling when dungeon crawling?


Highlight all cells in a range that contain a formula in Google Sheets

I am looking to apply conditional formatting to all the cells in my sheet and highlight cells that contain a formula. I know that I can format cells based on a custom formula, and I know that I can use the ISFORMULA() function to determine a cell contains a formula.  e.g. I can apply conditional formatting to cell B7 using the custom formula =ISFORMULA(B7).  How do I format an entire range using this formula? I do not wish to manually type this formula for every cell.


Prove $e^x - e^y \leq e |x-y|$ for $x$ belonging to $[0,1]$

I'm not sure how to go about this. Does it involve using MVT?  I got as far as saying $e = \frac{e^x - e^y}{x-y}$.


I would like to create option with do while were user after inputting correct letter will get out of the loop. I have try to make one but if I put while(type == "Y") it just throws me out of the loop doesn't matter what I press or if I out while(type != "Y") it is going in loop forever, so I am doing somewhere else wrong but I can not figure it out where.  public class JavaApplication8 { static String type; public static void main(String[] args) {     Scanner scanner = new Scanner(System.in);     do {         System.out.println("Press Y to get out of the loop");         type = scanner.next();     } while (type == "Y");    }  }


Is there a way to print the definition of a function in python

I was wondering if there is a way to print what the funciton definition?  so if I want to do something like:  def hello():     print 'hello'  some_function_to_show_definition(hello())   and the output should be:  print 'hello'   Just messing around in python and I was just wondering :)


Can't install aptitude on Ubuntu terminal

i want to install aptitude  i type   sudo apt-get install aptitude   bash show this :  Reading package lists... Done Building dependency tree        Reading state information... Done Package aptitude is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source  E: Package 'aptitude' has no installation candidate


Why isn't the derived-class version of the function being called?

I'm trying to store multiple different derived classes from the same base class in a vector of pointers. Trying to call a function of one of those objects results in a segmentation fault. I haven't used inheritance very much, but I've tried every version I've been able to find and they either result in a  segmentation fault or just calls the function of the base class. I'm relatively new to C++ and haven't posted much before so please let me know if I'm sharing too much code, missing anything important, or messing up in any other respect (style, efficiency, etc.). Edit: Instead of trying to return a Random or Human, the getPlayer function now just returns an int which which indicates which type of Player to create. The new code still results in a seg fault at the same point. (excluded getPlayer since it just returns an int and can no longer be the cause of the problem.) This is where I define the base class (Player) and derived classes (Human and Random): #include <string> #include <iostream> #include <limits> #include <time.h> #include "Othello.h" using namespace std;  // Player interface to choose game moves class Player { public:     // Selects and returns a move      virtual int getMove(Othello &game) {         return 0;     } };  // User-operated player class Human: public Player { public:     int getMove(Othello &game) {         int move = 0;         bool valid= false;                  while (!valid) {             cout << "Select a move: " << endl;             cout << "-> ";             cin >> move;                          if (cin.good()) { valid = true; }                          else {                 cin.clear();                 cin.ignore(numeric_limits<streamsize>::max(),'\n');                 cout << "Invalid input. Try again.\n" << endl;             }         }         return move;     } };  // Basic bot - selects a move at random class Random: public Player { public:     int getMove(Othello &game) {         srand(time(NULL));         return ( 1 + rand() % game.n_moves );     } };  Here is the main function which results in a seg fault at the line move = players[state-1]->getMove(game): int main() {          // Select players (human, AI, random, etc.)     // players[0] is left empty to keep the index consistent with the player id     vector<Player*> players(2);     int type;     for ( int i : {1, 2} ) {         type = getPlayer(i);         if (type == 1) { players.push_back( new Human() ); }         else if (type == 2) { players.push_back( new Random() ); }     }          // Load and start the game     Othello game = loadBoard();     int state = game.getState(1); // 1 or 2 for turn, or 0 for game over          // Continue making moves until the game ends     int move;     int legal;     while(state != 0) {         game.print();         legal = 0;         cout << "PLAYER " << game.turn << endl;         while (legal == 0) {             move = players[state-1]->getMove(game);             legal = game.doMove(move);         }         state = game.getState();     }          game.print();     game.score();          return 1; }


Determine all functions $f(n)$ such that $\frac{1}{a} + \frac{1}{b} = \frac{1}{c}$ then $\frac{1}{f(a)} + \frac{1}{f(b)} = \frac{1}{f(c)}$.

Determine all functions $f(n)$ from the positive integers to the positive integers which satisfy the following condition: whenever $a,b,$ and $c$ are positive integers such that $\frac{1}{a} + \frac{1}{b} = \frac{1}{c}$ then $\frac{1}{f(a)} + \frac{1}{f(b)} = \frac{1}{f(c)}$.    Attempt  We want to find the form of $f(n)$. Notice that if $n$ is a positive integer, then the only possible solution to  $$ \frac{1}{a} + \frac{1}{b} = \frac{1}{n} $$ is only $a=b=2n$.  So we must only have that  $$ f(n) = \frac{f(2n)}{2}$$  If $n=1$ then $2f(1) = f(2)$, if $n=2$ then $2f(2) = f(4)$. $n=3$ then $2f(3) = f(6)$.  $$ f(1) = f(2)/2 $$ $$  f(2) = f(4)/2 $$ $$  f(3) = f(6)/2 $$ $$  f(4) = f(8)/2 $$ $$ f(5) = f(10)/2 $$ $$ \vdots $$  From here we can easily see that $$ f(1) =  \frac{f(2)}{2} = \frac{f(4)}{2^{2}} = \frac{f(8)}{2^{3}} = ... $$  So we have $f(2) = 2f(1), f(4) = 4f(1), f(8) = 8f(1), ...$  $$ f(2^{k}) = 2^{k} f(1)...$$  then also $f(3) = f(6)/2 = f(12)/4 = f(24)/8 = …,$ which means  $$ f(3 \times 2^{k}) = 2^{k} f(3)  $$


Intersection Number of $B = Y^2 - X^3 + X$ and $F = (X^2 + Y^2)^3 - 4X^2Y^2$ using the fact $I(P,F \cap B) = ord_P^B(F) $.

Firstly, I apologise that this question is specific to two polynomials. I understand that this post will not help a lot of people, and for that I am sorry. I will make it up to you all by anwsering lots more questions in the future! However, as my lecturers enjoy time off on the weekend, I am unable to ask this to anyone else who would know what the heck I'm talking about. Sorry if my notation is not widely used, I can elaborate more if required. Please excuse my poor Latex too.  Let:  $B = Y^2 - X^3 + X$, and   $F = (X^2 + Y^2)^3 - 4X^2Y^2$.  I wish to find the intersection number of $B$ and $F$ at $P = (0,0)$  i.e $I(P,F \cap B). $  However, I want to use the following proposition to do this:  If $P$ is simple on $B$ then $I(P,F \cap B) = ord_P^B(F) $.  I will omit proving that $P$ is simple on $B$ as I hope it is clear to see it is.  I know that $I(P,F \cap B) > M_p(F) * M_p(B) = 1 * 4 $, where $M_P(G)$ is the multiplicity of $P$ on $G$.  Now, consider the Image of $X$ and $Y$:  $K[X,Y] \longrightarrow \frac{K[X,Y]}{Y^2 - X^3 + X} \longrightarrow O_P(Y^2 - X^3 + X)$  $X \longrightarrow x$  $Y \longrightarrow y$  Where lower case denotes the image.  Then $ord_P^{Y^2 - X^3 + X}((X^2 + Y^2)^3 - 4X^2Y^2)$  Can be found by substituting $y^2 = x^3 - x$ into $(x^2 + y^2)^3 - 4x^2y^2$  Which gives:  $ord_P^{Y^2 - X^3 + X}(x^9+3x^8 -5x^6 -4x^5 +3x^4 +3x^3)=3$  i.e $I(P,F \cap B) = 3$, a contradiction to  $I(P,F \cap B) > 4$ as above.  The correct answer I know is 6, so where have I gone wrong?


Deduce the number of divisors, $d(n)$ is multiplicative and obtain a formula of $d(n)$ in terms of prime decomposition

I have been given a question which begins with me deducing $d(n)$ is multiplicative, I know $d(n)= \sum_{d|n} 1,$ and obtain a formula of $d(n)$ in terms of prime decomposition (once again I know is $p_1^{a_1}p_2^{a_2}\cdot\cdot p_k^{a_k}$). I am aware that in order for a function to be multiplicative $f(nm)=f(n)f(m)$ where $(m,n)=1$ and f is non zero. The final part is deduce all positive integers $n$ for when;   $\bullet$  $d(n)$ is odd   $\bullet$ $d(n)= p_0,$ where $p_0$ is a fixed prime.   I have deduced $d(n)$ is multiplicative by letting $n=p_1^{a_1}p_2^{a_2}\cdot\cdot p_k^{a_k}$, where   $$d(p_1^{a_1}p_2^{a_2}\cdot\cdot p_k^{a_k})= (a_1+1)\cdot \cdot(a_k+1)=d(p_1^{a_1})\cdot d(p_2^{a_2})\cdot \cdot \cdot d(p_k^{a_k})$$  as we know the divisors of $n$ are $d=p_1^{b_1}p_2^{b_2}\cdot\cdot p_k^{b_k} $ where eack $b_k$ gives a distinct divisor in the form of $(a_k+1)$. It is the next bit I do not understand.


Prove $f_n(x)=\frac{x^n}{\sqrt{3n}}$ for $x \in [0,1]$ is uniformly convergent

I'm completely confused by uniform convergence, but I put together the following proof just based on my other questions here and examples I read online.    Discussion: Let $\epsilon \gt 0$  We want to find $N$ so that for all $x$ in $[0,1]$ and $n \gt N$, $\left|f_n(x)-f(x)\right|=\left|\frac{x^n}{\sqrt{3n}}-0\right|\lt \epsilon$  $\left|\frac{x^n}{\sqrt{3n}}\right|\le\frac{1}{\sqrt{3n}}\le\frac{1}{\sqrt{3N}}\lt\epsilon$ if $\frac{1}{3\epsilon^2}\lt N$  Proof:  Give $\epsilon \gt 0$, let $N=\frac{1}{3\epsilon^2}$.  Then for all $x$ in $[0,1]$ and $n \gt N$, $\left|f_n(x)-f(x)\right|=\left|\frac{x^n}{\sqrt{3n}}-0\right|\le\frac{1}{\sqrt{3n}}\le\frac{1}{\sqrt{3N}}=\frac{1}{\sqrt{\frac{1}{3\epsilon^2}}}=\epsilon$  I'm completely confused by this entire subject, I've been reading the definition over for the last 3 hours and I just do not understand what is going on.


What modern word carries the meaning of pre-Victorian usage of "gay"?

I'm beginning to envy Fielding, of all people. Here are a few quotes from his novel:  I'll buy the gayest gown I can get ... He was besides active, genteel, gay, and good-humoured ... Among the gay young fellows who were at this season at Bath, Mr Fitzpatrick was one. ... for I have observed, the more merry and gay and good-humoured my husband hath at any time been in company, the more sullen and morose he was sure to become at our next private meeting. From The History of Tom Jones, a Foundling, 1821: ; ; ;   Take a closer look at the last part: according to Fielding "merry" and "gay" aren't synonymous or he wouldn't use the two words together. So what would a modern writer use instead of "gay"? Should someone write a novel on the same themes today, what word would you have them use?


Should voting be limited on a question said user also answers?

Consider...  A "downvote" will move an answer farther down the page, (an upvote, vice versa). According to the instructors of , internal social media research found that posts are more likely to get more engagement the higher up they appear in lists.  So... A post is new, it has one other "zero-rated" answer, post an answer yourself, vote down another answer, you get prime real estate... That smells like a conflict of interest. It wouldn't fly for an athlete to sit on a judges' panel while also playing in the same game. Should that principle apply here? I'm sure there are algorithms and system checks on people who do this. But, frankly it shouldn't be allowed at all, unless there is a good reason, which I would sincerely invite (honestly). Ideally, all voting "should" be disabled when answering, including up/down-voting on the OP itself. But, the world isn't perfect, I respect that there may be lots of snags with that, and it might be under discussion already. I'm just a new guy looking for wisdom from the high-reps. Teach me and teach us all... Should voting—on other answers or on the question itself or at least down-voting—be disabled or automatically retracted on a question that a user answers? It would solve this issue:  And addresses in more detail this:   After 20 downvotes, I have decided to keep this question up without regret because the discussion and answers show that many users on SE want to be both plaintiff and juror, athlete and ref, explaining why they believe this to be fair, and knowing that is very useful.  After this question was closed: This is indeed above my head, though I hold that this is a unique question because it addresses the larger matter of "conflict of interest" in having a say in too many spheres; it's not a "pure dup", only a "near dup". BUT as the user who asked, I now see that this may be a "bad" question for two reasons: 1. It heavily is subjective, depending on an individual's view of "fairness" and how many spheres/means of influence are "too many". We humans don't seem to agree on what "justice" even is, so we can't act as though we discuss "justice and fairness" objectively. 2. The matter really can only be answered with a clear yes or no by an employee who sees the algorithms and also is a mod who has dealt with the problems; that's a tall order. As the new guy, while I indeed feel this needs to be at least discussed directly, I also think I deserve the downvotes merely on account of having so much to learn.


"If he gets killed" - does the "get" here represents the passive?

I know that the "get" word has so many meanings and I try to figure out what function it has in the sentence:     "If he gets killed"   I know "get" can be used to create a passive (so without, would it be "if he is killed"?) Or is it the change of state/condition?


How to set pose bone position in global coordinates with python?

I have the following armature, and I want to write a code sets the position each bone pose to a new pose. In the image below I've added cubes to indicate the desired positions for the armature. However, I couldn't find any systematic way to set the bones position. I found a way using convert_space, however I can't set separatelly the position of the tail and bone. Does someone have a good idea? EDIT: There is a similar question that shows how to properly get the bones position, however my intention here would be to SET the bones position, and that I couldn't do succesfully.


Does $\int_{-1}^1 \frac 1 x dx$ equal zero? My contention is that it should, however several sources have said that it does not. I would think that the two areas on the left and the right of $x=0$ should be inverses and thus cancel, even if their areas are each infinite.


Allow users to enable keyboard shortcuts across all network sites at once

I've just got into keyboard shortcuts, and I found it a bit annoying that for every network site I use (Stack Overflow, Super User, Server Fault, etc.) I have to go to http://<site>.com/users/preferences/<UID> and set it on.  There are some preferences which should be per-site on that same page, e.g. the newsletter. But I think most people will want shortcut uniformity like me.


log_bin_trust_function_creators deterministic always throws an error on server restart

Everytime my rackspace server restarts because of some maintenance or an outage, all of my mysql functions stop working due to this deterministic error.  To fix this, I have to manually pull up the database and run SET GLOBAL log_bin_trust_function_creators = 1;  is there anyway to have this set by default so my sql calls don't break on restart?


I installed CCSM to enable window previews in Unity. But when I went into extras, there was no 'window preview' option.  So I tried experimenting with other options in Compiz and now there are no borders in the dialogue boxes (close, minimize, restore buttons are not there, I had enabled some 'flat....' option in Compiz.  Later, I uninstalled Compiz and then reinstalled it. Now it says      "Failed to load session Ubuntu"   I can't even access through the guest account, I am new to Ubuntu.(please explain in detail).  All I have access to is the login screen (it still shows my custom wallpaper). Please help, I don't want to lose my stuff.


Ubuntu 14.04 | dnsmasq  My goal is to setup a catch-all HTTP server using an Ubuntu 14.04 workstation as DNS resolver. I have installed dnsmasq on my Ubuntu 14.04 OS using apt-get install dnsmasq and I've confirmed it's running using 'service dnsmasq status'.   My goal is to route all traffic on the machine via dnsmasq. In the configuration file for dnsmasq, I have the following:  interface=eth0 interface=wlan0   address=/#/192.168.1.1 no-resolv server=192.168.1.1 listen-address=192.168.1.1   I want a scenario where opening firefox and navigating to *.com/net/org/etc pulls up a locally hosted site on my computer instead of actually having such requests routed through the nameservers configured in resolv.conf and processed by the corresponding DNS server(s).   Been at this one for hours. Any suggestions are welcome.  Update: Thanks for suggesting a possible duplicate, while we're trying to achieve the exact same thing, my issue is that the changes in /etc/dnsmasq.conf are not taking effect.


I'm using TeXLive 2014. Here's a MWE:  \documentclass{article} \usepackage{tkz-fct}         % Must appear before {thmtools}  \usepackage{thmtools} \declaretheorem{theorem}  \begin{document}   \begin{tikzpicture}     \tkzInit  % No need to even plot anything!   \end{tikzpicture}    \begin{theorem}[A Silly Theorem]     Let $a = 1$. Then $a > 0$.   \end{theorem} \end{document}   The error message is:  ! Extra \endcsname. \kv@processor@default ...fincsname\@xa \endcsname                                                   \csname iftrue\endcsname \... l.12   \begin{theorem}[A Silly Theorem]   If the optional theorem name is removed, all is well. Adding \protect{} doesn't help.  Any idea how to remove this conflict?  Thanks!


Do Windows libraries have an environment variable?

Goal:  I'd like to save files without breaking my save settings if the drive letter changes.    Example: This works using  and :  %USERPROFILE%\Videos\YouTube\GrumpyCat_00.mp4   The path above will work no matter the drive letter.    Problem:  I've saved videos files across multiple locations and grouped them into a Videos library; so, I'm not able to use the %USERPROFILE%\Videos directory format.    Question:  Can I use a Library environment variable to save to any folder grouped into that library?    Alternate Consideration:  I've considered using symbolic links inside the Videos folder as an alternative to grouping the videos into a library.  Once I own a media server I think I can use a server directory as the location for (in this instance) Videos and always save using %USERPROFILE%\Videos\(Folder Name) - instead of saving media files on my main computer and trying to consolidate and organize later.


How did Doctor Strange repeat the scene where he made the deal with Dormammu?

In this scene I saw that Doctor Strange was looping again and again and was repeating his dialogue again and again and Dormammu was killing him again and again.  I know that Doctor Strange had done something with time but I don't clearly understand what he did exactly.  Can anyone please explain what exactly happened in that scene?


Lets say $a_1, a_n$ are normed vectors.  Why is the set $C = \{\Sigma_{i=1}^n \lambda_ia_i: \lambda_i \ge0\}$ closed? The $\lambda$'s can be any non-negative numbers. So C is the set of all non-negative linear combinations of the n vectors.  I tried both the method with open balls, and the method with a converging sequence(show that the point the series is convergin to is in C), but still I do not see why. (PS: If it is untrue in the generalized version, you can assume that the vectors are in $\mathbb{R}^n$.)


I have run an analysis on data using SPSS. I have a repeated measures design with 7 conditions. I chose to do pairwise comparisons to see where the effects lie and used the Bonferroni correction. If I've understood it correctly k(k-1)/2 would give an adjusted p value of .002. However, what I'm confused with is the output in SPSS. It says something is significant at .003. Could somebody explain this and how would I report it? I wasn't sure if I was supposed to check the significance value against the new .002 one and therefore should conclude it isn't significant.


How can i make if statement with TextView which consists of any text except  month_name + " " + today + ", " + thisYear?  This is part of my code which is not working correctly:  int today = calendar.get(Calendar.DAY_OF_MONTH); datum2.setText(month_name + " " + today + ", " + thisYear);     if(today == 1 & datum.getText().toString() != (month_name + " " + today + ", " + thisYear))     {         hiddenBonus.setText("0");         hiddenCelkovo.setText("0");     }   Thank you.


Is it possible to have 2 unity launchers? One on the Left and one on the Right. In my thoughts, the Left one (The Default) would have the normal stuff that i use everyday. The Right side would have additional stuff that i might use like wine programs or to show the recent documents. Just some ideas to my reason to having 2 panels. Is it possible/optional?


Login form: User ID and Password in same page vs User ID in the first page and password in the next

Some major sites like Google and Amazon take 2-page approach for signin. They first ask for ID and in the next page ask for password. What is the advantage in this against single page signin process? Is this because of security, technical, usability or any other reason?


Nonlinear continuous and unbounded operator

Let $X$ be an infinite-dimensional Banach space, and let $B=\{x\in X: \|x\|\leq 1\}$ be its closed unit ball.   Does there exist a continuous mapping $F: X\to X$ such that the set $F(B)=\{F(x): x\in B\}$ is unbounded?  Of course, such $F$ cannot be a linear operator, so $F$ must be nonlinear.  Thank you very much in advance!


In the example  $\cup^{i=1}_{\infty}F_i$   How do you get the i=1 directly below the union symbol and the infinity directly above?


Manual update to marshmallow possible for rooted phone

Can an unlocked phone such as Moto be updated to Marshmellow upon release, or are we stuck waiting for Motorola or the carrier?


Figure or text outside a block in tikzposter

When making a poster with tikzposter, is there a method by which one can put a figure outside of a block, or even just some text? For example, a university logo in the corner.


Old Flatpak version in Focal repo: no Chromium for me?

Tried to install flatpak Chromium, to no avail:  5. [✗] org.chromium.Chromium                     stable           i            flathub           < 102.8 MB  Error: org.chromium.Chromium needs a later flatpak version error: Failed to install org.chromium.Chromium: app/org.chromium.Chromium/x86_64/stable needs a later flatpak version (1.8.2)  Flatpak 1.8.2 is available starting with Groovy: $ rmadison flatpak  flatpak | 0.11.3-3               | bionic/universe          | source, amd64, arm64, armhf, i386, ppc64el, s390x  flatpak | 1.0.8-0ubuntu0.18.04.1 | bionic-security/universe | source, amd64, arm64, armhf, i386, ppc64el, s390x  flatpak | 1.0.9-0ubuntu0.1       | bionic-updates/universe  | source, amd64, arm64, armhf, i386, ppc64el, s390x  flatpak | 1.6.3-1                | focal/universe           | source, amd64, arm64, armhf, ppc64el, riscv64, s390x  flatpak | 1.6.5-0ubuntu0.1       | focal-updates/universe   | source, amd64, arm64, armhf, ppc64el, riscv64, s390x  flatpak | 1.8.2-1                | groovy/universe          | source, amd64, arm64, armhf, ppc64el, riscv64, s390x  flatpak | 1.8.4-1                | hirsute/universe         | source, amd64, arm64, armhf, ppc64el, riscv64, s390x  I guess I could remove the official Flatpak and use some PPA instead, but it would pretty much undermine the whole idea of getting your software from a trusted source. Snap Chromium is painfully slow on my system for some reason. (As well as snap Firefox.) So, any options left?


I ran a Java applet, and it used over 200% of my CPU....    It actually rose to over 400% after I took the screenshot.  How is this possible? Can someone explain why Activity Monitor shows a task as using more than 100% of my CPU?


Unable to Install blender in Ubuntu 18.04

I'm new to Ubuntu and when ever I try to update or install blender, I encounter this error in the terminal.  This is the error that pops up:    Could someone tell me what exactly to do?  I have used the following code as suggested in blender website,  sudo add-apt-repository ppa:thomas-schiex/blender   sudo apt-get update   sudo apt-get install blender


Is it possible to get the Ubuntu 'Always on top' functionality in Windows?

In Ubuntu when you right click on a window, you get the option to keep it 'Always on Top'. This is incredibly useful sometimes when I want a window to take up the whole desktop (e.g. Internet Browser) but still want to see the information from another smaller window (e.g. A video/film). Using the Windows 7 snap to edge feature is very useful and I use it a lot but its not always what you want.  I find it annoying how some programs in Windows such as Media Player and Task Manager for example have Always on Top options and everything else doesnt. There must be some software to fix this.  An example of the feature in Ubuntu:


Why is an alpha particle 'specifically' emitted in radioactive element and not other some other particle?

Why is an alpha particle emitted  from any radioactive element if it is decaying? Why can it not emit multiple protons + neutrons one after the other or any other particle that is heavier than an alpha particle? Is it due to the fact that the atom can become stable faster by emitting multiple alpha particles rather than more number of protons and neutrons individually, If yes then why can it not emit bigger particle directly to form the stabler element (i.e the product of the decay chain)


How to install LEGO Marvel Super Heroes in Wine?

Basically as the title suggests, I would like to know how to install that game under Wine in Ubuntu 13.10 64-bit?


Question about adverb placement in these sentences

I'm confused about the adverb placement. I heard that adverbs that indicate manner should be placed at the end of a sentence, but I have seen many sentences that do not follow this rule. For some sentences, it sounds awkward if I place the adverb at the very end. Which is correct?  In order to help him learn the concepts and techniques skillfully, did you ensure that you prepare the lessons? Did you define the terms to students precisely, clearly, and nicely?  OR  In order to help him skillfully learn the concepts and techniques, did you ensure that you prepare the lessons? Did you precisely, clearly, and nicely define the terms to students?


Spaceship A and spaceship C are travelling away from each other in space at a constant velocity. Spaceship A fires its rocket boosters starts accelerating forwards in the direction of its original motion and spaceship C remains at its original velocity in its original direction of motion. Observers in Spaceship A (the accelerating spaceship) will see spaceship C accelerating away from them and conclude that people in that spacecraft will experience a fictitious force as they are accelerating (and because motion is relative).  But his makes no sense as spaceship C never actually accelerates via rocket boosters.  Could someone please explain this, thanks!


What does 'equal' mean for morphisms of a category?

I don't quite understand what does equal mean for morphisms in category theory. Since object of a category is not necessarily a collection of some elements, then how to decide whether two morphisms are the same or not? Is it allowed that for some category $C$, there exist two different morphisms $f,g$, but for any possible  h which is not a identity morphism, $f\circ h = g\circ h$ and $h\circ f = h\circ g$ (so that there does not exist any monic or epi morphisms in this category, and any objects $a$ of this category do not have any structure such as $x \in a$)? Or we can never know it?


How to run a program without typing the full path?

System utilities such as ls don't need to have the full path typed before executing them. However, to execute Netbeans, I have to type /home/chris/netbeans-7.0.1/bin/netbeans. How can I make it so that I only have to type netbeans?


Evidence that Time is a Natural Phenomenon?

Time is a tool we've invented to measure changes of state. What evidence do we have that it is a natural phenomenon?


I am developing a python addin that allows the user to click on a location in arcmap and a browser window opens with the associated area in google maps.   The issue I am currently facing is that the formula I use creates a discrete zoom level resulting in zoom levels with 10 decimals, such as 17.7875321547z or 18.9062909847z.   The Formula I am using:  level = (36.906 * scale**-0.088)  url = "https://www.google.com/maps/@{0},{1},{2}z".format(y_coord, x_coord, level)  My issue is that the url shows my provided zoom level but then rounds it down to the nearest whole number. From 17.7875321547z to 17 and so on.   I have found a similar question () that was asked almost 3 years ago with the only answer being that google had not fixed the issue at that point.   Has there been any progress since then?   Is there a way to use the specified zoom level without google rounding it?


after c++ i am trying to learn some java, and i have a question about the code i have been working on. I am working on a Fraction class and i got stuck in reduce section. Since the method did not let me to return both "num" and "den", I had to return "n"  This is my method  public double reduce() {     int n = num;     int d = den;      while (d != 0) {         int t = d;         d = n % d;         n = t;     }     int gcd = n;      num /= gcd; //num = num / greatestCommonDivisor     den /= gcd; //den = den / greatestCommonDivisor     return n; }   I am trying to do "return num, den;" however it does not let me.  and this is what i get   to reduced test for  100/2 is 2.0 to reduced test for  6/2 is 2.0   when i run   System.out.println("to reduced test for  " + f4.toString() + " is " + f4.reduce()); System.out.println("to reduced test for  " + f6.toString() + " is " +f6.reduce());   Why do i get the 2 when when i am supposed to get 50/1 and 3/1 ? If the IDE let me return num and den at the same time, would that have fixed it?   Thanks


Conditional Multi-variate Normal Distribution

I would like to find a computationally quick and sufficiently accurate way (i.e., either analytically or numerical approximation) to compute a conditional probability for a specific multi-variate normal distribution, which is defined as follows:  Let $X_1, \dots, X_n$ be n independent (univariate) normal random variables. And let $A_1, \dots, A_k$ be defined as sums of subsets of those random variables, i.e.,: $\forall i: A_i = \sum_{j \in S} X_j$, where $S \subseteq \{1,\dots, n\}$.  I am looking for the following conditional probabilities of $A_i$:  Pr[ $A_i \leq x$ | $A_j \leq t$ $\forall j \in C$ and $j \neq i$ ], where $x$ is any number smaller than $t$, and $C \subseteq \left\{ 1,...,k \right\}$ is a subset of all possible variable indices on which the probability is conditioned. So the condition is on several $A_j$'s.  To the best to my knowledge, the conditional density of a multi-variate normal density is generally not a (uni-variate) normal distribution. I tried via Monte-Carlo simulation, but approximation is not sufficiently accurate when using 500,000 samples, 2000 bins (to classify the results) for a "problem" with 50 random variables, i.e. n=50.  Analytically that doesn't seem to be trivial. I have asked quite a few Statisticians around me and so far we haven't found a solution.


Limit points of $\left\{ \frac{m}{2^{n}} \right\}$ where $m,n$ are natural numbers.

Let $E = \left\{\frac{m}{2^{n}}\right\}$ where $m,n$ are integers, then $0$ is the only limit point of this set.  $($true$/$false$) ?$  I think the $0$ is the only limit point of this set. Since, as $n \to \infty$ terms of this sequence come nearer to $0$.   But the statement is false according to answer key.


How do you find the min/max values of $Arg(z)$ for {$z:|z-(4+3i)|=2$}? I have drawn a diagram with a circle centre $(4+3i)$ and radius = $2$. I think to find the min/max values of $Arg(z)$ I need to find the points of tangency? I don't understand how to do it only with the diagram and any hints would be much appreciated! The min possible value of $|z|$ is $3$, and max value of $|z|$ is $7$. Also, I am on a chapter has more simple questions like this, so I'm looking for a not too complicated way of solving this :)


Proving that a function is an automorphism

Suppose $G$ is a group. For each $g\in G$  we define the function $\phi_g(x) : G\to G$ as $\phi(x) = g^{-1}xg$. Prove that $\phi_g(x)$ is an automorphism of $G$. This is what I did ( But I don't know if it's right ): The only possibility for me that $\phi$ being an automorphism was if it's an identity function . So: $$\begin{align} \phi_g(g)& = g^{-1}gg\\  \phi_g(g) &= (g^{-1}g)g\\  \phi_g(g) &= eg\\  \phi_g(g)& = g. \end{align}$$ But at the same time this doesn't seem quite right for me...


Term for nicknames with different first letter

I have an uncle Bill and an uncle Bob. Is there a term for name diminutives in which the first letter is different from the root name?  There are discussions of name diminutives  and in , especially these comments:     There is a noticeable tendency in English to substitute a plosive   (stop consonant) for the initial consonant in forming pet-names: Dick,   Bob, Bill, Peggy, Polly. I don't know why this might be, or whether it   is seen in other languages. –       Rick/Dick, Bob/Rob, Bill/Will, Polly/Molly are examples of rhyming   nicknames, and they've been around in English since the 13th century.   A much more obscure example of a "significantly different" nickname is   Hudde (as in Hudson), which was used for Richard. –    Is there a term for this particular phenomenon -- different first letter -- compared to other nicknaming phenomena (abbreviating, adding a -y ending, etc.)?


I'm just finishing up paying off my student loans (woohoo!) and am starting to look at places I can put my money to make it work for me. I've read Kobliner's  and am interested in starting with ETF's, but I have a slight dilemma.  I work for a medium-sized company that is publicly traded on the NYSE1. They offer a program where I can allocate up to 15% of my paycheck (after tax) to buy their stock at 85% of the price. The only stipulation being that I have to hold it for 180 days (~6 months).  To me this seems like free money. The second that stock is bought, I've already made 100/85 => 17.6% on my money!  I'm very tempted to allocate the full 15% of my paychecks to this, but I know that it's important to diversify my investments.  I was planning to use 20% of each paycheck to play with for investments--would 15% company stock/5% ETF be diversified enough? Should I drop to 10%/10% or lower? Is there some reason I'm missing to not go all in on this?  EDIT:  I don't think this is a duplicate. The marked duplicate is asking (very broadly) how often "is good" to invest in an ESPP. I know I'm already going to be investing every chance that I get. My concern is one of diversification, which the duplicate makes no mention of. I've made it clear that I'm comparing between ESPP and ETF, while the duplicate seems to simply ask "what are you experiences with ESPP?"    1. It's worth noting that this company's stock has done incredibly well in the last 10 years. While , this company is definitely not going anywhere anytime soon. An investment with them would definitely be safe. I have the utmost confidence in this company.


I am trying to get the SIDs of users and groups by querying  get-wmiobject -query 'select groupcomponent,partcomponent from win32_groupuser`   output:  __GENUS          : 2 __CLASS          : Win32_GroupUser __SUPERCLASS     : __DYNASTY        : __RELPATH        : Win32_GroupUser.GroupComponent="\\\\COMPUTER\\root\\cimv2:Win32_Group.Domain=\"TESTDOMAIN\",Name=\                    "Schema Admins\"",PartComponent="\\\\COMPUTER\\root\\cimv2:Win32_UserAccount.Domain=\"TESTDOMAIN\"                    ,Name=\"Administrator\"" __PROPERTY_COUNT : 2 __DERIVATION     : {} __SERVER         : __NAMESPACE      : __PATH           : GroupComponent   : \\COMPUTER\root\cimv2:Win32_Group.Domain="TESTDOMAIN",Name="Schema Admins" PartComponent    : \\COMPUTER\root\cimv2:Win32_UserAccount.Domain="TESTDOMAIN",Name="Administrator"   groupcomponent is a win32_group ().  win32_group is contains an SID ()  However the groupcomponent here is a string and not a win32_group as   get-wmiobject -query 'select groupcomponent.sid from win32_groupuser'   is an invalid query. How can I access groupcomponent's members as a win32_group?


Why is shapefile not drawing in expected location after (or before) using Define Projection tool?

I have  of bus routes from the City of Houston data portal.   I then performed these steps in ArcGIS Desktop 9.3.1:   Extracted the shapefile from the *.zip Added this shapefile as a layer to a data frame which has data in a coordinate system of NAD_1983_UTM_Zone_15N and noticed that it did not draw where I expected it to Used ArcToolbox>Data Management Tools>Projections and Transformations>Define Project to change its coordinate system to NAD_1983_UTM_Zone_15N and observed that it still did not draw where I expected it to   Can you explain why this shapefile may not be drawing in the expected location?  As background the properties of a shapefile that is drawing in the expected location is:   Data Type:  Shapefile Feature Class  Shapefile:  D:\Cloud Apps\Google Drive\...\tgr48201trt00.shp Geometry Type:  Polygon  Projected Coordinate System:    NAD_1983_UTM_Zone_15N Projection: Transverse_Mercator False_Easting:  500000.00000000 False_Northing: 0.00000000 Central_Meridian:   -93.00000000 Scale_Factor:   0.99960000 Latitude_Of_Origin: 0.00000000 Linear Unit:    Meter  Geographic Coordinate System:   GCS_North_American_1983 Datum:  D_North_American_1983 Prime Meridian:     Greenwich Angular Unit:   Degree


Can someone help me with this message? I tried to make a list view but this errors pop out when I run the code

Can anyone solve this error? I have tried to make a list view but this errors come out when I run the code.  Error message:     2020-02-06 13:40:23.483 16037-16037/com.example.submissionexpert1   E/AndroidRuntime: FATAL EXCEPTION: main Process:   com.example.submissionexpert1, PID: 16037   java.lang.NullPointerException: Attempt to invoke virtual method 'void   android.widget.TextView.setText(java.lang.CharSequence)' on a null   object reference       at com.example.submissionexpert1.FilmAdapter$ViewHolder.bind(FilmAdapter.java:68)       at com.example.submissionexpert1.FilmAdapter.getView(FilmAdapter.java:52)   My Code:      import android.content.Context;     import android.view.LayoutInflater;     import android.view.View;     import android.view.ViewGroup;     import android.widget.BaseAdapter;     import android.widget.ImageView;     import android.widget.TextView;     import java.util.ArrayList;      class FilmAdapter extends BaseAdapter {       private final Context context;     private ArrayList<Film> films = new ArrayList<>();      void setFilms(ArrayList<Film> films) {         this.films = films;     }      FilmAdapter(Context context) {         this.context = context;     }      @Override     public int getCount() {         return films.size();     }      @Override     public Object getItem(int i) {         return films.get(i);     }      @Override     public long getItemId(int i) {         return i;      }      @Override     public View getView(int i, View view, ViewGroup viewGroup) {         View itemView = view;         if (itemView == null) {             itemView = LayoutInflater.from(context).inflate(R.layout.item_data, viewGroup, false);         }          ViewHolder viewHolder = new ViewHolder(itemView);     enter code here         Film film = (Film) getItem(i);         viewHolder.bind(film);         return itemView;     }      private class ViewHolder {         private TextView txtName;         private TextView txtDescription;         private ImageView imgPhoto;          ViewHolder(View view) {             txtName = view.findViewById(R.id.txt_name);             txtDescription = view.findViewById(R.id.txt_description);             imgPhoto = view.findViewById(R.id.img_photo);         }          void bind(Film film) {             txtName.setText(film.getNama());             txtDescription.setText(film.getOverview());             imgPhoto.setImageResource(film.getPhoto());         }     } }


Match multiple expressions in different lines with a logical AND using grep - all expressions must occur in the same textfile

I tried to return all python-scripts (textfiles) which contained both main() and plt.style.use somewhere within the file, i.e. not in the same line. I found some documentations like  explaining how to use logical operators with grep on single lines in textfiles, but nothing was mentioned regarding entire textfiles. What I tried out was the following: grep -Rinw /home/andylu/Desktop/Python/Scripts/ -e 'main()\|plt.style.use'  This command returned all textfiles which contained any of the terms like a logical OR. As a logical AND doesn't exist with grep, one could match any order per line of the multiple expressions as mentioned in :  grep -E 'Manager.*Sales|Sales.*Manager' employee.txt  This wouldn't help me either, because the terms I'm looking for are coded in different lines within the python-scripts, but must occur both in the same textfile to be relevant for me. These are the textfiles I would like to filter out and return in the console via grep, or whatever alternative tools.  OS: Lubuntu 20.04 LTS


Pardon me if this question has been duplicated elsewhere, I'm still coming to terms with tex terminology.  I am generating a presentation in Beamer. I like the use of PDF chapters to navigate between slides as well. I use sections to break up the presentation into... sections. However, the ideal subsection heading is just the frametitle. Is there any way to automate the process of retroactively creating subsections based on input to \frametitle?  My document is set up a bit like the following:  \documentclass{beamer} \begin{document}  \section{Introduction} \begin{frame} \frametitle{Research essentials} Researchers are responsible for many aspects of study design and protocols \end{frame}  \begin{frame} \frametitle{Overview} In this presentation we will be talking about Review Boards, Funding Mechanisms, Statistical Analysis Plans, and Manuscripts \end{frame}      \section{IRBs}  \begin{frame} \frametitle{Institutional Review Boards} IRBs independently review study applications to ensure that the degree of invasiveness is justified, the results of scientific interest, and the confidentiality of study participants protected \end{frame} \end{document}   I would like the PDF chapters left hand bar on Adobe to show the following breakdown  Introduction - Research Essentials - Overview IRBs - Institutional Review Boards


Opencl is not working on the Radeon HD 7750/8740 / R7 250E

In "Cycle Compute Divece" appears "none". It's as if I did not have a video card. I have a board [AMD / ATI] Cape Verde PRO [Radeon HD 7750/8740 / R7 250E] It is listed as having Opencl support. This happens with both Linux (Ubuntu) and Windos (Windows 10). Is there a solution?


Prevent Image Capture from opening when a memory card is inserted

Every time I plug in a SD memory card, Image Capture launches, is there a way to disable this? I am running OS X Mavericks.


How to reset Ubuntu 18.04 to default theme?

I had ubuntu 16.04 earlier with gnome environment and apple look alike theme with the help the help of tweak tool . Now I have upgraded to 18.04 . But I am experiencing problems with the apple theme, like some buttons not appear , icon names at the top bar not aligned correctly , etc. How to get default theme for 18.04


This is my first question here. I don't know the difference between"only" and "just". Can anyone help me please?  Thanks.


I have opened 'install.sh' file to install Kyocera printer, but don't know how to 'Run'

I need help installing my printer.  I put the 'tar-gz' file in a new folder and opened it, clicked on 'tar.gz', and the files were 'install.sh', the different '.ppds,' and 'rastertokpsl.'  The instructions say 'Run' when the 'install.sh' file opens, but I don't know how to do this.  I clicked install.sh and it says says the following:  #!/bin/bash if [ ! -d /usr/share/cups/model ]; then  sudo mkdir /usr/share/cups/model fi if [ ! -d /usr/share/cups/model/Kyocera ]; then sudo mkdir /usr/share/cups/model/Kyocera fi sudo cp Kyocera_FS-1041GDI.ppd /usr/share/cups/model/Kyocera/Kyocera_FS-1041GDI.ppd sudo cp Kyocera_FS-1220MFPGDI.ppd /usr/share/cups/model/Kyocera/Kyocera_FS-1220MFPGDI.ppd sudo cp Kyocera_FS-1320MFPGDI.ppd /usr/share/cups/model/Kyocera/Kyocera_FS-1320MFPGDI.ppd sudo cp Kyocera_FS-1325MFPGDI.ppd /usr/share/cups/model/Kyocera/Kyocera_FS-1325MFPGDI.ppd sudo cp Kyocera_FS-1061DNGDI.ppd /usr/share/cups/model/Kyocera/Kyocera_FS-1061DNGDI.ppd  sudo cp rastertokpsl /usr/lib/cups/filter/rastertokpsl if [ -f /usr/lib/cups/filter/rastertokpsl ] && [ -f /usr/share/cups/model/Kyocera/Kyocera_FS-1041GDI.ppd ] && [ -f /usr/share/cups/model/Kyocera/Kyocera_FS-1061DNGDI.ppd ] && [ -f /usr/share/cups/model/Kyocera/Kyocera_FS-1220MFPGDI.ppd ] && [ -f /usr/share/cups/model/Kyocera/Kyocera_FS-1320MFPGDI.ppd ] && [ -f /usr/share/cups/model/Kyocera/Kyocera_FS-1325MFPGDI.ppd ]; then echo "Installation completed" else echo "Installation failed" fi


java.lang.ClassCastException at runtime or compile-time

I've just read in an OCA-Book (Oracle Certified Associate), that:  "Some casts exceptions can be detected as errors at compile-time, but others can only be detected at runtime".  Now I am trying to find an example for both cases: compile-time and runtime.  Consider the following class structure:  class A {}  class B extends A {}  class C extends B {}   The following cast  Object o = new C(); B b = (B) o;   is correct. So the code would run without a ClassCastException.  The cast  Object o = new B(); C c = (C) o;   is wrong. The Object o is at least of the type B; so it could be cast to B or A.  But could be this detected at runtime or compile-time? I would guess at compile-time?! Or does the compiler knows only the type of the reference, not of the object (in the memory) itselfs? If this is true, the compiler could not decide if the cast is correct or not at compile-time.  Thank you for your help!


Why wouldn't Hermione (and other muggle borns) say Voldemort's name?

Multiple times in the early series Hermione and other muggle-borns refer to Voldemort as you-know-who. Why would they be scared of saying the name? They didn't grow up with the fear, and Voldemort seemed to have been gone.


Recommended way to install regular(cli) .deb packages on Ubuntu Phone?

tl;dr: I'm looking for a "canonical" or "recommended" way to install (cli) .deb packages on Ubuntu touch  I've been using Ubuntu on my Desktop and Server for a year and I'm very satisfied. Now I bought the first Ubuntu phone, the BQ Aquaris e4.5 Ubuntu Edition. However, I found out that I can't install normal .deb packages or install things using apt-get. How can I "root" my phone so that I can install "normal" .deb packages?  I tried it myself. I know the first thing is to make your filesystem writable. I did the following steps but then I got stuck because of a dpkg error.  # Desktop: sudo add-apt-repository ppa:phablet-team/tools sudo apt-get update sudo apt-get install phablet-tools  # Phone: Security & Privacy: Lock phone: Lock when idle: Never About this phone: Developer Mode: Developer Mode ON  # connect phone to PC via USB  # Desktop: adb devices # no device detected so I've manually added file touch /home/username/.android/adb_usb.ini # with content: 0x2a47 sudo adb kill-server sudo adb start-server adb devices # now my phone is on the list  # Phone: sudo test -w filename && echo "Writable" || echo "Not Writable" # verified it is writable sudo add-apt-repository ppa:phablet-team/ppa sudo apt-get update && sudo apt-get upgrade   And this is the place where error starts to block me:  dpkg: error processing archive /var/cache/apt/archives/powerd_0.16+15.04.20150430-0ubuntu1_armhf.deb (--unpack): unable to make backup link of `./usr/share/powerd/device_configs/config-default.xml' before installing new version: Invalid cross-device link   So I tried    sudo apt-get install -f   But it got stuck on "Bluetooth main config". I restarted the phone, but it didn't want to turn on anymore. I tried the Recover boot option. That worked. I tried install -f again, and this time it worked. But after doing upgrade I still had the same error.


HDD making clicking noise (video included)

My HDD is making clicking noise. The head isn't stuck half way through the platter yet YouTube videos related to data recovery in such cases weren't helpful. Please see recording here   password is harddisk. I haven't got a spare one of this type so I can't really replace the circuit board which is what may help. The HDD is a goner but I still want to try to make it work at least to the point where the disk is detected by a computer and mounts it so I can recover the data. How should I proceed ?


Help on Embossing Letters Need a Larger Effect

I am trying to recreate this emboss effect:  I've tried doing so through displacement nodes and I'm not seeing a good result. I've rendered two images with different approaches and still looks the same   Some existing answers are outdated and not specific.


how to prove the continuity of the Taylor $f^{(n)}(\xi(x))$?

let $f(x)=f(x_{0})+f'(x_0)(x-x_0)+\cdots+\frac{f^{(n)}(\xi(x))}{n!}(x-x_{0})^{n}$  I need to prove that $x \mapsto f^{(n)}(\xi(x))$ is continuous if $f\in C^n[x_{0}-\delta,x_{0}+\delta]$ or in other words if $f$ is $n$ times differentiable.  A function is continuous if $\lim_{x\rightarrow x_{0}}f(x)=f(x_0)$. I know that $f$ must be continuous, because it is n times differentiable. However when we reveal $f^{(n)}(\xi(x))$ we get that  $f^{(n)}(\xi(x))=\frac{(f(x)-f(x_{0})-f'(x_0)(x-x_{0})-\frac{f''(x_0)(x-x_{0})^{2}}{2}-\cdots-f^{(n-1)}(x_0)\frac{(x-x_0)^{n-1}}{(n-1)!})n!}{(x-x_{0})^{n}}$  When we take this to the limit we get  $\lim_{x\rightarrow x_{0}}\frac{(f(x)-f(x_{0})-f'(x_0)(x-x_{0})-\frac{f''(x_0)(x-x_{0})^{2}}{2}-\cdots-f^{(n-1)}(x_0)\frac{(x-x_0)^{n-1}}{(n-1)!})n!}{(x-x_{0})^{n}}$ and from there a $\frac{0}{0}$ uncertainty.  This is the extent to which I think I have correctly solved this exercise, but now I (this is how I must solve it) must apply the L'Hospital rule. I am not sure what is the correct way to go about this, but I'll give what I think might be true.  If we differentiate both the numerator and the denominator once we get:  $\lim_{x\rightarrow x_{0}}\frac{(f'(x)-0-f'(x_0)-f''(x_0)(x-x_0)-\cdots-f^{(n-1)}(x_0)\frac{(x-x_0)^{n-2}}{(n-2)!})n!}{n(x-x_0)^{n-1}}$  Assuming this is even correct, I have no idea where to go from here. If at all possible, please provide explanations. Thanks!


Windows 10 sees much more monitors than I have

After a recent update, or after I played around with installing Ionic Framework and Visual Studio 2015 Community Edition, right after a restart, I suddenly have not 2, but several monitors detected by Windows 10.   Screen 1 is my laptop screen, and screen 2 is my monitor, connected via HDMI. When they first appeared, some of them were duplicated in groups of 2, while others were extensions.  When I disconnect my monitor, these screens don't disappear, and even worse - I can't disconnect one of these "screens", so I have to duplicate it with my laptop screen.  I have alleviated all major symptoms of the problem, except for one more: The sound from the speakers embedded in my monitor has also ceased to work.  With all of that, I really don't want to fix any more symptoms, but want to get to the core of the problem and remove all of this junk.  I tried uninstalling Intel(R) HD Graphics 4600 drivers, but they got themselves re-installed and all of this junk re-appeared again. I tried several restarts obviously, and it didn't help. I tried disabling the device from the device manager and it didn't have any effect. Under the "Monitors" section of the Device Manager in Windows I have 4x "Generic Non-PnP Monitor", and 2x "Generic PnP Monitor". I tried restoring from a restore point but that failed miserably (with a memory error right at the start).  What might be causing it? And how can I fix it?


What is the status of the purported proof of the ABC conjecture?

Back in August 2012, Japanese mathematician Shinichi Mochizuki announced a proof of the  using . What has been the status of his proof?  Has there been any progress made in verifying it?


find the name of the table containing a specified value for one user

for a user (user A) I have several tables (table1, table2, ..., table n) that have the same fields (field1, field2, field3, field4), I would like to know the name of the table containing the value x for field 4 (where field4 = x)


My favourite animal is a dog, the dog or dog

I consider myself a pretty advanced English teacher and user. Nonetheless, I've recently found myself in a pretty difficult spot trying to explain which of the following sentences is correct:  My favourite animal is a dog My favourite animal is the dog My favourite animal is dog  My instinct tells me the dog is the correct one, but I've found so many instances on the internet where native speakers say My favourite animal is dog that makes me wonder if that sentence is also correct. Additionally, I know that a sentence like My favourite food is pizza sounds pretty right to me, making the whole thing so complicated that I cannot figure out any rule that governs using articles in the above sentences.


Word for the opposite of "hypochondriasis"

Is there a word for the opposite condition of ? For example,  someone who denies being sick when they clearly are? I would just say that they are "in denial". Is there any other adequate word?  I thought about the obvious 'hyperchondria' but it doesn't seem to be used anywhere and doesn't look suitable as—from —just replacing 'hypo' by 'hyper' wouldn't fit well:     1555–65;  < Late Latin  < Greek,  neuter plural of hypochóndrios  pertaining to the upper abdomen (supposed seat of melancholy), equivalent to hypo- hypo- + chóndr ( os ) ensiform cartilage + -ios  adj. suffix


How to add sth in the footnote space without pointing at anything

I know I didn't well describe the problem. Just look at the picture followed. I want to ask how to write that paragraph in where the footnotes are but it is not really a footnote because it doesn't point at anything in the body of the text.


Accessing DualShock 4 motion sensor in Windows

I am attempting to access the accelerometer and gyroscope functionality of the dualshock 4 controller for implementation into Unity.  DMGregory seems to have found a solution to this problem, my question is how he succeeded in getting the motion input working .  He mentions that he reached his solution by grabbing the DS4Tool source and copying parts of the files: NativeMethods, HidDevices and HidDevice  I understand a lot of what is happening here, I just do not have the coding chops to get it working. I believe I should be "using NativeMethods" but do not fully understand how to access the read report to retrieve the necessary data.  Any help is greatly appreciated!


Im using SQL Server 2005.  I have a table1 with  3 columns. And table2 with 4 columns.  I want to insert the records from table1 into table2.  But I dont want to insert into column1 from table2.  I want to start inserting from column2 on.  What can i do? Thanks...


I just finished the book of Lawrence Krauss "Universe from nothing" and he said that virtual particle can pop to existance from nothing by quantum fluctuations of the field from the vacuum and in the same way our universe can pop to existence, but my question is..  How this quantum fluctuations works? If the space-time began to exist with universe how can this quantum fluctuations generate universe? Doesn t them requer space-time in the first place?? The book doesn t answer that..  I dont get a answer also on Yahoo


Executing a bash command line inside a python function

I want to implement a python function to execute a bash command. for example:  def run_command(): # run 'python test --a' command


Need Examples to Understand Choice Function and Choice Structure.

Would you please give me a concrete example for the following definitions? Specifically I don't understand why a choice function is defined as $c: B \rightarrow P(X)$.   For any nonempty set $X$, let $P(X)$ denote the set of all nonempty subsets of X.  For any nonempty subset $B$ of $P(X)$, a function $c: B \rightarrow P(X)$ is called a choice function iff $c(A) \subset A$ for all $A \in B$. The pair $(B, c)$ is called a choice structure. For any binary relation $R$ on $X$, define the function $C_R : P(X) \rightarrow P(X) \cup \{\emptyset\}$ as follows: $$C_R (A) = \{x \in A : ( \forall y \in A ) ( xRy ) \}.$$   This question is in no way a duplicate for the following question:  In this question I am asking people to provide me some examples to understand the definition of Choice function and Choice structure. In the other question, I am asking for an example to show that a relation underlying a choice structure should not necessarily be a rational relation. The only relation between these two questions is the definition included in the latter questions to clarify the question.


How to get a uniformly distributed portfolio allocation vector?

Imagine we have a portfolio allocation vector $(x_1, ..., x_n)$ with $x_1+...+x_n=1$;  Also we assume that the vector has only elements $\geq 0$, so we have $|x_1|+...+|x_n|=1$, so no short selling;  I want to generate such vectors $x$ and I want that they are somehow uniformly distributed on the set of possible values;  In a paper I read to generate $y_1, ... y_n \sim \text{Exp}(1)$ i.i.d. and then set: $x_i=y_i/(\sum\limits_{j=1}^{n}y_j)$;  Now it is obvious that the sum of elements of the generated vector is 1 but why do I use the exponential distribution? What advantage do I get? Isn't is more reasonable to take e.g. $y_i$ to be uniformly distributed on [0,1] and then again set $x_i=y_i/(\sum\limits_{j=1}^{n}y_j)$?


There's a book entitled .   It's not clear what exactly phrasal verb Lean in in it's title means. Does its meaning differ from the meaning of the verb to lean in the context of the book's name?


Prove that for each Fibonacci number $f_{4n}$ is a multiple of $3$.

The Fibonacci numbers are defined as follows: $f_0 = 0$, $f_1 = 1$, and $f_n = f_{n-1} + f_{n-2}$ for $n \ge 2$. Prove that for each $n \ge 0$, $f_{4n}$ is a multiple of $3$.  I've tried to prove to by induction. So, my basis is $f(0)$, which is true. Then, i assume that it's true for some integer $k$, and I am stuck at this point, can't really get what to do


Lately, I've been casting a lot of delete votes on old questions, but I find myself pretty much alone in doing so. So, I would like to know if I should stop bothering.  Do those delete votes expire at all, like close and reopen votes?


How do we know that Quantum Mechanics isn't simply a theory of approximations?

From what I understand, QM is all about uncertainty. The wavefunction (or rather $|\Psi|^2$) gives us a probability of finding a particle at a certain point. Then, we measure the particle, and find what point it is at.   Now, here's my trouble - QM states that before we measured this particle, it was in a superposition of many states and did not have a definite position. This also implies the wave function is "perfect" because it gives as accurate information as possible about the position particle before we measure it.  So, how do we know this? Why can't there be a function $\phi$ that doesn't give probability distributions, but instead gives definite locations of particles, and we just haven't found a way of expressing or computing it? Why do we know that the position of particles is physically uncertain, and not just unknown to the experimenter?  Sure, Quantum Mechanics works out beautifully and fits the results, but perhaps it is simply a very good theory of probability when we have a much more elegant and simple theory?


I have a folder with 300 txt files. lets say the .txt names are a, b, c, d etc. I need to compare each pair with a python script. I need to compare a-b, a-c,a-d, b-c, b-d. I do not want to have a-a and also i don't want to have both a-b and b-a. My guess was something like  for x in ['a', 'b', 'c', 'd']:      for y in ['a', 'b', 'c', 'd']:           if x != y:             print(x , y)   but i am getting both a-b and b-a etc. If i scale it at the 300 file names i will get a few thousands duplicate outputs.   Any suggestions?


Why do we use Hermitian operators in QM?

Position, momentum, energy and other observables yield real-valued measurements. The Hilbert-space formalism accounts for this physical fact by associating observables with Hermitian ('self-adjoint') operators. The eigenvalues of the operator are the allowed values of the observable. Since Hermitian operators have a real spectrum, all is well.  However, there are non-Hermitian operators with real eigenvalues, too. Consider the real triangular matrix:  $$ \left( \begin{array}{ccc} 1 & 0 & 0 \\ 8 & 4 & 0 \\ 5 & 9 & 3 \end{array} \right)  $$  Obviously this matrix isn't Hermitian, but it does have real eigenvalues, as can be easily verified.  Why can't this matrix represent an observable in QM? What other properties do Hermitian matrices have, which (for example) triangular matrices lack, that makes them desirable for this purpose?


How is it possible to have short interest greater than 100%?

Currently when you look at NYSE: GME (GameStop Corp.), according to  the company has a short interest of 136.56% since 09/15/20. How exactly is this possible? Is this just a faulty data point, or does the calculation take into account other derivatives like unexercised options?


"Internal hard drive not found" error displayed while trying to boot laptop

Internal hard disk drive not found. To resolve this issue, try to reseat the drive. No bootable devices--strike F1 to retry boot, F2 enter Setup Menu, F5 enter PSA.   How do I fix this problem?


"Type 'debo' is not known on line 1 in source list /etc/apt/sources.list.d/spotify.list"

I was trying to install spotify for Ubuntu when this error appeared:  E: Type 'debo' is not known on line 1 in source list /etc/apt/sources.list.d/spotify.list E: The list of sources could not be read.   I don't know what to do to solve it.


I am confused by the behavior of a python list. If someone can please shed light on why python is behaving this way I would greatly appreciate it.   list = [[]]*5 list[0].append(10) list[1].append(20) list.append(30)   I believe the output should be:  [ [10], [20], [], [], [], 30 ]   but I am getting an output of:  [ [10, 20], [10, 20], [10, 20], [10, 20], [10, 20], 30 ]   Would this be because the nested lists are just a copy of the initial list? If so what is there a way to do this so that it doesn't just make copies of the initial list?


Sometimes I use the indirect questions as stated below,     Could you please tell me, where is this address??   Sometimes, I feel it's not correct, although it's understandable to any person. So tell me, is it grammatically correct?   I usually use phrase before the direct questions. Is that the correct way for polite questions?


Kernel panic when I try to install Ubuntu on my PC

I made a USB with 19.04 following the guide and tried to start it for installation, but I got a kernel panic. I tried an older version and couldn't install it either, but a 14.04 LiveUSB worked OK when I made it earlier.  How do I solve the kernel panic problem with installation?   Processor:    Motherboard:    RAM: 16GiB Dual Channel    Graphics Card:    Yes I did try LTS and also checked the USB - it is completely fine; I can install a VM with the USB but not on my computer.


I am currently learning trigonometry for GCSE and I am trying to make sense out of it. However, I am struggling to do so.  I understand how to find a missing length or a missing angle but the thing I don’t really understand is how all these rules work.  I recently found out what sin, cos and tan actually mean. They are the percentages of one side to another side. For example, sin is the percentage of the length opposite side to the length of the hypotenuse. Correct me if I am wrong here, but this is what I believe to be true and I understand this part to an extent.  What I do not understand at all however are the graphs for sin, cos and tan. I understand the first part of the graphs which go from 1 degrees to 81 degrees. However, once it gets to 90 degrees, that’s the part I can’t seem to get my head around.  As you know, trigonometry is in right angled triangles. This means the maximum size of one of the other angles is 89 degrees (meaning that the other angle must be 1 degrees). But with that being said, how do the trigonometric graphs go from 1 - 360 degrees. It doesn’t make sense to me.  If you had a right angled triangle with another angle at 90 degrees or more, then it wouldn’t make a triangle since triangles only go up to 180 degrees.  I hope I have made my point clear. Please try to respond to my question in simple words seen as I am not very advanced in trigonometry yet (as you can see). Thank you!


How to pass GeoJSON object to ST_GeomFromGeoJSON

As shown in the below posted code, I am trying to print and pass the value of feature['geometry'] to the method postgreSQLHelper.queryPostgreSQLForGeoJSON the output of the log-statement: DEBUG:root:feature['geometry']: {'type': 'Polygon', 'coordinates': [[[6.69223420722764, 51.1329165124371], [6.69222819326484, 51.1329081193748], [6.69221180776184, 51.1329013203209], [6.69219149698336, 51.1329073049609], [6.69217949340067, 51.1329244260894], [6.69217956546811, 51.1329430447612], [6.69218526127669, 51.1329578171713], [6.692200130301, 51.1329606289999], [6.69220511560768, 51.1329581192089], [6.69221372090576, 51.1329518135339], [6.69222707128915, 51.132939215911], [6.69223420722764, 51.1329165124371]]]}  which is a valid GeoJSON format, but when I pass the object features['geometry'] to the method I receive an error: self.cur.execute(sql,bindings)  psycopg2.errors.SyntaxFehler: FEHLER: Syntaxfehler bei "type" ZEILE 1: SELECT ST_AsText(ST_GeomFromGeoJSON('{'type': 'Polygon', 'co... Why, despite the fact that the GeoJSON object is well formatted, does this error appear, and how do I fix it? I pass the code: for feature in featuresArray[0:1]:     logger.debug("feature['geometry']: {0}".format(feature['geometry']))     postgreSQLHelper.queryPostgreSQLForGeoJSON(feature['geometry'])


Php Regex - Match an optionnal pattern after any text

I want to match an optionnal specific pattern after a wildcard, how can I achieve this ? Here is my test string : RGF0027_a_Test string_987.test_004.jpg  I want to match the _004, it must be optionnal and it can have any text before that. Here is my current (not working) regex : ^([a-zA-Z0-9]+)_(a_)?.*(_(\d+))?\.\w+$  Of course the problem is that the .* also match the _004. I think the answer is to use assertions but I'm not really good with them ...


How to understand the memory usage and load average in linux server

I am using a linux server which has 128GB of memory and 24 cores. I use top to see how much it is used. Its output is pasted at the end of the post. Here are two questions:  (1) I see that each of the running processes occupies a very small percentage of memory (%MEM no more than 0.2%, and most just 0.0%), but how the total memory is almost used as in the fourth line of output ("Mem:  130766620k total, 130161072k used,   605548k free,   919300k buffers")? The sum of used percentage of memory over all processes seems unlikely to achieve almost 100%, doesn't it?  (2) how to understand the load average on the first line ("load average: 14.04, 14.02, 14.00")?   Thanks and regards!  Edit:  Thanks!  I also really like to hear some rough numbers based on used percentage of memory to determine if a server is heavily loaded, since I once became the one who cramed the server without understanding the current load.  Is swap regarded as almost the same as memory? For example, when memory and swap are almost of same size, if the memory is almost running out but the swap is still largely free, may I just view it as if the used percentage of memory + swap is still not high and run other new processes?  How would you consider together CPU or memory (or memory + swap) usage? Do you become worried if either of them reaches too high or both?  Output of top：  $ top    top - 12:45:33 up 19 days, 23:11, 18 users,  load average: 14.04, 14.02, 14.00 Tasks: 484 total,  12 running, 472 sleeping,   0 stopped,   0 zombie Cpu(s): 36.7%us, 19.7%sy,  0.0%ni, 43.6%id,  0.0%wa,  0.0%hi,  0.0%si,  0.0%st Mem:  130766620k total, 130161072k used,   605548k free,   919300k buffers Swap: 63111312k total,   500556k used, 62610756k free, 124437752k cached    PID USER      PR  NI  VIRT  RES  SHR S %CPU %MEM    TIME+  COMMAND  6529 sanchez   18  -2 1075m 219m  13m S  100  0.2  13760:23 MATLAB 13210 timothy   18  -2 48336  37m 1216 R  100  0.0   3:56.75 absurdity 13888 timothy   18  -2 48336  37m 1204 R  100  0.0   2:04.89 absurdity 14542 timothy   18  -2 48336  37m 1196 R  100  0.0   1:08.34 absurdity 14544 timothy   18  -2  2888 2076  400 R  100  0.0   1:06.14 gatherData  6183 sanchez   18  -2 1133m 195m  13m S  100  0.2  13676:04 MATLAB  6795 sanchez   18  -2 1079m 210m  13m S  100  0.2  13734:26 MATLAB 10178 timothy   18  -2 48336  37m 1204 R  100  0.0  11:33.93 absurdity  12438 timothy   18  -2 48336  37m 1216 R  100  0.0   5:38.17 absurdity 13661 timothy   18  -2 48336  37m 1216 R  100  0.0   2:44.13 absurdity 14098 timothy   18  -2 48336  37m 1204 R  100  0.0   1:58.31 absurdity 14335 timothy   18  -2 48336  37m 1196 R  100  0.0   1:08.93 absurdity 14765 timothy   18  -2 48336  37m 1196 R   99  0.0   0:32.57 absurdity 13445 timothy   18  -2 48336  37m 1216 R   99  0.0   3:01.37 absurdity 28990 root      20   0     0    0    0 S    2  0.0  65:50.21 pdflush 12141 tim       18  -2 19380 1660 1024 R    1  0.0   0:04.04 top  1240 root      15  -5     0    0    0 S    0  0.0  16:07.11 kjournald  9019 root      20   0  296m 4460 2616 S    0  0.0  82:19.51 kdm_greet     1 root      20   0  4028  728  592 S    0  0.0   0:03.11 init     2 root      15  -5     0    0    0 S    0  0.0   0:00.00 kthreadd     3 root      RT  -5     0    0    0 S    0  0.0   0:01.01 migration/0     4 root      15  -5     0    0    0 S    0  0.0   0:08.13 ksoftirqd/0     5 root      RT  -5     0    0    0 S    0  0.0   0:00.00 watchdog/0     6 root      RT  -5     0    0    0 S    0  0.0  17:27.31 migration/1     7 root      15  -5     0    0    0 S    0  0.0   0:01.21 ksoftirqd/1     8 root      RT  -5     0    0    0 S    0  0.0   0:00.00 watchdog/1     9 root      RT  -5     0    0    0 S    0  0.0  10:02.56 migration/2    10 root      15  -5     0    0    0 S    0  0.0   0:00.34 ksoftirqd/2    11 root      RT  -5     0    0    0 S    0  0.0   0:00.00 watchdog/2    12 root      RT  -5     0    0    0 S    0  0.0   4:29.53 migration/3    13 root      15  -5     0    0    0 S    0  0.0   0:00.34 ksoftirqd/3


How can I quickly level up in World of Warcraft?

I've been playing for months and I'm barely at level 40, while my classmates play less than I do and have multiple lvl 80 characters.  Is there a better way to level fast in World of Warcraft than just completing quests?


How to calculate $\int_0^{\pi/2} \sin^a x \cos^b x \,\mathrm{d} x$

$$\int_0^{\pi/2} \sin^a x \cos^b x \,\mathrm{d} x = \frac{\Gamma\left(\frac{1+a}{2}\right)\Gamma\left(\frac{1+b}{2}\right)}{2 \Gamma\left(1 + \frac{a + b}{2}\right)} \quad\quad\text{for } a, b > -1$$ according to Mathematica.  also lists a recursive expression for the indefinite integral when $a, b > 0$. My question is how to derive the explicit formula given by Mathematica (preferably without using esoteric special functions, but complex analysis is fine).


iptables port forwarding for UDP port has no effect

My problem:  I used the following iptables command:  iptables -t nat -A PREROUTING -p udp -i eth0 --dport 52220 -j DNAT --to-destination 192.168.19.40   192.168.19.40 is the IP address of a virtual machine, which is pingable:  root@Helium ~ # ip route get 192.168.19.40 192.168.19.40 dev untrusted-vm-br  src 192.168.19.1      cache  root@Helium ~ # ping 192.168.19.40 PING 192.168.19.40 (192.168.19.40) 56(84) bytes of data. 64 bytes from 192.168.19.40: icmp_seq=1 ttl=64 time=0.181 ms   However, UDP packets incoming from eth0 are not forwarded:  root@Helium ~ # tcpdump -i eth0 udp port 52220 tcpdump: verbose output suppressed, use -v or -vv for full protocol decode listening on eth0, link-type EN10MB (Ethernet), capture size 262144 bytes 20:36:15.425602 IP <reverse_hostname_of_my_home>.19834 > Helium.52220: UDP, length 160 20:36:23.621066 IP <reverse_hostname_of_my_home>.19834 > Helium.52220: UDP, length 160 ^C 2 packets captured 2 packets received by filter 0 packets dropped by kernel root@Helium ~ # tcpdump -i untrusted-vm-br udp port 52220 tcpdump: verbose output suppressed, use -v or -vv for full protocol decode listening on untrusted-vm-br, link-type EN10MB (Ethernet), capture size 262144 bytes ^C 0 packets captured 0 packets received by filter 0 packets dropped by kernel   I have similar port redirections for TCP ports, which all work as expected.  What am I doing wrong? Is there something specific to UDP I missed?    Additional debugging information:  IPv4 forwarding is enabled:  root@Helium ~ # cat /proc/sys/net/ipv4/ip_forward 1   Using iptables -v shows that no packet matched my iptable rule:  root@Helium ~ # iptables -L -v -t nat Chain PREROUTING (policy ACCEPT 9680 packets, 612K bytes)  pkts bytes target     prot opt in     out     source               destination          [...]     0     0 DNAT       udp  --  eth0   any     anywhere             anywhere             udp dpt:52220 to:192.168.19.40   I tried using iptables -j LOG:  iptables -t nat -A PREROUTING -p udp -j LOG --log-prefix "[iptables log udp]"   Which gives:  Aug 10 17:01:33 Helium kernel: [1824208.192607] [iptables log udp]IN=eth0 OUT= MAC=<mac_address_of_my_eth0> SRC=<ip_address_of_my_home> DST=<ip_address_of_eth0> LEN=188 TOS=0x00 PREC=0x00 TTL=51 ID=1476 DF PROTO=UDP SPT=19834 DPT=     Linux/iptables version:  root@Helium ~ # uname -a Linux Helium 3.16.0-4-amd64 #1 SMP Debian 3.16.7-ckt25-2+deb8u3 (2016-07-02) x86_64 GNU/Linux root@Helium ~ # iptables --version iptables v1.4.21


Python :ImportError: DLL load failed: The specified module could not be found

I am working on Python plugins for QGIS. I set my variables as   PATH :=C:\OSGeo4W\apps\qgis;%PATH% PYTHONPATH:=C:\OSGeo4W\apps\qgis\python   But when I try to run my .py file in IDLE I get an error saying:  Traceback (most recent call last):  File "C:\rt_sql_layer_working\DlgQueryBuilder.py", line 30, in from qgis.core import * ImportError: DLL load failed: The specified module could not be found.   What should I set for the PATH variable??


How do I create an internet shortcut within a folder?

I want to create an internet shortcut within a specified folder in Ubuntu 12.04. How do I do this?


My company is in the process of upgrading all of our users from old Windows XP computers to newer quad-core Win7 computers.  This is a good thing - it's long overdue that we upgrade our workstations - but I now spend a ton of time configuring new computers.  Is there any way to automate this process?  The steps that I go through with just about every computer:   Run through Win7 setup process (we do mostly HPs, so we get the stupid "The computer is personal again" thing.   Uninstall bloatware (norton, bing bar, roxio, etc.) Install Updates Add to domain & configure network settings Install Office, and other company-specific applications Configure important shortcuts (Outlook on task bar)   There's a couple other things that I do after that that would be nice to automate, but it's unlikely due to license keys, passwords, etc.   Configure Outlook Pull in files/settings with easy transfer wizard Map network drives   I know that it's possible to create a complete image of a computer, but how does that work with different hardware/drivers?  What about Win7 license keys?  If there is a way to make this work, what is the best (preferably free/open source) software out there to do this?