I do not see any way to use Windows 7 search to search file content ONLY w/o it also including file names. For example, how do you search for files that contain "L:\" and only files that CONTAIN "L:\"? I do not want a list of files that have that in their name (filespec) but only a list of files that have that in their content.  Someone suggested L:\ System.FileName:NOT ~L:\ but that excludes all files with L:\ in their name (filespec) including the ones that contain "L:\".
In Windows XP we can search for files that contain a defined keyword (inside all files types).  Windows 7 can look inside files for a keyword, but only for text files. (*.doc, *.txt, *.inf, ...), not (*.conf, *.dat, *.*, ...).   don't contain any filter I can use for this.  How is this possible?
I want to unwrap a label which has a transparent area Cartesian products and families I have some trouble trying to understand Halmos' explanations about generalized Cartesian products. I've read these entries already:    This also has the page I'm stuck on.      Is his generalization the same as a Cartesian product of several sets? As here:   What puzzles me is $\{a,b\}$. Where does it come from, what does it do? I know that it is supposed to be arbitrary. How does it identify distinct elements of $X \times Y$? Does some function map each $a \in A$ to an element in $X$? Or is it always the same $a$?  What does he mean by      the set $Z$ of all families $z$, indexed by $\{a,b\}$, such that $z_a \in X$  and $z_b \in Y$   ? What does does an element of $Z$, namely one family $z$, consist of? By family, does he mean an indexing function or the indexed elements? This comes to a very important question for me: Does family mean a function or the set of all indexed elements?   I will try to explain how I understand it thus far: $Z$ contains elements of the form $\{(a,x),(b,y)\}$. The choice of $x$ depends on $a$, so an $x$ in a $z \in Z$ equals the $z_a$ of $X$. Now, we want to map these pairs to $X \times Y$, so we have a function $f$ that takes $z \in Z$ and connects it to the corresponding ordered pair $(z_a, z_b)$, where $z_a \in X$. $X \times Y$ is not the same as $Z$; they only, effectively, contain equal elements.  He goes on:     If $\{X_i\}$ is a family of sets ($i \in I$), the Cartesian product of the family is, by definition, the set of all families $\{x_i\}$ with $x_i \in X_i$ for each $i$ in $I$.   How I understand it: $\{X_i\}$ contains, as elements, several sets, each single one a set $X$ identified by an index/element of $I$. Then, we go over all indeces $i$ in $I$, take from each set $X$, namely $X_i$, an element $x$ and add it to current set of the newly created sets/families. So, the lower index $i$ does not refer to an element of $X_i$ indexed by $i$, but rather calls all elements of $X_i$ $x_i$. We end up with a set, defined as Cartesian product, of sets, in which each element (set) contains ordered elements, each from a different $X_i$. How does the ordering occur?  $\prod_i X_i$, the Cartesian product, becomes equal to $X^I$, if all $X_i$ are the same set $X$. $X^I$ means all possible combinations of mapping from $I$ to $X$. We randomly take an elements $x$ from some $X_i$, put it in a set/family with other randomly obtained $x$, put the entire set into a set denoted $X^I$, and continue doing so, till we have no more options. Then, each set in the new $X^I$ contains a mapping of some $i$ to some $x$. Since we exhausted the options, they are indeed all combinations.  Where did I go wrong? Someone needs to spoonfeed my the answer; I am completely confused by now. Not every boolean function is constructed from $\wedge$ (and) and $\vee$ (or) Is there any way to erase personal information from my phone that has already been stolen? My phone has been stolen. I do not want the thief to have access to any of my personal information such as calls, texts, and information saved in the phones contents. Is there any possible way I can get this information erased from my phone? WoeUSB Error Code 256 with NTFS formatted USB I'm working on a jet in blender. While thinking about the final scene, I wondered if there was a way to create schock diamonds(also known as Mach diamonds, Mach disks, Mach rings, donut tails or thrust diamonds) in blender.  Hopefully somebody can help, I haven't found anything online.      picture from wikipedia  picture from Tom Clancy's H.A.W.X  thanks for any tips.  tags: mach, schock, diamond, jet, exhaust, afterburner, engine, Physical phenomena  edit: added some pictures, Load Excel data sheet to Oracle database I am looking for a free tool to load Excel data sheet into an Oracle database. I tried the Oracle SQL developer, but it keeps throwing a NullPointerException. Any ideas? Bash-like, non-rotating filename tab completion with PowerShell Under Windows, using PowerShell, is it possible to make the filename suggestion (using the Tab key) work like with bash under Linux?  Let's assume a directory contains 3 directories: example1, example and examination.  On Windows (by default), if you type cd ex and Tab, it will auto-suggest cd .\examination. Subsequent uses of Tab will rotate the suggestion between example1, example and examination.  Using bash (typically under Linux), if you type cd ex and Tab, it will auto-complete until the character where the filenames start to differ: cd exam. Another use of Tab then suggests which directories are available:  $ cd exam examination/ example1/    example2/   Then, if you type p and Tab, it will auto-complete to example, and so on (here, offering a choice between example1 and example2).  Is there a way to make the filename suggestion work in a tree-like search like this, instead of rotating through the names?  (I'm mainly interested in file names. Bash can also refine this selection based on the file type, for example only directories for cd, which would be good, but having the file name selection itself would be enough.) Infinite amount of flags I have been going through some old posts, flagging them as necessary. But I have noticed that the number of posts that I am able to flag is continually staying at ten. It seems that the new flagging system has messed this up.  I am able to keep flagging posts even after 10, so I know it isn't a UI bug. This is a very big problem, because I can flag infinitely many times. And I am pretty sure this isn't the intended behavior of the overlords This isn't because I am being awarded more flags. I flag more than 13 posts in 5 minutes, and I can keep going without restriction  Some of the flags were accepted, so now my number is up to 13. But it is still staying at 13 A Tweedie distribution can model skewed data with a point mass at zero when the parameter $p$ (exponent in the mean-variance relationship) is between 1 and 2.   Similarly a zero-inflated (whether otherwise continuous or discrete) model may have a large number of zeros.  I'm having trouble understanding why it is that when I do prediction or calculate fitted values with these kinds of models, all of the predicted values are non-zero.  Can these models actually predict exact zeros?  For example  library(tweedie) library(statmod) # generate data y &lt;- rtweedie( 100, xi=1.3, mu=1, phi=1)  # xi=p x &lt;- y+rnorm( length(y), 0, 0.2) # estimate p out &lt;- tweedie.profile( y~1, p.vec=seq(1.1, 1.9, length=9)) # fit glm fit &lt;- glm( y ~ x, family=tweedie(var.power=out$p.max, link.power=0)) # predict pred &lt;- predict.glm(fit, newdata=data.frame(x=x), type="response")   pred now does not contain any zeros.  I thought the usefulness of models such as the Tweedie distribution comes from its ability to predict exact zeros and the continuous part.  I know that in my example the variable x is not very predictive. Are there any clones/alternatives for running a Stack Exchange style Q&A site? Hiding get mobile app button on SP online communication site collection For one of the clients, I have spin up a modern communication site collection and on the landing page of the same, I am seeing 'Get the mobile app' showing up, I was able to hide the 'feedback' button using css but no luck with Get the mobile app button.  Can someone please share css to hide 'get mobile app' button, appreciate the help. Django templates offer the builtin tag cycle for alternating between several values at different points in a template (or for loop in a template) but this tag does not reset when it is accessed in a scope outside of the cycles definition.  I.e., if you have two or more lists in your template, the rows of all of which you'd like to use some css definitions odd and even, the first row of a list will pick up where the last left off, not with a fresh iteration from the choices (odd and even)  E.g., in the following code, if the first blog has an odd number of entries, then the first entry in a second blog will start as even, when I want it to start at odd.  {% for blog in blogs %}   {% for entry in blog.entries %}     &lt;div class="{% cycle 'odd' 'even' %}" id="{{entry.id}}"&gt;       {{entry.text}}     &lt;/div&gt;   {% endfor %} {% endfor %}   I've tried obviating this by patching with the resetcycle tag offered here:    to no avail.  (The code didn't work for me.)  I've also tried moving my inner loop into a custom tag, but this also did not work, perhaps because the compile/render cycle moves the loop back into the outer loop?  (Regardless of why, it didn't work for me.)  How can I accomplish this simple task!?  I'd prefer not to create a data structure in my view with this information pre-compiled; that seems unnecessary.  Thanks in advance. Is Mana Weaving ok if it's followed by a thorough shuffle? My friends and I are relatively new to MtG. At some point, one of them introduced us to the idea of mana weaving, and we'd do this to declump our decks prior to a very thorough shuffling. However, at the Theros pre-release, one of us was asked not to do this, and we learned it was frowned upon and ceased to do it.  I just now came across , and it sounds like mana weaving's only bad if you use it to leave your deck in an even distribution, and it's OK if your deck is then thoroughly shuffled. In hindsight, the judge may have simply thought my friend wouldn't have shuffled afterwards, but at the time I came under the impression it was frowned upon even if you did shuffle afterwards.  So: is mana weaving my deck OK, if I shuffle it very thoroughly afterwards? Is const_cast safe? I can't find much information on const_cast.  The only info I could find (on Stack Overflow) is:     The const_cast&lt;&gt;() is used to add/remove const(ness) (or volatile-ness) of a variable.   This makes me nervous.  Could using a const_cast cause unexpected behavior?  If so, what?  Alternatively, when is it okay to use const_cast? Understanding the length extension attack I have been trying to understand exactly how a length extension attack works on SHA-1. I'll detail below what I've understood so far, so that I can convey my understanding of the same and hopefully get advice on where I'm going wrong.  Lets assume that for a message $m$, a secret $s$ is appended to it and the SHA-1 hash is calculated. If $\textrm{len}(m) + \textrm{len}(s)$ is not a multiple of the block size, a certain amount of padding is added to it to make it a multiple, and the hash is generated using what is essentially $s || m || \textrm{padding}$.  Now SHA-1 internally uses 5 registers — it takes in an block, generates new register values, turns the crank, takes in another block, generates new register values, turns the crank ... and so on till the end. When all blocks are exhausted, the register values are concatenated and spit out.  Assume that an attacker knows a certain value of $m$, for which he also knows the hashed key. In such a case, he knows the state of the 5 registers when $(s || m || \textrm{padding}$ was processed. Lets also assume that the attacker knows the length of $s$, so that he can predict how much padding was added.  Here is where I get confused. From what I've read so far, the attack involves taking the known hash, adding a certain amount of padding and then the value that we want. However, isn't the padding already used up in creating the hash? Why are we using padding in our attack? sed -i - edit files in place does not work in compound commandq I am having problems starting my Apache server, because port 443 is already in use.  It turns out, the system process (PID 4) uses the port 443. I don't have IIS installed, the services.msc shows (predictably) no Exchange server running, nor WWW-Services, nor IIS. I have no idea how to find out what service uses that port, short of just disabling each service one after the other, and I am not even sure that would help.  I would be grateful if someone could point me towards how I can get my SSL port back, thank you :)  P.S.: Of course "just switch Apache to another port for SSL" would solve the problem of not being able to start Apache. But I'd still like to know what is so insistent about hogging port 443. :)    I by now took the 'hard route' and disabled services one after the other. It turned out that the "Routing and RAS" service was the culprit.  Thank you all for the valuable input and the new tools in the combat against "WTF does my system do now?". Why isn't dark matter just ordinary matter? There's more gravitational force in our galaxy (and others) than can be explained by counting stars made of ordinary matter. So why not lots of dark planetary systems (i.e., without stars) made of ordinary matter? Why must we assume some undiscovered and unexplained form of matter? What does: Error Broken count >0 mean? I have the message:   Error Broken count &gt;0 Check if you are using third party repositories. If so disable them, since they are a common source of problems. Furthermore run the following command in a Terminal: apt-get install -f Details: The following packages have unmet dependencies: firefox-globalmenu: Depends: firefox (= 19.0+build1-0ubuntu0.12.04.2) but 19.0+build1-0ubuntu0.12.04.1 is installed   Any suggestions?