Abstract: Method and apparatus are provided for presenting various levels of detail about successful error recoveries and background hardware optimizations during the recording and retrieval of digital information on magnetic tape. A first, Band Summary, report presents a high-level summary of recovery methods by data band and wrap. A second, Detail Summary, report presents a mid-level summary of recovery methods by track and longitudinal position (LPOS) region within one wrap of a band on the tape. A third, ERP Summary, report presents a low-level summary of errors and specific recovery methods and optimizations by LPOS region within each wrap. Such “telescoping” views permit pattern analysis to be performed at different resolutions. Thus, correlations of possible interactions between hardware and microcode activities that result in changes of the nominal operating point of the drive may be identified.

Abstract: The employment of cascoding in connection with improving mixer isolation in a Gilbert mixer circuit. In this vein, there is broadly contemplated herein, inter alia, the provision of a mixer suitable for use in a direct-conversion radio receiver operating in the 57-64 GHz industrial, scientific, and medical (ISM) band. Such a receiver may be integrated along with a transmitter entirely on a silicon integrated circuit and can be used to receive and transmit data signals in such applications as wireless personal-area networks (WPANs). Numerous other applications, of course, are available for a mixer with improved LO-to-RF isolation, particularly at millimeter-wave frequencies where high LO-to-RF isolation is difficult to achieve.

Abstract: A method which identifies different types of substructures within a graph and encodes them using techniques suitable to the characteristics of each of them. The method is embodied by an efficient two-phase algorithm, where the first phase identifies and encodes strongly connected components as well as tree substructures, and the second phase encodes the remaining reachability relationships by compressing dense rectangular submatrices in the transitive closure matrix.

Abstract: Methods, apparatus and computer program products are provided to monitor and report performance data of a device such as a data storage drive. A plurality of quantitative values are obtained from feedback and measurement mechanisms in a data storage device of a first model during operation of the storage device. The plurality of quantitative values are normalized. Then, one or more qualitative values are generated from one or more normalized quantitative values and evaluated against corresponding baseline performance values established for the first model.

Abstract: The present invention provides a method and system of eliminating file redundancy for at least one computer file in a computer filesystem and a method and system of establishing match permission for at least one computer file in a computer filesystem. The present invention provides a method and system of eliminating file redundancy for at least one computer file in a computer filesystem. In an exemplary embodiment the method and system eliminates file redundancy for at least one computer file in a computer filesystem via implicit file unification. In an exemplary embodiment the method and system eliminates file redundancy for at least one computer file in a computer filesystem via explicit file unification. In an exemplary embodiment the method and system eliminates file redundancy in a computer filesystem via file identifier file unification.

Abstract: A unified program analysis framework that facilitates the analysis of complex multi-language software systems, analysis reuse, and analysis comparison, by employing techniques such as program translation and automatic results mapping, is presented. The feasibility and effectiveness of such a framework are demonstrated using a sample application of the framework. The comparison yields new insights into the effectiveness of the techniques employed in both analysis tools. These encouraging results yield the observation that such a unified program analysis framework will prove to be valuable both as a testbed for examining different language analysis techniques, and as a unified toolset for broad program analysis.

Abstract: The present invention provides a method and system of assigning a publication date for at least one electronic document, where the publication date includes the year that the document was published, the month that the document was published, and the day that the document was published. In an exemplary embodiment, the method and system include (1) recognizing the publication date in the document by regular expression pattern matching, (2) if the publication date is ambiguous, resolving the ambiguous publication date, and (3) validating the publication date. In an exemplary embodiment, the recognizing includes determining at least one candidate publication date from the document identifier of the document. In an exemplary embodiment, the recognizing includes determining the publication date from the textual content of the document. In an exemplary embodiment, the recognizing includes determining the publication date from the metadata of the document.

Abstract: A static memory logic circuit is disclosed that may reduce bitline delay. The disclosed logic circuit partitions a bitline associated with a column of memory cells into segments. In this manner, a bitline driver in a memory cell need only drive a portion of a bitline rather than the entire bitline. This approach reduces the effective resistance and capacitance associated with the bitline, and may result in less delay through the bitline.

Abstract: Arrangements and methods for providing cache management. Preferably, a buffer arrangement is provided that is adapted to record incoming data into a first cache memory from a second cache memory, convey a data location in the first cache memory upon a prompt for corresponding data, in the event of a hit in the first cache memory, and refer to the second cache memory in the event of a miss in the first cache memory.

Abstract: A client-server network environment is temporarily transformed into a grid computing environment through the deployment of a network-booted grid operating system to each of a plurality of network clients. Each participating client operates in the client-server mode under a local operating system. At an appropriate time, a server transmits to each client a thin-client boot image (a dynamically built customized image or an image obtained from a store of predefined boot images) along with a grid application for which the thin-client has been optimized for peak performance. Each client re-boots using the thin-client image, thereby entering the grid mode and allowing substantially all of its computing resources to be dedicated to executing the grid application. At a later time, the server directs that each client terminate the grid application and re-boot in its respective local operating system, reverting again to the client-server mode.

Abstract: Systems and methods for providing density-based traffic generation. Data are clustered to create partitions, and transforms of clustered data are constructed in a transformed space. Data points are generated via employing grid discretization in the transformed space, and density estimates of the generated data points are employed to generate synthetic pseudo-points.

Abstract: A new power gating structure with robust data retention capability using only one single double-gate device to provide both power gating switch and virtual supply/ground diode clamp functions. The scheme reduces the transistor count, area, and capacitance of the power gating structure, thus improving circuit performance, power, and leakage. The scheme is compared with the conventional power gating structure via mixed-mode physics-based two-dimensional numerical simulations. Analysis of virtual supply/ground bounce for the proposed scheme is also presented.

Abstract: A high security communication station delivers information to an authenticated user. The station receives encrypted information intended for a particular user. The station verifies the identity of the current user using the highly secure technology of retinal scan or iris scan in one embodiment. A detector checks physiological information of the current user to assure that the user currently exhibits no substantial stress that might indicate improper force or duress by a third party. Once the station authenticates the current user and assures that the current user exhibits no substantial stress, the station decrypts the received information and renders the information for secure delivery to the intended user, namely the authenticated current user. The station substantially co-locates the point of decryption with the point of information delivery.

Abstract: A high security communication station delivers information to an authenticated user. The station receives encrypted information intended for a particular user. The station verifies the identity of the current user using the highly secure technology of retinal scan or iris scan in one embodiment. Once the station authenticates the current user, the station decrypts the received information and renders the information for secure delivery to the intended recipient, namely the authenticated current user. The station is configured such that the point of decryption is substantially co-located with the point of information delivery. By integrating the point of decryption, the point of information delivery as well as the point of user authentication in the same structure, the possibility of information interception by an unauthorized party is dramatically reduced.

Abstract: A method of dynamic performance balancing in a distributed computer system including collecting average service time statistics for application requests distributed from multiple application servers and collecting application server CPU utilization statistics from multiple hosts where each host is associated with at least one of the application servers. In addition, the method includes periodically calculating scaled routing weights from the average service time and CPU utilization statistics and distributing server requests to the application servers in accordance with the scaled routing weights. Also disclosed is a distributed computer system configured to accomplish dynamic performance balancing as described above, and an article of manufacture for use in programming a distributed computer system containing instructions to accomplish dynamic performance balancing of server requests as described above.

Abstract: Arrangements and methods for performing structural clustering between different time series. Time series data relating to a plurality of time series is accepted, structural features relating to the time series data are ascertained, and at least one distance between different time series via employing the structural features is determined. The different time series may be partitioned into clusters based on the at least one distance, and/or the k closest matches to a given time series query based on the at least one distance may be returned.

Abstract: A method and system for improving the performance of a cache. The cache may include an array of tag entries where each tag entry includes an additional bit (“reused bit”) used to indicate whether its associated cache line has been reused, i.e., has been requested or referenced by the processor. By tracking whether a cache line has been reused, data (cache line) that may not be reused may be replaced with the new incoming cache line prior to replacing data (cache line) that may be reused. By replacing data in the cache memory that might not be reused prior to replacing data that might be reused, the cache hit may be improved thereby improving performance.

Abstract: A system accesses a log of events on more than one computing system and scans these logs in an effort to determine the likely cause of various items of interest, events, or problems. These items of interest often include improper or frustrating behavior of a computer system, but may also include delightful or beneficial behaviors for which a user, group of users, company, service, or help desk seeks a cause. Once the likely source of the item of interest is found, a test may be performed to confirm the source of the problem and warning or corrective action taken.

Abstract: Methods and apparatus are provided for dynamically compressing categories in a data storage library. In one embodiment, the method includes retrieving an identification of a first category in the data storage library, the first category being a last-compressed category. Next, an identification number of a first order of the first category is retrieved, the first order being a last compressed order. Compression is resumed of orders in the first category with an order next following the first order and continued with additional orders in the first category. If a predetermined amount of time has elapsed, the identification of the first category and the identification number of the order of the first category being compressed are stored. If, however, the predetermined amount of time has not elapsed and compression of the first category is complete, compression of a second category is begun.

Abstract: An edge triggered system is provided having a data and scan input includes a latch device having a clock input and an AND gate, coupled to the latch device, structured and arranged to receive a first clock signal and an inverted clock signal to generate a clock to the clock input. A process for operating an edge triggered system having a data and scan input includes forwarding a first clock signal to an input of an AND gate. The method includes inverting a second clock signal forwarded to another input of the AND gate and generating a clock input for a latch device from the AND gate.