similar to: Newbies to CentOS List

Is there a step by step approach to securing CentOS 4X (or even RHEL 4X)? I don't mean the stuff in the docs/security guide but a working step by step guide? There used to be packages like rkhunter and tripwire but I don't know if the ones in rpmforge/kbs repo are up to date. Thanks, Josh.

I've got a CentOS server that crashes due to a bad hard disk. I have got a spare disk and need to format and reinstall CentOS from the SERVER CD. Backup and reinstall is a major PITA because of some of the customisations that I've done e.g. the DNS Server is set to log queries (the default does not do this). Any tips on :- - backing up and reinstalling (is a script available)? - is the

Just a tag-on for the thread about list posting etiquette, etc., etc. The following is a link to an excellent (if wordy) how-to-do-it-right instruction manaual replete with links to other treatises on the topic. The entire text of this document is emailed to the mailing list on the 1st of each month. This is the Cadillac of etiquette manuals. http://www.linux-sxs.org/index2.html Enjoy, --

Hi! I'm having some issues on both conceptual and technical levels for selecting the right combination of variables for this model I'm working on. The basic, all inclusive form looks like lm(mic ~ B * D * S * U * V * ICU) Where mic, U, V, and ICU are numeric values and B D and S are factors with about 16, 16 and 2 levels respectively. In short, there's a ton of actual explanatory

Regarding InterleavedAccessPass - sure, but proper strided/interleaved access optimization ought to have a positive impact even without target support. Case in point - Hal enabled it on PPC last September. An important difference vs. x86 seems to be that arbitrary shuffles are cheap on PPC, but, as I said below, I hope we can enable it on x86 with a conservative cost function, and still get

Michael Smith wrote: >Whilst I accept that there are many good uses for chunked data, I >think the transformation is trivial, particularly given certain >characteristics of the Ogg container. Remember, the data, if you read >an ogg stream into memory, is _already_ likely to be non-contiguous, >due to ogg's structure. It's trivial, and has insignificant additional

Hi Michael, Sometime back I did some experiments with interleave vectorizer and did not found any degrade, probably my tests/benchmarks are not extensive enough to cover much. Elina is the right person to comment on it as she already experienced cases where it hinders performance. For interleave vectorizer on X86 we do not have any specific costing, it goes to BasicTTI where the costing is not

OK guys and gals ... can we please stop all the fighting? When technical questions are asked, they should be answered. I lot of people on this list have something that a lot of newbies need ... experience. So answering a question with "RTFM" or "JFGI" is not going to impart any of your experience ... which is one of the things they need and want. Also ... if someone attacks

Hi all, The remaining issue to be decided for the OggPCM2 spec is the support of chunked vs interleaved data. Just so that everyone understands what we are talking about, consider a stereo file that gets stored as an OggPCM file. Within an OggPCM packet, the audio samples for the left and right channels can be stored as interleaved where the samples would be: l0, r0, l1, r1, ..... lN, rN

Hi there! I'm not sure I can create a minimal example of my problem, so I'm linking to a minimal .RData file that has only two objects: obs and exp, each is a 6x9 matrix. http://dl.dropbox.com/u/10364753/test.RData link to dropbox file (I hope this is acceptable mailing list etiquette!) Here's what happens: > obs[1, 1] [1] 118 > exp[1, 1] [1] 118 > obs[1, 1]-exp[1, 1] [1]

Hello, I m trying to set vector width using #pragma clang loop vectorize_width(32) but i m getting width 8 for the following kernel; #define M 128 #define N 128 #define SQRT_FUN(x) sqrtf(x) int main(int argc, char** argv) { /* Variable declaration/allocation. */ double float_n = (double)N; double data[N*M]; double corr[M*M]; double mean[M]; double stddev[M]; uint32_t

Friends, Romans, Countrymen, lend me your ears! Or, in this case, your eyes. It has become a problem I've noticed over and over again, that we tend to think the mailing list is some sort of forum, used to post whatever your hearts desire. This list, not unlike any other mailing list, has a purpose. A focus if you will. Hopefully this 'document' will point out some key things we

HI all, John Kkoleszar has asked for the option of storing data. He gave the rational that a) SIMD optimized filters b) Writing filter chains. Conrad Parker supported this say that both Core Audio and Jack operate on multiple single channel buffers. On IRC both Jean-Marc and MikeS argued that if OggPCM supports interleaved, the addition of chunked is hard to justify. My slant on the

Dear LLVMdev, I've noticed an unusual behavior of the LLVM x86 code generator (with default options) that results in nearly a 4x slow-down in floating-point throughput for my microbenchmark. I've written a compute-intensive microbenchmark to approach theoretical peak throughput of the target processor by issuing a large number of independent floating-point multiplies. The distance

So turns out it is a full reproducer after all (choosing to vectorize on AVX), good. > The details are in PR29025. Interesting. (So we should carefully insert unconditional branches inside shuffle sequences, eh? ;-) > But if we modify the program by adding "*out++ = 0" right after "*out++ = q;" (thus eliminating the pesky <12 x i8>), we get: Indeed such

Not sure what the standard etiquette around these parts is for how long to wait for a reply but I thought it might be faster than this... Or did I breach etiquette in my original email? If so, I'd appreciate someone explicitly telling me "your email was bad and you should feel bad" I cope poorly with radio silence. Thanks in advance for any reply at all, Mark. -----Original

e deleflie <edeleflie at gmail.com> ... > ok, I do realise that the extending the maximum channel count may be > difficult ... there's gotta be a way to do it though. Perhaps a comparison of the FLAC structure with that of Vorbis will help. Within a FLAC stream the audio is split into blocks which are grouped (interleaved). But within each block the eight channels are chained

Hello everyone, I tried to compress audio with opus-1.3.1/src/opus_demo.c recently, which works fine on mono and stereo data . Now I want to compress interleaved 7 channels pcm/wav ( recorded by Microphone array :6mic+ 1reference signal ) with opus, But I have not found an interface that compress multi-channels pcm/wav. 1、Is there a multi-channel compression interface can be used in my case? If

Interleaved access is not enabled on X86 yet. We looked at this feature and got into conclusion that interleaving (as loads + shuffles) is not always profitable on X86. We should provide the right cost which depends on number of shuffles. Number of shuffles depends on permutations (shuffle mask). And even if we estimate the number of shuffles, the shuffles are not generated in-place. Vectorizer

Perhaps, the question is silly. But, I prefer asking it before making a mistake. I have just packed a binary distribution of R for Windows3.1/Win32s. It is equivalent to the previous one for Win95/NT (R-0.61.3 + many of the available packages) and it is compiled with egcs-mingw32 (GPL not a commercial compiler). Now, in preparing the README, I put the following sentence: