similar to: Searching the archives

Hi all, I am trying to construct a pairwise coocurrence matrix for certain terms appearing in a number of documents. For example I have the following table with binary values showing the presence or absence of a certain term in a document: term1 term2 term3 term4 term5 doc1 1 1 0 0 1 doc2 1 1 0 1 1 doc3 1 0 0 0 1 And I want to have a matrix with the number of the pairwise coocurrencies. So,

I am having a problem with any terms which contain hyphens in them. Is there a particular reason why this wouldn''t work? i''m using aaf, and have tried with the the previous version (pre 0.10.0) and the newest versions of both ferret and aaf. Basically, the problem is that term1-term2 is something my users want to search for, and it appears in the titles of publications,

The following plot is a first approximation to what I need: *********************************** mu1 <- 0 mu2 <- 5 s <- 1 x <- seq(-2.5, 7.5, length = 41) y <- seq(-2.5, 2.5, length = 41) f <- function(x,y){ term1 <- 1/(2*pi*sqrt(s*s)) term2 <- -1/2 term3 <- (x - mu1)^2/s term4 <- (y - mu1)^2/s term5 <- (x - mu2)^2/s term1*(.5 * exp(term2*(term3 + term4)) + .5 *

I''m currently writing a system that stores user-created documents. Each user belongs to a specific group, and the system supports multiple groups. The thing is, my users want to be able to hide pieces of a document from other groups. So for example, lets say Joe of team A has written this document: "Hello all, our secret plan is finally complete! <private>We will begin

Hello, I am interested in fitting a segmented model with unknown joint points in nls and perhaps eventually in nlme. I can fit this model in sas (see below, joint points to be estimated are a41 and a41), but am unsure how to specify this in the nlm function. I would really appreciate any suggestions or example code. Thanks a lot. -andy proc nlin data=Stems.Trees; params b41=-3 b42=1.5

Dear list members, I want to draw surfaces of Dirichlet distributions with different parameter settings. My code is the following: #<begin code> a1 <- a2 <- a3 <- 2 #a2 <- .5 #a3 <- .5 x1 <- x2 <- seq(0.01, .99, by=.01) f <- function(x1, x2){ term1 <- gamma(a1+a2+a3)/(gamma(a1)*gamma(a2)*gamma(a3)) term2 <- x1^(a1-1)*x2^(a2-1)*(1-x1-x2)^(a3-1)

Hello! I have a problem with integrate() in my function nctspa(). Integrate produces an error message "evaluation of function gave a result of wrong length". I don't know what that means. Could anyone suggest me what is wrong with my function? These are the examples of function calls that work OK: nctspa(a=1:10,n=5) nctspa(a=1:10, n=5, mu=2, theta=3, renorm=0) This does not work:

I found a core dump: term1$ nbdkit -fv --filter=xz null xz-max-depth=$((0x4000000000000000)) term1... term2$ qemu-nbd --list term1... nbdkit: debug: null: open readonly=1 nbdkit: error: calloc: Cannot allocate memory nbdkit: debug: xz: close Segmentation fault (core dumped) (Note that the use of --run or daemonizing nbdkit makes it a bit harder to see the core dump, but it is still happening.)

Dear, I am looking for the simplification of a formula to improve the calculation speed of my program. Therefore I want to simplify the following formula: H = sum{i=0..n-1 , [ sum {j=0..m-1 , sqrt ( (Ai - Bj)^2 + (Ci - Dj)^2) } ] } where: A, C = two vectors (with numerical data) of length n B, D = two vectors (with numerical data) of length m sqrt = square root Ai = element of A with index

Hi, all: I have wrote a demo patch for Backend for Lucene format indexes, Lucene version is 3.6.2. http://lucene.apache.org/core/3_6_2/fileformats.html Now, this demo patch just support the basic features in Lucene. Compound File(.cfs/.cfe)?term vector(.tvx/.tvd/.tvf) delete document(.del) are not supported, skip list in .fdx is not supported too example/quest.cc is used to test this demo.

I was trying to run one of my kids favourite games with Wine, alas it crashes accessing a null pointer, early on while loading one of the sprite files (not corrupted). I guess the program should be doing better memory checking but since this works on Windows, maybe Wine has fed him before some broken data. Unfortunately, the terminal output doesn't seem much helpful:

I am very new to FreeBSD and Unix in general. I may have more problems than I think, but here goes. I am trying to make depend && install WITH_BSD_JDK=TRUE clean with openoffice. Everything works fine until I get to the jvm section (seen below). I have tried looking for this on the net, but I have not been to successful in finding a solution. Thanks for your help. Stephen

I wonder if anyone out there has written a routine to solve the simple linear calibration problem? - fit regression of y vs x - estimate the value x0 (with 95% CI) that gives y0 Thanks for any help. Bill -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info",

I'm observing a difference in timing on nbdkit shutdown that is dependent on client behavior, and I wonder if that's a bug, but I can't figure out where to patch it. When there is no connection present, sending SIGINT to nbdkit terminates immediately. If, on the other hand, there is a single client currently connected, the termination behavior on SIGINT depends on what the client has

I noticed that occasionally searching in my huge archive mailbox can be really slow, so I tried doveadm index on it and it seemed to do a lot of work, which seemed strange given, for example, that dovecot-lda says it keeps Dovecot index files up-to-date. Then I thought, "maybe these are different files than the search indices." If so, that's not entirely clear from the docs and

On 11/04/2014 05:00 AM, centos-request at centos.org wrote: Today's Topics: 34. Re: What List to Use for Patch Requests (Johnny Hughes) ------------------------------ Message: 34 Date: Tue, 04 Nov 2014 05:58:07 -0600 From: Johnny Hughes <johnny at centos.org> To: centos at centos.org Subject: Re: [CentOS] What List to Use for Patch Requests Message-ID: <5458BF4F.6020300

Dear Friends, I have been trying to learn how to use the derivative free optimization algorithms implemented in the package RGENOUD by Mebane and Sekhon. However, it does not seem to work for reasons best described as my total ignorance. If anybody has experience using this package, it would be really helpful if you can point out where I'm making a mistake. Thanks in advance Anup Sample

I''m looking for a good way to search a few fields accross multiple asociated tables (i.e. find ''friends and family'' accross Photo.name, Photo.description, and Tags.name where Photo has_many tags). And, ideally there''s a competent query analyzer/parser. I''ve expirimented with constructing my own SQL using ... LIKE %term1% ... etc, but the

Did you mislead me Timo? You said search in 1.1+ is faster than 1.0. I'm seeing approximately 20x *slower* search times in 1.2.10. Via Thunderbird, a full body search of my 11,000+ message IMAP folder hosted by 1.0.15 used to take less than 10 seconds. Since upgrading to 1.2.10 the search is taking over 3 minutes, the imap process servicing the client pegging one CPU at 100% for the

Hello! I have a problem with integrate() in my function nctspa(). Integrate produces an error message "evaluation of function gave a result of wrong length". I don't know what that means. Could anyone suggest me what is wrong with my function? These are the examples of function calls that work OK: nctspa(a=1:10,n=5) nctspa(a=1:10, n=5, mu=2, theta=3, renorm=0) This does not work: