{"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":"A new testing method of randomness for true random sequences","authors":"Fang Yutao, Guiping Su","doi":"10.1109/ICSESS.2014.6933624","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933624","url":null,"abstract":"In this paper, based on researches and analysis for some common testing methods of randomness, a new testing method for randomness was proposed. This new method applied theories on kolmogorov complexity and wavelet transform to the randomness testing. This new method can be used to evaluate quality of random sequences generators and security of encryption algorithms.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"67 1","pages":"537-540"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73347774","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":"Fault tolerant data flow using curator — Storm","authors":"Lavanya Sainik, Dheeraj Khajuria","doi":"10.1109/ICSESS.2014.6933608","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933608","url":null,"abstract":"Driven by the 3GPP (3rd Generation Partnership Project) evolving standards and advent of Big Data technology, to deal with huge volume, velocity and variety of data, various industries like telecommunication, warehousing and storage, financial and many more industries need to be compliant with this evolving technology. There is a huge demand to process both real time and stored data. In this paper we have analyzed an open source framework Storm, which is a real time distributed processing engine and suggesting an improvement on its fault tolerance mechanism so that it can be flawlessly used for any data processing use case. Vanilla storm provides guaranteed message processing however it promises “at least once” level of processing. For perfect fault tolerant system “exactly one” level of processing is required and to achieve this storm provides another framework, Trident which is built on top of it. Trident provides transactional spout where transactional metadata information <; transaction id, data > is stored in zookeeper which provides distributed coordination, thus across node / hardware data can be replayed in case of any failure, timeout, retry. Trident uses zookeeper for coordination of transactional information through apache curator framework. However with current trident framework per activity level (aggregator/reducer) commit can be easily obtained but no direct implementation for single chain level transaction commit. This paper describes an approach where by modifying existing transactional trident, chain level commit can be obtained using curator recipes.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"100 1","pages":"472-475"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75168195","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}
{"title":"Adopting Text Clustering in web-based application to facilitate searching of education information","authors":"N. Nilsson, Yan Liu","doi":"10.1109/ICSESS.2014.6933590","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933590","url":null,"abstract":"Clustering, as a part of the Data Mining field, has been in the center of the research attention for the last decade. It is the task of finding subsets of data that are sharing the same type of attributes. Text Clustering becomes one of the most critical and important solutions in data mining to discover knowledge from fast grow up web data and log files. There are many challenges, algorithms needs to be tailored specific for each domain and scale well with growing data sets. Another interesting aspect is the design of the system. A complex set components need to interact well together. This article proposes an elegant way of clustering university educations based on their text attributes. The solution is integrated directly into a Spring Web Application. A comprehensive architecture is proposed, providing the frameworks needed. Clustering techniques such as Canopy Generation [4] and k-Means are demonstrated.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"22 1","pages":"393-396"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72784145","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 multi-dimensional ontology-based IoT resource model","authors":"Huijuan Zhang, Chao Meng","doi":"10.1109/ICSESS.2014.6933527","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933527","url":null,"abstract":"Nowadays researches related to resource management and representation of IoT (Internet of Things) emphasize on making identify regulation or describing device working principle. However they could not represent dynamic feature and multi-dimensional feature of interaction. This paper propose a multi-dimensional ontology-based IoT resource model to solve above defects. For resource management, searching and reasoning, this model divides resource into 4 key concepts: general situation, variable feature, function and enforce. Then this paper classify resource into 5 dimensions. Experimental result shows that when IoT resource contains time feature, location feature and priority feature, resource model works well to accomplish management and searching task. In addition, this model lays a foundation for service model, which is in upper layer of resource model.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"27 1","pages":"124-127"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72683572","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":"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}
{"title":"SoRS: An effective SVD-DWT watermarking algorithm with SVD on the revised singular value","authors":"Xiaoyi Zhou, Lingfei Wang","doi":"10.1109/ICSESS.2014.6933734","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933734","url":null,"abstract":"The proposed SoRS algorithm is based on the SoW scheme present in [1]. In SoW algorithm, the watermark is split into four shares, 2-level DWT is applied and SVD is performed on the HL/LH subbands. While in SoRS, all the subbands of 2-level DWT performed on the low subband are selected for embedding watermark. Furthermore, SVD is performed on the singular value revised by the watermark and the carrier image. The experimental results show that SoRS has both the significant improvement in perceptibility and the robustness under various types of image processing attacks. Even though this algorithm is weak against scaling attacks, it extracts watermarks of higher quality than other algorithms under many attacks such as JPEG compression, filtering, histogram equalization, rotation, cropping and noise.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"228 1","pages":"1001-1006"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77520289","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 optimization of flight scheduling problem based on the combination of ant colony optimization and genetic algorithm","authors":"Wenkuai Liang, Yi Li","doi":"10.1109/ICSESS.2014.6933567","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933567","url":null,"abstract":"As the flight scheduling has always been a key technology which reduces flight delays and costs. Rational and efficient flight sorting method not only can effectively improve the utilization of the airport, reduce flight delay, but also ensure flight safety and reduce the incidence of sudden accidents. Firstly, we studied the application of ant colony algorithm in flight sorting, and proposed a new flight sorting method which is combined with ant colony algorithm and genetic algorithm depending on the mutation characteristic of genetic algorithm; Secondly, the minimization objective model that the flight total delay was minimum was established based on the sorting method; Finally, the simulation experiment was done based on the model. The simulation results show that the proposed method can effectively reduce flight delay. Comparing with ant colony algorithm, the global optimal flight sequence can be found in a shorter time.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"26 1","pages":"296-299"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77263039","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}