{"title":"Developing a standard protocol for clinical data exchange and analysis","authors":"Liang Xiao, Qiuju Wei","doi":"10.1109/ICSESS.2015.7339086","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339086","url":null,"abstract":"Clinical data exchange across organisational boundary is essential but not straightforward, since it involves a diverse range of systems that maintain not just incompatible data formats but also their autonomy. This is barrier of substantial significance not only to improved care for individuals whereas data sharing is essential to clinical decisions, but also administrative strategies and resource allocation for an entire population whereas datasets need to be aggregated. The Hubei Provincial Department of Health recently launched an initiative of a province-wide data exchange standard. Under investigation by the authors, the standard will guide vendors to implement a set of hierarchical platforms at various administrative levels, and connect clinical information systems to them and join the data exchange network. In this paper, we will describe the data exchange requirements in the province, the design of a service paradigm and specification of Clinical Document Architecture (CDA), as well as governing protocols towards the goal. A case study on patients with hypertension, from detection, diagnosis, referral, treatment, onwards to follow-up will be used for illustration. The work contributes a semantic and functional data exchange model, and will further support data analysis to both clinical and administrative decision-making in this province.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128649489","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 Top-k query algorithm for big data based on MapReduce","authors":"Xueyan Lin","doi":"10.1109/ICSESS.2015.7339218","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339218","url":null,"abstract":"Big data has brought new challenges to Top-k in data partitioning and parallel programming model. In order to overcome these problems, a new Top-k query algorithm for big data based on MapReduce is proposed. Based on the features of MapReduce, this paper presents an in-depth study of Top-k query on big data from the perspective of data partitioning, data reduce, etc. Theoretical and experimental results show the proposed Algorithm makes a sharp increase in efficiency.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126105904","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 and improve on K-means algorithm based on hadoop","authors":"Kehe Wu, Wenjing Zeng, Tingting Wu, Yanwen An","doi":"10.1109/ICSESS.2015.7339068","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339068","url":null,"abstract":"With the advent of the big data era, traditional data mining algorithm becomes incompetent for the task of massive data analysis, management and mining. The development of cloud computing brings new life to algorithm parallelization. In this paper, we have studied the K-means algorithm, one of the clustering algorithm. Then we attempt to improves this algorithm via the method that sample the large-scale data and use convex hull and opposite Chung points to solve the initial two cluster centers. We also take the MapReduce programming model to parallelize the whole process. Finally, using the Reuters news set 21578 as a data source, comparative experiments under different distance measure, serial to parallel, and different cluster nodes have been done to verify the efficiency of the improved algorithm. Results show that compared with serial algorithm, the improved parallel algorithm improves obviously both in reliability and efficiency with the increase of cluster nodes and data size.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121584164","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}
Kehe Wu, Xiaoxiang Wang, Haisu Chen, Si-hang Zhao, Yi Zhou
{"title":"Improvement on LVS based IP network connection status synchronization","authors":"Kehe Wu, Xiaoxiang Wang, Haisu Chen, Si-hang Zhao, Yi Zhou","doi":"10.1109/ICSESS.2015.7339164","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339164","url":null,"abstract":"In typical IP network, load balancing is adopt to enable the load of all servers approach a global optimal balanced by dynamically dispatching new flows to different servers in the network. Linux Virtual Server (LVS) plays an important role in the dispatching process. However, previous LVS-based researches have failed to consider expansibility, efficiency and security. Based on this, we proposed a novel method focusing on LVS connection state synchronization in this work and extend the traditional method by adopting a novel network topology structure and a series of corresponding strategy.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130614316","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":"Shared variables analysis for real-time embedded systems using predefined patterns for C language","authors":"Mostafa Sadik, Mena Nagiub, M. Taie","doi":"10.1109/ICSESS.2015.7339014","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339014","url":null,"abstract":"Accurate analysis of the shared variables plays a critical role in enhancing the software quality level especially for safety-critical real-time embedded systems. Many methods are currently available to warn programmers for racing conditions. However, most of the methods focus on detection of suspicious shared variable access, leaving room for improvement on the level of accuracy of warnings. In this study, an innovative methodology is presented to provide detailed accurate detection and warnings of racing conditions by matching them to predefined racing patterns for C language. Results of the proposed method are in a high decrease of the false racing condition warnings compared to available methods in the prior art. Experiments and results are provided to show the effectiveness of the proposed method. Finally, future work is addressed.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130796610","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":"Density K-means: A new algorithm for centers initialization for K-means","authors":"Xv Lan, Qian Li, Yi Zheng","doi":"10.1109/ICSESS.2015.7339213","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339213","url":null,"abstract":"K-means is one of the most significant clustering algorithms in data mining. It performs well in many cases, especially in the massive data sets. However, the result of clustering by K-means largely depends upon the initial centers, which makes K-means difficult to reach global optimum. In this paper, we developed a novel algorithm based on finding density peaks to optimize the initial centers for K-means. In the experiment, together with our algorithm, nine different clustering algorithms were extensively compared on four well-known test data sets. According to our experimental results, the performance of our algorithm is significantly better than other eight algorithms, which indicates that it is a valuable method to select initial center for K-means.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127058051","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 octree-based grouping recoding RFID anti-collision algorithm","authors":"Shaoqing Zhu, Xiaofang Jin, Libiao Jin","doi":"10.1109/ICSESS.2015.7339167","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339167","url":null,"abstract":"In order to improve the communication efficiency of tree-based algorithms, this paper proposes the octree-based grouping recoding (OGR) algorithm. The OGR algorithm puts forward a method by dividing the original encoding of tag into groups firstly, then recoding every group. The simulation results show that compared with the latest quad-tree-based advanced (QA) anti-collision algorithm, OGR algorithm decreases the searching timeslots by about 13% and reduces the transmission date by about 15%. Meanwhile the communication efficiency is greatly improved nearly 69%.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132899909","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 the service guarantee strategy based on streaming media platform","authors":"Feifei Guo, Sanxing Cao","doi":"10.1109/ICSESS.2015.7339077","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339077","url":null,"abstract":"The rapid growth of the Internet users brings on bandwidth bottleneck. Consequently, it is difficult to guarantee the video service quality of the online streaming media platform. This paper mainly introduces the current situation of streaming media platform, analyzes the network performance and the existing problems, and then puts forward the corresponding research scheme. It specifically adopts the distributed cluster architecture, load balancing, surestream, stream splitting and redundant server technologies to ease the problem of bandwidth bottleneck when big concurrent flow visiting, and finally provides better service assurance for users.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131318110","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}
Waqar Ali, J. Sang, Hamad Naeem, Rashid Naeem, Ali Raza
{"title":"Wireshark window authentication based packet captureing scheme to pervent DDoS related security issues in cloud network nodes","authors":"Waqar Ali, J. Sang, Hamad Naeem, Rashid Naeem, Ali Raza","doi":"10.1109/ICSESS.2015.7339017","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339017","url":null,"abstract":"DoS (Denial of Service) attack forces a cloud network node to handle few unauthorized access that employ unwanted computing cycle. As a result, the cloud node response is slow as usual and resource on cloud network becomes unavailable. Some Dos attacks are Ping of Death, Teardrop, Snork, Locking authentication, SYN flooding, Operating System Attacks etc. The most vulnerable incident happen when the adversary is committed DDoS (Distributed Denial of Service) attack with comprised cloud network. In this paper, the prevention techniques for DDoS (Distributed Denial of Service) attack in cloud nodes were discussed, a dynamic window scheme in cloud nodes to determine a message verification to resolve unnecessary packet processing was proposed.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132622711","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":"Cylinder radius determination of cylindrical panoramic image mosaic","authors":"Xiao-long Ni, Zhengning Wang, Yan-Hong Jiang","doi":"10.1109/ICSESS.2015.7339224","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339224","url":null,"abstract":"Cylindrical panoramic image mosaic has a severe flaw that the focal length must be known. Our article proposes a new method based on image feature points to calculate the focal length in the process of image mosaic. The observation equations can be gotten from the transmission matrix between stitching images. Then the Bundle Adjustment is used to solve equations and optimize the focal length. The results of the experiments confirm the effectiveness of our proposed method. This method greatly extended the scope of cylindrical panoramic image mosaic.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123678115","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}