01-28-2014
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
I'm really new at this and wondering how I would go about adding code to my script to verify that all records loaded successfully? (I am loading a file into a table) i'm using the Korn shell.
I'm also having trouble verifying parts in the header as i do not really understand the header and... (3 Replies)
Discussion started by: sheranjem
3 Replies
2. Shell Programming and Scripting
I need to write a script that check users authenting to a particular server
ssh -l
if sucessfull
echo loggin sucess
else
echo login invalid
Any Suggestions ? (4 Replies)
Discussion started by: sriram003
4 Replies
3. UNIX for Dummies Questions & Answers
Hello,
I am new to Solaris.
I've installed Solaris 10.0 and trying to apply all patches. On Java Desktop, I've applied almost all patches but some of patches should be applied manually on the command line.
The patches -should be applied manually on terminal- are downloaded by Sun Update... (1 Reply)
Discussion started by: XNOR
1 Replies
4. Programming
hello every body,
I have to verifiy if the param_key is selectionned twice or more and to print only one occurence i'm using htable what's the good implementation to add to the code to verify this.
code :
{
char *tmpStr = NULL;
ght_iterator_t iterator_param;
void... (0 Replies)
Discussion started by: kamel.seg
0 Replies
5. AIX
Hi,
every midnight hacmp verification is run automatically.
clverify.log says there is no erro bu clutils.log says there is 1 error but when i look at the clverify.log no problem at all.
Below is the output of the clverify.log
what may be the cause of the error in the clutils.log file.
Thanks,... (1 Reply)
Discussion started by: mmersoylu
1 Replies
6. Shell Programming and Scripting
Hi eveyone
I am planning to use crontab to delete all files in my donwloads directory that are older than one hour
I will be using crontab to run this script
find /home/kee/downloads/* -daystart -mmin +59 -type f -name -exec rm -r {}\;
could you please let me know if the above... (1 Reply)
Discussion started by: k33k00
1 Replies
7. Shell Programming and Scripting
Hello again unix.com
I need some help regarding a script.
I have:
function checkform ( form )
{
if (form.pass.value.length < 6) {
alert( "Error." );
form.pass.focus();
document.getElementById('pass').style.backgroundColor="#FFFFFF";
return... (2 Replies)
Discussion started by: galford
2 Replies
8. Solaris
Hi ,
How to ensure the server i logged in OS cluster ?
Is there any command to verify that ?
Regards,
maddy (5 Replies)
Discussion started by: Maddy123
5 Replies
9. Programming
Using ECDSA, how do you verify integrity of Data (D), Given the value for the following:
Random number (r)
Signature (s)
ECpublic Key (K)
Thanks. (0 Replies)
Discussion started by: dragonpoint
0 Replies
10. Forum Support Area for Unregistered Users & Account Problems
Trying to register the Verification step is blocking me. I've allowed all the intrusive Google trackers and Java. Tried different browsers with no blocking. Nothing is working. Says: "Try again later Your computer maybe ... " What weird is in this forum section I can pass the recaptcha but in... (1 Reply)
Discussion started by: Unregistered
1 Replies
LEARN ABOUT DEBIAN
bup-margin
bup-margin(1) General Commands Manual bup-margin(1)
NAME
bup-margin - figure out your deduplication safety margin
SYNOPSIS
bup margin [options...]
DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two
entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids.
For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit
hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by
its first 46 bits.
The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits,
that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits
with far fewer objects.
If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if
you're getting dangerously close to 160 bits.
OPTIONS
--predict
Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer
from the guess. This is potentially useful for tuning an interpolation search algorithm.
--ignore-midx
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
EXAMPLE
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
40
40 matching prefix bits
1.94 bits per doubling
120 bits (61.86 doublings) remaining
4.19338e+18 times larger is possible
Everyone on earth could have 625878182 data sets
like yours, all in one repository, and we would
expect 1 object collision.
$ bup margin --predict
PackIdxList: using 1 index.
Reading indexes: 100.00% (1612581/1612581), done.
915 of 1612581 (0.057%)
SEE ALSO
bup-midx(1), bup-save(1)
BUP
Part of the bup(1) suite.
AUTHORS
Avery Pennarun <apenwarr@gmail.com>.
Bup unknown- bup-margin(1)