similar to: Package for PAV and MPAV algorithms

Dear Security Team, Ports/japanese/samba is updated to ja-samba-2.2.12-j1.0beta1, which fixes CAN-2004-1154. Please update the portaudit database. >>>>> In <200505242242.j4OMglSA099193@repoman.freebsd.org> >>>>> Pav Lucistnik <pav@FreeBSD.org> wrote: > pav 2005-05-24 22:42:47 UTC > FreeBSD ports repository > Modified files: >

I have the following function for which I need to find the root of a: f <- function(R,a,c,q) sum((1 - (1-R)^a)^(1/a)) - c * q To give context for the problem, this is a psychometric issue where R is a vector denoting the percentage of students scoring correct on test item i in class j, c is the proportion correct on the test by student k, and q is the number of items on the test in total. I

Peter- I am working on developing a system to perform network boot and automated system installs of many systems, and I would like to use PXE. New systems would boot via PXE, then directed to special images that partition, format and install the server. Upon reboot, the system would boot off of local disk. Do you know of any resources, or of anyone that has begun to develop an infrastructure

Hi experts, I want to read data from an excel data like this: for the fifth column, from first row until 140 but only 1,3,5,7,.....139 (only 70 values), How can I do it in R? thanks [[alternative HTML version deleted]]

Dear all, at the following address http://linaria.dst.unive.it/~claudio/R/Rmaterial.html#ga you can download a package to build simple genetic algorithms. I wrote this package to introduce genetic algorithms to student in labs, which means, the package emphasize "how a ga works" instead of "how fast it could be". Please, let me know any comments or suggestions, Bests,

Hi all, I have played a bit with the "reshape" package and function along with "melt" and "cast", but I feel I still don't have a good handle on how to use them efficiently. Below I have included a application of "reshape" that is rather clunky and I'm hoping someone can offer advice on how to use reshape (or melt/cast) more efficiently. #For this

mcga 1.1 (machine coded genetic algorithms) package implements a genetic algorithm optimisation tool with machine coded chromosomes. The machine coded chromosomes stand for chromosomes that are not decoded and encoded. The byte representation of 'double' type variables are crossed-over and mutated. This is different from the binary coded and real coded genetic algorithms. Linux and

mcga 1.1 (machine coded genetic algorithms) package implements a genetic algorithm optimisation tool with machine coded chromosomes. The machine coded chromosomes stand for chromosomes that are not decoded and encoded. The byte representation of 'double' type variables are crossed-over and mutated. This is different from the binary coded and real coded genetic algorithms. Linux and

Hi- I'm wrestling with some of my data apparently not being called into a GLM or an LM. I'm looking at factors affecting fish annual catch rates (ie. CPUE) over 30 years. Two of the factors I'm using are sea surface temperature and sea surface temperature anomaly. A small sample of my data is below: CPUE Year Vessel_ID Base_Port Boat_Lgth Planing SST Anomaly 0.127

Full_Name: Michael W. Grant Version: 1.7.1(2003-06-16) OS: Windows 98 Second Edition 4.10.2222 A Submission from: (NULL) (24.55.165.101) I just installed version 1.7.1 tonight. In the process I installed via CRAN from the menu several packages. One installation, exactRankTests, had a distinct anomaly. A DLL attempt to change FPU control word as seem in the last line of the following listing:

Hi. I have a problem with the default behavior of seq(), which gives the argument "from" when the argument length.out = 1. This behavior is annoying when the number of value determine in length.out is not predictable. Would it be possible to add an argument that propose the median/mean, i.e. (from + to) / 2 when length.out = 1 ? Examples: > seq(from = 1, to = 11, length.out=1) #

Greetings- a reviewer for a paper of mine noted an anomaly in some models I ran using glmmPQL (from the MASS package). Specifically, the models are three-level hierarchical probit models estimated using PQL under R. The anomaly is that the log-likelihoods decrease (or, alternatively -2logLik increases) as variables are added to the null model. This is unusual, and I'm trying to figure out

Dear R-listers, I am building a prediction model starting with many, many variables. I use the 'stepAIC' procedure in the MASS package, and the model building process takes several hours to complete. At the very end, I am occasionally confronted with warnings like this one: Warning messages: 1: In fitter(X, Y, strata = Strata, offset = offset, weights = weights, : Loglik converged

Hi, according to RFC 4253 https://www.rfc-editor.org/rfc/rfc4253#section-7.1 for the selection of algorithms (ciphers, KEX, MAC etc.), the leftmost matching client algorithm is picked. While this is fine in most cases, there are cases where it is not desirable, for example: 1) for compatibility with a single old client you enable an old cipher, say aes128-cbc, server side. A modern client

https://bugzilla.mindrot.org/show_bug.cgi?id=2671 Bug ID: 2671 Summary: make possible to remove default ciphers/kexalgorithms/mac algorithms Product: Portable OpenSSH Version: 7.4p1 Hardware: Other OS: Linux Status: NEW Severity: enhancement Priority: P5 Component:

Hi. I have a problem with the default behavior of sample(), which performs sample(1:x) when x is a single value. This behavior is well explained in ?sample. However, this behavior is annoying when the number of value is not predictable. Would it be possible to add an argument that desactivates this and perform the sampling on a single value ? Examples: > sample(10, size = 1, replace = FALSE)

Hi Rishabh, I had this feeling before. This is a really nice idea BUT we can not go ahead with the project which is still not tested in the experimental settings. Though it may be a wonderful research exercise, I would still vote to go for the state-of-the-art methods which are completely published with full details and experimental results. Hope you get my point. Regards, Parth. On Wed, Apr 4,

https://bugzilla.mindrot.org/show_bug.cgi?id=2447 Bug ID: 2447 Summary: document all hash algorithms available for key fingerprint display Product: Portable OpenSSH Version: 7.0p1 Hardware: All OS: All Status: NEW Severity: trivial Priority: P5 Component:

https://bugzilla.mindrot.org/show_bug.cgi?id=2547 Bug ID: 2547 Summary: ssh-ext-info: missing server signature algorithms Product: Portable OpenSSH Version: 7.2p1 Hardware: All OS: All Status: NEW Severity: normal Priority: P5 Component: sshd Assignee: unassigned-bugs at

Cologne, 10.12.00 Dear Sir, Dear Madam, We are concerned about the possibility that the European Commission might introduce software patenting into the European Community because we think this will harm our profession. We make our living on data management and statistical analyses. Modern statistics crucially depends on algorithms [cf. Venables, W. N., & Ripley, B. D. (1999). Modern applied