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

IEEE Conference on Energy Internet and Energy System Integration

作者： Lei Qiao Zhe Zheng Wenpeng Cui Weilong Zhang Xueping Jiang Research Department of Smart Chip Global Energy Interconnection Research Institute State Grid Key Laboratory of Information & Network Security State Grid Laboratory of Electric Power Communication Network Technology

ISBN: (纸本)9781538614280

We present a design of the common platform of wireless communication based on FPGA. The platform, developed by us, allows researchers to modify transport protocols on any layer of an OSI reference model, from physical layer to application one, thereby it is feasible to implement multiple wireless communication protocols on different layers.

关键词： Wireless communication OFDM FPGA

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of parallel replica molecular dynamics

引用

AIP Conference Proceedings 2018年第1期1978卷

作者： Boyao Zhang Jue Wang Yangde Feng Ji Xiang Lei Wang 1Computer Network Information Center Chinese Academy of Science Department of High Performance Computing Technology and Application Development Beijing China 2University of Chinese Academy of Sciences Beijing China 3State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences China 4School of cybersecurity Chinese Academy of Sciences China

Molecular dynamics simulation is an important tool for studying materials microstructure evolution under radiation effects. It is difficult to simulate atomic diffusion in materials owing to the time-scale limitations of the molecular dynamics method. Accelerated molecular dynamics has been developed as a solution and the parallel replica method is the simplest and most accurate of the accelerated dynamics techniques. The simulation time scale can reach several orders more than the direct molecular dynamics, while retaining the complete atomic detail. In parallel replica method, the entire system is replicated on each of M available parallel or distributed processors, it is in line with the characteristics of high-performance parallel computing and can be optimized from the program level.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Strongly average-case secure obfuscation: achieving input privacy and circuit obscurity

Strongly average-case secure obfuscation: achieving input pr...

引用

作者： Zhang, Mingwu Mu, Yi Shen, Jian Huang, Xinyi School of Computer Science Hubei University of Technology Wuhan430068 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing China Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University China School of Computing and Information Technology University of Wollongong NSW2522 Australia

A program obfuscator is a compiling algorithm that takes a program/circuit as input and generates a new garbled circuit to implement the same functionality as before while obtaining hard-to-understand in some sense, that is, infeasible to learn information from the garbled circuit. In order to obtain a practical application, an obfuscation should satisfy equivalent in functionality, polynomial slowdown in efficiency, and virtual black-box in security. In this paper, we model a stronger cryptographic obfuscation that does not only achieves the obfuscated circuit obscurity but also supports input re-key privacy. In order to implement the re-encryption obfuscation, we at first propose a key-privacy two-level encryption mechanism that implicitly supports the transformation from level-2 ciphertext into level-1 one, which provides an efficient method to re-encrypt the ciphertext without explicitly decryption procedure. Under the mechanism of two-level encryption and function of re-encryption, we construct an obfuscation of re-encryption that takes as input a probabilistic (keys) circuit and outputs a transformed circuit. We also give the proof that the obfuscator achieves the average-case security for the circuit family under the extended DBDH assumption and Decisional Linear assumption in the standard model. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Learning to segment with image-level annotations

引用

Pattern Recognition 2016年 59卷 234-244页

作者： Wei, Yunchao Liang, Xiaodan Chen, Yunpeng Jie, Zequn Xiao, Yanhui Zhao, Yao Yan, Shuicheng Institute of information Science Beijing Jiaotong University Beijing 100044 China Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing 100044 China School of Advanced Computing Sun Yat-Sen University Guangzhou 510006 China Vision and Machine Learning Lab National University of Singapore 117583 Singapore People׳s Public Security University of China Beijing 100038 China

Recently, deep convolutional neural networks (DCNNs) have significantly promoted the development of semantic image segmentation. However, previous works on learning the segmentation network often rely on a large number of ground-truths with pixel-level annotations, which usually require considerable human effort. In this paper, we explore a more challenging problem by learning to segment under image-level annotations. Specifically, our framework consists of two components. First, reliable hypotheses based localization maps are generated by incorporating the hypotheses-aware classification and cross-image contextual refinement. Second, the segmentation network can be trained in a supervised manner by these generated localization maps. We explore two network training strategies for achieving good segmentation performance. For the first strategy, a novel multi-label cross-entropy loss is proposed to train the network by directly using multiple localization maps for all classes, where each pixel contributes to each class with different weights. For the second strategy, the rough segmentation mask can be inferred from the localization maps, and then the network is optimized based on the single-label cross-entropy loss with the produced masks. We evaluate our methods on the PASCAL VOC 2012 segmentation benchmark. Extensive experimental results demonstrate the effectiveness of the proposed methods compared with the state-of-the-arts. © 2016 Elsevier Ltd

关键词： Deep learning Semantic segmentation Weakly supervised

来源：评论

学校读者我要写书评

暂无评论

Robust low-rank tensor factorization by cyclic weighted median

引用

Science China(information Sciences) 2015年第5期58卷 145-155页

作者： MENG DeYu ZHANG Biao XU ZongBen ZHANG Lei GAO ChenQiang Institute for Information and System Sciences and Ministry of Education Key Lab for Intelligent Networks and Network Security Xi'an Jiaotong University Department of Computing Hong Kong Polytechnic University Chongqing Key Laboratory of Signal and Information Processing Chongqing University of Posts and Telecommunications

Low-rank tensor factorization(LRTF) provides a useful mathematical tool to reveal and analyze multi-factor structures underlying data in a wide range of practical applications. One challenging issue in LRTF is how to recover a low-rank higher-order representation of the given high dimensional data in the presence of outliers and missing entries, i.e., the so-called robust LRTF problem. The L1-norm LRTF is a popular strategy for robust LRTF due to its intrinsic robustness to heavy-tailed noises and outliers. However, few L1-norm LRTF algorithms have been developed due to its non-convexity and non-smoothness, as well as the high order structure of data. In this paper we propose a novel cyclic weighted median(CWM) method to solve the L1-norm LRTF problem. The main idea is to recursively optimize each coordinate involved in the L1-norm LRTF problem with all the others fixed. Each of these single-scalar-parameter sub-problems is convex and can be easily solved by weighted median filter, and thus an effective algorithm can be readily constructed to tackle the original complex problem. Our extensive experiments on synthetic data and real face data demonstrate that the proposed method performs more robust than previous methods in the presence of outliers and/or missing entries.

关键词： tensor factorization low-rank weighted median filter tensorface

来源：评论

学校读者我要写书评

暂无评论

Some classes of complete permutation polynomials over Fq

引用

Science China Mathematics 2015年第10期58卷 2081-2094页

作者： WU GaoFei LI Nian HELLESETH Tor ZHANG YuQing State Key Laboratory of Integrated Service Networks Xidian University Information Security and National Computing Grid Laboratory Southwest Jiaotong University Department of Informatics University of Bergen National Computer Network Intrusion Protection Center University of Chinese Academy of Sciences

By using a powerful criterion for permutation polynomials, we give several classes of complete permutation polynomials over finite fields. First, two classes of complete permutation monomials whose exponents are of Niho type are presented. Second, for any odd prime p, we give a sufficient and necessary condition for a-1xdto be a complete permutation polynomial over Fp4 k, where d =(p4k-1)/(pk-1)+ 1 and a ∈ F*p4k. Finally, we present a class of complete permutation multinomials, which is a generalization of recent work.

关键词： finite field complete permutation polynomials Walsh transform Niho exponents Dickson polynomials

来源：评论

学校读者我要写书评

暂无评论

PEVTS: Privacy-Preserving Electric Vehicles Test-Bedding Scheme

PEVTS: Privacy-Preserving Electric Vehicles Test-Bedding Sch...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Xu Yang Joseph K. Liu Wei Wu Man Ho Au Willy Susilo Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University China and State Key Laboratory of Cryptology Beijing China Faculty of Information Technology Monash University Australia Department of Computing Hong Kong Polytechnic University Hong Kong School of Computer Science and Software Engineering University of Wollongong Australia

Electric Vehicle (EV) infrastructure is relatively new in many countries. Due to the recency of an EV infrastructure, it is important to carry out a series of testing programs. Furthermore, authenticity for collection of data is necessary for testing programs in order to provide accurate results. At the same time, user privacy should not cease since tracing one's daily logistic movements or behaviour from the EV testing programs means breaching one's privacy. In this paper, we propose a novel solution PEVTS for enabling both data authenticity and user privacy concurrently. Our proposed system provides great flexibility to the authority to choose any arbitrary set of authenticated users for testing in every time period. At the same time, it provides anonymity for all participating users. Yet it can trace any vehicle within a time period for statistical purpose. We give a detailed description of our system. We also implement the prototype of our system to show its practicality.

关键词： Testing Privacy Cryptography Electric vehicles Data privacy Authentication

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Forgeability of Wang-Zhu-Feng-Yau’s Attribute-Based Signature with Policy-and-Endorsement Mechanism

引用

Journal of Computer Science & Technology 2013年第4期28卷 743-748页

作者：葛爱军黄欣沂陈成马传贵张锐 State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Fujian Provincial Key Laboratory of Network Security and Cryptology School of Mathematics and Computer ScienceFujian Normal University Institute of Software Chinese Academy of Sciences

Recently, Wang et al. presented a new construction of attribute-based signature with policy-and-endorsement mechanism. The existential unforgeability of their scheme was claimed to be based on the strong Diffie-Hellman assumption in the random oracle model. Unfortunately, by carefully revisiting the design and security proof of Wang et alfs scheme, we show that their scheme cannot provide unforgeability, namely, a forger, whose attributes do not satisfy a given signing predicate, can also generate valid signatures. We also point out the flaws in Wang et al.＇s proof.

关键词： attribute-based signature existential unforgeability policy-and-endorsement

来源：评论

学校读者我要写书评

暂无评论

ESSVCS: An enriched secret sharing visual cryptography

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8363卷 1-24页

作者： Liu, Feng Yan, Wei Q. Li, Peng Wu, Chuankun State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China School of Computing and Mathematical Sciences Auckland University of Technology 1142 New Zealand Department of Mathematics and Physics North China Electric Power University Baoding Hebei 071003 China

Visual Cryptography (VC) is a powerful technique that combines the notions of perfect ciphers and secret sharing in cryptography with that of raster graphics. A binary image can be divided into shares that are able to be stacked together so as to approximately recover the original image. VC is a unique technique in the sense that the encrypted message can be decrypted directly by the Human Visual System (HVS). The distinguishing characteristic of VC is the ability of secret restoration without the use of computation. However because of restrictions of the HVS, pixel expansion and alignment problems, a VC scheme perhaps can only be applied to share a small size of secret image. In this paper, we propose a general method to let the VC shares carry more secrets, the technique is to use cypher output of private-key systems as the input random numbers of VC scheme, meanwhile the encryption key could be shared, the shared keys could be associated with the VC shares. After this operation, VC scheme and secret sharing scheme are merged with the private-key system. Under this design, we implement a (k,t,n)-VC scheme. Compared to those existing schemes, our approach could greatly enhance the ability of current VC schemes and could cope with pretty rich secrets. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Binary images

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：