{"title":"Training model of network software engineer based on CDIO","authors":"Qu Wei-Qing, Zhang Shun-de","doi":"10.1109/ICCSE.2012.6295337","DOIUrl":"https://doi.org/10.1109/ICCSE.2012.6295337","url":null,"abstract":"Network Software Engineer should be specialized in network protocol, program language, database, software engineering, specialized English, spirit of continuous learning and teamwork cooperation, etc. It is discussed in this article that how to train a qualified network software engineer based on the method of CDIO.","PeriodicalId":264063,"journal":{"name":"2012 7th International Conference on Computer Science & Education (ICCSE)","volume":"24 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120985200","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}
{"title":"A fault-tolerant topology control algorithm for heterogeneous wireless networks","authors":"Xu Yejun, Huacheng Qi","doi":"10.1109/ICCSE.2012.6295259","DOIUrl":"https://doi.org/10.1109/ICCSE.2012.6295259","url":null,"abstract":"Topology control of wireless ad hoc networks is a key design challenge which will affect the lifetime and performance of such networks. The topology can be controlled by selecting which neighbors to communicate directly and varying the transmission power at each node. Some fault tolerant topologies have already been proposed recently. However, most of these topologies require all nodes to have the same transmission range. Actually, there are cases that nodes have different transmission ranges. In this paper, we analyze the sufficient condition to construct k-connected topology in heterogeneous networks. Then, a topology control algorithm is proposed. Our proposed algorithm can be executed fully distributed by each node and only uses location information of 1-hop neighbors. An advantage of this algorithm is that it can be used in both 2-dimensional and 3-dimensional wireless ad hoc networks.","PeriodicalId":264063,"journal":{"name":"2012 7th International Conference on Computer Science & Education (ICCSE)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127149087","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}
{"title":"Constant memory optimizations in MD5 Crypt cracking algorithm on GPU-accelerated supercomputer using CUDA","authors":"Feng Wang, Canqun Yang, Qiang Wu, Zhi-cai Shi","doi":"10.1109/ICCSE.2012.6295156","DOIUrl":"https://doi.org/10.1109/ICCSE.2012.6295156","url":null,"abstract":"MD5 Crypt is a cryptographic algorithm used commonly in UNIX system for authentication. By using the additional randomization of the salt and complexity of the scheme, it makes the traditional password cracking techniques invalid on common computing systems and the security of the system is guaranteed. Benefited from the thriving of petaflops heterogeneous supercomputer system recently, such as Tianhe-1A, the security of MD5 Crypt is facing a threat of Brute Force Attack again. Many works have been done on the GPU-accelerated platform to improve the performance of MD5 Crypt. However, little increase has been achieved by using the constant memory of CUDA architecture. This paper explores this problem and archived 44.6% improvement by allocating constant memory to the padding array. And this paper presents a high scalable implementation of Brute Force Attack Algorithm of MD5 Crypt on Tianhe-1A, which is the fastest heterogeneous supercomputer of the world. The experimental results have shown that 326 thousands MD5 hashes could be checked per second on one single computing node and outperform 5.7X than the CPU version. On multi-nodes, the implementation also shows a great scalability. Consequently, it issued a new challenge to the security of MD5 crypt for authentication.","PeriodicalId":264063,"journal":{"name":"2012 7th International Conference on Computer Science & Education (ICCSE)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124739884","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}
{"title":"Study of ECG feature extraction for automatic classification based on wavelet transform","authors":"Ge Ding-fei","doi":"10.1109/ICCSE.2012.6295123","DOIUrl":"https://doi.org/10.1109/ICCSE.2012.6295123","url":null,"abstract":"Electrocardiogram (ECG) feature extraction plays an important role in automatic classification and diagnosis. The current study focuses on the feature extraction of premature ventricular contraction (PVC) and normal sinus rhythm (NSR) for the discrimination purpose between them. The data in the analysis were collected from MIT-BIH database. A beat detection algorithm that was not affected by beat shape was introduced in the study. The ECG features were extracted based on wavelet transform for the analysis. Two feature sets were formed by selected wavelet coefficients and statistic parameters of wavelet coefficients for the comparative study. Support Vector Machine (SVM) algorithm was utilized to classify the ECG beats. The experimental results show that it is possible and feasible to extract ECG features with lower dimensions from wavelet coefficients in order to improve the classification results.","PeriodicalId":264063,"journal":{"name":"2012 7th International Conference on Computer Science & Education (ICCSE)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125797627","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}
{"title":"Review of data-parallel programming model","authors":"K. Hou, Jing Zhang, Junhuai Li","doi":"10.1109/ICCSE.2012.6295154","DOIUrl":"https://doi.org/10.1109/ICCSE.2012.6295154","url":null,"abstract":"Data-parallel programming model (DPPM for short) specialized for data-intensive computing becomes considerable popular because it simplifies the development of distributed parallel programs. DPPMs are classified into two categories: 1) MapReduce, Dryad; and 2) Piccolo, Function Flow, etc. based on their maturity. We analyze and compare these typical models by deployment, application, data partition, communication, fault tolerance and so on. Finally, we pay more attention to discussing development of key technologies which are deployment of storage and computation, task partition and fault tolerance in DPPM.","PeriodicalId":264063,"journal":{"name":"2012 7th International Conference on Computer Science & Education (ICCSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125833197","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}
{"title":"A collaborative filtering recommendation algorithm using user implicit demographic information","authors":"Xiaoyun Wang, Chaofei Zhou","doi":"10.1109/ICCSE.2012.6295219","DOIUrl":"https://doi.org/10.1109/ICCSE.2012.6295219","url":null,"abstract":"With development of network technology and society, people enjoy the e-commerce shopping convenience while also deeply troubled by the \"information overload\" problem. Recommendation systems help the customers find suitable products they need from a large number of commodities. Among the recommendation systems, the most widely used algorithm is collaborative filtering (CF) recommendation algorithm. In order to improve the recommendation quality, many scholars combined demographic information with CF algorithm, but they did not take into account the user implicit demographic information. However, there is a gap between explicit demographic information and implicit demographic information. To solve this problem, we propose a way to mine the user implicit demographic information. Then we introduce uncertain multiple attribute decision making method into our algorithm to find out a set of initial items. Finally, we recommend items users might like in the set of initial items according to the similarity. Experiments show that this method is more reasonable and more accurate to make recommendations for the target users.","PeriodicalId":264063,"journal":{"name":"2012 7th International Conference on Computer Science & Education (ICCSE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126105659","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}
{"title":"Research on isolated word recognition with DTW-based","authors":"Lijun Xu, Minyi Ke","doi":"10.1109/ICCSE.2012.6295044","DOIUrl":"https://doi.org/10.1109/ICCSE.2012.6295044","url":null,"abstract":"The paper first conducts a study and analysis on DTW algorithm. As the DTW algorithm needs a large number of calculations and has poor anti-interference weakness, the paper proposes improved DTW algorithm with path constraint and improved DTW algorithm to relax the starting and ending point. Experiments show that the improved DTW methods can improve the recognition speed, reduce the noise interference on speech recognition, and improve speech recognition rate.","PeriodicalId":264063,"journal":{"name":"2012 7th International Conference on Computer Science & Education (ICCSE)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125294422","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}
{"title":"The research on user interest model based on quantization browsing behavior","authors":"Y. Qinghong, Hu Hao, Xiong Neng","doi":"10.1109/ICCSE.2012.6295024","DOIUrl":"https://doi.org/10.1109/ICCSE.2012.6295024","url":null,"abstract":"The constructing and updating of user interest model, determines the accuracy of the user information representation, and directly influences the service quality for the users. This paper will show you by introducing some browsing action data into user interest model updating strategy, carrying on the experiment by using the designed system, and obtaining the reasonable values of browsing behavior parameters with an adaptive method. In the end, a demonstration is given to compare with common model through the experiment and prove the feasibility and suitability of this model.","PeriodicalId":264063,"journal":{"name":"2012 7th International Conference on Computer Science & Education (ICCSE)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122570765","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}
{"title":"A solution for an application of information visualization in telemedicine","authors":"Zhang Ning, Hong Wenxing, Zheng Si-ting, Tao Li","doi":"10.1109/ICCSE.2012.6295102","DOIUrl":"https://doi.org/10.1109/ICCSE.2012.6295102","url":null,"abstract":"For a long time, science visualization, also called graphic visualization has been widely used in the medical field. However, another kind of visualization, called information visualization or data visualization is playing a more and more important role in this field in recent years. This paper is to provide a solution to apply information visualization in telemedicine. Due to the unique data complexity in telemedicine, directly applying existing visualization techniques into the current practice of telemedicine is ineffective and inefficient, if not impossible. In this paper, we plan to introduce an integrated effective and efficient framework on information visualization for telemedicine applications. This solution will provide the most intuitive way for the doctors to learn the patients' condition and for the Centers of Disease Control or the government to learn a region's macro-distribution of diseases. At the same time, it will combine a patient's condition with the macro-distribution of diseases in the region, which he/she stays in, to show the influence of the environment on his/her condition. On a broader scale, this solution will have significant scientific and engineering impact and have potential applications in many other application fields.","PeriodicalId":264063,"journal":{"name":"2012 7th International Conference on Computer Science & Education (ICCSE)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122694845","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}
{"title":"Research on question bank maintenance for network open examination system","authors":"Boqin Liu, Xinchun Zou","doi":"10.1109/ICCSE.2012.6295438","DOIUrl":"https://doi.org/10.1109/ICCSE.2012.6295438","url":null,"abstract":"With the computer-based teaching deepening of reform, this paper based on network test system open exam according to the different basic skills of computer professionals have different needs for maintenance, increased for different professions different operating question, the unification of principles and propositions propositional form, and test results were analyzed to prove that the hierarchical classification of my school teaching reform is a success.","PeriodicalId":264063,"journal":{"name":"2012 7th International Conference on Computer Science & Education (ICCSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122484345","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}