similar to: Case problems w/[homes]

Hi All, Yesterday I began experimenting with using LDA to do delivery. To begin with I'm using a .forward file entry for myself so as to avoid affecting other users. When "deliver" is passed an item to deliver, the following is logged: > deliver(allen): Sep 18 19:28:52 Info: Namespace: type=private, > prefix=INBOX., sep=., inbox=yes, hidden=no, list=yes, subscriptions=yes

Dear R helper: When I was trying to install the fCalendar package, R report the following error and then my installation failed: * Installing *source* package 'fCalendar' ... ** R ** inst ** preparing package for lazy loading Loading required package: MASS Loading required package: fEcofin Loading required package: fUtilities Loading required package: RUnit RUnit 0.4.17 loaded.

Hello All, We are using Dovecot 1.1.3 to serve IMAP on a pair of clustered Postfix servers which share a fiber array via the GFS clustered filesystem. This all works very well for the most part, with the exception that certain operations are so inefficient on GFS that they generate significant I/O load and hurt performance. We are using the Maildir format on disk. We're also using

I just wanted to share this useful info as I haven''t seen it anywhere. My scrounging-genius colleague, Lawrence, found standard PCI-e replacement brackets for the justifiably popular Supermicro AOC-USAS-L8i cards. They cost a few bucks each, fit perfectly and allow us to use these cards extensively without any case-hackery.

ioemu: fix xenfb slow case update Signed-off-by: Samuel Thibault <samuel.thibault@eu.citrix.com> diff -r 067d8f19e78a tools/ioemu/hw/xenfb.c --- a/tools/ioemu/hw/xenfb.c Thu Feb 28 13:55:37 2008 +0000 +++ b/tools/ioemu/hw/xenfb.c Fri Feb 29 15:25:17 2008 +0000 @@ -1072,7 +1072,7 @@ /* A convenient function for munging pixels between different depths */ #define

Dear All I have a problem of calculating the derivative of dxm matrix A with respect to another dxm matrix B, where A= [a1 a2 ... am] and B =[b1 b2 ... bm] with ai and bj are vectors. Actually the matrix A itself is the first order derivative of a scalar J with respect to B, i.e., A = dJ/dB, where a1 = dJ/db1, a2 = dJ/db1, and so on. Now dA/dB is the second order derivative dA/dB =

Hello list members, Today I noticed on http://wiki.rubyonrails.com/rails/pages/WorkingProfessionallyWithRails that there were a ton of spam links in the source code that I couldn''t see on the page itself. Upon careful examination I found the links to be hidden: I am posting the content here for reference and to show patterns of spam: <u

Dear all, I have made patch for samba-2.0.7/source/lib/bitmap.c With this patch 1) constant '32' is now named. 2) make only one malloc on bitmap_allocate(). ( This will make bitmap to fit within same page, which will cause lesser pagefault, I wish ) 3) totally changed bitmap_find(). I guess this should work faster then testing each bits one-by-one. ---

On 12/2/18 10:33 AM, Richard W.M. Jones wrote: > The cow and cache filters both use a bitmap mapping virtual disk > blocks to status stored in the bitmap. The implementation of the > bitmaps is very similar because one was derived from the other when > the filters were implemented. > > The main difference is the cow filter uses a simple bitmap (one bit > per block), whereas

The cow and cache filters both use a bitmap mapping virtual disk blocks to status stored in the bitmap. The implementation of the bitmaps is very similar because one was derived from the other when the filters were implemented. The main difference is the cow filter uses a simple bitmap (one bit per block), whereas the cache filter uses two bits per block. This commit abstracts the bitmap

The cow and cache filters both use a bitmap mapping virtual disk blocks to status stored in the bitmap. The implementation of the bitmaps is very similar because one was derived from the other when the filters were implemented. The main difference is the cow filter uses a simple bitmap (one bit per block), whereas the cache filter uses two bits per block. This commit abstracts the bitmap

The cow and cache filters both use a bitmap mapping virtual disk blocks to status stored in the bitmap. The implementation of the bitmaps is very similar because one was derived from the other when the filters were implemented. The main difference is the cow filter uses a simple bitmap (one bit per block), whereas the cache filter uses two bits per block. This commit abstracts the bitmap

------- =_aaaaaaaaaa0 Content-Type: text/plain; charset="us-ascii" Content-ID: <14008.870179829.1@erehwon.bmc.com> See attached. Red Hat Linux package mh-6.8.3-13.i386.rpm installs the inc and msgchk programs as follows: -rwsr-sr-x- root mail 72628 Oct 17 16:57 /usr/bin/mh/inc -rwsr-xr-x- root root 52536 Oct 17 16:57 /usr/bin/mh/msgchk Hal -------

Dear List: I'm working to construct a very large sparse matrix and have found relief using the SparseM package. I have encountered an issue that is confusing to me and wonder if anyone may be able to suggest a smarter solution. The matrix I'm creating is a covariance matrix for a larger research problem that is subsequently used in a simulation. Below is the latex form of the matrix if

It's useful to be able to search for the next non-zero entry in a bitmap. This commit adds a ?bitmap_next? function to do that. Because the bitmap is just a uint8_t buffer, using fast string functions we should be able to do this quickly even if the bitmap is sparse. (However the actual implementation is not optimized since that is quite complicated - see to-do comments in

--- filters/cache/lru.h | 54 ++++++++++++++ filters/cache/blk.c | 12 +++ filters/cache/lru.c | 150 ++++++++++++++++++++++++++++++++++++++ filters/cache/Makefile.am | 2 + 4 files changed, 218 insertions(+) diff --git a/filters/cache/lru.h b/filters/cache/lru.h new file mode 100644 index 0000000..4faefcd --- /dev/null +++ b/filters/cache/lru.h @@ -0,0 +1,54 @@ +/* nbdkit

--- filters/cache/lru.h | 54 ++++++++++++++ filters/cache/blk.c | 12 +++ filters/cache/lru.c | 151 ++++++++++++++++++++++++++++++++++++++ filters/cache/Makefile.am | 2 + 4 files changed, 219 insertions(+) diff --git a/filters/cache/lru.h b/filters/cache/lru.h new file mode 100644 index 0000000..4faefcd --- /dev/null +++ b/filters/cache/lru.h @@ -0,0 +1,54 @@ +/* nbdkit

On 1/1/19 8:33 AM, Richard W.M. Jones wrote: > --- > filters/cache/lru.h | 54 ++++++++++++++ > filters/cache/blk.c | 12 +++ > filters/cache/lru.c | 150 ++++++++++++++++++++++++++++++++++++++ > filters/cache/Makefile.am | 2 + > 4 files changed, 218 insertions(+) > > +++ b/filters/cache/lru.c > @@ -0,0 +1,150 @@ > +/* nbdkit > + *

I color some area grey with polygon() (with a red border) and then I want to have the dashed red border in the legend as well. How do I manage it? And I want to mix (latex) expressions with text in my legend. Just execute my lines below and you know want I mean. Or pass by at http://de.wikipedia.org/wiki/Bild:GBM.png to see the picture online. Thomas bm <- function(n=500, from=0, to=1) {

Hello R users, I'm working with a time-series of several years and to analyze it, I?m using GAM smoothers from the package mgcv. I?m constructing models where zooplankton biomass (bm) is the dependent variable and the continuous explanatory variables are: -time in Julian days (t), to creat a long-term linear trend -Julian days of the year (t_year) to create an annual cycle - Mean temperature