We put forward an optimal disk schedule with n disk requests and prove its optimality mathematically.Generalizing the idea of an optimal disk schedule, we remove the limit of n requests and, at the same time, consider...We put forward an optimal disk schedule with n disk requests and prove its optimality mathematically.Generalizing the idea of an optimal disk schedule, we remove the limit of n requests and, at the same time, consider the dynamically arrival model of disk requests to obtain an algorithm, shortest path first-fit first （SPFF）. This algorithm is based on the shortest path of disk head motion constructed by all the pendent requests. From view of the head moving distance, it has the stronger glohality than SSTF. From view of the head-moving direction, it has the better flexibility than SCAN. Therefore, SPFF keeps the advantage of SCAN and, at the same time, absorbs the strength of SSTF. The algorithm SPFF not only shows the more superiority than other scheduling polices, but also have higher adjustability to meet the computer system＇s different demands.展开更多
As increase of disk access speed has far lagged the speed of processors and main memory, disk-scheduling performance, although less significant for personal users with dedicated storage, is crucial for internet-based ...As increase of disk access speed has far lagged the speed of processors and main memory, disk-scheduling performance, although less significant for personal users with dedicated storage, is crucial for internet-based intensive data processing. For modern disks, increase of disk rotation rate makes overhead of disk access to data transfer heavier. Therefore, it seems more important to improve both parallel processing capability of disk I/O and disk-scheduling performance at the same time. For disk-scheduling algorithms based on both disk arm and rotational positions, their time-resolving powers are more precise in comparison with those for disk-scheduling algorithms based only on disk arm position. Algorithms of this sort are studied in this paper. Several improved algorithms based on rotational position are proposed, and simulation results of their performances demonstrate.展开更多
The connected dominating set （CDS） problem, which consists of finding a smallest connected dominating set for graphs is an NP-hard problem in the unit disk graphs （UDGs）. This paper focuses on the CDS problem in w...The connected dominating set （CDS） problem, which consists of finding a smallest connected dominating set for graphs is an NP-hard problem in the unit disk graphs （UDGs）. This paper focuses on the CDS problem in wireless networks. Investigation of some properties of independent set （IS） in UDGs shows that geometric features of nodes distribution like angle and area can be used to design efficient heuristics for the approximation algorithms. Several constant factor approximation algorithms are presented for the CDS problem in UDGs. Simulation results show that the proposed algorithms perform better than some known ones.展开更多
New adaptive preprocessing algorithms based on the polar coordinate system were put forward to get high-precision corneal topography calculation results. Adaptive locating algorithms of concentric circle center were c...New adaptive preprocessing algorithms based on the polar coordinate system were put forward to get high-precision corneal topography calculation results. Adaptive locating algorithms of concentric circle center were created to accurately capture the circle center of original Placido-based image, expand the image into matrix centered around the circle center, and convert the matrix into the polar coordinate system with the circle center as pole. Adaptive image smoothing treatment was followed and the characteristics of useful circles were extracted via horizontal edge detection, based on useful circles presenting approximate horizontal lines while noise signals presenting vertical lines or different angles. Effective combination of different operators of morphology were designed to remedy data loss caused by noise disturbances, get complete image about circle edge detection to satisfy the requests of precise calculation on follow-up parameters. The experimental data show that the algorithms meet the requirements of practical detection with characteristics of less data loss, higher data accuracy and easier availability.展开更多
Laptop personal computers(LPCs) and their components are vulnerable devices in harsh mechanical environments. One of the most sensitive components of LPCs is hard disk drive(HDD) which needs to be protected against da...Laptop personal computers(LPCs) and their components are vulnerable devices in harsh mechanical environments. One of the most sensitive components of LPCs is hard disk drive(HDD) which needs to be protected against damages attributable to shock and vibration in order to have better magnetic read/write performance. In the present work, a LPC and its HDD are modeled as two degrees of freedom system and the nonlinear optimization method is employed to perform a passive control through minimizing peak of HDD absolute acceleration caused by a base shock excitation. The presented shock excitation is considered as half-sine pulse of acceleration. In addition, eleven inequality constraints are defined based on geometrical limitations and allowable intervals of lumped modal parameters. The target of the optimization is to reach optimum modal parameters of rubber mounts and rubber feet as design variables and subsequently propose new characteristics of rubber mounts and rubber feet to be manufactured for the HDD protection against shock excitation. The genetic algorithm and the modified constrained steepest descent algorithm are employed in order to solve the nonlinear optimization problem for three widely-used commercial cases of HDD. Finally, the results of both optimization methods are compared to make sure about their accuracy.展开更多
基金Supported by the National Natural Science Founda-tion of China (60373088)
文摘We put forward an optimal disk schedule with n disk requests and prove its optimality mathematically.Generalizing the idea of an optimal disk schedule, we remove the limit of n requests and, at the same time, consider the dynamically arrival model of disk requests to obtain an algorithm, shortest path first-fit first （SPFF）. This algorithm is based on the shortest path of disk head motion constructed by all the pendent requests. From view of the head moving distance, it has the stronger glohality than SSTF. From view of the head-moving direction, it has the better flexibility than SCAN. Therefore, SPFF keeps the advantage of SCAN and, at the same time, absorbs the strength of SSTF. The algorithm SPFF not only shows the more superiority than other scheduling polices, but also have higher adjustability to meet the computer system＇s different demands.
基金Project supported by National Natural Science Foundation of Chi-na( Grant No . 60373088) , and Defense Pre-research Project ofChina(Grant No .413160502)
文摘As increase of disk access speed has far lagged the speed of processors and main memory, disk-scheduling performance, although less significant for personal users with dedicated storage, is crucial for internet-based intensive data processing. For modern disks, increase of disk rotation rate makes overhead of disk access to data transfer heavier. Therefore, it seems more important to improve both parallel processing capability of disk I/O and disk-scheduling performance at the same time. For disk-scheduling algorithms based on both disk arm and rotational positions, their time-resolving powers are more precise in comparison with those for disk-scheduling algorithms based only on disk arm position. Algorithms of this sort are studied in this paper. Several improved algorithms based on rotational position are proposed, and simulation results of their performances demonstrate.
基金supported by the National Natural Science Foundation of China under Grant No 60473090the National "11th Five-Year-Supporting-Plan" of China under Grant No 2006BAH02A0407
文摘The connected dominating set （CDS） problem, which consists of finding a smallest connected dominating set for graphs is an NP-hard problem in the unit disk graphs （UDGs）. This paper focuses on the CDS problem in wireless networks. Investigation of some properties of independent set （IS） in UDGs shows that geometric features of nodes distribution like angle and area can be used to design efficient heuristics for the approximation algorithms. Several constant factor approximation algorithms are presented for the CDS problem in UDGs. Simulation results show that the proposed algorithms perform better than some known ones.
基金Project(20120321028-01)supported by Scientific and Technological Key Project of Shanxi Province,ChinaProject(20113101)supported by Postgraduate Innovative Key Project of Shanxi Province,China
文摘New adaptive preprocessing algorithms based on the polar coordinate system were put forward to get high-precision corneal topography calculation results. Adaptive locating algorithms of concentric circle center were created to accurately capture the circle center of original Placido-based image, expand the image into matrix centered around the circle center, and convert the matrix into the polar coordinate system with the circle center as pole. Adaptive image smoothing treatment was followed and the characteristics of useful circles were extracted via horizontal edge detection, based on useful circles presenting approximate horizontal lines while noise signals presenting vertical lines or different angles. Effective combination of different operators of morphology were designed to remedy data loss caused by noise disturbances, get complete image about circle edge detection to satisfy the requests of precise calculation on follow-up parameters. The experimental data show that the algorithms meet the requirements of practical detection with characteristics of less data loss, higher data accuracy and easier availability.
文摘Laptop personal computers(LPCs) and their components are vulnerable devices in harsh mechanical environments. One of the most sensitive components of LPCs is hard disk drive(HDD) which needs to be protected against damages attributable to shock and vibration in order to have better magnetic read/write performance. In the present work, a LPC and its HDD are modeled as two degrees of freedom system and the nonlinear optimization method is employed to perform a passive control through minimizing peak of HDD absolute acceleration caused by a base shock excitation. The presented shock excitation is considered as half-sine pulse of acceleration. In addition, eleven inequality constraints are defined based on geometrical limitations and allowable intervals of lumped modal parameters. The target of the optimization is to reach optimum modal parameters of rubber mounts and rubber feet as design variables and subsequently propose new characteristics of rubber mounts and rubber feet to be manufactured for the HDD protection against shock excitation. The genetic algorithm and the modified constrained steepest descent algorithm are employed in order to solve the nonlinear optimization problem for three widely-used commercial cases of HDD. Finally, the results of both optimization methods are compared to make sure about their accuracy.
