Abstract: A testing card for a USB port includes first USB contacting pins, a second USB contacting pin, a transmitting circuits, a voltage converting circuit, and a testing portion. The first USB contacting pins are connected to the USB port to receive a number of USB signals. The second USB contacting pin is connected to the USB port to receive a voltage signal from the USB port. The transmitting circuit is electrically connected to the first USB contacting pins to transmit the USB signals therefrom. The voltage converting circuit is electrically connected to the second USB contacting pin to convert the voltage signal to a predetermined level. The testing portion is electrically connected to the outputs of the transmitting circuit and the voltage converting circuit to receive the USB signals and the converted voltage signal.

Abstract: Space of a data storage memory of a data storage memory system is reclaimed by determining heat metrics of data stored in the data storage memory; determining relocation metrics related to relocation of the data within the data storage memory; determining utility metrics of the data relating the heat metrics to the relocation metrics for the data; and making the data whose utility metric fails a utility metric threshold, available for space reclamation. Thus, data that otherwise may be evicted or demoted, but that meets or exceeds the utility metric threshold, is exempted from space reclamation and is instead maintained in the data storage memory.

Abstract: The population of data to be inserted into secondary data storage cache is controlled by determining a heat metric of candidate data; adjusting a heat metric threshold; rejecting candidate data provided to the secondary data storage cache whose heat metric is less than the threshold; and admitting candidate data whose heat metric is equal to or greater than the heat metric threshold. The adjustment of the heat metric threshold is determined by comparing a reference metric related to hits of data most recently inserted into the secondary data storage cache, to a reference metric related to hits of data most recently evicted from the secondary data storage cache; if the most recently inserted reference metric is greater than the most recently evicted reference metric, decrementing the threshold; and if the most recently inserted reference metric is less than the most recently evicted reference metric, incrementing the threshold.

Abstract: The population of data to be inserted into secondary data storage cache is controlled by determining a heat metric of candidate data; adjusting a heat metric threshold; rejecting candidate data provided to the secondary data storage cache whose heat metric is less than the threshold; and admitting candidate data whose heat metric is equal to or greater than the heat metric threshold. The adjustment of the heat metric threshold is determined by comparing a reference metric related to hits of data most recently inserted into the secondary data storage cache, to a reference metric related to hits of data most recently evicted from the secondary data storage cache; if the most recently inserted reference metric is greater than the most recently evicted reference metric, decrementing the threshold; and if the most recently inserted reference metric is less than the most recently evicted reference metric, incrementing the threshold.

Abstract: The population of data to be admitted into secondary data storage cache of a data storage system is controlled by determining heat metrics of data of the data storage system. If candidate data is submitted for admission into the secondary cache, data is selected to tentatively be evicted from the secondary cache; candidate data provided to the secondary data storage cache is rejected if its heat metric is less than the heat metric of the tentatively evicted data; and candidate data submitted for admission to the secondary data storage cache is admitted if its heat metric is equal to or greater than the heat metric of the tentatively evicted data.

Abstract: Exemplary method, system, and computer program product embodiments for efficient track destage in secondary storage in a more effective manner, are provided. In one embodiment, by way of example only, for temporal bits employed with sequential bits for controlling the timing for destaging the track in a primary storage, the temporal bits and sequential bits are transferred from the primary storage to the secondary storage. The temporal bits are allowed to age on the secondary storage. Additional system and computer program product embodiments are disclosed and provide related advantages.

Abstract: Various embodiments for movement of partial data segments within a computing storage environment having lower and higher levels of cache by a processor are provided. In one such embodiment, a whole data segment containing one of the partial data segments is promoted to both the lower and higher levels of cache. Requested data of the whole data segment is split and positioned at a Most Recently Used (MRU) portion of a demotion queue of the higher level of cache. Unrequested data of the whole data segment is split and positioned at a Least Recently Used (LRU) portion of the demotion queue of the higher level of cache. The unrequested data is pinned in place until a write of the whole data segment to the lower level of cache completes. Additional system and computer program product embodiments are disclosed and provide related advantages.

Abstract: A vehicular L-type suspension arm is provided in which a wheel support part is provided on one end part of an arm main body, and a first vehicle body side linking portion and a second vehicle body side linking portion are provided in an intermediate part and on the other end part thereof respectively, wherein an arm main body (A) includes an upper half body (AU) that is formed so as to have an inverted U-shaped cross-section and a lower half body (AL) that is formed by press forming a plate material in a shape that blocks the lower open end of the upper half body (AU) and is welded by welds (w1) to inner faces of a pair of side wall parts 2 of the upper half body (AU), at the other end part of the arm main body (A) the lower half body (AL) extends lengthwise further outward than the upper half body (AU), an upwardly facing cylindrical bush support part (P2) is formed by burring integrally with the extended part (Ale) so that it is the second vehicle body side connecting portion (AF2), and an outer peripheral

Abstract: A vehicular L-type suspension arm is provided in which a wheel support part is provided on one end part of an arm main body, and a first vehicle body side linking portion and a second vehicle body side linking portion are provided in an intermediate part and on the other end part thereof respectively, wherein an arm main body (A) includes an upper half body (AU) having an inverted U-shaped cross-section and a lower half body (AL) that blocks the lower open end of the upper half body (AU), a first vehicle body side linking portion (AF1) is formed from front and rear support plates (SF, SR) each formed by press forming a plate material, these front and rear support plates (SF, SR) have base parts (SFa, Sra) that are integrally joined to each other, the base ends thereof being welded to an outside part of the arm main body (A), extremity parts (SFb, SRb) of the front and rear support plates (SF, SR) are arranged so as to be spaced from each other in the vehicle body fore-and-aft direction, and cylindrical bush s

Abstract: Disclosed are various embodiments for optimizing prices of items using current offers. Numerous current offers to sell an item are determined from a subset of sellers in an electronic marketplace. Each one of the subset of sellers is associated with a respective reputational score that meets a minimum threshold. A competitive price is generated for the item based at least in part on an average marketplace price determined from the current offers.

Abstract: An embodiment of an integrated circuit is disclosed. For this embodiment, the integrated circuit includes circuit blocks. At least one transistor of a circuit block of the circuit blocks includes a portion of a semiconductor substrate having a diffusion layer. The circuit block has a relatively high diffusion pattern density as compared with others of the circuit blocks. The diffusion layer has an exposed surface active area constrained responsive to a design rule. The design rule is to limit to a maximum amount the surface active area in order to improve at least one parameter of the at least one transistor selected from a group consisting of an increase in switching speed and a decrease in leakage current of the at least one transistor of the circuit block having the relatively high diffusion pattern density.

Abstract: A memory management system and method for managing memory blocks of a memory device of a computer. The system includes a free block data structure including free memory blocks for writing, and sorting the free memory blocks in a predetermined order based on block write-erase endurance cycle count and receiving new user-write requests to update existing data and relocation write requests to relocate existing data separately, a user-write block pool for receiving youngest blocks holding user-write data (i.e., any page being updated frequently) from the free block data structure, a relocation block pool for receiving oldest blocks holding relocation data (i.e., any page being updated infrequently) from the free block data structure, and a garbage collection pool structure for selecting at least one of user-write blocks and relocation blocks for garbage collection, wherein the selected block is moved back to the free block data structure upon being relocated and erased.

Abstract: A method and system for inventory placement according to expected item picking rates. In one embodiment, a method may include determining a respective expected picking rate for each of a number of inventory items, and dependent upon the expected picking rate, selecting a corresponding one of a number of zones of an inventory storage area for each of the items. The zones may be physically arranged within the inventory storage area such that a first, innermost zone is successively and at least partially surrounded by one or more other zones. The method may further include storing each of the items within the corresponding zones, such that the expected picking rates of members of a given group of items stored in a given zone are less than the expected picking rates of members of another group of items stored in a successive zone that at least partially surrounds the given zone.

Abstract: A method for optimizing locations of physical data accessed by one or more client applications interacting with a storage system, with the storage system comprising at least two redundancy groups having physical memory spaces and data bands. Each of the data bands corresponds to physical data stored on several of the physical memory spaces. A virtualized logical address space includes client data addresses utilizable by the one or more client applications. A storage controller is configured to map the client data addresses onto the data bands, such that a mapping is obtained, wherein the one or more client applications can access physical data corresponding to the data bands.

Abstract: A method for optimizing locations of physical data accessed by one or more client applications interacting with a storage system, with the storage system comprising at least two redundancy groups having physical memory spaces and data bands. Each of the data bands corresponds to physical data stored on several of the physical memory spaces. A virtualized logical address space includes client data addresses utilizable by the one or more client applications. A storage controller is configured to map the client data addresses onto the data bands, such that a mapping is obtained, wherein the one or more client applications can access physical data corresponding to the data bands.

Abstract: An anti-IL-6 antibody, including isolated nucleic acids that encode at least one anti-IL-6 antibody, vectors, host cells, transgenic animals or plants, and methods of making and using thereof have applications in diagnostic and/or therapeutic compositions, methods and devices.

Abstract: A mechanism is provided for controlling a solid state storage device in which the solid state storage comprises erasable blocks each comprising a plurality of data write locations. Input data is stored in successive groups of data write locations, each group comprising write locations in a set of erasable blocks in each of a plurality of logical subdivisions of the solid state storage. The input data is error correction encoded such that each group contains an error correction code for the input data in that group. Metadata, indicating the location of input data in the solid state storage, is maintained in memory. An indication of validity of data stored in each data write location is also maintained. Prior to erasing a block, valid input data is recovered from the or each said group containing write locations in that block. The recovered data is then re-stored as new input data.

Abstract: A container data center includes a housing, a driving device, a gear device, and a rope. The hosing includes a sidewall, and the gear device and the driving device are received within the housing. The gear device includes a winding member, one end of the rope is connected to the winding member, and the other end is connected to the rotatable sidewall. The winding member is mechanically connected to the driving device, the driving device drives the winding member to wind or unwind the rope, and the sidewall is closed or opened according to the rotation direction of the winding member.

Abstract: A memory management system and method for managing memory blocks of a memory device of a computer. The system includes a free block data structure including free memory blocks for writing, and sorting the free memory blocks in a predetermined order based on block write-erase endurance cycle count and receiving new user-write requests to update existing data and relocation write requests to relocate existing data separately, a user-write block pool for receiving youngest blocks holding user-write data (i.e., any page being updated frequently) from the free block data structure, a relocation block pool for receiving oldest blocks holding relocation data (i.e., any page being updated infrequently) from the free block data structure, and a garbage collection pool structure for selecting at least one of user-write blocks and relocation blocks for garbage collection, wherein the selected block is moved back to the free block data structure upon being relocated and erased.

Abstract: The present invention relates to a method for reducing data loss comprising a first computing step for computing an intermediate result for each redundancy information entity of a redundancy set by processing respectively associated data information entities of a given data set on at least two main diagonals of a parity check matrix representing an error correction coding scheme. The method further comprises a second computing step for computing the information content of the respective redundancy information entity dependent on the respective intermediate result.