- cypherpunks-legacy - lists.cpunks.org

No Subject
by concerned＠aol.com 17 Dec '03

17 Dec '03

Oct.30th,1998 Y2K Solution! 8 Pine Circle Dr., Silicon Valley, Calif. OTC Company "TCFG" 21 st. Century Frontier Group has through several members of their administrative research department leaked vital information about their companies efforts. Everyone was tight lipped and interviews were refused, and through un-named sources we have learned that the technology and software solution are in the process of being patented! In over 1640 trials, using various data systems the use of the new technology and software solved the Y2K problem 100% of the time. This small publicly traded company "TCFG" which is just 3 years old is through various sources now negotiating with the "Big Boys"! "TCFG" the letters to look for!

1 0

Re: lotus notes id file
by Joel O'Connor 17 Dec '03

17 Dec '03

Sorry guy, no gettingout of dodge on this one. There are no utilities, no programs, no way out. The only way to do this is to copy the "mail file" which will be in the c:\notes\data directory and blow away the id and recreate it. Then after this, copy the mail file back into the data directory. This will recreate your desktop view with the original folders and messages that you had. Otherwise, you're screwed. ---John <needshelp(a)mindspring.net> wrote: > > Hello > I'm using lotus notes and I have a big problem. I have a id file with no > password. How can I get a password for it or reset it. Is there some type of > utility or something someone knows of?I have been told that I'm out of luck > unless I have the original. > > > John... > > > > == Ogre bounces like sonar. . .Peace. Ogre _________________________________________________________ DO YOU YAHOO!? Get your free @yahoo.com address at http://mail.yahoo.com

1 0

No Subject
by advisor＠compuserve.com 17 Dec '03

17 Dec '03

10/28/98 Y2K Solution! 8 Pine Circle Dr., Silicon Valley, Calif. USA OTC Company "TCFG" 21 st. Century Frontier Group has through several members of their administrative research department leaked vital information about their companies efforts. Everyone was tight lipped and interviews were refused, and through un-named sources we have learned that the technology and software solution are in the process of being patented! In over 1640 trials, using various data systems the use of the new technology and software solved the Y2K problem 100% of the time. This small publicly traded company "TCFG" which is just 3 years old is through various sources now negotiating with the "Big Boys"! "TCFG" the letters to look for!

1 0

Manage your Assets, Simplify your Life---- Extensis Portfolio 4.0
by listmaster＠extensis.com 17 Dec '03

17 Dec '03

Introducing the Newest Version of our Asset Management Software-Extensis Portfolio 4.0 http://www.extensis.com/products/Portfolio/ - Organize your assets -images, text, photos, multimedia- for instant-access - NEW! Import information from other databases - NEW! Robust scripting now facilitates database and internet publishing - NEW! Slideshow feature provides full-screen display of images - NEW! Scalability with Portfolio Server 4.0 ensures lightening-fast access for workgroups Extensis Portfolio 4.0 and Portfolio Server 4.0 will help you manage and organize your digital assets. Digital assets include digital images, artwork, presentations, multimedia, photos, or other graphic documents that need to be organized and shared. Extensis Portfolio 4.0 offers you a place to catalog, view, manage, select, search and even share digital content among multiple users. Find the images you need, find them fast, share them with partners around the globe all through your network or the Web with NEW Portfolio 4.0 and Portfolio Server 4.0. Create database fields that match your business with Portfolio's unlimited custom fields. Then, import your assets from other databases for a centralized asset management system. With Portfolio's advanced searching features, you will never hunt-and-peck for your images again. And with Portfolio's built-in scripting you can automate regular tasks, such as Internet and database publishing-in no time. Portfolio 4.0 is the only scalable solution that allows you to start with as few as one user (using the stand-alone client software) and add more users (by adding additional clients; without requiring a server) as your needs grow. For larger workgroups, the NEW Portfolio Server 4.0 will enable dozens of users to access your assets without a loss of performance. Portfolio Server can be inserted into a workgroup at any time, without the need to replace the existing Portfolio 4.0 client (single-user) versions. Plus, the NEW Portfolio Server 4.0 arrives with 5 free copies of Portfolio 4.0- a value. Streamline your work, build your assets, and simplify your life-Extensis Portfolio 4.0 To download a FREE demo, get information, or to buy on-line, visit http://www.extensis.com/products/Portfolio/ Or call Extensis at 1(800) 796-9798 Ext. 404 or (503) 274-2020 Ext. 404. Portfolio 4.0 System Requirements: Macintosh Mac OS 7.5.3 - 8.5 PowerPC, 32 MB of RAM Windows Windows 95, 98 or NT 4.0 Pentium, 32 MB of RAM Portfolio Server 4.0 System Requirements Windows Win NT 4.0, Pentium, 32 MB RAM Macintosh Macintosh version available late 1998 PS. We have made every effort to ensure this message is being sent only to people who have expressed interest in Extensis products. If we have sent this to you in error, please accept our apologies and reply with "REMOVE" in the subject line for automatic exclusion from future communications. If you know someone who would like to be on our mailing list have them send an email to listmaster(a)extensis.com with "ADD" in the subject line and their email address in the body. P.P.S. This message is intended for North American customers. If you are located outside of North America and have received this message, please visit www.extensis.com/purchase/ to find the nearest local distributor in your country.

1 0

test
by Igor Chudov ＠ home 17 Dec '03

17 Dec '03

test

1 0

Re: Shuffling (fwd)
by Jim Choate 17 Dec '03

17 Dec '03

Forwarded message: > Date: Thu, 29 Oct 1998 19:22:52 +0100 > From: Anonymous <nobody(a)replay.com> > Subject: Re: Shuffling > For any N greater than two, the random-swap algorithm cannot produce > a perfectly smooth randomization of A[N]. If by 'perfectly smooth randomization of A[N]' you mean that any two members of A[N] have equaly likelyhood to be swapped, and hence any pattern of A[N] members being possible with equal odds then this is incorrect. For that arrangement to be relevant your (P)RNG function must choose any element from 0 to N with equal odds, it's probability curve must be a horizontal line at 1/n for each N. If it ain't you aren't going to randomly shuffle the elements of A[] since each element doesn't have the same odds of being selected in this (or every other) turn. > A perfect randomization of A[N] would give equal probability to each of > the N! (N factorial) possible rearrangements of A. Ah, but there aren't N! rearrangements of A if we are limited to only swapping two elements. There are at best n^2. Allow me to explain... > Each iteration of the random-swap algorithm makes two choices of the N > values to swap. There are N^2 possible ways these two choices could go. Ok, we shoot off our first random number, 1/n. We then shoot off our second random number, also 1/n. The combination is 1/n * 1/n or 1/n^2. Now if we add the stipulation about the i'th and i+1'st numbers not being identical then the odds are 1/n * 1/n-1 (note that this boundary condition is artificial and may in fact be problematic, there is no logical reason to keep i and i+1 from being the same n if we want truly random behaviour). > To calculate the probabilities after an iteration, we try all the N^2 > choices and count how many instances of each arrangement are produced. Huh? What probability are we calculating here, the odds of getting the particular pattern we have now generated? If so that is either 1/n^2 or 1/n(n-1) depending on the boundary condition. > This gives each possible arrangement a probability in the form of > k/N^2, where k of the N^2 choices led to that arrangement. What arrangement, the one we start with before or after the swap? If we start with arrangement I and then swap two elements we get I+1. There are only two ways to get to any particular arrangment. An identical arrangement where we swap i with itself (ignoring the potential boundary condition) and the arrangement where the l'th and j'th elements are swapped. As long as we're only swapping two elements there can only be two possible parent patterns for any given resultant pattern. Now if we swap more than 2 elements it gets big fast. I seem to be reading an implication that given a particular pattern, I, there is some rhyme or reason to the pattern of previous I's that got us here, there isn't. For any given pattern there is a infinite number of potential paths that would get to any particular. Let's say we have: [ 0 1 2 4 3 ] and we shuffle and get, [ 0 4 2 1 3 ] or, [ 0 1 2 4 3 ] Now if the question is how many possible ways could be have gotten to the original, [ 0 1 2 4 3 ], then there are two ways to calculate that, given no stipulation on reptitions we get: n^2 given a stipulation for no repetitions we get: (n)(n-1) We can generalize this somewhat if we let s represent our current sequence and our goal is to determine the number of possible previous states the sequence could have held. s-1 = n^2 or, s-1 = n(n-1) Now if we want to calculate the number of possible parent generations for s-1 *from the perspective of s0* we get: s-2 = (s-1)^2 = (n^2)^2 or, s-2 = (s-1)((s-1)-1) = (n^2)((n^2)-1) Thus, s-3 = (s-2)^2 = ((s-1)^2)^2 = ((n^2)^2)^2 or, s-3 = (s-2)((s-2)-1) = ( (n^2)((n^2)-1) )( ((n^2)((n^2)-1) )-1) = (n^4 - n^2)( (n^4 - n^2) - 1) for the second form only, s-4 = (s-3)((s-3)-1) = ((n^4-n^2)((n^4-n^2)-1))(((n^4-n^2)((n^4-n^2)-1))-1) = ((n^4-n^2)^2 - (n^4-n^2)) (n^4-n^2)^2-(n^4-n^2))-1) (I'm going to stop here trying to resolve this equation, I don't have the time. Note that the relation is i(i-1) for each generation so we only need to affix a relation to i and the generation number. It's worth noting this can be resolved recursively.) These can be generalized for the first form to: C(s-i) = n^(2^i), where i is the number of generations going back. The inverse makes a handy measure of entropy as well as telling you the odds of selecting any particular path from one pattern to another pattern given the number of elements swaps that are allowed. ____________________________________________________________________ To know what is right and not to do it is the worst cowardice. Confucius The Armadillo Group ,::////;::-. James Choate Austin, Tx /:'///// ``::>/|/ ravage(a)ssz.com www.ssz.com .', |||| `/( e\ 512-451-7087 -====~~mm-'`-```-mm --'- --------------------------------------------------------------------

1 0

No Subject
by concerned＠aol.com 17 Dec '03

17 Dec '03

10/28/98 Y2K Solution! 8 Pine Circle Dr., Silicon Valley, Calif. USA OTC Company "TCFG" 21 st. Century Frontier Group has through several members of their administrative research department leaked vital information about their companies efforts. Everyone was tight lipped and interviews were refused, and through un-named sources we have learned that the technology and software solution are in the process of being patented! In over 1640 trials, using various data systems the use of the new technology and software solved the Y2K problem 100% of the time. This small publicly traded company "TCFG" which is just 3 years old is through various sources now negotiating with the "Big Boys"! "TCFG" the letters to look for.......

1 0

Speed records, and brute force state of the art.
by Harvey Rook (Exchange) 17 Dec '03

17 Dec '03

>From the New York Times... WASHINGTON-The Energy Department will take delivery on Wednesday of what the Government says is the world's fastest computer, capable of a peak performance of 3.88 trillion calculations, or teraflops, a second. Just to simplify things, let's assume that 1 flop == 1 decryption. I know that's not true, but it's very close, and it's certainly less than one order of magnitude off. So, with this assumption how long does it take to break various key sizes? 56 bits -- 2^56 / 3.88E12 = 5.2 hours 64 bits -- 2^64 / 3.88E12 = 55 days 80 bits -- 2^80 / 3.88E12 = 9873 years 128 bits -- 2^128 / 3.88E12 = 2.8E18 years. And now you know. Harv.

1 0

No Subject
by research＠hampton.net 17 Dec '03

17 Dec '03

10/29/98 Y2K Solution! 8 Pine Circle Dr., Silicon Valley, Calif. OTC Company "TCFG" 21 st. Century Frontier Group has through several members of their administrative research department leaked vital information about their companies efforts. Everyone was tight lipped and interviews were refused, and through un-named sources we have learned that the technology and software solution are in the process of being patented! In over 1640 trials, using various data systems the use of the new technology and software solved the Y2K problem 100% of the time. This small publicly traded company "TCFG" which is just 3 years old is through various sources now negotiating with the "Big Boys"! "TCFG" the letters to look for!

1 0

one lump or two
by Anonymous 17 Dec '03

17 Dec '03

>(e.g. # Uses/Side Effects/Precuations/Interactions/etc.) > >I'd like info on Zoloft, Zestril, Lithium, & Deprecote (?sp) - orange-ish >liquid capsules - ... and Tegretol and Respiradahl (?sp) Depekote and Tegretol are anti-seizure drugs now being used for certain kinds of bipolar conditions. Zoloft is like prozac but has also a mild stimulating effect. Lithium is a classic anti-bipolar drug. Li, Depekote, probably Tegretol you have to watch blood levels even after stabilization. They probably think he's manic and or depressed, if he's been coherent and dumbed-himself-down enough to avoid a psychotic or schizoform diagnosis. Shrinks don't like rants, especially ones they don't understand.

1 0