search for: 1000x

Dear R-Core team, Dear Rcpp team and other package teams, Dear R users, The new package 'bit64' is available on CRAN for beta-testing and code-reviewing. Package 'bit64' provides fast serializable S3 atomic 64bit (signed) integers that can be used in vectors, matrices, arrays and data.frames. Methods are available for coercion from and to logicals, integers, doubles,

Dear R-Core team, Dear Rcpp team and other package teams, Dear R users, The new package 'bit64' is available on CRAN for beta-testing and code-reviewing. Package 'bit64' provides fast serializable S3 atomic 64bit (signed) integers that can be used in vectors, matrices, arrays and data.frames. Methods are available for coercion from and to logicals, integers, doubles,

...ds to be explicitly set in plugins, so out-of-tree plugins won't have this check by default. - pop3_lock_session=yes could cause deadlocks, and with maildir the uidlist lock could have been overridden after 2 minutes causing problems - PAM wasted CPU by calling a timeout function 1000x too often - Trash plugin was more or less broken with multiple namespaces and with multiple trash mailboxes -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 189 bytes Desc: This is a digitally signed message...

...ds to be explicitly set in plugins, so out-of-tree plugins won't have this check by default. - pop3_lock_session=yes could cause deadlocks, and with maildir the uidlist lock could have been overridden after 2 minutes causing problems - PAM wasted CPU by calling a timeout function 1000x too often - Trash plugin was more or less broken with multiple namespaces and with multiple trash mailboxes -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 189 bytes Desc: This is a digitally signed message...

Hi ? This is giving me a headache. I?m trying to do a relatively simple optimization ? actually trying to approximate the output from the Excel Solver function but at roughly 1000x the speed. ? The optimization parameters look like this. The only trouble is that I want to add a constraint that sum(wgt.vect)=1, and I can?t figure out how to do that in optim. Mo.vect <- as.vector(tail(head(mo,i),1)) wgt.vect <- as.vector(tail(head(moWeightsMax,i),1)) cov....

...ead on this list from May 2011 that indicated one would need one connection per user per subscribed folder. However, I know that user doesn't have 10 folders, let alone 10 subscribed folders! I can increase, it but it's not going to scale well. And there are people on this list with many 1000x users than I have - so how do they deal with that? 127.0.0.1 is obviously webmail (IMP5). So, how/why am I seeing this, and should I be concerned? Simon

.../O space. Or workarounds > for processor bugs. The only real user (other than this patch) is the > Intel microcode update driver. Memory serialization is sufficient in > all other cases on x86. One could imagine someone wanting to use it in a timing loop or something, and a 100x or 1000x slowdown might ruin their day. But it's not really all that important. I don't really see a good reason to not have a separate sync_core operation, but we can always add it later if needed. The bigger immediate issue is that we seem to be having an emerging tools compatibility probl...

...y.com> > Sent: Friday, October 21, 2016 10:37:44 AM > Subject: Re: [llvm-dev] [RFC] Removing PowerPC/Darwin Support? > > > The only part I'd like to see *NOT* removed is the darwin PPC asm > format. Not because I care about ppc/darwin, but because that format > is like 1000x easier to read -- especially for those of us who > aren't PPC experts -- than the insane standard PPC assembly format. > :) > > > On Thu, Oct 20, 2016 at 7:57 PM, Hal Finkel via llvm-dev < > llvm-dev at lists.llvm.org > wrote: > > > Hi everyone, > > I...

I noticed that my server has a lot ca. 1000x auth failure from different alocated in China / Romania and Netherlands per day since 3 days It looks to me like somebody was trying to get into server by guessing my password by brute force. what would be the best to stop this attack and how? the server running apache mysql and ftp PORT STATE...

I was experiencing a strange pattern of slowdowns when using sample.int(), where sampling from a one population would sometimes take 1000x longer than taking the same number of samples from a slightly larger population. For my application, this resulted in a runtime of several hours rather than a few seconds. Looking into it, I saw that sample.int() is hardcoded to switch algorithms when the population is larger than 1e+7, and I wa...

...t late IR-level passes can insert target-specific intrinsics, those can be matched to pseudo instructions, and those pseudo instructions can be expanded (as late as necessary) by a custom inserter. I agree that this may add more boiler-plate work, but it is not immediately obvious why this would be 1000x messier. > > -Hal I should probably qualify this with "1000 times messier for me" :) In this case the whole problem fit neatly in a simple IR level module pass. I had to create an alternate calling convention for one part but otherwise this IR pass made an otherwise very messy...

...I copied the file to 'NUL' to avoid storage altogether. Test files .tar.gz can be found on http://www.vulnscan.org/tmp/samba-testcase-slow-files.tar.gz Test code I used was: echo.|time copy \\green\xyz\500M nul echo.|time And for the small files case: echo.|time xcopy \\green\ramdisk\10k-1000x /S/E/K/H c:\local\10k-1000x\ >nul echo.|time Explorer gives very similar timings by the way. I repeated the tests on all clients multiple times. I also tried the "100 files in 10 directories" test case to see if maybe the problem was many files in one directory, this made no differe...

...strip ) On Thu, May 3, 2018 at 10:52 AM, Michael Ashton <m.ashton at enduringinvestments.com> wrote: > Hi ? > > This is giving me a headache. I?m trying to do a relatively simple optimization ? actually trying to approximate the output from the Excel Solver function but at roughly 1000x the speed. ? > > The optimization parameters look like this. The only trouble is that I want to add a constraint that sum(wgt.vect)=1, and I can?t figure out how to do that in optim. > > Mo.vect <- as.vector(tail(head(mo,i),1)) > wgt.vect <- as.vector(tail(head(moWeig...

...May 3, 2018 at 10:52 AM, Michael Ashton > <m.ashton at enduringinvestments.com> wrote: >> Hi ? >> >> This is giving me a headache. I?m trying to do a relatively simple optimization ? actually trying to approximate the output from the Excel Solver function but at roughly 1000x the speed. ? >> >> The optimization parameters look like this. The only trouble is that I want to add a constraint that sum(wgt.vect)=1, and I can?t figure out how to do that in optim. >> >> Mo.vect <- as.vector(tail(head(mo,i),1)) >> wgt.vect <- as.vec...

...rget-specific >> intrinsics, those can be matched to pseudo instructions, and those pseudo >> instructions can be expanded (as late as necessary) by a custom inserter. I >> agree that this may add more boiler-plate work, but it is not immediately >> obvious why this would be 1000x messier. >> >> -Hal > > I should probably qualify this with "1000 times messier for me" :) > > In this case the whole problem fit neatly in a simple IR level module pass. > > I had to create an alternate calling convention for one part but otherwise > th...

hi, what quality is recommended to encode to for cd quality? i mean, for mp3, i used to encode to 128kb/s ( maybe it's a bit low.. ).. so what quality ( or bitrate ) do you recommend? thanks, gabor p.s: i'm sure this queston was asked here at least 1000x but it's hard to search for 'bitrate' here :-) <p><p><p>--- >8 ---- List archives: http://www.xiph.org/archives/ Ogg project homepage: http://www.xiph.org/ogg/ To unsubscribe from this list, send a message to 'vorbis-request@xiph.org' containing only the w...

...t;>> intrinsics, those can be matched to pseudo instructions, and those pseudo >>> instructions can be expanded (as late as necessary) by a custom inserter. I >>> agree that this may add more boiler-plate work, but it is not immediately >>> obvious why this would be 1000x messier. >>> >>> -Hal >> I should probably qualify this with "1000 times messier for me" :) >> >> In this case the whole problem fit neatly in a simple IR level module pass. >> >> I had to create an alternate calling convention for one pa...

...t late IR-level passes can insert target-specific intrinsics, those can be matched to pseudo instructions, and those pseudo instructions can be expanded (as late as necessary) by a custom inserter. I agree that this may add more boiler-plate work, but it is not immediately obvious why this would be 1000x messier. -Hal > > There are other stubs to be created for other parts of the mips32 > port. > > So I'd like to get a solution to these ugly APP/NOAPP markers. > > Maybe you would not do things this way but I think it's a perfectly > valid approach. > No two...

does anyone know much about resizing different versions of images with file_column? i tried it and everything works fine, but my question is can you do more than just make sizes with a version of image? i''m working on a photo album and i would like to resize the image to a medium size, but create a thumbnail as well and crop anything left to make the thumbnail a perfect square. --

...10:52 AM, Michael Ashton >> <m.ashton at enduringinvestments.com> wrote: >>> Hi ? >>> >>> This is giving me a headache. I?m trying to do a relatively simple optimization ? actually trying to approximate the output from the Excel Solver function but at roughly 1000x the speed. ? >>> >>> The optimization parameters look like this. The only trouble is that I want to add a constraint that sum(wgt.vect)=1, and I can?t figure out how to do that in optim. >>> >>> Mo.vect <- as.vector(tail(head(mo,i),1)) >>> wgt...