How does VBA treat 'or' statements
Does the VBA "And" operator evaluate the second argument when the first is false?
As in  I'm trying to use apa6e and biblatex-apa together and having problems.  Before I arrived at these problems, over the course of many hours of much reading, I first managed to get BibTeX working as expected in a simple input file (by modifying sample2e.tex). Then I managed to get apa6e working as expected based on the author's example in apa6e.pdf (which uses apacite). But when I try to get apa6e working with biblatex-apa, I end up with problems.  Here's my input file:  \documentclass{apa6e}  \usepackage[american]{babel} \usepackage{csquotes}  % biblatex \usepackage[style=apa]{biblatex} \bibliography{biblatex-apa-test-references}  \title{An Example Document} \shorttitle{Psychology: the end} \author{Silly Name}  \authornote{\dots} \abstract{\dots}  \begin{document}  \maketitle  This is an example input\cite{7.01:2} file.  Comparing it with the output it generates can show you\cite{7.01:3a} how to produce a simple document of your own.  \printbibliography  \end{document}   Attempting to typeset this in TeXShop by running LaTeX, then BiBTeX (which based on console messages, does seem to correctly call biblatex rather than BiBTeX), then LaTeX again, I get the following error message which I am having great difficulty (no doubt due to my lack of experience with TeX and co.) decoding.  (./test6.aux) (/usr/local/texlive/2011/texmf-dist/tex/latex/psnfss/ot1ptm.fd) *geometry* driver: auto-detecting *geometry* detected driver: pdftex (./test6.bbl) Underfull \hbox (badness 10000) in paragraph at lines 18--18  []\OT1/ptm/m/n/12 An Ex-am-ple Doc-u-ment   Underfull \hbox (badness 10000) in paragraph at lines 18--18  []\OT1/ptm/m/n/12 Silly Name   Underfull \hbox (badness 10000) in paragraph at lines 18--18  []\OT1/ptm/m/n/12 Author Note  [1{/usr/local/texlive/2011/texmf-var/fonts/map/pdftex/updmap/pdftex.map}] Underfull \hbox (badness 10000) in paragraph at lines 18--18  []\OT1/ptm/m/n/12 Abstract  [2] Underfull \hbox (badness 10000) in paragraph at lines 18--18  []\OT1/ptm/m/n/12 An Ex-am-ple Doc-u-ment   Underfull \hbox (badness 10000) in paragraph at lines 25--25  []\OT1/ptm/b/n/12 References  ./test6.tex:25: Undefined control sequence. &lt;argument&gt; \mkbibdateapalongextra  (/usr/local/texlive/2011/texmf-dist/tex/latex/psnfss/ot1pcr.fd) (/usr/local/texlive/2011/texmf-dist/tex/latex/psnfss/ot1ztmcm.fd) (/usr/local/texlive/2011/texmf-dist/tex/latex/psnfss/omlztmcm.fd) (/usr/local/texlive/2011/texmf-dist/tex/latex/psnfss/omsztmcm.fd) (/usr/local/texlive/2011/texmf-dist/tex/latex/psnfss/omxztmcm.fd) Overfull \hbox (8.03372pt too wide) in paragraph at lines 25--25 [][]  \OT1/ptm/m/n/12 Gilbert, D. G., Mc-Cler-non, J. F., Ra-bi-novich, N. E.,  Sugai, C., Plath, L. C., As-gaard, G., ... Botros,  ./test6.tex:25: Undefined control sequence. &lt;argument&gt; \mkbibdateapalongextra                                    {year}{month}{day}\iffieldundef {endyear}{... l.25   I tried many different sources in several different *.bib files before eventually trying the .bib database shown above and included with biblatex-apa. All trials gave a similar error.  Can someone help? I'm impressed that the poster above was able to do anything with apa6e and biblatex-apa, and if I only had her problem of having the reference page title show up in bold, I'd be really happy.  If you need to know, my tools are from a fresh installation of MacTeX that I immediately updated using the TeX Live Utility. I've checked my versions for apa6e (v0.3) and biblatex-apa (v4.2), and I think these are current. Which metric to use to evaluate highly imbalance classification model performance I have to do classification model to predict the possibilities of person getting cancer based on certain attributes. The data is highly imbalanced. As per client requirement I have to report model performance based on any one of these 4 metrics AUC_Weighted normalized root mean square log loss Accuracy  Can you suggest me which one should I use? hard disks spin up by processes / applications that simply get a list of disks? How to prevent? I have a 24/7 always-on Debian Jessie based headless home server that has a large 1TB SSD for the OS and all of my frequently accessed files. This same system has 4 larger hard disk drives in a SnapRAID array. These are mainly for archiving infrequently accessed Blu-rays and want those drives to remain spun down in standby unless I actually read or write to them. They are all formatted as ext4 and mounted with noatime and nodiratime enabled.  So even though no process or program should be regularly accessing those drives in any direct way, the hard drives constantly get spun up from standby. It seems to be related to graphical programs that provide a gui file browser, even something like Chromium. If I don't even browse into those drives, I'm thinking that these processes by simply getting a list of available drives spins up the hard disks. Much like blkid does. The problem is, it's hard to determine the root cause of this since none of these processes are actually reading or writing the filesystem on those drives, so no files are actually changing or being touched. Is there some sort of cache that I can populate or a buffer to prevent these programs from spinning up the hard drive simply by getting a list of available disks? This is honestly driving me insane, since I can't find a reliably way to keep these disks spun-down even though there is no direct access of the filesystem.  UPDATE: Thanks to Stephen's answer, I was able to trace the disk activity to gvfs and udisks. It's a real shame that these processes insist on waking up disks in standby when they aren't actually being accessed to do any real I/O with the filesystem. So far I just uninstalled them, knowing that it will remove some functionality from PCManFM and the like. Why is ridge regression called "ridge", why is it needed, and what happens when $\lambda$ goes to infinity? Do I need to have antivirus software installed? I thought that there was no need to scan for viruses either in Ubuntu or any Linux distros until I found virus scanner packages clamtk and klamav in Ubuntu software center yesterday.  This leads to the following questions:   How do viruses differ between Linux and Windows? How do the strategies for protection differ between Linux and Windows? Should a virus scanner package be installed on my system? If so, which would be a better option? Let he who believes in this prophet speak now what he knows.       Let him who believes in this prophet speak now what he knows. Powershell Rename Multiple Files with LastWriteTime Prefix I am trying to put together a Powershell script that will:  -Search recursively from a root directory -Exclude files with existing "yyyyMMdd " file name prefix -Rename the files not excluded above with ""yyyyMMdd " file name prefix based on their specific LastWriteTime  Note: ideally, this script should include all file type extensions  I have tried myself, but it would seem to be above my head, as my attempts are not going well.  Thanks, in advance.    #StampMe.ps1 param( [string] $fileName)  # Check the file exists if (-not(Test-Path $fileName)) {break}  # Display the original name "Original filename: $fileName"  $fileObj = get-item $fileName  # Get the date $DateStamp = get-date -uformat "%Y-%m-%d@%H-%M-%S"  $extOnly = $fileObj.extension  if ($extOnly.length -eq 0) {    $nameOnly = $fileObj.Name    rename-item "$fileObj" "$nameOnly-$DateStamp"    } else {    $nameOnly = $fileObj.Name.Replace( $fileObj.Extension,'')    rename-item "$fileName" "$nameOnly-$DateStamp$extOnly"    }  # Display the new name "New filename: $nameOnly-$DateStamp$extOnly"   I am hoping to change the line:  $DateStamp = get-date -uformat "%Y-%m-%d@%H-%M-%S"   To be LastWriteTime instead of get-date, but I have no idea how to make this happen.  This code (from another Super User question):  Get-ChildItem "Test.pdf" | Rename-Item -newname {$_.LastWriteTime.toString("yyyyMMdd") + " Test.pdf"}   ...successfully renames a single file, but I can't seem to integrate this into the larger script.    With regards to running the above recursively, I have tried this (also from ):  foreach ($file in get-ChildItem *.* -recurse) { ./StampMe.ps1 $file.name }   Which succeeds to apply the PS script to files in the root directory, but fails to apply to any files in the sub-folder tree that propagates from the root directory. Alternating binomial sum with intervals of two Fix integer $n\geq 1$. Consider the number $$1-\binom{n}{2}+\binom{n}{4}-\binom{n}{6}+\cdots$$where the sum continues as long as the lower number in the binomial is $\leq n$. Is there a way to simplify this sum?   The first few values are $1, 0, -2, -4, -4$. Can virtual particles be thought of as off-shell Fourier components of a field? I just found  blog post, which gives an interpretation of virtual particles I haven't seen before.  Consider a 1D system of springs and masses, where the springs are slightly nonlinear. A "real particle" is a regular $\cos(kx-\omega t)$ wavepacket moving through the line, where $\omega$ satisfies the dispersion relation $\omega = \omega(k)$. When two real particles collide, the region where they collide temporarily looks really weird, as they interact nonlinearly, pulling and pushing on each other.  Formally, we can write this weird region as the sum of a bunch of $\cos(kx-\omega t)$ waves, but there's no guarantee they'll have the right dispersion relation. Thus, each term in the resulting expansion is a off-shell "virtual particle". If you add up all the virtual particles, you get the actual intermediate field state, which is just a weird ripple in the field where the two particles are interacting.  As another example, consider the statement "a static EM field is made of virtual particles". Under this interpretation, what that really means is, "a static field (e.g. $1/r^2$) is not equal to $\cos(kx-\omega t)$, but may be expanded in terms of such sinusoids", which is much less mysterious sounding. In fact, this is exactly what we do when we consider scattering off a potential in normal QM, e.g. in the Born approximation.  The above gives some intuition for what a 'virtual particle' means in classical field theory. They are the Fourier components of the field with $(\omega, k)$ not satisfying the dispersion relation, and they are useful in classical perturbation theory. However, they are not propagating degrees of freedom, so they only appear during interactions.   The picture above is entirely classical. Does this picture generalize to quantum field theory, giving a physical intuition for virtual particles there? I know this sounds like a stupid question, but I just wanted to confirm if they are the same thing. In new canon, anti-gravity is never mentioned. I have recently found an argument against disabling a root user login in Linux at   I assume that, if everybody uses a public key authentication, there's no risk at losing the root password.  Is it always better to disable the root login via ssh? How is it possible that quantum phenomenons (e.g. superposition) are possible when all quantum particles are being constantly observed? I don't understand how quantum mechanics (and therefore also quantum computers) can work  given that while we work with quantum states, particles that this quantum state consist of cannot be observed, which is the most fundamental requirement.  If I am not mistaken, by "observed" we mean interaction with any other particle (photon, gluon, electron or whatever else). So my very important questions:   Aren't the particles this quantum state consists of interacting with each other? Why doesn't that cause the state to collapse? Aren't all particles in the universe interacting with Higgs field and gravitons etc? Why doesn't that cause every quantum state to collapse?   I feel there is something very fundamental in quantum mechanics that I am not aware of, hence I would be very pleased to have these questions answered. How can I set my system to suspend when inactive to a longer amount of time I run Mythtv on some Ubuntu 11.10 based machines.  In the power settings, I can choose from a list of time periods from 5 minutes up to 1 hour for the the machine to suspend when inactive.  I would like to set the suspend to occur at a longer interval, like 2 hours or 4.  Previously with Gnome, I would think that I could go into the gconf editor and find the key there, I am not sure with Unity where to override a setting like this.  Any suggestions? Is a switches voltage and current rating a hard limit? Import curly brackets from MathDesign (Utopia) I am using Fourier maths fonts with Utopia text (\usepackage{fourier}) for a book project, but I'm not satisfied with the curly brackets \{ and \}. They are too slim, and barely distinguishable from other brackets in font size 10. Utopia with MathDesign (\usepackage[utopia]{mathdesign}) seems to have better-looking curly brackets.  Is there a way of importing just the curly brackets from MathDesign to my document, sticking to Fourier otherwise. And are the curly brackets defined by the maths fonts even if they are used outside math mode, since with MathDesign you get better-looking brackets in normal text, too.    Following egreg's answer I added the suggested lines, but the sizes of the bigger brackets are incorrect. When I load type $\{\bigl\{\Bigl\{\biggl\{\Biggl\{$, this is what I get:    After a bit of research, I've found that the cause seems to be the amsmath package. I'm relying on amsmath quite heavily, so it would be nice to find a fix. Unfortunately, I have almost no experience in working with fonts in LaTeX myself.  Below is a working example:  \documentclass{article}  \usepackage{amsmath} \usepackage{fourier}  \DeclareSymbolFont{mdsymbols}     {OMS}{mdput}{m}{n} \DeclareSymbolFont{mdlargesymbols}{OMX}{mdput}{m}{n} \DeclareMathDelimiter{\lbrace}    {\mathopen}{mdsymbols}{"66}{mdlargesymbols}{"08} \DeclareMathDelimiter{\rbrace}    {\mathclose}{mdsymbols}{"67}{mdlargesymbols}{"09} \renewcommand{\textbraceleft}{%   {\fontfamily{mdput}\fontencoding{OMS}\selectfont\char"66}} \renewcommand{\textbraceright}{%   {\fontfamily{mdput}\fontencoding{OMS}\selectfont\char"67}}  \begin{document} $\{\bigl\{\Bigl\{\biggl\{\Biggl\{$ \end{document} I presented the following problem to some of my students recently (from Senior Mathematical Challenge- edited by Gardiner)  In the Fibonacci sequence $1, 1, 2, 3, 5, 8, 13, 21, 34, 55,\ldots$ each term after the first two is the sum of the two previous terms. What is the sum to infinity of the series: $$\frac{1}{2} + \frac{1}{4}+ \frac{2}{8} + \frac{3}{16} + \frac{5}{32} +\frac{8}{64} + \frac{13}{128} +\frac{21}{256} +\frac{34}{512}+ \frac{55}{1024} + \cdots$$  Now, I solved this using an infinite geometric matrix series (incorporating the matrix version of the relation $a_n= \frac{a_{n-1}}{2}+ \frac{a_{n-2}}{4}$), and my students, after much hinting on my part, googled the necessary string to stumble across Binet's formula (which allows one to split the series into two simple, if rather messy, geometrics). Both of these are good methods, but neither really seems plausible for a challenge set for 15-18 year olds under exam conditions. So how is one supposed to do it? There are many cases in maths where doing the same thing over and over again will bring you closer to a value. Derivation of polynomials is the striking example: no matter what you start with, you end up with 0. In a series expansion, the longer you continue the sequence the closer you get to the real value.  This concept applies in areas other than math (Wikipedia's everything-leads-to-philosophy phenomenon, for example). It's a little unrelated but it just proves the concept.  Hashing algorithms are just special math. Following logically, hash entropy supposedly decreases the more you hash a value. So is there a point at which any input value will give the same hash as any other?  (Let me just specify that we're not re-injecting any new data every time we hash, as if we're trying to increase the security of the hash by salting and re-hashing. It's strictly a matter of md5(md5(md5(... if that's the algorithm we're using.  I can see some problems with this already. Algorithms like md5 are designed to change their output radically when the input changes only by one bit of information. So even if a common hash for two values appears along the way, it itself will start changing. But then, does the fact that the output appears to be very different actually mean the possibilities are still many? Extracting a regex matched with 'sed' without printing the surrounding characters To all the 'sed' doctors out there:  How can you get 'sed' to extract a regular expression it has matched in a  line?   In other words words, I want just the string corresponding to the regular  expression with all the non-matching characters from the containing line stripped away.  I tried using the back-reference feature like below  regular expression to be isolated           gets `inserted`                here                     |                v    sed -n 's/.*\( \).*/\1/p    this works for some expressions like   sed -n 's/.*\(CONFIG_[a-zA-Z0-9_]*\).*/\1/p    which neatly extracts all macro names starting with 'CONFIG_ ....' ( found in some '*.h' file ) and prints them all out line by line             CONFIG_AT91_GPIO           CONFIG_DRIVER_AT91EMAC                    .                    .              CONFIG_USB_ATMEL           CONFIG_USB_OHCI_NEW                    .                  e.t.c.    BUT the above breaks down for something like    sed -n 's/.*\([0-9][0-9]*\).*/\1/p    this always returns single digits like                    7                  9                  .                  .                    6   rather than extracting a contiguous number field such as.                 8908078               89670890                    .                  .                    .                23019                     .                e.t.c.     P.S.: I would be grateful to feedback on how this is achieved in 'sed'.        I know how to do this with 'grep' and 'awk'       I would like to find out if my - albeit limited - understanding of        'sed' has holes in it and if there is way to do this in 'sed' which I       have simply overlooked. Find executable files recursively I have got the directory called Test and a few directories inside it. Both Test and the directories inside it have executable files. I'd like to print them with ls. I'd use this command.  ls -l `find Test/ -perm /u=x,g=x,o=x -type f`   Is this a good/right/quick command or not?  My solution is:  find Test/ -executable -type f -exec ls -l {} \;   and got the same result as warl0ck and pradeepchhetri offered. How to reduce vertical space in matrix? I want to reduce the size of the vertical space in matrix environment and have a result something like this     But at present I manage something like below     with the following code    $\begin{bmatrix}     00 &amp; 08 &amp; 10 &amp; 18 &amp; 20 &amp; 28 &amp; 30 &amp; 38 \\     01 &amp; 09 &amp; 11 &amp; 19 &amp; 21 &amp; 29 &amp; 31 &amp; 39 \\     02 &amp; 0a &amp; 12 &amp; 1a &amp; 22 &amp; 2a &amp; 32 &amp; 3a \\     03 &amp; 0b &amp; 13 &amp; 1b &amp; 23 &amp; 2b &amp; 33 &amp; 3b \\     04 &amp; 0c &amp; 14 &amp; 1c &amp; 24 &amp; 2c &amp; 34 &amp; 3c \\     05 &amp; 0d &amp; 15 &amp; 1d &amp; 25 &amp; 2d &amp; 35 &amp; 3d \\     06 &amp; 0e &amp; 16 &amp; 1e &amp; 26 &amp; 2e &amp; 36 &amp; 3e \\     07 &amp; 0f &amp; 17 &amp; 1f &amp; 27 &amp; 2f &amp; 37 &amp; 3f   \end{bmatrix}$   I can change the font using \mathsf{}, but other than that, how I reduce the vertical space between the rows? I did find things like  to increase vertical space between rows in matrix, but not something that can decrease the space.