search for: z_

.... . . 2000 4 1 2.48 2000 4 2 3.93 2000 4 3 5.17 that is, I have data Y_{gtr} for g (gene) =1,...,2000 t (treatment) = 1,...,4 and r (replicate) = 1,...,3 I would like to fit the following linear mixed model using lme Y_{gtr} = \mu_{g} + W_{gt} + Z_{gtr} where the \mu_{g}'s are fixed gene effects, W_{gt} ~ N(0, \sigma^{2}) gene-treatment interactions, and residual errors Z_{gtr} ~ N(0,\tau^{2}). (Yes, I know I'm specifying an interaction between gene and treatment without specifying a treatment main effect ! - there is good reason for...

Hi, I want to fit the following model to my data: Y_t= a+bY_(t-1)+cY_(t-2) + Z_t +Z_(t-1) + Z_(t-2) + X_t + M_t i.e. it is an ARMA(2,2) with some additional regressors X and M. [Z_t's are the white noise variables] How do I find the estimates of the coefficients in R? And also I would like to know what technique R employs to find the estimates? Any help is appreci...

...< + echo < + cat + cat + echo | + LIBEDIT='-ledit -lcurses' ++ sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p' | + LIBEDIT_MSG=yes + for ac_var in '`(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA | + echo 'configur + eval 'ac_val=$AR' | + echo -n 'check ++ ac_val=/u...

...es at units.it> To: R Help <r-help at r-project.org> Dear all, I'm puzzled with matrix indices in plotmath. I'm plotting matrix elements: Z [i, i], and I'd like to put that as label. I'll describe what I want and what I get in LaTeX-notation. The output should look like Z_{i, i}, and my first try was plot (1, 1, ylab = expression (Z[i, i])) That, however, gives me Z_{i} (no comma, no second i) although the expression looks OK to me: > a <- expression (Z[i, i]) > a [[1]] Z[i, i] > str (as.list (a [[1]])) List of 4 $ : symbol [ $ : symbol Z $ : symbo...

Dear All, I wonder if there is any implemented statistical test in R to test the equality between many correlations. As an example, let X1, X2, X3 X4 be four random variables. let Phi(X1,X2) , Phi(X1,X3) and Phi(X1,X4) be the corresponding correlations. How to test Phi(X1,X2) = Phi(X1,X3) = P(X1,X4)? Many thanks in advance, Bernard

Hi all, I want to fit the following model to my data: Y_t= a+bY_(t-1)+cY_(t-2) + Z_t +Z_(t-1) + Z_(t-2) + X_t + M_t i.e. it is an ARMA(2,2) with some additional regressors X and M. [Z_t's are the white noise variables] So, I run the following code: for (i in 1:rep) { index=sample(4,15,replace=T) final<-do.call(rbind,lapply(index,function(i) get(as.char...

...+[]*?\-:!<>]+ as a token. gold uses more complex rules to tokenize. I don't think we need that much complex rules, but there seems to be room to improve our tokenizer. In particular, I believe we can parse the Linux's linker script by changing the tokenizer rules as follows. [A-Za-z_.$/\\~=+[]*?\-:!<>][A-Za-z0-9_.$/\\~=+[]*?\-:!<>]* or [0-9]+ On Mon, Jan 23, 2017 at 9:25 AM, George Rimar via llvm-dev < llvm-dev at lists.llvm.org> wrote: > >I'm not sure if it is easy, but I think that it's clear that the > linkerscript lexer needs to be i...

Hi, How do we get the value of a chi square as we usually look up on the table on our text book? i.e. Chi-square(0.01, df=8), the text book table gives 20.090 > dchisq(0.01, df=8) [1] 1.036471e-08 > pchisq(0.01, df=8) [1] 2.593772e-11 > qchisq(0.01, df=8) [1] 1.646497 > nono of them give me 20.090 Thanks, cruz

..., i32 4} =========================== In practice, when merging bitcode files from Linux kernel compilation units, this effect causes lots of duplicated types because it propagates upwards through the type hierarchy. In a Linux kernel build with 2256 compilation units: $ egrep '^%struct\.[0-9a-z_]+[. ]' llvm_bitcode_linked.ll | egrep -v '^%struct\.anon\.' | wc -l 59984 $ egrep '^%struct\.[0-9a-z_]+ ' llvm_bitcode_linked.ll | egrep -v '^%struct\.anon\.' | wc -l 4463 So there are 4463 unique struct names, but 59984 named struct types. Many structs are duplicated a...

...>as a token. gold uses more complex rules to tokenize. I don't think we need that much complex rules, but there seems to be >room to improve our tokenizer. In particular, I believe we can parse the Linux's linker script by changing the tokenizer rules as >follows. > > [A-Za-z_.$/\\~=+[]*?\-:!<>][A-Za-z0-9_.$/\\~=+[]*?\-:!<>]* > >or > > [0-9]+? After more investigation, that seems will not work so simple. Next are possible examples where it will be broken: . = 0x1000; (gives tokens "0, x1000") . = A*10; (gives "A*10") . = 10...

...p://127.0.0.1/bar-4.5.6.x86_64.tgz">bar-4.5.6.x86_64.tgz</a> (5551274 bytes) <tr><td><a href="foo-bar-1.2.3+1.2.3.tar.gz">foo-bar-1.2.3+1.2.3.tar.gz</td></tr> This is what I now have (improvements most welcome): $ egrep -o ">([A-Za-z_-]+)([[:digit:]]{1,3}(\.[[:digit:]]{1,3})*).+(.|t)gz" ./test_regex.txt | grep -v ".dbg" | tr -d '>' Output: foo-bar-1.2.3+1.2.3.tar.gz baz-4.5.6.i686.tgz baz-4.5.6.x86_64.tgz So far so good but now I also want to get the version numbers which I can't figure out. An...

Suppose one wanted to consider random variables X_1,...X_n and from each subtract off the piece which is correlated with the previous variables in the list. i.e. make new variables Z_i so that Z_1=X_1 and Z_i=X_i-cov(X_i,Z_1)Z_1/var(Z_1)-...- cov(X_i,Z__{i-1})Z__{i-1}/var(Z_{i-1}) I have code to do this but I keep getting a "non-conformable array" error in the line with the covariance. Does anyone have any suggestions? Here is my code: gov=read.table(file.choose(),...

Dear all, I'm puzzled with matrix indices in plotmath. I'm plotting matrix elements: Z [i, i], and I'd like to put that as label. I'll describe what I want and what I get in LaTeX-notation. The output should look like Z_{i, i}, and my first try was plot (1, 1, ylab = expression (Z[i, i])) That, however, gives me Z_{i} (no comma, no second i) although the expression looks OK to me: > a <- expression (Z[i, i]) > a [[1]] Z[i, i] > str (as.list (a [[1]])) List of 4 $ : symbol [ $ : symbol Z $ : s...

...pr " char *%s;\n" n; pr " int %s_size;\n" n + | OptString n -> + pr " char *%s = NULL;\n" n; + pr " int %s_size;\n" n | StringList n | DeviceList n -> pr " zval *z_%s;\n" n; @@ -310,7 +312,7 @@ PHP_FUNCTION (guestfs_last_error) | String n | Device n | Mountable n | Pathname n | Dev_or_Path n | Mountable_or_Path n | FileIn n | FileOut n | Key n - | OptString n | GUID n -> + | GUID n -> (* Just nee...

....fit <- arima(LakeHuron,order=c(1,0,1)) then the function predict() can be used for predicting future data with the model: LakeH.pred <- predict(Lake.fit,n.ahead=5) I can see the result LakeH.pred$pred and LakeH.pred$se but I did not see residual in predict function. If I have a model: [\ Z_t = Z_{t-1} + A + e_t + B*e_{t-1} \] How could I find $e_t$ dan $e_{t-1}$ ? Best, XY

...-) But that's not even a grammar. I simply want to know what the syntax is for specifying metadata on an instruction. From what I gather, it is this: <instruction> ',' <MetadataSpec> <MetadataSpec>: '!' <ID> '!' <ID> <ID>: [a-zA-Z_][a-zA-Z0-9_]* And the second <ID> needs to be the name of a metadata node: '!' <ID> '=' METADATA '!' '{' <MDNodeList> '}' And MDNodeList contains a list of stuff like integer values, strings and so on. Is that basically right? So I wou...

...refix isn't empty here (for the $apple case). + # We handle mangling the label here, make sure it doesn't match + # the label handling below (if $prefix would be empty). + $prefix = "; "; push(@proc_stack, $proc); - s/^[A-Za-z_\.]\w+/$&:/; + s/^[A-Za-z_\.]\w+/$symprefix$&:/; } $prefix = $prefix."\t.thumb_func; " if ($thumb); s/\bPROC\b/@ $&/; @@ -172,7 +183,7 @@ while (<>) { my $proc; s/\bENDP\b/@ $&/; $proc = pop(@proc_stack)...

...gt; > I simply want to know what the syntax is for specifying metadata on an > instruction.  From what I gather, it is this: > > <instruction> ',' <MetadataSpec> > > <MetadataSpec>: '!' <ID> '!' <ID> > > <ID>: [a-zA-Z_][a-zA-Z0-9_]* > > And the second <ID> needs to be the name of a metadata node: > > '!' <ID> '=' METADATA '!' '{' <MDNodeList> '}' > > And MDNodeList contains a list of stuff like integer values, strings and so > on. >...

I don't think the lang ref metadata grammar section (http://llvm.org/docs/LangRef.html#metadata) has been fully updated with how !dbg metadata is used in http://llvm.org/docs/SourceLevelDebugging.html. At least to me it is not clear. In my mind I translate the phrase "LLVM IR allows metadata to be attached to instructions " into a grammar depicted in SourceLevelDebugging.html. I

...class name is there a way to a) check if that class is defined/locatable for inclusion b) convert the string to a Class object for the named class Ie, I''m trying to do: def setup @klass=class_under_test(self.class) end protected def class_under_test(klass) /([A-Z][a-z_]*)Test/.match(klass.to_s) $1 # <----- Now I have a string, not a Class, obviously # Of course I need a more complete alogrithm here, but I''d like to # to get the base case working first, do I need to use one of the # eval-type functions? end def assert_at...