Dear All,
I have to reduce the redundancy of a file that is like this:
Basically, this file describe a network with relative nodes and edges.
The nodes are the different letters and the edges are represented by the numbers (in particluar 0, means that the direction of edges is from left to right, 1 is viceversa).
As you may notice, some interaction are duplicates (in bold). For example interaction:
a-->b
b<--a
Are exactly the same. The first line interaction go from a to b (0 means inreaction go from left to right), in second line interaction still go from a to b (1 means interaction go from right to left).
What I would like is to filter the file above and output a file like this:
So, all the duplicated interaction are removed.
!Interactions
are not the same! Both go from left to right but is different the starting node.
a-->b
b-->a
hi
i have a very simple problem
iam moving files from download to archive folder
but before such a transfer want to make sure no two file of same
are present in my download directory
how to check for redundant file names
i thought of using WC but it counts inside the file (lines and... (5 Replies)
I am really really new to Unix. I'm lost with so many books around for different shell. I'm thinking of taking a course on Operating Systems but it contains a lot of Unix programming I think. For example, someone was talking about a "which" command. But I wasn't able to figure out what it does...... (10 Replies)
HPUX 11iv2 #!/bin/sh
Hi all. I have a script that results in the creation of an ascii file which is ultimately emailed out to several people. The email wraps each line so I would like to reduce the font size of the ascii file. I looked at nroff and also tr but it wasn't clear to me how to do... (2 Replies)
Hello,
I want to compress any given file or directory. I used
1)gzip
2)zip
But when I do "ls -l". I found that the zipped file is in fact greater in size than the original file.
Can you please tell me the commands which will show me the difference in its size. (2 Replies)
My ZFS on debian media server just died in a power outage, the zpool status shows this:
NAME STATE READ WRITE CKSUM
tank UNAVAIL 0 0 0 insufficient replicas
raidz1 UNAVAIL 0 0 0 corrupted data
sda ONLINE 0 0 0
sdb ONLINE 0 0 0
sdf ONLINE 0 0 0
sdh ONLINE 0 0 0
sdi ONLINE 0 0 0
sdk ONLINE 0... (2 Replies)
I have a file with 400 characters
How can I create another file with only a portion of them (like 300 within 400) and get rid of the rest?
Thanks (5 Replies)
Dear all,
i have a lot of .pdf files that i need to reduce size with pdf2ps and ps2pdf app. I need a script which i can reduce file size of all .pdf files in every subfolder of WORKDIR folder.
folder tree like:
WORKDIR
SUBBWORK DIR1
SUB_SUB_WORKDIR1
... (1 Reply)
I want to find which pattern or strings have occurred more than one time so that I can remove unnecessary redundancy.
For example:
If I have the sentence:
A quick brown brown fox jumps jumps jumps over the lazy dog
in a file, then I want to know that
1. the word "brown" has... (7 Replies)
I am using xlC (Version: 11.01.0000.0011).
While build i am using "-g" to have debug information in build.
there are many object files (>500) due to which resultant shared file (.so) will have huge size.
I can't reduce optimization level.
Is there any way or flag is present by using which i... (2 Replies)
Discussion started by: Abhi04
2 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)