Journal of China Universities of Posts and Telecommunications最新文献_第7页

Optimized multiuser detection algorithm for uplink SCMA system 上行链路SCMA系统的优化多用户检测算法

Journal of China Universities of Posts and Telecommunications Pub Date : 2017-02-01 Epub Date: 2017-04-05 DOI: 10.1016/S1005-8885(17)60182-1

Tan Yuxi, Gao Zehua, Guo Siyan, Gao Feng

引用次数: 1

Social media mining and visualization for point-of-interest recommendation 兴趣点推荐的社交媒体挖掘与可视化

Journal of China Universities of Posts and Telecommunications Pub Date : 2017-02-01 Epub Date: 2017-04-05 DOI: 10.1016/S1005-8885(17)60189-4

Ren Xingyi, Song Meina, E Haihong, Song Junde

{"title":"Social media mining and visualization for point-of-interest recommendation","authors":"Ren Xingyi, Song Meina, E Haihong, Song Junde","doi":"10.1016/S1005-8885(17)60189-4","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60189-4","url":null,"abstract":"<div><p>With the rapid growth of location-based social networks (LBSNs), point-of-interest (POI) recommendation has become an important research problem. As one of the most representative social media platforms, Twitter provides various real-life information for POI recommendation in real time. Despite that POI recommendation has been actively studied, tweet images have not been well utilized for this research problem. State-of-the-art visual features like convolutional neural network (CNN) features have shown significant performance gains over the traditional bag-of-visual-words in unveiling the image's semantics. Unfortunately, they have not been employed for POI recommendation from social websites. Hence, how to make the most of tweet images to improve the performance of POI recommendation and visualization remains open. In this paper, we thoroughly study the impact of tweet images on POI recommendation for different POI categories using various visual features. A novel topic model called social media Twitter-latent Dirichlet allocation (SM-TwitterLDA) which jointly models five Twitter features, (i.e., text, image, location, timestamp and hashtag) is designed to discover POIs from the sheer amount of tweets. Moreover, each POI is visualized by representative images selected on three predefined criteria. Extensive experiments have been conducted on a real-life tweet dataset to verify the effectiveness of our method.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 1","pages":"Pages 67-76, 86"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60189-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72228588","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}

引用次数: 3

Modeling and reachability analysis of synchronizing transitions bounded Petri net systems based upon semi-tensor product of matrices 基于矩阵半张量积的同步转移有界Petri网系统的建模与可达性分析

Journal of China Universities of Posts and Telecommunications Pub Date : 2017-02-01 Epub Date: 2017-04-05 DOI: 10.1016/S1005-8885(17)60190-0

Gao Na , Han Xiaoguang , Chen Zengqiang , Zhang Qing

{"title":"Modeling and reachability analysis of synchronizing transitions bounded Petri net systems based upon semi-tensor product of matrices","authors":"Gao Na , Han Xiaoguang , Chen Zengqiang , Zhang Qing","doi":"10.1016/S1005-8885(17)60190-0","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60190-0","url":null,"abstract":"<div><p>The reachability problem of synchronizing transitions bounded Petri net systems (BPNSs) is investigated in this paper by constructing a mathematical model for dynamics of BPNS. Using the semi-tensor product (STP) of matrices, the dynamics of BPNSs, which can be viewed as a combination of several small bounded subnets via synchronizing transitions, are described by an algebraic equation. When the algebraic form for its dynamics is established, we can present a necessary and sufficient condition for the reachability between any marking (or state) and initial marking. Also, we give a corresponding algorithm to calculate all of the transition paths between initial marking and any target marking. Finally, an example is shown to illustrate proposed results. The key advantage of our approach, in which the set of reachable markings of BPNSs can be expressed by the set of reachable markings of subnets such that the big reachability set of BPNSs do not need generate, is partly avoid the state explosion problem of Petri nets (PNs).</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 1","pages":"Pages 77-86"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60190-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72228589","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}

引用次数: 1

Construction of authentication codes with distrust arbitration from polynomials over finite fields 由有限域上的多项式构造具有不信任仲裁的认证码

Journal of China Universities of Posts and Telecommunications Pub Date : 2017-02-01 Epub Date: 2017-04-05 DOI: 10.1016/S1005-8885(17)60191-2

Chen Shangdi, Tian Wenjing, Li Xue

{"title":"Construction of authentication codes with distrust arbitration from polynomials over finite fields","authors":"Chen Shangdi, Tian Wenjing, Li Xue","doi":"10.1016/S1005-8885(17)60191-2","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60191-2","url":null,"abstract":"<div><p>The authentication codes with arbitration are able to solve dispute between the sender and the receiver. The authentication codes with trusted arbitration are called <em>A</em><sup>2</sup>-codes, the authentication codes with distrust arbitration are called <em>A</em><sup>3</sup>-codes. As an expansion of <em>A</em><sup>2</sup>-codes, an <em>A</em><sup>3</sup>-codes is an authentication system which is closer to the reality environment. Therefore, <em>A</em><sup>3</sup>-codes have more extensive application value. In this paper, we construct a class of <em>A</em><sup>3</sup>-codes based on polynomials over finite fields, give the parameters of the constructed codes, and calculate a variety of cheating attacks the maximum probabilities of success. Especially, in a special case, the constructed <em>A</em><sup>3</sup>-codes are perfect. Compared with a known type of codes, they have almost the same security level, however, our codes need less storage requirements. Therefore, our codes have more advantages.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 1","pages":"Pages 87-95"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60191-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72228590","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}

引用次数: 0

Deadline based scheduling for data-intensive applications in clouds 基于截止日期的云数据密集型应用程序调度

Journal of China Universities of Posts and Telecommunications Pub Date : 2016-12-01 Epub Date: 2017-02-24 DOI: 10.1016/S1005-8885(16)60064-X

Fu Xiong , Cang Yeliang , Zhu Lipeng , Hu Bin , Deng Song , Wang Dong

引用次数: 3

Progressive framework for deep neural networks: from linear to non-linear 深度神经网络的渐进框架：从线性到非线性

Journal of China Universities of Posts and Telecommunications Pub Date : 2016-12-01 Epub Date: 2017-02-24 DOI: 10.1016/S1005-8885(16)60063-8

Shao Jie , Zhao Zhicheng , Su Fei , Cai Anni

{"title":"Progressive framework for deep neural networks: from linear to non-linear","authors":"Shao Jie , Zhao Zhicheng , Su Fei , Cai Anni","doi":"10.1016/S1005-8885(16)60063-8","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60063-8","url":null,"abstract":"<div><p>We propose a novel progressive framework to optimize deep neural networks. The idea is to try to combine the stability of linear methods and the ability of learning complex and abstract internal representations of deep learning methods. We insert a linear loss layer between the input layer and the first hidden non-linear layer of a traditional deep model. The loss objective for optimization is a weighted sum of linear loss of the added new layer and non-linear loss of the last output layer. We modify the model structure of deep canonical correlation analysis (DCCA), i.e., adding a third semantic view to regularize text and image pairs and embedding the structure into our framework, for cross-modal retrieval tasks such as text-to-image search and image-to-text search. The experimental results show the performance of the modified model is better than similar state-of-art approaches on a dataset of National University of Singapore (NUS-WIDE). To validate the generalization ability of our framework, we apply our framework to RankNet, a ranking model optimized by stochastic gradient descent. Our method outperforms RankNet and converges more quickly, which indicates our progressive framework could provide a better and faster solution for deep neural networks.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 6","pages":"Pages 1-7"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60063-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232218","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}

引用次数: 5

Attribute reduction based on fuzziness of approximation set in multi-granulation spaces 多粒度空间中基于逼近集模糊性的属性约简

Journal of China Universities of Posts and Telecommunications Pub Date : 2016-12-01 Epub Date: 2017-02-24 DOI: 10.1016/S1005-8885(16)60065-1

Xu Kai , Zhang Qinghua , Xue Yubin , Hu Feng

引用次数: 1

Pre-scan based fast handoff scheme for enterprise IEEE 802.11 networks 基于预扫描的企业IEEE 802.11网络快速切换方案

Journal of China Universities of Posts and Telecommunications Pub Date : 2016-12-01 Epub Date: 2017-02-24 DOI: 10.1016/S1005-8885(16)60071-7

Zhang Biao, Wen Xiangming, Lu Zhaoming, Lei Tao

{"title":"Pre-scan based fast handoff scheme for enterprise IEEE 802.11 networks","authors":"Zhang Biao, Wen Xiangming, Lu Zhaoming, Lei Tao","doi":"10.1016/S1005-8885(16)60071-7","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60071-7","url":null,"abstract":"<div><p>In IEEE 802.11 networks, many access points (APs) are required to cover a large area due to the limited coverage range of APs, and frequent handoffs may occur while a station (STA) is moving in an area covered by several APs. However, traditional handoff mechanisms employed at STAs introduce a few hundred milliseconds delay, which is far longer than what can be tolerated by some multimedia streams such as voice over Internet protocol (VoIP), it is a challenging issue for supporting seamless handoff service in IEEE 802.11 networks. In this paper, we propose a pre-scan based fast handoff scheme within an IEEE 802.11 enterprise wireless local area network (EWLAN) environment. The proposed scheme can help STA obtain the best alternative AP in advance after the pre-scan process, and when the handoff is actually triggered, STA can perform the authentication and reassociation process toward the alternative AP directly. Furthermore, we adopt Kalman filter to minimize the fluctuation of received signal strength (RSS), thus reducing the unnecessary pre-scan process and handoffs. We performed simulations to evaluate performance, and the simulation results show that the proposed scheme can effectively reduce the handoff delay.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 6","pages":"Pages 60-67"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60071-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232226","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}

引用次数: 0

Low sampling rate technique based frequency-domain random demodulation for broadband digital predistortion 基于低采样率技术的宽带数字预失真频域随机解调

Journal of China Universities of Posts and Telecommunications Pub Date : 2016-12-01 Epub Date: 2017-02-24 DOI: 10.1016/S1005-8885(16)60069-9

Zhao Jingmei , Liu Yuan'an , Yu Cuiping , Yu Jianguo

{"title":"Low sampling rate technique based frequency-domain random demodulation for broadband digital predistortion","authors":"Zhao Jingmei , Liu Yuan'an , Yu Cuiping , Yu Jianguo","doi":"10.1016/S1005-8885(16)60069-9","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60069-9","url":null,"abstract":"<div><p>This paper proposes a combination technique of the frequency-domain random demodulation (FRD) and the broadband digital predistorter (DPD). This technique can linearize the power amplifiers (PAs) at a low sampling rate in the feedback loop. Based on the theory of compressed sensing (CS), the FRD method preprocesses the original signal using the frequency domain sampling signal with different stages through multiple parallel channels. Then the FRD method is applied to the broadband DPD system to restrict the sampling process in the feedback loop. The proposed technique is assessed using a 30 W Class-F wideband PA driven by a 20 MHz orthogonal frequency division multiplexing (OFDM) signal, and a 40 W GaN Doherty PA driven by a 40 MHz 4-carrier long-term evolution (LTE) signal. The simulation and experimental results show that good linearization performance can be achieved at a lower sampling rate with about 24 dBc adjacent channel power ratio (ACPR) improvement by applying the proposed combination technique FRD-DPD. Furthermore, the performance of normalized mean square error (NMSE) and error vector magnitude (EVM) also has been much improved compared with the conventional technique.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 6","pages":"Pages 47-52"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60069-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232221","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}

引用次数: 0

Gram-Schmidt based hybrid beamforming for mmWave MIMO systems 毫米波MIMO系统中基于Gram-Schmidt的混合波束形成

Journal of China Universities of Posts and Telecommunications Pub Date : 2016-12-01 Epub Date: 2017-02-24 DOI: 10.1016/S1005-8885(16)60070-5

Li Xiaohui , Lin Yingchao , Meng Meimei , Hei Yongqiang

{"title":"Gram-Schmidt based hybrid beamforming for mmWave MIMO systems","authors":"Li Xiaohui , Lin Yingchao , Meng Meimei , Hei Yongqiang","doi":"10.1016/S1005-8885(16)60070-5","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60070-5","url":null,"abstract":"<div><p>Due to the high cost and power consumption of the radio frequency (RF) chains, it is difficult to implement the full digital beamforming in millimeter-wave (mmWave) multiple-input multiple-output (MIMO) systems. Fortunately, the hybrid beamforming (HBF) is proposed to overcome these limitations by splitting the beamforming process between the analog and digital domains. In recent works, most HBF schemes improve the spectral efficiency based on greedy algorithms. However, the iterative process in greedy algorithms leads to high computational complexity. In this paper, a new method is proposed to achieve a reasonable compromise between complexity and performance. The novel algorithm utilizes the low-complexity Gram-Schmidt method to orthogonalize the candidate vectors. With the orthogonal candidate matrix, the slow greedy algorithm is avoided. Thus, the RF vectors are found simultaneously without any iteration. Additionally, the phase extraction is applied to satisfy the element-wise constant-magnitude constraint on the RF matrix. Simulation results demonstrate that the new HBF algorithm can make substantial improvements in complexity while maintaining good performance.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 6","pages":"Pages 53-59"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60070-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232225","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}

引用次数: 1