09-29-2011
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Can some one help me getting last hour of the current time with date command in a script. (7 Replies)
Discussion started by: shehzad_m
7 Replies
2. Linux
Hi
Actually what am trying to ask is , i have an shell script ,now i want to run this shell script for one hour continuously and after one hour it has to stop automatically.
can any one suggest me how to automate the shell script ?
we tried wth the getting the start time and add ing an hour... (8 Replies)
Discussion started by: lalitka
8 Replies
3. AIX
I am setting TZ=EST5EDT,M3.2.0/02:00:00,M11.1.0/02:00:00
Then Setting the date to Mar 14 01:40 EST
date 0314014010
Sun Mar 14 01:40:36 EDT 2010
Note that it show it EST. According to my TZ variable 01:40 Should be in EST only.
On executing date command once again it shows
date
Sun Mar... (4 Replies)
Discussion started by: januuj23
4 Replies
4. UNIX for Dummies Questions & Answers
Currently whenever i run date command output is shown like
Mon Apr 12 05:17:21 IST 2010
When its 17:17 Here.
How would i change it so that it should show.
Mon Apr 12 17:17:21 IST 2010 (8 Replies)
Discussion started by: pinga123
8 Replies
5. Shell Programming and Scripting
I'm trying to do some simple math on a 24 hour time base.
The time is in the format of HM (HoursMinutes)
For example:
2330 #23:30
1800 #18:00
730 #07:30
my problem is with the single-digit hours. If the time is 2200, I use this code:
baseTime=2200
minutes=${baseTime:2:3}... (3 Replies)
Discussion started by: jondecker76
3 Replies
6. UNIX for Dummies Questions & Answers
Hi,
The timestamp is June 06 2011 11:05AM
i need 2 results.
first, an hour added to it, June 06 2011 12:05AM
second, a minute added to it, June 06 2011 11:06AM
How can i do this?
Also when it reaches 12:59, it needs to start from 1 again without giving the output as 13:00. it... (17 Replies)
Discussion started by: irudayaraj
17 Replies
7. AIX
This is a new one on me. We upgraded a system from AIX 5.3 TL 7 to 6.1 TL 7 yesterday. The app people notified us that their cron jobs weren't running at the right time. So I made a test cron entry and here's what I've found:
# crontab -l
* * * * * /usr/bin/date > /tmp/test.log 2>&1
# cat... (2 Replies)
Discussion started by: homeyjoe
2 Replies
8. Shell Programming and Scripting
Hello All,
Is there any *easy* and efficient way to add "one hour" to few fields in a file? . I have done this using a python script and it has hit with performance issues.
I have around 200mi of records, which I need to modify and send across in one hour.
sample input:
'2012-10-17... (2 Replies)
Discussion started by: panyam
2 Replies
9. Shell Programming and Scripting
Hi friends, I want to convert 24 hour timing to 12 hour please help me...
my data file looks like this..
13-Nov-2011 13:27:36 15.32044 72.68502
13-Nov-2011 12:08:31 15.31291 72.69807
16-Nov-2011 01:16:54 15.30844 72.74028
15-Nov-2011 20:09:25 15.35096 ... (13 Replies)
Discussion started by: nex_asp
13 Replies
10. Windows & DOS: Issues & Discussions
Time on unix server shows 8:00a CST
Time on Windows 7 Box shows 8:00a CST
However when you access an NFS share the time stamp on the files show an hour ahead? Talking about a newly created file shows an hour ahead so at 8:00a the file will show a time stamp of 9:00a CST
the problem it... (1 Reply)
Discussion started by: Paul Standley
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)