similar to: simulating from Langevin distributions

Hi, I'm writing a short course tutorial to Browninan Motion/ Langevin Equation. At the end of the theory section I wanted to add a short GNU R example, so the students can play a little around. I already looked in the MASS book (by Venables and Ripley) but I couldn't find any Brownian Motion/ Langevin Equation package. Are there any good packages or tutorials available which cover R and

Hello, I would like to remove some files which have the extension .test for example (data1.test, data2.test ....). Is there another solution to remove them instead of doing it one by one ? Thanks for your help, St?phanie Langevin -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send

Dean - > if you are having these troubles and everyone keeps advising you to use > asterisk@home why aren't you doing this? Not to be rude, but I believe you are the only one who suggested he use asterisk@home. asterisk@home is a great (actually stupendous) product for those that want to have a PBX with a GUI up and running within a few minutes. It does not, however, force users

Hi there, I'm trying to compile nut 2.0.4 on an AIX 5.3 machine, but it fails: $ make common/ /usr/vac/bin/cc -I../include -O -c common.c /usr/vac/bin/cc -I../include -O -c upsconf.c /usr/vac/bin/cc -I../include -O -c parseconf.c /usr/vac/bin/cc -I../include -O -c state.c Target "all" is up to date. drivers/ /usr/vac/bin/cc -I../include -O -c

Hi, I''m having trouble connecting to a remote database (mysql). I know that my connection settings are correct, since I have a php app that is connecting to the same database. Are there any settings besides the following that I need in my database config file? Any other suggestions? development: adapter: mysql database: db_name username: username password: password host:

Congratulations to all members of the team for contributing towards breaking through the 2,000 place barrier. In the overall team rankings we are now in position 1885! Considering how 'young' the team is in terms of how long its been going thats a stupendous achievement! Well done all! From now on we can watch our teams ranking on

Because you learn how asterisk works by looking at the AMP dial plan fast. With phpconfig you have the ability to view each of the aspects and learn a lot faster than reading the wiki. It also gives you an understanding on how a professional dial plan should be laid out. If he doesn't even understand how to do grouping he obviously hasn't even read the most basic sections of the wiki.

On Jul 28, 2015, at 4:37 PM, Nathan Duehr <denverpilot at me.com> wrote: > >> On Jul 28, 2015, at 11:27, Warren Young <wyml at etr-usa.com> wrote: >> >> So no, your local password quality policy is not purely your own concern. > > Other than DDoS which is a problem of engineering design of how the network operates (untrusted anything can talk to untrusted

Hi guys, I resently used xapian to sort some documents by distance between 2 points. I implemented a MatchDecider which work well. I now tried to implement a Weight scheme to put my document in ascending order depending on the distance... My information to calcul distance is in values in the document. How I can access document values from Weight to be able to add some sum_extra weight ??

Would package "teigen" help? Ranjan On Thu, 29 Jun 2017 14:41:34 +0200 vare vare via R-help <r-help at r-project.org> wrote: > Hello! > > I am new to R (before used python exclusively and would actually call the R solution for this issue inside a python notebook, hope that doesn?t disqualify me right of the batch). > > Right now I am looking for a piece of

Hello! I am new to R (before used python exclusively and would actually call the R solution for this issue inside a python notebook, hope that doesn?t disqualify me right of the batch). Right now I am looking for a piece of software to fit a 1D data sample to a mixture of t-distributions. I searched quite a while already and it seems to be that this is a somehwat obscure endeavor as most

Dear all, I have a question with regard to the use of hclust. I would like to be able to specify my own distance matrix instead of asking R to compute the distance matrix for me. It is computationally easier for me this way. My question is: How can I get hclust to accept this? Thanks, Ranjan -- *************************************************************************** Ranjan

Thanks! Yes, however, this seems a bit wasteful. Just wondering if there are other, more efficient options possible. Best wishes, Ranjan On Thu, 29 Mar 2018 22:20:19 -0400 Boris Steipe <boris.steipe at utoronto.ca> wrote: > If one is equal to the reverse of another, keep only one of the pair. > > B. > > > > > On Mar 29, 2018, at 9:48 PM, Ranjan Maitra

Dear friends, Is there a way to read data files written in lisp into R? Here is the file: https://archive.ics.uci.edu/ml/machine-learning-databases/university/university.data I would like to read it into R. Any suggestions? Thanks very much in advance for pointers on this and best wishes, Ranjan -- Important Notice: This mailbox is ignored: e-mails are set to be deleted on receipt. Please

Dear list, I have been using the Rmath library for quite a while: in the current instance, I am calling dnt (non-central t density function) repeatedly for several million. When the argument is small, I get the warning message: full precision was not achieved in 'pnt' which is nothing unexpected. (The density calls pnt, if you look at the function dnt.) However, to have this happen a

Jeff, I wanted to let you know that your function is faster than generating the directional circular permutations and weeding. Here is the time for n = 10. I compared with just doing the permutations, there is no point in proceeding further with the weeding since it is slower at the start itself. system.time(directionless_circular_permutations(10)) user system elapsed 1.576 0.000

I don't know if this is more efficient than enumerating with distinct directions and weeding... it seems kind of heavyweight to me: ####### library(gtools) directionless_circular_permutations <- function( n ) { v <- seq.int( n-1 ) ix <- combinations( n-1, 2 ) jx <- permutations( n-3, n-3 ) x <- lapply( seq.int( nrow( ix ) ) , function( i ) {

Dear friends, Sorry for this somewhat generically titled posting but I had a question with using contrasts in a manova context. So here is my question: Suppose I am interested in doing inference on \beta in the case of the model given by: Y = X %*% \beta + e where Y is a n x p matrix of observations, X is a n x m design matrix, \beta is m x p matrix of parameters, and e is a

https://bugzilla.mindrot.org/show_bug.cgi?id=3202 Bug ID: 3202 Summary: Ed25519 key on HSM is not getting listed in ssh-add -l command Product: Portable OpenSSH Version: 8.2p1 Hardware: ARM64 OS: Linux Status: NEW Severity: enhancement Priority: P5 Component: ssh-add

Dear friends, I would like to get all possible arrangements of n objects listed 1:n on a circle. Now this is easy to do in R. Keep the last spot fixed at n and fill in the rest using permuations(n-1, n-1) from the gtools package. However, what if clockwise or counterclockwise arrangements are the same? I know that half of the above (n - 1)! arrangements are redundant. Is there an easy way to