The software industry and most multinational IT companies are starving for software engineers who can write high quality codes. Universities and colleges, being the most important educational institutions, should of course shoulder the burden to cultivate such qualified software engineers. Many methods have been explored to make this educational task more efficient. Peer code review (PCR) is such a teaching process that can be used to help instructors teach more efficiently. After three years' implementation, the advantage of PCR has been revealed while some major problems have been addressed, e.g. it is unacceptably troublesome to control the whole process manually, and its quality is hard to handle. So a web-based MIS with built-in PCR was developed. The detailed design and implementation of this system is presented. It is believed that the MIS will help teachers assure the quality of the PCR process.
{"title":"Quality Assurance of Peer Code Review Process: A Web-Based MIS","authors":"Wang Yan-qing, Zhang Xiao, Yu Long, Huang Hu-jie","doi":"10.1109/CSSE.2008.1141","DOIUrl":"https://doi.org/10.1109/CSSE.2008.1141","url":null,"abstract":"The software industry and most multinational IT companies are starving for software engineers who can write high quality codes. Universities and colleges, being the most important educational institutions, should of course shoulder the burden to cultivate such qualified software engineers. Many methods have been explored to make this educational task more efficient. Peer code review (PCR) is such a teaching process that can be used to help instructors teach more efficiently. After three years' implementation, the advantage of PCR has been revealed while some major problems have been addressed, e.g. it is unacceptably troublesome to control the whole process manually, and its quality is hard to handle. So a web-based MIS with built-in PCR was developed. The detailed design and implementation of this system is presented. It is believed that the MIS will help teachers assure the quality of the PCR process.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"6 1","pages":"631-634"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90070988","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}
A vehicle detection algorithm was proposed based on the morphology and wavelet transform, in the context of the traditional difference. First, the background model was established, using statistical means of the rapid sequence. As background to transform the impact of light obviously, the corresponding easy and quick to update the background algorithm was used. Using the background of the video images to do background subtraction, and then images of the vehicles were accurate detection of mathematical morphology and wavelet transform. A video vehicle detection system was developed using visual C++6.0 and OpenCV image and development kits. A highway traffic flow has been detected by a background extraction, image filtering, image binary, morphological transformation, vehicle detection and segmentation methods and steps. To achieve some highway traffic flow analysis, results showed that: the system to identify the correct rate of more than 98 percent, satisfying the requirements of practical applications.
在传统差分方法的基础上，提出了一种基于形态学和小波变换的车辆检测算法。首先，利用快速序列的统计方法建立背景模型;由于背景变换对光线的影响明显，因此采用了相应的简单快速的背景更新算法。利用视频图像的背景进行背景相减，然后对图像中的车辆进行数学形态学和小波变换的精确检测。利用visual c++ 6.0和OpenCV图像及开发工具开发了视频车辆检测系统。本文介绍了高速公路交通流检测的主要方法和步骤，包括背景提取、图像滤波、图像二值化、形态变换、车辆检测和分割等。以某高速公路交通流分析为例，结果表明:系统识别正确率达98%以上，满足实际应用要求。
{"title":"Research of the Real-Time Detection of Traffic Flow Based on OpenCV","authors":"Z. Lei, Zhang Xue-fei, Liu Yin-ping","doi":"10.1109/CSSE.2008.872","DOIUrl":"https://doi.org/10.1109/CSSE.2008.872","url":null,"abstract":"A vehicle detection algorithm was proposed based on the morphology and wavelet transform, in the context of the traditional difference. First, the background model was established, using statistical means of the rapid sequence. As background to transform the impact of light obviously, the corresponding easy and quick to update the background algorithm was used. Using the background of the video images to do background subtraction, and then images of the vehicles were accurate detection of mathematical morphology and wavelet transform. A video vehicle detection system was developed using visual C++6.0 and OpenCV image and development kits. A highway traffic flow has been detected by a background extraction, image filtering, image binary, morphological transformation, vehicle detection and segmentation methods and steps. To achieve some highway traffic flow analysis, results showed that: the system to identify the correct rate of more than 98 percent, satisfying the requirements of practical applications.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"43 1","pages":"870-873"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82151091","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}
With the increasing of side-scan sonar applications, the studies on side-scan sonar image processing have been reported more and more increasingly. This paper firstly analyzes these current studies in this field to explain the need for this study, then it brings forward the main contents of side-scan sonar image processing and analyzes these contents one by one. Based on SIS-1624 side-scan sonar system, ArcGIS92 and Oracle92 this paper has built a prototype system and implemented the geometric correction, the gray correction, the geo-coding and the image fusion methods.
{"title":"Study and Implementation of the Methods of the Side-scan Sonar Image Processing","authors":"J. Xiaojun, Liu Nan, L. Renyi, Yin Tianhe","doi":"10.1109/CSSE.2008.1168","DOIUrl":"https://doi.org/10.1109/CSSE.2008.1168","url":null,"abstract":"With the increasing of side-scan sonar applications, the studies on side-scan sonar image processing have been reported more and more increasingly. This paper firstly analyzes these current studies in this field to explain the need for this study, then it brings forward the main contents of side-scan sonar image processing and analyzes these contents one by one. Based on SIS-1624 side-scan sonar system, ArcGIS92 and Oracle92 this paper has built a prototype system and implemented the geometric correction, the gray correction, the geo-coding and the image fusion methods.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"11 1","pages":"109-112"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86065872","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}
An approach of road crossing scene recognition based on scale invariant feature transform (SIFT) and color features is proposed in this paper. Firstly, the SIFT features are extracted and the color histogram in HSI space is calculated. Secondly, the K-D trees algorithm is used to match SIFT features of images in road crossing images database, and Bhattacharyya distance match result is calculated by color histogram. Finally, the SIFT features match result and Bhattacharyya distance match result are combined together to confirm the suitable image in database. The image pre-classified idea is also adopted to accelerate the SIFT features matching. The experiment results demonstrate that the algorithm is robust to the various illumination, dynamic disturbance and self-circumrotating, and can be used to the robot location.
{"title":"Vision Based Road Crossing Scene Recognition for Robot Localization","authors":"Gao Qingji, Liao Juan, Yang Guoqing","doi":"10.1109/CSSE.2008.438","DOIUrl":"https://doi.org/10.1109/CSSE.2008.438","url":null,"abstract":"An approach of road crossing scene recognition based on scale invariant feature transform (SIFT) and color features is proposed in this paper. Firstly, the SIFT features are extracted and the color histogram in HSI space is calculated. Secondly, the K-D trees algorithm is used to match SIFT features of images in road crossing images database, and Bhattacharyya distance match result is calculated by color histogram. Finally, the SIFT features match result and Bhattacharyya distance match result are combined together to confirm the suitable image in database. The image pre-classified idea is also adopted to accelerate the SIFT features matching. The experiment results demonstrate that the algorithm is robust to the various illumination, dynamic disturbance and self-circumrotating, and can be used to the robot location.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"103 1","pages":"62-66"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77044359","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}
On the basis of some research work on the educational game sites, we introduce an intelligent system for educational game resource discovery and define a concept of game-metadata structure. It will strive to organize educational games all over the internet and provide a new way of thinking in building game resource database. In this paper, both of the key technologies and the function modules are described in detail.
{"title":"Design and Implementation of an Intelligent System for Educational-Game Resource Discovery","authors":"Zhang Hui, Wen Wang, W. Xiuyun","doi":"10.1109/CSSE.2008.193","DOIUrl":"https://doi.org/10.1109/CSSE.2008.193","url":null,"abstract":"On the basis of some research work on the educational game sites, we introduce an intelligent system for educational game resource discovery and define a concept of game-metadata structure. It will strive to organize educational games all over the internet and provide a new way of thinking in building game resource database. In this paper, both of the key technologies and the function modules are described in detail.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"61 1","pages":"1353-1356"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73667865","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 3d reconstruction, to search the corresponding points only in horizontal line rapidly and accurately, it is used to make the epipolar lines of stereo images be parallel to the horizontal direction and to remove the parallax in vertical direction, then we can complete the density match better. In the foundation traditional projective transform, a novel liner and aspect ratio invariant rectification method is proposed. This method selects corresponding points in the pairs of images to define a reference plane. Through the relation of epipolar geometry, construct a linear equation set and calculate the projective transformation matrix. Then eliminate distortion by using shearing transform. Thus the algorithm accomplishes the rectification of stereo vision greatly. Experiments with real images show that the method an effective method which can eliminate the distortion in stereo rectification.
{"title":"A Linear and Aspect Ratio Invariant Rectification Method for Stereo Vision","authors":"Jiang Ze-tao, Wu Min, Zheng Bi Na","doi":"10.1109/CSSE.2008.508","DOIUrl":"https://doi.org/10.1109/CSSE.2008.508","url":null,"abstract":"In 3d reconstruction, to search the corresponding points only in horizontal line rapidly and accurately, it is used to make the epipolar lines of stereo images be parallel to the horizontal direction and to remove the parallax in vertical direction, then we can complete the density match better. In the foundation traditional projective transform, a novel liner and aspect ratio invariant rectification method is proposed. This method selects corresponding points in the pairs of images to define a reference plane. Through the relation of epipolar geometry, construct a linear equation set and calculate the projective transformation matrix. Then eliminate distortion by using shearing transform. Thus the algorithm accomplishes the rectification of stereo vision greatly. Experiments with real images show that the method an effective method which can eliminate the distortion in stereo rectification.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"22 1","pages":"903-906"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75282136","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}
An approach on modeling traversing features in concurrent software system was presented, which is based on aspect-oriented techniques and statecharts of unified modeling language (UML). Modeled with UML statecharts diagrams, the primary system functions and corresponding traversal features are enveloped into various orthogonal regions of a composite state respectively. The mutual relationships between orthogonal regions are implied by the orders of broadcast events. With modular transition system, a basic computational model, the formalization description of aspect-oriented statechart models was proposed. The precise semantics of model elements and modeling procedures was also given. The case study indicates that the strategy of separation of traversing features is implemented in design phrase of concurrent software system with this method. And, the advantages of this software modeling approach are loose couple, adaptability and traceability.
{"title":"Research on Modeling Traversing Features in Concurrent Software System","authors":"Su Yang, Xuanwu Zhou, Minqing Zhang","doi":"10.1109/CSSE.2008.844","DOIUrl":"https://doi.org/10.1109/CSSE.2008.844","url":null,"abstract":"An approach on modeling traversing features in concurrent software system was presented, which is based on aspect-oriented techniques and statecharts of unified modeling language (UML). Modeled with UML statecharts diagrams, the primary system functions and corresponding traversal features are enveloped into various orthogonal regions of a composite state respectively. The mutual relationships between orthogonal regions are implied by the orders of broadcast events. With modular transition system, a basic computational model, the formalization description of aspect-oriented statechart models was proposed. The precise semantics of model elements and modeling procedures was also given. The case study indicates that the strategy of separation of traversing features is implemented in design phrase of concurrent software system with this method. And, the advantages of this software modeling approach are loose couple, adaptability and traceability.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"140 1","pages":"81-84"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77587067","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 analyzes that in Visual C++ environment how to call MATLAB M file without the support of MATLAT environment by building the MATLAB M file into a dynamic link lib (DLL) beforehand, then uses this method to construct a virtual signal analyze platform quickly and expediently, which can improve the teaching effect evidently in such as ldquosignal processingrdquo courses.
{"title":"Research and Realize of Virtual Signal Analyze Platform Based on Hybrid Programming","authors":"Wang Jian, Wang Yan-hong, Meng Fei","doi":"10.1109/CSSE.2008.705","DOIUrl":"https://doi.org/10.1109/CSSE.2008.705","url":null,"abstract":"This paper analyzes that in Visual C++ environment how to call MATLAB M file without the support of MATLAT environment by building the MATLAB M file into a dynamic link lib (DLL) beforehand, then uses this method to construct a virtual signal analyze platform quickly and expediently, which can improve the teaching effect evidently in such as ldquosignal processingrdquo courses.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"127 1","pages":"1071-1073"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79536932","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 order to solve the accuracy and speed problems of page recommendation, we used information entropy of data in positive domain to help finding out the rough set rules. A new rough set important attribute mining algorithm based on information entropy is put forward in this paper, according to which a heuristic rules mining algorithm of Web page recommendation is designed. At last we used the recommendation rules to help Web users to find out pages which are interested to them. The experiment results show that the algorithm can improve speed and accuracy of Web page recommendation.
{"title":"Rough Set Page Recommendation Algorithm Based on Information Entropy","authors":"Xiong Haijun, Zhang Qi, Wang Baoyi","doi":"10.1109/CSSE.2008.499","DOIUrl":"https://doi.org/10.1109/CSSE.2008.499","url":null,"abstract":"In order to solve the accuracy and speed problems of page recommendation, we used information entropy of data in positive domain to help finding out the rough set rules. A new rough set important attribute mining algorithm based on information entropy is put forward in this paper, according to which a heuristic rules mining algorithm of Web page recommendation is designed. At last we used the recommendation rules to help Web users to find out pages which are interested to them. The experiment results show that the algorithm can improve speed and accuracy of Web page recommendation.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"735-738"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88466428","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}
We proposed a distributed energy saving clustering algorithm BPEC. Cluster-heads are elected by two probabilities. The primary probability is based on the ratio between average residual energy of neighbor nodes and itself residual energy. The subsidiary probability is the node's degree. By using BPEC algorithm, the entire network broadcasting complexity is O (n), the entire network computing complexity is O (1). The cluster set generated by BPEC is proved to be a Maximum Independent Set. The experimental results show that when nodes is enough, the cluster set size is close to the theoretical values.
{"title":"An Energy-Aware Distributed Clustering Algorithm in Wireless Sensor Networks","authors":"Xu Jianbo, He Yong, L. Renfa","doi":"10.1109/CSSE.2008.782","DOIUrl":"https://doi.org/10.1109/CSSE.2008.782","url":null,"abstract":"We proposed a distributed energy saving clustering algorithm BPEC. Cluster-heads are elected by two probabilities. The primary probability is based on the ratio between average residual energy of neighbor nodes and itself residual energy. The subsidiary probability is the node's degree. By using BPEC algorithm, the entire network broadcasting complexity is O (n), the entire network computing complexity is O (1). The cluster set generated by BPEC is proved to be a Maximum Independent Set. The experimental results show that when nodes is enough, the cluster set size is close to the theoretical values.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"15 1","pages":"528-531"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73815961","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
扫码关注我们
求助内容：
应助结果提醒方式：