search for: arxived

Hi all, we activated puppet mail reports but we are receiving a lot of mails when yum fails to update the repos, like this one: (err): Failed to retrieve current state of resource: Could not get latest version: Execution of ''/usr/bin/yum -d 0 -e 0 list available munin-node'' returned 1: Cannot open/read repomd.xml file for repository: kbs-CentOS-Extras failure:

I would like to apply network measures (such as betweenness centrality, upper boundedness, etc.) to a weighted graph with non-integer weights, defined by a euclidean distance matrix. The package sna provides the measures that I want to use, but seems only to operate on binary graphs. I have read work by Mark Newman (http://aps.arxiv.org/abs/cond-mat/0407503/), who suggests that a weighted graph

Hello LLVM community, We have been working hard on a new domain specific optimizing compiler, and we are pleased to announce that we have recently open sourced the project! We would like to introduce you to Glow, an optimizing compiler for neural networks! This new compiler is built on the hard work of this community and we would like to thank all of the contributors to the LLVM project. We

Dear list, It looks to me that R samples random integers using an intuitive but biased algorithm by going from a random number on [0,1) from the PRNG to a random integer, e.g. https://github.com/wch/r-source/blob/tags/R-3-5-1/src/main/RNG.c#L808 Many other languages use various rejection sampling approaches which provide an unbiased method for sampling, such as in Go, python, and others

Dear R-users, I want to check if certain values are from random distribution, that includes values between 0-1. So, it is not really normal even though shapiro.test says it is highly normal... Can I do something like this and think that the values given are right. z.test is from package TeachingDemos. -------------------------------------------------------------------------------

Hello, about the CVE-2015-0204, in apache the following config seems to disable this vulnerability: SSLProtocol All -SSLv2 -SSLv3 SSLCipherSuite HIGH:MEDIUM:!aNULL:!eNULL:!EXPORT:!CAMELLIA:!DES:!MD5:!PSK:!RC4 Is something similar possible with dovecot ? If yes, what are the implications with old mail clients ? -- Best regards, Adrian Minta

...x.html qgam is an extension of mgcv, and provides methods for fitting quantile additive models including parametric, random and smooth effects. For basic examples see the vignette: https://cran.r-project.org/web/packages/qgam/vignettes/qgam.html For more details on the underlying methods see the arXived paper: https://arxiv.org/abs/1707.03307 Comments, criticisms and feature requests are more than welcome. The package is also available on github: https://github.com/mfasiolo/qgam Best, Matteo Fasiolo [[alternative HTML version deleted]]

Using Mathematica, I've performed a hierarchical clustering of 3,107 U. S. counties based on 1995-2000 intercounty migration, using an algorithm of my own devising (see http://arxiv.org/abs/0807.1550). I can also generate the associated 3,107 x 3,107 matrix of ultrametric distances. Unfortunately, as far as I have been able to determine, the Mathematica hierarchical clustering package only

Hello list. I need help (e.g., a reference, code, package, etc.) in calculating the joint entropy of many variables (some sure highly mutually-informative and some not). Is there anyone here who knows a computationally-efficient solution (such as an R package)? I appreciate you help ... Best, Reza [[alternative HTML version deleted]]

Hi Vijay, > I am Vijay Mahantesh SM from India. I am an open > source enthusiast and a big fan of computational mathematics and research. > I came across the idea list of mentioned in the link<http://trac.xapian.org/wiki/GSoCProjectIdeas> and > was fascinated to find projects of my passion. As per my understanding of > the project, this project requires a good

...x.html qgam is an extension of mgcv, and provides methods for fitting quantile additive models including parametric, random and smooth effects. For basic examples see the vignette: https://cran.r-project.org/web/packages/qgam/vignettes/qgam.html For more details on the underlying methods see the arXived paper: https://arxiv.org/abs/1707.03307 Comments, criticisms and feature requests are more than welcome. The package is also available on github: https://github.com/mfasiolo/qgam Best, Matteo Fasiolo [[alternative HTML version deleted]]

Hi folks, This summer I'm working on improving dominators during my internship at Google. Below is an RFC on switching to dynamic dominators, which you can also read as a Google Doc <https://docs.google.com/document/d/1wPYeWykeO51YDPLYQEg4KNTlDIGIdyF65OTfhSMaNHQ/edit?usp=sharing> if you prefer so. Please let us know what you think. ~Kuba

Dear R folks, I need to simulate first passage times for iterated partial sums. The related papers are for example [1][2]. As a start I want to simulate how long a simple random walk stays negative, which should result that it behaves like n^(-?). My code looks like this. -------- 8< -------- code -------- >8 -------- n = 100000 # number of simulations length = 100000 # length of

El mi?., 19 sept. 2018 a las 14:43, Duncan Murdoch (<murdoch.duncan at gmail.com>) escribi?: > > On 18/09/2018 5:46 PM, Carl Boettiger wrote: > > Dear list, > > > > It looks to me that R samples random integers using an intuitive but biased > > algorithm by going from a random number on [0,1) from the PRNG to a random > > integer, e.g. > >

Very cool! The first thing that jumps out to me is how tidy and modular the code structure is. The code feels very familiar (stylistically, organizationally, etc.) to me as an LLVM developer. One thing that wasn't at all clear to me is how this is different/similar to TensorFlow XLA (previously mentioned on this list). Can you briefly compare and contrast this with TensorFlow XLA? -- Sean

Dear all, I wanted to let you know about four phylogenetic comparative methods (PCM) packages that have become available on (3 on CRAN and 1 on GitHub) recently that hopefully will be interesting to somebody. Three of them go significantly beyond the Brownian motion (BM) and Ornstein-Uhlenbeck (OU) processes. 1) There is a new version of mvSLOUCH available. The most important change is that the

Dear all, I wanted to let you know about four phylogenetic comparative methods (PCM) packages that have become available on (3 on CRAN and 1 on GitHub) recently that hopefully will be interesting to somebody. Three of them go significantly beyond the Brownian motion (BM) and Ornstein-Uhlenbeck (OU) processes. 1) There is a new version of mvSLOUCH available. The most important change is that the

On Wed, Jan 09, 2019 at 08:17:31PM +0530, Pankaj Gupta wrote: > This patch series has implementation for "virtio pmem". > "virtio pmem" is fake persistent memory(nvdimm) in guest > which allows to bypass the guest page cache. This also > implements a VIRTIO based asynchronous flush mechanism. At Pankaj's request I looked at information leak

On Tue 2015-05-26 12:57:05 -0400, Hubert Kario wrote: > creating composites that will pass even 100000 rounds of Miller-Rabin is > relatively simple.... > (assuming the values for M-R tests are picked randomly) Can you point me to the algorithms for doing that? This would suggest that we really do want primality proofs (and a good way to verify them). Do those algorithms hold for

Hi On april 17th, I upgraded from dovecot 2.1.13 to 2.2.0. Since that time, I had two different users that reported received three incident of messages that disapeared from their mailboxes. The mailbox format is mbox on local FFS filesystem (no NFS), and I use filesystem quotas (but both users are far from filling their quotas). When the message disapeared, it was always a whole rand of dates.