similar to: ?OT: Probabilistic Simulation

esteeming Coiled tubing units are so compact and have such great potential, the Mars Drilling Project is evaluating a coiled tubing unit to drill for water on Mars. fells disseverance SPRING, TX--(MARKET WIRE)-- Coil Tubing Technology, Inc. (CTBG) announces the delivery of the first group of 8 Rotating Tools to oil and gas well service companies operating in Mexico and Oklahoma. Designed for use

I have a samba server configured at a clients office and sometimes when he is drilling down into directories in his "File Explorer" it stalls. I tail'ed the log files and I ran tcpdump, but I can't see anything that stands out. What should I look at? I am running Samba Version 2.2.3a-12.3 for Debian. brian -- Brian Lavender http://www.brie.com/brian/

Dear All, I am quite new to R and am having a problem trying to run a linear model with random effects/ a regression- with particular regard to my variable lengths being different and the models refusing to compute any further. The codes I have been using are as follows: vc<-read.table("P:\\R\\Testvcomp10.txt",header=T) >> attach(vc) > > family<-factor(family) >

Has anyone seen any attempts to give Markdown a PEG (parsing expressions grammar) recognizable by some ruby PEG parser generator grammar like Treetop? http://treetop.rubyforge.org/

Dear fellow Markdown enthusiasts, As you all might know, Markdown is a highly context sensitive language that the (often regex-based) syntax highlighting mechanisms in existing editors struggle to keep up with. I have taken John MacFarlane's excellent peg-markdown compiler and modified its parser to function as an interpreter for syntax highlighting purposes. The end result is a

Hello OvermindDL1, We are implementing an extensible language. That's one where you can add commands and constructs to the language without having to recompile the parser. We want compilation of the parser in order to "freeze" it but only as an option. One goal is to eventually get the macro functions of our language to the point where they are equivalent to the template

Hi all - I am NEW to R and NEW to any type of programming. I am making heatmaps using the heatmap.2 function within gplots package. At present, when the heatmap is plotted it uses the row identifiers as 1,2,3,4...etc. However, I much rather use my own labels. I was told my another well-versed R programmer to use the follow script: x<-as.matrix(test1[,-1]) ## skip column 1 rownames(x)<-

Dear List, I thought it would be much easier to put a second query into a second mail. I need to print 426*10000 blocks of variance components data, where 426 is the number of columns of data that have 10000 permutations of variance generated for each of them. I have tried printing out a smaller number of permutations for a smaller number of markers and that has worked. However, since a

There's been a lot of discussion on this list about creating a formal grammar for markdown. I had a go at writing a [parsing expression grammar] for markdown. I used Haskell and John Meacham's Frisby PEG parsing library, but it should not be too hard to port the grammar to PEG libraries in other languages. [parsing expression grammar]:

Hi, I'm working on a classification problem and one of the methods I'd like to use are neural networks. I've been using nnet to build a classification network. However I would like to have the probabilities associated with the prediction. Are there any implementations of probabilistic neural networks available in R? thanks,

Hello everybody, I don't quite understand how the proposed regex library works but I know that PEG parser generators use a super-set of regex functionality to define their parsers. There's also a nice one on Google code called YARDparser that uses templates based on PEGs to generate efficient recursive-decent parsers. Furthermore, my partner and I am working on an interpreter for PEG

I've just uploaded an implementation of markdown in C. It defines the syntax using a PEG grammar, so it should be easy to extend and modify. Right now it can produce output in either HTML or LaTeX, but it would be simple to add other output formats. It's very fast: on my machine, it converts a 178K markdown file in 0.14 seconds (vs. 9.6 seconds for the latest Markdown.pl and 0.57 seconds

On 10/13/2017 10:19 AM, Anand Buddhdev wrote: > .. > Stop trying to force a square peg into a round hole. Whee, I just _know_ I'm going to be positively skewered (and maybe even plonked!) for this.... but, hey, it's Friday, and this post is meant to be a bit funny.? So lighten up, and enjoy a short read. obHumor: I actually have a piece of furniture (a small table) with square

Here is another implementation of Markdown, this time in c++ using the Boost Spirit library. Spirit Markdown is written in (hopefully!) idiomatic modern c++ and a full suite of unit tests are provided. It is licensed under the Boost Software License (OSI compliant). The purpose of writing this is: * for me to gain expertise in the use of Spirit, both through direct experience and public review,

Hi all, public-inbox allows searching for git blob names (e.g. "badc0ffee") in patches. Initially, I chose to use add_prefix for probabilistic terms, since I assumed it could be a superset of what boolean searching offered. Unfortunately, it doesn't seem to be the case because stemming is interfering. So switching to boolean filtering seems to work; and it is fine for mechanical

Hi I have two processes which take with a certain probability (p1 and p2) x number of years to complete (age1 and age2). As soon as thge first process is completed, the second one begins. I want to calculate the time it takes for the both processes to be completed. I have the following script which gives me the answer, butI think there must be a more elegant way of doing the calculations

On 12/04/2024 8:15 a.m., Iago Gin? V?zquez wrote: > Hi all, I am trying to debug an error of a function g defined and used inside another function f of a package. > So I have > > f <- function(whatever){ > ... > g <- function(whatever2){ > ... > } > ... > } > > If I wanted to debug some thing directly inside f I would do debug(f).

Dear R users, I am trying to fit an lmer model with only random effects which is giving me the following error: Error : length(f1) == length(f2) is not TRUE In addition: Warning messages: 1: In P1L55:family : numerical expression has 390 elements: only the first used 2: In P1L55:family : numerical expression has 390 elements: only the first used I am trying to extract variance components

john said: > Have you considered using a PEG instead of regexes? for all you home-schooled and self-taught programmers for whom "peg" is far too computer-sciencey for comfort, consider as an alternative the simple methodology i use... i split the text-file on blank lines and place it in an array. that is first-cut for my light-markup format, a.k.a., "zml" -- zen

On Mon, Aug 31, 2009 at 6:23 PM, Samuel Crow<samuraileumas at yahoo.com> wrote: > If you're wondering why we're doing an interpreted PEG parser generator rather than Boost Spirit 2.x, it's because we need it to be easier to debug the parser.  Once the parser is debugged it can be fed into a compiled parser generator and "frozen" into stand-alone parser code. You do