As all we know, we can search a file or directory in the linux by:  find / -name theName   But there shows all the files and directories and permission denied, like this bellow:  ... find: /Library/Caches/com.apple.iconservices.store: Permission denied /Library/Python/2.7/site-packages/Django-1.11.2-py2.7.egg/django /Library/Python/2.7/site-packages/Django-1.11.2-py2.7.egg/django/forms/jinja2/django /Library/Python/2.7/site-packages/Django-1.11.2-py2.7.egg/django/forms/templates/django find: /Library/SystemMigration/History/Migration-389D835B-414A-4D8D-A683-7407624E87E8/QuarantineRoot/System/Library/DirectoryServices/DefaultLocalDB/Default: Permission denied find: /private/etc/cups/certs: Permission denied find: /private/var/agentx: Permission denied ...   If I just want to shows the directories find by the command, how to do with it?
Code   find / -name netcdf   Output  find: `/root/.dbus': Permission denied find: `/root/.gconf': Permission denied find: `/root/.gconfd': Permission denied find: `/root/.gnome': Permission denied find: `/root/.gnome2': Permission denied find: `/root/.gnome2_private': Permission denied
What system monitoring tools are available? I am looking for system monitoring tools which are GUI and CLI or web-based which include basic functions such as:   CPU Usage Ram Usage Swap Usage Disk Usage ( Space / I/O ) Heat Monitoring   I know there are many tools I can use, but I am looking for a single tool that has these basic functions. Toggle wireframe mode with hotkey I've just gotten started with Nielsen and Chuang's text, and I'm a little stuck. They mention that theoretically, it would be possible to store an infinite amount of information in the state of a single qubit. I'm not sure I completely comprehend this.    Here's how I rationalized it: You take all the information you want to store, put it in binary form, and make it the real component of $\alpha $ or $\beta$ (the coefficients of the computational basis states).   Now I'm not sure if I've understood it right, but since it's still fuzzy in my head it would be great to get some kind of ELI5 explanation or possibly a more detailed picture of how this would, even theoretically, be possible.    Apologies if the question doesn't meet standards. I'm new to the forum and would be open to feedback regarding asking questions or answering them. How does the Green-Flame Blade cantrip interact with the tiefling feat Flames of Phlegethos? I created a view to show Users. These users can create nodes of the "Questions" content type.  The view has to render a table to show how many (the total number) Questions the user has created. Something like:  User +++ Questions created John --- 10 Ted  --- 4 Alf  --- 19 I have some long URLs which doesn't contain special "line break characters" like "-" or "/". How can I automatically break these URLs?  \documentclass{scrreprt}  \usepackage[ngerman]{babel}                     \usepackage[latin1]{inputenc}                 \usepackage[T1]{fontenc} \usepackage[backend=biber]{biblatex} \usepackage{url} \usepackage{dingbat}  % for \carriagereturn symbol \makeatletter \g@addto@macro{\UrlBreaks}{\UrlOrds} \g@addto@macro{\UrlBreaks}{% \do\/\do\d% } \makeatother  \begin{filecontents}{bachelorarbeit_lit.bib} @ONLINE{java96,     author = {{Joe Black}},     title = {Foobar 1.0},     year = {1996},     month = {1},     url = {http://www.aaa.bb.cccc.dh/uploads/dddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd.pdf},     urldate = {2011-03-02},     sortname = {Sun},     keywords = {www} } \end{filecontents}  \bibliography{bachelorarbeit_lit}  \begin{document} Test \cite{java96} \printbibliography \end{document}   edit  I don't know why but it still doesn't work. Is there an option to automatically break long URLs. I don't care where the break is but it should be done automatically. Even if I manually specify the "breaking character" it doesn't work (as the example shows). Comma after introductory words, phrases, clauses: unacceptable, obligatory or optional? I am no native speaker and always confused about the comma in introductory phrases, in particular in prepositional phrases. Is there any hard rule when a comma must be set? If I make a google search for certain phrases, I often find both variants. Typical examples where I am not sure whether a comma must be set are:        First[ly][,] I must phone mother   In this case[,] we must...   For simple problems[,] the algorithm...   From Lemma 1.2[,] we obtain...   For a typical user[,] the algorithm...   In our theory[,] we...   A dark line on the horizon[,] the mountain range we were headed for seemed somehow not as threatening as when we had started out on the trip.   Avidly reading her novel[,] Jane did not notice that her stop was approaching.   To be sure[,] it is not easy to see a solution.   When you get to Rome[,] give me a ring. Asking the position of a person in a sequence The muffins were rock hard, what did I do wrong? Evaluate $\lim_{x\rightarrow 0} \frac{\sin (6x)}{\sin(2x)}$ without L'Hopital Properties of the greatest common divisor: $\gcd(a, b) = \gcd(a, b-a)$ and $\gcd(a, b) = \gcd(a, b \text{ mod } a)$ Prove that (a) gcd(a, b) = gcd (a, b – a) (b) Let r be the remainder if we divide b by a. Then gcd(a, b) = gcd(a, r).  I solved part a like: Assume a=pcommonpa b=pcommonpb gcd (a,b) = pcommon b-a = pcommon*(pb-pa)  So: gcd(a, b-a) = common again But I need help for part b guys I can solve it but I need a mathematical expression. How do I delete multiple rows in Entity Framework (without foreach) I have a Windows XP box (NTFS filesystem) on which I found a file named NUL. I have not been able to remove this file in any usual way. The file appears to be owned by Administrator in the SYSTEM group, unlike any other file in the same directory (the other files are owned by my user id).  How do I get rid of this file? Where did it come from? If $(X, \mathcal{T})$ has a countable subbasis, then it has a countable basis Markdown source:  `http://google.com`  - `http://google.com`     - `http://google.com`   Rendered result:  http://google.com   http://google.com   http://google.com    Note that the third code span is a link. Adding a newline before the list item makes the link disappear. How to succeed with making omelette How are release codenames chosen? I'm reading Baby Rudin and exercise 28 of chapter 2 reads "Prove that every closed set in a separable metric space is the union of a (possibly empty) perfect set and a set which is at most countable." I don't understand why the set must be closed in order for this to be true.  My proof is as follows, and I don't make any reference to the closedness of the set:  Let $E$ be a set in a separable metric space.  Let $B$ be a countable base of that metric space.  Let $P$ be the set of condensation points of $E$.  I claim that $P$ is perfect and $E-P$ is at most countable.  If $p$ is a limit point of $P$, then every neighborhood of $p$ includes at least one point $q$ of P.  For a neighborhood $N_{p}$ of $p$, choose a neighborhood $N_{q} \subset N_{p}$ of $q$.  Since $q$ is a condensation point of $E$, uncountably many points of $E$ are in $N_{q}$, and thus in $N_{p}$.  So $p\in P$ and $P$ is closed.  If $p \in P$, then $p$ is a condensation point of $E$, so every neighborhood $N_{p}$ of $p$ must include uncountably many points of $E$.  If $p$ is not a limit point of $P$, then there exists a neighborhood $N_{p}$ of $p$ such that $N_p$ includes no condensation points of $E$ except for $p$.  This means that every point $q\in N_{p}-\{p\}$ must have a neighborhood $N_{q}$ that does not have uncountably many points of $E$.  For each $b_{k}\in B \cap \mathscr{P}(N_{p})$, choose such a neighborhood $N_{q_{k}} \supset b_{k}$ of some point $q\in N_{p}-\{p\}$.  Now $\{N_{q_{k}}\}$ covers $N_{p}$, and $\bigcup_{k=1}^{\infty}N_{q_{k}}\supset N_{p}$ has at most countably many points of $E$, for it is a union of countably many sets that have at most countably many points of $E$.  This contradicts the assumption that $p\in P$.  So $P$ is perfect.  Let $S=E-P$. There are no condensation points in $S$.  So there exists an open cover $\{N_s\}$, where each $N_s$ is a neighborhood of $s \in S$ with at most countably many elements of $S$. For each $b_{k}\in B \cap \mathscr{P}(S)$, choose such a neighborhood $N_{s_{k}} \supset b_{k}$ of some point $s\in S$.  Then we have a countable subcover $\{N_{p_{k}}\}$ of $S$. As $N_{p_{k}} \cap S$ is at most countable for all $k$, $S$ must be at most countable.  So what am I doing wrong?  Or is Rudin's assumption of closedness extraneous? How to get Lookup ID from Search API with REST Linux - Running The Same Command on Many Machines at Once I have about a dozen Linux boxes that I occasionally need to run the same command(s) on. Is there an easier way (or automated way) to do this asides from logging on to each machine and running the command, one at a time? It's not the same commands all the time and it's not at a preset time so it's not something ideal for tools like cron.