I am trying to understand some of the source code behind Google AdSense. Google's code generator () says to put the following in the HEAD element: &lt;script type=&quot;text/javascript&quot; charset=&quot;utf-8&quot;&gt;     (          function(G,o,O,g,L,e) {             G[g]=G[g] || function(){(G[g]['q']=G[g]['q'] || []).push(arguments)},                      G[g]['t']=1*new Date;              L=o.createElement(O), e=o.getElementsByTagName(O)[0];             L.async=1;             L.src='//www.google.com/adsense/search/async-ads.js';             e.parentNode.insertBefore(L,e) /* no semicolon...why? */         }      )(window,document,'script','_googCsa'); /* argument list */ &lt;/script&gt;  My knowledge of JS syntax is not very good, and I don't know answers to the following: (1) A function inside a set of parentheses, and then what looks like an argument list, (2) No semicolon after the last line in the curly braces...what's going on here? (3) What is function(GoOgLe) actually doing? (I tried Googling &quot;function(G,o,O,g,L,e)&quot;, but only got others' source code.) Any help would be appreciated.
I'm new to both JavaScript and . In YUI library examples, you can find many uses of this construct:  (function() {     var Dom = YAHOO.util.Dom,     Event = YAHOO.util.Event,     layout = null,         ... })();   I think the last couple of parentheses are to execute the function just after the declaration.  ... But what about the previous set of parentheses surrounding the function declaration?  I think it is a matter of scope; that's to hide inside variables to outside functions and possibly global objects. Is it? More generally, what are the mechanics of those parentheses?
I'm trying to model an , but it's not going so well when it comes to the magazine of the weapon.   Next to the magazine is a mesh. I want to cut holes in the mag with that mesh. But the magazine just goes invisible or connects with the mesh when trying to execute the Boolean Modifier. I have tested to invert the normals and some other stuff, but it isn't working. Where can I get an Ubuntu Installation CD/DVD/USB? How to make a bibliography (for total beginners)? Ampere's circuital law for finite current carrying wire When I was studying about . Then there comes a question in my mind that "whether this law is applicable for finite current carrying wire or not" pgfplots and using axis cs to add points I am trying to mark two inflection points using a foreach loop in a pgfplot, but it isn't working.  \documentclass[tikz]{standalone} \usepackage{pgfplots} \pgfplotsset{compat = 1.10}  \begin{document} \begin{tikzpicture}   \pgfmathsetmacro{\infx}{1/sqrt(2)}   \pgfmathsetmacro{\infy}{exp(-.5)}   \begin{axis}[     xmin = -3,     xmax = 3,     ymin = -0.1,     ymax = 1.05,     domain = -4:4     ]     \addplot[blue, samples = 500, smooth] gnuplot {exp(-x^2)};      \foreach \x/\y in {\infx/\infy, -\infx/\infy}{       \draw[red] (axis cs: \x, \y) circle[radius = .025];     }   \end{axis} \end{tikzpicture} \end{document}   I am being told:  Undefined control sequence.^M &lt;argument&gt; axis cs: \x ^M                        , \y ^M l.34   \end{axis}^M Was Dumbledore aware that Professor Snape took points from Harry/Gryffindor unfairly? In many situations, we see Professor Snape behave in an unfair manner.   Snape unfairly and arbitrarily takes house points away from Harry/Gryffindors.  Was Dumbledore aware of this and, if so, did he just not care, or did he support this to somehow help Snape's double agent role? Proving that the set of $\nu$ measurable sets $M\subseteq P(X)$ is an algebra How exactly does Knuth's Up-Arrow notation work? I've done some research, and found this on Wikipedia. \begin{matrix}a\uparrow b=a^{b}=&amp;\underbrace {a\times a\times \dots \times a} \\&amp;b{\mbox{ copies of }}a\end{matrix} \begin{matrix}a\uparrow \uparrow b&amp;={\ ^{b}a}=&amp;\underbrace {a^{a^{{}^{.\,^{.\,^{.\,^{a}}}}}}} &amp;=&amp;\underbrace {a\uparrow (a\uparrow (\dots \uparrow a))} \\&amp;&amp;b{\mbox{ copies of }}a&amp;&amp;b{\mbox{ copies of }}a\end{matrix} I'm still a bit confused on this topic. I've done a lot of research, but I can't seem to understand this. Could somebody explain this in an understandable way? From what I can gather, for example 2↑↑3 would be 2^2^2 = 16? Then 2↑↑↑3 would be 2^2^2^2 = 256? Am I correct, or have I mis-interpreted this? When a 0-1-matrix with exactly two 1’s on each column and on each row is non-degenerated? [1] Let $A$ be an $n\times n$ matrix with entries in the set $\{0,1\}$ which has exactly two ones in each column and two ones in each row.  Give necessary and sufficient conditions for the rank of $A$ to be $n$. Can Blindsight "See" Through Walls, Floors, And Ceilings? I am currently play-testing an Awakened Mystic character in D&amp;D 5e, using the beta rules . As such, I have an ability that lets me choose between having Blindsight or Tremorsense.  BLINDSIGHT: ...[B]lindsight can perceive its surroundings without relying on sight, within a specific radius.... (Monster Manual p.8) TREMORSENSE: ...[T]remorsense can detect and pinpoint the origin of vibrations within a specific radius, provided that the [observer] and the source of the vibrations are in contact with the same ground or substance. Tremorsense can't be used to detect flying or incorporeal creatures.... (Monster Manual p.9)  I have been wondering what the difference is between these two, aside from the fact that Tremorsense requires contact with the ground and cannot detect flying or incorporeal creatures. Specifically, I want to know whether Blindsight cannot detect creatures through solid matter such as walls, floors, and ceilings, whereas Tremorsense can? Can Blindsight detect creatures on the other side of a dungeon wall, or on another floor of said dungeon? Are there monsters in 5th Edition that possess both Blindsight and Tremorsense, and if so, when and why would they use one as opposed to the other? I am aware of and appreciate  regarding Blingsight's capability to detect invisible creatures, but it doesn't exactly address my issue of whether solid matter effectively &quot;blocks&quot; Blindsight. I will gladly consider either rules-as-written or rules-as-interpreted answers. If there is a published game mechanic or a posted developer ruling I have overlooked, please include and cite them in your answer. Are there any journals that pay reviewers? Being a young researcher myself I received a comment from my colleague that some of the journals are paying reviewers for the reviewing process.  When I gave it a thought, it started to make more sense. In case of high quality, respected journal, an institution may consider itself privileged to have a reviewer of such journal and allow the reviewer to dedicate small proportion of his/her daily activities just on the reviewing process.  The reviewer being paid, has more obligations to provide thorough in depth review.  Does that hold true for some journals or is it just a myth? I am using setInterval(fname, 10000); to call a function every 10 seconds in JavaScript. Is it possible to stop calling it on some event?   I want the user to be able to stop the repeated refresh of data. is piped ls the same as ls -1? ls returns output in several columns, whereas ls|cat returns byte-identical output with ls -1 for directories I've tried. Still I see ls -1 piped in answers, like ls -1|wc -l. Is there ever a reason to prefer ls -1? Why does ...|cat change the output of ls? $S_3$ permutes the elements of $\mathbb{R}^3$, show that $\sigma (x_1, x_2, x_3) = ( x_{\sigma^{-1}(1)}, x_{\sigma^{-1}(2)}, x_{\sigma^{-1}(3)})$. Why don't we include $\rho g h$ in a hydraulic jack below? mysqli_fetch_assoc() expects parameter / Call to a member function bind_param() errors. How to get the actual mysql error and fix it? When I run the following query in query editor I get this error.  Error     Unknown error parsing query   Query  SELECT Id, OwnerId,Account.OwnerId FROM Contact where OwnerId = Account.OwnerId limit 100   Does anybody know what the problem is? Increasing the Size of Beamer Footer I work in Beamer extensively (specifically the Madrid theme). Sometimes, my "title" is quite long. Beamer puts this title at the bottom, but when it's too long it cuts it off. I'd really like to know how to increase the size of the bottom middle rectangular footer.    Here's the code (sorry for all of the packages and commands):  \documentclass[t]{beamer} %Add "mathserif" to script math lettering. "t" places all text to start at the top of each slide \usetheme{Madrid}  %Packages  \usepackage{amsmath} %Math mode \usepackage{amssymb} %Math mode \usepackage{commath} \usepackage{graphicx} %Including pictures \usepackage{color} %Define colours \usepackage{setspace} %Enables double-spacing/variable spacing \usepackage{pgfplots} %Draw graphs \usepackage{upgreek} %Insert theta symbol as unitalicized  \usepackage[version=3]{mhchem} %Chemistry equation mode \ce{} \usepackage[export]{adjustbox} %Place black borders around images \usepackage{scrextend} %Used to change font size \usepackage{caption} %Used to utilize * in caption function \usepackage{subfig} %Used to place figures side-by-side with sub-captions \usepackage{siunitx} %SI Units (+ scientific notation) \usepackage{cancel} \usepackage{fancybox} %\usepackage{enumitem} %Making lists %\usepackage[english]{babel} %Lists with letters  %Erases Beamer Navigation Symbols on the bottom left \setbeamertemplate{navigation symbols}{}  %\setbeamertemplate{footline}{} \captionsetup[subfigure]{labelformat=empty}  %Defined Colours \definecolor{orangered}{RGB}{255,69,0} \definecolor{darkgreen}{RGB}{0,100,0}  \definecolor{firebrick}{RGB}{178, 34, 34} \definecolor{navy}{RGB}{0,0,128} \definecolor{lightsteelblue}{RGB}{176,196,222} \definecolor{steelblue}{RGB}{70,130,180} \definecolor{darkslateblue}{RGB}{72, 61, 139} \definecolor{forestgreen}{RGB}{34, 139, 34} \definecolor{Gold}{RGB}{218,165,32}  %Defined Colour Theme and List Sizing \setbeamercolor{structure}{fg = Gold} \setbeamertemplate{navigation symbols}{}  \setbeamerfont*{itemize/enumerate body}{size=\normalsize} \setbeamerfont*{itemize/enumerate subbody}{parent=itemize/enumerate body} \setbeamerfont*{itemize/enumerate subsubbody}{parent=itemize/enumerate body}  %Opening Title Page \title{Chapter 7 - Absolute Value and Reciprocal Functions} \subtitle{Section 7.3 - Absolute Value Equations} \date{}  \begin{document}     %Slide 1     \maketitle \end{document} Why does C/C++ differentiates in case of array index out of bound #include &lt;stdio.h&gt; int main() {     int a[10];     a[3]=4;     a[11]=3;//does not give segmentation fault     a[25]=4;//does not give segmentation fault     a[20000]=3; //gives segmentation fault     return 0; }  I understand that it's trying to access memory allocated to process or thread in case of a[11] or a[25] and it's going out of stack bounds in case of a[20000]. Why doesn't compiler or linker give an error, aren't they aware of the array size? If not then how does sizeof(a) work correctly? Assume that $Y_0,\ldots , Y_n$ are independent random variables with the following identical distribution: $Y_i=1$ with propability $p$ and $Y_i=0$ with propability $1-p$. Also set $S_0=0$ and $S_n=Y_0+\ldots + Y_n$.  It's quite trivial that $(Y_n)_{n\geq 0}$ is a Markov chain, and I managed to show that $(X_n)=(S_n)_{n\geq 0}$ is also a Markov chain, by showing that  $\mathbb{P}(X_{n+1}=i_{n+1}\,|\,X_0=i_0,\ldots,X_n=i_n)=\mathbb{P}(X_{n+1}-X_n=i_{n+1}-X_n\,|\,X_0=i_0,\ldots,X_n=i_n)=\mathbb{P}(Y_{n+1}=i_{n+1}-X_n\,|\,X_0=i_0,\ldots,X_n=i_n)=\mathbb{P}(Y_{n+1}=i_{n+1}-i_n)=\mathbb{P}(Y_{n+1}+i_n=i_{n+1})=\mathbb{P}(X_{n+1}=i_{n+1}\,|\,X_n=i_n)$  However I am now running into the problem that I have to find whether or not $(X_n)=(S_0+\ldots + S_n)_{n\geq 0}$ is a Markov chain. I suspect that it isn't, but i'm having trouble finding a counterexample. I also need to find if $(X_n)=(S_n, S_0+\ldots+S_n)$ is a Markov chain, but I think this actually might be one, since $X_n$ gives "more information" (so to speak) to $X_(n+1)$. Again, having trouble actually proving that.  I appreciate any help, tips etc you can give me.