Displaying 20 results from an estimated 474 matches for "formul".

Did you mean:
formal

2004 Jul 13

2

help with as.function

HI, sorry but i don't understand how to make a function with as.function()
formula<-"2+3*x"
formu<-as.symbol(formula)
> formu
2+3*x
formul<-as.function(alist(x=,formu))
curve(formul,1,5,col="blue")
Error in xy.coords(x, y, xlabel, ylabel, log) :
x and y lengths differ
> typeof(formul)
[1] "closure"
and not plot the curve fu...

2005 Jan 03

0

LME-glmmPQL formulation

...ght was the following:
glmmPQL(count~site,data=dat,random=~day|site/transect, family="poisson")
however, the random effects are not separated into day and
site/transect. Instead, there is day|site and day|site %in% transect,
which I realize makes sense in light of the model formulation.
my second guess was
glmmPQL(count~site,random=list(~day|site,~1|trans),family="poisson",data
=dat2)
which estimates a random effect on ~day|site and on
~1|trans%in%site..... which seems more appropriate, but does not give
the same answers as I have for the genstat; nor does...

2017 Jul 12

0

How to formulate quadratic function with interaction terms for the PLS fitting model?

...00 to 1700 nm.
Instead of fitting with octane[i] = a[0] * NIR[0,i] + a[1] * NIR[1,i] + ...
I want to fit the data with:
octane[i] = a[0] * NIR[0,i] + a[1] * NIR[1,i] + ... +
b[0]*NIR[0,i]*NIR[0,i] + b[1] * NIR[0,i]*NIR[1,i] + ...
i.e. quadratic with interaction terms.
But I don't know how to formulate this.
May I have some help please?
Thanks,
Kelvin
[[alternative HTML version deleted]]

2013 Oct 18

2

[LLVMdev] Contribute a new precise pointer analysis to LLVM

...he problem is a simple
balanced parentheses problem in CFL-reachability, and it can be
computed
efficiently.
The paper you mentioned is a very nice paper that proposed an
efficient algorithm to solve Dyck-CFL-reachability problem in
bidirectional graphs. However, precise pointer analysis cannot be
formulated as a Dyck-CFL-reachability problem. The alias analysis
presented in that paper is an over approximation. Hence the time bound
from our paper still applies.
Regards,
Lian
On Fri, Oct 18, 2013 at 4:39 PM, Daniel Berlin <dberlin at dberlin.org> wrote:
> I notice you guys formulate y...

2013 Oct 18

0

[LLVMdev] Contribute a new precise pointer analysis to LLVM

...exactly fits into the bidirectional graph problem, unless i'm
missing something.
>
> The paper you mentioned is a very nice paper that proposed an
> efficient algorithm to solve Dyck-CFL-reachability problem in
> bidirectional graphs.
Right, and your matching call sites can be formulated as one.
However, precise pointer analysis cannot be
> formulated as a Dyck-CFL-reachability problem.
FWIW: This remains to be seen, and certainly also depends on your
definitions of "precise".
I agree you cannot currently formulate precise andersen style field
sensitive pointer...

2017 Jul 01

0

How to replace match words whith colum name of data frame?

...any),
+ "chemical", ""))
concept category
1 butan acid chemical
2 nano diamond particl
3 slurri composit
4 composit ph polis chemical
5 inorgan particl
6 grind liquid
7 liquid formul
8 nanoparticl
9 size abras particl
10 agent malic acid chemical
Or, if you're wedded to magrittr:
> sapply(chemical_df$chemical,
+ function(x) grepl(x, concept_df$concept)) %>%
+ apply(1, any) %>%
+ ifelse("chemical", &qu...

2017 Jul 13

0

How to formulate quadratic function with interaction terms for the PLS fitting model?

...ane[i] = a[0] * NIR[0,i] + a[1] * NIR[1,i] + ...
>> I want to fit the data with:
>> octane[i] = a[0] * NIR[0,i] + a[1] * NIR[1,i] + ... +
>> b[0]*NIR[0,i]*NIR[0,i] + b[1] * NIR[0,i]*NIR[1,i] + ...
>> i.e. quadratic with interaction terms.
>> But I don't know how to formulate this.
>> May I have some help please?
>> Thanks,
>> Kelvin
>
> [[alternative HTML version deleted]]
>
> ______________________________________________
> R-help at r-project.org mailing list -- To UNSUBSCRIBE and more, see
> https://stat.ethz.ch...

2017 Jul 13

3

How to formulate quadratic function with interaction terms for the PLS fitting model?

...of fitting with octane[i] = a[0] * NIR[0,i] + a[1] * NIR[1,i] + ...
> I want to fit the data with:
> octane[i] = a[0] * NIR[0,i] + a[1] * NIR[1,i] + ... +
> b[0]*NIR[0,i]*NIR[0,i] + b[1] * NIR[0,i]*NIR[1,i] + ...
> i.e. quadratic with interaction terms.
> But I don't know how to formulate this.
> May I have some help please?
> Thanks,
> Kelvin
[[alternative HTML version deleted]]

2013 Aug 06

1

[LLVMdev] Potential SimplifyCFG optimization; hammock to diamond transformation

...ure if something similar exists in LLVM today. The optimization you are looking for is called partial dead code elimination (PDE).
I do not think SimplifyCFG would be a great place to put this as that is primarily about cleaning up control flow. I think it deserves its own pass.
The most general formulation would result in sinking instructions, including loads (and possibly some other side-effecting instructions when safe to do so), along with potentially duplicating code when the results are dead on some paths below the definition, but not all.
It seems like you could do a simpler formulation...

2017 Jan 04

0

Formulating Advanced Queries with Xapian-Omega

On Thu, Dec 29, 2016 at 05:44:50PM +0100, Giulio Teslano wrote:
> a. What other types of extended wild card(s) options are there ?
>
> or is this still currently limited to these two characters '*?' ?
As I said, the branch "adds support for arbitrary glob-style wildcard
patterns (where * matches 0 or more characters and ? a single

2013 Apr 23

2

Frustration to get help R users group

Dear R users/developers
I requested help to solve the problem of formulating Multivariate Sample
selection model by using Full Information Maximum Likelihood
(FIML)estimation method. I could not get any response. I formulated the
following code of FIML to analyse univariate sample selection problem.
Would you please advise me where is my problem
library (sem)
library(...

2013 Aug 06

0

[LLVMdev] Potential SimplifyCFG optimization; hammock to diamond transformation

...ists in LLVM today. The optimization
> you are looking for is called partial dead code elimination (PDE).
>
> I do not think SimplifyCFG would be a great place to put this as that is
> primarily about cleaning up control flow. I think it deserves its own pass.
>
> The most general formulation would result in sinking instructions,
> including loads (and possibly some other side-effecting instructions when
> safe to do so), along with potentially duplicating code when the results
> are dead on some paths below the definition, but not all.
>
> It seems like you could do...

2013 Aug 06

3

[LLVMdev] Potential SimplifyCFG optimization; hammock to diamond transformation

All,
I have some code that looks like the following:
{
double a, b, c;
for (...) {
...
a = lots of FP math;
b = lots of FP math;
c = lots of FP math;
if (cond) {
a = 0.0;
b = 0.1;
c = 0.2;
}
...
}
}
Could we not convert the hammock into a diamond and move the initial
computation of a, b, and c into the else block. Something like this:
{

2007 Aug 30

1

categorical variable coefficients in QSAR

...obtain is a coefficient for each substituent at each
position, as does Kubinyi:
H F Cl Br I Me
meta 0.00 -0.30 0.21 0.43 0.58 0.45
para 0.00 0.34 0.77 1.02 1.43 1.26
However, I do not get a coefficient for the Br substituent at the para
position. I would like to know if there is an error in this formulation.
The technique is quite well established in the field of medicinal
chemistry and it is traditional that the binary incidence matrix is formed
"by hand" as an intermediate step in the analysis, instead of the much
simpler formulation that I am considering here.
Thank you for whatever...

2016 Dec 22

1

Formulating Advanced Queries with Xapian-Omega

Hello,
We have Xapian-Omega installed (Linux) and working in default mode and
have
browsed several interesting pages on the main site, at trac.xapian.org
(the wiki) and in the mailing list. Having tested various search
options
(up to now only for Omega) we would like to ask a couple of questions.
1. Is it possible to search for Patterns of Text with Omega and/or
Xapian Queries ?

2009 Jul 07

5

Permission problem

...t;agents" group have read-only access to /home/pub and
below.
3) All the others (that is, members of neither "administrators" and
"agents") have no access at all to /home/pub, not even for listing the
directory content.
The thing is: I can't seem to formulate my problem in terms of
user/group/others, as there are no owners, but two distinct groups
involved.
Any idea how to crack that nut?
Niki

2016 Dec 29

2

Formulating Advanced Queries with Xapian-Omega

...port of the arbitrary glob-style
wildcard patterns.
a. What other types of extended wild card(s) options are there ?
or is this still currently limited to these two characters '*?' ?
b. Apart from 0 or more and single char options are there any other
options ?
either via Omega, formulating an appropriate query for CGI or via
Xapian.
Rearding the question in relation to Text Patterns
The reference to ISBNs was of course merely a simple example, but it
could be any other typical pattern of letters, numbers and separator
characters.
Were you suggesting that one possibility...

2000 Jan 12

1

Usage of p/d/qnorm

Hello,
could You please help: I am looking for a way to formulate test accuracy
measures such as test sensitivity, specificity, predictive values, and
correct classification rate using p/d/qnorm. The tests' primary values
follow a bimodal distribution, which is modelled by a mixture of two normal
distributions:
p * dnorm ((x - u1) / s1)...

2017 Jul 16

0

How to formulate quadratic function with interaction terms for the PLS fitting model?

...example:
> df <-matrix(runif(60),ncol=3)
> y <- runif(20)
> mdl1 <-lm(y~df*I(df^2))
> mdl2 <-lm(y~df*poly(df,degree=2,raw=TRUE))
> length(coef(mdl1))
[1] 16
> length(coef(mdl2))
[1] 40
Explanation:
In mdl1, I(df^2) gives the squared values of the 3 columns of df. The
formula df*I(df^2) gives the 3 (linear) terms of df, the 3 pure
quadratics of I(df^2), the 9 cubic terms obtained by crossing these,
and the constant coefficient = 16 coefs.
In mdl2, the poly() expression gives 9 variiables: 3 linear, 3 pure
quadratic, 3 interactions (1.2, 1.3, 2.3) of these. The df*po...

2010 Dec 01

1

[LLVMdev] RFC: Exception Handling Proposal Revised

...e within
a basic block spill/fill code for global registers can be inserted
because you cannot know
if any specific location within the block will actually be executed
before you "leave"
from the block).
I believe other folks have already tried to raise this question, but
when formulated in terms of
phi nodes or what ever neither the question nor the answer are as
clear as when it is formulated
in terms of basic blocks.....
sincerely,
Peter Lawrence.