similar to: [LLVMdev] Publication at HotSwUp 2012

Hi all, Dear Dr. Wheeler, I am trying to use the lmPerm package to perform multiple regression on microarray data with certain empirical variables associated with treatments of the experiment. In order the circumvent the very conservative multiple test corrections such as Bonferroni and BH, I try to use permutated probabilities to assess associations. In addition to mu previous posting I

about tomato firmware... can I install it on a VMware virtual machine? tinc web ui is already included with the last tomato version? king regards, Cristiano. 2015-06-08 16:52 GMT-03:00 Lance Fredrickson <lancethepants at gmail.com>: > On 6/8/2015 11:55 AM, Cristiano Albiero Berni wrote: > > 2- Is there a kind of web interface to manager the server? >> > Tinc itself

Dear R users, I am mailing you about the graphical output of silhouette (cluster package) From the example of silhouette in help(silhouette): > ar <- agnes(ruspini) > si3 <- silhouette(cutree(ar, k = 5), # k = 4 gave the same as pam() above + daisy(ruspini)) > plot(si3, nmax = 80, cex.names = 0.5) from which one may conclude that group 1 is composed by

Hi, I have some questions about tinc. " *Automatic full mesh routing*Regardless of how you set up the tinc daemons to connect to each other, VPN traffic is always (if possible) sent directly to the destination, without going through intermediate hops. " 1- To have client to client direct connection and don't have traffic through the server should I have port forward at the NAT? Or

Does anyone know how to make a link redundancy? I have two ADSL lines, and i want the linux machine to be able to switch between the two lines everytime the first ADSL line goes down. Thanks a lot. Cristiano

Hi all. I have a simple question. Is that a way to limit the number os TCP or UDP connection of a single HOST in my network? For exemple: I have a host with IP 192.168.1.202 and he is using edonkey, Kazaa, and Bittorrent at the same time, and he also is infected by a virus that opens more than 500 TCP ports at the same time. So, i want to limit that host to be able to open no more then 30 TCP

Hello, This is my first post in this e-mail list and I hope it's enough to justify calling for help. In case it's not, sorry. I'm trying to do analysis and graphics using a factor as a criteria to split data and do the analysis/graphics for each subset of data. Right now what I'm trying to do is to fit and plot the following logistic model, according to a third variable named

Hi all. Im having a problem that is driving me crazy. I cant get link fail-over to work in my RedHat9 Linux. I have two ADSL lines exactly the same speed, and im doing NAT with the linux box. Whenever the first line (eth2 in my case) goes down, i run a bash script that i made to change the default route to the backup line (eth0). eth1 is my internal network. I want to be able to make the linux box

Dear All, A short-term (approx. 6-month) postdoctoral or scientific programmer position is available in a computational sciences project in Amsterdam. The title is dependent on experience. The starting date should be before the end of 2008, and applicants must be a citizen of a member state of the European Union. The ideal applicant would: o be an experienced R programmer o have experience in

A new package 'bvls' is available on CRAN. The package provides an R interface to the Stark-Parker algorithm for bounded-variable least squares (BVLS) that solves A x = b with the constraint l <= x <= u under least squares criteria, where l,x,u \in R^n, b \in R^m and A is an m \times n matrix. The Stark-Parker BVLS algorithm was published in Stark PB, Parker RL (1995).

A new package 'bvls' is available on CRAN. The package provides an R interface to the Stark-Parker algorithm for bounded-variable least squares (BVLS) that solves A x = b with the constraint l <= x <= u under least squares criteria, where l,x,u \in R^n, b \in R^m and A is an m \times n matrix. The Stark-Parker BVLS algorithm was published in Stark PB, Parker RL (1995).

Dear All, A new task view "ChemPhys" on chemometrics and computational physics is available on CRAN (http://cran.r-project.org/web/views/ChemPhys.html). It describes packages and functions that are of use in modeling chemical/physical systems. Suggestions and comments regarding this task view are welcome. If you think a new category, package or function should be added, please mail.

A new package 'nnls' is now available on CRAN. The package provides an R interface to the Lawson-Hanson NNLS algorithm for non-negative least squares that solves the least squares problem A x = b with the constraint x >= 0. The Lawson-Hanson NNLS algorithm was published in Lawson CL, Hanson RJ (1974). Solving Least Squares Problems. Prentice Hall, Englewood Cliffs, NJ. Lawson CL,

A new package 'nnls' is now available on CRAN. The package provides an R interface to the Lawson-Hanson NNLS algorithm for non-negative least squares that solves the least squares problem A x = b with the constraint x >= 0. The Lawson-Hanson NNLS algorithm was published in Lawson CL, Hanson RJ (1974). Solving Least Squares Problems. Prentice Hall, Englewood Cliffs, NJ. Lawson CL,

On 7 October 2006 at 15:44, Janno Tuulik wrote: | Hei Cristiano, | | Take a look at RKWard (http://rkward.sourceforge.net) I would not (yet ?) recommend RKWard as it is in very stages and has fairly incomplete coverage of R. | (http://rosuda.org/JGR/). Unfortunately, I have never tried to install those | on sarge. The excellent JGR is a very good choice. As Janno said, it may be tricky on

**** CALL FOR PAPERS **** The 23nd International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC-2014) Vancouver, Canada - June 23-27, 2014 http://www.hpdc.org/2014 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is the

**** CALL FOR PAPERS **** The 22nd International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC'13) New York City, USA - June 17-21, 2013 http://www.hpdc.org/2013 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is the premier

**** CALL FOR PAPERS **** The 23nd International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC-2014) Vancouver, Canada - June 23-27, 2014 http://www.hpdc.org/2014 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is the

**** CALL FOR PAPERS **** The 22nd International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC'13) New York City, USA - June 17-21, 2013 http://www.hpdc.org/2013 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is the premier

**** CALL FOR PAPERS **** The 22nd International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC'13) New York City, USA - June 17-21, 2013 http://www.hpdc.org/2013 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is the premier