Kun Ma  Kun Ma

LatestTOP

  • Kun Ma, Ajith Abraham, Bo Yang, and Runyuan Sun, Intelligent Web Data Management: Software Architectures and Emerging Technologies, Springer International Publishing, Switzerland, ISBN-13: 978-3-319-30191-4, 162 pages, 2016.
  • Kun Ma, Bo Yang, Zhe Yang, and Ziqiang Yu, "Segment Access-aware Dynamic Semantic Cache in Cloud Computing Environment," Journal of Parallel and Distributed Computing, 2017, 110 (12): 42-51(WOS: 000411655400005, IF: 1.93, EI: 20172203704604, CCF B类)
  • Ma, K. and Yang, B., "Large-scale Schema-free Data Deduplication Approach with Adaptive Sliding Window using MapReduce," The Computer Journal, 2015, 58 (11): 3187-3201 (EI: 20154801604848, WOS:000365157000025, IF:1, CCF B类)
  • Ma, K. and Yang, B., "Stream-based Live Data Replication Approach of In-memory Cache," Concurrency and Computation: Practice and Experience, 2017, 29 (11): e4052: 1-9 (WOS: , IF: 1.133, EI: 20170703347349, CCF C类)
  • Kun Ma, Bo Yang, and Ziqiang Yu, "Optimization of Stream-based Live Data Migration Strategy in the Cloud," Concurrency and Computation: Practice and Experience, 2017, online (): 1-23 (WOS: , IF: 1.133, EI: , CCF C类)
  • Ziqiang Yu, Yuehui Chen, Kun Ma*, "Real-time processing of k-NN queries over moving objects," Soft Computing, 2017, 21 (18): 5181-5191 (EI: 20165003117640, WOS: , IF: 2.472, CCF C类)
  • Kun Ma, Ziqiang Yu, Ke Ji, Bo Yang, Stream-based Live Probabilistic Topic Computing and Matching, Proceedings of the 17th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2017), Part II, Lecture Notes in Computer Science, 10393, Helsinki, Finland, Aug. 21-23, 2017, 397-406 (EI: , INSPEC:, WOS:, CCF C类)
  • Ke Ji, Zhenxiang Chen, Runyuan Sun, Kun Ma, Zhongjie Yuan, Guandong Xu, "GIST: A Generative Model with Individual and Subgroup-based Topics For Group Recommendation," Expert Systems with Applications, 2018, 94: 81-93 (WOS: , IF: 3.928, EI: , CCF C类, Q2)
  • Ma, K., Tang, Z., Zhong, J., Yang, B., LPSMon: A Stream-based Live Public Sentiment Monitoring System, Proceedings of The 17th International Conference on Web-Age Information Management, Part II, Lecture Notes in Computer Science , Nanchang, China, June 3-5, 2016, 9659: 534-536 (EI: 20162702570719, WOS:000389411500045, CCF C类)
  • Ma, K., Yang, B., Access-aware In-memory Data Cache Middleware for Relational Databases, Proceedings of 17th IEEE International Conference on High Performance Computing And Communications (HPCC 15), New York, USA, August 24 - 26, 2015, 1506-1511 (EI: 20161402178126, INSPEC:15635096, WOS:000380408100247, CCF C类)
  • Ma, K., Yang, B., and Chen, G., DOI Proxy Framework for Automated Entering and Validation of Scientific Papers, Proceedings of the 14th International Conference on Web-Age Information Management (WAIM 2013), Lecture Notes in Computer Science, Qinhuangdao, China, June 14-16, 2013, 2013, 7923: 799-801 (EI: 20132916507664, CCF C类)

Authored BooksTOP

Patent for InventionTOP

2017

2016

    2015

    2014

      2013

      2012

      Journal PapersTOP

      2018

      • Ziqiang Yu, Fatos Xhafa, Yuehui Chen, Kun Ma, "A Distributed Hybrid Index for Processing Continuous Range Queries over Moving Objects," Soft Computing, 2018, ():
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        BiBTeX

      • Ke Ji, Zhenxiang Chen, Runyuan Sun, Kun Ma, Zhongjie Yuan, Guandong Xu, "GIST: A Generative Model with Individual and Subgroup-based Topics For Group Recommendation," Expert Systems with Applications, 2018, 94 (): 81-93 (WOS: , IF: 3.928, EI: 20174404359833, CCF C类, Q2)
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        In this paper, a Topic-based probabilistic model named GIST is proposed to infer group activities, and make group recommendations. Compared with existing individual-based aggregation methods, it not only considers individual members’ interest, but also consider some subgroups’ interest. Intuition might seem that when a group of users want to take part in an activity, not every group member is decisive, instead, more likely the subgroups of members having close relationships lead to the final activity decision. That motivates our study on jointly considering individual members’ choices and subgroups’ choices for group recommendations. Based on this, our model uses two kinds of unshared topics to model individual members’ interest and subgroups’ interest separately, and then make final recommendations according to the choices from the two aspects with a weight-based scheme. Moreover, the link information in the graph topology of the groups can be used to optimize the weights of our model. The experimental results on real-life data show that the recommendation accuracy is significantly improved by GIST comparing with the state-of-the-art methods.

        BiBTeX

      2017

      • Tianren Luo, Xueyong Li, Xiaoying Luo, Kun Ma*, "Toward Mobile Smart Data File Protection Box," International Journal of Autonomic Computing, 2017, 2 (3): 282-309
          Abstract  BiBTeX

        Abstract

        Aiming at this urgent need of the security protection of mobile intelligent terminal data file, we design a file security box to protect and manage important files in smartphones. The main functions of this file security box are: 1) fingerprint verification; 2) file management; 3) efficient encryption and decryption; 4) adaptive cipher algorithms; 5) separate logical document library; 6) updating the secret key regularly; 7) storing the key securely; 8) reinforcing the safety in enterprise level. Functional tests and performance tests show that the file security box we designed can not only achieve all of the above functionality with excellent user transparency and friendliness but also ensure the safety of important files without effecting users' experience.

        BiBTeX

      • Kun Ma, Bo Yang, and Ziqiang Yu, "Optimization of Stream-based Live Data Migration Strategy in the Cloud," Concurrency and Computation: Practice and Experience, 2017, online (): 1-18 (WOS: , IF: 1.133, EI: , CCF C类)
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        Live data migration in the cloud is responsible to migrate blocks of data from one emigration node to several immigration nodes. However, live data migration strategy is a NP-hard problem like task scheduling. Recently, in-stream processing is a new technique to process large-scale data nearly instantaneously. This framework works fast that all decisions are made without a continuous stream of events. In this paper, we explore a real-time live data migration strategy with stream processing paradigm. First, the nonlinear migration cost model and balance model are introduced as the metrics to evaluate the data migration strategy. Subsequently, a live data migration strategy with particle swarm optimization (PSO) is proposed. Two improvement measures called loop context and particle grouping are proposed. As an improvement of stream processing framework, nested loop context structure is a feed back to support iterative optimization algorithm. As an improvement of PSO, grouping particles before in-stream processing is to speed up the convergence rate of PSO. Afterwards, we rebuild stream processing framework to implement these methods. The experimental results show the best performance of our method.

        BiBTeX

      • Kun Ma, Bo Yang, Zhe Yang, and Ziqiang Yu, "Segment Access-aware Dynamic Semantic Cache in Cloud Computing Environment," Journal of Parallel and Distributed Computing, 2017, 110 (12): 42-51 (WOS: 000411655400005, IF: 1.93, EI: 20172203704604, CCF B类, Q3)
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        In recent years, researches focus on addressing the query bottleneck issue using semantic cache. However, the challenges of this method are how to increase cache hit ratio, decrease the query processing time, and address cache consistency issue. In this paper, we construct segment access-aware dynamic semantic cache for relational databases. Some definitions of semantic segment, probe query, and remainder query are proposed to describe the semantic cache. Then, estimation of the query result is proposed. Next, cache access algorithm of our proposed segment access-aware dynamic semantic cache is presented in case of cache exact hit, cache extended hit, cache partial hit and cache miss. Cache item with effective lifecycle tag is proposed to address cache consistency issue. Finally, experimental results show that this approach performs better than regular semantic cache and decisional semantic cache.

        BiBTeX

      • Ma, K. and Yang, B., "Stream-based Live Data Replication Approach of In-memory Cache," Concurrency and Computation: Practice and Experience, 2017, 29 (11): e4052: 1-9 (WOS: 000400975800008, IF: 1.133, EI: 20170703347349, CCF C类)
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        Replication is a method to keep the consistency of source data and target data. In our previous work of access-aware in-memory data cache middleware for relational databases, the data are easy to be lost in case that power cuts off. Therefore, we investigate a live data replication approach from in-memory data cache to versioning repository in this paper. This method attempts to recover the in-memory data cache from the versioning repository in failure of access-aware in-memory data cache middleware. Although the replication is not a new problem, the state of art of the replication in the context of document stores is not mature. In our paper, we propose a live data replication approach of in-memory document stores using stream processing framework. First, we introduce cell state model to describe the replication process. To infinitely look back to any revision, we enable our proposed cell state model to support copy-modify-merge model to manage the changed data revisions subsequently. Finally, experimental results show that this approach is more suitable for the replication of continuous in-stream changed data compared with MapReduce-based batch replication.

        BiBTeX

        @article{ma2017stream,
          title={Stream-based live data replication approach of in-memory cache},
          author={Ma, Kun and Yang, Bo},
          journal={Concurrency and Computation: Practice and Experience},
          volume={29},
          number={11},
          year={2017},
          publisher={Wiley Online Library}
        }
      • Ziqiang Yu, Yuehui Chen, Kun Ma*, "Real-time processing of k-NN queries over moving objects," Soft Computing, 2017, 21 (18): 5181-5191 (EI: 20165003117640, WOS: 000410259700002, IF: 2.472, CCF C类, Q3)
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        Central to many location-based service applications is the task of processing k-nearest neighbor (k-NN) queries over moving objects. Many existing approaches adapt different index structures and design various search algorithms to deal with this problem. In these works, tree-based indexes and grid index are mainly utilized to maintain a large volume of moving objects and improve the performance of search algorithms. In fact, tree-based indexes and grid index have their own flaws for supporting processing k-NN queries over an ocean of moving objects. A tree-based index (such as R-tree) needs to constantly maintain the relationship between nodes with objects continuously moving, which usually causes a high maintenance cost. Grid index is widely used to support k-NN queries over moving objects, but the approaches based on grid index almost require an uncertain number of iterative calculations, which makes the performance of these approaches not predictable. To address this problem, we present a dynamic Strip Rectangle Index (SRI), which can reach a good balance between the maintenance cost and the performance of supporting k-NN queries over moving objects. SRI supplies two different index granularities that makes it better adapt to handle different data distributions than existing index structures. Based on SRI, we propose a search algorithm called SR-KNN that can rapidly calculate a final region with a filter-and-refine strategy to enhance the efficiency of process k-NN queries, rather than iteratively enlarging the search space like the grid-index-based approaches. Finally, we conduct experiments to fully evaluate the performance of our proposal.

        BiBTeX

        @article{yu2017real,
          title={Real-time processing of k-NN queries over moving objects},
          author={Yu, Ziqiang and Chen, Yuehui and Ma, Kun},
          journal={Soft Computing},
          pages={1--11},
          year={2017},
          publisher={Springer}
        }
      • Ma, K. and Yang, B., "Stream-based Live Entity Resolution Approach with Adaptive Duplicate Count Strategy," International Journal of Web and Grid Services, 2017, 13 (3): 351-373 (WOS: 000408254700007, EI: 20173003969041, IF: 1.105)
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        Recently, researchers have been more concerned about large-scale news and tweet data generated by the social media. Some cloud service providers utilise the data to find public sentiments for the tenants. The challenge is how to clean the big data in the cloud before making further analysis. To address this issue, we propose a new live entity resolution approach at a time to find duplicates from the news and tweet data. We investigate possible solutions to address live entity resolution in the cloud, to make sliding window size adaptive using multistep distance and window size dependent duplicate count strategy with alterable window step, and find duplicates by overlapping boundary objects in adjacent blocks. Finally, our experimental evaluation based on the news data on large datasets shows the high effectiveness and efficiency of the proposed approaches.

        BiBTeX

        @article{ma2017stream,
          title={Stream-based live entity resolution approach with adaptive duplicate count strategy},
          author={Ma, Kun and Yang, Bo},
          journal={International Journal of Web and Grid Services},
          volume={13},
          number={3},
          pages={351--373},
          year={2017},
          publisher={Inderscience Publishers (IEL)}
        }
      • Ma, K. and Yang, B., "Column Access-aware In-stream Data Cache with Stream Processing Framework," Journal of Signal Processing Systems, 2017, 86 (2): 191–205 (EI: 20161102079610, WOS: 000392386900007,IF: 0.893)
        SCImago Journal & Country Rank
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        In recent years, researches focus on addressing the query bottleneck issue of big data, e.g. NoSQL databases, MapReduce and big data processing framework. Although NoSQL databases have many advantages on On-Line Analytical Processing (OLAP), it is a big project to migrate Relational Database Management System (RDBMS) to NoSQL. Therefore, the optimization of RDBMS is still important. In this paper, we construct Column Access-aware In-stream Data Cache (CAIDC) for relational databases, which is an integral part of RDBMS and in-memory cache. Furthermore, a live synchronization approach from physical RDBMS to in-memory data cache using stream processing framework is proposed. On one hand, CAIDC provides low latency while supporting log-based trigger in the presence of updates to maintain data consistency because of stream processing framework. On the other hand, CAIDC translates the frequently accessed data to column-oriented in-memory cache by the column access frequency to ensure heavy h

        BiBTeX

        @article{ma2016column, title={Column Access-aware In-stream Data Cache with Stream Processing Framework},  author={Ma, Kun and Yang, Bo},  journal={Journal of Signal Processing Systems},  pages={1--15},  year={2016},  publisher={Springer}}

      2016

      • Ma, K., Yang, B., and Abraham, A., "Asynchronous Data Translation Framework for Converting Relational Tables to Document Stores ," International Journal of Computers and Applications, 2016, 38 (1): 19-28 (EI: 20171203460071)
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        Although Not Only SQL (NoSQL) techniques have some new features such as query optimization and caching in the era of big data, it is not mature enough to replace traditional Relational Database Management System (RDBMS). In a long period of time, the hybrid solution of RDBMS and NoSQL is a main steam technology. In this paper, we present an asynchronous data framework to translate relational tables into schema-free document stores. The challenge of this framework is how to ensure that the translation is transparent and pervasive to the application with minimal impact on RDBMS performance. To better describe the translation process, we present the intermediate cell state model (CSM) to describe versioning incremental state. We address this challenges by translating the binary log of RDBMS to CSM repository, and the repository is reset to the NoSQL when encountering schema adjustment asynchronously. Finally, we leverage the CSM rectification algorithm and NoSQL synchronization algorithm to implement the whole framework. The experimental results illustrate that this translation has a less minimal impact on RDBMS performance and lower cost than other solutions.

        BiBTeX

        @article{doi:10.1080/1206212X.2016.1188563,author = {Ma,Kun AND Yang,Bo AND Abraham,Ajith},title = {Asynchronous DATA Translation Framework FOR Converting Relational TABLES TO Document Stores},journal = {International Journal of Computers AND Applications},YEAR = {2016},doi = {10.1080/1206212X.2016.1188563},}
      • Ma, K., Teng, H., Du, L., Zhang, K., "Exploring Mobile Instant Messaging and Self-service to Leverage Learner Participation for Collaborative Teaching," International Journal of Continuing Engineering Education and Life-Long Learning, 2016, 26 (3): 330-334 (EI: 20163502753914)
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        With the development of Web 2.0 techniques, more and more learning management systems are developed to assist teaching and learning in higher schools. However, current systems lack interactive interactions between instructors and pupils. To address this limitation, this paper explores mobile instant messaging and self-service to leverage learner participation for collaborative teaching. We design a mobile learning management system using WeChat platform APIs to archive this goal. The architecture, features and discussions are given to present the advantages of this system. Some survey results ranging from adoption, satisfaction and psychological comfort present the feasibility of our system.

        BiBTeX

        @article{ma2016exploring,
          title={Exploring mobile instant messaging and self-service to leverage learner participation for collaborative teaching},
          author={Ma, Kun and Teng, Hao and Du, Lixin and Zhang, Kun},
          journal={International Journal of Continuing Engineering Education and Life Long Learning},
          volume={26},
          number={3},
          pages={330--344},
          year={2016},
          publisher={Inderscience Publishers (IEL)}
        }
      • Ma, K., "A Versioning-based Acceleration Method for Software Online Upgrade," Recent Patents on Computer Science, 2016, 9 (1): 81-88 (EI: 20161402178114)
        SCImago Journal & Country Rank
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        This paper describes Patent Publication Number CN102868731A, titled ”Method and appliance for software online upgrade and downloading acceleration”, issued by State Intellec- tual Property Office of the P.R.C. on January 9, 2013. The patent is based on versioning-based acceleration method for software online upgrade. First, client computer system requests distributed hash table (DHT) nodes to obtain update resources. Second, DHT node discovers resource seeds (version control server) or peers (client systems). Finally, resource seeds send the client a list of applicable updates. The patent’s applicability has been illustrated by efficiently solving software online upgrade problems.

        BiBTeX

        @article{ma2016versioning,
          title={A Versioning-based Acceleration Method for Software Online Upgrade},
          author={Ma, Kun},
          journal={Recent Patents on Computer Science},
          volume={9},
          number={1},
          pages={81--88},
          year={2016},
          publisher={Bentham Science Publishers}
        }
      • Ma, K., Teng, H., Du, L., Zhang, K., "Exploring Model Driven Engineering Method for Teaching Software Engineering," International Journal of Continuing Engineering Education and Life-Long Learning, 2016, 26 (3): 294-308 (EI: 20163502753912)
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        Model-driven engineering (MDE) is an emerging software engineering discipline, which raised the level of abstraction. Although there are best practices in industry, the number of experiences describing how MDE is applied in software engineering teaching in higher school is still limited. In our previous work, students fail to implement a demonstrative system though they can hand in reports in time. In this article, we explore a model-driven engineering method for teaching software engineering. We present several factors affecting team project, and design both semi-model-driven project and code generation project in detail. Finally, we do an in-depth analysis on industrial context, size of project team, roles of university and company, and student satisfaction. Some lessons learned from the experiences of both projects are concluded as choice of pilot project, involvement of company and training before team project. The organisation of both projects is served as an inspiration for higher schools that want to develop a software engineering course.

        BiBTeX

        @article{ma2016exploring,
          title={Exploring mobile instant messaging and self-service to leverage learner participation for collaborative teaching},
          author={Ma, Kun and Teng, Hao and Du, Lixin and Zhang, Kun},
          journal={International Journal of Continuing Engineering Education and Life Long Learning},
          volume={26},
          number={3},
          pages={330--344},
          year={2016},
          publisher={Inderscience Publishers (IEL)}
        }

      2015

      • Ma, K. and Yang, B., "Asynchronous Adaptive Delay Tolerant Index Cache Using In-memory Delta Cell," Informatica, An International Journal of Computing and Informatics, 2015, 39 (4): 443-450 (EI: 20160301821359)
          Abstract  BiBTeX

        Abstract

        Relational database indexes, used to speed up access to data stored in a database, are maintained when data in the source table of the index is modified. Therefore, relational database index management can involve time consuming manual analysis and specialized development efforts, and impose organizational overhead and database usage costs, especially in the context of big data. To address this limitation, this paper proposes an asynchronous adaptive delay tolerant index cache using in-memory delta cell. The contributions of index cache are adaptive management and fine-grained delta cell. Finally, our experimental evaluation shows that this simple index cache has the features such as update efficiency with frequent changes, transparency to developers, and low impact on database performance.

        BiBTeX

        @article{ma2015asynchronous,
          title={Asynchronous adaptive delay tolerant index cache using in-memory delta cell},
          author={Ma, Kun and Yang, Bo},
          journal={Informatica},
          volume={39},
          number={4},
          pages={443},
          year={2015},
          publisher={Slovenian Society Informatika/Slovensko drustvo Informatika}
        }
      • Yu, Z. and Ma, K., "Toward Core Point Evolution Using Water Ripple Model," WSEAS Transactions on Computers, 2015, 14 (Art. #79): 819-825
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        This article presents software library for the Arduino platform which significantly improves the speed of the functions for digital input and output. This allows the users to apply these functions in whole range of applications, without being forced to resort to direct register access or various 3rd party libraries when the standard Arduino functions are too slow for given application. The method used in this library is applicable also to other libraries which aim to abstract the access to general purpose pins of a microcontroller.

        BiBTeX

        @article {YuToward2015, title={Toward Core Point Evolution Using Water Ripple Model}, author={Zhibing Yu and Kun Ma}, journal={WSEAS Transactions on Computers}, pages={819-825}, year={2015}, volume={14}, number={Art. #79}}
      • Ma, K. and Yang, B., "Large-scale Schema-free Data Deduplication Approach with Adaptive Sliding Window using MapReduce," The Computer Journal, 2015, 58 (11): 3187-3201 (EI: 20154801604848, WOS:000365157000025, IF:1, CCF B类)
        SCImago Journal & Country Rank
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        Data deduplication is the task of identifying all groups of objects within one or several data sets, respectively. However, this task will become difficult in the context of big data. To address this limitation, we propose a new schema-free data deduplication approach in parallel in the aspect of breeding data deduplication related to food safety. Although MapReduce framework enables efficient parallel execution of data-intensive tasks, it cannot find duplicates in adjacent block. Furthermore, current deduplication approaches with MapReduce are restricted to fixed sliding window. Therefore, we investigate possible solutions to improve current deduplication approaches with MapReduce, to make sliding window size adaptive using adaptive multiple duplicate count strategy with alterable window step, and find duplicates by overlapping boundary objects in adjacent blocks. Moreover, we propose a multi-pass Partition-Sort-Map-Reduce approach with adaptive sliding window to speed up the deduplication process. Finally, our experimental evaluation based on the breeding data on large datasets shows the high effectiveness and efficiency of the proposed approaches.

        BiBTeX

        @article {MaLarge2015, title={Large-scale Schema-free Data Deduplication Approach with Adaptive Sliding Window using MapReduce}, author={Kun Ma and Fusen Dong and Bo Yang}, journal={The Computer Journal}, pages={1-15}, year={2015}, volume={58}}
      • Ma, K., Tang, Z., Yang, Z., Yao, S., "AtMe: An Online Multi-tenant Social Networking Service in Campus," International Journal of Database Theory and Application, 2015, 8 (5): 183-194 (EI: 20161002078171)
          Abstract  BiBTeX

        Abstract

        Recently, more and more undergraduates have turned Internet to find support and take part in society in campus. However, current SNS systems are not oriented to a specific campus. In this paper, we design an online multi-tenant social networking service in campus, including At Helper and At Society. At Helper aims at improving the success ratio of the help process with a multi-tenant architecture, and At Society provides social services using popular instant messaging mobile application. Both modules change the traditional operation and maintenance to rent services. Besides, the key innovative design, such as multi-tenancy and access-aware data cache, are discussed in detail.

        BiBTeX

        @article{MaAtMe2015,  title={AtMe: An Online Multi-tenant Social Networking Service in Campus},  author={Kun Ma and Zijie Tang and Zhe Yang and Shuwei Yao},  journal={nternational Journal of Database Theory and Application},  volume={8}, number={5} , pages={183-194},  year={2015}}
      • Ma, K., Dong, F., "Live Data Migration Approach from Relational Tables to Schema-free Collections with MapReduce," International Journal of Services Technology and Management , 2015, 21 (4/5/6): 318-335 (EI: 20160201785010)
        SCImago Journal & Country Rank
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        Although NoSQL has some new features to address the query bottleneck of big data, the hybrid solution of relational database and NoSQL will last for a long period. Therefore, recent researches focus on the data migration issue from relational database to document stores. However, there are few publications on live data migration in parallel. In this paper, we attempt to address this old problem using new MapReduce framework. The process of migration consists of log-based change data capture, merging of changed data, and blocking and transformation. We utilize predicate logic of mathematical relation and QVT relations to describe the mapping rules clearly. Finally, our experimental evaluation of log-based blocking and transformation with MapReduce shows the higher effectiveness and efficiency than current methods.

        BiBTeX

        @article {MaLive2015, title={Live Data Migration Approach from Relational Tables to Schema-free Collections with MapReduce}, author={Kun Ma and Fusen Dong}, journal={International Journal of Services Technology and Management}, pages={1-15}, year={2015}, volume={21}, number={online}}
      • Dong, F., Yang, B., Ma, K., and Wang, W., "Incremental duplicate data detection method with MapReduce," Journal of University of Jinan (Science and Technology), 2015, 29 (4): 241-245
          Abstract  BiBTeX

        Abstract

        针对重复数据检测过程中增量数据重复值检测问题进行分析,在基本近邻排序算法基础上,提出增量近邻排序比较算法。该算法通过跳动窗口形式比较相邻数据,大大减少了数据比较次数;同时引入MapReduce模型对该算法加以改进以提高其海量数据处理的能力。实验表明,改进后的增量近邻排序比较算法在保证检则结果准确的前提下,能够有效提高增量数据重复检测的速度,并且算法具有较高的稳定性,更适应海量数据环境中重复数据检测任务。

        BiBTeX

        @article{董富森2015mapreduce,  title={MapReduce 模型下增量重复数据检测方法},  author={董富森 and 杨波 and 马坤 and 王文华},  journal={济南大学学报 (自然科学版)},  volume={4},  pages={001},  year={2015}}
      • Dong, F., Ma, K., and Yang, B., "Cache System for Frequently Updated Data in the Cloud," WSEAS Transactions on Computers, 2015, 14 (Art. #17): 163-170
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        Maintaining data indexes and query cache becomes the bottleneck of the database, especially in the context of frequently updated data. In order to reduce the burden of the database, a cache system for frequently updated data has been proposed in this paper. In the system, update statements are parsed firstly. Then updated data are saved as key-value pairs in the cache and they are synchronized into the database at idle time. Experimental results show that the proposed cache system cannot only accelerate the data updating rate, but also improve the data writing ability in maintaining indexes and consistency of cache data greatly.

        BiBTeX

        @article {DongCache2015, title={Cache System for Frequently Updated Data in the Cloud}, author={Fusen Dong and Kun Ma and Bo Yang}, journal={WSEAS Transactions on Computers}, pages={163-170}, year={2015}, volume={14}, number={Art. #17}}
      • Ma, K., and Zhang, W., "Introducing Browser-based High-Frequency Cloud Monitoring System using WebSocket Proxy," International Journal of Grid and Utility Computing, 2015, 6 (1): 21-29 (EI:20145200372356)
        acceptance rate: 11/69=15.9%
        SCImago Journal & Country Rank
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        Currently, monitoring Cloud resources is becoming a priority. It is a very important link of building B/S monitoring systems to gather the data from the Clouds. However, one of the key challenges that holds Cloud monitoring is that, B/S monitoring systems lack the support of the high-frequency monitoring. To address this limitation, this paper aims to provide an high-frequency monitoring approach to integrate with Clouds. We design a WebSocket proxy as the high-speed and low-overhead communication interface between browsers and servers. Moreover, we introduce a browser-based high-frequency Cloud monitoring system (BHCMS) to enable a new monitoring of dynamic and responsive applications. The important finding of this paper is that monitoring data is updated in the browser at a rate of high frequency, without using any browser plug-ins. The proposed WebSocket proxy also provides WebSocket emulation for those browsers without native WebSocket capability transparently, to support a wide variety of popular legacy browsers. The experimental results show that the average latency time of our WebSocket monitoring system is generally lower than polling, FlashSocket and Socket solution. Finally, the article concludes with a brief discussion of possible future activities, which might be pursued to enable the other similar monitoring to benefit from this technology.

        BiBTeX

        @article {MaIntroducing2015, title={Introducing Browser-based High-Frequency Cloud Monitoring System using WebSocket Proxy}, author={Kun Ma and Weijuan Zhang}, journal={International Journal of Grid and Utility Computing}, pages={21-29}, year={2015}, volume={6}, number={1}}
      • Ma, K., and Abraham, A., "Introducing Versioning-based Software Online Upgrade Framework over a Peer-to-Peer Network," Computing and Informatics, 2015, 34 (6): 1357-1373 (WOS: 000370996500007, IF: 0.524)
        SCImago Journal & Country Rank
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        BiBTeX

      • Ma, K., and Yang, B., "Introducing Extreme Data Storage Middleware of Schema-free Document Stores using MapReduce," International Journal of Ad Hoc and Ubiquitous Computing, 2015, 20 (4): 274–284 (WOS: 000366130900006, EI: 20155201714641, IF: 0.489)
        SCImago Journal & Country Rank
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        Referred to NoSQL, schema-free databases feature elasticity and scalability in combination with a capability to store big data and work with Cloud computing systems, all of which make them extremely popular. In particular, the creation of the data warehouse is gaining a significant momentum. Although large corporate early adopters paved the way, since then, data warehousing has been embraced by organizations of all sizes. However, there are few publications on data warehouse of NoSQL. In this paper, an extreme data storage middleware (EDSM) of schema-free document stores using MapReduce is presented to address the issue of formulating no redundant data warehouse with small amount of storage space for the purpose of their composition in a way that utilizes the MapReduce framework. First, the definition of cell with an effective lifecycle tag is given. Second, the architecture and extreme data storage principles are presented. At last, the capture-map-reduce procedures are discussed to create the NoSQL data warehouse. The experiment is shown to successfully build the NoSQL data warehouse reducing data redundancy compared with document with timestamp and lifecycle tag solutions. Our experiment also provides insight into some of the key challenges and shortcomings that researchers and engineers face when designing the data warehouse middleware.

        BiBTeX

        @article {Ma2015Introducing, title={Introducing Extreme Data Storage Middleware of Schema-free Document Stores using MapReduce}, author={Kun Ma and Bo Yang}, journal={International Journal of Ad Hoc and Ubiquitous Computing}, pages={274–284}, year={2015}, volume={20}, number={4}}
      • Ma, K., and Yang, B., "Experiences in Teaching Virtualization with Private Cloud Platform," International Journal of Continuing Engineering Education and Life-Long Learning, 2015, 25 (3): 301-314 (EI:20154601545750)
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        BiBTeX

      2014

      • Ma, K., Teng, H., Du, L., Zhang, K., "Project-Driven Learning-by-Doing Method for Teaching Software Engineering using Virtualization Technology," International Journal of Emerging Technologies in Learning, 2014, 9 (9): 26-31 (EI:20144900275315)
        SCImago Journal & Country Rank
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        Many universities are now offering software engineering an undergraduate level emphasizing knowledge point. However, some enterprise managers reflected that education ignore hands-on ability training, and claimed that there is the isolation between teaching and practice. This paper presents the design of a Software Engineering course (sixth semester in network engineering) at University of Jinan for undergraduate Software Engineering students that uses virtualization technology to teach them project-driven learning-by-doing software development process. We present our motivation, challenges encountered, pedagogical goals and approaches, findings (both positive experiences and negative lessons). Our motivation was to teach project-driven Software Engineering using virtualization technology. The course also aims to develop entrepreneurial skills needed for software engineering graduates to better prepare them for the software industry. Billing models of virtualization help pupils and instructors find the cost of the experiment. In pay-as-you-go manner, two labs and three step-by-step projects (single project, pair project, and team project) are designed to help the students to complete the assignment excitedly. We conduct some detailed surveys and present the results of student responses. The assessment process designed for this course is illustrated. The paper also shows that learning-by-doing method correlates with the characteristics of different projects, which has resulted in a successful experience as reported by students in an end of a semester survey.

        BiBTeX

        @article {MaProject2014, title={Project-Driven Learning-by-Doing Method for Teaching Software Engineering using Virtualization Technology}, author={Kun Ma, Hao Teng, Lixin Du, and Kun Zhang}, journal={International Journal of Emerging Technologies in Learning}, pages={26-31}, year={2014}, volume={9}, number={9}}
      • Ma, K., and Yang, B., "Multiple wide tables with vertical scalability in multitenant sensor cloud systems," International Journal of Distributed Sensor Networks, 2014, 2014 (): 10 pages (EI: 20141917689293, WOS: 000334228200001, IF: 0.923)
        SCImago Journal & Country Rank
        acceptance rate: 37%
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        Software-as-a-service (SaaS) has emerged as a new computing paradigm to provide reliable software on demand. With such an inspiring motivation, sensor cloud system can benefit from this infrastructure. Generally, sharing database and schema is the most commonly used data storage model in the cloud. However, the data storage of tenants in the cloud is approaching schema null and evolution issues. To address these limitations, this paper proposes multi-tenant multiple wide tables with vertical scalability by analyzing the features of multi-tenant data. To solve schema null issue, extended vertical part is used to trim down the amount of schema null values. To reduce probability of schema evolution, wide table is divided into multiple clusters that we called multiple wide tables. This design reaches the balance between tenant customizing and its performance. Besides, the partition and correctness of multiple wide tables with vertical scalability are discussed in detail. The experimental results indicate that the solution of our multiple wide tables with vertical scalability is superior to single wide table, and single wide table with vertical scalability in the aspects of spatial intensity and read performance.

        BiBTeX

        @article {MaMultiple2014, title={Multiple Wide Tables with Vertical Scalability in Multi-tenant Sensor Cloud Systems}, author={Kun Ma and Bo Yang}, journal={International Journal of Distributed Sensor Networks}, pages={10 pages}, year={2014}, volume={2014}, number={Article ID 583686}}
      • Ma, K., Zhang, W., and Tang, Z., "Toward Fine-grained Data-level Access Control Model for Multi-tenant Applications," International Journal of Grid and Distributed Computing, 2014, 7 (2): 79-88 (EI: 20142017707412)
          Abstract  BiBTeX  Abstract  BiBTeX

        Abstract

        Cloud computing presents new security and privacy challenges to control access to multi-tenant applications in the cloud. However, this solution has more challenges once the number of access control list (ACL) increases in the cloud, such as efficiency of policy resolution, multi-tenancy and data isolation. To address these limitations, this paper describes a fine-grained data-level access control model (FDACM) suitable for multi-tenant applications where role-based and data-based access control are both supported. Lightweight expressions are proposed to present complicated policy rules in our solution. Moreover, we discuss the most important part of FDACM in detail: query privilege model and decision privilege model. Furthermore, we also propose the architecture and authorization procedure which implements these two models. Some technical implementation details together with the performance results from the prototype are provided. Finally, a case study of FDACM is illustrated to evaluate the effect of the application in practice.

        BiBTeX

        @article {MaToward2014, title={Toward Fine-grained Data-level Access Control Model for Multi-tenant Applications}, author={Kun Ma and Weijuan Zhang and Zijie Tang}, journal={International Journal of Grid and Distributed Computing}, pages={79-88}, year={2014}, volume={7}, number={2}}
      • Ma, K., and Zhang, L., "Bookmarklet-triggered Unified Literature Sharing System in the Cloud," International Journal of Grid and Utility Computing, 2014, 5 (4): 217-226 (EI: 201444146172)
        special issue acceptance rate: 5/27=18.5%
        SCImago Journal & Country Rank
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        Currently, modern researchers need convenient approaches and tools for sharing the literature what is available to them. For the purpose of simplifying the literature sharing and elaborating the dynamic role of the human being, we introduce a bookmarklet-triggered unified literature sharing system (BULSS) in the Cloud. After clicking the bookmarklet, the sidebar is displayed on the web. In this system, the related literature is pushed to the researchers automatically. The methodology to design the sidebar client, Cloud process engine and bookmarklet is presented. Besides, the architectural details of the components are described. This system allows easy manipulation of the literature sharing and academic exchange, which are used frequently and are very often necessary in scientific activity such as research, writing papers and dissertations, and preparing reports.

        BiBTeX

        @article {MaBookmarklet2014, title={Bookmarklet-triggered Unified Literature Sharing System in the Cloud}, author={Kun Ma and Lei Zhang}, journal={International Journal of Computers and Applications}, pages={217-226}, year={2014}, volume={5}, number={4}}
      • Ma, K., and Tang, Z., "An Online Social Mutual Help Architecture for Multitenant Mobile Clouds," International Journal of Intelligent Information and Database Systems, 2014, 8 (4): 359-374 (EI: 20151500735359)
        SCImago Journal & Country Rank
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        Social mutual help is generally defined as an exchange of verbal and non-verbal messages which convey a plea for help. Recently, more and more people have turned Internet to find support and share their experiences. However, the success rate of this online social mutual help is relatively low. Besides, clients are forced to purchase a software to provide services to their users with high cost. Therefore, we aim at improving the success ratio of the help process with a multi-tenant architecture. In this paper, we design an online social mutual help architecture for multi-tenant mobile Clouds. First, we propose a helper recommendation algorithm to accelerate the help process. Second, we present the integration schema of push and pull to propagate the feeds to the potential helpers. Third, we provide some RESTful Web service APIs for the integration with third-party systems. The experimental results show that this architecture improves the success rate and performance successfully and provides the support of data customizing of tenants to increase the sparsity.

        BiBTeX

        @article{ma2015online,  title={An Online Social Mutual Help Architecture for Multitenant Mobile Clouds},  author={Ma, K and Tang, Z},  journal={International Journal of Intelligent Information and Database Systems, online},  year={2015}}
      • Tang, Z. and Ma, K., "RSSCube: A Content Syndication and Recommendation Architecture," International Journal of Database Theory and Application, 2014, 7 (4): 237-248 (EI:20143718151244)
          Abstract  BiBTeX

        Abstract

        Content syndication is the process of pushing the information out into third-party information providers. The idea is to drive more engagement with your content by wiring it into related digital contexts. However, there are some shortages of current related products, such as search challenges on massive feeds, synchronization performance, and user experience. To address these limitations, we aim to propose an improved architecture of content syndication and recommendation. First, we design a source listener to extract feed changes from different RSS sources, and propagate the incremental changes to target schema-free document stores to improve the search performance. Second, the proposed recommendation algorithm is to tidy, filter, and sort all the feeds before pushing them to the users automatically. Third, we provide some OAuth2-authorization RESTful feed sharing APIs for the integration with the third-party systems. The experimental result shows that this architecture speeds up the search and synchronization process, and provides friendlier user experience.

        BiBTeX

        @article {TangRSSCube2014, title={RSSCube: A Content Syndication and Recommendation Architecture}, author={Zijie Tang and Kun Ma}, journal={International Journal of Database Theory and Application}, pages={237-248}, year={2014}, volume={7}, number={4}}
      • Ma, K., Dong, F. and Yang, B., "Incremental Object Matching Approach of Schema-free Data with MapReduce," International Journal of Computers and Applications, 2014, 36 (2): 72-77 (EI: 20143718148180)
        SCImago Journal & Country Rank  Abstract  BiBTeX

        Abstract

        Object matching is a traditional deduplication approach, that is used to identify the duplicates within one or several data sets respectively. However, this task will become difficult in the context of big data. Few publications have mentioned incremental methods to solve this legacy issue in parallel. To address this limitation, we aim to propose an incremental object matching approach (IOMMapReduce) in parallel. We investigate possible solutions to improve current object matching approaches with MapReduce, to make it support incrementality to speed up the deduplication process. Finally, our experimental evaluation on large data sets shows the high effectiveness and efficiency of the proposed approaches.

        BiBTeX

        @article {MaIncremental2014, title={Incremental Object Matching Approach of Schema-free Data with MapReduce}, author={Kun Ma and Fusen Dong and Bo Yang}, journal={International Journal of Computers and Applications}, pages={72-77}, year={2014}, volume={36}, number={2}}
      • Ma, K., and Yang, B., "A Simple Scheme for Bibliography Acquisition using DOI Content Negotiation Proxy," The Electronic Library, 2014, 32 (6): 806-824 (WOS: 000346109800003, IF:0.436)
        SCImago Journal & Country Rank
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        Purpose
        – This paper aims to study a bibliography acquisition approach to verify the bibliography by author name from the integrated system and the metadata from the digital object identifier (DOI) content negotiation proxy. As managed scientific research papers increase at a higher rate, an accurate and automated scheme for bibliography acquisition is desirable.
        Design/methodology/approach
        – This study develops a framework using DOI content negotiation proxy as context for the entering of the bibliography. The bibliography acquisition architecture is composed of three point of views to reduce the complexity: terminal UI, service deployed in the cloud and DOI content negotiation proxy. To simplify the service interface and support many kinds of bibliographic formats, this paper presents the independent BibModel and its template-based model transformation engine to support rich bibliographic records.
        Findings
        – An important finding of this article is that we do some significant development work to combine the open CrossCite DOI content service and DOI resolvers of registry agencies. As more than 95 per cent of DOIs are owned or managed by CrossRef, DataCite, ISTIC and mEDTA DOI registry agencies, it is a common universal approach for the scientific research paper results with DOIs.
        Practical implications
        – Through a simple method built quickly from freely available parts, it is partially successful, suggesting the scheme can be integrated with third-party systems, such as the management system of scientific research results and the electronic journal management system. The analysis of the application’s effect shows the ability to verify the authenticity of the paper by author name from the system and the metadata from our DOI content negotiation proxy.
        Originality/value
        – This paper proposes an original and simple framework to acquire the metadata of bibliographies automatically. No detailed evaluative study has been carri

        BiBTeX

        @article {MaA2014, title={A simple scheme for bibliography acquisition using DOI content negotiation proxy}, author={Kun Ma and Bo Yang}, journal={The Electronic Library}, pages={806-824}, year={2014}, volume={32}, number={6}}

      2013

      • Ma, K., "A Simple Model Transformation Approach Based on Textual Template," AISS: Advances in Information Sciences and Service Sciences, 2013, 5 (3): 676-683
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        Model transformation is a focused area in Model-Driven Engineering (MDE). With the help of model transformation, it is possible to generate source codes, and target models from the source models. In this paper, we proposed a simple model transformation approach based on textual template. The proposed framework used a novel platform-specific business object model (PSM-BO) to sufficiently describe both the structural and behavioral properties of generic enterprise Web applications. In addition, the formalism of template and template statement was introduced to present the template-based model transformation rule. With the extension of template plugins, this approach can generate the codes of different target platforms. Finally a case study of Natural Science Foundation Management System was demonstrated how to build PSM-BOs and transform them into the final system. The distribution and uninterrupted running of this system proves that our approach is feasible and correct in practice.

        BiBTeX

      • Ma, K., and Sun, R., "Introducing WebSocket-based Real-time Monitoring System for Remote Intelligent Buildings," International Journal of Distributed Sensor Networks, 2013, 2013 (): 10 pages (EI: 20140817346647, WOS:000328757100001, IF: 0.923)
        SCImago Journal & Country Rank
        acceptance rate: 39%
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        Today wireless sensor networks (WSNs) in electronic engineering are used in the monitoring of remote intelligent buildings, and the need for emerging Web 3.0 is becoming more and more in every aspect of electronic engineering. However, the key challenges of monitoring are the monitoring approaches and storage models of huge historical monitoring data. To address these limitations, we attempt to design a WebSocket-based real-time monitoring system for remote intelligent buildings. On one hand, we utilize the latest HTML5 WebSocket, Canvas and Chart technologies to monitor the sensor data collected in WSNs in the Web browser. The proposed monitoring system supports the latest HTML5 browsers and legacy browsers without native WebSocket capability transparently. On the other hand, we propose a storage model with lifecycle to optimize the NoSQL data warehouse. Finally, we have made the monitoring and storage experiments to illustrate the superiority of our approach. The monitoring experimental results show that the average latency time of our WebSocket monitoring is generally lower than polling, FlashSocket and Socket solution, and the storage experimental results show that our storage model has low redundancy rate, storage space and latency.

        BiBTeX

        @article {MaIntroducing2013, title={Introducing WebSocket-based Real-time Monitoring System for Remote Intelligent Buildings}, author={Kun Ma and Runyuan Sun}, journal={International Journal of Distributed Sensor Networks}, pages={10 pages}, year={2013}, volume={2013}, number={Article ID 867693}}
      • Ma, K., Sun, R., and Abraham, A., "Toward a module-centralized and aspect-oriented monitoring framework in clouds," Journal of Universal Computer Science, 2013, 19 (15): 2241-2265 (WOS: 000329491500006, IF: 0.401)
        SCImago Journal & Country Rank
        Scopus Document   Scopus Citeby  Abstract  BiBTeX

        Abstract

        Currently, monitoring plays an important role in managing the Cloud computing environment. However, the Cloud computing owners and tenants often lack the management and monitoring tools to ensure the performance, robustness, dependability, and security. To address this limitation, this paper describes the development of a lightweight module-centralized and aspect-oriented monitoring framework. This framework performs end-to-end measurements at virtual and physical machine instances, software and Web service in the Cloud. It monitors the quality of service (QoS) parameters of the IaaS and SaaS layer in the forms of plug-in bundles. In addition, we discuss the manager-agent monitoring of entity objects and aspect-oriented Cloud service monitoring in detail. All the modules constitute the entire proposed framework to improve the performance in hybrid Clouds.

        BiBTeX

        @article {MaToward2013, title={Toward a module-centralized and aspect-oriented monitoring framework in clouds}, author={Kun Ma and Runyuan Sun and Ajith Abraham}, journal={Journal of Universal Computer Science}, pages={2241-2265}, year={2013}, volume={19}, number={15}}

      2012

      2011

      2010

      • Sun, R., Ma, K., Chen, Z., Peng, L., and Jing, S., "A Network Utilization Measurement Method Based Enhanced Maximum Traffic Accumulation," Journal of Northeastern University (Natural Science), 2010, 31 (2A): 254-257 (EI: 20111313875047)
        SCImago Journal & Country Rank
        Scopus Document
      •   Abstract  BiBTeX

        Abstract

        BiBTeX

      • Ma, K., Yang, B., Chen, Z., Li, Q., and Cui, L., "Research of Model-driven Web Application Rapid Development Platform," Computer Science, 2010, 37 (11A): 29-33
          Abstract  BiBTeX

        Abstract

        BiBTeX

      Conference PapersTOP

      2018

        2017

        2016

        • Zhibing Yu, Kun Ma and Bo Yang, Core Point Paradigm and Evolution with Water Ripple Model, Proceedings of the 2016 10th International Conference on Complex, Intelligent, and Software Intensive Systems (CISIS 2016), Fukuoka, Japan, Jul. 6-8, 2016, 357-362 (EI: 20170603321485, WOS:000391528700054)
        • Yang, Z., Ma, K.*, Zhong, J., Toward a Semantic Cache Supporting Version-based Consistency, Proceedings of 2016 10th International Conference on Complex, Intelligent, and Software Intensive Systems (CISIS 2016), Fukuoka, Japan, Jul. 6-8, 2016, 367-372 (EI: 20170603321487, WOS:000391528700056)
        • Wu, J., Yang, B., Wang, L., Ma, K., Zhao, X., Zhou, J., MRF parameter estimation based on weighted Least Squares Fit method, Proceedings of 2016 3rd International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS), Jin Zhou, China, Aug. 26-28, 2016, 164-169 (EI: 20164603016571)
        • Yu, Z., Yu, X., Chen, Y., and Ma, K., Distributed Top-k Keyword Search over Very Large Databases with MapReduce, Proceedings of 2016 IEEE International Congress on Big Data (BigData Congress 2016), San Francisco, USA, June 27-July 2, 2016, 349-352 (EI: 20164603008976, WOS:000390212200048)
        • Ma, K., Tang, Z., Zhong, J., Yang, B., LPSMon: A Stream-based Live Public Sentiment Monitoring System, Proceedings of The 17th International Conference on Web-Age Information Management, Part II, Lecture Notes in Computer Science , Nanchang, China, June 3-5, 2016, 9659: 534-536 (EI: 20162702570719, WOS:000389411500045, CCF C类)
          Acceptance Rate: 88/236=37.2%, Research Acceptance Rate: 80/219=36.5%, Demo Acceptance Rate: 8/17=47%
          Demo details from here.

        2015

        2014

        2013

        2012

        2011

        2010

        Edited ProceedingsTOP

        2017

          2016

            2015

            2014

            2013

            2012

              2011

                2010

                  Edited Special IssueTOP

                  2014

                  • Kun Ma, Ajith Abraham, Special Issue on Innovative Applications for the Cloud, International Journal of Grid and Utility Computing, 5 (4), 2014 CFP Published Issue

                  Utility ModelTOP

                  2017

                    2016

                    2015

                    2014

                    • 实用新型(申请号:201320245920.0, 2013-05-09), 授权日期:2014-03-06. 一种可转动毛刷. 申请人: 董富森, 发明人: 董富森, 马坤. (granted).

                    Software CopyrightTOP

                    2017

                    • 软件著作权( 2017SR473062, 2017-08-28). 基于密码学的移动终端文件保护软件. 著作权人: 济南大学, 联系人:罗天任、马坤.
                    • 软件著作权( 2017SR381599, 2017-07-19). 基于无线局域网的二维码智能扫描点餐系统. 著作权人: 济南大学, 联系人:罗天任、马坤.

                    2016

                      2015

                      • 软件著作权( 2015SR066396, 2015-04-22). 艾特我智能校园系统. 著作权人: 济南大学, 联系人:马坤.
                      • 软件著作权( 2015SR044942, 2015-03-13). 学位论文评审管理系统. 著作权人: 济南大学, 联系人:马坤.
                      • 软件著作权( 2015SR263003, 2015-12-16). 面向服务的多租户通用微信公众系统 . 著作权人: 济南大学, 联系人:马坤.
                      • 软件著作权( 2015SR263158, 2015-12-16). 面向服务的多用户大规模开放在线课程系统 . 著作权人: 济南大学, 联系人:马坤.
                      • 软件著作权( 2015SR264722, 2015-12-17). 模块化社交管理系统. 著作权人: 济南大学, 联系人:马坤.
                      • 软件著作权( 2015SR261885, 2015-12-16). 模块化内容管理系统(UJNCMS). 著作权人: 济南大学, 联系人:马坤.

                      2014

                      • 软件著作权( 2014SR040751, 2014-04-10). 国际化学术团队会员管理系统. 著作权人: 济南大学, 联系人:马坤.
                      • 软件著作权( 2014SR041170, 2014-04-10). 基于版本控制的软件在线升级系统. 著作权人: 济南大学, 联系人:马坤.
                      • 软件著作权( 2014SR040968, 2014-04-10). 艾特我互助社交平台. 著作权人: 济南大学, 联系人:马坤.
                      • 软件著作权( 2014SR041153, 2014-04-10). RSS魔方资讯订阅系统. 著作权人: 济南大学, 联系人:马坤.

                      2013

                      • 软件著作权( 2013SR118729, 2013-11-04). 基于DOI的文献元数据抽取系统. 著作权人: 济南大学, 联系人:马坤.
                      • 软件著作权( 2013SR075316, 2013-07-27). 多平台虚拟化环境集成管理系统. 著作权人: 济南大学, 联系人:马坤.

                      ThesisTOP

                      2011

                      2007