2011 IEEE 35th Annual Computer Software and Applications Conference最新文献

筛选
英文 中文
Precise Propagation of Fault-Failure Correlations in Program Flow Graphs 程序流程图中故障-失效关联的精确传播
2011 IEEE 35th Annual Computer Software and Applications Conference Pub Date : 2011-07-18 DOI: 10.1109/COMPSAC.2011.16
Zhenyu Zhang, W. Chan, T. Tse, Bo Jiang
{"title":"Precise Propagation of Fault-Failure Correlations in Program Flow Graphs","authors":"Zhenyu Zhang, W. Chan, T. Tse, Bo Jiang","doi":"10.1109/COMPSAC.2011.16","DOIUrl":"https://doi.org/10.1109/COMPSAC.2011.16","url":null,"abstract":"Statistical fault localization techniques find suspicious faulty program entities in programs by comparing passed and failed executions. Existing studies show that such techniques can be promising in locating program faults. However, coincidental correctness and execution crashes may make program entities indistinguishable in the execution spectra under study, or cause inaccurate counting, thus severely affecting the precision of existing fault localization techniques. In this paper, we propose a Block Rank technique, which calculates, contrasts, and propagates the mean edge profiles between passed and failed executions to alleviate the impact of coincidental correctness. To address the issue of execution crashes, Block Rank identifies suspicious basic blocks by modeling how each basic block contributes to failures by apportioning their fault relevance to surrounding basic blocks in terms of the rate of successful transition observed from passed and failed executions. Block Rank is empirically shown to be more effective than nine representative techniques on four real-life medium-sized programs.","PeriodicalId":259472,"journal":{"name":"2011 IEEE 35th Annual Computer Software and Applications Conference","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115598521","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
A Norm-Based Approach towards Requirements Patterns 基于规范的需求模式方法
2011 IEEE 35th Annual Computer Software and Applications Conference Pub Date : 2011-07-18 DOI: 10.1109/COMPSAC.2011.82
Shokoofeh Ketabchi, Navid Karimi Sani, Kecheng Liu
{"title":"A Norm-Based Approach towards Requirements Patterns","authors":"Shokoofeh Ketabchi, Navid Karimi Sani, Kecheng Liu","doi":"10.1109/COMPSAC.2011.82","DOIUrl":"https://doi.org/10.1109/COMPSAC.2011.82","url":null,"abstract":"Requirements engineering is considered to be one of the crucial and at the same time difficult tasks during development process. It is considered to be one of the key factors causing software projects to fail since weak requirements engineering affects other phases and would be costly to correct later. Requirements engineering, to a large extent, is dependent on analysts' experience. The process of requirements engineering often starts from scratch and depends on very much the analysts' experience and educations. Using requirements pattern can help to overcome this. The patterns can be built and put in a repository. In a case of solving a problem, appropriate patterns can be retrieved and used for providing a solution to it. Therefore, knowledge will be reused and there is no need for starting from scratch. This paper is devoted to introducing patterns in requirements engineering process. Semiotics theory is used as the fundamental for creating and using patterns. Finally, a case study illustrates the usage of methods and approaches described in this paper.","PeriodicalId":259472,"journal":{"name":"2011 IEEE 35th Annual Computer Software and Applications Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117277577","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}
引用次数: 8
Distributed Java-Based Content Protection 分布式基于java的内容保护
2011 IEEE 35th Annual Computer Software and Applications Conference Pub Date : 2011-07-18 DOI: 10.1109/COMPSAC.2011.62
Smitha Sundareswaran, A. Squicciarini, R. Sundareswaran
{"title":"Distributed Java-Based Content Protection","authors":"Smitha Sundareswaran, A. Squicciarini, R. Sundareswaran","doi":"10.1109/COMPSAC.2011.62","DOIUrl":"https://doi.org/10.1109/COMPSAC.2011.62","url":null,"abstract":"The increasingly sensitive nature of data shared over the Web calls for a new approach to cross-domain content protection. Towards addressing this need, in this paper we introduce a novel Java-based architecture for distributed content protection Java - based Distributed Content Protection (JUICE). JUiCE takes a policy-driven approach that strongly couples data and content protection policies. JUiCE constitutes an effective and practical solution for content protection for a number of reasons. First, both the CPPs and the protection mechanism travel with the content, which is stored in its original form. Second, users do not need to rely on any dedicated management system to specify and apply the CPPs. Further, CPPs do not require any additional cryptographic setup such as passwords or keys to be shared. Through evaluation, we show that our architecture is scalable while being robust against a range of attacks.","PeriodicalId":259472,"journal":{"name":"2011 IEEE 35th Annual Computer Software and Applications Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125800308","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
Spoken Interaction within the Computed World: Evaluation of a Multitasking Adaptive Spoken Dialogue System 计算机世界中的口语交互:多任务自适应口语对话系统的评价
2011 IEEE 35th Annual Computer Software and Applications Conference Pub Date : 2011-07-18 DOI: 10.1109/COMPSAC.2011.25
Tobias Heinroth, Dan Denich
{"title":"Spoken Interaction within the Computed World: Evaluation of a Multitasking Adaptive Spoken Dialogue System","authors":"Tobias Heinroth, Dan Denich","doi":"10.1109/COMPSAC.2011.25","DOIUrl":"https://doi.org/10.1109/COMPSAC.2011.25","url":null,"abstract":"Within the framework of the EU-funded Project ATRACO we have implemented the adaptive Spoken Dialogue Manager Owl Speak. Its most important feature is the ability to pause, resume, and to switch between multiple interactive tasks. These features make the deployed Spoken Dialogue System (SDS) capable of multitasking. In this paper we investigate the effects of multitasking on users within the context of spoken dialogues. Especially within Intelligent Environments such as ATRACO, it is necessary to modify the status of the SDS depending on the actual context and of the requirements the user may have. We have conducted an evaluation to investigate how users cope with the multitasking capabilities of an SDS. The results are two-fold: on the one hand, users who were engaged in multitasking dialogues were more inclined to interact with the SDS. On the other hand, the subjects who serially received one task after another were able to retain more facts in mind than the subjects who used the dynamic multitasking approach. By taking these results into account we conclude the paper with some future work.","PeriodicalId":259472,"journal":{"name":"2011 IEEE 35th Annual Computer Software and Applications Conference","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116012088","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}
引用次数: 17
L1 - An Intermediate Language for Mixed-Protocol Secure Computation L1 -混合协议安全计算的中间语言
2011 IEEE 35th Annual Computer Software and Applications Conference Pub Date : 2011-07-18 DOI: 10.1109/COMPSAC.2011.46
Axel Schröpfer, F. Kerschbaum, G. Müller
{"title":"L1 - An Intermediate Language for Mixed-Protocol Secure Computation","authors":"Axel Schröpfer, F. Kerschbaum, G. Müller","doi":"10.1109/COMPSAC.2011.46","DOIUrl":"https://doi.org/10.1109/COMPSAC.2011.46","url":null,"abstract":"Secure Computation (SC) enables secure distributed computation of arbitrary functions of private inputs. It has many useful applications, e.g. benchmarking or auctions. Several general protocols for SC have been proposed and recently been implemented in a number of compilers and frameworks. These compilers or frameworks implement one general SC protocol and then require the programmer to implement the function he wants the protocol to compute. Performance remains a challenge for this approach and it has been realized early on that special protocols for important problems can deliver superior performance. In this paper we propose a new intermediate language (L1) for optimizing SC compilers which enables efficient implementation of special protocols potentially mixing several general SC protocols. We show by three case studies -- one for computation of the median, one for weighted average, one for division -- that special protocols and mixed-protocol implementations in our language L1 can lead to superior performance. Moreover, we show that only a combined view on algorithm emph{and} cryptographic protocol can discover SCs with best run-time performance.","PeriodicalId":259472,"journal":{"name":"2011 IEEE 35th Annual Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129730803","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}
引用次数: 55
Requirements Recovery by Matching Domain Ontology and Program Ontology 匹配领域本体和程序本体的需求恢复
2011 IEEE 35th Annual Computer Software and Applications Conference Pub Date : 2011-07-18 DOI: 10.1109/COMPSAC.2011.84
Feng Chen, Hong Zhou, Hongji Yang, Martin P. Ward, W. Chu
{"title":"Requirements Recovery by Matching Domain Ontology and Program Ontology","authors":"Feng Chen, Hong Zhou, Hongji Yang, Martin P. Ward, W. Chu","doi":"10.1109/COMPSAC.2011.84","DOIUrl":"https://doi.org/10.1109/COMPSAC.2011.84","url":null,"abstract":"Users and systems requirements are fundamental for software development and maintenance. However, for most of existing systems, you may only find design documents without requirement specification. This paper presents an ontology-based reengineering approach to recovering requirements from existing systems. The proposed approach consists of three main parts: ontology development, ontology mapping and derivation of the requirements. Domain ontology is used to model domain specific requirements and program ontology is used to present system structure and behaviour. The algorithm of ontology mapping is developed to match domain ontology and program ontology for requirement recovery. A case study of Point of Sale Terminal (POST) system is used to illustrate the approach. Conclusions are drawn and further research directions are advocated.","PeriodicalId":259472,"journal":{"name":"2011 IEEE 35th Annual Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129873488","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}
引用次数: 4
CALIGRAPHI - Creation of Adaptive Dialogues Using a Graphical Interface 使用图形界面创建自适应对话
2011 IEEE 35th Annual Computer Software and Applications Conference Pub Date : 2011-07-18 DOI: 10.1109/COMPSAC.2011.58
G. Bertrand, F. Nothdurft, F. Honold, Felix Schüssel
{"title":"CALIGRAPHI - Creation of Adaptive Dialogues Using a Graphical Interface","authors":"G. Bertrand, F. Nothdurft, F. Honold, Felix Schüssel","doi":"10.1109/COMPSAC.2011.58","DOIUrl":"https://doi.org/10.1109/COMPSAC.2011.58","url":null,"abstract":"In the research area of spoken language dialogue systems there are many ways for modeling dialogues. The dialog model's particular structure depends on the algorithm used to interpret it. In most cases a dialogue's model is quite difficult to understand and to create. We present a novel technique for modeling dialogues based on ready to use open source tools in an easy and understandable way. Making use of our approach a dialogue designer (unfamiliar with the internals of the dialogue manager) can simply develop even complex and adaptive dialogues. The dialogues are then ready to be interpreted by the dialogue management in order to integrate them seamlessly into the spoken language dialogue system.","PeriodicalId":259472,"journal":{"name":"2011 IEEE 35th Annual Computer Software and Applications Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130499698","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}
引用次数: 8
Adaptive Bandwidth-Based Thread Group Scheduler for Compositional Real-Time Middleware Architectures 面向组合实时中间件体系结构的基于带宽的自适应线程组调度器
2011 IEEE 35th Annual Computer Software and Applications Conference Pub Date : 2011-07-18 DOI: 10.1109/COMPSAC.2011.29
J. Kwon, S. Hailes
{"title":"Adaptive Bandwidth-Based Thread Group Scheduler for Compositional Real-Time Middleware Architectures","authors":"J. Kwon, S. Hailes","doi":"10.1109/COMPSAC.2011.29","DOIUrl":"https://doi.org/10.1109/COMPSAC.2011.29","url":null,"abstract":"In this paper, we present an adaptive, bandwidth-based group scheduling mechanism that supports reconfiguration of components in compositional software architectures. The middleware-level scheduler allocates resources accurately for real-time threads while non-real-time threads are dealt with in a manner that makes the most of the remaining bandwidth within a thread group. We have designed and implemented the thread-group scheduler in the context of a middleware for embedded real-time control systems, where mixed-criticality tasks may co-exist on the same platform and temporal firewall is of immense value. Yet, it is often the case that better resource-management, flexibility and efficiency are rewarded a great deal due to the high cost of development and the bespoke nature of control systems. With the increasing complexity of large software systems, it is often difficult to reason about how architectural or compositional artefacts are to be linked with non-functional attributes, especially when it comes to scheduling of threads in reconfigurable component-based systems. In other words, there is no clean-cut binding between components and tasks or threads in terms of resource allocation and quality of service provision. For instance, when a component with a varying number of threads inside is to be replaced, it becomes challenging to allocate resources fairly and accurately due to the changing requirements (or number of threads) in the new component in terms of the required CPU time before and after the reconfiguration. The recent temporal firewall approach in the literature works well on a per-thread basis resource allocation, but when the knowledge of threads and the timing requirements are unknown at pre-runtime due to the possible replacement of components with a varying number of subordinate threads, it is impossible to allocate resources effectively. This work builds on the temporal firewall approach to cater for compositional software systems.","PeriodicalId":259472,"journal":{"name":"2011 IEEE 35th Annual Computer Software and Applications Conference","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121512311","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
Multi-node Network Based Control and Data Acquisition System for a VHF Radar Depth Sounder 基于多节点网络的甚高频雷达测深仪控制与数据采集系统
2011 IEEE 35th Annual Computer Software and Applications Conference Pub Date : 2011-07-18 DOI: 10.1109/COMPSAC.2011.124
Chris Prokopiak, C. Leuschen, F. Rodríguez‐Morales, John R. Ledford, W. Blake, A. Hoch, Hilary Barbour
{"title":"Multi-node Network Based Control and Data Acquisition System for a VHF Radar Depth Sounder","authors":"Chris Prokopiak, C. Leuschen, F. Rodríguez‐Morales, John R. Ledford, W. Blake, A. Hoch, Hilary Barbour","doi":"10.1109/COMPSAC.2011.124","DOIUrl":"https://doi.org/10.1109/COMPSAC.2011.124","url":null,"abstract":"The Center for Remote Sensing of Ice Sheets (CReSIS) was formed to investigate and generate a greater understanding of ice sheets and their relationship to the global climate, specifically sea-level rise. To provide the detailed ice thickness data required for more accurate ice sheet models, CReSIS determined a new airborne radar system was required. A few requirements for the radar sensor include the ability to be installed on a number of airborne platforms, capable of collecting simultaneous data from up to 16 independent receive channels, and providing real-time display of processed data for quality analysis.","PeriodicalId":259472,"journal":{"name":"2011 IEEE 35th Annual Computer Software and Applications Conference","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131722108","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
Semantics Based Cohesion and Coupling Metrics for Evaluating Understandability of State Diagrams 基于语义的状态图可理解性评价的内聚和耦合度量
2011 IEEE 35th Annual Computer Software and Applications Conference Pub Date : 2011-07-18 DOI: 10.1109/COMPSAC.2011.57
J. Bae, Y. Jeong, H. Chae, Carl K. Chang
{"title":"Semantics Based Cohesion and Coupling Metrics for Evaluating Understandability of State Diagrams","authors":"J. Bae, Y. Jeong, H. Chae, Carl K. Chang","doi":"10.1109/COMPSAC.2011.57","DOIUrl":"https://doi.org/10.1109/COMPSAC.2011.57","url":null,"abstract":"State diagrams commonly used for describing dynamic behavior of systems or objects can have various forms that specify the same behavior. Highly understandable state diagrams are important for efficient and clear communication between developers. Measurement of understandability of state diagrams is the first step to obtain highly understandable ones. Unfortunately, there is little research on metrics for evaluating state diagram's understandability. In this paper, we propose cohesion and coupling metrics, named Average Cohesiveness Of States (ACOS) and Average number of Similar States Of States (ASSOS), to evaluate understandability of state diagrams. To validate effectiveness of the metrics, we compared understandability of three state diagrams of different representations but the same behavior for two systems. The experiments showed that ACOS and ASSOS can capture understandability more correctly than existing structure-based metrics.","PeriodicalId":259472,"journal":{"name":"2011 IEEE 35th Annual Computer Software and Applications Conference","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130700676","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}
引用次数: 6
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书