{"title":"Distributing Monitor System Based on WIFI and GSM Supporting SCPI","authors":"Xingyue Han, Chunhui Zhao","doi":"10.1109/DCABES.2014.59","DOIUrl":"https://doi.org/10.1109/DCABES.2014.59","url":null,"abstract":"Internet of things (IOT) has become one of the most promising technology of the 21th century. In this paper, we combine the WIFI and global system for mobile communication (GSM) and build a distributing monitor system supporting standard commands for programmable instruments (SCPI), in which the WIFI is used to construct a local communicating network, the GSM is used for long distance communication, and the command of the system is based on the SCPI. The presented system can be widely used, such as in domain of smart home and environment monitor. It also provides a reference for relative design.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129656853","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 Database Middleware Architecture for MPI-based Cloud Platform","authors":"Lin Zhu, Yucheng Guo","doi":"10.1109/DCABES.2014.25","DOIUrl":"https://doi.org/10.1109/DCABES.2014.25","url":null,"abstract":"To solve the poor performance of existing cloud platforms in high-performance computing, our research team developed a high-performance cloud computing platform based on MPI. As a cloud platform, massive data storage is a key technology. In the research, we mainly studied how to build a MPI cloud platform that supports massive data storage, and implement a distributed cluster constructed by MySQL. This paper introduces the feature of MPI cloud platform, how to build the cloud platform database and the implementation of related SQL operations on the database. Based on this, we test the related operations in the database, and elaborate the shortcomings and challenges of the distributed database in this cloud computing platform.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130668801","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":"Improving Random Read Performance of Glibc","authors":"Mei Wang, Yuanyuan Zhou, Feng Xiao, Qiuming Luo","doi":"10.1109/DCABES.2014.20","DOIUrl":"https://doi.org/10.1109/DCABES.2014.20","url":null,"abstract":"The Cloud data services, specifically, key/value stores and NoSQL database that require a large number of index lookups that fetch small amount of data. Random I/O becomes the critical performance factor. However, compared with sequential read, the efficiency of random read is very low. Our experiment will explain this. File I/O operation is closely associated with the implementation of I/O mechanism both in kernel space and user space. In this paper, we aims at analyzing the standard I/O mechanism, improving the standard I/O mechanism in user space for random read and implement into the glibc. Our experiment test result proves that our improved I/O mechanism will greatly improve the performance of random read.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127215521","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 on Error-Detecting Approach for Fault Tolerance Recomputing Oriented Parallel Digital Terrain Analysis","authors":"Shoushuai Miao, W. Dou, Yan Li","doi":"10.1109/DCABES.2014.47","DOIUrl":"https://doi.org/10.1109/DCABES.2014.47","url":null,"abstract":"In recent years, the research of parallel digital terrain analysis has become a hot spot. Using the parallel computing technology to solve data intensive problems, and it has become a development trend in digital terrain analysis. On the other hand, with the development of hardware technology and new applications, how to ensure the reliability of the computing results is a one of the key problems. We can improve the system's ability to provide the right service by adopting fault tolerance technology properly. The paper proposes a parallel error-detecting approach which is based on a mixed mode of shared memory and distributed memory. By adopting the parallel comparison, it can improve the efficiency of fault tolerance recomputing. According to the error-detecting analysis of slope algorithm, it proves the effectiveness of error-detecting approach based on fault-tolerant recomputing and achieves minor overhead.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127020132","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":"Spectral Domain Decomposition Method for Physically-Based Rendering of Photochromic/Electrochromic Glass Windows","authors":"Guillaume Gbikpi Benissan, P. Callet, F. Magoulès","doi":"10.1109/DCABES.2014.27","DOIUrl":"https://doi.org/10.1109/DCABES.2014.27","url":null,"abstract":"This paper covers the time consuming issues intrinsic to physically-based image rendering algorithms. First, glass materials optical properties were measured on samples of real glasses and other objects materials inside an hotel room were characterized by deducing spectral data from multiple trichromatic images. We then present the rendering model and ray-tracing algorithm implemented in Virtuelium, an open source software. In order to accelerate the computation of the interactions between light rays and objects, the ray-tracing algorithm is parallelized by means of domain decomposition method techniques. Numerical experiments show that the speedups obtained with classical parallelization techniques are significantly less significant than those achieved with parallel domain decomposition methods.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121187106","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 Anomaly Detection Method for Worms","authors":"X. Tong, Zhu Wang, Miao Zhang, Yang Liu, Hui Xu","doi":"10.1109/DCABES.2014.55","DOIUrl":"https://doi.org/10.1109/DCABES.2014.55","url":null,"abstract":"This paper proposes a novel anomaly detection method of network worms. The algorithm detects unknown worms by multidimensional worm abnormal detection technology, extracts its feature string via analyzing worm data with leap-style and creates new rules to detect the corresponding worm in case that the unknown worm attacks again. The paper has realized the automatic detection of unknown worms. Experiment data has showed that the method has high success detection rate and low false alarm rate.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121811010","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}
Tao Wang, Xin Lv, Fang Yang, Wenhuan Zhou, R. Qi, Huaizhi Su
{"title":"A Load Balancing Scheme for Distributed Key-Value Caching System in Cloud Environment","authors":"Tao Wang, Xin Lv, Fang Yang, Wenhuan Zhou, R. Qi, Huaizhi Su","doi":"10.1109/DCABES.2014.17","DOIUrl":"https://doi.org/10.1109/DCABES.2014.17","url":null,"abstract":"Distributed key-value caching system has been deployed in many kinds of clouds. The effect of load balancing between each node is crucial in key-value caching system in clouds. Invalidation is a feature of the data in the key-value caching system, and making some cache invalid is efficient instead of adjusting the load location when load balancing. It is worth studying that how to utilize the feature reasonable to reach maximum load balancing. Aiming at this point, a new cache-invalidation-scope model in key-value caching system is proposed. Combined with greedy algorithm, the scheme provides a better load balancing algorithm for different load cases (CLB). CLB algorithm utilizes entropy and the scope of invalid cache invalid as the evaluation basis of load balancing effect. Compared with existing algorithm, CLB load balancing algorithm lifts up the performance of key-value caching system more than one times.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129967842","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 Efficient Algorithm for Solving Eigenproblem","authors":"Huirong Zhang, Jianwen Cao","doi":"10.1109/DCABES.2014.28","DOIUrl":"https://doi.org/10.1109/DCABES.2014.28","url":null,"abstract":"In this paper, we consider second order elliptic ODE eigen problems on general grids. We construct an efficient algorithm for computing the eigen value by using weighted mean combination of the linear finite element method and corresponding 2nd-order finite difference method. We first take the arithmetic mean of the two methods. Then we compute the quasi-optimal combined parameters for different eigen values to improve our efficient algorithm. The algorithm we construct convergence faster and have higher accuracy than the linear finite element method and corresponding 2nd-order finite difference method. Some numerical examples tested on both uniform meshes and nonuniform meshes are given to illustrate the computational cost of different numerical methods for solving eigen value problems. For efficiency, all the matrices use sparse storage in our algorithm.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115263640","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-granularity Grooming Scheme for One-to-Many Multicast Traffic","authors":"Songzhu Zhang, Xingwei Wang, Min Huang","doi":"10.1109/DCABES.2014.46","DOIUrl":"https://doi.org/10.1109/DCABES.2014.46","url":null,"abstract":"With the vigorous development of Digital Broadcasting, the Internet of Things and Cloud Computing, there are more and more multicast applications in the network, leading to network traffic increases exponentially. Although optical network improves the network transmission capacity enormously, the growing network traffic still poses a challenge for the transport mechanism. Therefore, how to transport the communication request as much as possible at the cost of the minimizing energy consumption has become one of the primary problems in the future Internet. With considering network energy consumption, triggering grooming from low granularity channel to high granularity channel and Quality of Service (QoS) demands of the traffic request, this paper proposes a multi-granularity grooming scheme for one-to-many multicast traffic and designs a corresponding traffic grooming algorithm. Simulation results show that the grooming scheme proposed in this paper has better effects in the blocking probability and the energy saving.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116275797","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":"Topic Detection in Twitter Based on Label Propagation Model","authors":"Dongxu Huang, Dejun Mu","doi":"10.1109/DCABES.2014.23","DOIUrl":"https://doi.org/10.1109/DCABES.2014.23","url":null,"abstract":"Many kinds of huge amount of tweets about real-world events are generated everyday in Twitter. However, the disorganization messages required to be classified by topics and events are one of challenges to get knowledge effectively. To solve the problem, we propose a novel method that combines the cluster algorithm with label propagation algorithm to detect topics in twitter. First, we use canopy cluster algorithm to cluster tweets, canopy cluster algorithm could divides a tweet into different clusters, and the tweet which only belongs to one cluster will be labeled. Second, the mechanism of label propagation is used to label the tweets that in the overlapping of different clusters. In order to evaluate our algorithm, we use two baseline algorithms, LDA (Latent Dirichlet Allocation) and Single-Pass cluster algorithm. We apply three algorithms on tweet dataset with three topics and some noisy data, and experiment results show our method outperforms other algorithms on precision and recall rate.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125576129","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}