Displaying 20 results from an estimated 853 matches for "subtree".
2002 Feb 08
0
packages for extracting subtrees
...ppy to get suggestions for improvements (including any
examples that it breaks down on).
Regards,
Matthew Wiener
Applied Computer Science and Mathematics Department
Merck Research Labs
Rahway, NJ 07065-0900
732-594-5303
-----------------------------------------
First the two functions: f.get.subtrees is really just a shell to loop
through f.make.subtree. (After the functions there's a .Rd file.)
"f.get.subtrees" <-
function(tree, k = NULL, h = NULL,
add.element = NULL){
## tree is a tree, k and h are as in cutree.
## additional elements is the name of any...
2017 Sep 09
1
error with subtree()
Dear R community,
I would like to plot a partial hclust output, so I?am looking for a subtree function that would return an tree structure I can plot.
I ran the test code of subtree following the instruction on?http://finzi.psych.upenn.edu/library/extracat/html/subtree.html
However, an error message popped up:
====> library(extracat)
Attaching package: ?extracat?
The following object is...
2002 Feb 11
0
fixing a problem in the subtree code
Hi, all. Last week I posted some code for extracting subtrees of trees in
hclust format. Petra Steiner quickly found an example for which the code
breaks, and sent it to me.
The problem seems to be that I had not considered the possibility of trees
with unlabeled nodes. In the new version of f.make.subtree (below), I steal
some code from plot.hclust to as...
2002 Jul 19
2
Plotting a section of a dendrogram
...clust (Ward's method) on a
> database of 800 samples. As you may imagine the full dendrogram is not
> really readable. I have obtained groups with cutree. I would like to
plot
> sub-sections of my big dendrogram to show group 1, group 2 and so on.
I don't think R has anything like subtree in Splus, unfortunately. I
think what has been recommended in the past is to create a very large
format plot (using a large paper size in pdf(), for example) and then
zoom in to look at subtrees.
-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-
r-help mailing list -...
2002 Mar 05
1
no labels when plotting dendrograms
I'd like to be able to cut dendrograms at a height I specify
and then plot the resulting subtrees. I wanted to use the
dendrogram object for this purpose because there doesn't seem
to be a canned way to cut a hclust object and get a list of
hclust objects, but there is a function (cut) that does that
for dendrograms. The problem I'm having is that when I plot
a dendrogram, I can'...
2009 Oct 06
1
can a .rsync-filter improve performance?
Hi,
I know certain subtrees I want to backup are written once
and never deleted.
So to reduce the time it takes rsync to run, I was thinking
of putting the following .rsync-filter in each of these subtrees:
P /**
I can see this stops the files on the receiver side from being
deleted.
Does this filter also improve perfor...
2007 Jun 12
2
LDAP subtree search on AD
...ar/run/dovecot/auth-master
mode: 384
user: vmail
group: vmail
/etc/dovecot/dovecot-ldap.conf
hosts = 192.168.0.11
dn = cn=dovecot,cn=Users,dc=tecnicopias01,dc=com,dc=br
dnpass = password
ldap_version = 3
auth_bind = yes
base = DC=tecnicopias01,DC=com,DC=br
deref = never
scope = subtree
user_attrs = info=mail
user_filter = (&(objectClass=organizationalPerson)(sAMAccountName=%u))
user_global_uid = 5000
user_global_gid = 5000
I can authenticate using pam+krb5 with success, but when I try to make a
userdb search to get maillocation for the authenticated user, I get in
trouble. T...
2014 Dec 16
3
[LLVMdev] Lowering switch statements with PGO
> On Mon, Dec 15, 2014 at 2:26 PM, Chad Rosier <mcrosier at codeaurora.org>
> wrote:
>>
>> > On Mon, Dec 15, 2014 at 9:57 AM, Chad Rosier <mcrosier at codeaurora.org>
>> > wrote:
>> >> All,
>> >> About two months ago I posted a patch that hoisted the hottest case
>> >> statement from a switch statement during
2009 Oct 29
2
[LLVMdev] Any objections to removing 'win32/...' subtree from LLVM?
FYI, I'll plan on removing this subtree on Monday of next week if no
one else chimes in requesting a reprieve...
On Wed, Oct 28, 2009 at 5:59 PM, PyLLVM <pyllvm at gmail.com> wrote:
> No objection.
> I'm studying LLVM on Win32 using visual studio.
> CMake works well for it.
>
>
> On Oct 26, 7:44 am, Chandler...
2011 Nov 14
0
[LLVMdev] [Git] Introduction of llvm-project-subtree.git
Hello guys,
I made the "subtree" all-in-one LLVM, clang, dragonegg &c repository.
https://github.com/chapuni/llvm-project
* How to play
1) git clone git://github.com/chapuni/llvm-project.git
2) (Optional) Add the line in [remote "origin"], .git/config
[remote "origin"]
fetch = +re...
2014 Dec 23
2
[LLVMdev] Lowering switch statements with PGO
...ffman tree, propagate various
> information up the tree as you build it. Then you can very easily start at
> the top of the huffman tree and have all this information available to you
> (e.g. "peel off the most probable cases until the relative probabilty has
> some relation to the subtree case density").
>
> On the other hand (more likely), you could keep the cases ordered (i.e.
> not a Huffman tree) and integrate the branch probability info as the extra
> data propagated up the tree (along with other stuff); e.g. the max
> probability of any node in the subtree,...
2005 Oct 23
1
Coloring leaves, twigs and labels in plot.dendrogram()
...xlab = "", ylab = "", xaxt = "n", yaxt = "s", horiz = FALSE,
frame.plot = FALSE, twig.col = NULL, lab.col = NULL, leaf.col = NULL,
...){
############################## 80 Characters Wide
##############################
plotNode <- function (x1, x2, subtree, type, center, leaflab, dLeaf,
nodePar,
edgePar, horiz = FALSE, leafcounter = leafcounter, ...)
{
#cat('.') uncomment this for debugging...
inner <- !is.leaf(subtree) && x1 != x2
yTop <- attr(subtree, "height")
bx <- plotNodeLimit(x1, x2, subtr...
2009 Nov 06
0
[LLVMdev] Any objections to removing 'win32/...' subtree from LLVM?
Chandler Carruth <chandlerc at google.com> writes:
> FYI, I'll plan on removing this subtree on Monday of next week if no
> one else chimes in requesting a reprieve...
The Visual C++ project files are still there.
Anyone objected by private e-mail? Can we know the reasons just in case
we can enhance the cmake build on accordance? In the past, the only
reason for not removing win32/ wa...
2016 Jul 22
2
[RFC] One or many git repositories?
...more productive solution anyway, and make more sense for cross-cutting changes.
>
> And sorry to throw another option into the ring; and one that might already have been discussed and discounted, but thought it worth sharing.
>
> 1) Create a new llvm-project-mono repo
> 2) Use git subtree instead of git submodule to add all the directories to match the layout of llvm-project.
> 3) From now on, all commits go to the monorepo
> 4) monorepo commits can be projected to the individual project repos, and additionally a new commit on llvm-project can be made with the submodule versio...
2002 Jan 13
1
changing the ordering of leaves in a dendrogram
I'd like to change the way plot.hclust displays an hclust object. Here's
a description of how it's done now, from the R documentation of hclust:
In hierarchical cluster displays, a decision is needed at each merge
to specify which subtree should go on the left and which on the right.
Since, for n observations there are n-1 merges, there are 2^{(n-1)}
possible orderings for the leaves in a cluster tree, or dendrogram.
The algorithm used in hclust is to order the subtree so that the
tighter cluster is on the left (...
2009 Nov 07
1
[LLVMdev] Any objections to removing 'win32/...' subtree from LLVM?
On Nov 6, 2009, at 9:10 AM, Óscar Fuentes wrote:
> Chandler Carruth <chandlerc at google.com> writes:
>
>> FYI, I'll plan on removing this subtree on Monday of next week if no
>> one else chimes in requesting a reprieve...
>
> The Visual C++ project files are still there.
>
> Anyone objected by private e-mail? Can we know the reasons just in
> case
> we can enhance the cmake build on accordance? In the past, the only...
2003 Jan 19
0
Rearranging subtrees and Eisen Cluster
...eciate if someone could take the time to test the
function as I only had time to test on a few datasets. Any feed back is
much appreciated. The function is called ecluster.fn and I have also
attached a simple example on how to use it.
So far my code works (attached) fine. The only problem is that subtree
are ordered in terms of the 'tightest' leftmost (according to the
details section of hclust) . So sometimes I have blocks of red, green
and then red (again) although the branches can be mannually reorder ed
so that most of the reds are to one side and most of the reds. This gets
a bit more...
2013 Feb 12
1
dsync 2.1.10 does not correctly handle renames of mailbox subtrees
Hi,
It seems that dsync 2.1.10 does not correctly handle renames of mailbox
subtrees. The scenario is as follows.
There are two servers, A and B, both running dovecot 2.1.10 and configured
to use mdbox. Automatic replication between them is disabled, ie.
replication plugin is not active and replicator service
has process_min_avail = 0. I perform the following actions:
1. On A: d...
2019 Nov 15
5
MLIR landing in the monorepo
...oject (Re:
http://lists.llvm.org/pipermail/llvm-dev/2019-October/135687.html ).
We're aiming to integrate into the monorepo next month. Right now our
intent is for MLIR to live in a top-level directory in parallel to clang,
lldb, lld, etc.
Our top option for the integration is to perform a git subtree merge to
bring the MLIR history into the monorepo, here is a prototype:
https://github.com/joker-eph/llvm-project-with-mlir
If you're curious to try it, at the moment it needs a specific CMake
invocation:
cmake -G Ninja ../llvm/ -DLLVM_TARGETS_TO_BUILD="host"
-DLLVM_EXTERNAL_PROJECT...
2011 Jul 21
0
[LLVMdev] git
On Wed, Jul 20, 2011 at 9:32 PM, Chris Lattner <clattner at apple.com> wrote:
> On Jul 20, 2011, at 11:47 AM, Jakob Stoklund Olesen wrote:
>
> >>> If you can work with Jeffrey to come up with better instructions, that
> would be great.
> >>>
> >>> Just make sure they are newbie-proof.
> >>
> >> Wouldn't it be easier at some