检索结果-内蒙古大学图书馆

2015 International Industrial Informatics and computer Engineering Conference(IIICEC 2015)

作者： CHEN Bing ZOU Xiang TAN Chengxiang The 3rd research institute of ministry of public security (key laboratory of information network security Ministry of Public Security) Dept.of computer engineering of Tongji University

With the rapid development of network,network identity management is becoming more and more *** identity in cyberspace associated in reality has been one significant and urgent task as online life becomes *** this paper gives a new network identity management systems model based on the present model,including a two-party identity management model,a three-party identity management model,and a user-centric five-party identity management *** new model made by new five parties can realize the network identity management under huge amounts of data and for all kinds of network identities,such as personal,organization,software,service,etc.,and the new network identity management model helps to identity management in cyberspace.

关键词： network identity Identity management Systems model Massive data

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of DF Relaying with Optimum Combining in a Poisson Field of Interferers

Performance Analysis of DF Relaying with Optimum Combining i...

引用

IEEE International Conference on Communications

作者： Navod Suraweera Norman C. Beaulieu Department of Electrical and Computer Engineering University of Alberta School of Information and Communication Engineering and Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecomunications (BUPT)

ISBN: (纸本)9781467364300

The performance of optimum combining (OC) in decode-and forward (DF) relaying in the presence of a Poisson field of interferers is analyzed. An approximation for the outage probability of the OC receiver is derived by considering the temporal correlation of the interference. Despite the randomness of the number and the locations of the interferers, the OC receiver suppresses the interference at the destination node and diversity gains are achieved, provided that the relay nodes are noise limited. For single-antenna relay nodes, the end-to-end performance is vulnerable to interference at the relay nodes which is not canceled, resulting in zero diversity gains.

关键词： DF relaying Interference Optimum combining Outage probability Poisson point processes

来源：评论

学校读者我要写书评

暂无评论

A Clustering-Based Similarity Measurement for Collaborative Filtering 2

A Clustering-Based Similarity Measurement for Collaborative ...

引用

2nd International Conference on Advanced Cloud and Big Data, CBD 2014

作者： Gu, Liang Yang, Peng Dong, Yongqiang School of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing211189 China

ISBN: (纸本)9781479980857

Similarity measurement is a crucial process in collaborative filtering. User similarity is computed solely based on the numerical ratings of users. In this paper, we argue that the social information of users should be also taken into consideration to improve the performance of traditional similarity measurements. To achieve this, we propose a clustering-based similarity measurement approach incorporating user social information. In order to cluster the users effectively, we propose a novel distance metric based on taxonomy tree which can easily process the numerical and categorical information of users. Meanwhile, we also address how to determine the contribution of different types of information in the distance metric. After clustering the users, we introduce the incorporating strategy of our proposed similarity measurement. We perform a series of experiments on a real world dataset and compare the performance of our approach against that of traditional approaches. Experiments demonstrate that the proposed approach considerably outperforms the traditional approaches. © 2014 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Gaussian Mixture Model Based Interest Prediction In Social networks

Gaussian Mixture Model Based Interest Prediction In Social N...

引用

IEEE International Conference on Cloud Computing Technology and Science (CloudCom)

作者： Dongyun An Xianghan Zheng Chunming Rong Tahar Kechadi ChongCheng Chen College of Mathematics and Computer Science Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Department of Electrical Engineering and Computer Science Stavanger Norway University College Dublin School of Computer Science and Informatics Ireland

In this paper, we investigate a typical clustering technology, namely, Gaussian mixture model (GMM)-based approach, for user interest prediction in social networks. The establishment of the model follows the following process: collect dataset from 4613 users and more than 16 million messages from Sina Weibo, obtain each user's interest eigenvalue sequence and establish GMM model to clustering users. In theory and experiment, this approach is feasible. The GMM-based approach considers the prediction accuracy and consuming time. A series of experiments are conducted to validate the feasibility and efficiency of the proposed solution and whether it can achieve a higher accuracy of prediction compared with other approaches, such as SVM and K-means. Further experiments show that GMM-based approach could produce higher prediction accuracy of 93.9%, thus leveraging computation complexity.

关键词： Predictive models Feature extraction Social network services Gaussian mixture model Eigenvalues and eigenfunctions Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive anonymous communication scheme under SDN architecture

Self-adaptive anonymous communication scheme under SDN archi...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Tingting Zeng Meng Shen Mingzhong Wang Liehuang Zhu Fan Li Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing Institute of Technology P. R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education P. R. China Faculty of Arts and Business University of the Sunshine Coast Queensland Australia

Communication privacy and latency perceived by users have become great concerns for delay-sensitive Internet services. Existing anonymous communication systems either provide high anonymity at an expense of prolonged latency (e.g., mix-net), or offer better real-time performance by sacrificing the ability against traffic analysis attacks (e.g., Onion Routing). The emerging Software-Defined networking (SDN) introduces additional challenges to communication anonymity, due to the existence of a centralized controller that has a global view of the entire network traffic. In this paper, we propose a new anonymous communication scheme for delay-sensitive services under SDN scenarios, which can simultaneously protect communication privacy and reduce the end-to-end latency. A self-adaptive method based on the mix-net framework is designed to dynamically modify the waiting threshold of mix nodes, which helps to reduce the communication latency. In order to preserve the degree of anonymity, the self-adaptive method is incorporated with a random walking strategy for packets forwarding. Both theoretical analysis and experimental results prove that our scheme provides a moderate degree of anonymity and effectively reduces the latency derived from mix-net by up to 50%.

关键词： Real-time systems Relays Entropy Lead Distance measurement Annealing Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of two-hop-relay cellular systems with queueing capability

Performance analysis of two-hop-relay cellular systems with ...

引用

2015 International Conference on information and Communications Technologies, ICT 2015

作者： Lu, Weifeng Gu, Mengmeng Yang, Luxi College of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China School of Information Science and Engineering SouthEast University Nanjing210096 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing Jiangsu210023 China Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Jiangsu Province Nanjing Jiangsu210023 China

ISBN: (纸本)9781849199940

In this paper, we present a two-hop-relay WCDMA cellular system with queueing capability, where a call can wait in the incoming buffer at the congested Base Transceiver Station (BTS) if no channel is immediately available, so as to reduce the call blocking rate. We develop an analytic model based on Multidimensional Markov chains. Then based on this model, we can obtain the average transmission rate and the queuing delay performance of the system respectively. Finally, through numerical calculation, we analyze the impact of the various parameters on the performance of the two-hop-relay WCDMA cellular system with queueing capability.

关键词： Queueing theory

来源：评论

学校读者我要写书评

暂无评论

Real-time simulation of action-driven 3D subtle facial expressions

引用

Journal of Computational information Systems 2014年第5期10卷 2137-2144页

作者： Tang, Yong Liang, Haiyan Guo, Dan Lv, Mengya Zhao, Jing College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China

While the large-scale deformations such as the Laplacian deformation method could not synthesize new expressional details, this paper proposes a method for simulating different subtle facial expressions based on the Kinect acquisition system and the facial expressional reconstruction technique. Firstly, we generate the coarse skin textures with pore details and those normal maps. Secondly, we use blending wrinkle maps to render animated details on a human face based on a GPU shader program. Finnaly, according to the action units captured by the Kinect, we calculate the dynamic texture mapping and the weight of wrinkles, and apply the wrinkles function to simulate the motion of wrinkles. Experimental results show that our method can generate facial details in real time. The method suits the fields such as digital entertainment and video conferences. © 2014 Binary information Press.

关键词： Blending

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of an enhanced Ethernet energy saving mechanism in IEEE 802.3az

引用

Journal of information and Computational Science 2014年第5期11卷 1605-1613页

作者： Zhi, Shengyang Jin, Shunfu Meng, Chao College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China

In order to reduce the energy consumption and improve the response performance, by introducing the strategies of sleep-delay, pre-awake and split timing to IEEE 802.3az, an enhanced Ethernet energy saving mechanism is proposed. Considering the digital nature of modern communications, a discrete-time queueing model with multiple-vacation and N-strategy is built. With the method of an embedded Markov chain, we evaluate the energy saving efficiency of the system and the response performance of the data frames mathematically. Numerical experiments and simulation results show that, in the enhanced Ethernet energy saving mechanism, the average packet latency is reduced, while the energy saving ratio is satisfactory. © 2014 by Binary information Press.

关键词： Energy conservation

来源：评论

学校读者我要写书评

暂无评论

A density grid-based uncertain data stream clustering algorithm

引用

Journal of Computational information Systems 2014年第9期10卷 3619-3626页

作者： He, Haitao Zhao, Jintian The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China

The existing grid-based uncertain data stream clustering algorithms are fast but low-accuracy, and sensitive to user-specified threshold. In order to solve the above problems, a density grid-based uncertain data stream clustering algorithm UG-Stream is proposed in this paper. In UG-Stream algorithm, a dynamic threshold is defined by taking uncertainty and grid feature into account, dense grid can be distinguished by the threshold. The probability variance is defined to describe the distribution of internal data points in grid. If grid distribution can be taken as uniform, dense grid can be classified as core dense grid by probability variance. Core dense grid can be clustered directly, the rest of dense grids will be merged into current existing clusters by probability center distance. Contrast experiments show that UG-Stream algorithm is superior to UMicro algorithm in both clustering accuracy and clustering rate. © 2014 Binary information Press.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

WCSPMPD-stream: Mining weighted closed sequential patterns with pattern decay over data streams

引用

Journal of Computational information Systems 2014年第1期10卷 435-442页

作者： Zeng, Qiang Han, Gaowei Li, Weina Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China

Many of the previous incremental methods in data streams are deleting the old patterns and adding to the new patterns directly, which may delete useful patterns too early. Both different real data and the data occurring time can lead to the diverse importance, which are not considered at the same time in previous studies. Therefore, WCSPMPD-Stream, a weighted closed sequential pattern algorithm with pattern decay based on sliding windows over data streams is proposed in this paper. Firstly, the sliding windows are separated into several fragments to be mined respectively. Secondly, Time Weight Decay and No Updating Decay methods are designed to control the decay rate. Thirdly, a method of calculating the time weight is defined which varies linearly with the length of time interval between each stream fragment and the current stream fragment. Fourthly, an approach of getting the item weight is defined to calculate any sequence weight by the items in it. Fifthly, a new data structure WFPS-Tree is advanced to store and update the mining results. The experiments show that WCSPMPD-Stream algorithm overcomes the memory limitation and mines patterns with higher interest. And its execution time is reduced compared with the previous algorithms under the same conditions. Copyright © 2014 Binary information Press.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：