Hello,
I have three columns of data of the format below:
<name> <volume> <size>
a 2 1.2
a 2 1.1
b 3 1.7
c 0.7 1.9
c 0.7 1.9
c 0.7 1.8
What I... (3 Replies)
Hi,
I have a file that I want to average. So specifically I want to average every third column for each row.
Here is an example of my file
2 2 2 3 3 3 1 1 1 5 5 5
Heres what I want it to look like after averaging every third column
2 3 1 5
thanks (11 Replies)
Hello,
I am trying to average multiple columns simultaneously while skipping the first column.
I am using this awk line to average one column
awk '{sum+=$3} END { print "Average = ",sum/NR}'
But I want to be able to do it for multiple columns while skipping the first column. There... (4 Replies)
Hello all,
I'm trying to perform an averaging procedure which selects a selection of rows, average the corresponding value, selects the next set of rows and average the corresponding values etc.
The data below illustrates what I want to do. Given two columns (day and value),
I want to... (2 Replies)
Hello,
I have a awk line that averages rows.
So if my file looks like this:
Jack 1 1 1 1 1 1
Joe 1 1 1 1 1 1
Jerry 0 0 0 0 0 0
John 1 1 1 0 0 0
The awk line below skips column 1 and then averaged the rows
awk -F'\t' -v r=3... (3 Replies)
Dear all,
I have the data in the following format. I want to do average of each NR= 5 (rows) for all the 3 ($1,$2, $3) columns and want to print average result in another file in the same format. I dont know how to write code for this in 'awk', can some one help me to write a code for this in... (1 Reply)
Hi
I have 100 xy graphs and need to average these together in a line by line fashion. The value of the x axis are the same. y differs e.g. taking only 2 graphs:
graph 1
x y
1 3
2 5
3 7
4 9
5 11
graph 2
x y
1 4
2 6
3 10 (2 Replies)
Hi,
I have a file with multiple tab delimited columns and I would like to have the average of each column:
Iteration Tree No Lh HMean
1000 1 -78.834717 -78.834717
1100 1 -77.991031 -78.624046
1200 1 -79.416055 -78.761861
1300 1 -79.280494 -78.968099
1400 1 -82.846275 -80.808696 ... (4 Replies)
Hi all,
I have a data file like below, where Time is in the second column
DATE TIME FRAC_DAYS_SINCE_JAN1
2011-06-25 08:03:20.000 175.33564815
2011-06-25 08:03:25.000 175.33570602... (10 Replies)
Hi,
I am trying to average the values from 3 files with the same format. They are very large files so I will describe the file and show some it of. Basically the file has 83 columns (with nearly 7000 rows). The first three columns are the same for each file while the remaining 80 are values... (3 Replies)
Discussion started by: kylle345
3 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)