Gang Xu, Lishan Deng, Wenbing Ge, K. Hui, Guozhen Wang, Yi-gang Wang
We propose an angle-based mesh representation, which is invariant under translation, rotation, and uniform scaling, to encode the geometric details of a triangular mesh. Angle-based mesh representation consists of angle quantities defined on the mesh, from which the mesh can be reconstructed uniquely up to translation, rotation, and uniform scaling. The reconstruction process requires solving three sparse linear systems: the first system encodes the length of edges between vertices on the mesh, the second system encodes the relationship of local frames between two adjacent vertices on the mesh, and the third system defines the position of the vertices via the edge length and the local frames. From this angle-based mesh representation, we propose a quasi-angle-preserving mesh deformation system with the least-squares approach via handle translation, rotation, and uniform scaling. Several detail-preserving mesh editing examples are presented to demonstrate the effectiveness of the proposed method.
{"title":"Quasi-angle-preserving mesh deformation using the least-squares approach","authors":"Gang Xu, Lishan Deng, Wenbing Ge, K. Hui, Guozhen Wang, Yi-gang Wang","doi":"10.1631/jzus.C1400103","DOIUrl":"https://doi.org/10.1631/jzus.C1400103","url":null,"abstract":"We propose an angle-based mesh representation, which is invariant under translation, rotation, and uniform scaling, to encode the geometric details of a triangular mesh. Angle-based mesh representation consists of angle quantities defined on the mesh, from which the mesh can be reconstructed uniquely up to translation, rotation, and uniform scaling. The reconstruction process requires solving three sparse linear systems: the first system encodes the length of edges between vertices on the mesh, the second system encodes the relationship of local frames between two adjacent vertices on the mesh, and the third system defines the position of the vertices via the edge length and the local frames. From this angle-based mesh representation, we propose a quasi-angle-preserving mesh deformation system with the least-squares approach via handle translation, rotation, and uniform scaling. Several detail-preserving mesh editing examples are presented to demonstrate the effectiveness of the proposed method.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"754 - 763"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1400103","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67535961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xu-dong Jiang, Bin Sheng, Weiyao Lin, Wei Lu, Lizhuang Ma
Anti-aliasing is a well-established technique in computer graphics that reduces the blocky or stair-wise appearance of pixels. This paper provides a comprehensive overview of the anti-aliasing techniques used in computer graphics, which can be classified into two categories: post-filtering based anti-aliasing and pre-filtering based anti-aliasing. We discuss post-filtering based anti-aliasing algorithms through classifying them into hardware anti-aliasing techniques and post-process techniques for deferred rendering. Comparisons are made among different methods to illustrate the strengths and weaknesses of every category. We also review the utilization of anti-aliasing techniques from the first category in different graphic processing units, i.e., different NVIDIA and AMD series. This review provides a guide that should allow researchers to position their work in this important research area, and new research problems are identified.
{"title":"Image anti-aliasing techniques for Internet visual media processing: a review","authors":"Xu-dong Jiang, Bin Sheng, Weiyao Lin, Wei Lu, Lizhuang Ma","doi":"10.1631/jzus.C1400100","DOIUrl":"https://doi.org/10.1631/jzus.C1400100","url":null,"abstract":"Anti-aliasing is a well-established technique in computer graphics that reduces the blocky or stair-wise appearance of pixels. This paper provides a comprehensive overview of the anti-aliasing techniques used in computer graphics, which can be classified into two categories: post-filtering based anti-aliasing and pre-filtering based anti-aliasing. We discuss post-filtering based anti-aliasing algorithms through classifying them into hardware anti-aliasing techniques and post-process techniques for deferred rendering. Comparisons are made among different methods to illustrate the strengths and weaknesses of every category. We also review the utilization of anti-aliasing techniques from the first category in different graphic processing units, i.e., different NVIDIA and AMD series. This review provides a guide that should allow researchers to position their work in this important research area, and new research problems are identified.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"717 - 728"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1400100","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67536366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Performance and energy consumption of a solid state disk (SSD) highly depend on file systems and I/O schedulers in operating systems. To find an optimal combination of a file system and an I/O scheduler for SSDs, we use a metric called the aggregative indicator (AI), which is the ratio of SSD performance value (e.g., data transfer rate in MB/s or throughput in IOPS) to that of energy consumption for an SSD. This metric aims to evaluate SSD performance per energy consumption and to study the SSD which delivers high performance at low energy consumption in a combination of a file system and an I/O scheduler. We also propose a metric called Cemp to study the changes of energy consumption and mean performance for an Intel SSD (SSD-I) when it provides the largest AI, lowest power, and highest performance, respectively. Using Cemp, we attempt to find the combination of a file system and an I/O scheduler to make SSD-I deliver a smooth change in energy consumption. We employ Filebench as a workload generator to simulate a wide range of workloads (i.e., varmail, fileserver, and webserver), and explore optimal combinations of file systems and I/O schedulers (i.e., optimal values of AI) for tested SSDs under different workloads. Experimental results reveal that the proposed aggregative indicator is comprehensive for exploring the optimal combination of a file system and an I/O scheduler for SSDs, compared with an individual metric.
{"title":"Exploring optimal combination of a file system and an I/O scheduler for underlying solid state disks","authors":"Hui Sun, Xiao-Lin Qin, Chang-sheng Xie","doi":"10.1631/jzus.C1300314","DOIUrl":"https://doi.org/10.1631/jzus.C1300314","url":null,"abstract":"Performance and energy consumption of a solid state disk (SSD) highly depend on file systems and I/O schedulers in operating systems. To find an optimal combination of a file system and an I/O scheduler for SSDs, we use a metric called the aggregative indicator (AI), which is the ratio of SSD performance value (e.g., data transfer rate in MB/s or throughput in IOPS) to that of energy consumption for an SSD. This metric aims to evaluate SSD performance per energy consumption and to study the SSD which delivers high performance at low energy consumption in a combination of a file system and an I/O scheduler. We also propose a metric called Cemp to study the changes of energy consumption and mean performance for an Intel SSD (SSD-I) when it provides the largest AI, lowest power, and highest performance, respectively. Using Cemp, we attempt to find the combination of a file system and an I/O scheduler to make SSD-I deliver a smooth change in energy consumption. We employ Filebench as a workload generator to simulate a wide range of workloads (i.e., varmail, fileserver, and webserver), and explore optimal combinations of file systems and I/O schedulers (i.e., optimal values of AI) for tested SSDs under different workloads. Experimental results reveal that the proposed aggregative indicator is comprehensive for exploring the optimal combination of a file system and an I/O scheduler for SSDs, compared with an individual metric.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"607 - 621"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300314","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67534682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we present an adaptive two-step contourlet-wavelet iterative shrinkage/thresholding (TcwIST) algorithm for remote sensing image restoration. This algorithm can be used to deal with various linear inverse problems (LIPs), including image deconvolution and reconstruction. This algorithm is a new version of the famous two-step iterative shrinkage/thresholding (TwIST) algorithm. First, we use the split Bregman Rudin-Osher-Fatemi (ROF) model, based on a sparse dictionary, to decompose the image into cartoon and texture parts, which are represented by wavelet and contourlet, respectively. Second, we use an adaptive method to estimate the regularization parameter and the shrinkage threshold. Finally, we use a linear search method to find a step length and a fast method to accelerate convergence. Results show that our method can achieve a signal-to-noise ratio improvement (ISNR) for image restoration and high convergence speed.
{"title":"Adaptive contourlet-wavelet iterative shrinkage/thresholding for remote sensing image restoration","authors":"Nu Wen, Shi-Zhi Yang, C. Zhu, Sheng-cheng Cui","doi":"10.1631/jzus.C1300377","DOIUrl":"https://doi.org/10.1631/jzus.C1300377","url":null,"abstract":"In this paper, we present an adaptive two-step contourlet-wavelet iterative shrinkage/thresholding (TcwIST) algorithm for remote sensing image restoration. This algorithm can be used to deal with various linear inverse problems (LIPs), including image deconvolution and reconstruction. This algorithm is a new version of the famous two-step iterative shrinkage/thresholding (TwIST) algorithm. First, we use the split Bregman Rudin-Osher-Fatemi (ROF) model, based on a sparse dictionary, to decompose the image into cartoon and texture parts, which are represented by wavelet and contourlet, respectively. Second, we use an adaptive method to estimate the regularization parameter and the shrinkage threshold. Finally, we use a linear search method to find a step length and a fast method to accelerate convergence. Results show that our method can achieve a signal-to-noise ratio improvement (ISNR) for image restoration and high convergence speed.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"664 - 674"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300377","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67535178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Spatio-temporal databases aim at appropriately managing moving objects so as to support various types of queries. While much research has been conducted on developing query processing techniques, less effort has been made to address the issue of when and how to update location information of moving objects. Previous work shifts the workload of processing updates to each object which usually has limited CPU and battery capacities. This results in a tremendous processing overhead for each moving object. In this paper, we focus on designing efficient update strategies for two important types of moving objects, free-moving objects (FMOs) and network-constrained objects (NCOs), which are classified based on object movement models. For FMOs, we develop a novel update strategy, namely the FMO update strategy (FMOUS), to explicitly indicate a time point at which the object needs to update location information. As each object knows in advance when to update (meaning that it does not have to continuously check), the processing overhead can be greatly reduced. In addition, the FMO update procedure (FMOUP) is designed to efficiently process the updates issued from moving objects. Similarly, for NCOs, we propose the NCO update strategy (NCOUS) and the NCO update procedure (NCOUP) to inform each object when and how to update location information. Extensive experiments are conducted to demonstrate the effectiveness and efficiency of the proposed update strategies.
{"title":"Designing a location update strategy for free-moving and network-constrained objects with varying velocity","authors":"Yuan-Ko Huang, Lien-Fa Lin","doi":"10.1631/jzus.C1300337","DOIUrl":"https://doi.org/10.1631/jzus.C1300337","url":null,"abstract":"Spatio-temporal databases aim at appropriately managing moving objects so as to support various types of queries. While much research has been conducted on developing query processing techniques, less effort has been made to address the issue of when and how to update location information of moving objects. Previous work shifts the workload of processing updates to each object which usually has limited CPU and battery capacities. This results in a tremendous processing overhead for each moving object. In this paper, we focus on designing efficient update strategies for two important types of moving objects, free-moving objects (FMOs) and network-constrained objects (NCOs), which are classified based on object movement models. For FMOs, we develop a novel update strategy, namely the FMO update strategy (FMOUS), to explicitly indicate a time point at which the object needs to update location information. As each object knows in advance when to update (meaning that it does not have to continuously check), the processing overhead can be greatly reduced. In addition, the FMO update procedure (FMOUP) is designed to efficiently process the updates issued from moving objects. Similarly, for NCOs, we propose the NCO update strategy (NCOUS) and the NCO update procedure (NCOUP) to inform each object when and how to update location information. Extensive experiments are conducted to demonstrate the effectiveness and efficiency of the proposed update strategies.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"675 - 686"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300337","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67535028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Robotic drilling for aerospace structures demands a high positioning accuracy of the robot, which is usually achieved through error measurement and compensation. In this paper, we report the development of a practical monocular vision system for measurement of the relative error between the drill tool center point (TCP) and the reference hole. First, the principle of relative error measurement with the vision system is explained, followed by a detailed discussion on the hardware components, software components, and system integration. The elliptical contour extraction algorithm is presented for accurate and robust reference hole detection. System calibration is of key importance to the measurement accuracy of a vision system. A new method is proposed for the simultaneous calibration of camera internal parameters and hand-eye relationship with a dedicated calibration board. Extensive measurement experiments have been performed on a robotic drilling system. Experimental results show that the measurement accuracy of the developed vision system is higher than 0.15 mm, which meets the requirement of robotic drilling for aircraft structures.
{"title":"Development of a monocular vision system for robotic drilling","authors":"Wei-dong Zhu, Biao Mei, Guo-Rui Yan, Y. Ke","doi":"10.1631/jzus.C1300379","DOIUrl":"https://doi.org/10.1631/jzus.C1300379","url":null,"abstract":"Robotic drilling for aerospace structures demands a high positioning accuracy of the robot, which is usually achieved through error measurement and compensation. In this paper, we report the development of a practical monocular vision system for measurement of the relative error between the drill tool center point (TCP) and the reference hole. First, the principle of relative error measurement with the vision system is explained, followed by a detailed discussion on the hardware components, software components, and system integration. The elliptical contour extraction algorithm is presented for accurate and robust reference hole detection. System calibration is of key importance to the measurement accuracy of a vision system. A new method is proposed for the simultaneous calibration of camera internal parameters and hand-eye relationship with a dedicated calibration board. Extensive measurement experiments have been performed on a robotic drilling system. Experimental results show that the measurement accuracy of the developed vision system is higher than 0.15 mm, which meets the requirement of robotic drilling for aircraft structures.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"593 - 606"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300379","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67535240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We investigate motion synchronization of dual-cylinder pneumatic servo systems and develop an adaptive robust synchronization controller. The proposed controller incorporates the cross-coupling technology into the integrated direct/indirect adaptive robust control (DIARC) architecture by feeding back the coupled position errors, which are formed by the trajectory tracking errors of two cylinders and the synchronization error between them. The controller employs an online recursive least squares estimation algorithm to obtain accurate estimates of model parameters for reducing the extent of parametric uncertainties, and uses a robust control law to attenuate the effects of parameter estimation errors, unmodeled dynamics, and disturbances. Therefore, asymptotic convergence to zero of both trajectory tracking and synchronization errors can be guaranteed. Experimental results verify the effectiveness of the proposed controller.
{"title":"Motion synchronization of dual-cylinder pneumatic servo systems with integration of adaptive robust control and cross-coupling approach","authors":"De-yuan Meng, G. Tao, Aimin Li, Wei Li","doi":"10.1631/jzus.C1300360","DOIUrl":"https://doi.org/10.1631/jzus.C1300360","url":null,"abstract":"We investigate motion synchronization of dual-cylinder pneumatic servo systems and develop an adaptive robust synchronization controller. The proposed controller incorporates the cross-coupling technology into the integrated direct/indirect adaptive robust control (DIARC) architecture by feeding back the coupled position errors, which are formed by the trajectory tracking errors of two cylinders and the synchronization error between them. The controller employs an online recursive least squares estimation algorithm to obtain accurate estimates of model parameters for reducing the extent of parametric uncertainties, and uses a robust control law to attenuate the effects of parameter estimation errors, unmodeled dynamics, and disturbances. Therefore, asymptotic convergence to zero of both trajectory tracking and synchronization errors can be guaranteed. Experimental results verify the effectiveness of the proposed controller.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"651 - 663"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300360","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67534940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Knowledge-based modeling is a trend in complex system modeling technology. To extract the process knowledge from an information system, an approach of knowledge modeling based on interval-valued fuzzy rough set is presented in this paper, in which attribute reduction is a key to obtain the simplified knowledge model. Through defining dependency and inclusion functions, algorithms for attribute reduction and rule extraction are obtained. The approximation inference plays an important role in the development of the fuzzy system. To improve the inference mechanism, we provide a method of similarity-based inference in an interval-valued fuzzy environment. Combining the conventional compositional rule of inference with similarity based approximate reasoning, an inference result is deduced via rule translation, similarity matching, relation modification, and projection operation. This approach is applied to the problem of predicting welding distortion in marine structures, and the experimental results validate the effectiveness of the proposed methods of knowledge modeling and similarity-based inference.
{"title":"Knowledge modeling based on interval-valued fuzzy rough set and similarity inference: prediction of welding distortion","authors":"Zhi-qiang Feng, Cun-Gen Liu, Hu Huang","doi":"10.1631/jzus.C1300370","DOIUrl":"https://doi.org/10.1631/jzus.C1300370","url":null,"abstract":"Knowledge-based modeling is a trend in complex system modeling technology. To extract the process knowledge from an information system, an approach of knowledge modeling based on interval-valued fuzzy rough set is presented in this paper, in which attribute reduction is a key to obtain the simplified knowledge model. Through defining dependency and inclusion functions, algorithms for attribute reduction and rule extraction are obtained. The approximation inference plays an important role in the development of the fuzzy system. To improve the inference mechanism, we provide a method of similarity-based inference in an interval-valued fuzzy environment. Combining the conventional compositional rule of inference with similarity based approximate reasoning, an inference result is deduced via rule translation, similarity matching, relation modification, and projection operation. This approach is applied to the problem of predicting welding distortion in marine structures, and the experimental results validate the effectiveness of the proposed methods of knowledge modeling and similarity-based inference.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"636 - 650"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300370","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67534986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a ranked differential evolution (RDE) algorithm for solving the identification problem of non-linear discrete-time systems based on a Volterra filter model. In the improved method, a scale factor, generated by combining a sine function and randomness, effectively keeps a balance between the global search and the local search. Also, the mutation operation is modified after ranking all candidate solutions of the population to help avoid the occurrence of premature convergence. Finally, two examples including a highly nonlinear discrete-time rational system and a real heat exchanger are used to evaluate the performance of the RDE algorithm and five other approaches. Numerical experiments and comparisons demonstrate that the RDE algorithm performs better than the other approaches in most cases.
{"title":"Volterra filter modeling of a nonlinear discrete-time system based on a ranked differential evolution algorithm","authors":"De-Xuan Zou, Li-qun Gao, Steven Li","doi":"10.1631/jzus.C1300350","DOIUrl":"https://doi.org/10.1631/jzus.C1300350","url":null,"abstract":"This paper presents a ranked differential evolution (RDE) algorithm for solving the identification problem of non-linear discrete-time systems based on a Volterra filter model. In the improved method, a scale factor, generated by combining a sine function and randomness, effectively keeps a balance between the global search and the local search. Also, the mutation operation is modified after ranking all candidate solutions of the population to help avoid the occurrence of premature convergence. Finally, two examples including a highly nonlinear discrete-time rational system and a real heat exchanger are used to evaluate the performance of the RDE algorithm and five other approaches. Numerical experiments and comparisons demonstrate that the RDE algorithm performs better than the other approaches in most cases.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"687 - 696"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300350","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67535280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Despite the availability of garbage collectors, programmers must manually manage non-memory finite system resources such as file descriptors. Resource leaks can gradually consume all available resources and cause programs to raise resource exhaustion exceptions. However, programmers commonly provide no effective recovery approach for resource exhaustion exceptions, which often causes programs to halt without completing their tasks. In this paper, we propose to automatically recover programs from resource exhaustion exceptions caused by resource leaks. We transform programs to catch resource exhaustion exceptions, collect leaked resources, and then retry the failure code. A resource collector is designed to identify leaked resources and safely release them. We implement our approach for Java programs. Experimental results show that our approach can successfully handle resource exhaustion exceptions caused by reported resource leaks and allow programs to complete their tasks with an average execution time increase of 2.52% and negligible bytecode size increase.
{"title":"Automatic recovery from resource exhaustion exceptions by collecting leaked resources","authors":"Ziying Dai, Xiaoguang Mao, Li-qian Chen, Yan Lei","doi":"10.1631/jzus.C1300352","DOIUrl":"https://doi.org/10.1631/jzus.C1300352","url":null,"abstract":"Despite the availability of garbage collectors, programmers must manually manage non-memory finite system resources such as file descriptors. Resource leaks can gradually consume all available resources and cause programs to raise resource exhaustion exceptions. However, programmers commonly provide no effective recovery approach for resource exhaustion exceptions, which often causes programs to halt without completing their tasks. In this paper, we propose to automatically recover programs from resource exhaustion exceptions caused by resource leaks. We transform programs to catch resource exhaustion exceptions, collect leaked resources, and then retry the failure code. A resource collector is designed to identify leaked resources and safely release them. We implement our approach for Java programs. Experimental results show that our approach can successfully handle resource exhaustion exceptions caused by reported resource leaks and allow programs to complete their tasks with an average execution time increase of 2.52% and negligible bytecode size increase.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"622 - 635"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300352","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67535350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：