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

IEEE Conference on Industrial Electronics and Applications

作者： Jun Zhu Haifeng Yao Tao Yang Qiaomei Zhou Kai Li Key laboratory of Intelligent Computing & Signal Processing (Anhui University) Ministry of Education Technology and Innovation Department Shanghai Research Center for Wireless Communications

ISBN: (纸本)9781467386456

The calculation of small-scale data is commonly used in scientific computing and application domain, and the high-efficiency method of small calculation can give play to the potency of many calculation and application. In this paper, a novel self-adaptive parallel computing method based on the graphics processing unit (GPU) architecture for batches of small scale computing tasks is proposed herein. It also provides two other implementation methods, which are the CPU algorithm and the traditional GPU algorithm, and then compares the efficiency of the three schemes. The experimental results show that the implementation efficiency of this new method on the GPU is better than that of method executed by the CPU and that of the traditional GPU algorithm for batching small-scale computing tasks. And this new approach is furthest utilizing the GPU resources, while a large amount of data is processed.

关键词： Small-scale GPU Batch processing Adaptation Parallel

来源：评论

学校读者我要写书评

暂无评论

A New Acquisition Method Based on Differential Correlation

A New Acquisition Method Based on Differential Correlation

引用

2016 8th IEEE International Conference on Communication Software and Networks(ICCSN 2016)

作者： Sujuan Shang Yanjun Hu Jufeng Luo Yingguan Wang Key laboratory of Intelligent Computing & Signal Processing (Anhui University) Ministry of Education Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences

Acquisition is a key technology in DSSS *** differential correlation is usually employed to eliminate the effect of frequency ***,as the length of pseudo-code grows and the decrease of the SNR,the traditional differential acquisition algorithms will result in great loss of *** paper presents an improved differential acquisition method,named as M-orders Auto-Correlation based on Differential correlation（MAC-DF）.In the proposed method,the input signal is multiplied by the complex conjugate of the pseudo-code to eliminate its *** that,the product is applied to the M-orders Auto-Correlation to compensate the SNR loss caused by the differential *** means of mathematical model to analyze its acquisition *** compare MAC-DF acquisition algorithm with the differential coherent and non-coherent acquisition algorithms through *** simulation results indicate that this algorithm is approximately 5-6dB superior to the traditional differential acquisition algorithms in improving acquisition sensitivity and more adaptive to work under low SNR.

关键词： DSSS Pseudo-code acquisition low SNR differential correlation acquisition algorithm

来源：评论

学校读者我要写书评

暂无评论

Direct optimization of partial AUC with tighter non-convex loss

引用

Journal of Computational and Theoretical Nanoscience 2016年第1期13卷 928-935页

作者： Cheng, Fan Wang, Ying Wang, Jingsong Liao, Tiantian Zhen, Bowen Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui Province230039 China School of Computer Anhui University Hefei230039 China

Partial AUC is a popular performance metric used in many applications such as bioinformatics and biometrics. Optimizing this measure directly is often challenging since no close form solution exists. In recent work, Narasimhan et al. proposed two general SVM based approaches for optimizing the partial AUC in an arbitrary false positive range αβ. The approaches make use of a cutting plane solver based on the structural hinge loss, and a variety of real-world tasks demonstrate the approaches' effectiveness. However, the algorithms have one disadvantage that they are sensitive to the outliers. To fill the gap, in this paper, we propose a new support vector method with tighter ramp loss, which is capable of suppressing these undesirable effects. The algorithm adopts the structural SVM as framework, and defines the objective function based on the non-convex ramp loss. For the problem that the new objective function is neither convex nor smooth, we present to introduce the CCCP for non-convex approximating and use bundle method for the convex optimization. Numerical experiments on different data sets show that the algorithm we proposed is robust to the outliers, and can yield a more accurate model than the existing baseline approaches. © 2016 American Scientific Publishers All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

An integratable verifiable secret sharing mechanism

引用

International Journal of Network Security 2016年第4期18卷 617-624页

作者： Liu, Yanjun Chang, Chin-Chen Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University No. 111 Jiulong Rd Hefei230601 China Department of Computer Science and Information Engineering Asia University No. 500 Lioufeng Rd Wufeng Taichung413 Taiwan Department of Information Engineering and Computer Science Feng Chia University No. 100 Wenhwa Rd Seatwen Taichung413 Taiwan

Threshold secret sharing (SS), also denoted as (t, n) SS, has been used extensively in the area of information se- curity, such as for group authentication, cloud storage schemes, secure parallel communication and wireless mul- tipath routing protocols. However, a (t, n) SS cannot de- tect any deceptions among the dealer and shareholders. Veriable secret sharing (VSS) overcomes the weakness of (t, n) SS in such a way that it is able to detect cheaters by verifying the validity of shares or the correctness of the recovered secret under the condition that both shares and the secret are not compromised. Recently, two non- interactive VSSs based on Asmuth-Bloom's SS were pro- posed by Harn et al. and Liu et al., respectively. Both VSSs require shareholders to examine the range of values of some integers related to the secret before recovering the secret, which is a time-consuming operation. In this paper, we propose a novel integratable VSS mechanism that integrates the concepts of the generalized Chinese remainder theorem (GCRT), Shamir's SS and Asmuth- Bloom's SS. Our proposed VSS can verify that the secret reconstructed by any t or more shareholders is the same as the one that the dealer has generated. Analysis shows that our proposed VSS can provide perfect secrecy and better efficiency.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Protein folding kinetic order prediction from amino acid sequence based on horizontal visibility network

引用

Current Bioinformatics 2016年第2期11卷 173-185页

作者： Zhao, Zhi-Qin Yu, Zu-Guo Anh, Vo Wu, Jing-Yang Han, Guo-Sheng 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 XiangtanHunan411105 China School of Mathematical Sciences Queensland University of Technology GPO Box 2434 BrisbaneQ4001 Australia School of Science Xi’an Shiyou University 18 Second Dianzi Road Yanta District Xi’anShaanxi710065 China

Protein folding is one of the most important problems in molecular biology. The kinetic order of protein folding is one of the main aspects of the folding process. Previous methods for predicting protein folding kinetic order require to use the information on tertiary or predicted secondary structure of a protein. In this paper, based on physicochemical properties of amino acids, we propose an approach to predict the protein folding kinetic order from the primary structure of a protein using support vector machine combined with principal component analysis. The horizontal visibility network, Hilbert-Huang transform, global descriptor, and Lempel-Ziv complexity are used to extract features in our approach. To evaluate our approach, the leave-one-out cross-validation test is employed on two widely-used data sets ("IvankovData" and "ZhengData" data sets) consisting of two-state and multi-state proteins. The overall accuracies of prediction can reach 83.87% for "IvankovData" data set and 85% for "ZhengData" data set respectively. Comparisons with the existing methods show that the present approach performs better on the "IvankovData" data set. These results indicate that the present approach is effective and valuable for predicting protein folding kinetic order. Based on factor analysis, we find that the length of protein sequence, hydrophobicity and hydrophilicity of amino acids are important features in our approach. © 2016 Bentham Science Publishers

关键词： Hilbert-Huang transform

来源：评论

学校读者我要写书评

暂无评论

A new modified differential evolution for global optimisation

引用

International Journal of Wireless and Mobile computing 2016年第1期10卷 56-61页

作者： You, Xuemei Ma, Yinghong Liu, Zhiyuan School of Management Science and Engineering Shandong Normal University Jinan250014 China Key Laboratory of Intelligent Computing Signal Processing Ministry of Education Anhui University Hefei230039 China

Differential evolution (DE) is a population-based random optimisation algorithm, which has been used to solve benchmark functions and real-world optimisation problems. The DE has three important operators: mutation, crossover, and selection. The mutation operator in the original DE can hardly balance the exploitation and exploration of the search. In this paper, we design a new mutation operator to improve the exploitation ability of DE. Experiments are carried out on 13 classical test functions. Simulation results show that the new mutation scheme can help DE to find better solutions than three other classical DE mutation strategies. © Copyright 2016 Inderscience Enterprises Ltd.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

A mobility model for opportunistic networks in commercial areas

引用

International Journal of Networking and Virtual Organisations 2016年第4期16卷 402-416页

作者： Yang, Wanchun Peng, Shiyao Department of College of Information Engineering Key Laboratory of Intelligent Computing and Information Processing of Education Ministry Xiangtan University Xiangtan Hunan China

In this paper, we propose a mobility model for opportunistic networks in a commercial area (MMCA). The commercial area is divided into two parts: internal and external areas. We modified the traditional susceptible-infected-removed (SIR) model for predicting the performance of the message forwarding in MMCA. Using the opportunistic networks environment (ONE) simulation platform, we validated this modified SIR by comparing the theoretical results and modelled data from ONE. We further analyse the performances of MMCA with the number of nodes, walking speeds, communication ranges and the size of areas. © 2016 Inderscience Enterprises Ltd.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Cross-layer power allocation scheme for wireless full duplex relaying system

Cross-layer power allocation scheme for wireless full duplex...

引用

International Conference on Communication Software and Networks, ICCSN

作者： Mengmeng He Yanjun Hu Hui Zhi Quan Yuan Ministry of Education Key Lab of Intelligent Computing and Signal Processing China School of Electronics and Information Engineering Anhui University Hefei China

In this paper, we propose a cross-layer power allocation scheme over wireless relay networks for quality-of-service(QoS) guarantees. We formulate our original throughput maximization problem into effective capacity maximization problem by applying information theory and the concept of the effective capacity. In our scheme, we focus on full duplex mode and amplify-and-forward(AF) protocol. In particular, our proposed scheme derives closed-form expressions and analyzes the impacts of the SNR of the interference channel on the performance of full duplex relaying system. For comparison purpose, we also give the analysis of half duplex relaying system. Simulation results show that our proposed power allocation scheme can support diverse QoS guarantees and achieve better effective capacity than equal power allocation scheme and direct transmission scheme. Our analysis also indicate that the perfect full duplex mode can achieve twice optimal effective capacity of the half duplex mode.

关键词： Relays Resource management Quality of service Protocols Wireless communication Physical layer signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Pisano period codes

arXiv

引用

arXiv 2017年

作者： Shi, Minjia Zhang, Zhongyi Solé, Patrick Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University No. 3 Feixi Road Hefei Anhui Province230039 China School of Mathematical Sciences Anhui University Hefei230601 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China School of Wendian Anhui University Hefei Anhui230601 China CNRS/LAGA University of Paris 8 2 rue de la Liberté Saint-Denis93 526 France

The cyclic codes with parity check polynomial the reciprocal of the characteristic polynomial of the Fibonacci recurrence over a prime finite field are shown to have either one weight or two weights. When these codes are irreducible cyclic we obtain many counterexamples to the conjectural classification of two-weight irreducible cyclic codes of Schmidt and White (2002). When they are reducible and projective their duals are uniformly packed. Copyright © 2017, The Authors. All rights reserved.

关键词： Number theory

来源：评论

学校读者我要写书评

暂无评论

Constructions of optimal LCD codes over large finite fields

arXiv

引用

arXiv 2017年

作者： Sok, Lin Shi, Minjia Solé, Patrick School of Mathematical Sciences Anhui University Hefei Anhui230601 Department of Mathematics Royal University of Phnom Penh Cambodia Key Laboratory of Intelligent Computing Signal Processing Ministry of Education Anhui University No.3 Feixi Road Hefei Anhui230039 China School of Mathematical Sciences Anhui University HefeiAnhui230601 China National Mobile Communications Research Laboratory Southeast University China CNRS/LAGA University of Paris 8 Saint-Denis93 526 France

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis. Copyright © 2017, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：