search for: leq

Hi, When writing formulae in Rd files I use \leq to get a less-than-or-equal-to sign, as this is what the LaTeX references I consulted suggested. This works correctly for the PDF output (Rcmd Rd2dvi.sh --pdf), however when the Rd file is converted to text or html this command is converted to "<=q". A workaround is to use \le instead...

Hello, I'm fairly new to R and I can't work out how to produce a double inequality like (LaTeX) $0 \leq x \leq 1$ in the legend of a graph. If I try > legend(50, 0.1, legend = c(expression(0 <= x <= 1), c(2 <= x <= 3)), pch = c(1,1), col = c(2, 3)) then I get an error message "unexpected '<=' in ...". I've checked the help files for plotmath and expression, b...

Hello At the start of October, Duane Johnson announced the Query mixin plugin on this list. The code was attached to the announcement email. Unfortunately, I''ve not been able to locate the attached code. Goggle has not helped me this time. Could somebody forward it to me? Thanks in advance Harvey This e-mail has been scanned for all viruses by MessageLabs.

...omputing some numerical integrals on [0,oo). Define $$ M_j(x)=exp(-jax) $$ where $a=0.08$. We want to compute the $L^2([0,\infty))$-inner products $$ A_{ij}:=(M_i,M_j)=\int_0^\infty M_i(x)M_j(x)dx $$ Analytically we have $$ A_{ij}=1/(a(i+j)). $$ In the code below we compute the matrix $A_{i,j}$, $1\leq i,j\leq 5$, numerically and check against the known analytic values. When I run this code most components of A are correct, but some are zero. I get the following output: [1] "Dot products, analytic:"          [,1]     [,2]     [,3]     [,4]     [,5] [1,] 6.250000 4.166667 3.125000 2.50...

Here is a complete 104-line native code compiler for a tiny subset of OCaml that is expressive enough to compile an external Fibonacci program: type expr = | Int of int | Var of string | BinOp of [ `Add | `Sub | `Leq ] * expr * expr | If of expr * expr * expr | Apply of expr * expr type defn = | LetRec of string * string * expr open Camlp4.PreCast;; let expr = Gram.Entry.mk "expr" let defn = Gram.Entry.mk "defn" let prog = Gram.Entry.mk "defn" EXTEND Gram expr: [ [ &q...

Here's my translation of the Fibonacci example into OCaml: open Printf open Llvm let build_fib m = let fibf = define_function "fib" (function_type i32_type [| i32_type |]) m in let bb = builder_at_end (entry_block fibf) in let one = const_int i32_type 1 and two = const_int i32_type 2 in let argx = param fibf 0 in set_value_name "AnArg" argx; let

Hi, Can Someone inform me how to generate RV's using the below CDF, by inverse technique. Thanks for your help and time. My CDF is as follows \[ F(x)=0 \ \text{if} \ x < 0\]\[ F(x)=\{\frac{x-x_i}{x_{i+1}-x_{i}}*(p_{i+1}-p_{i})\}+p_{i}\ \forall \ x_{i}\leq x < x_{i+1} \] \[ F(x)=1 \ \text{if} \ x > x_{i+1} \] Regards Murthy

...omputing some numerical integrals on [0,oo). Define $$ M_j(x)=exp(-jax) $$ where $a=0.08$. We want to compute the $L^2([0,\infty))$-inner products $$ A_{ij}:=(M_i,M_j)=\int_0^\infty M_i(x)M_j(x)dx $$ Analytically we have $$ A_{ij}=1/(a(i+j)). $$ In the code below we compute the matrix $A_{i,j}$, $1\leq i,j\leq 5$, numerically and check against the known analytic values.   When I run this code most components of A are correct, but some are zero. I get the following output:   [1] "Dot products, analytic:"          [,1]     [,2]     [,3]     [,4]     [,5] [1,] 6.250000 4.166667 3.125000 2....

...d to walk through Australia, a total distance of 4000 km. His daily portion (mean) is 40km with an sd of 10 km. I want to calculate the number of days it takes to arrive with 80, 90, 95, 99% probability. I know how to do this manually, eg. for 95% $\Phi \left( \frac{4000-40n}{10 \sqrt{n}} \right) \leq 0.05$ find the z score... but how would I do this in R? Not qnorm(), but what is it? Thanks in advance, and apologies for the level of question... Rainer

Hello, I am looking into description of surf.ls(spatial) and see under value $beta - the coefficients. When I use polynomial of degree 2 to fit surface I expect to get 4 coefficients: z = a_1 x^2 + a_2 xy + a_3 y^2 + a_4 What do beta really stand for and why do I get $beta vector of length 6? Thakns, Mark

...n error or is it a feature? If it is a feature, could someone provide a reference for its two-tailed p-value computations? Using Blaker's (2000 - Canad. J. Statist 28: 783-798) approach,the p-value is the minimum of the two-tailed probabilities $P \left(Y\geq y_{obs}\right)$ and $P\left(Y\leq y_{obs}\right)$ plus an attainable probability in the other tail that is as close as possible to, but not greater than that one-tailed probability. Consider the following examples performed in R version 1.9 under windows 2000. > binom.test(110,500,.2) Exact binomial test data: 1...

Hi, I would like to know whether there exist algorithms to compute the coefficients or, at least, the degree of the minimal polynomial of a square matrix A (over the field of complex numbers)? I don't know whether this would require symbolic computation. If not, has any of the algorithms been implemented in R? Thanks very much, Ravi. P.S. Just for the sake of completeness, a

...ol(s.mat) ) new.freq[s.mat] <- freq[col(s.mat)[s.mat]] new.freq <- new.freq/ c( new.freq %*% rep( 1, ncol(s.mat) )) gives a matrix whose rows are the probability eights padded with zeroes and cum.freq <- apply(new.freq,1,cumsum) is the cumulative weight. leq.weight <- rep(runif(length(y)), ncol(s.mat) ) <= cum.freq which.2.sample <- leq.weight %*% rep(1, ncol(s.mat) ) I ***think*** which.2.sample indexes x as you require. If this is still too slow, I think the part from s.mat onward can be rendered in C with little trouble. In fact,...

...to actually perform it... True, but I'm not worried about that; method tables are easy to add once type substitutions are allowed. Dropping down to a mythical low-level language that I call template C, we would have: struct ComparableDict<T> { bool (*equals)(T a, T b); bool (*leq)(T a, T b); bool (*geq)(T a, T b); } T max<T>(ComparableDict<T>* dict, T a, T b) { if ((*dict->geq)(a,b)) return a; else return b; } This mechanism duplicates the dictionary-passing used in Haskell type classes. The correct dictionary for any given type is inferred by...

...True, but I'm not worried about that; method tables are easy to add once type > substitutions are allowed. Dropping down to a mythical low-level language > that I call template C, we would have: > > struct ComparableDict<T> { > bool (*equals)(T a, T b); > bool (*leq)(T a, T b); > bool (*geq)(T a, T b); > } > > T max<T>(ComparableDict<T>* dict, T a, T b) { > if ((*dict->geq)(a,b)) return a; else return b; > } > What do the parametrized types give you that you don't get from using opaque instead of T? Type check...

...wined3d: Add a trailing '\n' to a Wine trace. shell32: Standardize on the ShellExecuteEx() terminology. Assorted spelling tweaks and fixes. Fr?d?ric Delanoy (18): cmd/tests: Add tests for LSS comparison operator in "if" statements. cmd/tests: Add tests for LEQ comparison operator in "if" statements. cmd/tests: Add tests for EQU comparison operator in "if" statements. cmd/tests: Add tests for NEQ comparison operator in "if" statements. cmd/tests: Add tests for GEQ comparison operator in "if" statem...

...h tnmdnb. M`x dhpejrnp KHWMN b b`xel ophqsrqrbhh cnrnb ophmr| bqe dnjslemr{ B`xecn opedophrh on `jrs ophel`-oeped`wh. Opnakel{ q g`dnkfemmnqr|~ oeped a~dfernl lncsr b`q me bnkmnb`r|. Eqkh me qd`b`khq| a`k`mq{, rn l{ qdek`el h qd`dhl hu b HLMQ q`lh. Qrnhlnqr| sqksch - 400 dnk. Qpnj hqonkmemh - 1,5-2 leq. 2.Khjbhd`vh qkhmhel. Khjbhd`vh nqsyeqrbkerq qkhmhel B`xei thpl{ q opedophrhel, g`pechqrphpnb`mm{l b c. Rbep|, oph }rnl op`b` h nag`mmnqrh B`xei thpl{ oepeundr j bmnb| nap`gnb`mmnls ~phdhweqjnls khvs.Qrnhlnqr| sqksch - 550 dnk. Qpnj hqonkmemh - 5-7 leq. 3.Nthvh`k|m` khjbhd`vh. Khjbhd`vh ~phdhweqj...

...h tnmdnb. M`x dhpejrnp KHWMN b b`xel ophqsrqrbhh cnrnb ophmr| bqe dnjslemr{ B`xecn opedophrh on `jrs ophel`-oeped`wh. Opnakel{ q g`dnkfemmnqr|~ oeped a~dfernl lncsr b`q me bnkmnb`r|. Eqkh me qd`b`khq| a`k`mq{, rn l{ qdek`el h qd`dhl hu b HLMQ q`lh. Qrnhlnqr| sqksch - 400 dnk. Qpnj hqonkmemh - 1,5-2 leq. 2.Khjbhd`vh qkhmhel. Khjbhd`vh nqsyeqrbkerq qkhmhel B`xei thpl{ q opedophrhel, g`pechqrphpnb`mm{l b c. Rbep|, oph }rnl op`b` h nag`mmnqrh B`xei thpl{ oepeundr j bmnb| nap`gnb`mmnls ~phdhweqjnls khvs.Qrnhlnqr| sqksch - 550 dnk. Qpnj hqonkmemh - 5-7 leq. 3.Nthvh`k|m` khjbhd`vh. Khjbhd`vh ~phdhweqj...

...z&Jdj|m~JfN*rer!U at GI0H_@wzF<GKMxf$p at Pw(px5|jJO?JIxiyV#L at 9Dbu>!Y`w- z+W<k-LizjWWufrcqyShWy<Q97RJxc^1H&BVWFoi^wjsf-XKo95a|6hRm2}*EXg}0l zAq?E*BrP&5pAaKmzE7sa&(@JLvHbqk5fg_9=cE9*55A$Esb~7fqr2a|Y_Xjo2G9i0 z#>cW5C&Iggv29D-*9Ws$VlQ77zF~V*s8^h^@7;;_YLjn_dp79#Z{A~Leq{IZ<u?K& zt)g3q2$#LjZ?R}wFgP^l7d~-c1%kzb at C+}BHyg81aaSVu0pUGFuOd?HpCRElC}e&b z$azBWAJED|*6$j}y<*;Zi$ZuK31UPn%nv3bioRBvio*Z4;6BhRd-$H6_ALAWP5G<} z at BF5YD~h<i&<_?;AFQV9RHvWKH=*@;m_kOHDF&=Pmi#R6P3Zp0*jap;&*3+2dx<yA z*F^n|&y6?odnc*LZ-0z at Cp;yV2fAk9RhDAc6 a...