When looking for txt files, I run this command:  find . -name "*.txt" -print   This gives me a list of all the text files beneath current directory.  However, find . -name *.txt -print gives me the following error: find: paths must precede expression: mein.txt  Is this the generally expected behavior? What difference do the quotation marks make?
Using find with grep, one can locate files that match a pattern:  # find | grep error ./solr-modifiedSolr4/SolrPhpClient/phpdocs/errors.html ./error_log ./includes/classes/error_log   However, using find alone the first file is not found:  # find . -name error* ./error_log ./includes/classes/error_log   Why doesn't find locate the errors.html file when not used with grep? How is find used to show this file as well?
What are the summary rules for when to use image stabilization and when not to? When I got my DSLR, I took a lot of pics and all of them came excellent, even though I had VR at the "Off" position.   Since those came out so well, I wonder when should I turn VR on, and when I should just leave it off.   I found  which answer this question in detail, but that's too much for me to understand easily. Can someone explain the strict rules in short?  Should I use VR with tripod? When should I use it when I'm not using a tripod, and when should I leave it off? I have been thinking about the following formulation of the Axiom of Choice.:     For any relation $R$, there is a function $H$, which is a subset of $R$, and such that $\operatorname{dmn}H=\operatorname{dmn}R$.   At first, it seemed surprising to me that this did not follow from Comprehension (i.e., from the schema  $\forall x_1, x_2, ..., x_n \forall C\exists B \forall x ( x \in B \Leftrightarrow x \in C \land \phi )$, where $B$ does not occur free in $\phi$).    I thought that for any relation, it seems that we should be able to define a subset of it with the same domain meeting a "functional condition".  But when I tried to do this, I couldn't.  However, I felt like I was getting close when I let $B$ be free in $\phi$, i.e., when I let myself say that $w$ is in $R$ and also anything in $H$ meets such and such conditions, where $H$ is the set (function) whose existence I'm trying to prove.    But my understanding is that Choice does not even follow from Naive Comprehension.  So, I wondered if someone could explain the following precisely.   Why does the above formulation of Choice does not follow from regular Comprehension? Why does it not even follow from Naive Comprehension (assuming that it does not)? Where are Upstart log messages on Ubuntu 13.X? is this set a regular surface? I'm reading "Differential Geometry of Curves and Surfaces of Manfredo Docarmo" I'm doing  the exercises of the chapter 2. Here is the definition of regular surface that we are following:   I have problems with this exercise:   Is with the first part, I think that it's not true that it's a regular surface (the second it is). I don't know how to prove that something is not a regular surface. When looking at my objects in 3d view I'm seeing a gray cone that seems to be hiding other objects.   Can anyone help me turn this off and explain what it is please.  Screenshots attached. What does pwd output? Does the command pwd in a shell script output the directory the shell script is in? Displaying and/or searching across thousands of contacts? The Need  Our application has a chat feature that allows our users to chat with other users within their database.   However, we're adding a feature that allows clients to share data between multiple databases as an "Enterprise" configuration, and we've been asked to update the design of the chat feature to allow users to chat with other users within any of those databases.   We've looked at the numbers of possible users in these scenarios, and the number of chat users in these shared database environments can be as many as 5,000.   Users need to be able find people they need to chat with out of these thousands of contacts. However, up til now, we've had a list of contacts the users can browse. Since that is a user expectation, we were hoping to still maintain a browse-able list of contacts. We have ruled out trying to display a list of 5,000 contacts, as this doesn't seem to be anywhere close to useful or usable.   We've come up with three approaches to solve the problem:  Option One  Show a list of contacts from the local database that user's can browse. Have a second tab that allows users to search the "Full Directory", returning results from multiple databases.     Pros:   Allows us to show a browse-able list of relevant contacts  Clearly indicates to users that another source of chat contacts are available   Cons:   Search would be limited to the current tab, meaning users would have to be in the right tab to return the right result Adds a possible source of user confusion: whats the difference between "contacts" and the "full directory"? Adds another tab to what should be a simple chat list     Option Two  Show a list of contacts from the user's local database, but if they search for a contact, include results from other databases as well.     Pros:   Maintains a list of contacts the user can browse Avoids adding adding another tab One search field searches all sources   Cons:   Searching a finite contact list and returning results that weren't in the contact list may defy user's mental model of how the search will work. Not clear that another source of contacts exist. May need to add explanatory text that says "Search to see contacts from the full directory".      Option Three  Add a dropdown that allows a user to select a what to search in: the local database, or the full directory.     Pros:    No additional tab required Indicates to users that another source of chat contacts are available, though not as clearly as option 1   Cons:    Search still isn't universal: the right search category must be selected to return the right result Users may not notice the dropdown or understand intuitively what its function is. May require explanatory text in search results, reminding the user they can expand the search to the full directory     Thoughts?  Right now I'm leaning towards option two, but is there another option I'm not considering here? Is there another alternative worth considering?   Thanks! Why does Lang describe a field as a union and compositum of its subfields in this manner? I am reading Serge Lang's Algebra, revised 3rd edition, and on page 226, the author makes the following definitions and observations:   If $E,F \subset L$, the compositum of $E$ and $F$ in $L$ is defined to be the smallest subfield of $L$ containing both $E$ and $F$. It is denoted $EF$. If $k \subset E$ and $\alpha_1,\dots,\alpha_n \in E$, then $k(\alpha_1,\dots,\alpha_n)$ is defined to be the smallest subfield of $E$ containing $k$ and $\alpha_1,\dots,\alpha_n$. Observe that $$ E = \bigcup k(\alpha_1,\dots,\alpha_n), $$ where the union is taken over all finite families $\{ \alpha_1,\dots,\alpha_n \}$ of elements of $E$. The compositum of an arbitrary family of subfields of a field $L$ is defined as the smallest subfield of $L$ containing all fields in the family. $E$ is finitely generated over $k$ if there is a finite family $\{ \alpha_1,\dots,\alpha_n \}$ of elements of $E$ such that $E = k(\alpha_1,\dots,\alpha_n)$. Observe that $E$ is the compositum of all its finitely generated subfields over $k$.   My question is regarding the two observations (point nos. 3 and 6). It appears to me that it is enough to take union (and compositum) over all subfields generated by a single element. For example for point no. 3, I can write $$ E = \bigcup_{\alpha \in E} k(\alpha) $$ because $E$ is clearly contained in the RHS, and each $k(\alpha)$ is contained in $E$ and hence so is the union, implying that $E$ contains the RHS. Similarly for point no. 6.  So, why does Lang emphasise to take the union and compositum over all finitely generated subfields? Is there some perspective that he wishes to emphasise that I am missing? Any help in understanding this will be appreciated. Show a connected metric space (X,d) is $\epsilon$-chainable for $\epsilon &gt;0$       $\epsilon$-chainable Definition      (X,d) is $\epsilon$-chainable if given any two points $a,b \in X$, $\exists$ a finite set $\{ x_0,x_1,...,x_n\}$ of points in X with $x_0 = a$, $x_n=b$ and $d(x_{n-1},x_n)&lt;\epsilon$, $\forall$ n      Clopen Definition      A set is clopen $iff$ its boundary is empty      Connected Metric Definition      Let $(X,d)$ be a metric space. It is connected $iff$ it has no proper subsets which are clopen      The following are equivalent:         $X$ is connected   The only subsets of $X$ that are clopen are $\emptyset$ and $X$   $\nexists$ non-empty, disjoint, open sets $A$ and $B$ such that $X=A\bigcup B$   $\nexists$ non-empty, disjoint, closed sets $A$ and $B$ such that $X=A\bigcup B$         Theorem      Let $(X,d)$ be a metric space, and let $S$ be any subset of $X$. Then $S$ is closed $iff$ $S^c$ is open.     So how would someone show this exactly?  Let the set $A$ be the set of all elements in $(X,d)$ that can be reached from $a\in X$ in a finite number of steps with length less than $\epsilon$.  Does this mean that there should be no isolated points? (an isolated point would be at distance infinity from any other point, or distance zero from itself, since $\epsilon &gt;0$ we don't want this?)  Knowing that $X$ is connected $\implies$the only subsets of X that are clopen are $\emptyset$ and $X$  Also, by construction of A;   A is the set of all $\epsilon$-chains between any element and $a$  And, so $A^c = \emptyset$ if $A$ was $\epsilon$-chainable (because A has to have a path from all elements to a, for this to be true, the complement wouldn't have anything in it)  Leaving only $A$ as the remaining clopen set  Does this make any sense? Or should an alternative be used, and how to formalize it.  Thanks. My family PC has Windows Vista and lately it has became unusable, having strange errors and taking hours to do anything at all, so I'm installing Ubuntu 11.10 alongside it.  I went into GParted to resize the Vista partition but found that it had an exclamation point in a red circle next to it:   I tried to resize it but the Resize/Move button was grayed out.  I thought that this might have to do with the exclamation point so I looked at the information and found a load of errors:   What does the exclamation point mean?  How can I resize my partition?  UPDATE 1  I booted into Safe Mode with Command Prompt in Vista as suggested by eug and ranchkdsk c: /F /R (/F Fixed errors on the disk, /R Locates bad sectors and recovers readable information) and got:  Chkdsk cannot run because the volume is in use by another process.  Would you like to schedule this volume to be checked the next time the system restarts? (Y/)   When I reboot it doesn't run chkdsk, I'm selecting Safe Mode with Command Prompt again because I can't boot normally.  How can I stop it being used?  UPDATE 2  I tried doing what Luis suggested.  Here is the terminal output:  ubuntu@ubuntu:~$ sudo ntfsfix /dev/sda3 Mounting volume... OK Processing of $MFT and $MFTMirr completed successfully. NTFS volume version is 3.1. NTFS partition /dev/sda3 was processed successfully. ubuntu@ubuntu:~$ sudo apt-get install ntfsprogs Reading package lists... Done Building dependency tree        Reading state information... Done Note, selecting 'ntfs-3g' instead of 'ntfsprogs' ntfs-3g is already the newest version. 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   I still cannot resize the partition.  Ntfsfix doesn't look like it did anything and ntfsprogs is already installed.  I can access the hard drive and do backups with the Ubuntu Live CD which I'm using now.  Any other suggestions?  UPDATE 3  I attempted to use the ntfsresize command but I got an error:  ERROR: Volume is scheduled for check. Run chkdsk /f and please try again, or see option -f.   This is because I ran chkdsk in Vista Safe Mode with Command Prompt and it couldn't do it because it was in use but offered to do it at the next reboot.  I reboot and I get to the menu to the menu to choose whether to Start Windows Normally, Safe Mode, etc instead of checking the disk.  Is there any way I can unschedule?  EDIT  I just found out that I could use the -f option to force it.  It failed and told me to run chkdsk /f in Windows and then reboot twice.  But the chkdsk program is in the partition I am trying to check so it says it is in use. I'm using Ubuntu 12.04 &amp; everything about it is great except that it just won't resume after suspend. I've tried the suggestions listed in this thread  but none worked. I'm using Lenovo Y510P. I'm new to Ubuntu, or unix for that matter, so please let me know if there's anymore  information that I should be posting. Thanks.  update  I tried the suggestion by Dima on this post . The machine wakes up from hibernation but immediately the screen gives a screen like this     Wondering if this is an issue with the graphics card or something. Suppose 27 cubes are stacked together, suspended in the air, to form a larger cube.  The cube is then painted on all the exposed surfaces and dried.  The smaller cubes are then randomly permuted in both spatial position and spatial orientation to form another large cube.  What is the probability that new larger cube is identical to the original?  This is not homework, it was passed on by a friend who found it somewhere on the internet, and they do not remember where. I have 2 storage devices; classical slow HDD (750GB, /dev/sda) and faster SSD (128GB, /dev/sdb). Currently I have installed Ubuntu &amp; Mint on same btrfs partition on SSD (/dev/sdb5). My btrfs pool consists of /dev/sdb5.  What I want to achieve is data replication on HDD while keeping SSD performance: Something like this:  For read case it would be ideal for procedure to go like this:   read from SSD check checksum if it verifies.. awesome, give me the data if not, fetch data from HDD and perform error correction through duplicate data   I'd manually run (some tool I'm not sure which one... btrfs check --repair perhaps?) every month or so to check HDD checksums and correct them via SSD data against bitrot.  For write case:   write to SSD sync to HDD when write requirements are low, thus not slowing down the system.   Is this possible and how would I do it?  Bottom line is, I like btrfs and would like it to duplicate data across HDD &amp; SSD drive automatically while keeping SSD excellent performance.   Using SSD as write cache is not an option since it's missing data duplication and security. How do I sort a two-dimensional (rectangular) array in C#? I have a two-dimensional array (of Strings) which make up my data table (of rows and columns).  I want to sort this array by any column.  I tried to find an algorithm for doing this in C#, but have not been successful.  Any help is appreciated. I was just wondering whether the following statement is correct.  Let R be a ring and M a noetherian R module. Then M is finitely generated. Book about mages who can harvest magical energy from the environment I have a vague recollection of a book I devoured while in college; it was from the late 80's or early 90's. I remember that there were two 'classes' of mages, the ones who could harvest magical energy from the environment and supply that power to the other 'class' of mages.  The main character learned that he could reverse the flow and sap the other mage of his/her power. I also seem to remember that there was a lot of technological warfare and travel to the planets moon(s)? distribution with point support How to zero out a drive? I'm currently running Ubuntu 12.04 and want to completely format my laptop so I can install Windows 7 (replace Ubuntu).   When I put in my bootable USB with the OS it just shows a black screen with a white blinking cursor on the top left corner. I wait for hours (to be specific 5 whole hours) waiting for something to happen but I get nothing, so I pull out the USB and my Ubuntu 12.04 loads up.  Repeated this several times with putting different boot priority options on top-est that relate to USB but the results are same. I go and visit some sites on the net like this  that say I have to zero out my hard drive.   My question is how?  Note: Erasing out all my data is no problem cause I have nothing important to backup.  If I have to lose my primary OS (Ubuntu 12.04) in the process I am ready to as my aim is just to install Windows 7 successfully. Please don't answer that there is something wrong with my USB or my USB reader/port/hardware or the content inside the USB cause they all works fine on my brothers PC as it boots up flawlessly. How was this character killed without Avada Kedavra? Making 3 points stick on a plane / flag with wind I have a flag I want to waft in the wind. I imported the shape as an SVG from Adobe Illustrator.  I converted the mesh to a curve.  It wouldn't let me make some subdivisons but it still seems to work with the cloth property.    When I press play, you can see the structure of the flag stops.  How can I make those last 3 points intact? Also the fill colour seems to have disappeared, do you know why and how I can bring it back?    Thanks  Steve  File here: