I have a stored procedure that processes data from a source table and is executed many times (about 20,000 executions) throughout the day.  I believe it's getting choked up sometimes, due to parameter sniffing and I've been updating statistics on the relevant tables (8 tables) in the procedure to fix this.  When it gets choked up, a backlog of unprocessed data builds up (which I'm able to monitor the count on.)   Once I update the statistics the backlog is instantly cleared.  I find myself updating statistics about 10 times a day (almost once an hour). Does this seem normal or is there a bigger issue I should be looking to fix?
I've inherited a Maintenance Plans that does the following:   Cleanup old data Checks DB integrity Performs Database and Transaction Log Backups Reorganizes Our indexes Updates Statistics Delete old backups and Maintenance Plan files   Of the 23 minute Maintenance Plan, Updating the Statistics takes a staggering 13 minutes. During this 13 minute period, access to the database is blocked (or at least, replication from this DB to our others is paused).  My Question Is:  When should we be Updating the Statistics, and why?   This seems like the kind of thing we should do less frequently than every day. I'm trying to get us out of the "just because" mind-set of doing unnecessary Maintenance.
jQuery/JavaScript: accessing contents of an iframe I was wondering if it's possible to run an Ubuntu virtual machine using VirtualBox in background, I mean, without any window open.  The idea is to connect via SSH to the Linux host, that would be running in background.  Has anyone ever done something like this? Is it possible? Reference book on measure theory I post this question with some personal specifications. I hope it does not overlap with old posted questions.  Recently I strongly feel that I have to review the knowledge of measure theory for the sake of starting my thesis.  I am not totally new with measure theory, since I have taken and past one course at the graduate level. Unfortunately, because the lecturer was not so good at teaching, I followed the course by self-study. Now I feel that all the knowledge has gone after the exam and still don’t have a clear overview on the structure of measure theory. And here come my specified requirements for a reference book.   I wish the book elaborates the proofs, since I will read it on my own again, sadly. And this is the most important criterion for the book. I wish the book covers most of the topics in measure theory. Although the topic of my thesis is on stochastic integration, I do want to review measure theory at a more general level, which means it could emphasize on both aspects of analysis and probability. If such a condition cannot be achieved, I'd like to more focus on probability. I wish the book could deal with convergences and uniform integrability carefully, as Chung’s probability book.    My expectation is after thorough reading, I could have strong background to start a thesis on stochastic integration at an analytic level.  Sorry for such a tedious question.  P.S: the textbook I used is Schilling’s book: measures, integrals and martingales. It is a pretty good textbook, but misprints really ruin the fun of reading. Banach spaces and their unit sphere Let $X$ be a normed vector space.   Show that if a subsequence of a Cauchy sequence converges, then the whole sequence converges. Use the part 1 to show that $S = \{x\in X : \|x\| = 1\}$ is complete if and only if $X$ is Banach.     I have found the first part in a book, but I do not how to prove part 2. Thanx regards Website home page design when there are multiple audiences I am in the process of creating a website which has two distinct audiences - in my case consumers and retailers.  When I first started the process just a few weeks ago I had followed the then model used by PayPal who too have to deal with distinct audiences.    However, having Googled around a bit for what the accepted wisdom is when dealing with website landing pages for segmented markets it appears to me that the current belief is that one just directs the visitor away from the landing page to other, segment focused, pages ASAP.  I have to admit that I am having trouble buying that philosophy.  To my mind it makes sense to provide at least some basic information - key benefits - for each segment on the landing page and then let viewers who linger long enough the opportunity to easily drill down to their own segment-focused page.  My own reasoning is that most first time visitors are liable to want to bounce away quickly and making them find and click on the segment page link is more likely to make them bounce than if they find enough to hold them on the landing page for a bit longer.  I'd like to have other views on this.  What are the pros and cons of the    Drive traffic to segment-focused page ASAP vs Provide some basic information - at least key benefits - for each segment on the landing page itself I keep getting an error in line 38 saying "Extra alignment tab has been changed to \cr." \documentclass [12pt]{article} \oddsidemargin=0pt \topmargin=0pt \textwidth=6.5in \textheight=8.5in \begin{document} \begin{center} {\large\bf\LaTeX\ Example 6} \end{center} We can typeset array structures \begin{equation} \mathbf{A}\times \mathbf{B}=\left| \begin{array}{ccc} \mathbf{i} &amp; \mathbf{j}  &amp; \mathbf{k} \\      a_1  &amp;      a_2        &amp; a_3 \\       b_1  &amp;      b_2        &amp; b_3  \end{array}  \right| \end{equation} \begin{quote} \begin{verbatim} \begin{equation} \mathbf{A}\times \mathbf{B}=\left| \begin{array}{ccc} \mathbf{i} &amp; \mathbf{j}  &amp; \mathbf{k} \\  a_1  &amp;  a_2   &amp; a_3 \\  b_1  &amp;  b_2   &amp; b_3 \end{array} \right| \end{equation} \end{verbatim} \end{quote} Or \begin{equation} \mathbf{A}=\left( \begin{array}{ccc} a_{11} &amp; a_{12} &amp; \cdots &amp; a_{1n} \\ a_{21} &amp; a_{22} &amp; \cdots &amp;  a_{2n} \\ \vdots &amp; \vdots &amp; \ddots &amp; \vdots \\ a_{n1} &amp; a_{n2} &amp; \cdots &amp; a_{nn} \end{array} \right) \end{equation} \end{document} Brief Description:  I need my Ethernet card (en0) to see all traffic under 192.168.2.xxx.  However I also need to use WiFi card (en1) for all other traffic.  OS: OS X Lion    I am using a separate network location to deal with this specific use (since this is a for a robotics project that communicates via Ethernet). Ethernet (en0) had to be set up as a static IP (192.168.2.10) per the requirements for the device I am connecting to. All connections on the Ethernet card (en0) should be 192.168.2.xxx as specified above. WiFi (en1) is set up as DHCP to a router since their is no point in assigning it as a static for general purpose traffic. Ethernet (en0) is set up as priority over WiFi (en1).  I would also like to keep this under the network location preferences if at all possible since I do not require this feature to be on all the time.  I would really appreciate your help on this. No one I have talked to knows how to solve this. How could a raw, untrained Force user be so adept at using the Force? Everything that I seemed to know about the Star Wars universe indicated that in order to be successful at being a force user, the user required decades of training and experience.  Which is why I thought that the Jedi trained their pupils from birth to be force users. The lengthy training period was also why the Jedi council said Anakin was too old, and subsequently why Yoda said Luke was too old to begin the training. This can be seen in comparing Luke's raw abilities in the original trilogy compared to that of the Jedi in the prequel trilogy.   However, in The Force Awakens,      Rey not only fends off Kylo Ren, she comes very close to killing him outright, even though she had never even held a lightsaber before.   This happens not long after      she uses her Force persuasion power to escape prison, despite not even believing she was Force sensitive until that point.   It doesn't make any sense that the fight wasn't over in a matter of seconds. What am I missing? Windows Unable to Delete ._. File I currently have a file on the root of my external hard drive simply named ._., which I am guessing was added to my hard drive after using it on my MacBook a while ago.  I'm trying to delete this file on my Windows 10 machine; however Windows keeps claiming the file cannot be found.    I also tried deleting the file through an elevated command prompt; however the same message is returned.    Is there any way I can delete this file from my hard drive through Windows? Select node without namespace with XPath Suppose $X$ is infinite and $A$ is a finite subset of $X$. Then $X$ and $X \setminus A$ are equinumerous Suppose that $X$ is infinite and that $A$ is a finite subset of $X$. Then $X$ and $X \setminus A$ are equinumerous.     My attempt:  Let $|A|=n$. We will prove by induction on n. It's clear that the the theorem is trivially true for $n=0$. Assume the theorem is true for all $n=k$. For $n=k+1$, then $|A \setminus \{a\}|=k$ for some $a \in A$. Thus $X \setminus (A \setminus \{a\}) \sim X$ by inductive hypothesis, or $(X \cap \{a\}) \cup (X \setminus A) \sim X$, or $\{a\} \cup (X \setminus A) \sim X$. We have $\{a\} \cup (X \setminus A) \sim X \setminus A$ since the theorem is true for $n=1$. Hence $X \setminus A \sim \{a\} \cup (X \setminus A) \sim X$. Thus $X \setminus A \sim X$. This completes the proof.       Does this proof look fine or contain gaps? Do you have suggestions? Many thanks for your dedicated help!     Update: Here I prove that the theorem is true for $n=1$.  Assume that $A = \{a\}$ and consequently $X \setminus A= X \setminus\{a\}$. It's clear that $|X \setminus A| \le |X|$. Next we prove that $|X| \le |X \setminus A|$. Since $X$ is infinite, there exists $B \subsetneq X$ such that $B \sim X$ (Here we assume Axiom of Countable Choice). Thus $|X|=|B|$. There are only two possible cases.   $a \in X \setminus B$   Then $B \subseteq X \setminus \{a\}=X \setminus A$ and consequently $|X|=|B| \le |X \setminus A|$. Thus $|X| \le |X \setminus A|$ and $|X \setminus A| \le |X|$. By Schröder–Bernstein theorem, we have $|X \setminus A| = |X|$. It follows that $X \setminus A \sim X$.   $a \in B$.   Let $b \in X \setminus B$. We define a bijection $f:X \setminus \{a\} \to X \setminus \{b\}$ by $f(x)= x$ for all $x \in X \setminus \{a,b\}$ and $f(b)=a$. Thus $X \setminus \{a\} \sim X \setminus \{b\}$. Since $b \in X \setminus B$, it follows from Case 1 that $X \setminus \{b\} \sim X$. Hence $X \setminus \{a\} \sim X \setminus \{b\} \sim X$. Thus $X \setminus \{a\} = X \setminus A \sim X$.  To sum up, $X \setminus A \sim X$ for all $|A|=1$. In general relativity (GR), spacetime is viewed as a differentiable manifold of dimension $D$ with a metric of Lorentzian signature $(-,+,+,...,+)$.  My question is why differentiable? Title restated: Show that $A\in\mathbb{C}_n$ is normal $\iff$ $tr(A^*A) = \sum_{i = 1}^n|\lambda_i|^2$, where $\lambda_1,...,\lambda_n$ are the eigenvalues of $A$.  This question comes from "Matrices and Linear Transformations" by Charles Cullen. I'm studying for an exam and am trying to do some problems but I'm having trouble with this one. Any help would be appreciated.  Thank you. How many Marvel Earths (Universes) are there? I know that there are at least 3 Marvel Universes:  Marvel Cinematic Universe -    Has all of the main ongoing Marvel movies    (1, 2)  (1, 2, 3)  (1, Age of Ultron) etc    Marvel's Ultimate Universe -    Has the other Marvel movies    (1, 2, 3, Origins: Wolverine, First Class, The Wolverine, Days of Future Past)  (1, 2)  etc       Main comic book continuity This is the big one, it contains         etc     Then there are apparently off-shoot Earths, continuities which deviate from the main continuity (Earth 616). How many Marvel Earths (Universes) are there?   Further Reading: I'm very new to the GIS world, so my problem could be very stupid, but I'm going to try anyway.  Objective  Given a list of coordinates in longitude/latitude, stored as a .csv file, I want to create a buffer with distance of x km around those coordinates. (In case this is relevant, these coordinates are locations of the societies in the . These societies scatter all around the world.)  Problem  I'm only able to create buffers with distance in radial degrees, but I want to do them in (kilo)meters. I'm aware of the following Q&amp;A's, but following what's suggested therein doesn't seem to solve my problem:          What I have tried...   I start QGIS (v2.4), and Add delimited text layer  choose my .csv file and the x/y fields, click OK select WGS 84 as my CRS (also tried NAD83 but didn't make a difference), click OK right-click on layer and select Save As..., in the dialog box, choose the following and click OK:  add sccs_meter.shp as layer to the current project Select Vector > Geoprocessing Tools > Buffers > set buffer distance as 10   The result is a buffer with radius of approximately 1068km, which suggests that buffer distance is 10 degrees rather than 10 meters.  What did I do wrong here? Joining lots of small polygons to form larger polygon using PostGIS? Why does an object with a glossy shader render in black? When I apply a glossy shader to the material of my text, the text becomes just black. Why?    I have lamp and everything, but the problem persists. The text is red before I add the glossy shader.  I'm using Cycles render.   Thanks! I am giving a presentation and therefore I am using the  class. I have included some figures and it works, but there is no number after "Figure".  My code:  \documentclass{beamer}  \usepackage{graphicx} \usepackage[latin1]{inputenc} \usepackage[T1]{fontenc} \usepackage[english]{babel} \usepackage{listings} \usepackage{xcolor} \usepackage{eso-pic} \usepackage{mathrsfs} \usepackage{url} \usepackage{amssymb} \usepackage{amsmath} \usepackage{multirow} \usepackage{hyperref} \usepackage{booktabs} \usepackage{wallpaper} \usepackage{bbm} \usepackage{cooltooltips} \usepackage{eso-pic} \usepackage{everyshi} \usepackage{calc} \usepackage{graphicx} \usepackage{ifthen} \usepackage{graphicx} \usepackage{wrapfig} \usepackage{animate} \usepackage[singlespacing]{setspace} \usepackage[absolute,overlay]{textpos} \usepackage{enumerate} \usepackage{hyperref} \newenvironment{changemargin}[2]{%   \begin{list}{}{%     \setlength{\topsep}{0pt}%     \setlength{\leftmargin}{#1}%     \setlength{\rightmargin}{#2}%     \setlength{\listparindent}{\parindent}%     \setlength{\itemindent}{\parindent}%     \setlength{\parsep}{\parskip}%   }%   \item[]}{\end{list}}  \setbeamercolor{frametitle}{fg=red,bg=white}  \hypersetup{pdfpagemode=FullScreen} \renewcommand*{\UrlFont}{\normalfont}  \usetheme{Goettingen} \useinnertheme{circles} \beamertemplatenavigationsymbolsempty  \setbeamerfont{page number in head/foot}{size=\large} \setbeamertemplate{footline}[frame number]   %%% \begin{document}  \frame[plain]{ \titlepage }  \setbeamertemplate{background canvas}[default]  \frame{ \frametitle{}  \begin{figure} \begin{center} \includegraphics[scale=0.2]{varweakness} \caption{VaR as a quantile} \end{center} \end{figure}  }   \end{document}   Which gives the following frame with the figure:    (I am not sure what is causing the problem, therefore I did not delete any package.)  How can I get a number, e.g. Figure 1:? The browser's "Back" button cause problems with the review buttons If $m,n\in N$ Prove that there is such a positive integer k, such that $(\sqrt{m}+\sqrt{m+1})^n=\sqrt{k}+\sqrt{k+1}$ If $m,n\in N$ Prove that there is such a positive integer k, such that $(\sqrt{m}+\sqrt{m+1})^n=\sqrt{k}+\sqrt{k+1}$ I attempted to solve this question using binomial coefficients, saying: $(\sqrt{m}+\sqrt{m+1})^n=\sqrt{k}+\sqrt{k+1}=\sum\limits_{a=0}^n {n\choose a}*\sqrt{m}^{n-a}*\sqrt{m+1}^a$ and from here I was thinking that I had to do something with $\sqrt{m}^{n-a}$ with $\sqrt{k}$ and do something else with $\sqrt{k+1}$ and $\sqrt{m+1}^a$. Unfortunately I couldn't think of what to do with this circumstance. I then thought of maybe taking $(\sqrt{k}+\sqrt{k+1})^2=(\sum\limits_{a=0}^n {n\choose a}*\sqrt{m}^{n-a}*\sqrt{m+1}^a)^2$, but this immediately over-complicated the question. Could you please explain to me how to solve this question and how to solve similar questions in the future?