CBBS(R) 4.0.3b 09/12/91 14:20:00 Y/N: want CBBS "1st time user" info?^U ?^U ?^U ?n;ward;christensen;odraw;;fullc;piss Logging name to disk... You are caller 223668; next msg =45134; 373 active msgs. Prev. call 09/11/91 @ 14:21, next msg was 45131 Recording logon for next time... Use FULL? to check assignments ?^U ?xxxxx "Mine" command checking for msgs TO you, ^K >Function:?dir c:log;dir c:killed;dir summary;type-20 log,ward c;or;*;short LOG. 10 KILLED. 17 SUMMARY. 24 09/11/91,14:21:23,223652,2,WARD CHRISTENSEN,, E#45131, E#45132,16 09/11/91,14:39:20,223653,2,DON PIVEN,,2 09/11/91,15:52:00,223654,2,BILL NATT,,1 09/11/91,17:53:24,223655,9,ERIC BOHLMAN,, E#45133,8 09/12/91,02:00:28,223656,2,ALEX ZELL,,4 ]Chinet down again. Some modems answer, man xxx machine remains mute; another modem answers at 1200.... ALEX ZELL, 09/12/91,03:08:02,223657,1,SCOTT WHITTLE,,7 09/12/91,03:32:53,223658,1,JAMES TOLIVER,chicago/Il.,6 09/12/91,03:38:22,223659,2,RON WRIGHT,,8 09/12/91,04:54:07,223660,9,JAMES KARAGANIS,,3 09/12/91,06:25:37,223661,1,RON LUCAS,chi,25 09/12/91,07:07:38,223662,2,CHRIS GILMORE,,2 09/12/91,08:30:21,223663,2,TOM DIBLASI,,5 09/12/91,10:50:14,223664,1,DICK ALEXANDER,Chicago,6 09/12/91,11:10:37,223665,2,DONALD DOCKMAN,,2 09/12/91,12:38:03,223666,1,CHRIS BENTLEY,,3 09/12/91,13:20:28,223667,2,JAMES SCHMIDT,,1 09/12/91,14:20:04,223668,2,WARD CHRISTENSEN,, 45131 09/11/91 WARD CHRISTENSEN => JERRY OLSEN: "R/REMOTE COMPUTING" 45132 09/11/91 WARD CHRISTENSEN => ALL: "LZH?" 45133 09/11/91 ERIC BOHLMAN => WARD CHRISTENSEN: "R/LZH?" ---- End of summary ---- Retrieving flagged msgs: C skips, K aborts. Msg 45131 is 10 line(s) on 09/11/91 from WARD CHRISTENSEN to JERRY OLSEN re: R/REMOTE COMPUTING What is your remote application? When I first saw REMOTE, in about maybe '86, I dialed into another guy's system, using ADM-3A emulation! I am looking at my PC Anywhere book, and sorry, it is from '86, so things may have changed, but they HYPE the point that you don't HAVE to even have a PC to call in. Of course if you need graphics, and if the 25th line "hokeyness" necessitated by calling in with a 24-line screen are a problem, or if you don't like having to press "esc-1" for F1, or "esc-U" for up-arrow, then this isn't for you. Depends upon the application, frequency of use, need for convenience, etc. Msg 45132 is 30 line(s) on 09/11/91 from WARD CHRISTENSEN to ALL re: LZH? Has anyone else "putzed" around with LZH algorithms? I started with a paper on it, and took the pseudo-code example it had, and implemented it in my favorite programming language - PMATE editor macros (took under 300 keystrokes to code a full LZH encoding algorithm - this is a VERY net programming language!). The output is basically a bunch of numbers. The decoding program starts with a table consisting of the possible codes in the "set" (such as ascii, or all 256 possible binary values) and starts decoding. The thing I was wondering: do any lzh routines do a 2-pass technique, in which, after encoding the LZH, they then Huffman encode the resulting NUMBERS? Also in Pmate, I wrote an output number frequency histogram, and it seems quite "clumpy", implying Huffman encoding would do a lot to further reduce the output data size. Of course, other tricks could be used: if the output is a byte with the 8th bit off, it is "straight ASCII", while if the 8th bit is on, then it is perhaps a 11- or 15-bit value (ignoring the 8th bit) which represents a point in the code table. Here's the Pseudo-Code. [1] Initialize string table; (to 256 entries, 00-FF for example) [2] [.c.] <- empty; [3] K <- next character in charstream; [4] Is [.c.]K in string table? (yes: [.c.] <- [.c.]K; go to [3]; ) (no: add [.c.]K to the string table; output the code for [.c.] to the codestream; [.c.] <- K; go to [3]; ) Msg 45133 is 09 line(s) on 09/11/91 from ERIC BOHLMAN to WARD CHRISTENSEN re: R/LZH? What you're describing sounds more like LZW coding rather than LZH (LZW was the coding scheme originally used in ARC. It's fallen a bit out of favor because Unisys has a patent on it and recently started enforcing it). The implementations of LZH that I've seen rely on a "sliding dictionary" which keeps track of the last 8K or so of input. If a string of text can be found in the dictionary, it's replaced with a code consisting of an offset, length pair ("insert the 20 characters that you saw 550 bytes ago"). These codes are then subjected to Huffman compression. No dup. chars. >Function:?