I am a student of Indian nationality, currently pursuing my bachelor's in Electronics and Communication Engineering. I wish to pursue a Ph.D. and later a career in astronomy (with an inclination to Radio Astronomy) and have done relevant research internships and projects in the same. However, I have no publications in this area. Alongside this, I have worked on research in antenna engineering with a professor in my institute and we have published 2 papers in international conferences. My query is: for graduate admissions, will my research papers in antenna engineering have any value and consideration or are only research papers in Astronomy looked out for?
I am a economics major undergraduate student who will apply for grad schools in the coming semester. I think I have quite a strong research experience in mathematical statistics (asymptotic statistics to be specific), but, unfortunately, not much in economics itself. So I am curious if economics departments in graduate schools will care about my research experience in statistics?  Maybe a broader question is if grad schools care about applicants' research experience in a different (maybe even unrelated) field at all? I guess in my case statistics and economics are still quite correlated, but what about other more distant combinations of target departments and previous research experience?
View revision history on mobile site It looks like it's currently not possible to view the revision history of a post from the mobile site. I think it would be a lot simpler than loading the desktop site on a phone just to get the revision history. Energy-Momentum Tensor in QFT vs. GR What is the correspondence between the conserved canonical energy-momentum tensor, which is $$ T^{\mu\nu}_{can} := \sum_{i=1}^N\frac{\delta\mathcal{L}_{Matter}}{\delta(\partial_\mu f_i)}\partial^\nu f_i - \eta^{\mu\nu}\mathcal{L}$$ (the four conserved Noether currents corresponding to four possible spacetime translations)  where $\{f_i\}_{i=1}^N$ are the $N$ matter fields in the theory, and we assume $f_i\mapsto\alpha^\nu\partial_\nu f_i$ for translations,  and stress-energy tensor from the Einstein-Hilbert action, which is: $$ T_{\mu\nu}\equiv-\frac{2}{\sqrt{-g}}\frac{\delta\mathcal{L}_{Matter}}{\delta g^{\mu\nu}} $$   In particular, how do you get that the two are equal (are they?) for Minkowski space, for which there is no variation in the metric? What is the proper use of [square brackets] in quotes? How to print the longest line in a file? I'm looking for the simplest method to print the longest line in a file. I did some googling and surprisingly couldn't seem to find an answer. I frequently print the length of the longest line in a file, but I don't know how to actually print the longest line. Can anyone provide a solution to print the longest line in a file? Thanks in advance. Is it possible to delete the "useless" apps pre-installed on my Mac? Rendered image doesn't show what Rendered Viewport shows... (pictures below) Calculate first difference by group in R One of my favorite quotes is by Alvin Toffler which says:     The illiterate of the 21st century will not be those who cannot read   and write, but those who cannot learn, unlearn, and relearn.   The way I understand "relearn" in the quote is to learn something new that is different from what was originally learned.  I'm wondering in general if "relearn" convey learning the same thing again, or a different thing, or it depends on the context of the sentence. Is the same thing true for "learn again"? Is a strong background in maths a total requisite for ML? I'm starting to want to advance my own skillset and I've always been fascinated by machine learning. However, six years ago instead of pursuing this I decided to take a completely unrelated degree to computer science.   I have been developing software and applications for about 8-10 years now, so I have a good handle but I just can't seem to penetrate the maths side of machine learning/probabilities/statistics.   I start looking at learning material and on the first page it might include something which confuses me and immediately sets up a barrier in my learning.   Is a strong background in maths a total requisite for ML? Should I try and fill in the blanks of my maths before continuing with ML? Can self learning really work for just a developer without any hard computer science background?    Related question: Opposite of "straight talk" I have a problem with verb structure In this sentence:     Four items are responsible for three-fourths of the overall spending around the world, the most prominent share being that of food.   Why after the comma, the verb "being" is used? Why it does not use "is"? What are the automorphisms acting on $Q\sqrt[3]{2}$ that fixes Q? What does "ain't" mean? What does the contraction ain't mean? Is it appropriate to use it in formal settings? About the continuity of the function $f(x) = \sum\limits_k2^{-k}\mathbf 1_{q_k \leq x}$ Let $q: \mathbb{N} \to \mathbb{Q}$ be a bijection and denote the image of $k \in \mathbb{N}$ by $q_k$.  Let $f: \mathbb{R} \to (0,1)$, $$ f(x) = \underset{q_k \leq x}{\sum_{k \in \mathbb{N}}} 2^{-k} $$  Show that:  1) $f$ is strictly increasing  2) $f$ is continuous at $x$ iff $x \in \mathbb{R} \setminus \mathbb{Q}$.  My work:  Let $x, y \in \mathbb{R}$, $x &lt; y$. Then there exists $q_n \in \mathbb{Q}$ s.t. $x &lt; q_n &lt; y$. Now $$ f(x) = \underset{q_k \leq x}{\sum_{k \in \mathbb{N}}} 2^{-k} &lt; \underset{q_k \leq x}{\sum_{k \in \mathbb{N}}} 2^{-k} + 2^{-n} \leq \underset{q_k \leq y}{\sum_{k \in \mathbb{N}}} 2^{-n} = f(y) $$ so $f$ is strictly increasing.  I think my proof of 1) is ok, but how can I prove 2)? small limits in the pointed category of a category with all small limits In Hovey, Model Categories, he says that given a category $\mathcal{C}$ with a small limits and colimits, if we form the category of pointed objects ,i.e. the category with objects as morphisms $*\rightarrow A$ where * is the terminal object, then this category $\mathcal{C}_*$also has all small limits and colimits.  To prove this, for any Functor $F:J\rightarrow \mathcal{C}_* $ where $J$ is small we compose it with the forgetful functor $\mathcal{C}_* \rightarrow \mathcal{C}$ and take the limit here. My question is how will this give a limit in $\mathcal{C}_*$? we will get an object in the category, but how do we get the arrow from $*$ to that object? How do you get vim to display wrapped lines without inserting newlines? I'm getting back in touch with my inner (g)vim due to an unscheduled MacBook mother(board) of a meltdown (my emergency backup Linux box won't run TextMate). All told I'm happy with vim's efficiency and power, but I'm mortified at how hard it is to get the kind of word wrap that even stupid HTML textareas achieve with no apparent effort.  Consider the text  Etiam ornare mollis tortor. Suspendisse sed neque. Nullam in elit. Cum sociis nullam.  By default, with an 80-character width vim displays this as  Etiam ornare mollis tortor. Suspendisse sed neque. Nullam in elit. Cum sociis nu llam.  This wrapping doesn't care about whitespace, so sometimes it just slices words into pieces (nullam in this case). Of course, you can turn on word wrap, and get this:  Etiam ornare mollis tortor. Suspendisse sed neque. Nullam in elit. Cum sociis nullam.  The problem is that vim inserts a newline at the linebreak, which I most emphatically do not want. In other words, I want the text to display exactly as vim displays it with word wrap turned on, but without inserting a newline. (This way it can be pasted into HTML textareas and email programs, among other places.)  Web searches have yielded nothing of use, despite diligent effort; I hope StackOverflow can succeed where my Google-fu has failed. $C^2 $embedded in holder space? I have a question on Holder space.Is the space $C^2(\mathbb{R}^n)$ embedded in $C^{1,\alpha}(\mathbb{R}^n)$? I think in the bounded domain case, this should be true. But what if in the case where the domain is not bounded? Thanks for any hint! EL proposals / autocomplete / code assist in Facelets with Eclipse Let $L$ be a finitely generated free module over a commutative ring $A$. Set $n=\operatorname{rank} L$. Let $x_1,\dots,x_m$ be generators of $L$. Then $m \ge n$? If $m = n$, then is $x_1,\dots,x_m$ a basis of $L$? Number of connected components of the complement of a compact Let $X$ be a connected, locally compact space and let $K$ be a compact subset of $X$. Is the number of connected components of the complement $X\setminus K$ finite? If it is not, are there some hypotheses over $X$ for finiteness of connected components?