I am restoring a database from a SQL Server Enterprise Edition onto a Standard Edition server.  I keep getting an error stating:      Database 'MyDatabase' cannot be started in this edition of SQL Server because part or all of object 'containedmemebersnapshots' is enabled with data compression or vardecimal storage format. Data compression and vardecimal storage format are only supported on SQL Server Enterprise Edition.   As a result, my database is in suspect mode.  Is there any resolution so I can restore this database onto SQL Server Standard Edition?
There is a requirement in our project where they want to evaluate if it is possible to downgrade SQL Server from Enterprise to Standard edition and if a server can be decommissioned.  How can I identify which servers are suitable for downgrade?
Sort and count number of occurrence of lines I have Apache logfile, access.log, how to count number of line occurrence in that file? for example the result of cut -f 7 -d ' ' | cut -d '?' -f 1 | tr '[:upper:]' '[:lower:]' is  a.php b.php a.php c.php d.php b.php a.php   the result that I want is:  3 a.php 2 b.php 1 d.php # order doesn't matter 1 c.php How do I enable hardware virtualization technology (VT-x) for use in Virtualbox? What is a lambda (function)? For a person without a comp-sci background, what is a lambda in the world of Computer Science? What book describes consuming vials of vampire blood to pseudo-Rage? I searched all over this site and the web for a good and simple example of autocomplete using jQuery and ASP.NET. I wanted to expose the data used by autocomplete with a webservice (and will probably do that next). In the meantime, I got this working, but it seems a little hacky...  In my page I have a text box:  &lt;input id="txtSearch" type="text" /&gt;   I am using jQuery autocomplete, set up per their example:  &lt;link rel="stylesheet" href="js/jquery.autocomplete.css" type="text/css" /&gt; &lt;script type="text/javascript" src="js/jquery.bgiframe.js"&gt;&lt;/script&gt; &lt;script type="text/javascript" src="js/jquery.dimensions.pack.js"&gt;&lt;/script&gt; &lt;script type="text/javascript" src="js/jquery.autocomplete.js"&gt;&lt;/script&gt;   Here is where it starts to get hacky... I call a page instead of a webservice:    &lt;script type="text/javascript"&gt;     $(document).ready(function(){         $("#txtSearch").autocomplete('autocompletetagdata.aspx');     });         &lt;/script&gt;   In the page I stripped out ALL of the html and just have this (otherwise, various HTML bits show up in the autocomplete dropdown):  &lt;%@ Page Language="C#" AutoEventWireup="true" CodeFile="autocompletetagdata.aspx.cs" Inherits="autocompletetagdata" %&gt;   And in my autocompletetagdata.aspx, I am using SubSonic to query, format and return data from the database (one data item per line):  protected void Page_Load(object sender, EventArgs e) {     // Note the query strings passed by jquery autocomplete:     //QueryString: {q=a&amp;limit=150&amp;timestamp=1227198175320}      LookupTagCollection tags = Select.AllColumnsFrom&lt;LookupTag&gt;()         .Top(Request.QueryString["limit"])         .Where(LookupTag.Columns.TagDescription).Like(Request.QueryString["q"] + "%")         .OrderAsc(LookupTag.Columns.TagDescription)         .ExecuteAsCollection&lt;LookupTagCollection&gt;();      StringBuilder sb = new StringBuilder();      foreach (LookupTag tag in tags)     {         sb.Append(tag.TagDescription).Append("\n");     }      Response.Write(sb.ToString()); }   If you don't do a LIKE query, then it returns everything that contains a match for the character(s) you type -- e.g., typing "a" will include "Ask" and "Answer" as well as "March" and "Mega." I just wanted it to do a starts with match.  Anyway, it works and it's pretty easy to set up, but is there a better way? How to configure axis on pgfplots? How to configure axis on pgfplots? Similar for this.  \documentclass{article} \usepackage{tikz,pgfplots} \pagestyle{empty} \begin{document} \begin{tikzpicture}[&gt;=latex] %x axis \draw[-&gt;] (-5,0) -- (5,0) node[below] {$x$}; \foreach \x in {-4,...,-1,1,2,...,4} \draw[shift={(\x,0)}] (0pt,2pt) -- (0pt,-2pt) node[below] {\footnotesize $\x$}; %y axis \draw[-&gt;] (0,-5) -- (0,5) node[left] {$y$}; \foreach \y in {-4,...,-1,1,2,...,4} \draw[shift={(0,\y)}] (2pt,0pt) -- (-2pt,0pt) node[left] {\footnotesize $\y$}; \node[below left] at (0,0) {\footnotesize $0$}; \end{tikzpicture} \end{document} Is WUBI freely available? I checked the link to download WUBI and the only way to proceed is by giving some amount as donation. I will surely do it, but I don't have a Paypal account and I am in urgent need to install Ubuntu. Can someone help me? How do I install the latest  on Ubuntu? I've been looking around, and I can't find anything. Is there a Ubuntu package for node.js, or do I have to compile it myself? Grammar of "supposed to": part of speech / word class, active or passive? If I say     I'm supposed to go.   Is supposed to here an adjective in a passive construction? I'm quite confused about the following regular expressions I found in a shell script:  ${0##*/} ${0%/*}   How do they work? Output URL of open firefox tabs in terminal Why are Grothendieck's and Hartshorne's definitions of quasi-coherence equivalent? Hartshorne's Algebraic Geometry defines an $\mathcal O_X$-module $\mathscr F$ to be quasi-coherent if there is an open affine cover $(U_i=\operatorname{Spec} A_i)_{i\in\mathcal I}$ of $X$ such that each $\mathscr F\rvert_{U_i}$ is isomorphic to the sheaf of modules $\widetilde{M_i}$ associated to some $A_i$-module $M_i$. It is later proved that this is equivalent to the statement that for any open affine $U=\operatorname{Spec} A\subseteq X$, there exists an $A$-module $M$ with $\mathscr F\rvert_U\cong\widetilde M$.  On the other hand, Grothendieck's Éléments de Géométrie Algébrique defines $\mathscr F$ to be quasi-coherent if every point $x\in X$ admits an open neighborhood $U\subseteq X$ such that $\mathscr F\rvert_U$ is isomorphic to the cokernel of a morphism of free $\mathcal O_U$-modules.  Now I wonder how those definitions are equal. I tried proving it by myself, but both directions seem quite nontrivial to me... Any hints? Is there an easy way to calculate the total cost of tolls for a trip within the United States? Is there a convenient way to calculate the cost of tolls between two arbitrary points within the United States? I'm planning to take a trip along the Eastern seaboard and will be passing through multiple states with different toll-collecting authorities. The mapping and trip planning resources I've found so far will only indicate whether a particular section of road has tolls, not the price of those tolls. I'm aware that the various toll-collecting authorities post their rates online, but these charts are often difficult to use if you're not already familiar with the area. Isn't there an easier way? Looking for a simple proof that groups of order $2p$ are up to isomorphism $\mathbb{Z}_{2p}$ and $D_{p}$ . sci-fi book where a meteorite gives 3 different kinds of telepathic powers to people who then vie for control 3 groups of telepaths each with different powers.  They received their powers from a meteorite.  One group is the strongest and are kind of in control.  Another group wants to gain control.  One group, I believe the strongest, have telepathic battles to determine the strength of one another conjuring up swords, walls, etc. in their minds. It was written by a lawyer.  Could have been written in the ‘80s, or earlier. How can I make a deepcopy of a function in Python? To prevent overfitting people people add a regularization term (proportional to the squared sum of the parameters of the model) with a regularization parameter $\lambda$ to the cost function of linear regression. Is this parameter $\lambda$ the same as a lagrange multiplier? So is regularization the same as the method of lagrange multiplier? Or how are these methods connected? I want to use an old drive as a secondary hard drive without reformatting. But this old hard drive contains my old Vista installation which takes up gigs of space.  I tried changing ownership and it works to some extent but I can not delete anything in Windows/System32 folder.  Is there an easy way to change permissions so I can delete everything?    The solution is to use Takeown as Wil suggested and use cacls to take full control of the files. Since cacls doesn't seem to be recursive, I fired up cygwin and ran this command to recursively change all the files:  for d in $(find directory-of-interest -type d);do   cacls $d'/*' /e /G username:F; done   where directory-of-interest is in my case /cygdrive/g/Windows and username is my username.  I had to manually run it on directories that had spaces in its name. But after all this, I can now delete the directory. Warning: it seems to me that cacls can potentially royally screw things up if improperly used. My path is \\server\folderName1\another name\something\another folder\  How do I extract each folder name into a string if I don't know how many folders there are in the path and I don't know the folder names?  Many thanks Let $P$ be a probability measure on $(\Omega, \mathscr{F})$, If $a,b,\in\mathscr{F}$ and $A\subset B$, then $P(B)-P(A)=P(B\setminus A)\ge 0$.  So far I have:  $A\subset B \implies B\setminus A = B\cap A^c = \emptyset$ as $A$ and $B^c$ are disjoint. Since $A\cup (B\setminus A)=A\cup (B\cap A^c)=(A\cup B)\cap (A\cup A^c)=B\cap\Omega = B$  Then for $A,B\in \mathscr{F}\implies P(A\cup (B\setminus A))=P(A)+P(B\setminus A) = P(B)$ by countable additivity.  Rearranging, $P(B)-P(A)=P(B\setminus A) \ge 0$.