Pub Date : 2014-03-19DOI: 10.3724/SP.J.1016.2013.01898
Yanli Li, Zhong Zhou, Wei Wu
{"title":"Scene Parsing Based on A Two-Level Conditional Random Field: Scene Parsing Based on A Two-Level Conditional Random Field","authors":"Yanli Li, Zhong Zhou, Wei Wu","doi":"10.3724/SP.J.1016.2013.01898","DOIUrl":"https://doi.org/10.3724/SP.J.1016.2013.01898","url":null,"abstract":"","PeriodicalId":35776,"journal":{"name":"计算机学报","volume":"36 1","pages":"1898-1907"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70041675","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}
Pub Date : 2014-03-19DOI: 10.3724/SP.J.1016.2013.01785
Min Zhu, Ke Xu, Song Lin
{"title":"The Evaluation Method towards the Application Adaptability of Internet Architecture: The Evaluation Method towards the Application Adaptability of Internet Architecture","authors":"Min Zhu, Ke Xu, Song Lin","doi":"10.3724/SP.J.1016.2013.01785","DOIUrl":"https://doi.org/10.3724/SP.J.1016.2013.01785","url":null,"abstract":"","PeriodicalId":35776,"journal":{"name":"计算机学报","volume":"9 1","pages":"1785-1798"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70061738","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}
Pub Date : 2014-03-19DOI: 10.3724/SP.J.1016.2013.02019
Guoqi Xie, R. Li, Lin Liu, Fan Yang
{"title":"DAG Reliability Model and Fault-Tolerant Algorithm for Heterogeneous Distributed Systems","authors":"Guoqi Xie, R. Li, Lin Liu, Fan Yang","doi":"10.3724/SP.J.1016.2013.02019","DOIUrl":"https://doi.org/10.3724/SP.J.1016.2013.02019","url":null,"abstract":"","PeriodicalId":35776,"journal":{"name":"计算机学报","volume":"36 1","pages":"2019-2032"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70041626","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}
Pub Date : 2014-03-19DOI: 10.3724/SP.J.1016.2013.02033
Chen Zhi, W. Jigang, Song Guozhi, Chen Jinliang
Hardware/software(HW/SW)co-design is a key technique for the development of modern embedded systems.HW/SW partitioning is a crucial step in HW/SW co-design that determines which components of the computer system are implemented on hardware and which ones on software.In this paper,we present an efficient algorithm for hardware/software partitioning:NodeRank.Formulating the HW/SW partitioning problem as a variant of 0-1knapsack problem with dynamic communication costs,NodeRank iteratively calculates the rank of each node,updates the expectation of communication costs,and thus generates the corresponding heuristic solutions to the problem.Experimental results show that,when the computation cost and communication cost are roughly of equal weight and the real-time constraint is loose,NodeRank is inferior to the state-of-the-art Tabu Search method at most by 1.2%for task graphs with edge to node ratio equal or greater than 2,but saves more than 95% running time on average.For communication-intensive cases,NodeRank outperforms Tabu Search by up to 3.5% and saves runtime over 75%.
{"title":"NodeRank:An Efficient Algorithm for Hardware/Software Partitioning","authors":"Chen Zhi, W. Jigang, Song Guozhi, Chen Jinliang","doi":"10.3724/SP.J.1016.2013.02033","DOIUrl":"https://doi.org/10.3724/SP.J.1016.2013.02033","url":null,"abstract":"Hardware/software(HW/SW)co-design is a key technique for the development of modern embedded systems.HW/SW partitioning is a crucial step in HW/SW co-design that determines which components of the computer system are implemented on hardware and which ones on software.In this paper,we present an efficient algorithm for hardware/software partitioning:NodeRank.Formulating the HW/SW partitioning problem as a variant of 0-1knapsack problem with dynamic communication costs,NodeRank iteratively calculates the rank of each node,updates the expectation of communication costs,and thus generates the corresponding heuristic solutions to the problem.Experimental results show that,when the computation cost and communication cost are roughly of equal weight and the real-time constraint is loose,NodeRank is inferior to the state-of-the-art Tabu Search method at most by 1.2%for task graphs with edge to node ratio equal or greater than 2,but saves more than 95% running time on average.For communication-intensive cases,NodeRank outperforms Tabu Search by up to 3.5% and saves runtime over 75%.","PeriodicalId":35776,"journal":{"name":"计算机学报","volume":"36 1","pages":"2033-2040"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70041684","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}
Pub Date : 2014-03-19DOI: 10.3724/SP.J.1016.2013.02236
T. He, Xinming Wang, Xiaocong Zhou, Wen-jun Li, Zhenyu Zhang, S. Cheung
Recent fault localization techniques leverage program coverage of both passed test runs and failed test runs to reduce the high cost of debugging.The effectiveness of such techniques can be adversely affected by coincidental correctness,which occurs in a passed test run when a fault has been executed but no failure is detected.Studies have shown that coincidental correctness is a common phenomenon and its occurrence can significantly reduce the effectiveness of fault localization.In this paper,a fault localization technique named Muffler is proposed,which uses mutation analysis to address this problem and improve fault localization.Muffler systematically mutates statements in a faulty program and estimates their likelihood of being faulty based on both coverage and how mutation affects the outcome of passed test cases.Experiments on eight benchmark programs widely used in fault localization are conducted to evaluate our method.Results indicate that Muffler can help programmers locate faults effectively with a reduction of 50.26%in code examination effort.
{"title":"A Software Fault Localization Technique Based on Program Mutations","authors":"T. He, Xinming Wang, Xiaocong Zhou, Wen-jun Li, Zhenyu Zhang, S. Cheung","doi":"10.3724/SP.J.1016.2013.02236","DOIUrl":"https://doi.org/10.3724/SP.J.1016.2013.02236","url":null,"abstract":"Recent fault localization techniques leverage program coverage of both passed test runs and failed test runs to reduce the high cost of debugging.The effectiveness of such techniques can be adversely affected by coincidental correctness,which occurs in a passed test run when a fault has been executed but no failure is detected.Studies have shown that coincidental correctness is a common phenomenon and its occurrence can significantly reduce the effectiveness of fault localization.In this paper,a fault localization technique named Muffler is proposed,which uses mutation analysis to address this problem and improve fault localization.Muffler systematically mutates statements in a faulty program and estimates their likelihood of being faulty based on both coverage and how mutation affects the outcome of passed test cases.Experiments on eight benchmark programs widely used in fault localization are conducted to evaluate our method.Results indicate that Muffler can help programmers locate faults effectively with a reduction of 50.26%in code examination effort.","PeriodicalId":35776,"journal":{"name":"计算机学报","volume":"36 1","pages":"2236-2244"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70042286","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}
{"title":"A Testing Approach for Web Services Security Based on Security Rules Mutation: A Testing Approach for Web Services Security Based on Security Rules Mutation","authors":"Jinfu Chen, Qing Li, Chengying Mao, Yongzhao Zhan, Rubing Huang, Jiamei Chen","doi":"10.3724/SP.J.1016.2013.01967","DOIUrl":"https://doi.org/10.3724/SP.J.1016.2013.01967","url":null,"abstract":"","PeriodicalId":35776,"journal":{"name":"计算机学报","volume":"36 1","pages":"1967-1981"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70041931","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}
Pub Date : 2014-03-19DOI: 10.3724/SP.J.1016.2013.02146
Zhaonian Zou, Rong Zhu
{"title":"Mining Top-k Maximal Cliques from Large Uncertain Graphs: Mining Top-k Maximal Cliques from Large Uncertain Graphs","authors":"Zhaonian Zou, Rong Zhu","doi":"10.3724/SP.J.1016.2013.02146","DOIUrl":"https://doi.org/10.3724/SP.J.1016.2013.02146","url":null,"abstract":"","PeriodicalId":35776,"journal":{"name":"计算机学报","volume":"36 1","pages":"2146-2155"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70042032","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}
Pub Date : 2014-03-19DOI: 10.3724/SP.J.1016.2013.02132
Xixian Han, Jianzhong Li, Hong Gao
{"title":"An Efficient Top-k Dominating Algorithm on Massive Data Title: An Efficient Top-k Dominating Algorithm on Massive Data Title","authors":"Xixian Han, Jianzhong Li, Hong Gao","doi":"10.3724/SP.J.1016.2013.02132","DOIUrl":"https://doi.org/10.3724/SP.J.1016.2013.02132","url":null,"abstract":"","PeriodicalId":35776,"journal":{"name":"计算机学报","volume":"36 1","pages":"2132-2145"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70042466","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
扫码关注我们
求助内容：
应助结果提醒方式：