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

5th International Conference on computing Communication and Networking Technologies, ICCCNT 2014

作者： Liu, Jun Qian, Qingqing Wu, Xi Ren, Fuji Wang, Wei Chen, Tian School of Computer and Information Hefei University of Technology Hefei230009 China AnHui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei230009 China Department of Information Science and Intelligent Systems Faculty of Engineering University of Tokushima Tokushima7708502 Japan

ISBN: (纸本)9781479926961

To reduce pre-bond and post-bond test cost for 3D IP (Three Dimensional Intellectual Property) cores, this paper proposed a test wrapper optimization technique using BFD(Best Fit Decreasing) and GA (Genetic Algorithm) algorithm under the constraints of TSVs(Through Silicon Vias) number, the proposed technique firstly used BFD to balance the length of pre-bond wrapper chains to reduce pre-bond test time. Then, on the basis of optimization results of pre-bond wrapper chains, the GA was used to stitch pre-bond wrapper chains to form balanced post-bond wrapper chains under the constrained TSVs number to reduce hardware overhead and post-bond test time. Experimental results demonstrated the presented methodology can effectively reduce hardware overhead at the cost of little increased test time. © 2014 IEEE.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

A novel and fast chaotic cryptosystem for image encryption

引用

Journal of Computational and Theoretical Nanoscience 2014年第3期11卷 731-738页

作者： Wang, Bin Wei, Xiaopeng Zhang, Qiang School of Mechanical and Engineering Dalian University of Technology Dalian 116024 China Key Laboratory of Advanced Design and Intelligent Computing Dalian University Ministry of Education Dalian 116622 China

In recent years, there has been growing interesting in image encryption based on chaotic systems. In order to improve the effect of encryption, a large amount of operations are implemented in the most chaos-based cryptosystems. However, the runtime of chaos-based cryptosystems would be increased with the rise of operations. In this paper, a novel algorithm is proposed to generate cipher key for the permutation-diffusion architecture. The cipher key not only relates to the plain-image, but also the generated time of cipher key is shorter than the conventional method. On the premise of security, a novel and fast permutation-diffusion architecture based on chaotic systems and variable control conditions is proposed. For the sake of increasing the key space and enhancing the security of proposed architecture, variable control conditions used in this cryptosystem as the parameter and initial value of same chaotic system are generated from the cipher key related to the plain-image. So the proposed algorithm can effectively resist the most attacks against permutation-diffusion architectures. Finally, theoretical analyses and numerical experimental results show that the proposed chaos-based cryptosystem possesses high security and sound time of image encryption, which is suitable for protecting the image information Copyright © 2014 American Scientific Publishers.

关键词： Chaotic systems

来源：评论

学校读者我要写书评

暂无评论

Laplacian normalization and random walk on heterogeneous networks for disease-gene prioritization

引用

Computational biology and chemistry 2015年 57卷 21-8页

作者： Zhi-Qin Zhao Guo-Sheng Han Zu-Guo Yu Jinyan Li Hunan Key Laboratory for Computation and Simulation in Science and Engineering and Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China. Hunan Key Laboratory for Computation and Simulation in Science and Engineering and Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane Q4001 Australia. Electronic address: yuzg1970@***. Advanced Analytics Institute & Centre for Health Technologies University of Technology Sydney Broadway NSW 2007 Australia. Electronic address: jinyan.li@uts.edu.au.

Random walk on heterogeneous networks is a recently emerging approach to effective disease gene prioritization. Laplacian normalization is a technique capable of normalizing the weight of edges in a network. We use this technique to normalize the gene matrix and the phenotype matrix before the construction of the heterogeneous network, and also use this idea to define the transition matrices of the heterogeneous network. Our method has remarkably better performance than the existing methods for recovering known gene-phenotype relationships. The Shannon information entropy of the distribution of the transition probabilities in our networks is found to be smaller than the networks constructed by the existing methods, implying that a higher number of top-ranked genes can be verified as disease genes. In fact, the most probable gene-phenotype relationships ranked within top 3 or top 5 in our gene lists can be confirmed by the OMIM database for many cases. Our algorithms have shown remarkably superior performance over the state-of-the-art algorithms for recovering gene-phenotype relationships. All Matlab codes can be available upon email request.

关键词： Disease genes and phenotypes Heterogeneous network Laplacian normalization Leave-one-out cross-validation Random walk with restart Shannon information entropy

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A NEW SCHEME BASED ON THE MI SCHEME AND ITS ANALYSIS

引用

Journal of Electronics(China) 2013年第2期30卷 198-203页

作者： Jiao Luyao Li Yifa Qiao Shuaiting Department of Information Science Zhengzhou Information Science and Technology Institute State Key Laboratory of Mathematical Engineering and Advanced Computing

This article aims at designing a new Multivariate Quadratic (MQ) public-key scheme to avoid the linearization attack and differential attack against the Matsumoto-Imai (MI) scheme. Based on the original scheme, our new scheme, named the Multi-layer MI (MMI) scheme, has a structure of multi-layer central map. Firstly, this article introduces the MI scheme and describes linearization attack and differential attack; then prescribes the designation of MMI in detail, and proves that MMI can resist both linearization attack and differential attack. Besides, this article also proves that MMI can resist recent eXtended Linearization (XL)-like methods. In the end, this article concludes that MMI also maintains the efficiency of MI.

关键词： Multivariate Quadratic (MQ) Public-key Cryptosystem (PKC) Matsumoto-Imai (MI) Central map Linearization attack Differential attack eXtended Linearization (XL)

来源：评论

学校读者我要写书评

暂无评论

Identification of global histogram equalization by modeling gray-level cumulative distribution

Identification of global histogram equalization by modeling ...

引用

2013 IEEE China Summit and International Conference on Signal and Information Processing, ChinaSIP 2013

作者： Yuan, Hai-Dong Zhengzhou Information Science and Technology Institute State Key Laboratory of Mathematical Engineering and Advanced Computing China

ISBN: (纸本)9781479910434

Previous studies have shown how to 'fingerprint' certain image processing operation. In this paper, we model the gray-level cumulative distribution of histogram-equalized image as discrete identity function, which is an intrinsic fingerprint produced by global histogram equalization processing. This model is shown to match well with the observed gray-level cumulative distribution. Based on the new model, a classification method is proposed for identifying the use of global histogram equalization processing. In comparison to previous arts, the proposed method can accurately distinguish global histogram equalization from other kinds of contrast enhancement techniques. The effectiveness of the proposed method is exhaustively evaluated in the context of histogram-equalized image identification and resistance against attacks. © 2013 IEEE.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

Topological properties and fractal analysis of a recurrence network constructed from fractional Brownian motions

引用

Physical Review E 2014年第3期89卷 032814-032814页

作者： Jin-Long Liu Zu-Guo Yu Vo Anh Hunan Key Laboratory for Computation and Simulation in Science and Engineering and Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane Q4001 Australia

Many studies have shown that we can gain additional information on time series by investigating their accompanying complex networks. In this work, we investigate the fundamental topological and fractal properties of recurrence networks constructed from fractional Brownian motions (FBMs). First, our results indicate that the constructed recurrence networks have exponential degree distributions; the average degree exponent 〈λ〉 increases first and then decreases with the increase of Hurst index H of the associated FBMs; the relationship between H and 〈λ〉 can be represented by a cubic polynomial function. We next focus on the motif rank distribution of recurrence networks, so that we can better understand networks at the local structure level. We find the interesting superfamily phenomenon, i.e., the recurrence networks with the same motif rank pattern being grouped into two superfamilies. Last, we numerically analyze the fractal and multifractal properties of recurrence networks. We find that the average fractal dimension 〈dB〉 of recurrence networks decreases with the Hurst index H of the associated FBMs, and their dependence approximately satisfies the linear formula 〈dB〉≈2−H, which means that the fractal dimension of the associated recurrence network is close to that of the graph of the FBM. Moreover, our numerical results of multifractal analysis show that the multifractality exists in these recurrence networks, and the multifractality of these networks becomes stronger at first and then weaker when the Hurst index of the associated time series becomes larger from 0.4 to 0.95. In particular, the recurrence network with the Hurst index H=0.5 possesses the strongest multifractality. In addition, the dependence relationships of the average information dimension 〈D(1)〉 and the average correlation dimension 〈D(2)〉 on the Hurst index H can also be fitted well with linear functions. Our results strongly suggest that the recurrence network inherits the basic characteristic

关键词： TOPOLOGICAL property FRACTAL analysis BROWNIAN motion CORRELATION (Statistics) RECURSIVE sequences (Mathematics) COMPUTER networks

来源：评论

学校读者我要写书评

暂无评论

Research on deep neural network's hidden layers in phoneme recognition

Research on deep neural network's hidden layers in phoneme r...

引用

International Symposium on Chinese Spoken Language Processing

作者： Yuan Ma Jianwu Dang Weifeng Li Tianjin Key Laboratory of Cognitive Computing and Application Tianjin University School of Information Science Japan Advanced Institute of Science and Technology Department of Electronic Engineering Tsinghua University

In spite of the great success of the deep neural network (DNN) in speech processing, it is still unclear what kind of underlying mechanisms are involved in this achievement. This preliminary study attempts to find an answer by investigating the functions of DNN's hidden layers in representing speech articulations. Two sets of experiments are performed on the hidden layers in speech recognition. The layer removing experiment is conducted on the English TIMIT database, and the layer replacing experiment is to substitute a layer in an English DNN by the corresponding layer in a Japanese DNN. It is found that the different layers seem to be responsible for different phoneme groups according to the place of articulation. The lower layers are responsible for the back vowels, and the higher layers are responsible for the front vowels. The second layer (i.e. the first hidden layer) of the seven-layer network has major responsibility for more than half of the consonants with the constriction located in the front of the vocal tract, while the other consonants rely on the middle and higher layers. The layer replacing experiment demonstrated that the above relation was language independent. It is necessary to design elaborate studies to discover more details in the future.

关键词： Speech Speech recognition Error analysis Acoustics Speech processing Biological neural networks Production

来源：评论

学校读者我要写书评

暂无评论

Multifractal analysis of weighted networks by a modified sandbox algorithm

引用

Scientific reports 2015年第1期5卷 17628页

作者： Yu-Qin Song Jin-Long Liu Zu-Guo Yu Bao-Gen Li Hunan Key Laboratory for Computation and Simulation in Science and Engineering and Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China. College of Science Hunan University of technology Zhuzhou Hunan 412007 China. School of Mathematical Sciences Queensland University of Technology Brisbane Q4001 Australia.

Complex networks have attracted growing attention in many fields. As a generalization of fractal analysis, multifractal analysis (MFA) is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. Some algorithms for MFA of unweighted complex networks have been proposed in the past a few years, including the sandbox (SB) algorithm recently employed by our group. In this paper, a modified SB algorithm (we call it SBw algorithm) is proposed for MFA of weighted networks. First, we use the SBw algorithm to study the multifractal property of two families of weighted fractal networks (WFNs): "Sierpinski" WFNs and "Cantor dust" WFNs. We also discuss how the fractal dimension and generalized fractal dimensions change with the edge-weights of the WFN. From the comparison between the theoretical and numerical fractal dimensions of these networks, we can find that the proposed SBw algorithm is efficient and feasible for MFA of weighted networks. Then, we apply the SBw algorithm to study multifractal properties of some real weighted networks - collaboration networks. It is found that the multifractality exists in these weighted networks, and is affected by their edge-weights.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Information Transfer Model of Virtual Machine Based on Storage Covert Channel

引用

Wuhan University Journal of Natural Sciences 2013年第5期18卷 377-384页

作者： WANG Xiaorui WANG Qingxian GUO Yudong LU Jianping Fourth Department PLA Information Engineering University State Key Laboratory of Mathematical Engineering and Advanced Computing Department of Communication Command Chongqing Communication Institute

Aiming at the problem that virtual machine information cannot be extracted incompletely, we extend the typical information extraction model of virtual machine and propose a perception mechanism in virtualization system based on storage covert channel to overcome the affection of the semantic gap. Taking advantage of undetectability of the covert channel, a secure channel is established between Guest and virtual machine monitor to pass data directly. The Guest machine can pass the control information of malicious process to virtual machine monitor by using the VMCALL instruction and shared memory. By parsing critical information in process control structure, virtual machine monitor can terminate the malicious processes. The test results show that the proposed mechanism can clear the user-level malicious programs in the virtual machine effectively and covertly. Meanwhile, its performance overhead is about the same as that of other mainstream monitoring mode.

关键词： virtualization safety protection information extraction of virtual machine covert channel process control structure

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：