02-17-2014
Where are exactly are you stuck?
How far have you gotten so far?
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
i tried resize command , but it's not working...... (4 Replies)
Discussion started by: gaurav123
4 Replies
2. Shell Programming and Scripting
Hi,
I am a newbie in unix programming so maybe this is a simple question.
I would like to know how can I make a script that outputs only the values that are not between any given start and end positions
Example
file1:
2 30
40 80
82 100
file2:
ID1 1
ID2 35
ID3 80
ID4 81
ID6 160... (1 Reply)
Discussion started by: fadista
1 Replies
3. Shell Programming and Scripting
Hi,
I want to match and print columns that match.
So my file looks like this:
h1 20 30 h1 25 27
h2 50 70 h2 90 95
h2 60 80 h2 70 75
h3 130 150 h3 177 190
h4 140 190 h4 300 305
So there are 6 columns. Column 1 and 4 are names. I am able to get the... (2 Replies)
Discussion started by: kylle345
2 Replies
4. UNIX Desktop Questions & Answers
Hi Everyone!
I was wondering if there's an easy way to have terminals (gnome-terminal for instance) be open in such a way that they're not overlapping each other?
I suppose I could play around with the --geometry option but that would imply me checking whether a terminal is already at a given... (3 Replies)
Discussion started by: anthalamus
3 Replies
5. Programming
I am making a game, but I can't figure out how to put one image over the other. The background of the front image, covers up the picturebox under it.
For example, I have two fish images, but when one is in front of the other, its background covers up the other fish.
I attached a picture as an... (1 Reply)
Discussion started by: romeo5577
1 Replies
6. Solaris
hey guys,
i'm having trouble with a real time multi threaded program that uses lots of shared memory on solaris 8. it sometime crashes out of the blue, a randomness that suggests some sort of memory leak or shared memory overlap.
any tips? freeware or otherwise useful software?
any way i can... (2 Replies)
Discussion started by: princeofnothing
2 Replies
7. IP Networking
Greetings folks,
I have a rather lengthy list of banned IP ranges in iptables. Initially it was constructed as a rather ad-hoc affair, then later I discovered a site which had IP Block By Country lists, and imported several into iptables.
If possible, I'd like to be able to verify if the list... (0 Replies)
Discussion started by: putter1900
0 Replies
8. UNIX for Dummies Questions & Answers
Dear Gurus,
I have 57 tab-delimited different text files, each one containing entries in 3 columns. The first column in each file contains names of objects. Some names are present in more than one file. I would like to find those names and store them in a separate text file, preferably with a... (6 Replies)
Discussion started by: Unilearn
6 Replies
9. UNIX for Dummies Questions & Answers
Hi All,
I wish to merge two files:
file1: with header
rsSNP-ID Chromosome Chr-Pos
rs171 1 175261679
rs242 1 20869461
rs538 1 6160958
file2: without header
disease:AAT deficiency:M0525101 rs1243168 20109307 1
disease:AAT deficiency:M0525101 rs4900229 20109307 1... (3 Replies)
Discussion started by: luoruicd
3 Replies
10. Shell Programming and Scripting
I have 2 files; file 1 having smaller positions that overlap with the positions with positions in file2.
file1
aaa 20 22 apple
aaa 18 25 banana
aaa 12 30 grapes
aaa 22 25 melon
file2
aaa 18 26 cdded
aaa 10 35 abcde
I want to get something like this
output
aaa 18 26 cdded banana... (4 Replies)
Discussion started by: anurupa777
4 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)