search for: logne

Hi I'm trying to maximize a joint likelihood of 2 likelihoods (Likelihood 1 and Likelihood 2) in mle2, where the parameters I estimate in Likelihood 2 go into the likelihood 1. In Likelihood 1 I estimate the vector logN with length 37, and for the Likelihood 2 I measure a vector s of length 8. The values of s in Lieklihood 2 are used in the Likelihood 1. I have 2 questions: ##1 I manage

...rcent value (or decimal if that's my only option) at the equivalent of e^-1, e^-2, etc, but the values don't seem to line up correctly. I'd also like to replace the provided axis with my axis instead of just placing my axis out a line but I'm unsure how to do that. library(popbio) logNE <- log(erbr$NEast[-1]/erbr$NEast[-6]) countCDFxt(mean(logNE), var(logNE), nt=5, Nc=1317, Ne=200) axis(2, 0:1, labels = c(0.018, 0.050, 0.135, 0.368, 1), at = c(0.018, 0.050, 0.135, 0.368, 1), line =1) Year? ????? NEast NWest 2004? ????? 731?? 1732 2005? ????? 898?? 2004 2006? ????? 714?? 1130 2...

Hi R experts, I'm using the xyplot function in lattice to draw a multipanel plot consiting of 5x6 scatterplots. Now I need to link single points in each of those scatterplots (=panel),but the points, that need linking are different for each panel. I tried to use the panel.segments function for that, but I can't address each panel separately. Links right for panel 1, show up in all other

TRUNKMSD1=1 ; MSD digits to strip (usually 1 or 0) TRUNKMSD2=2 ; MSD digits to strip (usually 1 or 0) ; logn distance calls exten => _91NXXNXXXXXX,1,NoOp("Dialing: "${TRUNK}/${EXTEN:${TRUNKMSD1}}) exten => _91NXXNXXXXXX,2,Dial(${TRUNK}/${EXTEN:${TRUNKMSD1}}) exten => _91NXXNXXXXXX,3,Congestion When I dial

On 01/18/15 22:55, Peter wrote: > On 01/19/2015 10:51 AM, Tim wrote: >> Just my two cents: Anyone thought of asking Red Hat to use >> documentation? I think they are getting much from the community so >> to copy public accessible documentation when permitted by RH could be >> an easy way. >> >> Why not giving that a try? > > There's no need to ask

Hi, I am using Scalar Evolution to extract access expressions (for load and store instructions) in terms of the loop induction variables. I observe that the Scalar Evolution analysis is returning more expressions than I expect - including ones that are not defined in terms of the loop induction variable. For instance in the following code: for(unsigned long int bid = 0; bid < no_of_queries;

Hi Jean-Marc, I hate to nitpick, but perhaps "logN" should be freed somewhere in celt_mode_destroy. Cheers, John Ridges

Hi, I'm trying to implement the DBSCAN algorithm to get O(N*LogN) complexity and I'd need a spatial tree of some sort (kd,r,bd..), or a function that computes radius-based search on spatial data, i.e. given a radius eps finds ALL the points which fall in the corresponding hypersphere centered on the current examined point. Is there a package with this features? So far I found RANN

Hi all, we are using Samba for a year in our departement. It replaced a dedicated win2k-server for printer and file sharing. We are quite happy with it, but we have still some problems. Does anyone of you know solutions to this: 1. We are using HP Laserjet 4300 in our departement. Driver ( origial PS drivers from HP website) installation was successfull and basic functionality works, but some

Hi Hashim, Scalar evolution determines evolution of scalar in terms of expression chain driving it. Try dumping the detailed log using opt -analyze -scalar-evolution <.ll> -S , and look for LoopDispositions corresponding to different expression which shows variance characteristics of a particular expression w.r.t loop i.e. [computable/variant/invariant]. Thanks On Fri, Dec 1, 2017 at

On 31 March 2016 at 21:41, Mehdi Amini via llvm-dev <llvm-dev at lists.llvm.org> wrote: > TLDR: I totally support considering compile time regression as bug. Me too. I also agree that reverting fresh and reapplying is *much* easier than trying to revert late. But I'd like to avoid dubious metrics. > The closest I could find would be what Chandler wrote in: >

Hi, TLDR: I totally support considering compile time regression as bug. I'm glad you bring this topic. Also it is worth pointing at this recent thread: http://lists.llvm.org/pipermail/llvm-dev/2016-March/096488.html And also this blog post comparing the evolution of clang and gcc on this aspect: http://hubicka.blogspot.nl/2016/03/building-libreoffice-with-gcc-6-and-lto.html I will repeat

On 01/19/2015 05:18 PM, Mark LaPierre wrote: > Well then there appears to be no reason to not go with a version of my > initial suggestion. > > State what CentOS is and what it's sources are. State that there may be > some minor divergence between the behavior of CantOS and the Red Hat > documentation. You can explain why if you feel that it's required. > >

Hi everyone I am attempting to estimate a model with a frailty effect distributed as a lognormal variable.I am using the following code: frailtyPenal(formula, data, ..., RandDist = "LogN") I get the following error message: Error in frailtyPenal(Surv(,) ~ + , : unused argument(s) (RandDist = "") What can I do? Thanks for the help [[alternative HTML version deleted]]

Author: robert.moran Date: Sun May 31 11:13:23 2009 New Revision: 11 Modified: trunk/source/mxn.core.js trunk/source/mxn.js trunk/source/mxn.yahoo.core.js trunk/tests/index.htm Log: Added functionality to automatically load scripts needed. Allowed mapstraction default constructor to have provider omitted (will use first loaded provider). Minor change to yahoo implementation -

http://bugzilla.mindrot.org/show_bug.cgi?id=1149 Summary: Does not build on QNX Product: Portable OpenSSH Version: 4.3p1 Platform: ix86 OS/Version: other Status: NEW Severity: normal Priority: P2 Component: Build system AssignedTo: bitbucket at mindrot.org ReportedBy: kraai at ftbfs.org

I've made a small patch to rsync that adds three options that are useful in data-recovery situations. I don't know whether the maintainer will want to add this to the official distribution, but he is free to do so if he wishes. At present, I don't have anywhere to host the patch but I wanted to make it available so it may be tested more thoroughly. To be honest, I haven't

Am 09.08.2016 um 22:18 schrieb Achim Gottinger via samba: > > > Am 09.08.2016 um 21:48 schrieb Rainer Meier via samba: >>> I think the 10.0.06 entry was created during domain creation. I'd skim >>> thru dns records from an windows machine if possible and delete all >>> occurences of unwanted ip adresses. I assume the gpo's still can not be >>>

Hi all, I have been trying to add the line: h = n - p0 + 1; just after h = n / 2 + 1; (line 131) in the source code (the original paper mention this is possible for p0&lt;n). with p0 declared as an int (actually i used the same declaration protocol as n everywhere in the code). The &quot;new&quot; source compiles, but when i give it reasonable values of p0, it runs unto

Hi Renato, > On Mar 31, 2016, at 2:46 PM, Renato Golin <renato.golin at linaro.org> wrote: > > On 31 March 2016 at 21:41, Mehdi Amini via llvm-dev > <llvm-dev at lists.llvm.org> wrote: >> TLDR: I totally support considering compile time regression as bug. > > Me too. > > I also agree that reverting fresh and reapplying is *much* easier than > trying