计算机学报最新文献

筛选
英文 中文
Scene Parsing Based on A Two-Level Conditional Random Field: Scene Parsing Based on A Two-Level Conditional Random Field 基于两级条件随机场的场景解析:基于两级条件随机场的场景解析
计算机学报 Pub Date : 2014-03-19 DOI: 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}
引用次数: 1
Enhancing Illumination Computation of Lightcuts with Spatial Coherence: Enhancing Illumination Computation of Lightcuts with Spatial Coherence 增强具有空间相干性的光照计算:增强具有空间相干性的光照计算
计算机学报 Pub Date : 2014-03-19 DOI: 10.3724/SP.J.1016.2013.02364
Guang-Wei Wang, Guofu Xie, Wencheng Wang
{"title":"Enhancing Illumination Computation of Lightcuts with Spatial Coherence: Enhancing Illumination Computation of Lightcuts with Spatial Coherence","authors":"Guang-Wei Wang, Guofu Xie, Wencheng Wang","doi":"10.3724/SP.J.1016.2013.02364","DOIUrl":"https://doi.org/10.3724/SP.J.1016.2013.02364","url":null,"abstract":"","PeriodicalId":35776,"journal":{"name":"计算机学报","volume":"36 1","pages":"2364-2370"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70042386","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}
引用次数: 0
The Evaluation Method towards the Application Adaptability of Internet Architecture: The Evaluation Method towards the Application Adaptability of Internet Architecture 互联网体系结构应用适应性评价方法:互联网体系结构应用适应性评价方法
计算机学报 Pub Date : 2014-03-19 DOI: 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}
引用次数: 3
DAG Reliability Model and Fault-Tolerant Algorithm for Heterogeneous Distributed Systems 异构分布式系统的DAG可靠性模型及容错算法
计算机学报 Pub Date : 2014-03-19 DOI: 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}
引用次数: 3
NodeRank:An Efficient Algorithm for Hardware/Software Partitioning NodeRank:一种高效的硬件/软件分区算法
计算机学报 Pub Date : 2014-03-19 DOI: 10.3724/SP.J.1016.2013.02033
Chen Zhi, W. Jigang, Song Guozhi, Chen Jinliang
{"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}
引用次数: 7
A Software Fault Localization Technique Based on Program Mutations 基于程序突变的软件故障定位技术
计算机学报 Pub Date : 2014-03-19 DOI: 10.3724/SP.J.1016.2013.02236
T. He, Xinming Wang, Xiaocong Zhou, Wen-jun Li, Zhenyu Zhang, S. Cheung
{"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}
引用次数: 0
A Testing Approach for Web Services Security Based on Security Rules Mutation: A Testing Approach for Web Services Security Based on Security Rules Mutation 基于安全规则突变的Web服务安全测试方法:基于安全规则突变的Web服务安全测试方法
计算机学报 Pub Date : 2014-03-19 DOI: 10.3724/SP.J.1016.2013.01967
Jinfu Chen, Qing Li, Chengying Mao, Yongzhao Zhan, Rubing Huang, Jiamei Chen
{"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}
引用次数: 0
Mining Top-k Maximal Cliques from Large Uncertain Graphs: Mining Top-k Maximal Cliques from Large Uncertain Graphs 从大型不确定图中挖掘Top-k最大团:从大型不确定图中挖掘Top-k最大团
计算机学报 Pub Date : 2014-03-19 DOI: 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}
引用次数: 5
An Efficient Top-k Dominating Algorithm on Massive Data Title: An Efficient Top-k Dominating Algorithm on Massive Data Title 海量数据标题的高效Top-k支配算法
计算机学报 Pub Date : 2014-03-19 DOI: 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}
引用次数: 1
Automatically Inserting Log System for Driver Configuration: Automatically Inserting Log System for Driver Configuration 自动插入日志系统为驱动配置:自动插入日志系统为驱动配置
计算机学报 Pub Date : 2014-03-19 DOI: 10.3724/SP.J.1016.2013.01982
Hu-Qiu Liu, Chao Ma, Jia-Ju Bai
{"title":"Automatically Inserting Log System for Driver Configuration: Automatically Inserting Log System for Driver Configuration","authors":"Hu-Qiu Liu, Chao Ma, Jia-Ju Bai","doi":"10.3724/SP.J.1016.2013.01982","DOIUrl":"https://doi.org/10.3724/SP.J.1016.2013.01982","url":null,"abstract":"","PeriodicalId":35776,"journal":{"name":"计算机学报","volume":"36 1","pages":"1982-1992"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70041993","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}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信