similar to: Time lag Regression and Standard Error

Ok I can see the linux box in my network places. However when I try to access the workgroup I receive this.... "test is not accessible. You might not have permission to use this network resource. Contact the administrator of this server to find out if you have access permissions. The network pat was not found." Any ideas what I'm doing wrong? Thanks, Lester Laro Ortho

I'm new to R and I'm not a Statistician I'm an Accountant, but I'm finding it an excellent tool for the business analysis work I do. I need to run LM() where both response and predictor are held in matrices. The model follows the form:- regression1 = matrix1.col1 <-> matrix2.col1 regression2 = matrix1.col2<->matrix2.col2 and so on...... I have no problem with the

Dear R community, I've been writing simple functions for the past year and half and have come across a similar problem several times. The execution of a function within my own function produces NaN's or fails to execute as intended. My conundrum is that I can execute the function outside of my function without error, so it's difficult for me, as a novice functioneer, to figure out

Dear R-list members, I would like to pose a question about the use and results of the glm() function for logistic regression calculations. The question is based on an example provided on p. 229 in P. Dalgaard, Introductory Statistics with R, 2nd. edition, Springer, 2008. By means of this example, I was trying to practice the different ways of entering data in glm(). In his book, Dalgaard

On Wed, Dec 20, 2017 at 04:13:16PM +0000, Wang, Wei W wrote: > On Wednesday, December 20, 2017 8:26 PM, Matthew Wilcox wrote: > > unsigned long bit; > > xb_preload(GFP_KERNEL); > > xb_set_bit(xb, 700); > > xb_preload_end(); > > bit = xb_find_set(xb, ULONG_MAX, 0); > > assert(bit == 700); > > This above test will result in "!node with bitmap

On 12/22/2017 05:03 AM, Matthew Wilcox wrote: > OK, here's a rewrite of xbitmap. > > Compared to the version you sent: > - xb_find_set() is the rewrite I sent out yesterday. > - xb_find_clear() is a new implementation. I use the IDR_FREE tag to find > clear bits. This led to me finding a bug in radix_tree_for_each_tagged(). > - xb_zero() is also a new

On 12/22/2017 05:03 AM, Matthew Wilcox wrote: > OK, here's a rewrite of xbitmap. > > Compared to the version you sent: > - xb_find_set() is the rewrite I sent out yesterday. > - xb_find_clear() is a new implementation. I use the IDR_FREE tag to find > clear bits. This led to me finding a bug in radix_tree_for_each_tagged(). > - xb_zero() is also a new

Hi, I'm trying to write a simple function like case1 <- function (m, cov, Q, R) { theta <- (acos(R/sqrt(Q^3))) beta <- (-2)*sqrt(Q)*cos(theta/3)+m[1]/3 rho1 <- (-2)*sqrt(Q)*cos((theta+2*pi)/3)+m[1]/3 rho2 <- (-2)*sqrt(Q)*cos((theta-2*pi)/3)+m[1]/3 stderrb <- deltamethod( ~(-2)*sqrt(Q)*cos(theta/3)+x1/3,m,cov) stderrr1 <- deltamethod(

From: Matthew Wilcox <mawilcox at microsoft.com> Add the following tests for xbitmap: 1) single bit test: single bit set/clear/find; 2) bit range test: set/clear a range of bits and find a 0 or 1 bit in the range. Signed-off-by: Wei Wang <wei.w.wang at intel.com> Cc: Matthew Wilcox <mawilcox at microsoft.com> Cc: Andrew Morton <akpm at linux-foundation.org> Cc: Michael S.

From: Matthew Wilcox <mawilcox at microsoft.com> The eXtensible Bitmap is a sparse bitmap representation which is efficient for set bits which tend to cluster. It supports up to 'unsigned long' worth of bits, and this commit adds the bare bones -- xb_set_bit(), xb_clear_bit() and xb_test_bit(). Signed-off-by: Wei Wang <wei.w.wang at intel.com> Cc: Matthew Wilcox <mawilcox

From: Matthew Wilcox <mawilcox at microsoft.com> The eXtensible Bitmap is a sparse bitmap representation which is efficient for set bits which tend to cluster. It supports up to 'unsigned long' worth of bits, and this commit adds the bare bones -- xb_set_bit(), xb_clear_bit() and xb_test_bit(). Signed-off-by: Wei Wang <wei.w.wang at intel.com> Cc: Matthew Wilcox <mawilcox

Dear all, Is there a fairly general R implementation of the delta method that uses numerical derivatives? I realise that the delta method has been implemented using symbolic derivatives (e.g. alr3::delta.method, emdbook::deltamethod, msm::deltamethod and survey:::nlcon), however possibly non-linear estimators using the delta method with numerical derivatives can be quite useful (e.g. predictnl

Hello, I just observed something strange: rsync -av --exclude /USER/NoBackup --exclude '*.NTX' --compare-dest=/backup/novell/vollbackup /mnt/novellserver/SYS/ /backup/novell/ziel rsync -av --exclude /USER/NoBackup --exclude '*.NTX' --compare-dest=/backup/novell/vollbackup/PUBLIC /mnt/novellserver/SYS/PUBLIC/ /backup/novell/ziel For debugging purposes (saving time) I used

OK, here's a rewrite of xbitmap. Compared to the version you sent: - xb_find_set() is the rewrite I sent out yesterday. - xb_find_clear() is a new implementation. I use the IDR_FREE tag to find clear bits. This led to me finding a bug in radix_tree_for_each_tagged(). - xb_zero() is also a new implementation (replacing xb_clear_bit_range). It should also be more efficient in deep

From: Matthew Wilcox <mawilcox at microsoft.com> The eXtensible Bitmap is a sparse bitmap representation which is efficient for set bits which tend to cluster. It supports up to 'unsigned long' worth of bits. Signed-off-by: Matthew Wilcox <mawilcox at microsoft.com> Signed-off-by: Wei Wang <wei.w.wang at intel.com> Cc: Andrew Morton <akpm at linux-foundation.org>

I have code and documentation that don't match, but R CMD check didn't flag it. in mspath.R mspath <- function(formula, # formula with observed Markov states ~ observation times (required) qmatrix, # matrix of 1s and 0s with indices of allowed transitions (diagonal is ignored) (required) misc = FALSE, ematrix = NULL, # matrix

Stephen, thanks for your effort. The more appropriate list for this discussion is probably R-devel (as far as I understand it) so I've moved the discussion there. Related topics have already been discussed in the past. Specifically, I remember contributions by Paul Johnson ("rockchalk" package) and John Fox ("effects" and "car" package) as their packages

hi all, i want to have samba in my liux as a PDC, so i have download the last version of samba 2.1alpha. but i can't compile it shows errors : Linking bin/nmbd libsmb/clientgen.o: In function `cli_establish_connection': libsmb/clientgen.o(.text+0x4ef3): undefined reference to `prs_init' libsmb/clientgen.o(.text+0x4f50): undefined reference to `create_ntlmssp_resp'

-------------------------- IEEE/ACM CCGrid 2014 -------------------------- 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing May 26-29, 2014 Chicago, IL, USA http://datasys.cs.iit.edu/events/CCGrid2014/ Rapid advances in architectures, networks, and systems and middleware technologies are leading to new concepts and platforms for computing, ranging from Clusters and

-------------------------- IEEE/ACM CCGrid 2014 -------------------------- 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing May 26-29, 2014 Chicago, IL, USA http://datasys.cs.iit.edu/events/CCGrid2014/ Rapid advances in architectures, networks, and systems and middleware technologies are leading to new concepts and platforms for computing, ranging from Clusters and