search for: cuhk

...a webpage. But some tcp connection can really be established, like up2date. I have checked the memory of the bridge, but it doesn't seem to be run out of memory. So, what's wrong with my bridge? Could anyone help me? ------------------------------------------------- This e-mail is sent by CUHK WebMail http://webmail.cuhk.edu.hk

...'t quite perfect about notifying all function passes that transforms have been applied to a function. This is known, and will be taken into account as best as possible. :) If you have any questions, suggestions, comments, etc. about this, then feel free to ping me, George [1] - http://www.cse.cuhk.edu.hk/lyu/_media/paper/pldi2013.pdf?id=home&cache=cache [2] - https://docs.google.com/a/google.com/document/d/1lgKGuVoMVXBnqqT6fGNtgvx4P0I8fJbMPqeuGL9GoNU/pub <https://docs.google.com/a/google.com/document/d/1lgKGuVoMVXBnqqT6fGNtgvx4P0I8fJbMPqeuGL9GoNU/pub> -------------- next part -----...

...sis, forest plot show the results of whole study and results of two subgroups like this the forest plot show in the attachment. looking forword to your reply Regards and Cheers Xudong Liu School of Public Health and Primary Care The Chinese University of Hong Kong Email: liuxudong at cuhk.edu.hk > Subject: Welcome to the "R-help" mailing list (Digest mode) > From: r-help-request at r-project.org > To: idliuxudong at hotmail.com > Date: Mon, 31 Dec 2012 10:08:53 +0100 > > Welcome to the R-help at r-project.org mailing list! > > To post to this...

Hello, I am a newbie. I can run the following code stored in "test.txt" without error using my XP machine: x <- scan("C:\\Rwork\\A.txt") x10 = filter(x, rep(1/10,10), sides=1) x x10 for(i in 10:length(x)){ if (x[i] > x10[i]) diff[i]="b" else diff[i]="s" } However, if I run it in another PC that uses Windows 7, the following error occurs:

I notice you guys formulate your CFL reachability problem as a balanced parentheses problem. What algorithm do you use to solve it? Are you aware of recent work that comes up with linear time and n log n time algorithms to solve this class of problems: http://www.cse.cuhk.edu.hk/lyu/_media/paper/pldi2013.pdf In particular, the time bound from the paper: "However, if we need the precise pointer information for all variables, CFL-based pointer analysis is generally more expensive as it has O(L^3 N^3) complexity [29], where L is the size of the grammar and N is...

...; I notice you guys formulate your CFL reachability problem as a > balanced parentheses problem. > What algorithm do you use to solve it? > > Are you aware of recent work that comes up with linear time and n log > n time algorithms to solve this class of problems: > http://www.cse.cuhk.edu.hk/lyu/_media/paper/pldi2013.pdf > > In particular, the time bound from the paper: > > "However, if we need the precise pointer information for all > variables, CFL-based > pointer analysis is generally more expensive as it has O(L^3 N^3) > complexity [29], where L is...

...is the first version of the package. The canonical reference is: J.D. Musa, A. Iannino, and K. Okumoto. Software Reliability: Measurement, Prediction, Application. McGraw-Hill, 1987. Michael R. Lyu. Handbook of Software Realibility Engineering. IEEE Computer Society Press, 1996. http://www.cse.cuhk.edu.hk/~lyu/book/reliability/ Suggestions, bug reports and other comments are very welcome. enjoy and best regards Andreas _______________________________________________ R-packages mailing list R-packages at stat.math.ethz.ch https://stat.ethz.ch/mailman/listinfo/r-packages

...Far East. What's going on? Nobody mirroring cr in other parts of the world? mirrors.ta139.com 99999999999 centos.communilink.net 99999999999 mirrors.hns.net.in 99999999999 centos.aol.in 99999999999 virror.hanoilug.org 99999999999 mirror.averse.net 99999999999 mirror.nus.edu.sg 99999999999 ftp.cuhk.edu.hk 99999999999 ftp.iitm.ac.in 99999999999 mirror-fpt-telecom.fpt.net 99999999999 centos.vr-zone.com 99999999999 mirrors.btte.net 99999999999 mirrors.digipower.vn 99999999999 centosmirror.go4hosting.in 99999999999 ftp.oss.eznetsols.org 0.220621109009 centos.01link.hk 99999999999 mirrors.ispros.c...

Full_Name: Leung Pui Lam Version: 2.72 OS: Window XP Submission from: (NULL) (137.189.4.4) When I installed R2.72 (actually any version >2.62) on Window XP (Traditional Chinese), I found the following error Error in structure(.Internal(Sys.getenv(as.character(x), as.character(unset)$ unsupported conversion ... Error in file.exists(name) : unsuported conversion in 'filenameToWchar'

Hi Hal, Thanks for your interest. We tested with the following existing compiler optimizations in LLVM with SPECINT2006 benchmarks: -dse (dead store elimination), -gvn (global value numbering), -licm (loop invariant code motion), -bb-vectorize (basic block vectorization), -memcpyopt (memcpy optimization), -sink (code sinking), -loop-idom (recognize loop idioms), -argpromotion (argument

...your CFL reachability problem as a > > balanced parentheses problem. > > What algorithm do you use to solve it? > > > > Are you aware of recent work that comes up with linear time and n log > > n time algorithms to solve this class of problems: > > http://www.cse.cuhk.edu.hk/lyu/_media/paper/pldi2013.pdf > > > > In particular, the time bound from the paper: > > > > "However, if we need the precise pointer information for all > > variables, CFL-based > > pointer analysis is generally more expensive as it has O(L^3 N^3) &gt...

I would like to know how can I calculate and plot the sequential values of the statistics u(t) and u'(t)? [[alternative HTML version deleted]]

Dear R help, I am having a problem with the Design package and my problem is detailed here. I fit a cox model to my data and validate the Somer's Dxy using the Design package. (Because of computation time problem, i only try 10 bootstrap samples for the time being) This is the model without stratification: > library(Design) >

Andrew, I have a software which need the following package but I can't find it in Internet. Could you advice me where I can download it? samba-3.0.10-1.4E6.HSM.2.i386 samba-common-3.0.10-1.3E.6.HSM.2 samba-client-3.0.10-1.4E.6.HSM.2 Thanks, Isaac Chan

Dear R-help, This is an example in the {Hmisc} manual under rcorr.cens function: > set.seed(1) > x <- round(rnorm(200)) > y <- rnorm(200) > round(rcorr.cens(x, y, outx=F),4) C Index Dxy S.D. n missing uncensored Relevant Pairs Concordant Uncertain 0.4831 -0.0338 0.0462 200.0000

I want to call dll from R but encounter problem in compiling the fortran program. First I try "Rcmd shlib prog.f", it failed and warning: make[1]: `libR.a' is up to date. make: *** No rule to make target `'prog.o', needed by `prog.a'. stop. Then I try to compile it by absoft fortran compiler, it works and produces prog.dll. But when this routine is called in R, it

Dear all can anyone tell me how to mark packet''s DSCP value using tc? Thanks. Regards, philip -- Hong Kong IP Multicast Initiative (HKIPMI) Department of Information Engineering The Chinese University of Hong Kong Phone : 2603 5240 Fax : 2603 5032 _______________________________________________ LARTC mailing list / LARTC@mailman.ds9a.nl

Dear R-help, I am having a problem with the interpretation of result from validate.cph in the Design package. My purpose is to fit a cox model and validate the Somer's Dxy. I used the hypothetical data given in the help manual with modification to the cox model fit. My research problem is very similar to this example. This is the model without stratification: > library(Design) > f1