Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Franaszek, US
Marek Franaszek, Gaithersburg, MD US
| Patent application number | Description | Published |
|---|---|---|
| 20100074491 | COMPUTER-AIDED CLASSIFICATION OF ANOMALIES IN ANATOMICAL STRUCTURES - Candidate anomalies in an anatomical structure are processed for classification. For example, false positives can be reduced by techniques related to the anomaly's neck, wall thickness associated with the anomaly, template matching performed for the anomaly, or some combination thereof. The various techniques can be combined for use in a classifier, which can determine whether the anomaly is of interest. For example, a computed tomography scan of a colon can be analyzed to determine whether a candidate anomaly is a polyp. The technologies can be applied to a variety of other scenarios involving other anatomical structures. | 03-25-2010 |
Peter Franaszek, Yorktown Heights, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20110043387 | DATA COMPRESSION USING A NESTED HIERACHY OF FIXED PHRASE LENGTH STATIC AND DYNAMIC DICTIONARIES - The present invention describes lossless data compression/decompression methods and systems. A random access memory (RAM) operates as a static dictionary and includes commonly used strings/symbols/phrases/words. An input buffer operates as a dynamic dictionary and includes input strings/phrases/symbols/words. A set-associative cache memory operates as a hash table, and includes pointers pointing to the commonly used strings/symbols/phrases/words in the static dictionary and/or pointing to one or more of the input strings/phrases/symbols/words in the dynamic dictionary. Alternatively, the set-associative cache memory combines the dynamic dictionary, the static dictionary and the hash table. When encountering a symbol/phrase/string/word in the static or dynamic dictionary in an input stream, a compressor logic or module places a pointer pointing to the symbol/phrase/string/word at a current location on the output stream. The hash table may include phrases/symbols/strings/words and/or pointers pointing to phrases/symbols/strings/words. | 02-24-2011 |
Peter A. Franaszek, Mount Kisco, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20080222640 | Prediction Based Priority Scheduling - Systems and methods are provided that schedule task requests within a computing system based upon the history of task requests. The history of task requests can be represented by a historical log that monitors the receipt of high priority task request submissions over time. This historical log in combination with other user defined scheduling rules is used to schedule the task requests. Task requests in the computer system are maintained in a list that can be divided into a hierarchy of queues differentiated by the level of priority associated with the task requests contained within that queue. The user-defined scheduling rules give scheduling priority to the higher priority task requests, and the historical log is used to predict subsequent submissions of high priority task requests so that lower priority task requests that would interfere with the higher priority task requests will be delayed or will not be scheduled for processing. | 09-11-2008 |
| 20080307188 | Management of Guest OS Memory Compression In Virtualized Systems - The present invention provides a system and method for managing compression memory in a computer system. This system includes a hypervisor having means for identifying a operating system having a plurality of memory pages allocated, means for counting the number of a plurality of memory pages allocated, and means for counting a number of free space pages in the compressed memory. The hypervisor further includes means for determining if the number of free space pages is less than a predetermined threshold, and means for increasing the number of free space pages if less than a predetermined threshold. | 12-11-2008 |
| 20090070762 | SYSTEM AND METHOD FOR EVENT-DRIVEN SCHEDULING OF COMPUTING JOBS ON A MULTI-THREADED MACHINE USING DELAY-COSTS - A computer system includes N multi-threaded processors and an operating system. The N multi-threaded processors each have O hardware threads forming a pool of P hardware threads, where N, O, and P are positive integers and P is equal to N times O. The operating system includes a scheduler which receives events for one or more computing jobs. The scheduler receives one of the events and allocates R hardware threads of the pool of P hardware threads to one of the computing jobs by optimizing a sum of priorities of the computing jobs, where each priority is based in part on the number of logical processors requested by a corresponding computing job and R is an integer that is greater than or equal to 0. | 03-12-2009 |
| 20090320006 | LEARNING AND CACHE MANAGEMENT IN SOFTWARE DEFINED CONTEXTS - A exemplary system and method are provided for learning and cache management in software defined contexts. Exemplary embodiments of the present invention described herein address the problem of the data access wall resulting from processor stalls due to the increasing discrepancies between processor speed and the latency of access to data that is not stored in the immediate vicinity of the processor requesting the data. | 12-24-2009 |
Peter A. Franaszek, Mt. Kisco, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20080201530 | SYSTEM AND STORAGE MEDIUM FOR MEMORY MANAGEMENT - Systems and a storage medium for memory management are provided. A system includes a tag controlled buffer in communication with a memory device, including multiple pages divided into individually addressable lines. The tag controlled buffer includes a prefetch buffer with at least one of the individually addressable lines from the memory device and a tag cache in communication with the prefetch buffer. The tag cache includes at least one tag associated with one of the pages in the memory device. Each tag includes a reference history field and a pointer to a line in the prefetch buffer that is from the associated page. The reference history field includes information about how the lines from the associated page have been accessed in the past and is utilized to determine which lines in the associated page should be added to the prefetch buffer when the tag is added to the tag cache. | 08-21-2008 |
| 20090313398 | METHOD AND SYSTEM FOR STORING MEMORY COMPRESSED DATA ONTO MEMORY COMPRESSED DISKS - A method (and system) of storing information, includes storing main memory compressed information onto a memory compressed disk, where pages are stored and retrieved individually, without decompressing the main memory compressed information. | 12-17-2009 |