I often build large projects. An example is a site that is built with Jekyll. The build takes about 20 seconds, and changes thousands of HTML files. The same happens when I build the documentation of some projects.  Tracker store picks this up, and then starts indexing them, causing huge CPU spikes.    I don't need tracker to index these build-artifacts. The build artifacts go into one, or at most a very few, known directories, but these might have subdirectories. I do want tracker to keep indexing most of my system, I like the features it offers on Ubuntu.   Is it possible to selectively disable tracker indexing or monitoring a certain directory and its subdirectories? On e.g. Android a .nomedia file avoids Android from indexing it: does something like this exist for Tracker, or is there another kind of config for this?
I am running Ubuntu GNOME 15.10 with GNOME 3.18, and I would like to know if I can do any of the following and if so how:   Make it so that a folder is not indexed but leave its contents indexable (so that if I search for that folder's name in my system nothing will come up, but if I search for its contents, that will come up) Make it so that a folder is not indexable and nor is any of its contents (and if it contains sub-folders within it then it should recursively not allow any contents in them to be indexed nor the contents of any sub-sub-folders in the sub-folders etc, nor any of those sub-folders themselves) Make it so that individual files in a folder are not indexable, though not having any impact on other contents nor the parent-folder   So, are any of these variants possible? I believe the indexing program is called Tracker which indexes files and folders and their contents and allows for one to search for them on the system.
Windows 7 USB install error I am trying to install Windows 7 Professional x64 from a bootable USB stick. I have used the Windows 7 USB DVD Download Tool to create the media from an ISO.  The machine boots from USB fine, and enters the Windows installation wizard but then I get an error stating:     A required CD/DVD drive device driver is missing. If you have a driver floppy disk, CD, DVD, or USB flash drive, please insert it now.   I have tried setting the SATA controller in the BIOS to both AHCI and ATA but neither appear make any difference.  I've also tried both the USB 3 and USB 2 ports with no difference.  I've also tried to use the files from an official Dell recovery CD as this is a Dell laptop but again, no dice.  All this because there's no optical drive in the machine!  Dell Vostro V131 / i5-2450M / BIOS A04  Can anyone offer any advice please? Suppose I am a naturalized citizen of the US, but also a citizen of another country, "XYZ". I then boarded a plane and left the US to another country (maybe not necessarily to XYZ), without first getting a US passport, but using my old, but valid XYZ passport.   In this case what would be the best documents to have for me to gain entry back into the US as a US Citizen without a passport?  Would I need to contact the US Embassy for help in order to be able return?  If the airline does let me aboard to return to the US, even without the US passport, what are the best documents could I show at the border to prove I am a US citizen but that I just don't have a passport, for whatever reason? hyperlink name with biblatex authoryear (biblatex 1.4b) There are five boxes consisting of several identical coins. There are five boxes consisting of several identical coins. The first box contains 4 coins, the second box contains 9 coins, the third box contains 7 coins, the fourth box contains 10 coins, and the fifth box contains 3 coins. Some coins are taken from the boxes such that at least a coin taken from each box. In how many ways in taking the coins, such that the numbers of the coins taken are 12?  My attempt was solving it using repetition combination of which, there are only seven coins remaining considering that at least a coin taken from each box. By using the repetition combination, i.e. taking 7 from 9 (five boxes and four borders), resulting in 36 ways. However, there is no 36 ways in the choices. Natural (human alpha-numeric) sort in Microsoft SQL 2005 We have a large database on which we have DB side pagination. This is quick, returning a page of 50 rows from millions of records in a small fraction of a second.  Users can define their own sort, basically choosing what column to sort by.  Columns are dynamic - some have numeric values, some dates and some text.  While most sort as expected text sorts in a dumb way. Well, I say dumb, it makes sense to computers, but frustrates users.  For instance, sorting by a string record id gives something like:  rec1 rec10 rec14 rec2 rec20 rec3 rec4   ...and so on.  I want this to take account of the number, so:  rec1 rec2 rec3 rec4 rec10 rec14 rec20   I can't control the input (otherwise I'd just format in leading 000s) and I can't rely on a single format - some are things like "{alpha code}-{dept code}-{rec id}".  I know a few ways to do this in C#, but can't pull down all the records to sort them, as that would be to slow.  Does anyone know a way to quickly apply a natural sort in Sql server?    We're using:  ROW_NUMBER() over (order by {field name} asc)   And then we're paging by that.  We can add triggers, although we wouldn't. All their input is parametrised and the like, but I can't change the format - if they put in "rec2" and "rec10" they expect them to be returned just like that, and in natural order.    We have valid user input that follows different formats for different clients.  One might go rec1, rec2, rec3, ... rec100, rec101  While another might go: grp1rec1, grp1rec2, ... grp20rec300, grp20rec301  When I say we can't control the input I mean that we can't force users to change these standards - they have a value like grp1rec1 and I can't reformat it as grp01rec001, as that would be changing something used for lookups and linking to external systems.  These formats vary a lot, but are often mixtures of letters and numbers.  Sorting these in C# is easy - just break it up into { "grp", 20, "rec", 301 } and then compare sequence values in turn.  However there may be millions of records and the data is paged, I need the sort to be done on the SQL server.  SQL server sorts by value, not comparison - in C# I can split the values out to compare, but in SQL I need some logic that (very quickly) gets a single value that consistently sorts.  @moebius - your answer might work, but it does feel like an ugly compromise to add a sort-key for all these text values. Root partition size remains same after partition resize with gparted I had resized my root partition from 30gb to 70gb using gparted. But Ubuntu still shows that I have the same old disk size while gparted shows that I acually have 70gb and that the other 40gb is somehow used. How can I fix this?  Output of 'df -h':  Filesystem      Size  Used Avail Use% Mounted on /dev/sda5        30G   16G   13G  55% / none            4.0K     0  4.0K   0% /sys/fs/cgroup udev            1.9G  8.0K  1.9G   1% /dev tmpfs           391M  884K  390M   1% /run none            5.0M     0  5.0M   0% /run/lock none            2.0G  284K  2.0G   1% /run/shm none            100M   48K  100M   1% /run/user /dev/sda6       341G  115G  227G  34% /media/Data /dev/sdb1       932G  459G  474G  50% /media/sidharth/passport   Output of mount:  /dev/sda5 on / type ext4 (rw,errors=remount-ro) proc on /proc type proc (rw,noexec,nosuid,nodev) sysfs on /sys type sysfs (rw,noexec,nosuid,nodev) none on /sys/fs/cgroup type tmpfs (rw) none on /sys/fs/fuse/connections type fusectl (rw) none on /sys/kernel/debug type debugfs (rw) none on /sys/kernel/security type securityfs (rw) udev on /dev type devtmpfs (rw,mode=0755) devpts on /dev/pts type devpts (rw,noexec,nosuid,gid=5,mode=0620) tmpfs on /run type tmpfs (rw,noexec,nosuid,size=10%,mode=0755) none on /run/lock type tmpfs (rw,noexec,nosuid,nodev,size=5242880) none on /run/shm type tmpfs (rw,nosuid,nodev) none on /run/user type tmpfs (rw,noexec,nosuid,nodev,size=104857600,mode=0755) /dev/sda6 on /media/Data type fuseblk (rw,nosuid,nodev,allow_other,default_permissions,blksize=4096) binfmt_misc on /proc/sys/fs/binfmt_misc type binfmt_misc (rw,noexec,nosuid,nodev) gvfsd-fuse on /run/user/sidharth/gvfs type fuse.gvfsd-fuse (rw,nosuid,nodev,user=sidharth) /dev/sdb1 on /media/sidharth/passport type fuseblk (rw,nosuid,nodev,allow_other,blksize=4096) Determining functions from specifications... my high school teacher asked this question today, and I am struggling to find an answer that will work. The question is outlined below:  Give an example of a cubic polynomial, defined on the open interval (-3,3), which reaches both its maximum and minimum values. $TT^*=T^2$, show that $T$ is self-adjoint Let $V$ be an inner product space, finitely generated over $\mathbb{C}$, $T\in \operatorname{End}(V)$ that satisfies $TT^*=T^2$, show that $T$ is self-adjoint.    I know that $TT^*$ is positive so has positive square-root, thus the square root is positive definite. But I don't feel like this is a proof. Can anyone prove it without considering square root? Teleporting a player from the overworld to the end Cannon Locations in New Super Mario Bros. Wii? In Super Mario Bros. Wii, there are cannons on the overworld map that you can use to skip worlds. However, the cannons are initially inaccessible, and you need to complete certain levels in a specific manner to get to them. What levels do I need to complete in order to access these cannons? Is it the airport security at the country you flying from? I highly doubt it because I have been to countries where it's so corrupted that you buy the airport officials for the price of a dinner.   Is it the aircrew' responsibility? Again I don't think they care much - unless there is severe punishments - in corrupted third world countries.   I have been personally in a situation when an officer at a certain airport insisted on examining my British passport before he allowed me to move to the gate because I refused to slip him a $100 note. I was travelling to the UK yet I have another passport which is valid and it is issued by the country I was flying from, which means he had no reason whatsoever - nor I think he cared - to examine my British passport to check if it's valid.  Edit to summarize it, I want to expose as little as possible of information about my dual nationality. For that I need to know whom I am obligated to show my passport(s) How to remove selected commit log entries from a Git repository while keeping their changes? I would like to remove selected commit log entries from a linear commit tree, so that the entries do not show in the commit log.  My commit tree looks something like:  R--A--B--C--D--E--HEAD   I would like to remove the B and C entries so that they do not show in the commit log, but changes from A to D should be preserved. Maybe by introducing a single commit, so that B and C become BC and the tree looks like.  R--A--BC--D--E--HEAD   Or, ideally, after A comes D directly. D' representing changes from A to B, B to C and C to D.  R--A--D'--E--HEAD   Is this possible? if yes, how?  This is a fairly new project so has no branches as of now, hence no merges as well. zeros of a polynomial Given $P(z)=z^6+6z+10$, find how many roots are in each quadrant    I have already seen that $P(z)$ has six different roots, and that none of them are real or of the form $ki$, $k\in \Bbb R$. Since the coefficients of $P(z)$ are real, then it's roots are 3 conjugate pairs, and therefore the possibilities are limited to two.  Defining $f(z)=z^6$, $g(z)=z^6+6z+10$ and applying Rouche in $|z|&lt;2$, $|f(z)-g(z)|&lt;|f(z)|$ I get that all roots are contained in the disc, but how do I go about splitting them into the four quadrants? From what I know about this polynomial, finding zeros in one quadrant is enough to determine the rest, but I'm stuck trying to apply rouche to a quarter circle (basically I'm having trouble finding a suitable f and g) Recommended way to save uploaded files in a servlet application As much as I like having the hardcover core rule-books in front of me, usually I read or reference most information for RPGs on my computer.  Unfortunately, my google-fu has failed me at finding places to buy a Player's Handbook PDF, or even whether said PDF exists at all.  My question is this: Is there any place I can go to legally buy a D&amp;D 5e core rulebook PDF?  I'm not looking for the starter set or basic rules, since those are incomplete (and free), I'm just looking for the core books in PDF format. Is there any way to make a method with more than one instance? Example: I type man ls, than I want to get man only.   By using !! I can get man ls but how do I get man? When I'm not exploring fresh caves or lands in minecraft, I'm busy trying to find deposits of diamond, gold and iron deep in the earth. So far I've just been digging around just above bedrock on a whim to look for these rare minerals but I've started thinking that I should be taking a more controlled, efficient approach to mining.  What is the optimal mining strategy that yields the most rare minerals while minimizing blocks removed and time spent digging and traveling?  Edit: The existing answers are great for mining, but no one has addressed travel time to and from the mine which is usually ~60 blocks downward and incredibly tedious. Solutions? MonoTouch.Dialog: How to set limit of number of characters for EntryElement Can we use "there is" for plural nouns?