Can I know which "search engine" the visitor used to be on my site?  For example:   If the visitor searched for my website in google, when click on link from google to my website,  i need to know the search engine name, here is "google.com".  The same if searched on yahoo , and click on my site link, i will get yahoo.com as a search engine.    It's possible?
Is it possible to check who is entering your website in PHP. I have a web application ( written in PHP) that should only allow users entering from some particular websites. Is it possible to get the referral websites by examining the _Request object? If yes, how?
Installing TTF fonts in LaTeX One of the annoying aspects of LaTeX is the limited number of fonts that come by default, and the pain involved in making new fonts 'LaTeX' ready. I have a collection of truetype fonts that I'd like to prepare for use, and I definitely want to make sure I have vector versions of these fonts (i.e not type 3/bitmapped versions). Is there a relatively painless way to do this ? Is there any way in unix to find out who accessed certain file in last 1 week? It may be user or some script ftp it to some other place. Can I get a list of user name who accessed certain file? How can I find out who is accessing particular file?? Note: Suppose $f(z)$ is a polynomial or a proper/strictly proper rational function.   Can someone demonstrate why if all coefficient of $f(z)$ are real then relation $f(\bar z)$ = $\bar {f(z)}$ hold  Is there a theorem for this result? Is it posible to add iframe directly in lightning components? Is it possible to add iframe directly in a lightning component as below to visible in community sites ?  &lt;aura:component implements="forceCommunity:availableForAllPageTypes" access="global" &gt;     &lt;iframe width="800" height="600" style="border: 1px solid" src="---" /&gt; &lt;/aura:component&gt; Why is the last digit of $n^5$ equal to the last digit of $n$? I was wondering why the last digit of $n^5$ is that of $n$? What's the proof and logic behind the statement? I have no idea where to start. Can someone please provide a simple proof or some general ideas about how I can figure out the proof myself? Thanks. Coordinate-Free Definition of Trace. $\DeclareMathOperator{\tr}{trace}$ I am reading the  on the trace operator. The section titled Coordinate-Free Definition defines the trace as follows.  Let $V$ be a finite dimensional vector space over a field $F$ and define a bilinear map $f:V\times V^*\to F$ as $f(v, \omega)=\omega(v)$ for all $(v, \omega)\in V\times V^*$. This maps induces a unique linear map $\tr:V\otimes V^*\to F$. Since $\text{End}(V)$ has a canonical isomorphism with $V\otimes V^*$, we have now a notion of trace of a linear operator on $V$.  The Question: The second paragraph of the section in the article says that  This also clarifies why $\tr(AB)=\tr(BA)$.  I can't see how $\tr(AB)=\tr(BA)$ follows from this definition at all. Can somebody give me a hint? Proving this relation is transitive Let $r$ be a relation on $A \times A$ such that $(a,b) r (c,d) \iff ad = bc.$ How can I show that this relation is transitive, ie. $(a, b)r(c,d)$ and $(c,d)r(e, f) \implies (a,b)r(e,f)$?  I tried to say that $(a,b) r (c,d)$ means that $c=ka$ and $d=kb,$ $k$ a coefficient, such that $ad = bc \iff akb = bka,$ and going on from there, but I'm not sure this is valid for all values of $a, b, c,$ and $d$. How can I show the transitivity of the relation? I want to Setup GIMP 2.10 on Ubuntu 16.04 (Xenial Xerus) without flatpak.  can it be possible now or on future?? Semicolons at the end of list items In school, we were taught to end each list item with a semicolon. But I have never actually seen this. Can somebody please confirm this? Should we end each list item with anything at all?  I've seen people use periods after each list item, colons, and even commas. But I've never seen a semicolon at the end of each item — and even if I have, it would be that rare that I've forgotten.  Example:   item; item; item; item In a family with two children, what are the chances, if one of the children is a girl, that both children are girls? When I enter single quote ' in terminal it goes to some other mode, and commands don't execute. What is this mode and when do we use it?  root@sai:~# ' &gt; ls &gt; ' ls : command not found root@sai:~# Let $G$ be a finite group and suppose there exists $f\in\text{Aut}(G)$ such that $f^2=\text{id}_G$, i.e., $f$ is its own inverse, and such that $f$ has no fixed points other than the identity $e$ of $G$, i.e., $f(x)=x\Rightarrow x=e$. Show that $G$ is necessarily abelian.   While trying to do this exercise I noticed two facts.  First, $g$ and $f(g)$ have the same order because $o(f(g))|o(g)$ and, applying $f$ again and using $f^2=\text{id}_G$, $o(f(f(g)))=o(g)|o(f(g))$ and, once the order of any element is $\geq 1$, it follows that $o(g)=o(f(g))$. Also, it's easy to see that $g$ and $f(g)$ commute.  Second, there cannot exist such an automorphism if the order of $G$ is even, because $f(e)=e$ and we can form pairs like $\{g,f(g)\}$ with $f(g)\neq g$ that are invariant under $f$, i.e., $f(\{g,f(g)\})=\{g,f(g)\}$. But once the order of $G$ is even, proceeding with the construction of the pairs, we'll end up with just one element $\neq e$, so we must have some $\gamma\in G\setminus{e}$ with $f(\gamma)=\gamma$, contradicting the hypothesis.  Let $n$ be the order of $G$ and let's fix an enumeration of the elements of $G$, say $G=\{g_1,\ldots,g_n\}$. My approach was the following. For each $\sigma\in S_n$, let $x_{\sigma}=\prod_{i=1}^ng_{\sigma(i)}$. Then we have that $f(x_{\sigma})=x_{\sigma^{\prime}}$. If it's shown that $f(x_{\sigma})=e\;\forall\;\sigma\in S_n$, then we'd have $x_{\sigma}=e\;\forall\;\sigma\in S_n$, which implies that $G$ is abelian. The problem is that $S_n$ has $n!$ elements while $G$ has $n$ elements, so there repetitions among the $x_{\sigma}$, and we cannot apply directly the reasoning of the last paragraph.  Is this the right way, or is there an easier manner to solve this? When is the Killing form null? When is the Killing form $\kappa$ of a Lie algebra $\mathfrak g$ null, i.e. $\kappa(\cdot,\cdot)=0$? Surely this is true for any Lie algebra with trivial bracket, but is this the only case? I can't seem to find any nontrivial examples. Add high-resolution-graphics and / or .svg-icons I have a .tiff and a .tfw file that I want to change into a GeoTIFF. When I try to open the file in ArcMap and ENVI 5.0, it is successful. However, in Google Earth it is not.  Is there anyway to create the GeoTiff in ArcMap or ENVI? Schengen visa validity start date My Chinese in-laws intend to visit us in one month from now. Their visa is valid from Nov 23rd. Would it be possible for them to take the airplane on November 22nd in China and arrive in Schengen area on November 23rd?  Or does the visa already have to be valid upon departure?  In our particular case, they still need to transfer in Beijing first. The actual flight to Schengen zone effectively only departs on the 23rd so I guess that should be completely fine then? As I understand, the different voltage between two object is caused by the total different charged between two object. Thus, the higher extra electron between two opposite charged object, the higher voltage between them, isn't it? So if i have two battery or capacitor connect in parallel, the negative connect to negative, the positive connect to the positive. Caused the charge from each plate to be double. So that's as my expected, it must be double voltage, but ironically why it's out of my expected and the reality is vice-versa? I am using Ubuntu 12.04.  My /etc/network/interfaces file consists of:    # The loopback network interface   auto lo   iface lo inet loopback     # The primary network interface   auto eth0  iface eth0 inet static   address 192.168.1.58   gateway 192.168.1.1 network 192.168.1.0   broadcast 192.168.1.255 dns-nameservers 66.212.63.228 66.212.48.10     I ran the command: /etc/init.d/networking restart  Which responded with:   *Running /etc/init.d/networking restart is deprecated because it may not enable again some interfaces   *Reconfiguring network interfaces...   RTNETLINK answers: File exists   Failed to bring up eth0   [ OK ]     Next I ran ping google.com and received:    ping: unknown host google.com   I am not sure if my interfaces refreshed. How do I properly configure my network with my static DNS addresses? If someone else is booking international ticket for me using his credit or debit card, does he need to be present physically at the time of check-in?   Suppose I am coming back from Singapore to my home country and my ticket is booked by my friend for me, who lives in my home country. Do airlines in Singapore ask for the person to be present physically to check in? I am wondering, given the minimal polynomial of $A$, what can we say about the minimal polynomial of $A^n$?  I know that if we were looking at the roots of the characteristic polynomial ie eigenvalues then the roots of the characteristic polynomial of $A^n$ would be $nth$ powers of the eigenvalues so again these are roots of the minimal polynomial also.