search for: dpv

Hello! We have FSP DPV 1000 USB and we want to use NUT to get data from this UPS. Unfortunately we have only Windows and current Windows port doesn't have nutdrv_qx, which should support this UPS. Is there any possibility of getting nutdrv_qx for Windows? Please help.

I'd like to migrate a Netware 5.0 serve to Samba and LDAP. I'm wondering how I might export the usernames, passwords, and perhaps group memberships to the destination LDAP. If I can get the data into LDIF form, I'm okay from there. Does anyone know how the passwords in Netware 5.0 are encrypted? I hope to bring them over, but reseting the passwords is not out of the question (just

...ei-jin.org/GPG-KEY-PRATA ~From the withered tree, a flower blooms --Zen Proverb -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.6 (GNU/Linux) Comment: Using GnuPG with Red Hat - http://enigmail.mozdev.org iD8DBQFCel+lrPWS4OBoxGwRAuI3AKC0fM10AJ61xPrul13GM0V7kVsxywCggryG fA+++bZYxl5ZayaoVjpVTaM= =+DPv -----END PGP SIGNATURE-----

...amp;SFwou|(@?V??j` zSyo)H)65 at qL`&w|!omWPcT at 3lG@Y7KZ&{4!^2GWMnZ}ltReRJ)N)nqlQfGG{amw;N z;o-vK%4(xaE at _&3HZsjF4=je?lzgt$)nv_S?(tR(6W1FR-7gkJij<#SXA at 69TQG68 zWQo&2Sy0^ei|0hv2)f(CwiGF at K(?owSNt%}8!|1dB`8^U92*4V^9}7DuVPI+0e{WV z<Pqp{klDk;g;sguIy0oT5$Ca<@O8ok)!zDoU`?RDpv+eguJx5mH at u*%zMw7)=cxee z7G7XYMS(beh6~^~THn0d71RVH1!ciVReMKqU-J-|fAND4`}CL{|6s%>Hf!YBh at Iz> zm!*~iS>Y>(6F;D&n2Nd0j{OX~eRS?qqVKE)Ju~4mocR#Fe-X}k#ie(debpoIzHv&$ z&e5t*us~j971);tkN^x>fjr4nf~}y9+NM1(t1By$XL_L<0pag(9JMN-$r;gZ6xKz8 zVu%i}6)~#oaMTe$LU0TZhAIZa?Qq7Pgk at M?...

I indeed used is.na() to check length, as I was not sure weather lenght() was a simple query or would go through the whole vector to count the elements. So to sum up, function calls are expensive, therefore recursion should be avoided, and growing the size of a vector (which is probably reassigning and copying?) is also expensive. Thank you for your help! On 04/19/2016 11:51 PM, Duncan

Hello everyone, I am learning R since recently, and as a small exercise I wanted to write a recursive mergesort. I was extremely surprised to discover that my sorting, although operational, is deeply inefficient in time. Here is my code : > merge <- function(x,y){ > if (is.na(x[1])) return(y) > else if (is.na(y[1])) return(x) > else if (x[1]<y[1])