One of the big reasons why find makes things awesome  if I do this:  find -path *ncf   or this:  find -path ncf*   I get no results, but if I do this:  find -path *ncf.js   I get a matching file. Why is that? Is it a peculiarity of find, or something more grandiose? Does anyone have the home address of the guy who wrote find?
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?
In Harry Potter and the Chamber of Secrets it is revealed that      Ginny is being possessed by Tom Riddle and is the one opening the Chamber of Secrets.   The book seems relatively without holes in this regard.  However in the movie when Harry discovers Justin Flinch-Fletchley we see moments prior to this      Ginny is studying in a room full of people.   This implies that the person opening the chamber of secrets couldn't have been in the chamber when the second attack occurs.  Is this just a goof in the movie or is there an alternate explanation for this?  Is the Basilisk acting on its own in the movie? How do I set environment variables from Java?  I see that I can do this for subprocesses using . I have several subprocesses to start, though, so I'd rather modify the current process's environment and let the subprocesses inherit it.  There's a System.getenv(String) for getting a single environment variable. I can also get a Map of the complete set of environment variables with System.getenv(). But, calling put() on that Map throws an UnsupportedOperationException -- apparently they mean for the environment to be read only. And, there's no System.setenv().  So, is there any way to set environment variables in the currently running process?  If so, how?  If not, what's the rationale?  (Is it because this is Java and therefore I shouldn't be doing evil nonportable obsolete things like touching my environment?)  And if not, any good suggestions for managing the environment variable changes that I'm going to need to be feeding to several subprocesses? Is sum of two orthogonal matrices singular? I am trying to solve following problem.      Let $A, B \in \mathbb{R}^{n\times n}$ be an orthogonal matrices and $\det(A) = -\det(B)$. How can it be proven that $A+B$ is singular?   I could start with implication:  $\det(A)=-\det(B) \Rightarrow B$ is created from $A$ by swapping two lines or columns.   But I am not sure if this implication is correct. How can I fix a 404 Error when using a PPA or updating my package lists? PPA seems to be constantly offline. Whenever I use sudo apt-get update, this error is shown:  W: Failed to fetch http://ppa.launchpad.net/ 404  Not Found   How do I fix these errors? Selenium Webdriver: No such element exception even though element gets available after waiting for some time Attempting to compile kernel yields a certification error I'm currently attempting to follow  guide in order to install the 4.5.7 kernel with Grsecurity on my Kali Linux desktop.   I am following that list of instructions verbatim, except for the fact that I'm trying to use Grsecurity's test patch for the 4.5.7 kernel and I'm running Kali Linux instead of straight Debian.  Every time I attempt to compile the kernel, however, I get this error following the line "CC certs/system_keyring.o":    CC      certs/system_keyring.o make[2]: *** No rule to make target 'debian/certs/benh@debian.org.cert.pem', needed by 'certs/x509_certificate_list'.  Stop. Makefile:951: recipe for target 'certs' failed make[1]: *** [certs] Error 2 make[1]: Leaving directory '/home/jc/Downloads/linux-4.5.7' debian/ruleset/targets/common.mk:295: recipe for target 'debian/stamp/build/kernel' failed make: *** [debian/stamp/build/kernel] Error 2   I get this error, as I found out, for any kernel even if I apply no patches or modifications, so it has something to do with the tools I'm using to compile the kernel (apparently a system keychain of some sort). Can someone out there tell me how to fix my OS and compile my kernel?   P.S. Here is the output of cat /proc/version:  Linux version 4.6.0-kali1-amd64 (devel@kali.org) (gcc version 5.4.0 20160609 (Debian 5.4.0-4) ) #1 SMP Debian 4.6.2-2kali2 (2016-06-28) Showing a set is nowhere dense in $C([0,1])$ I've been doing ASP.NET development for a little while now, and I've used both the GridView and the DataGrid controls before for various things, but I never could find a really good reason to use one or the other. I'd like to know:  What is the difference between these 2 ASP.NET controls? What are the advantages or disadvantages of both? Is one any faster? Newer? Easier to maintain?  The intellisense summary for the controls doesn't seem to describe any difference between the two. They both can view, edit, and sort data and automatically generate columns at runtime.  Edit: Visual Studio 2008 no longer lists DataGrid as an available control in the toolbox. It is still available (for legacy support I assume) if you type it in by hand though. This is my first time using a LaTeX editor.   I installed  allowing it to use the default directory on the C drive.  Software Versions   Windows: 7 Ultimate 64-bit  Texmaker 3.4.1 for Windows   I then did A Local guide for using Texmaker (There use to be a link to this but it is now dead)  Basically create a simple Hello World document and save it.  When I went to process the file   Tools -&gt; PDFLaTeX     I received    Error: Log file not found!   What I checked  I checked the configuration (Options -> configure Texmaker) and found no option for log files.  I checked for a log file under the C:\Program Files (x86)\Texmaker and found none.  I checked for a log path in the Windows registry using regedit and found none.  I checked the Texmaker issues and found  but it does not help.  Any ideas?  After reading answer  I installed MiKTeX as an administrator (didn't work as user) and chose the default options. After MiKTeX installed I was able to create a PDF file using Texmaker.   Also, correctly setting the PDF viewer options   Options -&gt; Configure Texmaker -&gt; Commands -&gt; PDF Viewer Built-in Viewer and Embed   I was able to preview the pdf in Texmaker   View -&gt; PDF Viewer   What I learned   is a LaTeX editor which generates a file containing LaTeX markup.     is a program that converts the LaTeX markup into an output format such as PDF. jquery stop child triggering parent event Problems with fonts I'm an average user of LaTeX, but not proficiency. I'm trying to learn from book templates I've found on the web, but I get this error message:  Trying to make PK font ccicons at 1493 DPI... Running miktex-makemf.exe... miktex-makemf: The ccicons source file could not be found. Running ttf2pk.exe... miktex-makemf: PK font ccicons could not be created.  LaTeX Font Warning: Some font shapes were not available, defaults substituted.  !pdfTeX error: pdflatex.exe (file ccicons): Font ccicons at 1493 not found  ==&gt; Fatal error occurred, no output PDF file produced!   I'm using MiKTeX (over Windows 7), and according to the MiKTeX package manager the "ccicons" package is already installed.  Could you please help me solve this problem? I have a set of coordinate points. The points are distributed in such a way that some points are clustered around a specific area. There is an option to find out mean coordinates(s) of the whole point layer. I would like to know if there is any way in QGIS to find out the mean coordinates of the points from a specific area from a point layer. How to show that when the linear transformation $\Phi =\psi \circ \phi : E \rightarrow G$ is injective, then $\phi$ is also injective? How to show that when the linear transformation $\Phi =\psi \circ \phi : E \rightarrow G$  (where $\phi : E \rightarrow F$ and $\psi : F \rightarrow G$) is (1) injective, then $\phi$ is injective and when (2) $\Phi$ is surjective, then $\psi$ is also surjective ?  I've tried to prove it by the definition of injection and surjection, but I'm not convinced myself by it.  For example, in the first case :  If $\Phi$ is injective, $\forall g \in G$, we have $0$ or $1$ $e \in E$ such as $\Phi(e)=g$.  $\Rightarrow \Phi(e) = \psi(\phi(e)) = \psi(f) =g$.   So $\forall f \in F$, we also have $0$ or $1$ $e \in E$ such as $\phi(e)=f \in F$.   $\Rightarrow \phi$ is injective.  Is this right or did I prove nothing at all ? I think it is easier to convince myself/ to understand with surjectivity but still.. Separate labels in cases In Cocoa KVO, why doesn't a change on a NSMutableArray proxy notify observers? Prove $\lim_{x \rightarrow 0} \frac {\sin(x)}{x} = 1$ with the epsilon-delta definition of limit. I got this problem from my teacher as a optional challenge. I am open about this being a given problem, however it is not homework. The problem is stated as follows. Assume we have an infinite tetration as follows $$x^{x^{x^{.^{.^.}}}} \, = \, a$$ With a given $a$ find $x$. The next part of the problem was to discuss the convergence radius of a. If a is too big or too small the tetration does not converge. Below is my humble stab at the problem.  My friend said you would have to treat the tetration as a infinite series, and therefore could not perform algebraic manipulations on it before it is know whether it converges or diverges. However my attempt is to first do some algebraic steps, then discuss the convergence radius. I) Initial discussion At the start it is obvious that the tetration converges when $a=1$ (just set $x=1$) Now after some computer hardwork it seems that the tetration fails to converge when a is roughly larger than 3. II) Algebraic manipulation $$ x^{x^{x^{.^{.^.}}}} \, = \, a$$ This is the same as $$ x^a \, = \, a$$ $$ \log_a(x^a) \, = \, \log_a(a)$$ $$ \log_a(x) \, = \, \frac{1}{a}$$ $$ x \, = \, a^{\frac{1}{a}}$$ Now, if we let $a=2$ then $x = \sqrt{2}$. After some more computational work, this seems to be correct, which makes me believe this formula is correct. III) Discsussion about convergence By looking at the derivative of $ \displaystyle \large a^{\frac{1}{a}} $ we see that the maxima occurs when $a=e$, which also seems to correspond to the inital computational work. Now I think, that the minima of $\displaystyle \large a^{1/a}$ is zero by looking at its graph, studying its derivative and the endpoints. So that my &quot;guess&quot; or work shows that it converges when $$ a \in [0 \, , \,  1/e] $$ VI) My questions Can my algebraic manipulations be justified? They seem rather sketchy taking the a`th logarithm and so on . (Although they seem to &quot;magically&quot; give out the right answer) By looking at Wikipedia it seems that the tetration converge when $$ a \in \left[ 1/e \, , \, e \right] $$ This is almost what I have, why is my lower bound wrong? How can  I find the correct lower bound? Is “I medalled in volleyball” a grammatically correct sentence? According to OED, medal is a verb and a noun. I haven't seen any usage of the word as a verb, but I am assuming the above sentence is correct. Can ovulation and menstruation occur simultaneously? Is that possible that ovulation happens in the time of actual menstrual haemorrhage in human females - let say in a case that woman has 21 day cycle and her menstrual period is 7 days?   If yes, does it means that in this particular case the woman has lower chances to conceive? According to the documentation, the  method uses a round-to-even algorithm which is not common for most applications. So I always end up writing a custom function to do the more natural round-half-up algorithm:  public static decimal RoundHalfUp(this decimal d, int decimals) {     if (decimals &lt; 0)     {         throw new ArgumentException("The decimals must be non-negative",              "decimals");     }      decimal multiplier = (decimal)Math.Pow(10, decimals);     decimal number = d * multiplier;      if (decimal.Truncate(number) &lt; number)     {         number += 0.5m;     }     return decimal.Round(number) / multiplier; }   Does anybody know the reason behind this framework design decision?  Is there any built-in implementation of the round-half-up algorithm into the framework? Or maybe some unmanaged Windows API?  It could be misleading for beginners that simply write decimal.Round(2.5m, 0) expecting 3 as a result but getting 2 instead.