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

6th International Conference on Cyber-Enabled Distributed computing and Knowledge Discovery, CyberC 2014

作者： Chen, Zhen Zhang, Wenfang Wang, Xiaomin School of Information Science and Technology Southwest Jiaotong University China Key Laboratory of Information Security and National Computing Grid Southwest Jiaotong University Chengdu China

ISBN: (纸本)9781479962358

In recent years, some collaborative threshold authenticated encryption schemes were put forward to ease the workloads of the individual signers. Unfortunately, the original scheme was found to have design flaws in its signature generation phase, however the improvements of the original one are all proved to be inefficient. In order to remedy the security flaws and improve the performance, a novel robust collaborative threshold authenticated encryption scheme is proposed in this paper. Based on the elliptic curve cryptography and the message linkage technology, this scheme can realize efficient encryption and authentication of large messages. Analysis shows that the proposed scheme is theoretically correct and has better performance. The scheme can be further applied into distributed environments, such as cloud storage and computing networks, dynamic alliance of enterprises and virtual organizations. © 2014 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

An Efficient Centralized Algorithm for Connected Dominating Set on Wireless networks

引用

Procedia Computer Science 2015年 56卷 162-167页

作者： Deqian Fu Lihua Han Li Liu Qian Gao Zhiquan Feng School of Informatics Linyi University Linyi 276005 P.R. China Provincial Key Laboratory for Network Based Intelligent Computing University of Jinan Jinan 250022 P.R. China School of Information Qilu University of Technology Jinan Shandong 250353 China School of Information Science and Engineering Universityof Jinan Jinan Shandong 250022 China

In wireless network, backbone network plays an important role on forwarding data. Further, in order to reduce the delay and save energy, the minimum connected dominating set (MCDS) is an effective way to construct a backbone. However, it is NP-hard to construct the MCDS. In this paper, we propose an efficient centralized algorithm, redundancy connected dominating set (RCDS), to construct a relatively optimal connected dominating set with the economic computation cost of O (Δ 2 n) Specifically, the local strategy is employed to obtain the maximal independent set (MIS) firstly, and then a virtual backbone network is generated by adding the local joint intermediate nodes in the general graph.

关键词： Redundancy Connected dominating set Backbone network maximal independent set Wireless network General graph

来源：评论

学校读者我要写书评

暂无评论

On Constructing Minimum 2-Connected 2-Domiating Set with Maximum Spectrums in Cognitive Radio networks

引用

Procedia Computer Science 2015年 56卷 156-161页

作者： Lihua Han Deqian Fu Zifen Yang Qian Gao Zhiquan Feng School of Informatics Linyi University Linyi Shandong 276005 P.R. China Provincial Key Laboratory for Network Based Intelligent Computing University of Jinan Jinan 250022 P.R. China School of Information Qilu University of Technology Jinan Shandong 250353 China School of Information Science and Engineering Universityof Jinan Jinan Shandong 250022 China

Connected dominating set (CDS) is a representative technique for constructing virtual backbones of wireless networks to improve the efficiency of communication. Most of existing works on CDS aim to construct the minimum CDS (MCDS). However, MCDS may not be sufficient in cognitive radio networks where communication links are prone to failure due to random activities of primary users. To solve the problem, an algorithm is proposed in this paper to construct a CDS with redundancy and the maximum spectrums in CRNs. Moreover, with an integer programming formulation, an algorithm is designed to obtain the minimum 2-conneted 2-dominating set with maximum spectrums (MSs) in CRNs. To the best of our knowledge, this is the first integer programming formulation for the problem and the concept of MSs is put forward first. Simulation results indicate that our algorithm performs well.

关键词： Minimum 2-Connected 2-Domiating Set CDS minimum CDS Maximum Spectrums CRN

来源：评论

学校读者我要写书评

暂无评论

Tuning linux's load balancing algorithm for CMT system

Tuning linux's load balancing algorithm for CMT system

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Peng, Jianzhang Gu, Naijie Li, Yehua Xu, Zhang School of Computer Science and Technology University of Science and Technology of China Hefei China Anhui Province Key Laboratory of Computing and Communication Software USTC SICT Joint Laboratory of Network and Communication Hefei China

ISBN: (纸本)9781479916603

Linux 2.6 load balancing algorithm on scheduling domain supports CMP, CMT, SMP, NUMA architecture. For SMT, the algorithm try to assign the new process to the idlest CPU of the idlest core, and if the first CPU of a core is comparati vely idle, it tries to pull moderate amount of tasks from the busiest CPU of the core to balance the system workload periodically. Under certain circumstances, this strategy would cause the system to be more unbalanced. For the above defects, the algorithm can be adjusted in two ways. (1) The idlest CPU of the entire system should be selects for the new process;(2) the idlest CPU of a scheduling domain periodically can move tasks from the scheduling domain to itself. After applying this optimization, the system's performance achieved the highest increase of 8% in hackbench testing on an 8-core 32-thread XLR532 processor. © 2013 IEEE.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Independent component analysis based on information bottleneck

Abstract and Applied Analysis

引用

Abstract and Applied Analysis 2015年第1期2015卷

作者： Ke, Qiao Zhang, Jiangshe Srivastava, H.M. Wei, Wei Chen, Guang-Sheng School of Mathematics and Statistics Xi'An Jiaotong University Xi'an 710049 China Department of Mathematics and Statistics University of Victoria Victoria V8W3R4 BC Canada School of Computer Science and Engineering Xi'An University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an 710048 China Department of Construction and Information Engineering Guangxi Modern Vocational Technology College Hechi Guangxi 547000 China

The paper is mainly used to provide the equivalence of two algorithms of independent component analysis (ICA) based on the information bottleneck (IB). In the viewpoint of information theory, we attempt to explain the two classical algorithms of ICA by information bottleneck. Furthermore, via the numerical experiments with the synthetic data, sonic data, and image, ICA is proved to be an edificatory way to solve BSS successfully relying on the information theory. Finally, two realistic numerical experiments are conducted via FastICA in order to illustrate the efficiency and practicality of the algorithm as well as the drawbacks in the process of the recovery images the mixing images. © 2015 Qiao Ke et al.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Energy-saving Algorithm for Wireless Sensor networks Based on network Coding and Compressed Sensing

引用

中国通信 2014年第z1期11卷 171-178页

作者： QIN Tuanfa MENG Yunfan LI Liangliang WAN Haibin ZHANG Dongmei School of Computer and Electronic Information Guangxi University Nanning 530004 China Guangxi Key Laboratory of Multimedia Communications and Network Technology Guangxi University Nanning 530004 China Information Security Center Beijing University of Posts and Telecommunications Beijing 100876 China National Engineering Laboratory for Disaster Backup and Recovery Beijing 100876 China

An energy-saving algorithm for wireless sensor networks based on network coding and compressed sensing （CS-NCES） is proposed in this paper. Along with considering the correlations of data spatial and temporal, the algorithm utilizes the similarities between the encoding matrix of network coding and the measurement matrix of compressed sensing. The source node firstly encodes the data, then compresses the coding data by cot-npressed sensing over finite fields. Compared with the network coding scheme, simulation results show that CS-NCES reduces the energy consumption about 25.30/0-34.50/0 and improves the efficiency of data reconstruction about 1.56%- 5.98%. The proposed algorithm can not only enhance the usability of network coding in wireless sensor networks, but also improve the network performance.

关键词： wireless sensor networks network coding compressed sensing deterministic matrix network energy-efficiency

来源：评论

学校读者我要写书评

暂无评论

Personal Attributes Extraction in Chinese Text Bakeoff in CLP 2014: Overview 3

Personal Attributes Extraction in Chinese Text Bakeoff in CL...

引用

3rd CIPS-SIGHAN Joint Conference on Chinese Language Processing, CLP 2014

作者： Xu, Ruifeng Wang, Shuai Shi, Feng Xu, Jian Key Laboratory of Network Oriented Intelligent Computation Harbin Institute of Technology Shenzhen Graduate School China Department of Computing Hong Kong Polytechnic University Hong Kong

This paper presents the overview of Personal Attributes Extraction in Chinese Text Bakeoff in CLP 2014. Personal attribute extraction plays an important role in information extraction, event tracking, entity disambiguation and other related research areas. This task is designed to evaluate the techniques for extracting person specific attributes from unstructured Chinese texts, which is similar to slot filling, but focuses on person attributes. This task brings some challenges issues because Chinese language contains some common words and lacks of capital clues as in English. The task organizer manually constructs the query names and corresponding documents. The value/presence of the texts corresponding 25 pre-defined attributes are annotated to construct the training and testing dataset. The bakeoff results achieved by the participators show the good progress in this field. © 2014 CLP 2014 - 3rd CIPS-SIGHAN Joint Conference on Chinese Language Processing. All rights reserved.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

Construction of Lightweight Certificate-Based Signature and Application in Cloud computing

Construction of Lightweight Certificate-Based Signature and ...

引用

7th China Conference of Wireless Sensor networks, CWSN 2013

作者： Shaohui, Wang Suqin, Chang College of Computer Nanjing University of Posts and Telecommunications Nanjing 210023 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing 210003 China Network and Data Security Key Laboratory of Sichuan Province United States

ISBN: (纸本)9783642545214

Certificate-based signature (CBS) scheme preserves advantages of certificate-based encryption, such as implicit certification and no private key escrow problem. In this paper, we propose a new short and efficient CBS scheme in the random oracle model based on the Schnorr signature scheme. The short signature length and efficient computation make it particularly useful in power and bandwidth limited environment. In addition, we present the new application of CBS scheme to the Single Sign-On(SSO) problem in the cloud computing environment, which allows users to sign on only once and have their identities automatically verified by each application or service they want to access. Based on our new CBS scheme construction, the new SSO solution is much more efficient than the one based on proxy signature scheme. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Emotion cause detection with linguistic construction in Chinese Weibo text 3

Emotion cause detection with linguistic construction in Chin...

引用

3rd CCF Conference on Natural Language Processing and Chinese computing, NLPCC 2014

作者： Gui, Lin Yuan, Li Xu, Ruifeng Liu, Bin Lu, Qin Zhou, Yu Key Laboratory of Network Oriented Intelligent Computation Shenzhen Graduate School Harbin Institute of Technology Shenzhen China Department of Computing The Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9783662459232

To identify the cause of emotion is a new challenge for researchers in nature language processing. Currently, there is no existing works on emotion cause detection from Chinese micro-blogging (Weibo) text. In this study, an emotion cause annotated corpus is firstly designed and developed through annotating the emotion cause expressions in Chinese Weibo Text. Up to now, an emotion cause annotated corpus which consists of the annotations for 1,333 Chinese Weibo is constructed. Based on the observations on this corpus, the characteristics of emotion cause expression are identified. Accordingly, a rulebased emotion cause detection method is developed which uses 25 manually complied rules. Furthermore, two machine learning based cause detection methods are developed including a classification-based method using support vector machines and a sequence labeling based method using conditional random fields model. It is the largest available resources in this research area. The experimental results show that the rule-based method achieves 68.30% accuracy rate. Furthermore, the method based on conditional random fields model achieved 77.57% accuracy which is 37.45% higher than the reference baseline method. These results show the effectiveness of our proposed emotion cause detection method. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Group recommendation for Flickr images by 4-order tensor decomposition

引用

Journal of Computational Information Systems 2014年第3期10卷 1315-1322页

作者： Wang, Xiaofang Ma, Jun Xu, Ming School of Computer Science and Technology Shandong University Jinan 250101 China Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan 250022 China Shandong Dareway Computer Software Co. Ltd. Jinan 250101 China

Users in Flickr can upload images and share them with appropriate groups based on their interests. Sharing images with a group would promote the communication between users and expand their social networks, so Flickr groups have gained great popularity and attracted a large number of users. However, repeatedly adding images to certain groups is quite tiring and it requires users to know the content of each group and which group they should add to. To solve this problem, suggesting groups for Flickr images has attracted a lot of attention recently. However, as far as we know, many previous works on Flickr group recommendation have difficulties in generating satisfactory suggestions because they only used visual features and tags associated with the images and rarely exploited the information of users. The interests of users are critical to high-quality and efficient group recommendation. Hence, in this paper, we present a model based on 4-order tensor to describe the relation among images, users, tags and groups. Particularly, we propose a Tetradic Decomposition Algorithm which employs the higher order singular value decomposition to reduce the dimensionality of the 4-order tensor and reveal the latent semantic association among images, users, tags and groups. Experiments on the dataset crawled from Flickr demonstrate that our approach outperforms other existing methods. © 2014 Binary Information Press.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：