Ontology has played more and more important roles in the computer science fields. However, there is no unified and effective method for ontology modeling until now. This paper presents a novel method for domain ontology modeling. Firstly, all kinds of ontology models are translated into ontology model described in Description Logics (DLs). Subsequently, erroneous information is fed back through reasoning on ontology in DLs. Finally, developers can amend ontology according to the feedback information. This process is repeated until the inconsistency of ontology is eliminated. Consequently, the above-mentioned methodology improves the accuracy and efficiency of domain ontology modeling. A concrete instance evidently demonstrates the effectiveness of research.
{"title":"A Self-Feedback Methodology of Domain Ontology Modeling","authors":"Ming Li, Fengkui Zang","doi":"10.1109/WCSE.2009.178","DOIUrl":"https://doi.org/10.1109/WCSE.2009.178","url":null,"abstract":"Ontology has played more and more important roles in the computer science fields. However, there is no unified and effective method for ontology modeling until now. This paper presents a novel method for domain ontology modeling. Firstly, all kinds of ontology models are translated into ontology model described in Description Logics (DLs). Subsequently, erroneous information is fed back through reasoning on ontology in DLs. Finally, developers can amend ontology according to the feedback information. This process is repeated until the inconsistency of ontology is eliminated. Consequently, the above-mentioned methodology improves the accuracy and efficiency of domain ontology modeling. A concrete instance evidently demonstrates the effectiveness of research.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123908624","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}
According to the characteristics of incompleteness, contradictory and extensiveness of the enterprise competition information, rough set theory is used to guide the crawling of web spider, the gathering efficiency of enterprise completion collection is improved by similarity class expansion and attributes reduction based on discrimination. The achievement of this research has already been applied to the practical construction of information management center of an enterprise so as to offer strategic basis for operation decision of the enterprise.
{"title":"Research of Enterprise Competition Information Intelligent Collecting System Based on Rough Set","authors":"Yang Kefei, Pan Yu, Huliang Bin, Pan Fang","doi":"10.1109/WCSE.2009.348","DOIUrl":"https://doi.org/10.1109/WCSE.2009.348","url":null,"abstract":"According to the characteristics of incompleteness, contradictory and extensiveness of the enterprise competition information, rough set theory is used to guide the crawling of web spider, the gathering efficiency of enterprise completion collection is improved by similarity class expansion and attributes reduction based on discrimination. The achievement of this research has already been applied to the practical construction of information management center of an enterprise so as to offer strategic basis for operation decision of the enterprise.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123945647","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}
In earthquake relief, the broad effects of humanitarian relief include delivery medical material to victims. Scientific relief need quick response of logistics supply chain, which include tracking situational urgency at various locations such as lack of food and medical supplies. The paper introduced the rapid adoption of NC-ERP in Sichuan post-earthquake which was donated by UFIDA. With the rapid implementation methodology and emergency response management, Sichuan Ministry of Health had adopted the donated ERP suite named NC in 10 days. The key success factors of ERP in emergence response and under high risk are support of CEO, construction of project team and rapid involvement of technical consultants which are helpful to solve issues inherent in disaster response collaboration.
{"title":"NC-ERP Rapid Implementation in Sichuan Post-earthquake for Relief Material Management","authors":"Wang Huifen, Cui. Lei","doi":"10.1109/WCSE.2009.84","DOIUrl":"https://doi.org/10.1109/WCSE.2009.84","url":null,"abstract":"In earthquake relief, the broad effects of humanitarian relief include delivery medical material to victims. Scientific relief need quick response of logistics supply chain, which include tracking situational urgency at various locations such as lack of food and medical supplies. The paper introduced the rapid adoption of NC-ERP in Sichuan post-earthquake which was donated by UFIDA. With the rapid implementation methodology and emergency response management, Sichuan Ministry of Health had adopted the donated ERP suite named NC in 10 days. The key success factors of ERP in emergence response and under high risk are support of CEO, construction of project team and rapid involvement of technical consultants which are helpful to solve issues inherent in disaster response collaboration.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123961945","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}
Trichoderma reesei CBS368, a strong endoglucanase 2 (EG 2) producing strain, was isolated in our laboratory. The DNA fragment encoding the EG 2 was cloned in pMD18-T and sequenced. In order to achieve its expression, the vector pET28a (+) and pET32a (+) were used as expression vector, and the recombinant EG 2 was successfully expressed in E. coli BL21 (DE3). Bioinformatic analysis was conducted using some online or offline services.
{"title":"Cloning and Bioinformatics Analysis of an Endoglucanase 2 from Trichoderma reesei","authors":"Yanling Yang, Lihua Liu, Miao Diao, Zhiwei Lin, Wunian Guo, Shihua Wang","doi":"10.1109/WCSE.2009.175","DOIUrl":"https://doi.org/10.1109/WCSE.2009.175","url":null,"abstract":"Trichoderma reesei CBS368, a strong endoglucanase 2 (EG 2) producing strain, was isolated in our laboratory. The DNA fragment encoding the EG 2 was cloned in pMD18-T and sequenced. In order to achieve its expression, the vector pET28a (+) and pET32a (+) were used as expression vector, and the recombinant EG 2 was successfully expressed in E. coli BL21 (DE3). Bioinformatic analysis was conducted using some online or offline services.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"332 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124688382","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}
Bacterial Foraging Optimization (BFO) is a novel optimization algorithm based on the social foraging behavior of E. coli bacteria. This paper presents a variation on the original BFO algorithm, namely the Cooperative Bacterial Foraging Optimization (CBFO), which significantly improve the original BFO in solving complex optimization problems. This significant improvement is achieved by applying two cooperative approaches to the original BFO, namely the serial heterogeneous cooperation on the implicit space decomposition level and the serial heterogeneous cooperation on the hybrid space decomposition level.
{"title":"The Optimization of Cooperative Bacterial Foraging","authors":"Y. Shao, Hanning Chen","doi":"10.1109/WCSE.2009.195","DOIUrl":"https://doi.org/10.1109/WCSE.2009.195","url":null,"abstract":"Bacterial Foraging Optimization (BFO) is a novel optimization algorithm based on the social foraging behavior of E. coli bacteria. This paper presents a variation on the original BFO algorithm, namely the Cooperative Bacterial Foraging Optimization (CBFO), which significantly improve the original BFO in solving complex optimization problems. This significant improvement is achieved by applying two cooperative approaches to the original BFO, namely the serial heterogeneous cooperation on the implicit space decomposition level and the serial heterogeneous cooperation on the hybrid space decomposition level.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124712935","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}
Service composition technology promises a new solution to an age-old problem: how to implement complex, large scale, cross-enterprise business application. However, we must ensure the compatibility between component services in composite service. Current research works in this field only concern semantics compatibility of service interface, yet ignoring the compatibility of service behavior. Therefore, this paper proposes a model of service behavior based on Petri-nets with weight. Based on the novel model, a method is proposed to verify and compute service behavior compatibility.
{"title":"A Model of Service Behavior Based on Petri Nets with Weights","authors":"Yanbin Peng, Zhijun Zheng, Jian Xiang, Ji Gao, Jie-Qing Ai, Zhenyu Lu, Xueqin Jiang","doi":"10.1109/WCSE.2009.421","DOIUrl":"https://doi.org/10.1109/WCSE.2009.421","url":null,"abstract":"Service composition technology promises a new solution to an age-old problem: how to implement complex, large scale, cross-enterprise business application. However, we must ensure the compatibility between component services in composite service. Current research works in this field only concern semantics compatibility of service interface, yet ignoring the compatibility of service behavior. Therefore, this paper proposes a model of service behavior based on Petri-nets with weight. Based on the novel model, a method is proposed to verify and compute service behavior compatibility.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124854820","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}
During the conceptual phase of a building design, major design space decisions that have the greatest influence on build ability of a project are taken. Quality function deployment (QFD) is an integrated decision-making methodology that can assure and improve the alignment of elements of design and construction processes with the requirements customers. Taking the existence of uncertainty in the early design into account, we present a fuzzy comprehensive evaluation-based approach to quantify design space, and using degree of similarity (or measure of similarity) and principle of choosing nearest (or principle of selecting near) to choose the best design from the alternatives at the early phase of design.
{"title":"The Application of Fuzzy Comprehensive Evaluation to Quantify Design Space","authors":"Yuping She","doi":"10.1109/WCSE.2009.48","DOIUrl":"https://doi.org/10.1109/WCSE.2009.48","url":null,"abstract":"During the conceptual phase of a building design, major design space decisions that have the greatest influence on build ability of a project are taken. Quality function deployment (QFD) is an integrated decision-making methodology that can assure and improve the alignment of elements of design and construction processes with the requirements customers. Taking the existence of uncertainty in the early design into account, we present a fuzzy comprehensive evaluation-based approach to quantify design space, and using degree of similarity (or measure of similarity) and principle of choosing nearest (or principle of selecting near) to choose the best design from the alternatives at the early phase of design.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128722723","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}
Path-oriented testing is an important aspect of software testing. A challenging problem with path-oriented test data generation is the existence of infeasible paths. Timely detecting these infeasible paths can not only save test sources but also improve test efficiency. It is an effective method to detect infeasible paths by branch correlations. In this paper, we propose a method to automatically determine branch correlations in software testing. Firstly, we give a theorem to determine the true-true correlation, true-false correlation, false-true correlation, and false-false correlation based on the probabilities of the conditional distribution corresponding to different branches’ outcome (i.e. true or false). We then estimate these values of the probabilities by the maximum likelihood estimation. Finally, we apply the proposed method to determine the branch correlations of two typical programs, and the results show that the proposed method can accurately determine the branch correlations of different conditional statements. Our achievement provides an effective and automatic method to detect infeasible paths, which has great significance in improving the efficiency of software testing.
{"title":"Automatic Determination of Branch Correlations in Software Testing","authors":"D. Gong, Xiangjuan Yao, Min Xia","doi":"10.1109/WCSE.2009.328","DOIUrl":"https://doi.org/10.1109/WCSE.2009.328","url":null,"abstract":"Path-oriented testing is an important aspect of software testing. A challenging problem with path-oriented test data generation is the existence of infeasible paths. Timely detecting these infeasible paths can not only save test sources but also improve test efficiency. It is an effective method to detect infeasible paths by branch correlations. In this paper, we propose a method to automatically determine branch correlations in software testing. Firstly, we give a theorem to determine the true-true correlation, true-false correlation, false-true correlation, and false-false correlation based on the probabilities of the conditional distribution corresponding to different branches’ outcome (i.e. true or false). We then estimate these values of the probabilities by the maximum likelihood estimation. Finally, we apply the proposed method to determine the branch correlations of two typical programs, and the results show that the proposed method can accurately determine the branch correlations of different conditional statements. Our achievement provides an effective and automatic method to detect infeasible paths, which has great significance in improving the efficiency of software testing.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132832929","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}
Buffer overflow exploitation is a major threat to software security. To reduce the threat, Visual studio C/C++compiler enables to randomize the addresses of the compiled program in initialization time, and to embed security stack guards by the compiled program in run time. The present paper upgrades the compiler by increasing the compiled program's capabilities in the following aspects: (1) protects a frame pointer from callee's tampering with at no additional cost; (2) defeats the attack which tampers 1-2 bytes of a protected region at a very low cost; (3) checks the indirect function call against the prologue pattern so as to reduce the probability of software crash in case of being attacked. Our experiments demonstrate the improvement on Microsoft Visual Studio in generating secure and robust software.
缓冲区溢出利用是软件安全的主要威胁。为了减少这种威胁，Visual studio C/ c++编译器支持在初始化时对被编译程序的地址进行随机化，并在运行时由被编译程序嵌入安全堆栈保护。本文通过增加编译程序在以下方面的能力来升级编译器:(1)在不增加成本的情况下保护帧指针不被调用者篡改;(2)以极低的代价挫败篡改受保护区域1-2字节的攻击;(3)根据序段模式对间接函数调用进行检查，以减少软件被攻击时崩溃的概率。我们的实验证明了Microsoft Visual Studio在生成安全、健壮的软件方面的改进。
{"title":"Enhancing Security Check in Visual Studio C/C++ Compiler","authors":"Yongdong Wu","doi":"10.1109/WCSE.2009.44","DOIUrl":"https://doi.org/10.1109/WCSE.2009.44","url":null,"abstract":"Buffer overflow exploitation is a major threat to software security. To reduce the threat, Visual studio C/C++compiler enables to randomize the addresses of the compiled program in initialization time, and to embed security stack guards by the compiled program in run time. The present paper upgrades the compiler by increasing the compiled program's capabilities in the following aspects: (1) protects a frame pointer from callee's tampering with at no additional cost; (2) defeats the attack which tampers 1-2 bytes of a protected region at a very low cost; (3) checks the indirect function call against the prologue pattern so as to reduce the probability of software crash in case of being attacked. Our experiments demonstrate the improvement on Microsoft Visual Studio in generating secure and robust software.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"24 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133002856","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}
This paper presents a human action recognition system based on motion capture features and support vector machine (SVM). We use 43 optical markers distributing on body and extremities to track the movement of human actions. In our system 21 different types of action are recognized. Applying SVM for the recognition of human action the overall prediction accuracy achieves to 84.1% when using the three-fold cross validation on the training set. Another purpose of this study is to find out which skeleton points are important for human action recognition. The experimental results show that the skeleton points of head, hands and feet are the most important features for recognition of human actions.
{"title":"Recognition of Human Actions Using Motion Capture Data and Support Vector Machine","authors":"Jung-Ying Wang, Hahn-Ming Lee","doi":"10.1109/WCSE.2009.354","DOIUrl":"https://doi.org/10.1109/WCSE.2009.354","url":null,"abstract":"This paper presents a human action recognition system based on motion capture features and support vector machine (SVM). We use 43 optical markers distributing on body and extremities to track the movement of human actions. In our system 21 different types of action are recognized. Applying SVM for the recognition of human action the overall prediction accuracy achieves to 84.1% when using the three-fold cross validation on the training set. Another purpose of this study is to find out which skeleton points are important for human action recognition. The experimental results show that the skeleton points of head, hands and feet are the most important features for recognition of human actions.","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127871005","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
扫码关注我们
求助内容：
应助结果提醒方式：