search for: qp

...needed to support), but there are other solutions as well. Index: c/include/search.h =================================================================== --- c/include/search.h (revision 615) +++ c/include/search.h (working copy) @@ -819,6 +819,7 @@ char *qstr; char *qstrp; char buf[QP_CONC_WORDS][MAX_WORD_SIZE]; + char *dynbuf; int buf_index; HashTable *field_cache; HashSet *fields; Index: c/src/q_parser.y =================================================================== --- c/src/q_parser.y (revision 615) +++ c/src/q_parser.y (working copy) @@ -173,6 +173,1...

I was playing around with a simple example using solve.qp ( function is in the quadprog package ) and the code is below. ( I'm not even sure there if there is a reasonable solution because I made the problem up ). But, when I try to use solve.QP to solve it, I get the error that D in the quadratic function is not positive definite. This is because...

David — this isn't the behaviour I see what QueryParser alone, unless you're driving it in a way I don't expect. In python: >>> import xapian >>> qp = xapian.QueryParser() >>> qp.add_prefix('subject', 'S') >>> str(qp.parse_query('subject:"and"', qp.FLAG_DEFAULT|qp.FLAG_BOOLEAN_ANY_CASE)) 'Query(Sand at 1)' >>> str(qp.parse_query('subject:"or"', qp.FLAG_DEFAUL...

...diff --git a/src/launch-appliance.c b/src/launch-appliance.c index d8d8e03..adaf498 100644 --- a/src/launch-appliance.c +++ b/src/launch-appliance.c @@ -261,13 +261,6 @@ launch_appliance (guestfs_h *g, const char *arg) */ alloc_cmdline (g); - /* Add any qemu parameters. */ - for (qp = g->qemu_params; qp; qp = qp->next) { - add_cmdline (g, qp->qemu_param); - if (qp->qemu_value) - add_cmdline (g, qp->qemu_value); - } - /* CVE-2011-4127 mitigation: Disable SCSI ioctls on virtio-blk * devices. The -global option must exist, but you ca...

...d simulations in S-Plus 6.1, with all six different random number generators in R 1.9.1 and 2.1.1 and with MS Excel. For modest changes in EZ[t] < 0, I get a different asymptote but pretty much the same image. ################################################# simCus5 <- function(mu=-0.1, Qp0=4.5, maxTime=400, nSims=20000){ Qp.mean <- rep(NA, maxTime) Qp.t <- rep(Qp0, nSims) for(i in 1:maxTime){ z.t <- (mu + rnorm(nSims)) Qp.t <- pmax(0, Qp.t+z.t) Qp.mean[i] <- mean(Qp.t) } Qp.mean } set.seed(1) plot(simCus5(Qp0=4.5)) #######################...

Dear list, I am trying to follow an example that estimates a 2x2 markov transition matrix across several periods from aggregate data using restricted least squares. I seem to be making headway using solve.QP(quadprog) as the unrestricted solution matches the example I am following, and I can specify simple equality and inequality constraints. However, I cannot correctly specify a constraint matrix (Amat) with box constraints per cell and equality constraints that span multiple cells. Namely the solutio...

Today we noticed that keywords can't be searched as prefixed terms. Or that's what it looks like anyway. I tested and, or, and not. ╰─% NOTMUCH_DEBUG_QUERY=y notmuch search 'subject:"and"' Query string is: subject:"and" notmuch search: A Xapian exception occurred A Xapian exception occurred parsing query: Syntax: <expression> AND <expression> Query

Did any RDMA/Ethernet users see this Gluster error? If so do you know what caused it and how to fix? If you haven't seen it, what RPMs and configuration do you use specific to RDMA/Ethernet? [2011-11-10 10:30:20.595801] C [rdma.c:2417:rdma_connect_qp]0-rpc-transport/rdma: Failed to modify QP to RTR [2011-11-10 10:30:20.595930] E [rdma.c:4159:rdma_handshake_pollin] 0-rpc-transport/rdma: rdma.management: failed to connect with remote QP I see this when I run RDMA over Ethernet using ROCEE RPMs, but when I run over Infiniband using RHEL 6.2-, it...

hello all, i'm trying to use QPmat, from the popbio package. it appears to be based on solve.QP and is intended for making a population projection matrix. QPmat asks for: nout, A time series of population vectors and C, C constraint matrix, (with two more vectors, b and nonzero). i believe the relevant code from QPmat is: functi...

Dear R Users, How can I prevent solve.Qp from printing the solution progress ? Thanks in advance, Tolga This email is confidential and subject to important disclaimers and conditions including on offers for the purchase or sale of securities, accuracy and completeness of information, viruses, confidentiality, legal privilege, and legal...

...of-both-worlds so a human can still use wildcards? public-inbox also allows searches on pathnames, and maybe that should use boolean filtering, too... My setup for the query parser isn't anything special: our $LANG = 'english'; sub stemmer { Search::Xapian::Stem->new($LANG) } sub qp { my ($self) = @_; my $qp = $self->{query_parser}; return $qp if $qp; # new parser $qp = Search::Xapian::QueryParser->new; $qp->set_default_op(OP_AND); $qp->set_database($self->{xdb}); $qp->set_stemmer($self->stemmer); $qp->set_stemming_strategy(STEM_SOME); $qp-&...

Hi I'm having problems getting the "factorized" argument in solve.QP (part of the quadprog library) to work as expected. The helpfile states that when the factorized argument is set to TRUE, then the function requires the inverse of a square-root factor of the Hessian instead of the Hessian itself. That is, when factorized=TRUE, the Dmat argument should be a matrix...

Dear R Users , As a beginner in QP, I'm trying to solve a Support Vector Machine problem by a QP. In particulare I am using the quadprog package. My questions are here: 1- In the document for the package (The quadprog Package), the inequality constraint is mentioned with >= , however in a standard QP, this usaully is written...

Hello David, same problem here with solve.QP. dykstra is causing problems as well and giving for the value NA if factorized = TRUE: library(quadprog) library(Dykstra) R<-cbind(c(1,1),c(0,1)); d<-c(t(R)%*%R%*%c(2,1)) solve.QP(solve(R),d,-as.matrix(c(1,1)),-2,1,factorized = TRUE) S<-t(R)%*%R; solve.QP(S,d,-as.matrix(c(1,1))...

Hi there, I have a major problem (major for me that is) with solve.QP and I'm new at this. You see, to solve my quadratic program I need to have the lagrange multipliers after each iteration. Solve.QP gives me the solution, the unconstrained solution aswell as the optimal value. Does anybody have an idea for how I could extract the multipliers? Thanx, Serge &q...

Hi, I am using solve.QP (from quadprog) to solve a standard quadratic programming problem: min_w -0.5*w'Qw st ... I would like solve.QP to do two things: 1) to start the optimization from a user-supplied initial condition; i.e., from a vector w_0 that satisfies the constraints, and 2) to return the values of the lagra...

At the risk of ridicule for my deficient linear algebra skills, I ask for help using the solve.QP function to do portfolio optimization. I am trying to following a textbook example and need help converting the problem into the format required by solve.QP. Below is my sample code if anyone is willing to go through it. This problem will not solve because it is not set up properly. I hope I in...

...b_i, i=1,...,4: b_1+b_3=1 b_2+b_4=1 0.1<=b_1<=0.2 0.2<=b_2<=0.4 0.8<=b_3<=0.9 0.6<=b_4<=0.8 In my opinion the solution should be b_1=b_2=0.2 und b_3=b_4=0.8. Unfortunately R doesn't find this solution and what's surprising to me, evaluation the solution of solve.QP with my function doesn't lead the minimal "value" calculated by solve.QP I would be very happy, if anyone could help and tell me, where's my mistake. Thank you very much. Fabian My R-code also containing the sampel of quadprog starts here: #sample from quadprog package library(...

...t that does the exact distribution. I'm looking forward to comments on improving the programming efficiency for this problem. (The "return(...)" seems to be necessary in R only.) Knut #-------------------------------------------------------------------------- # asymp.SMN.pvalue(pP,qP,pX,qX,pQ,qQ) # exact.SMN.pvalue(pP,qP,pX,qX,pQ,qQ) #-------------------------------------------------------------------------- # pP,qP = number of PP,PQ children of PP~PQ parents # pX,qX = number of PP,QQ children of PQ~PQ parents # pQ,qQ = number of PQ,QQ children of PQ~QQ parents #---------------...

...the VMX and supporting VM to VM communication and the + * newer ones that use the guest memory directly. We will in the following + * refer to the older VMX versions as old-style VMX'en, and the newer ones as + * new-style VMX'en. + * + * The state transition datagram is as follows (the VMCIQPB_ prefix has been + * removed for readability) - see below for more details on the transtions: + * + * -------------- NEW ------------- + * | | + * \_/ \_/ + * CREATED_NO_MEM <----------------->...