11-14-2015
9 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Hi all,
Have a small problem.
Back in October the pervious sys-admin (of a client's company) made the necessary adjustments to the system clock for daylight savings (Sydney time - +11 GMT).
As far as I can gather, they just amended the time - NO TIMEZONE !?!
Is there an effective and safe... (5 Replies)
Discussion started by: Cameron
5 Replies
2. UNIX for Dummies Questions & Answers
If I have a file like this, could anyone please guide me how to find the average value in each metrix. The file has got about 130,000 metrixs.
Grid-ref= 142, 235
178 182 203 240 273 295 289 293 283 262 201 176
167 187 187 246 260 282 299 312 293 276 230 191
169 ... (2 Replies)
Discussion started by: su_in99
2 Replies
3. Shell Programming and Scripting
Hi Friends,
Can any one help me with count average of student marks in this file (i can not change structure of the input file):
input file:
1 - student ID
2 - student name
3 - group ID
4 - teacher ID
5 - marks (numbers of marks are different)
1:John Smith:2:3:2 3 4 5
2:Mark... (1 Reply)
Discussion started by: mleplawy
1 Replies
4. Shell Programming and Scripting
Hi,
I'm thinking of running a script via cron (every hour) to do the log rolling.
The file is "file.txt" and there going to be 10 files rolling (file.txt.n).
The file is being written constantly by an application.
The script will do the following:
1. cat file.txt > file.txt.0
2. cat... (0 Replies)
Discussion started by: chaandana
0 Replies
5. AIX
Hi,
is it possible to roll back currently updated Technology level ? what are steps required?
Regards,
Manoj (2 Replies)
Discussion started by: manoj.solaris
2 Replies
6. Linux
I am writing a software product and hope that it will work on a variety of Linux distributions. At the moment, I am trying to create some kind of Linux version of patches/upgrades of installed software. Gathering information on available updates isn't hard, nor is installation of updates, but I... (27 Replies)
Discussion started by: Brandon9000
27 Replies
7. UNIX for Dummies Questions & Answers
Can some one help me related to .sql file issue.
I have a .sqlfile and tried to read the file thru unix. In the .sqlfile I have error rows as well and when error comes I dont want to proceed further and need to roll back all the transactions.
sample .sql file below
insert into
test... (2 Replies)
Discussion started by: sri_aue
2 Replies
8. UNIX for Advanced & Expert Users
I want to get CPU average value only (not required user CPU & memory) with each hours on individual date. The sample output is below
| | | User |Memory| User |
Date | Time |CPU %|CPU % | % |Mem % |
03/02/2015|00:00:00| 24.56| 20.66| 89.75| 63.48|... (13 Replies)
Discussion started by: Saravanan_0074
13 Replies
9. Shell Programming and Scripting
How to calculate percentage non zero value occurrence base on value col 1 and 2
2017 a 0
2017 a 2
2017 a 4
2017 a 2
2017 a 0
2017 b 2
2017 b 6
2016 a 2
2016 a 2
2016 b 2
2016 b 8
2016 b 0
2016 b 0
2016 c 2
2016 c 2
2016 c 0
i manage to get average
# awk '{A++;B+=$3}END{for(X in... (1 Reply)
Discussion started by: before4
1 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)