similar to: Run fortran from R

Hello The excellent adapt package integrates over multi-dimensional hypercubes. I want to integrate over a multidimensional simplex. Has anyone implemented such a thing in R? I can transform an n-simplex to a hyperrectangle but the Jacobian is a rapidly-varying (and very lopsided) function and this is making adapt() slow. [ A \dfn{simplex} is an n-dimensional analogue of a triangle or

Full_Name: George F. LeCompte Version: 1.6.1 OS: Windows 98 Submission from: (NULL) (208.8.162.161) This may be a newbie problem. I am attempting tor unt the simplex routine from the boot package. The example code doesn't find simplex. What's wrong here? > help(simplex,package=boot) > # from the resulting article > > # This example is taken from Exercise 7.5 of

I have just checked the Openbsd box on the if interface. fxp0: flags=8843<UP,BROADCAST,RUNNING,SIMPLEX,MULTICAST> mtu 1500 address: 00:02:55:30:54:28 media: Ethernet autoselect (100baseTX full-duplex) status: active inet 192.168.1.1 netmask 0xffffff00 broadcast 192.168.1.255 inet6 fe80::202:55ff:fe30:5428%fxp0 prefixlen 64 scopeid 0x1 xl0:

Hello, I have just started using R, and have found it quite easy to make plots of probability densities for normal and beta distributions, etc. Now, I'm looking at trying to make a simplex plot of a Dirichlet density, but have gotten stuck and was hoping that someone could help. Ideally, the plot would look something like the 3d plots on Wikipedia here:

Hi, I need some help. I'm doing a project that demands me to obtain several simplex solutions and I would like to can keep the solution in a vector or something to be able to use it after I get it. The comand simplex() prints the solution but how can I keep it? Another alternative would be to export it to excel, how can I do this? I just see the solution and have to note it on a paper or

I have a set of linear equations and would like to find any feasible solution. A simplex solution works in Case 1 below, but not in Case 2. I would be grateful for any help. Case 1: Find any feasible solution for the set of linear equations: a + b + c = 5 a + b + 0c = 4 0a + b + c = 4 Solution - a feasible (and unique) solution is a=1, b=3, c=1. The following R code

This is ifconfig on openbsd box: fxp0: flags=8843<UP,BROADCAST,RUNNING,SIMPLEX,MULTICAST> mtu 1500 I think this output shows that the fxp0 interface is on simplex mode. The voice degradation I referred was by using xlite soft phone. I open 2 line similtaneously and dial to FWD and back to my incoming extension. Xlite is runnning on a w2k box with realtek 100M nic in auto mode. I can

Hello list! When em0 has an inet address while bridge0 doesn't, it seems to be OK: ----- bs1% uname -a FreeBSD bs1.sp34.ru 7.0-STABLE FreeBSD 7.0-STABLE #0: Sun May 25 20:15:26 MSD 2008 root@bs1.sp34.ru:/usr/obj/usr/src/sys/BSM i386 bs1% ifconfig em0; ifconfig tap0; ifconfig bridge0 em0: flags=8943<UP,BROADCAST,RUNNING,PROMISC,SIMPLEX,MULTICAST> metric 0 mtu 1500

Greetings! I want to follow the evolution of a Nelder-Mead function minimisation (a function of 2 variables). Hence each simplex will have 3 vertices. Therefore I would like to have a function which can output the coordinates of the 3 vertices after each new simplex is generated. However, there seems to be no way (which I can detect) of extracting this information from optim() (the

I am running the following code (testing the use of the simplex function to determine if a point is in the convex hull of another set of points or not): >a <- c(0, 0) >A3 <-matrix(c(1,2,3,4,1,1), ncol = 2, byrow = T) >b3 <-c(1.5, 3.5, 1) >simplex(a = a, A3 = A3, b3 = b3) and the following error message appears: Error in simplex1(out1$a[1:(n + m1 + m2)], out1$A[, 1:(n + m1

In trying to use simplex() from the boot package, I have run into a situation that doesn't seem like it should be possible. It is claiming that it has solved the LP, but returns a vector of all zeros, which does not satisfy the constraints I passed in. A small example: > ubMatrix <- matrix(c(1,1,-1,0,-1,-1), 3, 2) > ubVector <- c(2,1,-1) > objective <- c(0,1) >

I am interested in using the nonlinear forecasting techniques developed by Sugihara et al. In particular the simplex projection and the S-Map (see this website for details and reprints: http://iod.ucsd.edu/simplex/ ). I've looked through CRAN but could not find any package with functions that allow such analysis. Any pointers? Thanks, Manu

Hi all, I read the setup at http://www.blackh0le.net/articles/vpn-dun-howto.html to setup my VPN. However, I'm having a problem which I think is proxy-ARP not working. I like to ask you to see if you know what's going on. When I ping 10.77.1.1 from windows XP machine the packets get to the 10.77.1.1 machine, but they don't have a return path to get back. When I do ping the windows

In the optim() documentation, the control parameter "maxit" says "There is no other stopping criteria." That should be "are", or "criterion" ... While I'm at it -- poking at the code a little bit, it looks as if the initial simplex is set from the initial point by displacing each parameter value by max(0.1,0.1*pmax(fabs(Bvec))), where Bvec is the

Referring to my previous post about degradation of voice quality when having more than 2 connection. The actual route is: pc xlite -> local asterisk box -> iaxtel -> local asterisk I have tried out a different situation: pc xlite -> local asterisk box -> iaxtel and the second connection pc xlite -> local asterisk box -> iaxtel -> local asterisk The same degradation

Dear R users, Is anyone familiar with the "n.iter" argument of the simplex() function (in the boot package)? It seems it doesn't have an effect no matter what value I set it ... I'm trying to solve a linear programming problem and running into the problem of simplex.object$solved = 0 or "A value of 0 indicates that the maximum number of iterations was reached without

Hello everybody. I found out the other day something quite astonishing (which I guess is not astonishing at all to those in the know): in d-dimensional space, determining whether a given point is inside the convex hull of a set of n points is elegantly and quickly solvable using linear programming. If the columns of matrix "ff" are the coordinates of the set of points, then in d=2

I have FreeBSD 7.1-RELEASE-p4 running on a Soekris 4521 with three wireless cards that use the wi-driver: - one mini-pci wireless card: <Intersil Prism2.5> on pci0 using RF:PRISM2.5 MAC:ISL3874A(Mini-PCI) Intersil Firmware: Primary (1.1.1), Station (1.8.2) - and two pcmcia wireless cards:

Hi, in the kernel I have these lines: [...] device miibus # MII bus support device rl device ed options IPFIREWALL #firewall options IPFIREWALL_VERBOSE #enable logging to syslogd(8) options IPFIREWALL_VERBOSE_LIMIT=0 #limit verbosity options IPDIVERT #divert sockets options DUMMYNET

This message was sent to bugtraq today: While playing around with FreeBSD 5.4 and jailing I discovered that it was possible to put an ethernet interface into promiscious mode from within the jailed environment, allowing a packetsniffer to gather data not meant for the jailed box. This also affects FreeBSD 5.3 (tested) but not FreeBSD 4.x This can be reproduced on boxes where BPF support is