search for: strenghts

Hi, I try to compute circular means for a matrix with NAs, but the function "circ.mean" return only means for lines with complete values and do not accept "na.omit=T" or "na.rm=T", or "na.action=na.omit", or "na.fail=T". Also, I try to use "polar.plot" of the package poltrix with the same matrix, but angles are not display because of

Hi people! I have a few problems with the password strength in Samba. I have a PDC with LDAP on Debian Stable, with a few packages from backports. The problem is that I can't find a way to enforce strenght to the passwords of the users. I can't define a policy to force things like: number of uppercase letters, number of downcase letters, number of numbers in the password, to check the

My % of packets lost vary usually in function of signal strenght. Since i cannot forecast the % of frames i will lost except with the criteria just said, could be a good approach to set the PLC tuning % dynamically during runtime basing it statistically on the number of ACKed frames? Does the % of frames lost include silence frames (6 bytes frames, i'm using VBR)? So do i need to consider

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Anyone else using CFS on CentOS 4.4 ? I have started using it today (unimportant stuff for now, for testing), and am wondering what are other people experiences with it. I'm using version 1.4.1, rpms kindly provided by Karan on his repository. My main concern is data loss, not security itself. From what I noticed, the strenght of CFS crypto is

Hi- > I haven't seen a machine in which OR is faster than ADD nor more energy-efficient. They're all done by the same ALU circuitry which delays the pipeline by its worstcase path timing. So, for modern processor hardware purposes, OR is exactly equal ADD. Transforming ADD to OR isn't strenght reduction at all. Maybe this is benefical only if you have a backend generating circuitry

I agree the presentation needs work haha. That''s something I really haven''t put a lot of thought into yet. I''m hoping to start polishing it up after I get the first half edited and cleaned up text-wise. Since it seems everyone is interested in it, I can definitely post a summary and TOC; I had one up and then when I launched the new site I didn''t put it back

Hi, On Tue, Jul 26, 2011 at 11:32 AM, Matt Johnson <johnso87 at crhc.illinois.edu>wrote: > Hi Daniel, > > > Hi folks, > > > > I couldn't find a specific XOR (OR and AND) optimization on llvm, and > > therefore I am about to implement it. > > But first I would like to check with you guys that it really does not > exist. > > > > For a

...roups?hl=en&lr=&ie=UTF-8&selm=b6f55s%24256q%241%40FreeBSD.csie.NCTU.edu.tw&rnum=6> and the rationale for what I am trying to do here <http://marc.theaimsgroup.com/?l=rsync&m=105660948415347&w=2> Down to what I am asking help with: I am _not_ a C hacker at all, my strenghts are Perl -- if anywhere at all. So I would appreciate your advise before I shoot myself in the foot. Thanks for your patience. I have studied the sources and gotten down to sender.c (cvs 1.17), in particular the line where it calls do_open() and I am intending to create do_popen as an alterna...

Josh Coalson wrote: >> Thus,... if I currently have my index-based wav files (that is EAC >> makes >> track-number.index-number.wav) from an cdda,.. and the corresponding >> CUE >> file (EAC writes it in min:sec:frame),... than I could use sox to >> concatenate the single files to one big file,.. >> encode it to flac with the CUE infos,.. >> And

Hi Daniel, > Hi folks, > > I couldn't find a specific XOR (OR and AND) optimization on llvm, and > therefore I am about to implement it. > But first I would like to check with you guys that it really does not exist. > > For a simple loop like this: > > nbits = 128; > bit_addr = 0; > while(nbits--) > { > bindex=bit_addr>>5; /* Index is

"The fact that the loop is unrolled explains why the XORs, SHLs, and ORs are not folded into 1." I dont see why the unrolling explains it. "I think he is trying to say this expression generated by unrolling by a factor of 4 can indeed be folded into a single XOR, SHL and OR. " Precisely. The code generated by unrolling can be folded into a single XOR and SHL. And even if it

--- Christoph Anton Mitterer <calestyo@scientia.net> wrote: > There is one thing I forgot to ask last time.... when using that cue > feature from flag,.. is it possible to store different tags (title, > composer, etc) for each range? And if so how do I specify this on the > command line? unfortunately, no. http://flac.sourceforge.net/faq.html#general__no_cuesheet_tags > >

hello, Does our beloved Centos project have a page where one can request that an RPM package be built, especially for C5? How about alerts when those requests have been satisfied? I know about 3rd party repos like rpmforge, epel, and kbextras. I can search those in YUM. Centos seems to have specialized as a server OS in the past, but my experience is that it is an up and coming

Two announcements, so I''ll split this post into two pieces: MR. NEIGHBORLY''S RUBY AND RAILS NOW IN BETA ========================================= My Ruby on Rails book is now in beta. You can roll on over to the website for more information and pricing: http://www.rubyonrailsbook.com/ Here''s a rundown: Beta eBook is available now, print hopefully in July sometime.

Hi, I have Samba 3.0.13 running on Suse 9.2 on an i586. I can browse and connect to the Samba shares on the Linux machine from Windows XP and Mac OSX. However, about 1 min after connecting, the shares are lost and gone from the network environment - same for Windows XP and Mac OSX. From time to time, they "re-appear" only to be gone after another minute or so. The Windows shares

Josh Coalson wrote: >> III) I've read about the CUEsheet feature of flac where you can store >> the data of cuesheets (at least indices and so) as searchpoints in >> flac. >> But the format seems to be in milliseconds while in CDDA frames are >> exact. >> Is it (because one would have rounding errors) not adivsable to use >> this >> feature, and

But even for a very simple loop: int test1 (int *x, int *y, int *z, int k) { int sum = 0; for (int i = 10; i < k; i++) { z[i] = x[i] / y[i]; } return sum; } The initial value of induction variable is not zero after compiling with -O3 -mcpu=power8 x.cpp -S -c -emit-llvm -fno-unroll-loops (see bottom of the email for IR) Also I can write somewhat more complicated loop where step

On May 2, 2014 at 11:53:25 AM, Eric Christopher (echristo at gmail.com) wrote: On Wed, Apr 30, 2014 at 10:34 PM, Philip Reames  <listmail at philipreames.com> wrote:  > Andy - If you're not already following this closely, please start. We've  > gotten into fairly fundamental questions of what a patchpoint does.  >  > Filip,  >  > I think you've hit the nail on

Andy - If you're not already following this closely, please start. We've gotten into fairly fundamental questions of what a patchpoint does. Filip, I think you've hit the nail on the head. What I'm thinking of as being patchpoints are not what you think they are. Part of that is that I've got a local change which adds a very similar construction (called

On 04/29/2014 12:39 PM, Filip Pizlo wrote: > On April 29, 2014 at 11:27:06 AM, Philip Reames > (listmail at philipreames.com <mailto:listmail at philipreames.com>) wrote: >> On 04/29/2014 10:44 AM, Filip Pizlo wrote: >>> LD;DR: Your desire to use trapping on x86 only further convinces me >>> that Michael's proposed intrinsics are the best way to go.