Hard disk drives continue to increase in areal data density. This requires air bearing sliders with lower and lower flying heights (FH). Also the uniformity of the FH and the flatness of the roll profile with radius become more critical as the FH gets lower. By using modern optimization techniques, it is possible to optimize slider air bearing surface (ABS) designs according to multiple design goals. In this paper, we discuss two modifications to the DIRECT algorithm: one to handle tolerance and one to deal with hidden constraints. Some numerical experiments were carried out using these modifications and the modified DIRECT algorithm was applied to slider ABS optimization. The results show that these two modifications can improve the efficiency of the DIRECT algorithm and they also provide more flexibility in slider ABS optimization. 相似文献
There are two purposes of this work. One is to present two accurate two-noded finite elements which are derived from the
potential energy principle and the Hellinger–Reissner functional principle respectively. The second is to show the successful
application of the internal displacement parameters in developing a high-order related displacement-rotation interpolation
field. Because the derived interpolation field is capable of accurately modeling deformation modes in extreme thin curved
beams and nearly straight beams, both shear locking and membrane shocking are avoided. Several standard numerical tests display
superior behaviors of the present elements.
Received: 5 February 2002 / Accepted: 16 September 2002 相似文献
This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.
A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system. 相似文献