I have a powershell script which deletes old backups from NAS storage. I have already tested it using Windows Powershell and it works but I couldn't perform the same thing in SQL Server. I have created a cmdExec type job and then wrote the script below (script is on desktop):  "C:\Windows\system32\WindowsPowerShell\v1.0\powershell.exe"  "C:\Users\domainAccount\Desktop\"  ".\deleteold.ps1 -FolderPath \\192.168.x.x\Backups -FileAge 2 -ListOnly -LogFile \\192.168.x.x\Backups\log.log"   But I do not get any result as when I run the job it just keeps running infinitely until I stop that job.
I have a powershell script that I am trying to add in to a sql agent job, but the job step is failing with the following error      A job step received an error at line 1 in a PowerShell script. The corresponding line is 'import-module SQLPS  -DisableNameChecking'. Correct the script and reschedule the job. The error information returned by PowerShell is: 'Could not load file or assembly 'file:///C:\Program Files (x86)\Microsoft SQL Server\130\Tools\PowerShell\Modules\SQLPS\Microsoft.SqlServer.Management.PSSnapins.dll' or one of its dependencies. This assembly is built by a runtime newer than the currently loaded runtime and cannot be loaded.   I assumed that the error was being caused by differences in the module path, so I explicitly set the path via $env:PSModulePath to match the path of my powershell session where the code runs fine.  I am pretty new to powershell, so any help you could provide would be appreciated  I am just doing some testing right now, so everything is running locally on my desktop.  I am running SQL Server 2012.
I got stuck on this inequality for a day. If $p$ is positive integer, then the problem becomes too easy, but I can't find how we deal with the general case when p can be any positive number. Can someone give me a hint? I really appreciate     Prove that $|x^p - y^p| \le p|x-y|(x^{p-1} + y^{p-1})$ provided that $1 \le p \lt \infty$ and $x, y \ge 0$ How to choose a circle for default stream in Google Plus? How can I choose a specific circle for the default stream in Google+ ? Many extensions don't work, and are not comfortable if using another PC. Benefits & Practicality of Virtual Machines I have been living under a rock for the past 5 - 8 years, and am just now getting up to speed with virtualization, virtual machines and platforms like VMware or VirtualBox.  I think I am starting to get them, but there are two concepts about VMs that I'm just choking on for some reason; one has to do with their intrinsic benefit to the enterprise, and the other has to do with their practicality when being used.  So I understand that you can have multiple VMs running on the same physical machine, all doing their own "thing" as if they were separate machines. So let's say I want to make a nice little virtual network of servers in my home office so I can have a big sandbox to play inside of for all my projects. I set up 2 physical machines as servers, and on each of them I have, say, 4 virtual machines running (1 might be an app server, another might be a RDBMS, another might be a message broker, etc.).   Besides saving me money (as I only have to provide 2 physical machines instead of buying 8 servers), what instrinsic benefit/purpose do these VMs serve here? I don't care how clever virtual machines are, if my computer only has 8GB of RAM, and I have 4 VMs running on it, those VMs only get 8GB of RAM to share between them. Putting 4 VMs on my server doesn't endow it with 4 times that amount of RAM! So, as far as I see it, VMs save you money on hardware, but just end up bogging down that hardware as you have multiple machines competing over the same pool of resources. What am I missing here? Can VMs communicate with each other over your network using high-level protocols like TCP/IP, HTTP, FTP, etc.? Otherwise, it just doesn't make sense to implement all these VMs if you have to feed them separate and independent chunks of data/requests to process. How to smooth shade an object while retaining hard edges? I frequently come to the problem of having a mesh with parts I would like to render smooth and "hard" edges connecting them.   How can I set the mesh to show the sharp edges but render everything else smooth?  In the example I would like the sides of the individual cylinders render smooth but the intersection between bottom and top to be sharp/flat How do I install and manage RPMs? I have a burning desire to install RPMs onto my Ubuntu installation - is this possible? Can I use Yum - or another RPM Package Management tool? Where can I get a Thunderbolt hub or splitter? Apple has just announced the new MacBook Airs, Mac mini, and Thunderbolt display. One of the features of the Thunderbolt display that caught my eye was its ability to daisy-chain two displays together from one Thunderbolt port (on a MacBook Pro).  I already have two 24" monitors and I don't feel like paying for two £900 displays. I worked out that all I need is a Thunderbolt hub/splitter so that I can plug the two cables that emerge into mini DisplayPort-to-DVI adapters.  Does anyone know of any Thunderbolt hubs or splitters? Or does anyone know of an alternative method? Model selection with low N? I've got a study which is kinda messed up by the design...Turns out I ended up with about 50 patients of which 80% have the outcome and 20% don't (binary outcome).  I've been turning in my bed for the last month trying to figure out what to do with this. The only real answer is "don't" but I have to deliver something in the next days as it's part of a master's thesis.  I have about 10 predictors of interest for the outcome (various variable types) and the research question is whether any of these predictors can predict the outcome. Some already have an established correlation in the literature while some are original hypothesis. Several are significant with a univariate logistic regression, but it doesn't look good in any other way than the actual p-value.  Now obviously I'm not going to be able to answer this research question sufficiently but if you were in my shoes, what sort of statistical analysis would you perform to relay to your supervisors?  EDIT: Link to my (anonymized) data (CSV): The ^^ notation in various engines Basically, how does the ^^^... notation work in LuaTeX and XeTeX, exactly?  In 8-bit TeX engines (recent TeX, eTeX, pdfTeX, at least), two consecutive identical catcode 7 characters (typically ^), followed by two lowercase hexadecimal digits, are converted before the tokenization step to the corresponding byte.  Namely, ^^6f is exactly equivalent to o: for instance, \sh^^6fw ^^6f will cause TeX to show the letter o.  There is also the notation with two ^ (identical catcode 7 characters), followed by any ascii character (but not two lowercase hexadecimal digits), which is replaced by the character obtained by either subtracting or adding 64 to the character code, remaining among ASCII characters (range 0 to 128).  Unicode-aware engines (I'm thinking of LuaTeX and XeTeX, there are perhaps other less known ones around) also provide ^^^^xxxx and ^^^^^xxxxx for characters whose hexadecimal representation has 4, or 5 digits.  But this does not seem to be done in the same way across engines.  For instance, both LuaTeX and XeTeX appear to accept the notation with 4, 5, or 6 carets followed by the same number of hexadecimal digits, but XeTeX also accepts it for 3, while LuaTeX doesn't. Compiling the following with pdfTeX, LuaTeX, and XeTeX gives different results.  \catcode0=12 \newlinechar=10 \def\loopshow#1{\message{\meaning #1^^J}\loopshow} \loopshow \/   ^^56   ^^^056   ^^^^0056   ^^^^^00056   ^^^^^^000056   ^^^^^^^0000056 {\end\iffalse} \fi} \bye   One weird fact about XeTeX (a bug?) is that  \show ^^^^^^010101   shows the character displaywidth.  My goal (there may be a better way to do this) is to provide a way to test whether passing a given list of tokens through \scantokens is safe.  For that, my plan is to go through the \detokenized token list one character at a time, applying TeX's rule for tokenizing (but no need to fully tokenize), and detecting begin-group and end-group tokens, as well as invalid characters. Inner product of two continuous maps is continuous Let f,g be continuous maps of S in $\mathbb{R}^n$, to $\mathbb{R}^m$. Show the inner product h(x) = $\langle f(x), g(x)\rangle$ is continuous.  My attempt: Since f,g are continuous, their product is a continuous mapping, so for $\epsilon \gt 0\: t.e\:  \delta \gt 0$ such that $\parallel x - a\parallel \lt \delta $ implies $\parallel \langle f(x),g(x)\rangle - \langle f(a)g(a)\rangle \parallel \le\parallel f(x)g(x) - f(a)g(a)\parallel \lt \epsilon$ by schwartz inequality. In the Wikipedia article on positive definite matrices they claim that if $M$ is positive definite, then the determinant of $M$ is bounded by the product of its diagonal entries. How might we show this?  Ideas: The sum of the diagonal entries of $M$ is the trace, which is also the sum of the eigenvalues. The product of the eigenvalues is the determinant. All the diagonal entries of $A$ must be real and strictly positive. Also we have $|m_{ij}|\leq \sqrt{m_{ii}m_{jj}}\leq \frac{m_{ii}+m_{jj}}{2}$. So far nothing is working...  We might try to write the Gram matrix $m_{ij} = \langle v_i, v_j \rangle$, and then $\prod_i m_{ii} = \prod_i \|v_i\|^2$. Now we'd need to show that the determinant, which is a polynomial in the entries of $v_i$, is less than $\prod_i \|v_i\|^2$ somehow. How do I get started creating an Ubuntu Desktop App? I want to create an Ubuntu desktop app, specifically to replace Gwibber.  I can code in Java, Python and a few other technologies. Adobe Flex would have been an option until Adobe decided to suck some more and stopped support for AIR on Linux.  Note - I don't care about supporting other OS's. It will be a personal Ubuntu specific app. It can I open-source, I don't mind extra help.  It should integrate seamlessly with Ubuntu, notifications and all.  I guess Python it is, is that correct? How do I get started? Unicode Regex; Invalid XML characters The list of valid XML characters is well known, as defined by the spec it's:  #x9 | #xA | #xD | [#x20-#xD7FF] | [#xE000-#xFFFD] | [#x10000-#x10FFFF]   My question is whether or not it's possible to make a PCRE regular expression for this (or its inverse) without actually hard-coding the codepoints, by using Unicode general categories. An inverse might be something like [\p{Cc}\p{Cs}\p{Cn}], except that improperly covers linefeeds and tabs and misses some other invalid characters. Converting Linux into a Router- Traffic from eth0:0 to eth0 So I have been trying to convert my linux box which is running Mint into an router. eth0 has a public address that has 71.xx.xx.xx for an IP addr. I created an eth0:0 and set it an IP address , 10.0.0.100. I started a DHCP server that is on eth0 ( because it wont use eth0:0) and that's giving out addresses between 10.0.0.101 and 10.0.0.200. I can ping between eth0 and eth0:0 on the same machine. I have a another laptop connected to the linux via a switch and its able to receive an ip addr via the DHCP server. Problem is how do I route traffic from and to eth0:0 to eth0 and vice versa so that computers on the private network that is 10.0.0.x can access internet via the static IP on eth0. Force alt + tab to switch only on current workspace in GNOME shell How to pick one number from each sorted list so that the difference between the minimum and maximum is as small as possible? Splitting pieces of a mesh into a new object I've just made a set of armor by using a male body mesh model I downloaded and selecting certain faces from the model and duplicating them to create viable armor pieces.   Since the pieces are just duplicated from the same mesh male model, then it's still part of the same object.   How do I separate the armor piece from the model to make the pieces separate? Prove the compactness of a set B We have $A=\left\lbrace 2019,1010,\ldots,(n+2018)/n,\ldots \right\rbrace$ and $B=A \cup \left\lbrace 1 \right\rbrace$  How can I show directly (that is, not using the compactness criterion in $\mathbb{R}$) that every open cover $G$ of $B$ admits a finite subcover?  moreover, I know that $A$ is not compact and I am aware that I would need a single example to prove it, any hint on how to find an open cover of $A$ that does not contain a finite subcover?  My first thought was to choose the set of all neighborhoods with radius r centered around each point of A but apparently this is wrong and I do not understand why. C# Textreader and TextWriter are the another way to read and write file respectively...      I added a text box and button I called tbUpdate and btUpdate respectively...      In the right hand column, we’ll use three TextBlocks; the first and third as fixed labels (with the values Likeability: and % respectively)...      WorkerSupportsProgress and WorkerSupportsCancellation which hold true/false values that let the backgroundworker report progress or cancel an async progress respectively...   While learning many the many different aspects of development, I have not come across a book or series where the word respectively is not used in explaining an example. Honestly I guess it's implied that we know what it means. To me I always kind of skim over it because I can usually figure out what they're saying through the surrounding context. Can anyone explain this? I created a Compute Engine VM (Ubuntu 18.04), and when I log into it using the SSH button in the VM instances list I'm logged in as user username.  After a while, I realised I needed to be able to use another SSH client as well. As per  I enabled OS Login by adding a key-value pair in metadata, where key is enable-oslogin and value is TRUE.  I then tried to add my existing SSH key:  gcloud compute os-login ssh-keys add --key-file path/to/key.pub --ttl 0  which was successful except one major problem: it has added the key for user username_gmail_com and will only allow me to ssh to my VM as that user:  ssh username_gmail_com@myinstance  And it has also created that user on my VM. From the web interface, I'm logged in to the VM with that new user as well (/home/username_gmail_com). Of course, I can still access the original user's data (/home/username). When I disable OS Login the web interface logs me in as username again and SSH from another client is disabled.   Why is the username different when enabling OS Login? Can I change the username with OS Login enabled?   Edit  There has been an addition to the docs explaining exactly this question. Check here:  and on  all the way at the bottom under "Expected login behaviors". Better explanation of the common general relativity illustration (stretched sheet of fabric)