search for: mutualize

Displaying 20 results from an estimated 1451 matches for "mutualize".

Did you mean: mutualism
2007 Oct 04
2
bnlearn package compilation failure on MacOSX
Hi all. I've recently uploaded a package (bnlearn) to CRAN. It builds fine on both Linux (32 and 64 bit) and Windows, but fails on MacOSX ix86 because of C90 vs C99 issues: http://www.r-project.org/nosvn/R.check/r-patched-macosx-ix86/bnlearn-00install.html Since I've no MacOSX machine at hand, I would like to ask you: why is C99 not the default for gcc on MacOSX ix86? Is it safe to
2006 Apr 20
1
Mutually Orthogonal Latin Squares
Hi all, The package crossdes could contruct a complete sets of mutually orthogonal latin squares. The construction works for prime powers only. I hope to know whether there is a way to construct a mutually orthogonal Lation square for 10 or other numbers that could not be prime powers. Thanks for any suggestions. Best wishes, Jinsong Zhao
2012 Feb 13
1
entropy package: how to compute mutual information?
suppose I have two factor vectors: x <- as.factor(c("a","b","a","c","b","c")) y <- as.factor(c("b","a","a","c","c","b")) I can compute their entropies: entropy(table(x)) [1] 1.098612 using library(entropy) but it is not clear how to compute their mutual information
2006 Mar 31
1
mutual information for two time series
Hi I hope this is going to the right place. I am trying to write a program which uses KernSmooth library to estimate mutual information between two time series at various different lags. At the moment it’s producing negative values, which is supposed to be impossible (something is fishy). I am summing across one row of the matrix to get p(value is in bin x) and summing across the columns to get
2012 Jan 13
1
[PATCH] libxl: fix parse_backend_path and device_backend_path to be mutual
# HG changeset patch # User Roger Pau Monne <roger.pau@entel.upc.edu> # Date 1326454799 -3600 # Node ID 58c924a72ab7af658a888ff39411229a9e6a12f6 # Parent 887a3229fd7a50c04981e29709bc7210dafef38f libxl: fix parse_backend_path and device_backend_path to be mutual Currently if libxl__parse_backend_path is used and then you try to get the original path again with libxl__device_backend_path the
2018 Oct 11
2
no mutual signature algorithm with RSA user certs client 7.8, server 7.4
On Thu, Oct 11, 2018 at 10:41 AM Damien Miller <djm at mindrot.org> wrote: > On Wed, 10 Oct 2018, Adam Eijdenberg wrote: > > We see this error on the client side: > > > > debug1: kex_input_ext_info: server-sig-algs=<rsa-sha2-256,rsa-sha2-512> > > ... > > debug1: Offering public key: RSA-CERT SHA256:xxx /path/to/key > > debug1: send_pubkey_test: no
2005 Dec 09
1
Hierarchical Clustering Using Mutual Information
Dear R-helpers, Is there somebody who knows if R has already a build in function for Hierarchical Clustering which uses Mutual Information as proximity measure? Many thanks and best regards, J. --------------------------------- [[alternative HTML version deleted]]
2008 Apr 21
2
Mutually exclusive Exim setup instructions
The correct way has to be one or the other: http://wiki.dovecot.org/LDA/Exim are mutually exclusive with http://wiki.dovecot.org/HowTo/DebianStable It appears that exim can either call dovecot's LDA or make the delivery itself. There may be good reasons to do it one way or the other. ---------------------------------------------------------------- Karl Schmidt
2001 Mar 01
1
[OT] correspondence analysis w/ non-mutually-exclusive categories
Greetings, again. This is not strictly an R question, so please feel free to ignore it if you like. My question is about the substance of correspondence analysis. Specifically, is it appropriate to use ca on a matrix of values such that the columns and/or rows are not mutually exclusive? To be more detailed: - The standard use of ca is illustrated in the example of corresp() (from MASS):
2001 Mar 02
0
[OT] correspondence analysis w/ non-mutually-exclusive ca tegories
Andy, Take a look at Greenacre, Theory and Applications of Correspondence Analysis. He has many example of dealing with all sorts of data. Basically, the technique is relevant for 2-way tables -- MCA is an extenstion. It is not clear in your example whether CA is really appropriate -- you want to make an observation (if at all possible) fall in one cell, treating the others layers as
2010 Jan 04
3
[LLVMdev] Tail Call Optimisation
On 04/01/2010, at 3:01 PM, Jon Harrop wrote: > On Monday 04 January 2010 01:12:55 Simon Harris wrote: >> I'm investigating "improving" the TCO facilities in LLVM to provide for >> "hard" tail calls. Specifically, this would involve extending the existing >> implementation to discard the stack frame for the caller before executing >> the callee. I
2018 Oct 10
2
no mutual signature algorithm with RSA user certs client 7.8, server 7.4
Hi, One of our users who is running an OS (I think it's the latest beta macOS 10.14.1) with ssh version "OpenSSH_7.8p1, LibreSSL 2.7.3" is unable to use our user SSH RSA certificates to authenticate to our servers (which are running "OpenSSH_7.4p1, OpenSSL 1.0.2k-fips 26 Jan 2017"). We see this error on the client side: debug1: kex_input_ext_info:
2010 Jan 04
0
[LLVMdev] Tail Call Optimisation
On Monday 04 January 2010 03:33:06 Simon Harris wrote: > On 04/01/2010, at 3:01 PM, Jon Harrop wrote: > > I am certainly interested in tail calls because my HLVM project relies > > upon LLVM's tail call elimination. However, I do not understand what tail > > calls LLVM is not currently eliminating that you plan to eliminate? > > Mutual recursion for a start: >
2004 Aug 20
0
Mutual information
Greetings, I wish to know if any R package contains a function to calculate the mutual information statistic. I already searched the site, but came with my hands empty. Can anybody help me here? Thanks, Gabriel Erbano
2007 Nov 23
0
Mutual information
Dear R helpers, I have a data frame > summary(emPat) pairE subj pattern far-near : 18 sub1 : 37 urb :123 long-short : 18 sub2 : 37 bpb : 72 supported-unsupported: 18 sub3 : 37 prp : 67 large-small : 18 sub4 : 37 brb : 64 dense-sparse : 18 sub5 : 37 unp : 62
2018 Oct 11
3
no mutual signature algorithm with RSA user certs client 7.8, server 7.4
On Thu, 11 Oct 2018, Damien Miller wrote: > On Thu, 11 Oct 2018, Adam Eijdenberg wrote: > > > Thanks for looking into. I wasn't able to get the patch to apply > > cleanly to the portable source for whatever reason, so I manually made > > the changes and got a little further. I now get past the "no mutual > > signature algorithm" client message, and get
2006 Aug 15
2
Are form_remote_tag and submit_to_remote mutually exclusive?
Do I need to use submit_to_remote in conjunction with or instead of form_remote_tag? The description in the API docs. is confusing. Is the combination of form_tag/submit_to_remote valid? Is the combination of from_remote_tag/submit_tag valid? Thanks, Wes -- Posted via http://www.ruby-forum.com/.
2017 Feb 03
0
Dovecot, Postfix, and SASL AUTH EXTERNAL
Hey folks, I've been using the ever popular Dovecot and Postfix combo for years. A while back I also introduced mutual TLS for mail clients to Dovecot and Postfix. I achieved this by a custom checkpassword script and SASL AUTH EXTERNAL for IMAP. This all worked great with clients like Thunderbird, which can be configured to use mutual TLS and SASL EXTERNAL for IMAP, and mutual TLS with no
2019 May 16
1
Mutual auth and MS Outlook
I am trying to get Dovecot IMAP and Outlook to talk to each other with SSL and client certificates enabled. In Dovecot, I have the following options enabled: ssl_ca = ... ssl_verify_client_cert = yes auth_ssl_require_client_cert = yes auth_ssl_username_from_cert = yes when I try to connect with Outlook, I get: May 12 08:07:50 mail dovecot: imap-login: Disconnected (client didn't
2006 Mar 28
1
hybridHclust (new package)
I'd like to announce the availability of a new library for hybrid hierarchical clustering, "hybridHclust". The library has been uploaded to CRAN and is now available. The library implements a hybrid of top-down and bottom-up hierarchical clustering. Along the way, the idea of a "mutual cluster" is developed. A mutual cluster is a set of observations whose largest