05-10-2015
Moderator's Comments:
|
|
Until the question about this being a homework item is resolved; please do not post ways to solve this problem.
|
|
9 More Discussions You Might Find Interesting
1. Programming
I'm fairly new to python so bare with me. I'm trying to write a script that would calculate my class average from exams. The script will look at a text file formatted like this:
Calculus 95 90 92
Physics 80 85 92
History 90 82 83 95
The output should look like this:
Calculus 92.33... (2 Replies)
Discussion started by: jl487
2 Replies
2. Shell Programming and Scripting
Hi,
I have a file with more than 2,000 rows like this:
05/26/2011,1200,1500
I would like to create a awk shell script that calculate the price average of the second and third field each 5,10 and 20 rows or ask me for the values, starting at first row.
Finally compare the average value... (1 Reply)
Discussion started by: csierra
1 Replies
3. Shell Programming and Scripting
Hello,
I am trying to create a awk script to calculate the simple moving average of two fields but I got only the result of the first field.
Could you please help me to fix this awk shell script
awk -F, -v points=5 '
{
a = $2;
b = $3;
if(NR>=points) {
total_a = 0;
total_b... (1 Reply)
Discussion started by: csierra
1 Replies
4. Shell Programming and Scripting
`/proc/loadavg` give me three indicators of how much work
the system has done during the last 1, 5 & 15 minutes.
How can i get a list of load averages
that each averaged over the last minute for 10 minutes? (2 Replies)
Discussion started by: navidlog
2 Replies
5. Solaris
Hi all
Bit of a silly question, but if I run sar to get the CPU stats (something like this):
sar -u 300 1
The figures that are returned, is it in the above case the average over 300 seconds, or does it just wait for 300 seconds before obtaining the readings? (1 Reply)
Discussion started by: kinetik
1 Replies
6. Shell Programming and Scripting
Hi,
I am in stage of post processing some of my results. I wanted to plot the data against the three axis x,y,z. The data file is quite complicated and i have to take the average of x, y,z over different steps of my test. A typical file look like below:
Time taken:4s
No.of series : 3... (6 Replies)
Discussion started by: begin_shell
6 Replies
7. Solaris
our server is running oracle database, it has:
load average: 1.77, 1.76, 1.73
using only one cpu. is that too high?
thanks. (4 Replies)
Discussion started by: orange47
4 Replies
8. Homework & Coursework Questions
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
Write an awk script(company.awk) for the workers file to find the number of workers of each departman, total... (8 Replies)
Discussion started by: RedJohn
8 Replies
9. Shell Programming and Scripting
Hi everyone,
Has anyone figured out yet how to do pivot table averages using AWK. I didn't see anything with regards to doing averages.
For example, suppose you have the following table with various individuals and their scores in round1 and round2:
SAMPLE SCORE1 SCORE2
British ... (6 Replies)
Discussion started by: Geneanalyst
6 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)