Find out distance between two points using Google map API based on medium (Road,Air,Ship)?
Google map API does not plot on different continents
What does "had had" mean? How does this differ from "had"? For example, what is the difference between the following two sentences:     I had a bad day      I had had a bad day $\lim\limits_{n \to{+}\infty}{\sqrt[n]{n!}}$ is infinite How do I prove that $ \displaystyle\lim_{n \to{+}\infty}{\sqrt[n]{n!}}$ is infinite? Where should I put  tags in HTML markup? Should we pass a shared_ptr by reference or by value? Different results between individual and batch clip of rasters in QGIS? The cardinality of a language over a set of variables $V$ with $\#V= κ$ In predicate logic, to define a language, we consider the following $3$ sets:  (1) $V$, the set of variables;  (2) $F$, the sets of function symbols;  (3) $P$, the set of predicate symbols with their arities.   Now I am concidering about determine the cardinality of a language over a set with arbitary cardinality, $κ$(Note that $κ$ can be either finite, countablely infinite or uncountablely infinite ).  May I please ask:  If the cardinality of $V$, $\#V = κ$, what conditions on $V$ , $F$ and $P$ will give us a language over $V$, $F$ and $P$ with cardinality $κ$?  And may I please ask if it is the fact that if $\kappa$ is finite, then to get a language with cardinality $\kappa$ we need $(V+F+P)^{&lt;\omega}=(\kappa+F+P)^{&lt;\omega}=\kappa$, so we can never have a language of cardinality $\kappa$. I think it is something weird here. Am I wrong with something?  I had googled it but I have get nothing from websites, now I am confused. Could someone please help? Thanks so much!  EDIT: Latter I am told that in my course, the cardinality of a language refers to the set of expression instead of this of the set of strings. So now I need to consider further about when a string makes sense.  EDIT':Now I am considering that if we can find out a general way to determine the cardinality of expression, which may related to combinatorics. See this question:  Any help would be appreciate. What space does the spell Cloud of Daggers fill? I am trying to workout what template  (PHB, p. 222) would be on a grid. The spell states:     You fill the air with spinning daggers in a cube 5 feet on each side, centered on a point you choose within range.   So does that mean it would look like this:     Or like this:    From what I've read online, there seems to be some suggestion that it is a single square (tile) though this does stack with the spell description of "a cube 5 feet on each side".  Clearing this up for my group would be great, and I am sure our DM will be pleased as his monster were nicely diced by this spell. Thanks. LyX - undefined control sequence but package seems to be added I am using LyX with MikTeX and I am trying to use the following command \oiiint but I am getting the following error:   \oiiint  The control sequence at the end of the top line of your error message was never \def'ed. If you have misspelled it (e.g., `\hobx'), type `I' and the correct spelling (e.g., `I\hbox'). Otherwise just continue, and I'll forget about whatever was undefined.   I have added \usepackage{mathdesign} to the preamble in:  Document -&gt; Settings -&gt; LaTeX Preamble  Why is this not working? how to have a custom zsh auto_cd command Instead of the normal cd I've created my own function  function cd {     builtin cd "$@" &amp;&amp; ls -F }   This works great for when I use commands like cd someDir/subDir but not when I change directories via zsh's auto_cd someDir/subDir.  Is there a way to customize what command gets called for auto_cd? Uniform distribution on the surface of unit sphere I know that there's a difference between relativistic and rest mass. Relativistic mass is "acquired" when an object is moving at speeds comparable to the speed of light. Rest mass is the inherent mass that something has regardless of the speed its moving at.  When fusion happens, a certain percentage of the rest mass of two hydrogen atoms is converted into energy. I understand that $E = m_{rest}c^2$.   How does the rest mass of an object turn into energy? Does this involve particle physics? Doesn't this suggest that rest mass can be viewed as some sort of potential energy? It seems to me that it's a sort of locked energy that has to undergo a certain process to expel its energy to surrounding particles.  Also, Why does only a small percentage of rest mass turn into energy? Why not all of it. What dictates how much rest mass gets converted into energy? How to fill a mesh with solid color Decision boundaries and Gaussian density functions Run cmd.exe in Administrator mode without explorer.exe I have a sword that currently rotates around a pivot point thats off of the actual object. Im new to blender and im not sure how i would go about changing it so that the sword rotates around the handle. Any help would be appreciated! boolean[] vs. BitSet: Which is more efficient? What is more efficient in terms of memory and CPU usage — an array of booleans or a BitSet? Specific BitSet methods are not used, only get/set/clear (==, =, Arrays.fill respectively for an array). Galois extension is (not) transitive Let $ K/ L /F $ be fields. If $K / L$ is Galois and $ L / F $ is Galois, then $ K / F$ is Galois. We mentioned this very quickly in today's class without justifying. But I have trouble seeing this. Any help is appreciated.  Our definition for $ K / F$ being Galois is the $F$-automorphism group $G = G( K / F) : = \{ \sigma \in aut (G) : \sigma_F = id_F \}$ fixes only $F$, i.e. $ \{ x \in K : \sigma (x) = x \text { for all } \sigma \in G  \} = F$.  But we also showed that $ K /F$ is Galois if and only if $ K/F$ is normal and separable. What is the difference between CurrentCulture and CurrentUICulture properties of CultureInfo in .NET? In .NET there is the CultureInfo class in the System.Globalization namespace. It has two similar properties both returning values of the CultureInfo type: CurrentCulture and CurrentUICulture.  What is the difference between them?   Which one should I use when and why? How to use C++ 11 features in the latest version of g++ Newbie here. I just got an error running from the terminal a C++ program I wrote: error: ‘stoi’ is not a member of ‘std’. They told me the compiler is too old.  I'm using Ubuntu 14.04.  My g++ version is 4.8.4.  How do I upgrade? Serial protocol delimiting/synchronization techniques As asynchronous serial communication is widely spread among electronic devices even nowadays, I believe many of us have encountered such a question from time to time. Consider an electronic device D and a computer PC connected with serial line (RS-232 or similar) and required to exchange information continuously. I.e. PC is sending a command frame each X ms, and D is replying with status report/telemetry frame each Y ms (The report can be sent as response to requests or independently - doesn't really matter here). The communication frames can contain any arbitrary binary data. Assuming the communication frames are fixed-length packets. The problem: As the protocol is continuous, the receiving side might loose the synchronization or just &quot;join&quot; in the middle of an ongoing sent frame, so it just won't know where the start of frame (SOF) is. A the data has different meaning based on its position relatively to the SOF, the received data will become corrupted, potentially forever. The required solution Reliable delimiting/synchronization scheme to detect the SOF with short recovery time (i.e. it shouldn't take more than, say 1 frame to resynchronize). The existing techniques I am aware (and using some) of: 1) Header / checksum - SOF as predefined byte value. Checksum in the end of frame.  Pros: Simple. Cons: Not reliable. Unknown recovery time.  2) Byte stuffing:  Pros: Reliable, fast recovery, can be used with any hardware Cons: Not that suitable for fixed-size frame-based communication  3) 9th bit marking - prepend each byte with additional bit, while SOF marked with 1 and the data bytes are marked with 0:  Pros: Reliable, fast recovery Cons: Requires hardware support. Not directly supported by most of PC hardware and software.  4) 8th bit marking - kind of emulation of the above, while using the 8th bit instead of 9th, which is leaving only 7bits for each data word.  Pros: Reliable, fast recovery, can be used with any hardware. Cons: Requires an encoding/decoding scheme from/to the conventional 8-bit representation to/from 7-bit representation. Somewhat wasteful.  5) Timeout based - assume the SOF as the first byte coming after some defined idle time.  Pros: No data overhead, simple. Cons: Not that reliable. Won't work well with poor timing systems like, say, Windows PC. Potential throughput overhead.  Question: What are the other possible techniques/solutions exist to address the problem? Can you point to the cons in the above list which can be easily worked around, thus removing them? How do you (or would you) design your systems protocol?