sql concatenate line
How to concatenate text from multiple rows into a single text string in SQL server?
I was going through the topic "formation of comparative and superlative".       The rule says     When two objects are compared with each other, the latter term of comparison must exclude the former, as in "Iron is more useful than any other metal". If we say "Iron is more useful than any metal", that is the same thing as saying    "Iron is more useful than iron", since iron is itself a metal.   I am finding difficulty to relate the rule with example. A classic exponential inequality: $x^y+y^x>1$ This is a classic problem, but I haven't seen it on the site before.     Suppose $x$ and $y$ are real numbers that both lie in the interval   $(0,1)$. Prove  $$x^y+y^x&gt;1.$$   The following spoiler box contains a hint that indicates the solution I know. Does anyone know a more natural solution?       Use Bernoulli's inequality to show $$x^y\ge \frac{x}{x+y}.$$   Edit: I recently learned the source is the 1996 French math olympiad. How to make sure one understands each and every detail while reading a textbook/research paper without leaving any gaps? I am a physics Master's student.  I have good grades, with CGPA above 9(/10)(However, all courses in my university are graded on a curve so the actual marks are significantly lower than 90%). This has been my marks throughout my undergraduate and graduate courses and I was happy because this was above average. Also, my summer projects in UG were usually computational and any difficulty I had in theoretical aspects I attributed it to my inexperience in advanced Physics.   However, recently I have started to work on pure theoretical project and while reading for the project I realized that I consistently miss some details from each topic. I understand the general idea, can re-derive most of the equations(with some effort) however when I discuss things with my professor or when I read further topics I realize that I have missed certain key-details. This is exactly similar to the case of me missing a few key questions in my exams and getting that 9 grade point instead of 10(or at-least I think so). I was not worried about this before but now I realize that there is some flaw in the way I study (but I do not know what).   Since I want to apply for Physics PhD I realized that I will need to have solid concepts and it would be best to correct my mistakes but I do not know how or even what could be the reason for my imperfect understanding.  Any direct suggestion would help or even certain general guidelines on what I can do.    Things I've tried recently -   1) I've started to written down almost everything I read. This is slightly laborious but is certainly helping. It also helps me to gloss over the things I read previously when I come back the next day.  2) I completely avoid smartphone when I'm library/study room so that I won't get distracted. Not sure if it helps me solve the above problem but certainly helps me study better in general.  3) I've tried to read the topics from several sources. The books I am reading is somewhat like a collection of research papers and hence does not have a exercises. So I though reading from various sources might help get better ideas but it's not really helping because most other sources are too high level as an introductory text. But this will probably help me in cases where it's practical to do this.  4) Somewhat similar to point (1)- I am trying reread, whenever I can, what I've done until that point. But not sure how much this will help me in filling the gaps. Someone who just thinks they know what they're talking about $\lfloor x\rfloor + \lfloor y\rfloor \leq \lfloor x+y\rfloor$ for every pair of numbers of $x$ and $y$ Give a convincing argument that $\lfloor x\rfloor + \lfloor y\rfloor \leq \lfloor x+y\rfloor$ for every pair of numbers $x$ and $y$. Could someone please explain how to prove this? I attempted to say that the largest values that could be added to $x$ and $y$ is $0.99$ and that doing so still made $\lfloor x\rfloor + \lfloor y\rfloor &lt; \lfloor x+y\rfloor$. However, my answer was not accepted. What exactly is the point of memoryview in Python How to get directory size in PHP I have passed the calc sequence, and thought that I understood things.  But I have trouble with limits now and again.  From the way I understand it, the 'best' way to evaluate a limit, is to evaluate the expression at the number in the limit.  In that way it's not only a limit, but an algebraic expression (so, I think, the need for limits goes away entirely, superseded by accuracy.)  But then I see something like $\lim_{x\to 2} \frac{x^2-4}{x-2}$.  Now, I think in my mind 'the best way to evaluate this is just to plug in $2$'  But it doesn't work that way, as the limit is $4$, and if I plug in, the answer is $0/0$.  I think that people here, with their natural talent in math, can perceive where my train of thought is going wrong, and correct me.  Please! How do I create a shortcut for a script, and run it as a .desktop file? I have installed Teamspeak onto my Ubuntu 15.10 system. Teamspeak requires a script to be ran in-order to start. How can I create a symbolic link that is a .desktop so I can open the .desktop file, and have it run the script? I have looked at a few methods, but they all seem like hotfixes. Is there a proper way to do this? For example:  "Last week, I found out that NASA stands for 'National Aeronautics and Space Administration.'"  or  "Last week, I found out that NASA stood for 'National Aeronautics and Space Administration.'" How should you interview for QA *Automation* positions? Countable set of truth assignments satisfying set of well formed formulas I am trying to answer the following question posed in my logic class: (throughout we work in propositional logic) is there a set $S$ of well-formed-formulas (wffs) satisfied by countable set $V$ of truth assignments such that any truth assignment satisfying $S$ lies in $V$?    My guess is no.  My first reaction to this was to do a diagonalization.  Present $V$ as an array with $v_{i, j}$ the truth value that assignment $v_i$ gives to the $j$-th propositional letter.  Obviously the hard case is when $S$ is infinite; if $S$ is finite, then only finitely many propositional letters occur in the $S$-formulae.  Then there is some maximal $k$ for which all $A_n$ with $n \geq k$ do not occur in V.  Then the diagonalization is trivial: just diagonalize from the $k$-th letter onward, since changing $A_k$ in this range doesn't affect anything in $S$.  But I have little clue about how to approach the main case when $S$ is infinite. I thought maybe I should try using the fact that $S$ is consistent (since it's satisfiable).  If it's maximally consistent, then I think this is simple too, since for every propositional letter $A_n$, either $A_n$ is in $S$ or $(\neg A_n)$ is in $S$, implying that there is only one truth assignment satisfying $S$--since every truth assignment must agree on each propositional letter.    But if $S$ is not maximally consistent, this isn't available to me.  Somehow I would like to show that infinitely many propositional letters do not occur in $S$.  Then I can apply the trick above and just diagonalize through the superfluous letters.    So, yes, just looking for some hints or corrections if you have any please, though maybe if I don't get anywhere on my own I'll give up and ask for more.  Thanks.  (By the way, by referring to letters that "occur in $S$" I mean letters that occur in some formula in $S$). Android WebView for Facebook Like Button Is there a way to check if a file is checked out by another user? I am going trhough a list file by file and would like to avoid the "file is opened by another user" error. Something like this would be nice:  Guid id = new Guid(slideLibrary); // ID of Slide-Library. List list = ctx.Web.Lists.GetById(id); ListItemCollection items = list.GetItems(CamlQuery.CreateAllItemsQuery()); ctx.Load(items); // Loading all the fields System.Security.SecureString pwd = new System.Security.SecureString(); foreach (char c in "pwd".ToCharArray()) pwd.AppendChar(c);  ctx.Credentials = new SharePointOnlineCredentials(login, pwd); ctx.ExecuteQuery();  // Iterating through all the entries. foreach (var item in items) {     String currentID = item["ID"].ToString(); // Getting the ID of the current item.      if (!item.IsCheckedOut()) // This is the part I am looking for.     {        // Do stuff     }     else     {        Console.WriteLine("Item is blocked, skipping it.")     } }   I have yet not been able to find something fitting. Filtered Review Queue doesn't show any audits How to make Table of Contents manually I'm trying to make table of contents manually, I mean I set the page of each of sections one by one. Here's my target:  and I'm using book class here.  Here's the code that I found   \documentclass[oneside]{book} \renewcommand\contentsname{CONTENTS} \renewcommand\listtablename{LIST OF TABLES} \renewcommand\listfigurename{LIST OF FIGURES} \addtocontents{toc}{{\bfseries Contents\hfill Page No.\bigskip\par}} \addtocontents{lot}{{\bfseries No.\hfill Title\hfill\hfill Page No.\bigskip\par}} \addtocontents{lof}{{\bfseries No.\hfill Title\hfill\hfill Page No.\bigskip\par}}  \usepackage[titles]{tocloft} \usepackage{xcolor,xpatch} \renewcommand\cftbeforechapskip{0ex} \renewcommand\cftchapfont{\mdseries} \renewcommand\cftchappagefont{\mdseries} \renewcommand\cftchappresnum{Chapter~} \renewcommand\cftchapaftersnum{. } \newlength\tocindent \settowidth\tocindent{\cftchapfont\cftchappresnum9\cftchapaftersnum} \edef\cftchapnumwidth{\the\tocindent} \edef\cftsecindent{\the\tocindent} \advance\tocindent2.3em \edef\cftsubsecindent{\the\tocindent} \advance\tocindent3.2em \edef\cftsubsubsecindent{\the\tocindent} \renewcommand\cftsecdotsep{\cftnodots} \renewcommand\cftsubsecdotsep{\cftnodots} \renewcommand\cftsubsubsecdotsep{\cftnodots} \newcommand\tocmainmatter {\renewcommand\cftchappagefont{\color{white}}% } \xapptocmd\mainmatter{\addtocontents{toc}{\protect\tocmainmatter}}{}{}   \newif\ifschaptertoc \makeatletter \renewcommand\@makeschapterhead[1]% {{\parindent \z@ \centering     \normalfont     \interlinepenalty\@M     \Large \bfseries  #1\par\nobreak     \vskip 20\p@ }% \@mkboth{\MakeUppercase{#1}}{\MakeUppercase{#1}}% \ifschaptertoc \addcontentsline{toc}{chapter}{#1}% \fi } \makeatother  \usepackage{blindtext}  \begin{document} \frontmatter  \tableofcontents \schaptertoctrue  \chapter*{ACKNOWLEDGEMENTS} \blindtext  \chapter*{ABSTRACT} \blindtext  \listoftables  \listoffigures  \chapter*{ABBREVIATIONS} \Blindtext  \chapter*{NOTATIONS} \Blindtext  \mainmatter  \chapter{INTRODUCTION} \blindtext  \section{General Background} \blindtext  \section{Objective} \blindtext \subsection{Objective 1} \blindtext \subsection{Objective 2} \blindtext \subsection{Objective 3} \blindtext  \section{Scheme} \blindtext \end{document} Why are there non-visible objects in my final render? Can you prove that if $p$ is a prime greater than $5$, then the sum of the squares of the quadratic nonresidues modulo $p$ is divisible by $p$?  Note that I have just proved that the sum of the quadratic residues modulo $p$ is divisible by $p$ for $p$ greater than $3$. What exactly determines depth of field? There are several questions here about , about , and about . And of course there's the basic . And plenty of  questions. There's related questions like . But there's no be-all-end-all question asking:  What exactly determines depth of field in a photograph?   Is it just a property of the lens? Can lenses be designed to give more depth of field for the same aperture and focal length? Does it change with camera sensor size? Does it change with print size? How do those last two relate? In Quantum Mechanics we usually consider operator-valued functions: these are functions that take in real numbers and gives back operators on the Hilbert space of the quantum system.  There are several examples of these. One of them is when we work with the Heisenberg picture, where we need to consider functions $\alpha : \mathbb{R}\to \mathcal{L}(\mathcal{H})$ such that $\alpha(t)$ is the operator at time $t$.  Another example is when we deal with exponentiation of operators, like when building the time evolution operator:  $$U(t,t_0)=\exp\left(-i\frac{H}{\hbar}(t-t_0)\right),$$  Here, the $\exp$ is usually understood as being defined via the eigenvalues of $H$.  The point is, the idea of a function $\alpha : \mathbb{R}\to \mathcal{L}(\mathcal{H})$ appears quite often in Quantum Mechanics, and sometimes one needs to differentiate these. In practice we do it formally, using all the properties we would expect, but I'm curious about how one would properly define this.  If we were dealing with bounded operators, then we could use the operator norm, which is available for this kind of operator, and define the derivative as we can usually we do when there's some norm around.  The point is that in Quantum Mechanics most of the time operators are unbounded.  So in the general case, how can one define the derivative of one operator-valued function?