8 More Discussions You Might Find Interesting
1. UNIX for Beginners Questions & Answers
I have a file that looks like this:
>ID_1
ATGCATGC
>ID_2
ATGCATGC
>ID_3
ATGCATGC
>ID_4
ATGCATGC
And I am using the following script to "extract" specific positions from the sequences:
awk '/^>/{id=$0; next}{ print id "\n" substr( $1,1,1 ) substr ($1,4,2 ) substr ($1,7,1) }'... (12 Replies)
Discussion started by: Xterra
12 Replies
2. UNIX for Advanced & Expert Users
I was trying to copy all debs from apt cache to some storage location and I was taking this approach...
/var/cache/apt/archives# ls -1 | grep -v jdownloader | fgrep .deb | xargs cp /media/eshant/L-STORE/Softwares/openjdk/an error bla_bla.deb is a not directory stalled me
Suggestions please... (9 Replies)
Discussion started by: ezee
9 Replies
3. UNIX for Dummies Questions & Answers
Reference (to previous post title): Help_Beginner in Unix
I need assistance in terms of troubleshooting this codes.Though it not complete for the required task,shedding of any idea will be appreciated.
the information about the code is the thread referenced above
Code:
#!/bin/ksh
touch... (1 Reply)
Discussion started by: moraks007
1 Replies
4. Shell Programming and Scripting
I have input file like this
Input file:
ABC|abc_etc_passwd
XYZ|XYZ_etc_passwd
zXY|XYZ_etc_passwd
IJK|test_etc_passwd
KLM|test_etc_passwd
i want to do following in a loop.
grep 'ABC' *abc_etc_passwd*
grep 'XYZ' *XYZ_etc_passwd*
grep 'ZXY' *ZXY_etc_passwd*
i have tried this
for i... (2 Replies)
Discussion started by: pinnacle
2 Replies
5. Shell Programming and Scripting
I am new to awk, can somone please correct the following script
awk -F "," 'BEGIN {
foreach ((getline < "file1.csv") > 0)
{i++
a=1 --> assuming the first column in the row will be stored in a
foreach (a in f1) {
if (a == $5) continue
print a;
}
}
} file2.csv'
Here is what I... (11 Replies)
Discussion started by: nuthalapati
11 Replies
6. Shell Programming and Scripting
Dear Collegues is the below given is correct ?
#!/usr/bin/perl
$a = @ARGV;
while ($a = @ARGV) {
exec "./jagan ../dat/ml_in @ARGV";
}
Jagan (0 Replies)
Discussion started by: jaganadh
0 Replies
7. Shell Programming and Scripting
grep pattern a.log|grep -e "p1" |cut -d":" -f1,2,3,4,8,9,10|cut -d"/" -f5 -e "p2" |cut -d":" -f1,2,3,4,6|cut -d"/" -f5 >> file
Dont know why the above command isnt working :-(
can someone correct me... (8 Replies)
Discussion started by: wannalearn
8 Replies
8. UNIX for Dummies Questions & Answers
Hello everyone,
what is the best program for listening to mp3s and waching .avi videos?
thanks
Tay
PS am I the first all linux cybercafe in the world?
PPS all users are on mandrake, and the customers are loving its speed and security! (3 Replies)
Discussion started by: tayoz
3 Replies
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)
04-29-2013
How to know which software is correct?