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

Traceable certificateless ring signature scheme for no full anonymous applications

International Journal of Network Security 2018年第4期20卷 762-773页

作者： Gu, Ke Wang, LinYu Wu, Na Liao, NianDong School of Computer and Communication Engineering Changsha University of Science and Technology Wangjiali Rd Tianxin district Changsha Hunan Province410114 China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology China

With the rapid development of identity-based cryptography, several traceable (or linkable) identity-based ring signature (TIBRS) schemes have been proposed. Compared with ring signature based on public key cryptography, TIBRS can simplify public key management and be used for more applications. However, identity-based cryptography still has the problem of private key management and few traceable ring signature schemes are constructed in the standard model. In this paper, we present a fully traceable certificateless ring signature (TCRS) scheme in the standard model, which has a security reduction to the computational Diffie-Hellman (CDH) assumption. © 2018, Femto Technique Co., Ltd.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

Systematic Resource Allocation in Cloud RAN with Caching as ...

引用

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

A parallel k-means clustering algorithm based on redundance elimination and extreme points optimization employing MapReduce

A parallel k-means clustering algorithm based on redundance ...

引用

作者： Tang, Zhuo Liu, Kunkun Xiao, Jinbo Yang, Li Xiao, Zheng College of Information Science and Engineering Hunan University Hunan410082 China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication Engineering Changsha University of Science and Technology Changsha410004 China

When facing massive statistical data, the k-means algorithm is very difficult to satisfy the need of data processing as it lacks an effective parallel mechanism. This paper proposes an improved k-means algorithm (IMR-KCA) to conduct clustering analysis based on medical data employing MapReduce computing framework. Through analyzing the defects of vast redundancy in the traditional k-means algorithms, a selection model is firstly proposed to simplify the computations with multiple clustering centers. Based on several proposed theorems, we prove the correctness of this selection model. Second, this paper provides a method to calculate the distances from extreme points to central points, and the original Euclidean distance is replaced with Manhattan distance. For this simplification, a group of theorems are proposed to prove the correctness. Next, we provide a group of implementation algorithms to complete the parallelism of the clustering computation employing the MapReduce framework. Finally, the experimental results illustrate that IMR-KCA is more reliable and efficient than the direct parallelization of the traditional clustering algorithms based on MapReduce. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

A Low-Area Overhead Secure Scan Architecture Resisting Scan-Based Attacks for Crypto Chips

A Low-Area Overhead Secure Scan Architecture Resisting Scan-...

引用

2017 International MultiConference of Engineers and Computer Scientists, IMECS 2017

作者： Weizheng, Wang Jincheng, Wang Shuo, Cai Peng, Liu Tieqiao, Liu College of Computer and Communication Engineering Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha Hunan410114 China College of Computer and Communication Engineering Changsha University of Science and Technology Changsha410114 China College of Computer and Communication Engineering Changsha University of Science and Technology Changsha410114 China Information Science and Engineering Department Hunan University Changsha410082 China Management School Hangzhou Dianzi University Hangzhou310018 China

ISBN: (纸本)9789881404732

Scan design is a widely used design-for-testability (DFT) technique that improves the controllability and observability of integrated circuits (ICs) resulting in the facilitation of the testing. However, it can also be used to access secret information of crypto chips, and thus threaten dramatically the security of the cipher keys. In this paper, we propose a secure scan DFT architecture to thwart scan-based side-channel attacks. This architecture provides the scan chain reset mechanism, and thus can prevent these attacks based on mode switching. Meanwhile, the secret key is isolated from scan chains of an advanced encryption standard (AES) design in the test mode. Therefore, it can also halt the test-mode-only scan attacks. The proposed secure scan DFT technique ensures the security without compromising the testability of original chip. Most important of all, the secure scan test is implemented with extremely low hardware overhead.

关键词： Design for testability

来源：评论

学校读者我要写书评

暂无评论

Using Cost-Sensitive Ranking Loss to Improve Distant Supervised Relation Extraction

Using Cost-Sensitive Ranking Loss to Improve Distant Supervi...

引用

第十六届全国计算语言学学术会议暨第五届基于自然标注大数据的自然语言处理国际学术研讨会

作者： Daojian Zeng Junxin Zeng Yuan Dai Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication EngineeringChangsha University of Science and TechnologyChangsha 410004P.R.China

ISBN: (纸本)9783319690049

Recently,many researchers have concentrated on using neu-ral networks to learn features for Distant Supervised Relation Extraction(DSRE).However,these approaches generally employ a softmax classi-fier with cross-entropy loss,and bring the noise of artificial class NA into classification ***,the class imbalance problem is serious in the automatically labeled data,and results in poor classification rates on minor classes in traditional *** this work,we exploit cost-sensitive ranking loss to improve *** first uses a Piecewise Convolutional Neural Network(PCNN)to embed the semantics of *** the features are fed into a classifier which takes into account both the ranking loss and ***-periments show that our method is effective and performs better than state-of-the-art methods.

关键词： Classifiers Neural network Semantics Noise Balance impairment Taxonomy embedding

来源：评论

学校读者我要写书评

暂无评论

Texture synthesis and design based on elements distribution creation 1

Texture synthesis and design based on elements distribution ...

引用

1st EAI International Conference on Computer Science and Engineering, COMPSE 2016

作者： Gui, Yan Liu, Yang Li, Feng Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha Hunan410114 China

ISBN: (纸本)9781631901362

The texture synthesis and design starts with an initial elements arrangement and expands it outward by using local and global growth, to obtain the new larger distribution of texture elements. There are two types of synthesized distributions, and their diversity consists in changing the layout of texture elements and decreasing or increasing the number of texture elements according to user's creation. Furthermore, we apply a set of deformation operations to locally change the shapes of texture elements when placing the extracted texture elements into the synthesized distribution, in order to guarantee structure consistency in final synthesized textures. Experimental results show that our method creates a large variety of textures from a given texture sample.

关键词： Computer graphics

来源：评论

学校读者我要写书评

暂无评论

Trajectory data privacy protection based on differential privacy mechanism

引用

IOP Conference Series: Materials Science and Engineering 2018年第1期351卷

作者： Ke Gu Lihao Yang Yongzhi Liu Niandong Liao School of Computer and Communication Engineering Changsha University of Science and Technology Changsha 410114 China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha 410114 China

In this paper, we propose a trajectory data privacy protection scheme based on differential privacy mechanism. In the proposed scheme, the algorithm first selects the protected points from the user's trajectory data; secondly, the algorithm forms the polygon according to the protected points and the adjacent and high frequent accessed points that are selected from the accessing point database, then the algorithm calculates the polygon centroids; finally, the noises are added to the polygon centroids by the differential privacy method, and the polygon centroids replace the protected points, and then the algorithm constructs and issues the new trajectory data. The experiments show that the running time of the proposed algorithms is fast, the privacy protection of the scheme is effective and the data usability of the scheme is higher.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Analysis of SET pulses propagation probabilities in sequential circuits

引用

IOP Conference Series: Materials Science and Engineering 2018年第1期351卷

作者： Shuo Cai Fei Yu Yiqun Yang School of Computer and Communication Engineering Changsha University of Science and Technology Changsha 410114 China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha 410114 China

As the feature size of CMOS transistors scales down, single event transient (SET) has been an important consideration in designing logic circuits. Many researches have been done in analyzing the impact of SET. However, it is difficult to consider numerous factors. We present a new approach for analyzing the SET pulses propagation probabilities (SPPs). It considers all masking effects and uses SET pulses propagation probabilities matrices (SPPMs) to represent the SPPs in current cycle. Based on the matrix union operations, the SPPs in consecutive cycles can be calculated. Experimental results show that our approach is practicable and efficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Survey of key technologies on millimeter-wave CMOS integrated circuits

引用

IOP Conference Series: Materials Science and Engineering 2018年第1期351卷

作者： Fei Yu Lei Gao Lixiang Li Shuo Cai Wei Wang Chunhua Wang Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation & School of Computer and Communication Engineering Changsha University of Science and Technology Changsha 410114 China College of Information Science and Engineering Hunan University Changsha 410082 China

In order to provide guidance for the development of high performance millimeter-wave complementary metal oxide semiconductor (MMW-CMOS) integrated circuits (IC), this paper provides a survey of key technologies on MMW-CMOS IC. Technical background of MMW wireless communications is described. Then the recent development of the critical technologies of the MMW-CMOS IC are introduced in detail and compared. A summarization is given, and the development prospects on MMW-CMOS IC are also discussed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations

arXiv

引用

arXiv 2017年

作者： Li, Wenjun Peng, Huan Yang, Yongjie School Of Computer And Communication Engineering Hunan Provincial Key Laboratory Of Intelligent Processing Of Big Data On Transportation Changsha University Of Science And Technology Changsha China Economic Theory Saarland University Saarbrücken Germany

In the {CLAW, DIAMOND}-FREE EDGE DELETION problem (CDFED), we are given a graph G and an integer k > 0, and the question is whether there are at most k edges whose deletion results in a graph without claws and diamonds as induced subgraphs. Based on some refined observations, we propose a kernel of O(k3) vertices and O(k4) edges, significantly improving the previous kernel of O(k12) vertices and O(k24) edges. In addition, we derive an O∗(3.792k)-time algorithm for CDFED. Copyright © 2017, The Authors. All rights reserved.

关键词： Diamonds

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：