{"title":"Review of the visual feature extraction research","authors":"Zeliang Zhang, Fumei Liu, Wenliang Qu","doi":"10.1109/ICSESS.2014.6933602","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933602","url":null,"abstract":"Since the 1990s, we improved speech recognition results-based approach by lip-reading computer technology and integration of speech recognition technology. This method attracted the attention of some researchers, and made considerable progress, but there are still many problems to be a breakthrough. The article does a detailed introduction on the current status of lip-reading technology and describes some of the main relevant aspects of the traditional methods and new technologies. This focuses on the visual feature extraction and recognition technology, which aims to attract more researchers to be interested and concerned in this area of research. We hope that they can participate in the study of lip-reading technology to jointly promote the development of the field.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"C-22 1","pages":"449-452"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86158844","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}
S. Shuang, Chen Yan, Li Tao-ying, Sun Jun-xiong, Hou Jia-Qi
{"title":"Integrated logistics management platform based on XFire","authors":"S. Shuang, Chen Yan, Li Tao-ying, Sun Jun-xiong, Hou Jia-Qi","doi":"10.1109/ICSESS.2014.6933707","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933707","url":null,"abstract":"As logistics enterprise is difficult to respond to rapidly changing of business needs brought by endless business systems, a range of system integration issues are caused of the differences in development platforms, protocols and interfaces. In this paper, we develop an integrated logistics management platform based on XFire. This article studies on the theory related to a service-oriented architecture (SOA) for resolving the problems of operating independently, difficultly interacting, sharing information and collaborating in current logistics enterprise.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"5 1","pages":"885-888"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86491589","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 novel deep model for image recognition","authors":"Ming Zhu, Yan Wu","doi":"10.1109/ICSESS.2014.6933585","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933585","url":null,"abstract":"In this paper we propose a hybrid deep network for image recognition. First we use the sparse autoencoder(SAE) which is a method to extract high-level feature representations of data in an unsupervised way, without any manual feature engineering, and then we perform the classification using the deep belief networks(DBNs), which consist of restricted Boltzmann machine(RBM). Finally, we implement some comparative experiments on image datasets, and the results show that our methods achieved better performance when compared with neural network and other deep learning techniques such as DBNs.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"33 1","pages":"373-376"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82887288","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 new approach of clustering malicious JavaScript","authors":"Liu Biao, Huamin Feng, Zhang Kejun, Li Yang","doi":"10.1109/ICSESS.2014.6933535","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933535","url":null,"abstract":"In the recent years, many hostile websites have been using polymorphic JavaScript in order to conceal its code. The virtual execution is considered to be effective to process and detect such types of JavaScript. However, a challenge often encountered with that approach is the mandatory preparation of very detail-oriented environments that may also require specific user-driven events for the malicious JavaScript to execute properly as it was designed to. This paper proposes a hierarchical clustering algorithm based on tree edit distance to recognize and categorize hostile JavaScript. Firstly, the JavaScript's abstract syntax tree is constructed to be structural analysis. Secondly, the similarity of two JavaScript is calculated by tree-matching algorithm based on tree edit distance. Finally, the hierarchical clustering of malicious JavaScript is determined by predefined threshold. Our promising results confirm the effectiveness of the approach.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"1 1","pages":"157-160"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82979407","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":"Scheduling divisible reduce tasks in MapReduce","authors":"Tao Gu, Chuang Zuo, Zheng Chen, Yulu Yang, Tao Li","doi":"10.1109/ICSESS.2014.6933542","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933542","url":null,"abstract":"The computations in MapReduce are composed of map and reduce tasks. Although performance of map tasks has been investigated extensively, most researches ignore the scheduling of reduce tasks. This paper proposes a divisible load scheduling model for reduce tasks in a MapReduce job. By analyzing intermediate data transmission and reduce task execution in reduce phase, reduce tasks are abstracted as divisible loads. The optimal scheduling of reduce tasks is solved with linear programming. The performance is evaluated under different environments. Experiment results show that at least 40% performance improvement is achieved with the optimal scheduling.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"1942 1","pages":"190-194"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91218834","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":"Routing algorithms analysis for ODMA-WiFi systems","authors":"Zhenchao Wang, Zhe Li, Xianchao Zhu","doi":"10.1109/ICSESS.2014.6933763","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933763","url":null,"abstract":"ODMA-WiFi network is a sort of multi-hop temporary autonomous network which is of great compatibility, composed of lots of mobile nodes without pre-positioned network infrastructure, and mainly used for conditions where the network needs to be deployed rapidly. This flexibility of ODMA-WiFi nodes introduces new challenges for the design of efficient network protocols. The throughput of the network depends largely on the routing algorithm, and due to the special nature of ODMA, there is a great deal of difference between ODMA-WiFi and traditional technologies. In this paper, the features of ODMA-WiFi networks are firstly presented, then several typical routing protocols are introduced and the performances of each protocol are analyzed and compared. Finally, we come to the conclusion through the above process.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"30 1","pages":"1122-1125"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80635043","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":"Mutant generation for analog circuit designs","authors":"Aiqiang Xu, Xiaofeng Tang, Zhiyong Yang","doi":"10.1109/ICSESS.2014.6933714","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933714","url":null,"abstract":"A mutant generation approach for analog circuit designs is proposed, which adopts the methodology from the software testing domain and is capable to generate a batch of mutants automatically. Several mutation operators, which can cover most of the common faults in a practical circuit, are introduced to carry out the mutant generation. The implementation of these operators is based on an undirected graph which serves as an independent intermediate form to facilitate the generation process and to enhance the flexibility of the method. A Spice oriented mutant generation tool is developed and the experimental results prove that the approach and the tool are useful and efficient.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"24 1","pages":"916-920"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78648441","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 of the test case prioritization algorithm for black box testing","authors":"Wenhong Liu, Xin Wu, Weixiang Zhang, Yang Xu","doi":"10.1109/ICSESS.2014.6933509","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933509","url":null,"abstract":"In order to improve the efficiency of software test case execution, this paper analyzed the impact of some factors to test cases prioritization and presented two adjustment algorithms. These factors included software requirement prioritization, software failure severity and software failure probability level. Firstly, gave the definition of software requirement prioritization, the ranking methods of software failure severity and software failure probability level, the description of the relationship between test cases and test requirements. Then, presented an initial test case prioritization method based on the analysis. And then, proposed a dynamic adjustment algorithm using of software requirement prioritization and software failure probability level when software failure occurred. Experimental data show that the two test case prioritization algorithms can improve the efficiency of software testing and are helpful to find more software defects in a short period.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"47 1 1","pages":"37-40"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78042139","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":"An elbow biomechanical model and its coefficients adjustment","authors":"J. Bai, Yongsheng Gao, Shengxin Wang, Jie Zhao","doi":"10.1109/ICSESS.2014.6933723","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933723","url":null,"abstract":"Through the establishment of the elbow biomechanical model, it can provide theoretical guide for rehabilitation therapy on the upper limb of the human body. A biomechanical model of the elbow joint can be built by the connection of muscle force model and elbow dynamics. But there are many undetermined coefficients in the model like the optimal joint angle and optimal muscle force which are usually specified as the experimental parameters of other workers. Because of the individual differences, there is a certain deviation of the final result. To this end, the RMS value of the deviation between the actual angle and calculated angle is considered. A set of coefficients which lead to the minimum RMS value will be chosen to be the optimal parameters. The direct search method and the conjugacy search method are used to get the optimal parameters, thus the model can be more accurate and mode adaptability.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"21 1","pages":"954-957"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83217335","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}
Haofei Xie, Guoqing Zhang, D. Su, Ping Wang, Feng Zeng
{"title":"Performance evaluation of RPL routing protocol in 6lowpan","authors":"Haofei Xie, Guoqing Zhang, D. Su, Ping Wang, Feng Zeng","doi":"10.1109/ICSESS.2014.6933646","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933646","url":null,"abstract":"In this paper, we present the results of the comparison of three reactive routing protocols for Wireless sensor networks (WSNs), AODV, DYMO and RPL. For the purpose of performance evaluation, detailed comparisons are made with AODV and DYMO. Simulations are run to estimate the network topology change, routing overhead and average packet End-to-End Delay. We simulate RPL with COOJA based on contiki operating system. It is showed that RPL routing protocol offers adaptation to changing network topology and the performances of RPL are superior to the other two routing protocol in 6lowpan, and it has a higher stability than the AODV, DYMO.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"20 1","pages":"625-628"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75706644","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}