Wenyuan Liu^1,2, Zijuan Liu^1,*, Lin Wang¹, Binbin Li¹, Nan Jing¹

Computer Systems Science and Engineering, Vol.33, No.2, pp. 137-147, 2018, DOI:10.32604/csse.2018.33.137

Abstract In recent years, movement detection and gait recognition methods using different techniques emerge in an endless stream. On the one hand, wearable sensors need be worn by the detecting target and the method based on camera requires line of sight. On the other hand, radio frequency signals are easy to be impaired. In this paper, we propose a novel multi-layer filter of channel state information (CSI) to capture moving individuals in dynamic environments and analyze his/her gait periodicity. We design and evaluate an efficient CSI subcarrier feature difference to the multi-layer filtering method leveraging principal More >

Yong Zhang^1,2, Jing Cai¹, Quanlin Li¹

Computer Systems Science and Engineering, Vol.33, No.2, pp. 125-135, 2018, DOI:10.32604/csse.2018.33.125

Abstract Extensible Markup Language (XML) is commonly employed to represent and transmit information over the Internet. Therefore, how to effectively search for keywords of massive XML data becomes a new issue. In this paper, we first present four properties to improve the classical ILE algorithm. Then, a kind of parallel XML keyword search algorithm, based on intelligent grouping to calculate SLCA, is proposed and realized under MapReduce programming model. At last, a series of experiments are implemented on 7 datasets of different sizes. The obtained results indicate that the proposed algorithm has high execution efficiency and More >

Wenyu Qu¹, Zhiyang Li^2,*, Junfeng Wu², Yinan Wu³, Zhaobin Liu²

Computer Systems Science and Engineering, Vol.33, No.2, pp. 115-123, 2018, DOI:10.32604/csse.2018.33.115

Abstract Conventional image skeletonization techniques implicitly assume the pixel level connectivity. However, noise inside the object regions destroys the connectivity and exhibits sparseness in the image. We present a skeletonization algorithm designed for these kinds of sparse shapes. The skeletons are produced quickly by using three operations. First, initial skeleton nodes are selected by farthest point sampling with circles containing the maximum effective information. A skeleton graph of these nodes is imposed via inheriting the neighborhood of their associated pixels, followed by an edge collapse operation. Then a skeleton tting process based on feature-preserving Laplacian smoothing More >

Lufeng Yuan^∗, Erlin Yao, Guangming Tan

Computer Systems Science and Engineering, Vol.33, No.2, pp. 105-113, 2018, DOI:10.32604/csse.2018.33.105

Abstract This paper proposes a machine learning based method which can detect certain events automatically and precisely in biomedical imaging. We detect one important and not well-defined event, which is called flash, in fluorescence images of Escherichia coli. Given a time series of images, first we propose a scheme to transform the event detection on region of interest (ROI) in images to a classification problem. Then with supervised human labeling data, we develop a feature selection technique to utilize support vector machine (SVM) to solve this classification problem. To reduce the time in training SVM model,… More >

Chunjing Xiao^1,∗, Yongwei Qiao², Kewen Xia¹, Yuxiang Zhang³

Computer Systems Science and Engineering, Vol.33, No.2, pp. 95-103, 2018, DOI:10.32604/csse.2018.33.095

Abstract Tourist routes recommendation is a way to improve the tourist experience and the efficiency of tourism companies. Session-based methods divide all users’ interaction histories into the same number sessions with fixed time window and treat the user preference as time sequences. There have few or even no interaction in some sessions for some users because of the high sparsity and temporal characteristics of tourist data. That lead to many session-based methods can not be applied to routes recommendation due to aggravate the sparsity. In order to better adapt and apply the characteristics of tourism data… More >

Chen Yu^∗, Qinmin Hong, Dezhong Yao, Hai Jin

Computer Systems Science and Engineering, Vol.33, No.2, pp. 87-94, 2018, DOI:10.32604/csse.2018.33.087

Abstract The rapid expansion of GPS-embedded devices has showed the emerging new look of location-based services, enabling such offerings as travel guide services and location-based social networks. One consequence is the accumulation of a rich supply of GPS trajectories, indicating individuals’ historical position. Based on these data, we aim to mine the hot route by using a collaborative tensor calculation method. We present an efficient trajectory data processing model for mining the hot route. In this paper, we rst model the individual’s trajectory log, extract sources and destinations, use map matching to get the corresponding road More >

Kehong Zhang, Keqiu Li

Computer Systems Science and Engineering, Vol.33, No.2, pp. 71-85, 2018, DOI:10.32604/csse.2018.33.071

Abstract Today, many applications such as social network and biological network develop rapidly,the graph data will be expanded constantly on a large scale. Some classic methods can not effectively solve this scale of the graph data. In the reachability query, many technologies such as N-Hop, tree, interval labels, uncertain graph processing are emerging, they also solve a lot of questions about reachability query of graph. But, these methods have not put forward the effective solution for the new issues of the multiattribute constraints reachability on directed graph. In this paper, TCRQDG algorithm effectively solves this new More >

Tianqing Zhu¹, Mengmeng Yang¹, Ping Xiong², Yang Xiang¹, Wanlei Zhou¹

Computer Systems Science and Engineering, Vol.33, No.2, pp. 61-69, 2018, DOI:10.32604/csse.2018.33.061

Abstract Online social networks provide an unprecedented opportunity for researchers to analysis various social phenomena. These network data is normally represented as graphs, which contain many sensitive individual information. Publish these graph data will violate users’ privacy. Differential privacy is one of the most influential privacy models that provides a rigorous privacy guarantee for data release. However, existing works on graph data publishing cannot provide accurate results when releasing a large number of queries. In this paper, we propose a graph update method transferring the query release problem to an iteration process, in which a large More >

Heng Qi^1,2, Keqiu Li¹

Computer Systems Science and Engineering, Vol.33, No.2, pp. 57-59, 2018, DOI:10.32604/csse.2018.33.057

Abstract This article has no abstract. More >

Jen-Yuan Yeh^∗

Computer Systems Science and Engineering, Vol.33, No.1, pp. 41-52, 2018, DOI:10.32604/csse.2018.33.041

Abstract As a crucial task in information retrieval, ranking defines the preferential order among the retrieved documents for a given query. Supervised learning has recently been dedicated to automatically learning ranking models by incorporating various models into one effective model. This paper proposes a novel supervised learning method, in which instances are represented as bags of contexts of features, instead of bags of features. The method applies rank-order correlations to measure the correlation relationships between features. The feature vectors of instances, i.e., the 1st-order raw feature vectors, are then mapped into the feature correlation space via More >