Abstract: An integral recording head, for use in a linear tape drive system, includes a circumferentially grooved roller guide assembly and a recording head actuator assembly. The circumferential groove feature is incorporated on the surfaces of the roller guide assembly, and provides a substantial frictional contact force that acts to reduce the lateral motion, and further attenuates high frequency lateral disturbances of the magnetic tape. The reduced high frequency content of the lateral disturbances significantly improves the ability of the actuator to achieve a desired track following control. The grooved roller guide assembly is formed integrally of two solid cylindrical contact surfaces separated by a circumferential slot that accommodates the recording head actuator assembly.
Type:
Grant
Filed:
April 1, 2008
Date of Patent:
November 8, 2011
Assignee:
International Business Machines Corporation
Inventors:
James Howard Eaton, Glynda Williams Eaton, legal representative
Abstract: A correctness verification system receives a query, executes the query using a query logic, and produces a query result. The query result comprises data records that satisfy the query, data verification objects associated with the data records, index segments accessed during the execution of the query, index verification objects associated with the index segments, and the query. The system transfers the query result to a verification system. The verification system verifies correctness of the query result by executing the query using the query logic. The verification system uses the data verification objects to verify integrity of the data objects, uses the index verification objects to verify the integrity of the index segments, and uses the index verification objects and the data verification objects to verify the completeness of the query result.
Type:
Grant
Filed:
June 5, 2008
Date of Patent:
November 8, 2011
Assignee:
International Business Machines Corporation
Abstract: A method for use with an information (or data) warehouse comprises managing the information warehouse with instructions in a declarative language. The instructions specify information warehouse-level tasks to be done without specifying certain details of how the tasks are to be implemented, for example, using databases and text indexers. The details are hidden from the user and include, for example, in an information warehouse having a FACT table that joins two or more dimension tables, details of database level operations when structured data are being handled, including database command line utilities, database drivers, and structured query language (SQL) statements; and details of text-indexing engines when unstructured data are being handled. The information warehouse is managed in a dynamic way in which different tasks—such as data loading tasks and information warehouse construction tasks—may be interleaved (i.e., there is no particular order in which the different tasks must be completed).
Type:
Grant
Filed:
June 7, 2007
Date of Patent:
November 8, 2011
Assignee:
International Business Machines Corporation
Inventors:
Ying Chen, Bin He, Ana Lelescu, James J. Rhodes, Rui Wang
Abstract: A system, method, and computer program product for processing a query spanning separate databases while revealing only minimal information beyond a query answer, by executing only specific information-limiting protocols according to query type.
Type:
Grant
Filed:
October 25, 2007
Date of Patent:
October 18, 2011
Assignee:
International Business Machines Corporation
Abstract: A cache-aware Bloom filter system segments a bit vector of a cache-aware Bloom filter into fixed-size blocks. The system hashes an item to be inserted into the cache-aware Bloom filter to identify one of the fixed-size blocks as a selected block for receiving the item and hashes the item k times to generate k hashed values for encoding the item for insertion in the in the selected block. The system sets bits within the selected block with addresses corresponding to the k hashed values such that accessing the item in the cache-aware Bloom filter requires accessing only the selected block to check the k hashed values. The size of the fixed-size block corresponds to a cache-line size of an associated computer architecture on which the cache-aware Bloom filter is installed.
Type:
Grant
Filed:
June 5, 2008
Date of Patent:
October 4, 2011
Assignee:
International Business Machines Corporatio
Abstract: A generic RAID engine system accepts an access request, accepts a metadata input comprising a layout description and, optionally, a plurality of resource optimization objectives, accepts a dynamic input comprising a dynamic state of an I/O stack comprising the generic RAID engine and a fault configuration of a plurality of storage devices in the I/O stack, and accepts RAID code input comprising information about the RAID code used by the I/O stack. The metadata input, the dynamic input, and the RAID code input are utilized to transform the access request into individual device reads and individual device writes such that RAID code relationships for the storage devices are maintained at all times. An optional optimizer module selects strategies that meet the resource optimization objectives.
Type:
Grant
Filed:
June 4, 2008
Date of Patent:
October 4, 2011
Assignee:
International Business Machines Corporation
Inventors:
Dingshan He, Deepak R. Kenchammana Hosekote
Abstract: A traitor tracing system generates a hypothesized model of the circumvention device that models a hypothesized set of device keys compromised by the circumvention device. The system iteratively invokes a subset tracing system to identify a compromised device key until substantially all the compromised device keys in the set of compromised device keys are identified so as to disable the circumvention device. A subset tracing system generates a circumvention device model that models behavior of a circumvention device using prior knowledge and The system iteratively selects and applies to the circumvention device a test based on the hypothesized model and the circumvention device model and receives a response from the circumvention device indicating a success of the test in playing protected content on the circumvention device.
Type:
Grant
Filed:
June 5, 2008
Date of Patent:
September 20, 2011
Assignee:
International Business Machines Corporation
Inventors:
Hongxia Jin, Jeffrey Bruce Lotsplech, Philip Anastasios Zigoris
Abstract: A computer program, method and computer apparatus for calculating the total importance of an electronic document on the basis of (i) a plurality of electronic documents chained to each other in a relation of referencing and being referenced, from a start electronic document which is not referenced by other electronic documents to a terminal electronic document which does not reference other documents, (ii) the information on relation of referencing and being referenced, (iii) an important phrase, and (iv) a response coefficient determining phrase such as an agreeing phrase, a disagreeing phrase, and a topic change phrase, (i) through (iv) being stored in a storage device.
Type:
Grant
Filed:
January 18, 2008
Date of Patent:
September 13, 2011
Assignee:
International Business Machines Corporation
Abstract: An aspect of the present invention provides a computer-implemented method for presenting items in a hierarchy comprising parent items and sub-items. The method comprises the steps of: identifying one or more parent items in the hierarchy, wherein all sub-items of the identified parent items possess a particular property; and presenting the hierarchy in a manner to indicate that all sub-items of the identified parent items possess the particular property.
Type:
Grant
Filed:
November 17, 2009
Date of Patent:
September 13, 2011
Assignee:
Internaltional Business Machines Corporation
Abstract: A method is disclosed for conducting a query to transform data in a pre-existing database, the method comprising: collecting database information from the pre-existing database, the database information including inconsistent dimensional tables and fact tables; running an entity discovery process on the inconsistent dimensional tables and the fact tables to produce entity mapping tables; using the entity mapping tables to resolve the inconsistent dimensional tables into resolved dimensional tables; and running the query on a resolved database to obtain a query result, the resolved database including the resolved dimensional table.
Type:
Grant
Filed:
June 5, 2008
Date of Patent:
July 12, 2011
Assignee:
International Business Machines Corporation
Inventors:
Ariel Fuxman, Peter Jay Haas, Berthold Reinwald, Yannis Sismanis, Ling Wang
Abstract: Improved high aspect ratio vias and techniques for the formation thereof are provided. In one aspect, a method of fabricating a copper plated high aspect ratio via is provided. The method comprises the following steps. A high aspect ratio via is etched in a dielectric layer. A diffusion barrier layer is deposited into the high aspect ratio via and over one or more surfaces of the dielectric layer. A copper layer is deposited over the diffusion barrier layer. A ruthenium layer is deposited over the copper layer. The high aspect ratio via is filled with copper plated onto the ruthenium layer. A copper plated high aspect ratio via formed by this method is also provided.
Type:
Grant
Filed:
June 27, 2008
Date of Patent:
June 21, 2011
Assignee:
International Business Machines Corporation
Abstract: A scheduler selects an I/O from a session of a pool and updates token buckets associated with resource limits and reserves for the session and the pool and statistics used in determining fair sharing. To select an I/O, the scheduler identifies sessions with a non-empty queue, identifies head I/Os in the queues, computes for the head I/O a deadline using session and pool reserve buckets and a release time using session and pool limit buckets, and selects a head I/O with an earliest deadline that is past the release time. If the deadline of the selected candidate head I/O is in the past, the scheduler transfers the selected head I/O to the tail of the storage device queue. Otherwise, the scheduler selects the pool with the least amount of I/O traffic according to a session fair share estimator.
Type:
Grant
Filed:
March 24, 2006
Date of Patent:
June 14, 2011
Assignee:
International Business Machines Corporation
Inventors:
Ralph Attila Becker-Szendy, Richard Andrew Golding, Caixue Lin, Theodore Ming-Tao Wong, Ahmed Zaki Omer
Abstract: A method, system, and computer usable program product for energy conservation in multipath data communications are provided in the illustrative embodiments. A current utilization of each of several of I/O devices is determined. A violation determination is made whether an I/O device from the several I/O devices can be powered down without violating a rule. The I/O device is powered down responsive to the violation determination being false. A powering up determination may be made whether an additional I/O device is needed in a multipath I/O configuration. The I/O device may be located, powered up, and made available for multipath I/O configuration. A latency determination may be made whether a latency time of the I/O device can elapse before the time when the additional I/O device is needed. The powering on may occur no later than the latency time before the time the additional I/O device is needed.
Type:
Grant
Filed:
June 27, 2008
Date of Patent:
June 7, 2011
Assignee:
International Business Machines Corporation
Inventors:
Nathan Fontenot, Jacob Lorien Moilanen, Joel Howard Schopp, Michael Thomas Strosaker
Abstract: Included are: a circuit unit having a non-volatile memory; a circuit unit having a volatile memory; a read-write circuit for reading data from, writing data into, the non-volatile memory, and for reading data from, writing data into, the volatile memory; an antenna and an RF amplifier which are first power supply means for receiving a first radio wave, and for supplying power to the circuit unit; and an antenna and an RF amplifier which are second power supply means for receiving a second radio wave whose frequency is different from that of the first radio wave, and for supplying power to the circuit unit.
Type:
Grant
Filed:
December 14, 2005
Date of Patent:
May 31, 2011
Assignee:
International Business Machines Corporation
Abstract: A security device of this invention includes a nonvolatile storage unit 22 for storing a validity check unit including a counter updated every time signature function means 30 is called up, a volatile storage unit 24 for reading and storing a counter array out of an external nonvolatile storage unit storing the counter array, in which the counter array is obtained by coupling a hash value generated for each signature key with a signature number counter for counting the number of signatures performed by use of the signature key, and a hash function unit 28 for reading the counter array out of the volatile storage unit 24, generating the hash value, and transferring the hash value to the validity check unit for a validity check.
Type:
Grant
Filed:
June 16, 2008
Date of Patent:
May 31, 2011
Assignee:
International Business Machines Corporation
Abstract: There is provided a method, a system and a program product for delivering on-target messages needed for a user, without omissions. A method for delivering a plurality of delivery messages in a delivery message database to one or more clients, comprising the steps of: delivering one or more delivery messages for a first delivery which are extracted from the delivery message database to at least one of the one or more clients, monitoring reading statuses of each of the one or more delivery messages for the first delivery, generating correlation data indicating a correlation between the plurality of delivery messages based on a result of monitoring the reading statuses, and delivering one or more delivery messages for a second delivery which are not included in the one or more delivery messages for a first delivery and are extracted from the delivery message database based on the correlation data.
Type:
Grant
Filed:
February 23, 2006
Date of Patent:
May 24, 2011
Assignee:
International Business Machines Corporation
Abstract: The invention relates to a method for determining a time for retraining a data mining model, including the steps of: calculating multivariate statistics of a training model during a training phase; storing the multivariate statistics in the data mining model; evaluating reliability of the data mining model based on the multivariate statistics and at least one distribution parameter, and deciding to retrain the data mining model based on an arbitrary measure of one or more statistical parameters including an F-test statistical analysis.
Type:
Grant
Filed:
November 6, 2007
Date of Patent:
May 3, 2011
Assignee:
International Business Machines Corporation
Inventors:
Christoph Lingenfelder, Stefan Raspl, Yannick Saillet