How to get Windows data back
How to recover deleted files?
I've been looking for a simple regex for URLs, does anybody have one handy that works well?  I didn't find one with the zend framework validation classes and have seen several implementations. "To do this" or "For doing this" to start explaining something? Many questions have been asked and answered about "to + bare infinitive" vs "for + gerund" in the middle of a sentence.  However, when one wants to start explaining something, what is better? For instance:  "Now, let us focus on baking the bread.   To do this, start by turning the oven on.", or For doing this, start by turning the oven on."?   Are there even better expressions? I have not found anything concerning this situation, and I feel that the answers about the same problem but in the middle of a sentence do not apply here. Is it ethical to omit the PhD credential from my resume? I am applying for a Statistical Programmer position at a commercial research organization (CRO), and I am wondering if it is unethical to omit my PhD in Statistics from my resume?  All of my degrees (Bachelor's, Master's, PhD) are in Statistics, and I am just wondering if it would be ethical to just list my Bachelor's and Master's degree on my resume, and indicate my experience as a RA while I was a PhD student as my "work experience"? (Since this Statistical Programmer position only requires Master's degree plus some years of experience)  I am asking this question because I do not want to do anything unethical/cause me troubles later on. I want to create an effect/color like this image of the cloud in the Parse.com logo. It is not quite white, and seems to have a texture. I am new to illustrator, but have a white "cloud" made thanks to some other tutorials. How do I proceed? How can Finder empty Trash more quickly than "rm -rf /Volumes/Foo/.Trashes/501/*"? The "Trash" of a 16-GB usb2 flash drive had 3.4-GB of data. I emptied it as such:     $ cd /Volumes/FooDrive/.Trashes/501   $ rm -rf *   This took over 5-seconds. That seemed pretty long. So, as a test I just decided to empty the Trash of all of my drives via Finder. Other drives: 2-TB usb3 500-GB usb2 16-GB usb2 250-GB ssd  I measured the size of the Trash as such:       $ du -ch /Volumes/WhateverDrive/.Trashes   There was 15-GB in the Trash of the 500-GB drive, and 5-GB in the Trash of my other 16-GB flash drive. I didn't measure the other drives.  Finder appeared to take much less than 5-seconds to empty the Trash for all those drives.   Does Finder really empty the Trash so much more quickly than /bin/rm? How?   Does Finder just make the "clicking sound" (signaling the trash is empty) before the Trash on all the drives is really empty? Why doesn't Cantor's diagonal argument also apply to natural numbers? Do I need a passport to visit Edinburgh in Scotland from elsewhere in the UK? I'm visiting Scotland for the first time this week, Edinburgh. I've lived in the UK for over 10 years but my nationality is Spanish. I only have a Spanish passport.  I'm also traveling by train.  Do I need a passport to enter Scotland and stay in my booked hotel? I'm running Windows 7. It seems that svchost is eating up a lot of memory.   The user name for the particular svchost instance is "Network Service". The description is "Host Process for Windows Services".   Sometimes it eats up 50% of the CPU usage. Other times, it's just under 5%. I can't figure out when it's 50% and when it's not. But it fluctuates often -- even when I've just booted up and no programs were started.  How do I diagnose this? I get it after updating in Synaptic Manager  I recently did a clean install of Ubuntu 17.04 from 16.10.  error message:-  W: Download is performed unsandboxed as root as file '/var/cache/apt/archives/partial/samba-libs_2%3a4.5.8+dfsg-0ubuntu0.17.04.1_i386.deb' couldn't be accessed by user '_apt'. - pkgAcquire::Run (13: Permission denied) Integrating $\int \sin^n{x} \ dx$ I am working on trying to solve this problem:     Prove: $\int \sin^n{x} \ dx = -\frac{1}{n} \cos{x} \cdot \sin^{n - 1}{x} + \frac{n - 1}{n} \int \sin^{n - 2}{x} \ dx$   Here are the steps that I follow in the example that I am reading:     $u = \sin^{n - 1}{x}$      $du = (n - 1) \cdot \sin^{n - 2}{x} \cdot \cos{x} \ dx$      $v = -\cos{x}$      $dv = \sin{x} \ dx$            $\int \sin^n{x} \ dx =  \sin^{n - 1}{x} \cdot \sin{x} \ dx$      $\int \sin^n{x} \ dx = \underbrace{\sin^{n - 1}{x}}_{u} \cdot \underbrace{-\cos{x}}_{v} - \int \underbrace{-\cos{x}}_{v} \cdot \underbrace{(n - 1) \cdot \sin^{n - 2}{x} \cdot \cos{x} \ dx}_{du}$      $\int \sin^n{x} \ dx = -\cos{x} \cdot \sin^{n - 1}{x} + (n - 1)\int \sin^{n - 2}{x} \cdot \cos^{2}{x} \ dx$      $\int \sin^n{x} \ dx = -\cos{x} \cdot \sin^{n - 1}{x} + (n - 1)\int \sin^{n - 2}{x} \cdot \left(1 - \sin^{2}{x}\right) \ dx$   Here is where I get lost. How did we go from $\int \sin^{n - 2}{x} \cdot \left(1 - \sin^{2}{x}\right) \ dx$ to $\int \sin^{n - 2}{x} \ dx - (n - 1) \int \sin^{n}{x} \ dx$? Even more specifically, where did $\sin^{n}{x}$ come from?     $\int \sin^n{x} \ dx = -\cos{x} \cdot \sin^{n - 1}{x} + (n - 1)\int \sin^{n - 2}{x} \ dx - (n - 1) \int \sin^{n}{x} \ dx$   I get this part.     $n\int \sin^n{x} \ dx = -\cos{x} \cdot \sin^{n - 1}{x} + (n - 1)\int \sin^{n - 2}{x} \ dx$      $\int \sin^n{x} \ dx = -\frac{1}{n} \cos{x} \cdot x \ \sin^{n - 1}{x} + \frac{n - 1}{n} \int \sin^{n - 2}{x} \ dx$   Could someone please explain what I am missing?  Thank you for your time. Why disable Fast Boot on Windows 8 when having dual booting? Why is everybody keep mentioning to disable Fast Boot on Windows 8 if you have installed alongside Ubuntu? Is it something that is recommended only for UEFI machines or is it a suggestion for Legacy BIOS machines as well? Is it because it makes the Windows partition inaccessible from Linux or there is another more serious reason to disable it? Combining two covariance matrices $-1$ is a quadratic residue modulo $p$ if and only if $p\equiv 1\pmod{4}$ I came across this problem and I believe Lagrange's theorem is the key to its solution.  The question is:     Let $p$ be an odd prime. Prove that there is some integer $x$ such that $x^2 \equiv −1 \pmod p$ if and only if $p \equiv 1 \pmod 4$.   I appreciate any help.  Thanks. Is there any evolutionary/physiological advantage to multi-lateral symmetry? Just wondering ; I get the impression a large number of multicellular organisms are multi-lateral in their physical structure. Why would evolution/mutation have retained multi-lateral symmetry in an organism? What advantage/s does symmetry provide an organism?  EDIT:  By multi-lateral symmetry I mean at-least bi-lateral symmetry (as in the case of many beings such as elephants, crabs and fishes), but perhaps more than bi-lateral too (starfish come to mind)  END EDIT: What is 'Currying'? I've seen references to curried functions in several articles and blogs but I can't find a good explanation (or at least one that makes sense!) In chapter 2, the section on bitwise operators (section 2.9), I'm having trouble understanding how one of the sample methods works.  Here's the method provided:  unsigned int getbits(unsigned int x, int p, int n) {     return (x &gt;&gt; (p + 1 - n)) &amp; ~(~0 &lt;&lt; n); }   The idea is that, for the given number x, it will return the n bits starting at position p, counting from the right (with the farthest right bit being position 0). Given the following main() method:  int main(void) {     int x = 0xF994, p = 4, n = 3;     int z = getbits(x, p, n);     printf("getbits(%u (%x), %d, %d) = %u (%X)\n", x, x, p, n, z, z);      return 0; }   The output is:     getbits(63892 (f994), 4, 3) = 5 (5)   I get portions of this, but am having trouble with the "big picture," mostly because of the bits (no pun intended) that I don't understand.  The part I'm specifically having issues with is the complements piece: ~(~0 &lt;&lt; n). I think I get the first part, dealing with x; it's this part (and then the mask) that I'm struggling with -- and how it all comes together to actually retrieve those bits. (Which I've verified it is doing, both with code and checking my results using calc.exe -- thank God it has a binary view!)  Any help? It is well known that a  can "split light" by separating different frequencies of light:    Many sources state that the reason this happens is that the  is different for different frequencies.  This is known as .  My question is about why dispersion exists.  Is frequency dependence for refraction a property fundamental to all waves?  Is the effect the result of some sort of non-linearity in response by the refracting material to electromagnetic fields?  Are there (theoretically) any materials that have an essentially constant, non-unity index of refraction (at least for the visible spectrum)? Can a fired moderator be elected as a moderator? While this question is inspired by recent events, it is an independent question and not tied down to any specific moderator or situation.  There's precedent for a moderator who resigned their diamond to simply ask Stack Exchange for their diamond back, without having to stand for reelection. Obviously, this may not apply if the moderator did not resign, but was removed for cause by Stack Exchange.  If a moderator has been "fired" by Stack Exchange (has had their diamond removed involuntarily by corporate action), is the person eligible to pull a  and regain a diamond through the democratic process on one of our sites, or would any such attempt be blocked? I'm aware that there is a restriction on  from standing for election, but this is not the same thing as being stripped of a diamond (fired moderators, IME, aren't also given a full site suspension unless their behavior goes beyond "possibly not a very good moderator" into "supervillain" territory).  If there is no particular rule, what should that rule be?   Should fired moderators be immediately eligible to stand for election, subject only to community approval of them returning? Should fired moderators have to go through a separate re-vetting process with Stack Exchange to regain eligibility to stand for office? Should fired moderators have an ineligibility window in a similar way that suspended users have one (e.g. after X months or years after being fired, they may stand for election). Should fired moderators be forever banned from election?   In no way am I asking about the process for a fired moderator to seek restoration through corporate appeals, etc. I'm asking only about the community election process - if a site's community wants to elect a previously fired moderator, is this inherently objectionable to Stack Exchange? When does Bleeding Attack effect apply? I've designed for a campaign a duo of rogues. My character is as , and his follower is a Knife Mistress. Couple of question about them. Our party is about to ambush several . My Sniper will hide near their camp, and shoot the weakest one when fight begins. His follower will then rush the troll and slice him in several pieces. My Sniper has the Bleeding attack feat:  Bleeding Attack (Ex) Benefit: A rogue with this ability can cause living opponents to  by hitting them with a sneak attack. This attack causes the target to take 1 additional point of damage each round for each die of the rogue's sneak attack (e.g., 4d6 equals 4 points of bleed). Bleeding creatures take that amount of damage every round at the start of each of their turns. The bleeding can be stopped by a DC 15 Heal check or the application of any effect that heals hit point damage.  Emphasis mine. Thus, a normal enemy would bleed every turn, until he get cleaned of the bleeding effect. However, troll have a special ability, which is  5 (acid/fire)  Regeneration (Ex) A creature with this ability is difficult to kill. Creatures with regeneration heal damage at a fixed rate, as with , but they cannot die as long as their regeneration is still functioning (although creatures with regeneration still fall unconscious when their hit points are below 0). Certain attack forms, typically fire and acid, cause a creature’s regeneration to stop functioning on the round following the attack. During this round, the creature does not heal any damage and can die normally. The creature's descriptive text describes the types of damage that cause the regeneration to cease functioning.  So, the troll will automatically get rid of the bleeding effect during his first turn. My question is: Does the bleeding effect apply before the regeneration, or get neglected, because the troll will heal during his turn? Am I right to assume that, Bleeding attack effect getting triggered at the beginning of the troll turn, it will deal him the damages before the wounds heals? In the simple linear regression model, $\hat{\beta}$ is the sum of independent normally distributed random variables.  Is it false because in linear regression there is $\beta$ and not $\hat{\beta}$?