发布求助
文献互助 智能选刊 最新文献

Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.最新文献

筛选
英文 中文
Cooperative and group testing in verification of dynamic composite Web services 验证动态组合Web服务的协作和组测试
Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342703
W. Tsai, Yinong Chen, R. Paul, Ning Liao, H. Huang
{"title":"Cooperative and group testing in verification of dynamic composite Web services","authors":"W. Tsai, Yinong Chen, R. Paul, Ning Liao, H. Huang","doi":"10.1109/CMPSAC.2004.1342703","DOIUrl":"https://doi.org/10.1109/CMPSAC.2004.1342703","url":null,"abstract":"Verifying Web services (WS) in a dynamic Service Oriented Architecture (SOA) is challenging because new services can be composed at runtime using existing WS. Furthermore, in a composite service, any component can be dynamically replaced during execution if the component fails. Another challenge is that the testing is time critical because verification must be conducted at runtime and in real time. We compare and contrast traditional software testing and WS testing techniques and propose a WS group testing technique to test composite services. The group testing technique also has the ability to evaluate the test scripts, automatically establish the oracle of the each test script, and identify faulty WS in a failed composite WS.","PeriodicalId":355273,"journal":{"name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128501702","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}
引用次数: 70
Spatial data query support in peer-to-peer systems 点对点系统中的空间数据查询支持
Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342682
Roger Zimmermann, Wei-Shinn Ku, Haojun Wang
{"title":"Spatial data query support in peer-to-peer systems","authors":"Roger Zimmermann, Wei-Shinn Ku, Haojun Wang","doi":"10.1109/CMPSAC.2004.1342682","DOIUrl":"https://doi.org/10.1109/CMPSAC.2004.1342682","url":null,"abstract":"The distributed hash table (DHT) mechanisms have been proposed to manage data in very large, structured peer-to-peer (P2P) systems. DHT algorithms provide efficient exact-match object search capabilities without requiring global indexing and are hence extremely scalable. However, range queries - which are very common with spatial data - cannot be executed efficiently in these systems because the adoption of uniform hash functions to ensure excellent load balancing unfortunately destroys any existing data locality. In this report we propose a novel technique to preserve spatial locality information while also keeping some of the load balancing properties of DHT based systems. We describe our design as an extension of content-addressable networks (CAN) and illustrate the feasibility of supporting spatial range queries.","PeriodicalId":355273,"journal":{"name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127312965","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}
引用次数: 16
Towards autonomic computing middleware via reflection 通过反射实现自主计算中间件
Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342817
Gang Huang, Tiancheng Liu, Hong Mei, Zizhan Zheng, Zhao-Qiong Liu, Gang Fan
{"title":"Towards autonomic computing middleware via reflection","authors":"Gang Huang, Tiancheng Liu, Hong Mei, Zizhan Zheng, Zhao-Qiong Liu, Gang Fan","doi":"10.1109/CMPSAC.2004.1342817","DOIUrl":"https://doi.org/10.1109/CMPSAC.2004.1342817","url":null,"abstract":"Autonomic computing middleware is a promising way to enable middleware based systems to cope with the rapid and continuous changes in the era of Internet. Technically, there have been three fundamental and challenging capabilities to an autonomic computing middleware, including how to monitor, reason and control middleware platform and applications. This position paper presents a reflection-based approach to autonomic computing middleware, which shows the philosophy that autonomic computing should focus on how to reason while reflective computing supports how to monitor and control. In this approach, the states and behaviors of middleware-based systems can be observed and changed through reflective mechanisms embedded in middleware platform at runtime. On the basis of reflection, some autonomic computing facilities could be constructed to reason and decide when and what to change. The approach is demonstrated on a reflective J2EE application server, which can automatically optimize itself in the standard J2EE benchmark testing","PeriodicalId":355273,"journal":{"name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126977608","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}
引用次数: 52
Software effort prediction models using maximum likelihood methods require multivariate normality of the software metrics data sample: can such a sample be made multivariate normal? 使用最大似然方法的软件工作量预测模型需要软件度量数据样本的多变量正态性:这样的样本可以成为多变量正态性吗?
Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342843
Victor K. Y. Chan
{"title":"Software effort prediction models using maximum likelihood methods require multivariate normality of the software metrics data sample: can such a sample be made multivariate normal?","authors":"Victor K. Y. Chan","doi":"10.1109/CMPSAC.2004.1342843","DOIUrl":"https://doi.org/10.1109/CMPSAC.2004.1342843","url":null,"abstract":"Missing data often appear in software metrics data samples used to construct software effort prediction models. So far, the least biased and thus the most strongly recommended family of such models capable of handling missing data are those using maximum likelihood methods. However, the theory of such maximum likelihood methods assumes that the data samples underlying the model construction are multivariate normal. Previous research on such models simply ignored the violation of such an assumption by the empirical data samples. This paper proposes and empirically illustrates a not-so-complicated but effective technique to transform the data sample for the purpose of meeting such an assumption. This technique is empirically proven to work for typical software metrics data samples and the author recommends applying such a technique in any further research on and practical industrial application of software effort prediction models using maximum likelihood methods","PeriodicalId":355273,"journal":{"name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124493103","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
An agent-based framework for testing Web applications 用于测试Web应用程序的基于代理的框架
Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342704
D. Kung
{"title":"An agent-based framework for testing Web applications","authors":"D. Kung","doi":"10.1109/CMPSAC.2004.1342704","DOIUrl":"https://doi.org/10.1109/CMPSAC.2004.1342704","url":null,"abstract":"Software testing in general and Web applications testing in particular are knowledge-driven, labor intensive activities, which are best performed by intelligent, autonomous agents. The proposed framework is based on the Belief-Desire-Intention (BDI) model of rational agents and the Unified Modeling Language (UML). We describe how Web applications testing can be modeled and reasoned using the framework.","PeriodicalId":355273,"journal":{"name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129504641","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}
引用次数: 28
TiViPE - Tino's Visual Programming Environment TiViPE -蒂诺的可视化编程环境
Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342799
T. Lourens
{"title":"TiViPE - Tino's Visual Programming Environment","authors":"T. Lourens","doi":"10.1109/CMPSAC.2004.1342799","DOIUrl":"https://doi.org/10.1109/CMPSAC.2004.1342799","url":null,"abstract":"TiViPE is a component based visual programming environment (VPE) that enables users to build programs by construction of a network of components interactively. A single module (component), represented by a graphical icon, is a computational unit. Multiple icons can be connected to each other to yield a directed graph (a network) that represent a program. TiViPE is, in appearance similar to programs such as AVS, Vee, OpenDX, Khoros, LabVIEW, NeatVision, and ViPEr, but presents some fundamental differences. TiViPE integrates documentation with an existing routine call (that has been programmed in C++, C, Fortran, or Java), and automatically generates C++ code that is compiled to stand-alone program. This program is able to execute the specified routine, provide a graphical icon, or give HTML-formatted documentation about the routine. Hence, within TiViPE there is no textual programming for the user TiViPE strongly re-uses code, which is inherent to visual programming, and automatic code regeneration by compounding a network of modules to a single module, which leads to faster programming. TiViPE supports networking and parallel processing in a natural way, and allows the user to modify an activated network. TiViPE also aims at rapid prototyping which demands user friendliness, programming by existing modules for basic users, and focuses on the documentation of a module. TiViPE has been used in the field of computer vision, robotics, and computational neuroscience","PeriodicalId":355273,"journal":{"name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134560595","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}
引用次数: 45
Modular monadic program slicing 模块化单进程序切片
Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342807
Yingzhou Zhang, Baowen Xu, Liang Shi, Bixin Li, Hongji Yang
{"title":"Modular monadic program slicing","authors":"Yingzhou Zhang, Baowen Xu, Liang Shi, Bixin Li, Hongji Yang","doi":"10.1109/CMPSAC.2004.1342807","DOIUrl":"https://doi.org/10.1109/CMPSAC.2004.1342807","url":null,"abstract":"Program slicing is widely used in applications such as program comprehension, software testing, debugging, measurement, and reengineering. This paper proposes a new approach for program slicing, called modular monadic slicing, basing on modular monadic semantics of the program analysed. We abstract the computation of program slicing as a language-independence entity: slice monad transformer. On the basis of this, we present and illustrate modular monadic dynamic and static slice algorithms in detail. We conclude that modular monadic slicing has excellent flexibility and reusability properties comparing with the existing program slicing algorithms. It computes program slices on abstract syntax directly without intermediate structures such as dependence graphs","PeriodicalId":355273,"journal":{"name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130357724","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}
引用次数: 12
JART: grammar-based approach to refactoring JART:基于语法的重构方法
Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342886
T. Kosar, M. Mernik, V. Zumer
{"title":"JART: grammar-based approach to refactoring","authors":"T. Kosar, M. Mernik, V. Zumer","doi":"10.1109/CMPSAC.2004.1342886","DOIUrl":"https://doi.org/10.1109/CMPSAC.2004.1342886","url":null,"abstract":"Refactoring is a way of improving software artifacts after they have been produced to fulfill users' needs. It is a semi-formalized approach that makes software easier to read and modify. A notation for refactorings, systematic search and replace is described. It is shown, that grammar-based notation used in JART (Just Another Refactoring Tool) is much more flexible and readable than the existing ones.","PeriodicalId":355273,"journal":{"name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123707795","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}
引用次数: 2
A uniform meta-model for mediating formal electronic conferences 调解正式电子会议的统一元模型
Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342861
Jia Zhang, Carl K. Chang, J. Voas
{"title":"A uniform meta-model for mediating formal electronic conferences","authors":"Jia Zhang, Carl K. Chang, J. Voas","doi":"10.1109/CMPSAC.2004.1342861","DOIUrl":"https://doi.org/10.1109/CMPSAC.2004.1342861","url":null,"abstract":"Formal electronic conferences (FEC) refers to online meetings for a geographically distributed group of people that are regulated by a rigorous set of rules. FEC technologies enable organizations to replace face-to-face business meetings with trustworthy virtual online meetings. In This work we present a Robert's rules of order (RRO)-compatible, motion-driven discussion-thread-centered meta-model, which is capable of uniformly modeling formal electronic conference activities. A tailored computerized mechanism, the collaboration description language (CODL) and its runtime environment, is also developed to formalize the model. The CODL virtual machine adds a layer of encapsulation that decouples FEC applications from underlying platforms: therefore, the development of FEC applications will become more reliable, efficient, and secure. Our preliminary experience with this meta-model is also reported.","PeriodicalId":355273,"journal":{"name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125239855","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}
引用次数: 9
PFGASAT - a genetic SAT solver combining partitioning and fuzzy strategies PFGASAT -一种结合划分和模糊策略的遗传SAT求解器
Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342813
Jianzhou Zhao, Jinian Bian, Weimin Wu
{"title":"PFGASAT - a genetic SAT solver combining partitioning and fuzzy strategies","authors":"Jianzhou Zhao, Jinian Bian, Weimin Wu","doi":"10.1109/CMPSAC.2004.1342813","DOIUrl":"https://doi.org/10.1109/CMPSAC.2004.1342813","url":null,"abstract":"This paper is concerned with Boolean satisfiability (SAT) problem. Many researchers are devoted into seeking for new ideas as well as developing more efficient SAT solvers which will improve the development of EDA (electronic design automation). In this paper, we try to solve the SAT problem by fuzzy genetic algorithm with partitioning-based initial process, namely PFGASAT. Some heuristic mechanisms have been introduced which make the algorithm more intellective. Primary experiments show that PFGASAT can solve SAT problems with more than 15 k variables while behaves rather stably and robustly","PeriodicalId":355273,"journal":{"name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126845900","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
首页 上一页
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学术官方微信