similar to: getting "diff" of directory trees

What I'm trying to do: upload files from my local machine to an rsync server running on a remote host. What I don't know: syntax on how to do this. I initially set the conf file so that I could download from the remote machine to my local machine, the syntax: rsync -azv --delete rsync://user@remote.machine.com:12923:blah destdir This worked fine. So then, I wanted to go the other

We have a Windows 2000 PDC (domain name: DOM1) and a Windows 2000 CIFS fileserver (\\winfs) that we are migrating over to Samba (domain name: DOM2). Without turning off anything on the Windows boxes, I created a new PDC for the Samba server. I also created shares on this Samba server that closely match (same share name mounted off same NetApp backend) the Windows fileserver (e.g. \\winfs\share is

I have a Microsoft Windows 2000 SP4 PDC (AD backend) that I'd like to replace with Samba. The docs on samba.org are a bit confusing though, here is an excerpt from Chapter 4, "Domain Controller Types": Samba-3 servers can readily be converted to and from domain controller roles through simple changes to the smb.conf file. Samba-3 is capable of acting fully as a native

Hi, The leakage problem you describe is very, very common and you will need to do something to address it. I modified the version of Speex I use to implement an adjustable max gain. If you look at speex_compute_agc in preprocess.c, you will see: if (agc_gain>200) agc_gain = 200; This max of 200 is usually more than enough to amplify leakage which occurs either in the sound

Hello, I''m experiencing some odd behavior with a sortable tree when I try to add an element using javascript via rjs. What''s strange is that things work fine if I have moved any item on the list prior to adding a new element but produce odd results if I haven''t. My tree is a normal nested group of ul''s and I have the call to Sortable.create in a partial so

I''ve added the sortable tree patch from Sammi to the script.aculo.us trunk-- please help testing it! Besides testing the sortable trees itself, reports about any side effects on draggables or standard sortables are more than welcome. Kudos to Sammi for the elaborate patch and the great new functionality it brings to script.aculo.us! -Thomas

Dear R, Short verse of the question: Is there R code which will calculate surrogate splits and/or delta impurity for decision trees at each node? Long Version: I have local, legacy code which I use to calculate my decision trees. I would like to switch to R, but as I understand it surrogate splits are not implemented. Surrogate splits and feature ranking are described in Breiman et al

Hi All, I need to access the node informations (viz. child nodes, split variable, split criterion etc.) for different trees packages like, CHAID, rpart, party etc. Is there an in-built function which I can use to get the requied info? Thanks a lot in advance!! Regards Ashish Kumar [[alternative HTML version deleted]]

Dear Dr. Fieberg, you used a regression tree approach to explore ordinal data set in addition to the proportinal odds model. I find this very interesting. I would like to know, how good the results of the regression tree approach turned out in comparison to the proportional odds model. Since people very often treat ordinal data as continuous, I would like to know how successfull this strategy

Hi, I'm using the package randomForest to generate a classifier for the exemplary iris data set: data(iris) iris.rf<-randomForest(Species~.,iris) Is it possible to print all decision trees in the generated forest? If so, can the trees be also written to disk? What I actually need is to translate the decision trees in a random forest into equivalent C++ if-then-else constructs to

Hi all, I want to calculate distances between phylogenetic trees. I found functions for symmetric difference (e.g. in ape and in some other packages). In addition to this I also want to calculate quartets and nearest neighbor interchange distances; are there any functions for this? My apologies if they exist and I overlooked. best regards

Hello, I have a question concerning decision trees coming from RWeka : library(RWeka) m =J48(Species~.,data=iris) How could such a decision tree be transferred into a matrix, pretty much in the same fashion, as it is done by getTree() in library(ofw) library(ofw) data(srbct) attach(srbct) ##ofwCART learn.cart.keep <- ofw(srbct,

Hi, I am working with CART regression now to predict a probability; the response is binary. Could anyone tell me in which cases it is better to use mean square error for splitting nodes and when mean absolute error should be preferred. I am now using the default (MSE) version and I can see that the obtained optimal tree is very different from the tree with the least mean absolute error. Thanks in

Hi, I need to find all minimum spanning trees of an unweighted graph. Is there a way in R to do that? Thanks -- View this message in context: http://n4.nabble.com/Minimum-Spanning-Trees-tp1569351p1569351.html Sent from the R help mailing list archive at Nabble.com.

Has anyone any experience of applying observational weights in bagging? I am performing regression trees (continuous data on bird abundance) and need to account for sampling intensity. In a single tree, i.e. a call of rpart, I can specify weights either by having a separate vector called weights, or by a variable called weights in the dataframe under analysis. Both produce sensible (and identical)

Hi, while working with decision trees and unbalanced data, I came across the use of the Hellinger distance as an alternative to information gain [1,2], when dealing with skewed data. Does anybody know of R implementations of this approach to decision trees? Thanks, [1] http://www.cse.nd.edu/Reports/2008/TR-2008-06.pdf [2] http://csmr.ca.sandia.gov/~wpk/slides/wdmda-sem.pdf -- Rajarshi Guha NIH

Hi, Can anyone tell me if they know of any functions written for regression trees with a longitudinal dataset. I've got tree, rpart and maptree, but these all seem to be for univariate responses. Thanks for your time, Cath -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send

Dear All When drawing a classification tree with plot(mytree) text(mytree) the conditions are written just before the nodes branch. My question is: can one be certain that those conditions refer to the left-side branches? (The R documentation surprisingly lacks the information that I am asking for.) Thanks in advance, Paul

Hi, I wish to build consensus groups/tree from a set of bootstraps from a clustering algorithm such as hc or k-means, but can't find an R-function that does this. Does anyone know of an R procedure/function which allows one to build such consensus groups/tree .? Many thanks, Andrew ******************************************************************* Dr Andrew E Teschendorff Hutchison/MRC

Dear all, I would like to ask you the following: I have data about different manuscripts, together with data about the presence/absence of copying errors, in the days when manuscript were really manuscripts. I would ideally like to use the data to draw a phylogenetic tree, so that I can infer which ms was copied from which. The error presence/absence is coded in binary format. The plan is to use