Famous Patents
The ice cream cone was invented at the St. Louis Worlds Fair by Ernest Hamwi in 1904. His waffle booth was next to an ice cream vendor who ran short of dishes. Hamwi rolled a waffle to hold ice cream and the cone was born.
PatentStorm News
Make the Most of Our Site
See this month's Top Inventors and Most Cited Patents.
Stay on top of the latest innovations by subscribing to an RSS feed.
Registered users: Manage your profile.
| Number | Title | Issue Date |
| 6654004 | Control post or joystick electromechanically engaging a keypad-centered pointer device for a laptop computer or the like In a laptop computer having a display, a matrix of touch-sensitive keys, and a TrackPoint.RTM. device for generating cursor and function selection on display is embedded centrally among the keys. The TrackPoint.RTM. has a removable cap into which the joys... | 11/25/2003 |
| 6533262 | System for feeding a continuous medium including multi-ply media to a processing station with selectable reduction in jamming, wrinkling, or pealing of the media surface An apparatus for reducing friction, tearing, or wrinkling of the surface of a single-ply or multiple-ply continuous medium being fed to a processing station by either sprocket engagement of an edge-perforated medium or pinch roller pressure engagement of ... | 03/18/2003 |
| 6275965 | Method and apparatus for efficient error detection and correction in long byte strings using generalized, integrated, interleaved reed-solomon codewords A method and means for enhancing the error detection and correction capability obtained when a plurality of data byte strings are encoded in a two-level, block-formatted linear code using code word and block-level redundancy. This is accomplished by vecto... | 08/14/2001 |
| 6101624 | Method and apparatus for detecting and correcting anomalies in field-programmable gate arrays using CRCs for anomaly detection and parity for anomaly correction A method and means for detecting and correcting anomalies in a RAM-based FPGA by comparing CRC residues over portions of the RAM-stored connection bitmap with prestored residues derived from uncorrupted copies of the same bitmap portions. A mismatch selec... | 08/08/2000 |
| 6084924 | Asynchronous low sampling rate read channel using combination midpoint and linear interpolation A method and apparatus for the recovery of information via asynchronous signal sampling of coded analog waveforms by double interpolating values into the train of asynchronously sampled signals prior to the train being applied to a synchronous detector. T... | 07/04/2000 |
| 5946328 | Method and means for efficient error detection and correction in long byte strings using integrated interleaved Reed-Solomon codewords A method and means for enhancing the error detection and correction capability obtained when a plurality of data byte strings are encoded in a two-level, block-formatted linear code using codeword and block-level redundancy by logically summing the data b... | 08/31/1999 |
| 5928363 | Method and means for preventing unauthorized resumption of suspended authenticated internet sessions using locking and trapping measures A method in which unauthorized persons can be excluded from accessing an HTTP-compliant, server-based application through a client processor when the session is suspended. The method requires that authenticated access is initially bound to the application... | 07/27/1999 |
| 5930497 | Method and means for generation of realistic access patterns in storage subsystem benchmarking and other tests A method and means for emulating realistic access requests used in static or dynamic performance testing of a disk-based storage subsystem. The method and means are based on the fact that a test driver can substitute for an actual application if an execut... | 07/27/1999 |
| 5915039 | Method and means for extracting fixed-pitch characters on noisy images with complex background prior to character recognition Fixed-pitch, fixed-font characters embedded in a noisy gray-scale image of picture elements (pels) within a complex background can be extracted prior to execution of any recognition operations by first deriving a normalized Boolean-coded image from the gr... | 06/22/1999 |
| 5903409 | Method and means for maintaining data integrity in disk drives resulting from shock-induced contact between recording and access components during nonoperational periods By matching raised hard contact areas on predetermined locations of the actuator/arm/suspension assembly opposite counterpart dedicated tracks or zones, then data track damage can be avoided, otherwise resulting from shock imposed on a disk drive when the... | 05/11/1999 |
| 5832005 | Fault-tolerant method and means for managing access to an initial program load stored in read-only memory or the like A method and means in a stored, program-controlled machine to maintain an uninterrupted access and copying of simple parity-coded words of an initial program load (IPL) or other software from a read-only memory or a memory with limited rewrite capability ... | 11/03/1998 |
| 5675767 | Method for verification and restoration of directories in CPU system managed store A method for dynamically detecting loss of map integrity in a form of system-managed storage (SMS). In SMS, maps are used to define access paths to data and to allocate and reallocate storage resources among applications running thereon. The method steps ... | 10/07/1997 |
| 5506979 | Method and means for execution of commands accessing variable length records stored on fixed block formatted DASDS of an N+2 DASD synchronous array Variable length records can be accessed from an array of N+2 synchronous fixed block formatted DASDs in a single pass and in the presence of a single DASD failure if each record is partitioned into a variable number of K fixed length blocks, the blocks ar... | 04/09/1996 |
| 5504857 | Highly available fault tolerant relocation of storage with atomicity A computer implemented method for robustly copying pages to system managed storage in order to maintain data in a consistent state and in order to provide continuous access availability of the pages to executing applications. The method achieves data cons... | 04/02/1996 |
| 5454099 | CPU implemented method for backing up modified data sets in non-volatile store for recovery in the event of CPU failure A CPU implemented method for managing the backup copying of data sets residing in non-volatile storage and for the recovery thereof in the event of CPU failure. The first step is to invoke a modified incremental backup copy policy using a small backup win... | 09/26/1995 |
| 5446871 | Method and arrangement for multi-system remote data duplexing and recovery A method and system for asynchronous remote data duplexing at a distant location from copies based at a primary site storage subsystem, which copying is non-disruptive to executing applications, and further in which any data loss occasioned by losses in f... | 08/29/1995 |
| 5418940 | Method and means for detecting partial page writes and avoiding initializing new pages on DASD in a transaction management system environment A method for detecting partial page writes in pages spanning multiple sectors of a sector organized multiple tracked storage facility in a page oriented, log based transaction management system. During a page write to storage from a buffer, a status bit i... | 05/23/1995 |
| 5418921 | Method and means for fast writing data to LRU cached based DASD arrays under diverse fault tolerant modes A method and means using a fast write in order to eliminate DASD time from the write response time as seen by the host; eliminate some DASD writes due to overwrites caused by later host writes to previously updated blocks in cache; and reduce DASD seeks b... | 05/23/1995 |
| 5416915 | Method and system for minimizing seek affinity and enhancing write sensitivity in a DASD array A method and system for minimizing seek affinity and enhancing write sensitivity in a direct access storage device (DASD) array are disclosed. SEEK affinity and WRITE efficiency are preserved in which logical cylinders, as recorded on the DASD array, are ... | 05/16/1995 |
| 5414842 | External sorting using virtual storage as a work device If a real memory-backed demand paging virtual store is used as a work device in an external sort, then data movements and processing time are substantially less than that for processing the same external sort in either an internal (real) memory or DASD se... | 05/09/1995 |
| 5379385 | Method and means for effectuating rule based I/O data transfer address control via address control words A method and means for CPU accessing a staged storage subsystem in which rules defining computation of the storage system addresses are distributed with the data, the rules and storage access being interpreted by the sub-system. The method uses local stor... | 01/03/1995 |
| 5375128 | Fast updating of DASD arrays using selective shadow writing of parity and data blocks, tracks, or cylinders A method for update writing in an array of DASDs in a reduced number of DASD track cycles. The method involves distributing data and parity blocks for each parity group across the array in failure independent form and reserving unused space. During a firs... | 12/20/1994 |
| 5357623 | Dynamic cache partitioning by modified steepest descent Dynamic partitioning of cache storage into a plurality of local caches for respective classes of competing processes is performed by a step of dynamically determining adjustments to the cache partitioning using a steepest descent method. A modified steepe... | 10/18/1994 |
| 5351246 | Method and means for coding and rebuilding that data contents of unavailable DASDs or rebuilding the contents of DASDs in error in the presence of reduced number of unavailable DASDs in a DASD array A method and means for coding an (M-1)×M data array written onto an array of M synchronous recording paths and for rebuilding and writing onto spare recording path capacity when up to a preselected number R of array DASDs fail, or one DASD becomes errone... | 09/27/1994 |
| 5341351 | Method and means for optimally accessing data residing on dual actuator DASDs A method and means for ensuring maximal occupancy of dual actuators movable over a cyclic multitracked DASD in transferring any percentage mix of short and long records over a set of queued referencing commands by the selective serial or concurrent dispat... | 08/23/1994 |
| 5333143 | Method and means for b-adjacent coding and rebuilding data from up to two unavailable DASDS in a DASD array B-Adjacent coding is used to correct up to two DASDs in error in an array of N data DASDs and two redundant DASDs. When two of the data DASDs fail, their data can be recreated as a function of a pair of syndromes constituting up to two Boolean equations i... | 07/26/1994 |
| 5319782 | Method for synchronizing the dispatching of tasks among multitasking operating systems A method for synchronizing the dispatching of tasks from a CPU-based first multitasking operating system (OS) with threads of function calls opportunistically dispatched from a CPU-based second multitasking operating system. The second OS includes a set o... | 06/07/1994 |
| 5301290 | Method for minimizing lock processing while ensuring consistency among pages common to local processor caches and a shared external store A computer implemented method for minimizing the grant of pages locks and the number of outstanding locks while ensuring consistency of the copies of pages resident among a first, and a second data cache with the original pages in shared external storage.... | 04/05/1994 |
| 5271012 | Method and means for encoding and rebuilding data contents of up to two unavailable DASDs in an array of DASDs A method and means for encoding data written onto an array of M synchronous DASDs and for rebuilding onto spare DASD array capacity when up to two array DASD fail. Data is mapped into the DASD array using an (M-1)*M data array as the storage model where M... | 12/14/1993 |
| 5265098 | Method and means for managing DASD array accesses when operating in degraded mode A method and apparatus are disclosed which minimize the additional read and write loading for each remaining DASD in a DASD array occasioned by a single point of failure where subsets of DASDs may accessed asynchronously (RAID 4 or RAID 5). In this method... | 11/23/1993 |
| 5263145 | Method and means for accessing DASD arrays with tuned data transfer rate and concurrency A method and means for managing access to a logical track of KN blocks of which K are parity blocks. The KN blocks are distributed and stored in an array of N DASDs having K blocks per physical track per DASD. The array includes control means for securing... | 11/16/1993 |
| 5261088 | Managing locality in space reuse in a shadow written B-tree via interior node free space list A method for managing space re-use with respect to the indices (nodes) of shadow written tree organized dynamic random accessed files/records/pages located in the external store of a CPU. The method reserves space in all non-leaf nodes and maintains a lis... | 11/09/1993 |
| 5258984 | Method and means for distributed sparing in DASD arrays A method and means in which data and parity blocks forming parity groups together with spare blocks are distributed over array block locations according to at least one combinatorial design, each group having N data and P parity blocks. The combinatorial ... | 11/02/1993 |
| 5257362 | Method and means for ensuring single pass small read/write access to variable length records stored on selected DASDs in a DASD array Write update of variable length records stored in row major order on an array of N DASDs is facilitated by utilizing the correlation between byte offsets of a variable length record and the byte offset of a byte level parity image of data stored on the sa... | 10/26/1993 |
| 5226143 | Multiprocessor system includes operating system for notifying only those cache managers who are holders of shared locks on a designated page by global lock manager A conditional broadcast or notification facility of a global lock manager is utilized to both serialize access to pages stored in local caches of counterpart processors in a distributed system and to ensure consistency among pages common to the caches. Ex... | 07/06/1993 |
| 5224215 | Message queue processing among cooperative processors having significant speed differences Processors communicatively attaching a storage sub-system and which place a message on a queue no longer have to wait on a queue lock set by another processor or sub-system dequeuing a message. This is realized by use of a double ended linked list or queu... | 06/29/1993 |
| 5218696 | Method for dynamically expanding and rapidly accessing file directories A computer-implemented method for the name-oriented accessing of files having at least zero records, any access path to files and records through an external store coupling the computer being defined by a pair of related directories. A first directory of ... | 06/08/1993 |
| 5168554 | Converting trace data from processors executing in parallel into graphical form A computer implemented method by which trace data from concurrently executing virtual processors is reformatted and organized as a linked list of successive events evoking parallel activity for any given parallel task. A selective traverse of the links op... | 12/01/1992 |
| 5142283 | Arithmetic compression coding using interpolation for ambiguous symbols A method for substituting interpolated values for ambiguous symbols in an arithmetically encoded symbol string, symbols in the unencoded original string being drawn from a Markov source and a finite alphabet. Ambiguity of a symbol is defined as where its ... | 08/25/1992 |
| 5093916 | System for inserting constructs into compiled code, defining scoping of common blocks and dynamically binding common blocks to tasks A method performed within a multi-processing, multi-programming computer environment for reducing conflict among tasks concurrently accessing COMMON BLOCKs in code sequences compiled within said environment from a FORTRAN like language system, and for red... | 03/03/1992 |
