search for: 4ns

...5714, 1.5777778, 0.6071429, 0.5233333, 0.5916667,1.1742857, 0.7987500) plot(s.f,main="",ylab="",xlab="",type="b",axes=F,pch=19) axis(4) Thanks in advance, Sion (R 2.1.1) -- Si?n Roberts Department of Geography, Queen Mary, University of London, London, E1 4NS. Tel: +44 20 7882 5400 http://www.geog.qmul.ac.uk/postgraduate/student/roberts.html

...f2<-data.frame(mon,mkf) plot(f2,type="l") The problem is that plot(f2,type="l") no longer produces a line plot... Any help with this would be gratefully appreciated. Best wishes, Sion -- Si?n Roberts Department of Geography, Queen Mary, University of London, London, E1 4NS. Tel: +44 20 7882 5400 http://www.geog.qmul.ac.uk/postgraduate/student/roberts.html

...lim=c(10,30)) Should the xtrim and ytrim args work with this kind of plot? Am I doing something wrong? Thanks in advance for any advice - Dan -- Dan Stowell Centre for Digital Music School of Electronic Engineering and Computer Science Queen Mary, University of London Mile End Road, London E1 4NS http://www.elec.qmul.ac.uk/department/staff/research/dans.htm http://www.mcld.co.uk/

...wonder if anyone else has had the problem and might be able to comment. Thanks Rob Robert Lambkin BSc (Hon's), MRPharmS, PhD Director and General Manager Retroscreen Limited Retroscreen Virology Limited The Medical Building, Queen Mary, University of London, 327 Mile End Road, London, E1 4NS Tel: 020 7882 7624 Fax: 020 7882 6990 (Retroscreen Virology Ltd. Registered in England & Wales No:2326557) The information contained in this message is confidential and is intended for the addressee(s) only. If you have received this message in error or there are any problems please notify...

...e several improvements to the implementation of the hashing algorithm itself. The way the hashing included the seed hurt performance quite a bit. I've re-worked it to be much lighter weight, and even after the execution seed fix above slowed things down, this speeds everything up more. We shave 4ns off the 4 to 8 byte case, bringing performance above that of essentially every high quality hashing algorithm... I still think we can do more, but it's already much faster than the existing LLVM one except for the issue Tobias pointed out w/ modulo-4 key sizes. I'm going to investigate thi...

...with C functions which pass character variables. my C functions look like: anyfunc(char **filename, other variables ) This error message appears about 25% of the time. What is the problem ? Ian Dr Ian Wilson Dept of Biological Sciences Queen Mary and Westfield College Mile End Road London E1 4NS Tel: 0171 775 3055 =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info", "help", or "[un]subscribe" (in the "body", not the subject !) To: r-help...

...with C functions which pass character variables. my C functions look like: anyfunc(char **filename, other variables ) This error message appears about 25% of the time. What is the problem ? Ian Dr Ian Wilson Dept of Biological Sciences Queen Mary and Westfield College Mile End Road London E1 4NS Tel: 0171 775 3055 =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info", "help", or "[un]subscribe" (in the "body", not the subject !) To: r-help...

...ts to the implementation of the hashing > algorithm itself. The way the hashing included the seed hurt performance > quite a bit. I've re-worked it to be much lighter weight, and even after > the execution seed fix above slowed things down, this speeds everything up > more. We shave 4ns off the 4 to 8 byte case, bringing performance above > that of essentially every high quality hashing algorithm... > > I still think we can do more, but it's already much faster than the > existing LLVM one except for the issue Tobias pointed out w/ modulo-4 key > sizes. I'm...

...290 S330 MX64 nVIDIA GeForce 2 MX200/32M SDR/AGP 4X 200 S330 PCI nVIDIA GeForce 2 MX 200/32M SDR/PCI 190 GeForce 2 Pro nVIDIA GeForce 2 Pro/32M DDR/AGP 4X/TV-out 340 СӰ°Ô£¨Unika£© ËÙÅäîÑ8200 nVIDIA GeForce 3 Ti200/128MB DDR 450 ËÙÅä7917 nVIDIA GeForce4 MX440/4ns 64M DDR/AGP 4X/VGA/TV-OUT 380 ËÙÅä7900 nVIDIA GeForce 2 Ti/64M DDR/AGP 4X 360 ËÙÅä7700 DDR nVIDIA GeForce 2 Pro/32M DDR/AGP 4X 320 ËÙÅä6700 nVIDIA GeForce 2 MX-400/64M SDR/AGP 4X 230 ËÙÅä6600 nVIDIA GeForce 2 MX-400/64M SDR/AGP 4X 200 °Ë¡¢ÈðÀö Éù¿¨ PCÓ°Ôº£¨×éºÏÌ×¼þ£© ´ºÖ®ËÌPro+M9909...

Hello folks, TL;DR: This is my proposed hashing interface based on a proposed standard hashing interface. It also is implemented with a much faster and higher quality algorithm than the current one. This is an *early draft* of the code, looking for initial feedback. There has been recent interest in improving the quality and consistency of LLVM's approach to hashing. In particular, getting

...E-<>o=1}p@^9ApEU55+j z1i9|uT*JI7Su~2J3(V_4<Dm`#XC+M#R34h3WAbF7 at tzuia}w_zApla6N`X=VB at E8T zxT;+sHxd;Z%Gn5S9nLxGx+d>*84ic{k301Q6oRU;2ohAD)9H7R!QvZF?LlclmP<bT z<S~EmqlaAHE6KFt%wWj7pAh`mV>>*sRbXw+tP+f;bCzCEdPT4f8^981oWKV`6QFVd z=RH0EK41g55dZ9hpuy1uL5;+^03qNA$Ph?S1ZhZ&!q^4Ns=}yfb at Tb0tznOTuXDdO zz at cgaN*R>N=yZoT4GSOW$po)!{+AEm=GXpUm*ZgBG(Fz+M3+DR?jetErp%T#lV!uQ z3RKSFM4X6tAMgmAkBxx_uwGC(M-u`rNL=tVAz*323vtlwgT!-Z!eLvlQ48<^ngCiz zsAt$}hE at tGHRJJ=-Wwi4X?_2IDBFzBRwYU&<VjAq=;2G~3CUb7_&dLGz;AwbLP!h` zcRKvy`wD*i&70V{VQ*H`SWobZ+6SBm=LEG2;K2HTZ332n_kj...