After briefly discussing the strength and weakness of the major techniques for verification of software, such as formal proof, model checking, program analysis, software review, and software testing, we put forward a testing-based formal verification (TBFV) technique to check algorithmic function theorems that represent software properties. An algorithmic function theorem is a first-order logic theorem in which mathematical functions may be defined with an executable algorithm rather than with a mathematical expression. The testing-based formal verification is used to check the validity of the theorem using predicate-based testing. We also propose a scenario-based approach to applying the technique to verify and validate programs. Both the benefits and challenges of the technique are discussed to indicate the potential applications and future research directions.
{"title":"Testing-Based Formal Verification for Algorithmic Function Theorems and Its Application to Software Verification and Validation","authors":"Shaoying Liu","doi":"10.1109/ISSSR.2016.010","DOIUrl":"https://doi.org/10.1109/ISSSR.2016.010","url":null,"abstract":"After briefly discussing the strength and weakness of the major techniques for verification of software, such as formal proof, model checking, program analysis, software review, and software testing, we put forward a testing-based formal verification (TBFV) technique to check algorithmic function theorems that represent software properties. An algorithmic function theorem is a first-order logic theorem in which mathematical functions may be defined with an executable algorithm rather than with a mathematical expression. The testing-based formal verification is used to check the validity of the theorem using predicate-based testing. We also propose a scenario-based approach to applying the technique to verify and validate programs. Both the benefits and challenges of the technique are discussed to indicate the potential applications and future research directions.","PeriodicalId":257409,"journal":{"name":"2016 International Symposium on System and Software Reliability (ISSSR)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126166214","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}
Task workload analysis for primary-alternate fault-tolerance is usually performed based on WCET (Worst-Case Execution Time), which causes excessive redundancy of processor resource reservation in conventional real-time systems. To address this issue, a novel primary-alternate fault-tolerant model based on a variable workload is built, theorems for both the alternate schedulability and the primary execution success ratio is proposed, and their correctness are proved. Motivated by these theorems, a new algorithm called BCEVW (BCE with Variable Workload) is proposed through improving the algorithm BCE. Further, a new error probability model for the primary version is proposed, which is closer to the practice than does the conventional model. Using two metrics including schedulability of a task set and execution success ratio of the primary version, simulation results show that (1) for scheduling task sets in the alternate version, backwards-EDF algorithm performs better than backwards-RM algorithm, and the necessary and sufficient conditions for its schedulability is that the processor utilization is no more than 1; (2) in the case of variable workload, BCEVW algorithm can significantly improve the schedulability of task sets in the primary version; (3) for the new error probability model, the results of the proposed scheduling algorithm show that there is an obvious linear relationship between the error probability and execution success ratio of the primary version, and further the greater processor utilization of the primary version is, the more significant linear relationship is.
主-备用容错任务负载分析通常基于最坏情况执行时间(WCET)进行，这导致传统实时系统中处理器资源预留冗余过多。为了解决这一问题，建立了一种基于可变工作负载的主-备用容错模型，提出了备用可调度性和主执行成功率定理，并证明了定理的正确性。在这些定理的启发下，通过对BCE算法的改进，提出了一种新的算法BCEVW (BCE with Variable Workload)。在此基础上，提出了一种新的误差概率模型，该模型比传统模型更接近实际情况。利用任务集的可调度性和主版本的执行成功率两个指标，仿真结果表明:(1)对于备用版本的任务集调度，后向edf算法优于后向rm算法，其可调度性的充分必要条件是处理器利用率不大于1;(2)在可变工作量情况下，BCEVW算法可以显著提高初级版本任务集的可调度性;(3)对于新的错误概率模型，所提调度算法的结果表明，主版本的错误概率与执行成功率之间存在明显的线性关系，且主版本的处理器利用率越大，线性关系越显著。
{"title":"Fault-Tolerant Scheduling of Primary-Alternate Version Based on Variable Workload","authors":"Yingchun Huang, Qingxu Deng","doi":"10.1109/ISSSR.2016.027","DOIUrl":"https://doi.org/10.1109/ISSSR.2016.027","url":null,"abstract":"Task workload analysis for primary-alternate fault-tolerance is usually performed based on WCET (Worst-Case Execution Time), which causes excessive redundancy of processor resource reservation in conventional real-time systems. To address this issue, a novel primary-alternate fault-tolerant model based on a variable workload is built, theorems for both the alternate schedulability and the primary execution success ratio is proposed, and their correctness are proved. Motivated by these theorems, a new algorithm called BCEVW (BCE with Variable Workload) is proposed through improving the algorithm BCE. Further, a new error probability model for the primary version is proposed, which is closer to the practice than does the conventional model. Using two metrics including schedulability of a task set and execution success ratio of the primary version, simulation results show that (1) for scheduling task sets in the alternate version, backwards-EDF algorithm performs better than backwards-RM algorithm, and the necessary and sufficient conditions for its schedulability is that the processor utilization is no more than 1; (2) in the case of variable workload, BCEVW algorithm can significantly improve the schedulability of task sets in the primary version; (3) for the new error probability model, the results of the proposed scheduling algorithm show that there is an obvious linear relationship between the error probability and execution success ratio of the primary version, and further the greater processor utilization of the primary version is, the more significant linear relationship is.","PeriodicalId":257409,"journal":{"name":"2016 International Symposium on System and Software Reliability (ISSSR)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127070194","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}
Security problem of a software mainly comes from the interaction between software and its environment. In this study, the quantification modeling of the interaction between software and its environment will be established based on process calculus theory. The refinement relations of the software are proposed to compare the ability of interaction between software and its environment. The pre-congruences of refinement relation under various operators are proved to support hierarchic and modular design of software.
{"title":"The Quantitative Analysis of Interaction between Software and Environment","authors":"Yanfang Ma, Liang Chen","doi":"10.1109/ISSSR.2016.012","DOIUrl":"https://doi.org/10.1109/ISSSR.2016.012","url":null,"abstract":"Security problem of a software mainly comes from the interaction between software and its environment. In this study, the quantification modeling of the interaction between software and its environment will be established based on process calculus theory. The refinement relations of the software are proposed to compare the ability of interaction between software and its environment. The pre-congruences of refinement relation under various operators are proved to support hierarchic and modular design of software.","PeriodicalId":257409,"journal":{"name":"2016 International Symposium on System and Software Reliability (ISSSR)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121794950","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}
Software trustworthiness is an important area of software reliability. How to measure it is a challenging. This paper aims at developing a new measurement model of software trustworthiness. For this propose, we first define the trusted evidence as a program unit or element which causes the untrustworthy. Then, we classify them and propose a measurement model to measure the degree of software trustworthiness. Finally, a case study is given to show the validity of the proposed model.
{"title":"A Measurement Model for Trustworthy Software Based on Trusted Evidences","authors":"Yan Li, Yixiang Chen","doi":"10.1109/ISSSR.2016.013","DOIUrl":"https://doi.org/10.1109/ISSSR.2016.013","url":null,"abstract":"Software trustworthiness is an important area of software reliability. How to measure it is a challenging. This paper aims at developing a new measurement model of software trustworthiness. For this propose, we first define the trusted evidence as a program unit or element which causes the untrustworthy. Then, we classify them and propose a measurement model to measure the degree of software trustworthiness. Finally, a case study is given to show the validity of the proposed model.","PeriodicalId":257409,"journal":{"name":"2016 International Symposium on System and Software Reliability (ISSSR)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126354527","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}
Xiaoqiang Wang, Xuguo Wang, Fangfang Zhu, Qingguo Zhou, R. Zhou
Lots of studies have shown that memory hardware error rates are orders of magnitude higher than previously reported. In order to fight with these memory hardware errors, many memory testing tools have been developed, especially software level online memory testers, which means these memory testers implemented in software can work with the OS (operating system) at the same time. However, validation of these online memory testers is a hard work. Since the real broken memory chips is hard to find and using a virtual machine to do this work is really complex. So we have developed a memory error injection tool - MEI (Memory Error Injection), which is implemented in software on Linux platform and easy to use. The core function of MEI is implemented in the form of a Linux kernel module. MEI also provides some user space tools for memory errors injection and manipulation. The testers to be validated need to use the read interfaces provided by MEI. We have used two exists memory testers, the modified RAMpage and COMeT+ model, to validate the effectiveness of MEI. The results of experiments have shown that these two testers could detect the emulated memory hardware errors injected by MEI effectively.
{"title":"MEI: A Light Weight Memory Error Injection Tool for Validating Online Memory Testers","authors":"Xiaoqiang Wang, Xuguo Wang, Fangfang Zhu, Qingguo Zhou, R. Zhou","doi":"10.1109/ISSSR.2016.028","DOIUrl":"https://doi.org/10.1109/ISSSR.2016.028","url":null,"abstract":"Lots of studies have shown that memory hardware error rates are orders of magnitude higher than previously reported. In order to fight with these memory hardware errors, many memory testing tools have been developed, especially software level online memory testers, which means these memory testers implemented in software can work with the OS (operating system) at the same time. However, validation of these online memory testers is a hard work. Since the real broken memory chips is hard to find and using a virtual machine to do this work is really complex. So we have developed a memory error injection tool - MEI (Memory Error Injection), which is implemented in software on Linux platform and easy to use. The core function of MEI is implemented in the form of a Linux kernel module. MEI also provides some user space tools for memory errors injection and manipulation. The testers to be validated need to use the read interfaces provided by MEI. We have used two exists memory testers, the modified RAMpage and COMeT+ model, to validate the effectiveness of MEI. The results of experiments have shown that these two testers could detect the emulated memory hardware errors injected by MEI effectively.","PeriodicalId":257409,"journal":{"name":"2016 International Symposium on System and Software Reliability (ISSSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128961080","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}
The reliability of software system is very important. Common cause failures(CCF) have an influence on assessing the reliability of software. This paper studies the influence of CCF on software system reliability, and gives the quantitative method of common cause failure. We present the method of software reliability assessment in the presence of CCF. A case study is given to verify the effectiveness of the method.
{"title":"Reliability of Software Backup System in the Presence of Common Cause Failure","authors":"Baohua Wang","doi":"10.1109/ISSSR.2016.017","DOIUrl":"https://doi.org/10.1109/ISSSR.2016.017","url":null,"abstract":"The reliability of software system is very important. Common cause failures(CCF) have an influence on assessing the reliability of software. This paper studies the influence of CCF on software system reliability, and gives the quantitative method of common cause failure. We present the method of software reliability assessment in the presence of CCF. A case study is given to verify the effectiveness of the method.","PeriodicalId":257409,"journal":{"name":"2016 International Symposium on System and Software Reliability (ISSSR)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133897254","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}
Kun Cao, Junlong Zhou, Min Yin, Tongquan Wei, Mingsong Chen
In this paper, the authors address the problem of allocating and scheduling tasks of bag-of-tasks applications (BoTs) to multiprocessors for achieving makespan minimization under the thermal and timing constraints. The proposed scheme first selects the processor with highest allocation probability for every task. The allocation probability is calculated under the consideration of processor workload and temperature profiles. In addition, the higher allocation probability of a processor indicates the better performance in terms of makespan and temperature can be achieved by executing the task on this processor. Then, the operating frequencies of tasks are determined and tasks on the processor are executed in the alternate order of being hot-cool to reduce the on-chip peak temperature. Task splitting, that is, splitting a hot task into multiple sections and executing the hot subtasks with idle time alternatively, is also utilized to ensure the peak temperature constraint. Extensive simulations were performed to validate the effectiveness of the proposed approach. The proposed scheme achieves 15.31% and 19.56% reduction in makespan as compared to benchmarking scheme RATM and ?-VSTM, respectively. The peak temperature of the proposed algorithms can be up to 4.38% and 4.49% lower than that of benchmarking schemes, respectively.
{"title":"Static Thermal-Aware Task Assignment and Scheduling for Makespan Minimization in Heterogeneous Real-Time MPSoCs","authors":"Kun Cao, Junlong Zhou, Min Yin, Tongquan Wei, Mingsong Chen","doi":"10.1109/ISSSR.2016.026","DOIUrl":"https://doi.org/10.1109/ISSSR.2016.026","url":null,"abstract":"In this paper, the authors address the problem of allocating and scheduling tasks of bag-of-tasks applications (BoTs) to multiprocessors for achieving makespan minimization under the thermal and timing constraints. The proposed scheme first selects the processor with highest allocation probability for every task. The allocation probability is calculated under the consideration of processor workload and temperature profiles. In addition, the higher allocation probability of a processor indicates the better performance in terms of makespan and temperature can be achieved by executing the task on this processor. Then, the operating frequencies of tasks are determined and tasks on the processor are executed in the alternate order of being hot-cool to reduce the on-chip peak temperature. Task splitting, that is, splitting a hot task into multiple sections and executing the hot subtasks with idle time alternatively, is also utilized to ensure the peak temperature constraint. Extensive simulations were performed to validate the effectiveness of the proposed approach. The proposed scheme achieves 15.31% and 19.56% reduction in makespan as compared to benchmarking scheme RATM and ?-VSTM, respectively. The peak temperature of the proposed algorithms can be up to 4.38% and 4.49% lower than that of benchmarking schemes, respectively.","PeriodicalId":257409,"journal":{"name":"2016 International Symposium on System and Software Reliability (ISSSR)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123031670","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}
Due to the environmental constraints, the use of high-performance embedded multi-core processor to solve the problem of scientific computing is the only way in a specified environment. This paper discusses the parallel computing framework and method in embedded multi-core system that used in safety critical system, and analyzes the performance of computation with three methods: the single thread, multi-thread and OpenMP in loongson processor, Intel Q8300 processor and I7 860 processor. The research shows that the parallel computing framework for multi-core processors can significantly improve the efficiency of program execution when the complexity of the case is not too high. The simulation test expressed that the parallel speedup is better in the loongson platform than Q8300 although the real performance of the processor is more faster than loongson.
{"title":"Performance Analysis of Parallel Computing Framework on Embedded Multi-core Trustworthy Systems","authors":"Weidong Ma, Zhiying Wang","doi":"10.1109/ISSSR.2016.014","DOIUrl":"https://doi.org/10.1109/ISSSR.2016.014","url":null,"abstract":"Due to the environmental constraints, the use of high-performance embedded multi-core processor to solve the problem of scientific computing is the only way in a specified environment. This paper discusses the parallel computing framework and method in embedded multi-core system that used in safety critical system, and analyzes the performance of computation with three methods: the single thread, multi-thread and OpenMP in loongson processor, Intel Q8300 processor and I7 860 processor. The research shows that the parallel computing framework for multi-core processors can significantly improve the efficiency of program execution when the complexity of the case is not too high. The simulation test expressed that the parallel speedup is better in the loongson platform than Q8300 although the real performance of the processor is more faster than loongson.","PeriodicalId":257409,"journal":{"name":"2016 International Symposium on System and Software Reliability (ISSSR)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121382489","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}
Qingcheng Li, Heng Cao, Y. Lu, Haoqiang Yan, Tao Li
Keyboard, mouse as fundamental input devices of computer systems, have changed traditional input behavior of human beings & writing experiences. However, handwriting, painting are still indispensable communication styles. In recent years, touch screen has become a prevailing human computer interface on many kinds of digital devices, which makes it possible for people using a pen to take notes as writing on paper. Moreover, for maintaining primitive input habits, body language is also needed to be translated by machines. With the development of embedded sensors of smart devices and artificial intelligence technologies, many new approaches have been used to recognize human actions. In this paper, we propose a system called Airpen system, which bridges two input modes: writing and in-air gesturing controlling of human body language through a pen-shape controller. Airpen system projects touch screen writing trajectories to a projection screen and uses in-air gestures to make control operations of non-touch screens. In this paper, we firstly design an input mode switching metrics using acceleration status, then implement in-air gesturing recognition using support vector machine(SVM) with accelerometer data. Finally, we validate that our input mode switching metrics can hardly be perceived by users and in-air gesture recognition can achieve high accuracy.
{"title":"Controlling Non-Touch Screens as Touch Screens Using Airpen, a Writing Tool with In-Air Gesturing Mode","authors":"Qingcheng Li, Heng Cao, Y. Lu, Haoqiang Yan, Tao Li","doi":"10.1109/ISSSR.2016.020","DOIUrl":"https://doi.org/10.1109/ISSSR.2016.020","url":null,"abstract":"Keyboard, mouse as fundamental input devices of computer systems, have changed traditional input behavior of human beings & writing experiences. However, handwriting, painting are still indispensable communication styles. In recent years, touch screen has become a prevailing human computer interface on many kinds of digital devices, which makes it possible for people using a pen to take notes as writing on paper. Moreover, for maintaining primitive input habits, body language is also needed to be translated by machines. With the development of embedded sensors of smart devices and artificial intelligence technologies, many new approaches have been used to recognize human actions. In this paper, we propose a system called Airpen system, which bridges two input modes: writing and in-air gesturing controlling of human body language through a pen-shape controller. Airpen system projects touch screen writing trajectories to a projection screen and uses in-air gestures to make control operations of non-touch screens. In this paper, we firstly design an input mode switching metrics using acceleration status, then implement in-air gesturing recognition using support vector machine(SVM) with accelerometer data. Finally, we validate that our input mode switching metrics can hardly be perceived by users and in-air gesture recognition can achieve high accuracy.","PeriodicalId":257409,"journal":{"name":"2016 International Symposium on System and Software Reliability (ISSSR)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127647073","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}
Tongue diagnosis is one of the main components of traditional Chinese medicine (TCM). Developing an objective and quantitative recognition model is very importantly and useful in the modernization of TCM. Currently, major problems in digital diagnoses of tongue images are extracting suitable features and building a high-performance classifier. To address these two issues, we present a robust approach to infer the pathological characteristics. In contrast to other methods, this method makes full use of the local information of tongue images and similarities among tongue images. Our method includes the following three steps: (1) we exact HOG features based on theory of local object appearance and shape; (2) the most similar tongue images are found that belongs to the same label and belongs to the different label, which are then used to build a new sample for Doublet; (3) we calculate the distance metric M by the SVM classifier and doublets; and (4) we make prediction. Experimental results show that prediction accuracy of our method is 89.1% and achieves a specificity of 61.3%. Moreover, the Sensitivity is 95.8%. The work is helpful in the area of medical for detection and prevention of diseases.
{"title":"Classification of Tongue Images Based on Doublet SVM","authors":"Jie Ding, Guitao Cao, Dan Meng","doi":"10.1109/ISSSR.2016.021","DOIUrl":"https://doi.org/10.1109/ISSSR.2016.021","url":null,"abstract":"Tongue diagnosis is one of the main components of traditional Chinese medicine (TCM). Developing an objective and quantitative recognition model is very importantly and useful in the modernization of TCM. Currently, major problems in digital diagnoses of tongue images are extracting suitable features and building a high-performance classifier. To address these two issues, we present a robust approach to infer the pathological characteristics. In contrast to other methods, this method makes full use of the local information of tongue images and similarities among tongue images. Our method includes the following three steps: (1) we exact HOG features based on theory of local object appearance and shape; (2) the most similar tongue images are found that belongs to the same label and belongs to the different label, which are then used to build a new sample for Doublet; (3) we calculate the distance metric M by the SVM classifier and doublets; and (4) we make prediction. Experimental results show that prediction accuracy of our method is 89.1% and achieves a specificity of 61.3%. Moreover, the Sensitivity is 95.8%. The work is helpful in the area of medical for detection and prevention of diseases.","PeriodicalId":257409,"journal":{"name":"2016 International Symposium on System and Software Reliability (ISSSR)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116040576","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
扫码关注我们
求助内容：
应助结果提醒方式：