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

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

关键词： Fractal dimension

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

FACE RECOGNITION BASED ON DOUBLE COMPLEMENTARY SPACE AND MULTI-DECISION CLASSIFICATION

FACE RECOGNITION BASED ON DOUBLE COMPLEMENTARY SPACE AND MUL...

引用

2014 IEEE 3rd International Conference on Cloud computing and Intelligence Systems

作者： Fuji Ren Yanqiu Li Liangfeng Xu Min Hu Xiaohua Wang Affective Computing and Advanced Intelligent Machines Anhui Key Laboratory School of Computer and Information Hefei University of Technology Faculty of Engineering The University of Tokushima770-8506TokushimaJapan

In order to overcome the one-sidedness and limitations of a single subspace in feature extraction and classification,we propose a face recognition method that extracts features in double complementary space and utilize multi-decision for *** the feature extraction stage,we use ICA and LPE algorithm as the first layer in complementary space to extract global and local features of the face ***,for the purpose of solving the problem that features extracted by ICA are lack of classification information,we further extract classification information from the independent features extracted by ICA on the condition that the FLDA and DCV algorithm are used as the second layer in the complementary *** the classification stage,the test samples are firstly projected to the independent *** that,projected the samples which are difficult to identify to the LPE space and reclassified ***,the results are been determined *** results on ORL database show that the proposed method can effectively improve the recognition rate.

关键词： algorithms complementary space multi-decision classification face recognition

来源：评论

学校读者我要写书评

暂无评论

Face recognition based on double complementary space and multi-decision classification

Face recognition based on double complementary space and mul...

引用

IEEE International Conference on Cloud computing and Intelligence Systems (CCIS)

作者： Fuji Ren Yanqiu Li Liangfeng Xu Min Hu Xiaohua Wang School of Computer and Information Hefei University of Technology Anhui China Affective Computing and Advanced Intelligent Machines Anhui Key Laboratory Faculty of Engineering The University of Tokushima Tokushima Japan

ISBN: (纸本)9781467369541

In order to overcome the one-sidedness and limitations of a single subspace in feature extraction and classification, we propose a face recognition method that extracts features in double complementary space and utilize multi-decision for classification. In the feature extraction stage, we use ICA and LPE algorithm as the first layer in complementary space to extract global and local features of the face images. Then, for the purpose of solving the problem that features extracted by ICA are lack of classification information, we further extract classification information from the independent features extracted by ICA on the condition that the FLDA and DCV algorithm are used as the second layer in the complementary space. In the classification stage, the test samples are firstly projected to the independent subspace. After that, projected the samples which are difficult to identify to the LPE space and reclassified them. Finally, the results are been determined comprehensively. Experimental results on ORL database show that the proposed method can effectively improve the recognition rate.

关键词： Feature extraction Classification algorithms Face recognition Face Data mining Entropy Databases

来源：评论

学校读者我要写书评

暂无评论

Constructing Non-binary Asymmetric Quantum Codes via Graphs

引用

China Communications 2013年第2期10卷 33-41页

作者：马智冷日光魏正超钟淑琴 State key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute

The theory of quantum error correcting codes is a primary tool for fighting decoherence and other quantum noise in quantum communication and quantum computation. Recently, the theory of quantum error correcting codes has developed rapidly and been extended to protect quantum information over asymmetric quantum channels, in which phase-shift and qubit-flip errors occur with different probabilities. In this paper, we generalize the construction of symmetric quantum codes via graphs (or matrices) to the asymmetric case, converting the construction of asymmetric quantum codes to finding matrices with some special properties. We also propose some asymmetric quantum Maximal Distance Separable (MDS) codes as examples constructed in this way.

关键词： asymmetric quantum codes quantum MDS codes graph construction

来源：评论

学校读者我要写书评

暂无评论

An out-of-the-box dynamic binary analysis tool for ARM-based linux

An out-of-the-box dynamic binary analysis tool for ARM-based...

引用

5th International Symposium on Cyberspace Safety and Security, CSS 2013

作者： Wang, Zhenyu Ye, Yanqiu Wang, Ruimin Zhengzhou Institute of Information Science and Technology Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9783319035833

Dynamic binary analysis has demonstrated its strength in solving a wide-spectrum of computer security problems. However, existing DBA tools don't support ARM-based OS. The latest version of Valgrind can support ARM executable, but it can't perform the whole-system analysis. The other DBA/DBI frameworks, such as TEMU, PIN and DynamoRIO, do not support ARM architecture. This paper presents a dynamic analysis tool that can extract the whole-system view and analyze the behaviors in ARM-based OS in a whole-system out-of-the-box way. An exploitation analysis module is given to demonstrate how to develop an application module based on this DBA tools. The application example shows this DBA tool has the features of good feasibility and scalability. © Springer International Publishing Switzerland 2013.

关键词： ARM processors

来源：评论

学校读者我要写书评

暂无评论

Search for heavy resonances decaying to a Z boson and a photon in pp collisions at s=13 TeV with the ATLAS detector

引用

Physics Letters, Section B: Nuclear, Elementary Particle and High-Energy Physics 2017年 764卷 11-30页

作者： Aaboud, M. Aad, G. Abbott, B. Abdallah, J. Abdinov, O. Abeloos, B. Aben, R. AbouZeid, O.S. Abraham, N.L. Abramowicz, H. Abreu, H. Abreu, R. Abulaiti, Y. Acharya, B.S. Adachi, S. Adamczyk, L. Adams, D.L. Adelman, J. Adomeit, S. Adye, T. Affolder, A.A. Agatonovic-Jovin, T. Agricola, J. Aguilar-Saavedra, J.A. Ahlen, S.P. Ahmadov, F. Aielli, G. Akerstedt, H. Åkesson, T.P.A. Akimov, A.V. Alberghi, G.L. Albert, J. Albrand, S. Alconada Verzini, M.J. Aleksa, M. Aleksandrov, I.N. Alexa, C. Alexander, G. Alexopoulos, T. Alhroob, M. Ali, B. Aliev, M. Alimonti, G. Alison, J. Alkire, S.P. Allbrooke, B.M.M. Allen, B.W. Allport, P.P. Aloisio, A. Alonso, A. Alonso, F. Alpigiani, C. Alshehri, A.A. Alstaty, M. Alvarez Gonzalez, B. Álvarez Piqueras, D. Alviggi, M.G. Amadio, B.T. Amako, K. Amaral Coutinho, Y. Amelung, C. Amidei, D. Amor Dos Santos, S.P. Amorim, A. Amoroso, S. Amundsen, G. Anastopoulos, C. Ancu, L.S. Andari, N. Andeen, T. Anders, C.F. Anders, G. Anders, J.K. Anderson, K.J. Andreazza, A. Andrei, V. Angelidakis, S. Angelozzi, I. Anger, P. Angerami, A. Anghinolfi, F. Anisenkov, A.V. Anjos, N. Annovi, A. Antel, C. Antonelli, M. Antonov, A. Anulli, F. Aoki, M. Aperio Bella, L. Arabidze, G. Arai, Y. Araque, J.P. Arce, A.T.H. Arduh, F.A. Arguin, J-F. Argyropoulos, S. Arik, M. Armbruster, A.J. Armitage, L.J. Arnaez, O. Arnold, H. Arratia, M. Arslan, O. Artamonov, A. Artoni, G. Artz, S. Asai, S. Asbah, N. Ashkenazi, A. Åsman, B. Asquith, L. Assamagan, K. Astalos, R. Atkinson, M. Atlay, N.B. Augsten, K. Avolio, G. Axen, B. Ayoub, M.K. Azuelos, G. Baak, M.A. Baas, A.E. Baca, M.J. Bachacou, H. Bachas, K. Backes, M. Backhaus, M. Bagiacchi, P. Bagnaia, P. Bai, Y. Baines, J.T. Baker, O.K. Baldin, E.M. Balek, P. Balestri, T. Balli, F. Balunas, W.K. Banas, E. Banerjee, Sw. Bannoura, A.A.E. Barak, L. Barberio, E.L. Barberis, D. Barbero, M. Barillari, T. Barisits, M-S Barklow, T. Barlow, N. Barnes, S.L. Barnett, B.M. Barnett, R.M. Barnovska-Blenessy, Z. Baroncelli, A. Barone, G. Barr, A.J. Barranco Navarro, L. Barreiro, F. Barreiro Gui Department of Physics University of Adelaide Adelaide Australia Physics Department SUNY Albany Albany NY United States Department of Physics University of Alberta Edmonton AB Canada Department of Physics Ankara University Ankara Turkey Istanbul Aydin University Istanbul Turkey Division of Physics TOBB University of Economics and Technology Ankara Turkey LAPP CNRS/IN2P3 Université Savoie Mont Blanc Annecy-le-Vieux France High Energy Physics Division Argonne National Laboratory Argonne IL United States Department of Physics University of Arizona Tucson AZ United States Department of Physics The University of Texas at Arlington Arlington TX United States Physics Department University of Athens Athens Greece Physics Department National Technical University of Athens Zografou Greece Department of Physics The University of Texas at Austin Austin TX United States Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Institut de Física d'Altes Energies (IFAE) The Barcelona Institute of Science and Technology Barcelona Spain Institute of Physics University of Belgrade Belgrade Serbia Department for Physics and Technology University of Bergen Bergen Norway Physics Division Lawrence Berkeley National Laboratory University of California Berkeley CA United States Department of Physics Humboldt University Berlin Germany Albert Einstein Center for Fundamental Physics Laboratory for High Energy Physics University of Bern Bern Switzerland School of Physics and Astronomy University of Birmingham Birmingham United Kingdom Department of Physics Bogazici University Istanbul Turkey Department of Physics Engineering Gaziantep University Gaziantep Turkey Istanbul Bilgi University Faculty of Engineering and Natural Sciences Istanbul Turkey Bahcesehir University Faculty of Engineering and Natural Sciences Istanbul Turkey Centro de Investigaciones Universidad Antonio Narino Bogota Colombia INFN Sezione di Bologna Italy Dipartimento di Fis

This Letter presents a search for new resonances with mass larger than 250 GeV, decaying to a Z boson and a photon. The dataset consists of an integrated luminosity of 3.2 fb−1 of pp collisions collected at s=13 TeV w...

This Letter presents a search for new resonances with mass larger than 250 GeV, decaying to a Z boson and a photon. The dataset consists of an integrated luminosity of 3.2 fb⁻¹ of pp collisions collected at s=13 TeV with the ATLAS detector at the Large Hadron Collider. The Z bosons are identified through their decays either to charged, light, lepton pairs (e⁺e⁻, μ⁺μ⁻) or to hadrons. The data are found to be consistent with the expected background in the whole mass range investigated and upper limits are set on the production cross section times decay branching ratio to Zγ of a narrow scalar boson with mass between 250 GeV and 2.75 TeV. © 2016 The Author(s)

关键词：

来源：评论

学校读者我要写书评

暂无评论

Parallel constraint solution method combining search and consistency

引用

Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (Science and Technology) 2013年第SUPPL.2期44卷 268-272页

作者： Cao, Yan Wang, Qingxian Wei, Qiang Yin, Zhongxu State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou 450001 China

Due to continuous development of multi-core hardware architectures, how to make time-consuming constraint solution have the ability of running in parallel is particularly important. Based on analyzing the relation between backtracking search and consistency technology, the constraint solution method combing parallel search and parallel consistency was proposed. In parallel consistency, a centralized storage-based parallel consistency model was proposed for global constraints to cut off the search space and optimize the search process. The division of search space was studied. Scheduling search space into different processors ensures disjoint and complete in parallel search. The experiments represent that the method is feasible and has higher speedup.

关键词： Consistency Constraint solution Parallelization Search

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：