首页 > 最新文献

Journal of China Universities of Posts and Telecommunications最新文献

英文 中文
Research on behavioral targeted advertising in mobile Internet 移动互联网行为定向广告研究
Q4 Computer Science Pub Date : 2014-07-01 DOI: 10.1016/S1005-8885(14)60520-3
Jian-yi LIU , Cong Wang , Ru Zhang , Xin-yi Zhao

This paper designs and implements the advertising recommending system based on user behavior under mobile Internet. By analyzing the user's online behavior, user profile that includes long-term interests and short-term interests can be obtained. In the end of this paper, the similarity between the behavior clusters and the advertisements is calculated, which is used to rank and select the most appropriate advertisements. The experiments show that the system can push the appropriate advertisements according to the user's different interest

本文设计并实现了移动互联网下基于用户行为的广告推荐系统。通过分析用户的上网行为,可以得到用户的长期兴趣和短期兴趣。在本文的最后,计算行为聚类与广告之间的相似度,并将其用于对广告进行排序和选择最合适的广告。实验表明,该系统可以根据用户的不同兴趣点推送相应的广告
{"title":"Research on behavioral targeted advertising in mobile Internet","authors":"Jian-yi LIU ,&nbsp;Cong Wang ,&nbsp;Ru Zhang ,&nbsp;Xin-yi Zhao","doi":"10.1016/S1005-8885(14)60520-3","DOIUrl":"10.1016/S1005-8885(14)60520-3","url":null,"abstract":"<div><p>This paper designs and implements the advertising recommending system based on user behavior under mobile Internet. By analyzing the user's online behavior, user profile that includes long-term interests and short-term interests can be obtained. In the end of this paper, the similarity between the behavior clusters and the advertisements is calculated, which is used to rank and select the most appropriate advertisements. The experiments show that the system can push the appropriate advertisements according to the user's different interest</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 1-5"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60520-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89076786","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}
引用次数: 2
A location-aware hybrid web service QoS prediction algorithm 一种位置感知混合web服务QoS预测算法
Q4 Computer Science Pub Date : 2014-07-01 DOI: 10.1016/S1005-8885(14)60515-X
Hai-hong E, Jun-jie TONG, Mei-na SONG, Jun-de SONG

Quality-of-service (QoS) describes the non-functional characteristics of Web services. As such, the QoS is a critical parameter in service selection, composition and fault tolerance, and must be accurately determined by some type of QoS prediction method. However, with the dramatic increase in the number of Web services, the prediction failure caused by data sparseness has become a critical challenge. In this paper, a new hybrid user-location-aware prediction based on WAA (HUWAA) is proposed. The implicit neighbor search is optimized by incorporating location factors. Meanwhile, the ability of the improved algorithms to solve the data sparsity problem is validated in experiments on public real world datasets. The new algorithms outperform the existing IPCC, UPCC and WSRec algorithms.

服务质量(QoS)描述了Web服务的非功能特征。因此,QoS是服务选择、组合和容错的关键参数,必须通过某种类型的QoS预测方法来准确确定。然而,随着Web服务数量的急剧增加,由数据稀疏性引起的预测失败已经成为一个严峻的挑战。提出了一种基于WAA的混合用户位置感知预测方法(HUWAA)。隐式邻居搜索通过结合位置因素进行优化。同时,在公开的真实数据集上进行了实验,验证了改进算法解决数据稀疏性问题的能力。新算法优于现有的IPCC、UPCC和WSRec算法。
{"title":"A location-aware hybrid web service QoS prediction algorithm","authors":"Hai-hong E,&nbsp;Jun-jie TONG,&nbsp;Mei-na SONG,&nbsp;Jun-de SONG","doi":"10.1016/S1005-8885(14)60515-X","DOIUrl":"10.1016/S1005-8885(14)60515-X","url":null,"abstract":"<div><p>Quality-of-service (QoS) describes the non-functional characteristics of Web services. As such, the QoS is a critical parameter in service selection, composition and fault tolerance, and must be accurately determined by some type of QoS prediction method. However, with the dramatic increase in the number of Web services, the prediction failure caused by data sparseness has become a critical challenge. In this paper, a new hybrid user-location-aware prediction based on WAA (HUWAA) is proposed. The implicit neighbor search is optimized by incorporating location factors. Meanwhile, the ability of the improved algorithms to solve the data sparsity problem is validated in experiments on public real world datasets. The new algorithms outperform the existing IPCC, UPCC and WSRec algorithms.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 34-40"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60515-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87691289","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}
引用次数: 2
Pre-fetch based content distribution system for software update: design and evaluation 基于预取的软件更新内容分发系统:设计与评估
Q4 Computer Science Pub Date : 2014-07-01 DOI: 10.1016/S1005-8885(14)60518-5
Yi ZHANG, Yuchun GUO, Yishuai CHEN

Today, with rapid growth of apps (applications) for computers and mobile terminals, software update happens frequently. As a result, the flash crowd appearing in the early stage of a software patch release cannot be handled smoothly with abruptly arriving requests, thus considerable server bandwidth is needed. Unfortunately, it is still unknown how much bandwidth a content provider should provision to handle this case. In this paper, through measurements in one of the largest game patch distribution systems in China, we propose a simple but accurate user demand prediction model, since our finding that a highly predictable pattern of user requests exists in such a system. We further present the design of a pre-fetch based software update system. In this system, users who are idle and capable in hours before the patch release time could fetch the patches in advance and then serve other users requiring the patches. The design of this system mainly includes demand prediction and pre-fetch scale computation. After the deployment of this system, the contribution rate of users increases about 20% in the release day and is more stable than that before. Moreover, the peak of server bandwidth decreases by about 30%, which significantly saves bandwidth cost for providers.

今天,随着计算机和移动终端应用程序(app)的快速增长,软件更新频繁。因此,在软件补丁发布的早期阶段出现的flash人群无法顺利处理突然到达的请求,因此需要相当大的服务器带宽。不幸的是,目前还不清楚内容提供者应该提供多少带宽来处理这种情况。在本文中,通过对中国最大的游戏补丁分发系统之一的测量,我们提出了一个简单但准确的用户需求预测模型,因为我们发现在这样的系统中存在高度可预测的用户请求模式。在此基础上,设计了一个基于预取的软件更新系统。在该系统中,在补丁发布时间前几个小时内空闲且有能力的用户可以提前获取补丁,然后为其他需要补丁的用户提供服务。该系统的设计主要包括需求预测和预取规模计算。本系统部署后,发布当天用户的贡献率提高了20%左右,比上线前更加稳定。此外,服务器带宽峰值降低了约30%,大大节省了提供商的带宽成本。
{"title":"Pre-fetch based content distribution system for software update: design and evaluation","authors":"Yi ZHANG,&nbsp;Yuchun GUO,&nbsp;Yishuai CHEN","doi":"10.1016/S1005-8885(14)60518-5","DOIUrl":"10.1016/S1005-8885(14)60518-5","url":null,"abstract":"<div><p>Today, with rapid growth of apps (applications) for computers and mobile terminals, software update happens frequently. As a result, the flash crowd appearing in the early stage of a software patch release cannot be handled smoothly with abruptly arriving requests, thus considerable server bandwidth is needed. Unfortunately, it is still unknown how much bandwidth a content provider should provision to handle this case. In this paper, through measurements in one of the largest game patch distribution systems in China, we propose a simple but accurate user demand prediction model, since our finding that a highly predictable pattern of user requests exists in such a system. We further present the design of a pre-fetch based software update system. In this system, users who are idle and capable in hours before the patch release time could fetch the patches in advance and then serve other users requiring the patches. The design of this system mainly includes demand prediction and pre-fetch scale computation. After the deployment of this system, the contribution rate of users increases about 20% in the release day and is more stable than that before. Moreover, the peak of server bandwidth decreases by about 30%, which significantly saves bandwidth cost for providers.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 12-19"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60518-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82139604","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
RETRACTED: A study on clustering-based power trace classification for side channel attacks 基于聚类的侧信道攻击功率跟踪分类研究
Q4 Computer Science Pub Date : 2014-07-01 DOI: 10.1016/S1005-8885(14)60505-7
Hong-xin ZHANG , Jing LI , Han GAN , Peng-fei HE

This article has been retracted: please see Elsevier Policy on Article Withdrawal (https://www.elsevier.com/about/our-business/policies/article-withdrawal).

This article has been retracted at the request of the author.

Electromagnetic emission data from a simulation experiment referred to in the article cannot be depended on because some of the data was acquired from incorrect techniques taking place within the research. This has caused the author to reach incorrect conclusions and the experiment cannot be reproduced as published. The Editor and author have subsequently agreed to retract the article.

本文已被撤回:请参见爱思唯尔文章撤回政策(https://www.elsevier.com/about/our-business/policies/article-withdrawal).This文章已应作者要求被撤回。本文中引用的模拟实验的电磁发射数据是不可靠的,因为一些数据是从研究中使用的不正确的技术中获得的。这导致作者得出了不正确的结论,实验不能在发表时复制。编辑和作者随后同意撤回这篇文章。
{"title":"RETRACTED: A study on clustering-based power trace classification for side channel attacks","authors":"Hong-xin ZHANG ,&nbsp;Jing LI ,&nbsp;Han GAN ,&nbsp;Peng-fei HE","doi":"10.1016/S1005-8885(14)60505-7","DOIUrl":"10.1016/S1005-8885(14)60505-7","url":null,"abstract":"<div><p>This article has been retracted: please see Elsevier Policy on Article Withdrawal (<span>https://www.elsevier.com/about/our-business/policies/article-withdrawal</span><svg><path></path></svg>).</p><p>This article has been retracted at the request of the author.</p><p>Electromagnetic emission data from a simulation experiment referred to in the article cannot be depended on because some of the data was acquired from incorrect techniques taking place within the research. This has caused the author to reach incorrect conclusions and the experiment cannot be reproduced as published. The Editor and author have subsequently agreed to retract the article.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 101-105"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60505-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83856259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Research on online review-trust model and synthetical value model based on power-law and density clustering algorithm 基于幂律和密度聚类算法的在线评论信任模型和综合价值模型研究
Q4 Computer Science Pub Date : 2014-07-01 DOI: 10.1016/S1005-8885(14)60509-4
Lian-ju NING, Hao-yu WANG, Xin FENG

The existing online shopping researches on consumer reviews are mostly based on the attitude change model (ACM). Although the ACM is valuable, it is not easy to judge the trustworthiness of the reviews and measure the values of the reviews. Based on the online data acquisition technology, we have got the data of 360buy, a domestic large-scale business to customer (B2C) commerce website in China. With application of data-mining and the density clustering algorithm (DBSCAN), we focus on the intervals distribution and the synthetic value of consumer reviews. The distribution of review interval can be depicted by the power-law function which presents a monotonically increasing relationship between the power-exponent and the customers’ concerns with the commodity: the higher the exponent is, the more attention will be drawn. We also find that the value of online reviews can be measured by the expertise value, which is the attraction and the quality of the reviews. Based on the above results, we have constructed the online review-trust model and the synthetic value model. The relationship between the power-exponent and the consumer attention has played a vital role in the consumer attention to online-shopping, and then the synthetic value model will help people find out useful reviews more effectively.

现有的网上购物消费者评论研究大多基于态度变化模型(ACM)。虽然ACM是有价值的,但要判断评论的可信度和衡量评论的价值并不容易。基于在线数据采集技术,我们获得了中国国内大型B2C商务网站京东商城的数据。应用数据挖掘和密度聚类算法(DBSCAN),研究消费者评论的区间分布和综合价值。评论间隔的分布可以用幂律函数来描述,幂指数与消费者对商品的关注程度呈单调递增的关系,指数越高,消费者对商品的关注程度越高。我们还发现,在线评论的价值可以用专业价值来衡量,专业价值是评论的吸引力和质量。基于以上结果,我们构建了在线评论信任模型和综合价值模型。幂指数与消费者注意力之间的关系在消费者网购注意力中起着至关重要的作用,然后综合价值模型将帮助人们更有效地发现有用的评论。
{"title":"Research on online review-trust model and synthetical value model based on power-law and density clustering algorithm","authors":"Lian-ju NING,&nbsp;Hao-yu WANG,&nbsp;Xin FENG","doi":"10.1016/S1005-8885(14)60509-4","DOIUrl":"10.1016/S1005-8885(14)60509-4","url":null,"abstract":"<div><p>The existing online shopping researches on consumer reviews are mostly based on the attitude change model (ACM). Although the ACM is valuable, it is not easy to judge the trustworthiness of the reviews and measure the values of the reviews. Based on the online data acquisition technology, we have got the data of 360buy, a domestic large-scale business to customer (B2C) commerce website in China. With application of data-mining and the density clustering algorithm (DBSCAN), we focus on the intervals distribution and the synthetic value of consumer reviews. The distribution of review interval can be depicted by the power-law function which presents a monotonically increasing relationship between the power-exponent and the customers’ concerns with the commodity: the higher the exponent is, the more attention will be drawn. We also find that the value of online reviews can be measured by the expertise value, which is the attraction and the quality of the reviews. Based on the above results, we have constructed the online review-trust model and the synthetic value model. The relationship between the power-exponent and the consumer attention has played a vital role in the consumer attention to online-shopping, and then the synthetic value model will help people find out useful reviews more effectively.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 71-78"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60509-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88005965","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}
引用次数: 2
Social recommendation algorithm fusing user interest social network 融合用户兴趣的社交网络推荐算法
Q4 Computer Science Pub Date : 2014-07-01 DOI: 10.1016/S1005-8885(14)60516-1
Yu-sheng LI, Mei-na SONG, Hai-hong E, Jun-de SONG

Using the social information among users in recommender system can partly solve the data sparsely problems and significantly improve the performance of the recommendation system. However, the recommendation systems which using the users' social information have two main problems: the explicit user social connection information is not always available in real-world recommender systems, and the user social connection information is directly used in recommender systems when the user explicit social information is available. But as we know that the user social information is not all based on user interest, so this can introduce noise to the recommender systems. This paper proposes a social recommender system model called interest social recommendation (ISoRec). Based on probability matrix factorization (PMF), the model addresses the problems mentioned above by combining user-item rating matrix, explicit user social connection information and implicit user interest social connection information to make more accurately recommendation. In addition, the computational complexity of our algorithm is linear with respect to the number of observed data sets used in this algorithm, and can scalable to very large datasets.

在推荐系统中使用用户间的社会信息可以在一定程度上解决数据稀疏问题,显著提高推荐系统的性能。然而,使用用户社会信息的推荐系统存在两个主要问题:在现实推荐系统中,用户社会联系信息并不总是可用的;在用户社会联系信息可用的情况下,用户社会联系信息直接用于推荐系统。但是我们知道,用户的社会信息并不都是基于用户的兴趣,所以这可能会给推荐系统带来噪音。本文提出了一种社会推荐系统模型——兴趣社会推荐(ISoRec)。该模型基于概率矩阵分解(PMF),通过结合用户-物品评分矩阵、显式用户社交连接信息和隐式用户兴趣社交连接信息来解决上述问题,从而更准确地进行推荐。此外,我们算法的计算复杂度与算法中使用的观测数据集的数量呈线性关系,并且可以扩展到非常大的数据集。
{"title":"Social recommendation algorithm fusing user interest social network","authors":"Yu-sheng LI,&nbsp;Mei-na SONG,&nbsp;Hai-hong E,&nbsp;Jun-de SONG","doi":"10.1016/S1005-8885(14)60516-1","DOIUrl":"10.1016/S1005-8885(14)60516-1","url":null,"abstract":"<div><p>Using the social information among users in recommender system can partly solve the data sparsely problems and significantly improve the performance of the recommendation system. However, the recommendation systems which using the users' social information have two main problems: the explicit user social connection information is not always available in real-world recommender systems, and the user social connection information is directly used in recommender systems when the user explicit social information is available. But as we know that the user social information is not all based on user interest, so this can introduce noise to the recommender systems. This paper proposes a social recommender system model called interest social recommendation (ISoRec). Based on probability matrix factorization (PMF), the model addresses the problems mentioned above by combining user-item rating matrix, explicit user social connection information and implicit user interest social connection information to make more accurately recommendation. In addition, the computational complexity of our algorithm is linear with respect to the number of observed data sets used in this algorithm, and can scalable to very large datasets.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 26-33"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60516-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76192218","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}
引用次数: 10
A design of public-data platform in digital campus based on web service 基于web服务的数字校园公共数据平台设计
Q4 Computer Science Pub Date : 2014-07-01 DOI: 10.1016/S1005-8885(14)60514-8
Yan HU, Yan ZHANG

The developing of network drive the developing of information systems in campus. More and more business information systems are built in1990's. But most of these systems in campus are developed on different platform without standard. And some data in business information system should be shared between different departments. So the target of this paper is to solve the problem of sharing data in campus the through the web service. Web service is a service-oriented architecture (SOA) to provider service for service consumer. But the traditional model of web service is not suitable in digital campus. This paper designs a new model of web service for digital campus environment. And then a public-data platform is designed to realize the data sharing in heterogeneous systems. Next, the database designing and data processing flow is introduced. Finally, some monitor information of platform is showed.

网络的发展带动了校园信息系统的发展。越来越多的商业信息系统是在20世纪90年代建立的。但目前校园内的这些系统大多是在不同的平台上开发的,没有标准。业务信息系统中的一些数据需要在不同的部门之间共享。因此,本文的目标是通过web服务解决校园数据共享问题。Web服务是为服务使用者提供服务的面向服务的体系结构(SOA)。但是传统的web服务模式已经不适合数字化校园。本文为数字化校园环境设计了一种新的web服务模式。然后设计了一个公共数据平台,实现异构系统的数据共享。其次,介绍了数据库的设计和数据处理流程。最后给出了平台的一些监控信息。
{"title":"A design of public-data platform in digital campus based on web service","authors":"Yan HU,&nbsp;Yan ZHANG","doi":"10.1016/S1005-8885(14)60514-8","DOIUrl":"10.1016/S1005-8885(14)60514-8","url":null,"abstract":"<div><p>The developing of network drive the developing of information systems in campus. More and more business information systems are built in1990's. But most of these systems in campus are developed on different platform without standard. And some data in business information system should be shared between different departments. So the target of this paper is to solve the problem of sharing data in campus the through the web service. Web service is a service-oriented architecture (SOA) to provider service for service consumer. But the traditional model of web service is not suitable in digital campus. This paper designs a new model of web service for digital campus environment. And then a public-data platform is designed to realize the data sharing in heterogeneous systems. Next, the database designing and data processing flow is introduced. Finally, some monitor information of platform is showed.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 41-45"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60514-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76533099","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}
引用次数: 2
The multi-user detection under fading channel 衰落信道下的多用户检测
Q4 Computer Science Pub Date : 2014-07-01 DOI: 10.1016/S1005-8885(14)60511-2
Dong-yu WANG , Tao DUAN

This paper proposes a method of blind multi-user detection algorithm based on signal sub-space estimation under the fading channels in the present of impulse noise. This algorithm adapts recursive least square (RLS) filter that can estimate the coefficients using only the signature waveform. In addition, to strengthen the ability of resisting the impulse noise, a new suppressive factor is induced, which can suppress the amplitude of the impulse, and improve the ability of convergence speed. Simulation results show that new RLS algorithm is more robust against consecutive impulse noise and have better convergence ability than conventional RLS. In addition, Compared to the least mean square (LMS) detector, the new robust RLS sub-space based method has better multi-address-inference (MAI) suppressing performance, especially, when channel degrades.

提出了一种基于信号子空间估计的衰落信道下脉冲噪声存在下的盲多用户检测算法。该算法采用递推最小二乘(RLS)滤波器,仅使用特征波形即可估计出系数。此外,为了增强抗脉冲噪声的能力,引入了一个新的抑制因子,可以抑制脉冲的幅值,提高收敛速度的能力。仿真结果表明,该算法对连续脉冲噪声具有较强的鲁棒性和较好的收敛能力。此外,与最小均方(LMS)检测器相比,基于鲁棒RLS子空间的新方法具有更好的多地址推理(MAI)抑制性能,特别是在信道退化时。
{"title":"The multi-user detection under fading channel","authors":"Dong-yu WANG ,&nbsp;Tao DUAN","doi":"10.1016/S1005-8885(14)60511-2","DOIUrl":"10.1016/S1005-8885(14)60511-2","url":null,"abstract":"<div><p>This paper proposes a method of blind multi-user detection algorithm based on signal sub-space estimation under the fading channels in the present of impulse noise. This algorithm adapts recursive least square (RLS) filter that can estimate the coefficients using only the signature waveform. In addition, to strengthen the ability of resisting the impulse noise, a new suppressive factor is induced, which can suppress the amplitude of the impulse, and improve the ability of convergence speed. Simulation results show that new RLS algorithm is more robust against consecutive impulse noise and have better convergence ability than conventional RLS. In addition, Compared to the least mean square (LMS) detector, the new robust RLS sub-space based method has better multi-address-inference (MAI) suppressing performance, especially, when channel degrades.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 59-63"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60511-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78607344","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}
引用次数: 2
Malware detection method of android application based on simplification instructions 基于简化指令的android应用程序恶意软件检测方法
Q4 Computer Science Pub Date : 2014-07-01 DOI: 10.1016/S1005-8885(14)60506-9
Hang DONG , Neng-qiang HE , Ge HU , Qi LI , Miao ZHANG

The amount of mobile malicious code is increasing faster every year and a serious security threat is posed by this. Hence, malware detection has become a critical topic in the field of computer security. This paper proposes a method to detect variants of known malware families in Android devices using simplify Dalvik instructions. This method is based on the sequence of instructions. A method is described in this paper to give the simplified description of each instruction and group them with n-gram patterns, which are set to be the malicious features. The result of the experiment shows that features extracted by this method are easy to be recognized, thus an effective way to detect variants of known malware families is provided.

移动恶意代码的数量每年都在快速增长,这构成了严重的安全威胁。因此,恶意软件检测已成为计算机安全领域的一个重要课题。本文提出了一种利用简化的Dalvik指令检测Android设备中已知恶意软件家族变体的方法。这种方法是基于指令的顺序。本文描述了一种对每条指令进行简化描述的方法,并用n-gram模式对其进行分组,并将其设置为恶意特征。实验结果表明,该方法提取的特征易于识别,为检测已知恶意软件家族的变体提供了一种有效的方法。
{"title":"Malware detection method of android application based on simplification instructions","authors":"Hang DONG ,&nbsp;Neng-qiang HE ,&nbsp;Ge HU ,&nbsp;Qi LI ,&nbsp;Miao ZHANG","doi":"10.1016/S1005-8885(14)60506-9","DOIUrl":"10.1016/S1005-8885(14)60506-9","url":null,"abstract":"<div><p>The amount of mobile malicious code is increasing faster every year and a serious security threat is posed by this. Hence, malware detection has become a critical topic in the field of computer security. This paper proposes a method to detect variants of known malware families in Android devices using simplify Dalvik instructions. This method is based on the sequence of instructions. A method is described in this paper to give the simplified description of each instruction and group them with n-gram patterns, which are set to be the malicious features. The result of the experiment shows that features extracted by this method are easy to be recognized, thus an effective way to detect variants of known malware families is provided.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 94-100"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60506-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75217756","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}
引用次数: 17
Design and implementation of IPv6 oriented security mechanisms of port control protocol and peer-to-peer communication 面向IPv6的端口控制协议和对等通信安全机制的设计与实现
Q4 Computer Science Pub Date : 2014-07-01 DOI: 10.1016/S1005-8885(14)60512-4
Lei YAN , Qin ZHAO , Zi-wei HU , Xin LI

Recently, the number of personal intelligent equipment increases rapidly which makes the internet protocol version 6 (IPv6) transition more imperative. Port control protocol (PCP) is one of the important IPv4-in-IPv6 tunnel technologies. Meanwhile, with the increasing demand to communicate or share files between terminal equipment, it is necessary to realize the peer to peer communication to support the transmission of data directly between the terminal equipment without a third-party server. In this paper, the structure of user access network and the deployment of the IPv6 transition technology based on IPv4-in-IPv6 tunnel are analyzed comprehensively, based on which the internet protocol security (IPSec) solution is chosen to protect the security of PCP message and the transport layer security (TLS) solution is chosen to protect the security of the peer-to-peer communications. A system for the authorization and distribution of digital certificates is designed for the TLS solution. Finally, the open source software Openswan is used to implement the IPSec solution, and the open source software OpenSSL is used to implement the TLS solution.

近年来,个人智能设备数量的迅速增加,使得互联网协议版本6 (IPv6)的过渡更加迫切。端口控制协议(Port control protocol, PCP)是IPv4-in-IPv6隧道的重要技术之一。同时,随着终端设备之间通信或文件共享的需求日益增加,有必要实现点对点通信,以支持终端设备之间不需要第三方服务器直接传输数据。本文综合分析了用户接入网的结构和基于IPv4-in-IPv6隧道的IPv6转换技术的部署,在此基础上选择了互联网协议安全(IPSec)方案来保护PCP报文的安全性,选择了传输层安全(TLS)方案来保护对等通信的安全性。为TLS解决方案设计了一个数字证书的授权和分发系统。最后,采用开源软件Openswan实现IPSec解决方案,采用开源软件OpenSSL实现TLS解决方案。
{"title":"Design and implementation of IPv6 oriented security mechanisms of port control protocol and peer-to-peer communication","authors":"Lei YAN ,&nbsp;Qin ZHAO ,&nbsp;Zi-wei HU ,&nbsp;Xin LI","doi":"10.1016/S1005-8885(14)60512-4","DOIUrl":"10.1016/S1005-8885(14)60512-4","url":null,"abstract":"<div><p>Recently, the number of personal intelligent equipment increases rapidly which makes the internet protocol version 6 (IPv6) transition more imperative. Port control protocol (PCP) is one of the important IPv4-in-IPv6 tunnel technologies. Meanwhile, with the increasing demand to communicate or share files between terminal equipment, it is necessary to realize the peer to peer communication to support the transmission of data directly between the terminal equipment without a third-party server. In this paper, the structure of user access network and the deployment of the IPv6 transition technology based on IPv4-in-IPv6 tunnel are analyzed comprehensively, based on which the internet protocol security (IPSec) solution is chosen to protect the security of PCP message and the transport layer security (TLS) solution is chosen to protect the security of the peer-to-peer communications. A system for the authorization and distribution of digital certificates is designed for the TLS solution. Finally, the open source software Openswan is used to implement the IPSec solution, and the open source software OpenSSL is used to implement the TLS solution.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 52-58"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60512-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120815135","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
期刊
Journal of China Universities of Posts and Telecommunications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1