search for: term1

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, but when "term1" or "term2" or "term1-term2" are searched for, there are no results. Thanks for any clues Cam -- Posted via http://www.ruby-forum.com/.

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, based on the above table the matrix should be: term1 term2 term3 term4 term5 term1 0 2 0 1 3 term2 2 0 0 1 2 term3 0 0 0 0 0 term4 1 1 0 0 1 t...

..., on the other hand, there is a single client currently connected, the termination behavior on SIGINT depends on what the client has done: if the client is currently silent with regards to issuing transmission-phase transactions, nbdkit hangs for 5 seconds, then forcibly tears down the connection: term1$ ./nbdkit -f -v -n file file=TODO ... nbdkit: debug: bound to IP address <any>:10809 (2 socket(s)) term2$ qemu-io -f raw nbd://localhost:10809/ -r qemu-io> term1$ ^C nbdkit: debug: waiting for running threads to complete nbdkit: debug: waited 5s for running threads to complete nbdkit: de...

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) term3 <- (x1 + x2 < 1) term1*term2*term3 } z <- outer(x1, x2, f) z[z<=0] <- NA persp(x1, x2, z, main = "Dirichlet Distribution",...

...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 b43=-1.5 b44=50 a41=0.75 a42=0.1; term1 = (b41*(x - 1) + b42*(x**2 -1)); if (a41 - x) >= 0 then term2 = (b43*(a41 - x)**2); else term2 = 0; if (a42 - x) >=0 then term3 = (b44*(a42 - x)**2); else term3 = 0; model y = term1+term2+term3; run;

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...

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 * exp(term2*(term5 + term4))) } z <- outer(x, y, f) persp(x, y, z) require(grDevices) filled.contour(x, y, z, axes = F, frame.plot...

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",

...nobs <- 5000 t.beta <- c(0,1,-1) X <- as.matrix(cbind(rep(1, nobs), runif(nobs), runif(nobs))) # Creating the design matrix prodterm <- (X%*%t.beta)+rnorm(nrow(X)) Y <- as.matrix(ifelse(prodterm<0, 0, 1)) # Defining the likelihood function log.like <- function(beta, Y, X) { term1 <- pnorm(X%*%beta) term2 <- 1-term1 loglik <- (sum(Y*log(term1))+sum((1-Y)*log(term2))) # Likelihood function to be maximized } stval <- c(0,0,0) opt.output <- optim(stval,log.like,Y=Y[,1], X=X[,1:3], hessian=T, method="BFGS", control=c(fnscale=-1,trace=1)) opt.output ###...

...===================================================# nctspa <- function(a,n,mu=0,theta=0,renorm=0,rec=0){ #Pass renorm=1 to renormalize the SPA to the pdf. #There is a last argument called rec. DO NOT PASS it! alpha <- mu/sqrt((1+theta/n)) normconst <- 1 if(renorm==1 & rec==0){ term1 <- integrate(nctspa, -Inf, alpha, n=n, mu=mu, theta=theta)$value term2 <- integrate(nctspa, alpha, Inf, n=n, mu=mu, theta=theta)$value normconst <- 1/(term1+term2) } cdf <- numeric() pdf <- cdf c3 <- n^2+2*n*a^2+a^4 c2 <- (-2*mu*(a^3+n*a))/c3 c1 <- (-n^2-n*a^2-...

...s 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 performance is poor -- queries take seconds or more depending on the number of terms. Will acts_as_ferret work for me? Any recommendations? Thanks! -- Posted via http://www.ruby-forum.com/.

...=========================================================# nctspa <- function(a,n,mu=0,theta=0,renorm=0,rec=0){ #Pass renorm=1 to renormalize the SPA to the pdf. #There is a last argument called rec. DO NOT PASS it! alpha <- mu/sqrt((1+theta/n)) normconst <- 1 if(renorm==1 & rec==0){ term1 <- integrate(nctspa, -Inf, alpha, n=n, mu=mu, theta=theta)$value term2 <- integrate(nctspa, alpha, Inf, n=n, mu=mu, theta=theta)$value normconst <- 1/(term1+term2) } cdf <- numeric() pdf <- cdf c3 <- n^2+2*n*a^2+a^4 c2 <- (-2*mu*(a^3+n*a))/c3 c1 <- (-n^2-n*a^2-n*theta+...

...ion" to html or a latex document, or maybe pdf? Thank you for your attentions. Best wishes: Daniel the code: library("tkrplot") library("relax") dirfelulet <- function (a1 = 1, a2 = 1, a3 = 1){ x1 <- x2 <- seq(0, 1, by=.01) dirf <- 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) term3 <- (x1 + x2 < 1) term1 * term2 * term3 } f <- outer(x1, x2, dirf) f[f<=0] <- NA f[is.infinite(f)] <- NA persp(x1, x2, f, zlim = c(0, max(f,...

Hello Is there a method of searching the archives? Please direct me to the instructions. Thanks -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.centos.org/pipermail/centos/attachments/20070203/d0082d98/attachment.html>

Hello, I've got a problem with a PHP script, in which I call the system function (to call another processes). The call is : system("R --slave --vanilla < path/to/source/source.R"); if in this R file, I've got the lines: pdf(file="/path/to/file/file.pdf") commands dev.off() the pdf file is perfectly created but if I change the lines to:

i think our strategy for privsep is to just keep portable sync'd closely with openbsd's tree, even though things will be broken wrt privsep for many platforms. then we just get primary one's working and work out issues as we go along. i'll start to work on sun and hp-ux again tomorrow.

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

...mats.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. query like this: field_name:term, or file_name:term1 AND field_name:term2 Until now, I found some data needed for BM25 in Xapian are not existed in Lucene: 1. doclength_lower_bound?doclength_upper_bound 2. wdf_lower_bound?wdf_uppper_bound 3. total_length 4. doclength(for each document) 1-3 are statistics data, can be caculated when doing copydataba...

...the plugin is parallel, since otherwise, at most one thread is running at a time anyway). Setting -t 1 forces a parallel plugin to behave serialized, setting to other values allows tuning for performance; the default of 16 matches the choice of MAX_NBD_REQUESTS used in qemu. One easy way to test: term1$ echo hello > junk term1$ ./nbdkit -f -v -r file file=junk rdelay=2s wdelay=1s term2$ qemu-io -f raw nbd://localhost:10809/ --trace='nbd_*' \ -c 'aio_read 0 1' -c 'aio_write -P 0x6c 2 2' -c 'aio_flush' If the write completes before the read, then nbdkit was pro...

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