Abstract: An online auction bidding system utilizes a three state auction model that includes an auction open state, followed by a closing state, and an auction closed state which occurs last in which the online auction is ended and bids will not be accepted. The highest bid received prior to the auction end is considered the winning bid. In the auction open state, bids are guaranteed to be accepted if they are qualified, for example, by meeting certain conditions such as being above a current high bid by some desired increment. The closing state is of indeterminate length and thus the time that the online auction ends is unknown by the bidders which makes the practice of sniping difficult. Qualified bids are accepted during the closing state but bidders run the risk that a later bid will not be accepted should the auction end prior to that bid being placed.

Abstract: An apparatus and method for performing calculations is provided so that a paradigm of a tape is utilized in a calculator application that executes on a computing platform and which is configured to enable a user to see and interact with multiple virtual tapes that each show numerical values and operators. Each tape functions as a user-accessible memory and a memory value may be recalled from any one tape and that value placed on any other tape. The calculator application is configured to enable the user to enter a sequence of values and operators which are all displayable on a given tape, as well as support the user's ability to edit any value or operator that was previously entered on that tape. Calculations are updated to reflect the user's edits on both the tape currently being edited and any other tape that uses the edited tape as a memory.

Abstract: An apparatus and method for performing calculations is provided so that a paradigm of a tape is utilized in a calculator application that executes on a computing platform and which is configured to enable a user to see and interact with multiple virtual tapes that each show numerical values and operators. Each tape functions as a user-accessible memory and a memory value may be recalled from any one tape and that value placed on any other tape. The calculator application is configured to enable the user to enter a sequence of values and operators which are all displayable on a given tape, as well as support the user's ability to edit any value or operator that was previously entered on that tape. Calculations are updated to reflect the user's edits on both the tape currently being edited and any other tape that uses the edited tape as a memory.

Abstract: An online auction bidding system utilizes a three state auction model that includes an auction open state, followed by a closing state, and an auction closed state which occurs last in which the online auction is ended and bids will not be accepted. The highest bid received prior to the auction end is considered the winning bid. In the auction open state, bids are guaranteed to be accepted if they are qualified, for example, by meeting certain conditions such as being above a current high bid by some desired increment. The closing state is of indeterminate length and thus the time that the online auction ends is unknown by the bidders which makes the practice of sniping difficult. Qualified bids are accepted during the closing state but bidders run the risk that a later bid will not be accepted should the auction end prior to that bid being placed.

Abstract: An apparatus and method for performing calculations is provided so that a paradigm of a tape is utilized in a calculator application that executes on a computing platform and which is configured to enable a user to see and interact with multiple virtual tapes that each show numerical values and operators. Each tape functions as a user-accessible memory and a memory value may be recalled from any one tape and that value placed on any other tape. The calculator application is configured to enable the user to enter a sequence of values and operators which are all displayable on a given tape, as well as support the user's ability to edit any value or operator that was previously entered on that tape. Calculations are updated to reflect the user's edits on both the tape currently being edited and any other tape that uses the edited tape as a memory.

Abstract: An apparatus for preparing and playing back a duplicated disk containing software as a program so that a customer will be able to use the disk for a predetermined trial period. The duplicated disk is impressed with information relating to this system in the form of a usage count, a locking status and an output code. The usage count is written on the disk and determines the number of times the disk can be used by a customer. The output code identifies a locking code whereby after the allocated number of uses is over, the vendor can unlock the disk to allow unlimited use. The lock code determines whether or not the disk is subjected to the above noted trial usage period. The usage count which is impressed on the disk is detected during each time the disk is used and the usage count is decremented by one until the predetermined number of uses has been accommodated.

Abstract: A spelling error detector apparatus employs a memory which stores alphabetical words as those existing in the English language in three major memory sections which constitutes a most frequently used word list (MFU), a master word list (MWL) and a personal word list (PWL). Each word is uniquely coded and stored as a 24 bit binary number. The system then retrieves words which are stored or entered into a processor memory and which words are indicative of a document to be printed. Each word emanating from the processor memory is converted into the same code as the stored words and then a search is made to determine whether the processor word compares with a word as stored. If a favorable comparison is had, it is assumed that the spelling of the processor word is correct. If an unfavorable comparison is had, it is assumed that the spelling is incorrect and the misspelled word is stored in a separate memory which can be accessed by the operator in order to make the necessary corrections.