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

A Note on Determine the Greatest Common Subfamily of Two NFSRs by Grbner Basis

Journal of Systems Science & Complexity 2015年第5期28卷 1231-1242页

作者： WANG Zhongxiao QI Wenfeng TIAN Tian Luoyang University of Foreign Language State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute

For nonlinear feedback shift registers(NFSRs), their greatest common subfamily may be not unique. Given two NFSRs, the authors only consider the case that their greatest common subfamily exists and is unique. If the greatest common subfamily is exactly the set of all sequences which can be generated by both of them, the authors can determine it by Grbner basis theory. Otherwise, the authors can determine it under some conditions and partly solve the problem.

关键词： Greatest common subfamily Grbner basis nonlinear feedback shift register stream cipher

来源：评论

学校读者我要写书评

暂无评论

The interactive mechanism of static and dynamic analysis in the reverse analysis of embedded software

International Journal of Multimedia and Ubiquitous Engineeri...

引用

International Journal of Multimedia and Ubiquitous engineering 2016年第10期11卷 33-44页

作者： Tie-Ming, Liu Lie-Hui, Jinag Jing-Si, Zhu Gang, Meng The State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450000 China ZhengZhou University of Science and Technology Zhengzhou450064 China

Because the software reverse analysis method which combined the dynamic and static analyses lacks normative interactive mode, the work of the software reverse analysis is inefficient, and its reusability is poor. Based on dynamic and static analysis process of the embedded software, three kinds of interactive mechanism are proposed, including Static To Dynamic (STD), Dynamic To Static (DTS), Static and Dynamic simultaneous (SDM), and has also presented the method of realizing these three interaction mechanisms in detail. The test results show that interactive mechanisms of STD, DTS and SDM are suitable for correction of abnormal nodes in the results of static analysis, optimization of dynamic information extraction, identification of hidden codes and so on. It can greatly improve work efficiency of the embedded software reverse analysis. © 2016 SERSC.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Video behavior recognition based on locally compressive sensing

引用

Qinghua Daxue Xuebao/Journal of Tsinghua University 2018年第6期58卷 581-586页

作者： Wang, Wenfeng Chen, Xi Wang, Haiyang Peng, Wei Qian, Jing Zheng, Hongwei State Key Laboratory of Desert and Oasis Ecology Xinjiang Institute of Ecology and Geography Chinese Academy of Sciences Urumqi830011 China Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China School of Information Science and Engineering Xiamen University Xiamen361005 China Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China

Compressive sensing has been successfully applied in the field of target tracking but not for behavior recognition. This paper presents a locally compressive sensing algorithm for behavior analysis which combines compressive tracking and centroid localization for recognition of video object behavior. Local compressive sensing selects a behavior-sensitive area for compressive tracking which characterizes target behavior based on classification of the object trajectory and local centroid velocity. Tests show that locally compressive sensing can accurately recognize global behavior such as running and falling and local behavior such as smiles and blinking. Therefore, the locally compressive sensing method is of great value that can be used for video surveillance and behavior recognition. © 2018, Tsinghua University Press. All right reserved.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

Population of Merging Compact Binaries Inferred Using Gravitational Waves through GWTC-3

引用

Physical Review X 2023年第1期13卷 011048-011048页

作者： R. Abbott T. D. Abbott F. Acernese K. Ackley C. Adams N. Adhikari R. X. Adhikari V. B. Adya C. Affeldt D. Agarwal M. Agathos K. Agatsuma N. Aggarwal O. D. Aguiar L. Aiello A. Ain P. Ajith T. Akutsu P. F. de Alarcón S. Akcay S. Albanesi A. Allocca P. A. Altin A. Amato C. Anand S. Anand A. Ananyeva S. B. Anderson W. G. Anderson M. Ando T. Andrade N. Andres T. Andrić S. V. Angelova S. Ansoldi J. M. Antelis S. Antier F. Antonini S. Appert Koji Arai Koya Arai Y. Arai S. Araki A. Araya M. C. Araya J. S. Areeda M. Arène N. Aritomi N. Arnaud M. Arogeti S. M. Aronson K. G. Arun H. Asada Y. Asali G. Ashton Y. Aso M. Assiduo S. M. Aston P. Astone F. Aubin C. Austin S. Babak F. Badaracco M. K. M. Bader C. Badger S. Bae Y. Bae A. M. Baer S. Bagnasco Y. Bai L. Baiotti J. Baird R. Bajpai M. Ball G. Ballardin S. W. Ballmer A. Balsamo G. Baltus S. Banagiri D. Bankar J. C. Barayoga C. Barbieri B. C. Barish D. Barker P. Barneo F. Barone B. Barr L. Barsotti M. Barsuglia D. Barta J. Bartlett M. A. Barton I. Bartos R. Bassiri A. Basti M. Bawaj J. C. Bayley A. C. Baylor M. Bazzan B. Bécsy V. M. Bedakihale M. Bejger I. Belahcene V. Benedetto D. Beniwal T. F. Bennett J. D. Bentley M. BenYaala F. Bergamin B. K. Berger S. Bernuzzi C. P. L. Berry D. Bersanetti A. Bertolini J. Betzwieser D. Beveridge R. Bhandare U. Bhardwaj D. Bhattacharjee S. Bhaumik I. A. Bilenko G. Billingsley S. Bini R. Birney O. Birnholtz S. Biscans M. Bischi S. Biscoveanu A. Bisht B. Biswas M. Bitossi M.-A. Bizouard J. K. Blackburn C. D. Blair D. G. Blair R. M. Blair F. Bobba N. Bode M. Boer G. Bogaert M. Boldrini L. D. Bonavena F. Bondu E. Bonilla R. Bonnand P. Booker B. A. Boom R. Bork V. Boschi N. Bose S. Bose V. Bossilkov V. Boudart Y. Bouffanais A. Bozzi C. Bradaschia P. R. Brady A. Bramley A. Branch M. Branchesi J. Brandt J. E. Brau M. Breschi T. Briant J. H. Briggs A. Brillet M. Brinkmann P. Brockill A. F. Brooks J. Brooks D. D. Brown S. Brunett G. Bruno R. Bruntz J. Bryant T. Bulik H. J. Bulten A. Buonanno R. Buscicchio D. Buskulic C. Buy R. L. Byer L. Cadonati LIGO Laboratory California Institute of Technology Pasadena California 91125 USA Louisiana State University Baton Rouge Louisiana 70803 USA Dipartimento di Farmacia Università di Salerno I-84084 Fisciano Salerno Italy INFN Sezione di Napoli Complesso Universitario di Monte S. Angelo I-80126 Napoli Italy OzGrav School of Physics & Astronomy Monash University Clayton 3800 Victoria Australia LIGO Livingston Observatory Livingston Louisiana 70754 USA University of Wisconsin-Milwaukee Milwaukee Wisconsin 53201 USA OzGrav Australian National University Canberra Australian Capital Territory 0200 Australia Max Planck Institute for Gravitational Physics (Albert Einstein Institute) D-30167 Hannover Germany Leibniz Universität Hannover D-30167 Hannover Germany Inter-University Centre for Astronomy and Astrophysics Pune 411007 India University of Cambridge Cambridge CB2 1TN United Kingdom Theoretisch-Physikalisches Institut Friedrich-Schiller-Universität Jena D-07743 Jena Germany University of Birmingham Birmingham B15 2TT United Kingdom Center for Interdisciplinary Exploration & Research in Astrophysics (CIERA) Northwestern University Evanston Illinois 60208 USA Instituto Nacional de Pesquisas Espaciais 12227-010 São José dos Campos São Paulo Brazil Gravity Exploration Institute Cardiff University Cardiff CF24 3AA United Kingdom INFN Sezione di Pisa I-56127 Pisa Italy International Centre for Theoretical Sciences Tata Institute of Fundamental Research Bengaluru 560089 India Gravitational Wave Science Project National Astronomical Observatory of Japan (NAOJ) Mitaka City Tokyo 181-8588 Japan Advanced Technology Center National Astronomical Observatory of Japan (NAOJ) Mitaka City Tokyo 181-8588 Japan Universitat de les Illes Balears IAC3–IEEC E-07122 Palma de Mallorca Spain University College Dublin Dublin 4 Ireland INFN Sezione di Torino I-10125 Torino Italy Università di Napoli “Federico II” Complesso Universitario di Monte S. Angelo I-80126 Napoli

We report on the population properties of compact binary mergers inferred from gravitational-wave observations of these systems during the first three LIGO-Virgo observing runs. The Gravitational-Wave Transient Catalog 3 (GWTC-3) contains signals consistent with three classes of binary mergers: binary black hole, binary neutron star, and neutron star–black hole mergers. We infer the binary neutron star merger rate to be between 10 and 1700 Gpc−3 yr−1 and the neutron star–black hole merger rate to be between 7.8 and 140 Gpc−3 yr−1, assuming a constant rate density in the comoving frame and taking the union of 90% credible intervals for methods used in this work. We infer the binary black hole merger rate, allowing for evolution with redshift, to be between 17.9 and 44 Gpc−3 yr−1 at a fiducial redshift (z=0.2). The rate of binary black hole mergers is observed to increase with redshift at a rate proportional to (1+z)κ with κ=2.9−1.8+1.7 for z≲1. Using both binary neutron star and neutron star–black hole binaries, we obtain a broad, relatively flat neutron star mass distribution extending from 1.2−0.2+0.1 to 2.0−0.3+0.3M⊙. We confidently determine that the merger rate as a function of mass sharply declines after the expected maximum neutron star mass, but cannot yet confirm or rule out the existence of a lower mass gap between neutron stars and black holes. We also find the binary black hole mass distribution has localized over- and underdensities relative to a power-law distribution, with peaks emerging at chirp masses of 8.3−0.5+0.3 and 27.9−1.8+1.9M⊙. While we continue to find that the mass distribution of a binary’s more massive component strongly decreases as a function of primary mass, we observe no evidence of a strongly suppressed merger rate above approximately 60M⊙, which would indicate the presence of a upper mass gap. Observed black hole spins are small, with half of spin magnitudes below χi≈0.25. While the majority of spins are preferentially aligned wi

关键词： Gravitational wave sources Gravitational waves Gravitational wave detection

来源：评论

学校读者我要写书评

暂无评论

Improved MOPSO algorithm based on map-reduce model in cloud resource scheduling

引用

Journal of Computers (Taiwan) 2016年第2期27卷 67-78页

作者： Zhang, Heng-Wei Niu, Kan Wang, Jin-Dong Wang, Na Zhengzhou Institute of Information Science and Technology Zhengzhou450001 China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001 China

A multi-objective resource scheduling model with quality of service (QoS) restriction was built to improve the computing efficiency of Map-Reduce resource scheduling. The model considered the scheduling problem of both Map and Reduce phase and a chaotic multi-objective particle swarm algorithm was proposed to solve the model. The information entropy theory was used to maintain nondomination solution set by the algorithm so as to retain the diversity of solution and the uniformity of distribution. By Sigma methods to achieve fast convergence, chaotic disturbance mechanism was intro-duced to improve the diversity of the population and the ability of global optimization algorithm, which can avoid the algo-rithm from falling into local extremism. The experiments show that the number of iteration in the algorithm obtaining solu-tions is little and nondomination solutions distribute equably. In solving Map-Reduce resource scheduling problems, it indi-cates that the astringency and the diversity of solution set of this algorithm are better than the traditional multi-objective particle swarm algorithm.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

A Rational Secret Sharing Relying on Reputation

A Rational Secret Sharing Relying on Reputation

引用

International Conference on Intelligent Networking and Collaborative Systems (INCOS)

作者： Jianghao Jin Xie Zhou Chuangui Ma Xu'an Wang State Key laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Henan China Engineering University of CAPF Xi'an Shanxi China

Many of the existing rational protocols do not notice that some behavior of participants may be problematic. These participants themselves do not benefit from the behavior, while it reduces the utilities of other participants. Besides, this behavior will reduce the efficiency of the protocols. In this paper, a novel rational fair exchange protocol is proposed based on the reputation system. The computation of the reputation is completed by the third party, which reduces the computation work of the participants. The rational participants who get higher reputation in our protocol will obtain more utilities. The protocol can deal with the problem above because rational participants always hope to improve their utilities. Compared with other existing protocols, our protocol needs only one round. Furthermore, we prove that our protocol is rational fair.

关键词： Protocols Cryptography Lead Games Nash equilibrium Collaboration

来源：评论

学校读者我要写书评

暂无评论

Formalization of the Access Control on ARM-Android Platform with the B Method

引用

Journal of Physics: Conference Series 2017年第1期933卷

作者： Lu Ren Wei Wang Xiaodong Zhu Yujia Man Qing Yin State Key Laboratory of Mathematic Engineering and Advanced Computing Zhengzhou China 450001

ARM-Android is a widespread mobile platform with multi-layer access control mechanisms, security-critical in the system. Many access control vulnerabilities still exist due to the course-grained policy and numerous engineering defects, which have been widely studied. However, few researches focus on the mechanism formalization, including the Android permission framework, kernel process management and hardware isolation. This paper first develops a comprehensive formal access control model on the ARM-Android platform using the B method, from the Android middleware to hardware layer. All the model specifications are type checked and proved to be well-defined, with 75%of proof obligations demonstrated automatically. The results show that the proposed B model is feasible to specify and verify access control schemes in the ARM-Android system, and capable of implementing a practical control module.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Joint product numerical range and geometry of reduced density matrices

引用

Science China(Physics,Mechanics & Astronomy) 2017年第2期60卷 9-17页

作者： Jianxin Chen Cheng Guo Zhengfeng Ji Yiu-Tung Poon Nengkun YU Bei Zeng Jie Zhou Joint Center for Quantum Information and Computer Science University of Maryland College Park 20740 USA Institute for Advanced Study Tsinghua University Beijing 100084 China Centre for Quantum Computation ＆ Intelligent Systems School of Software Faculty of Engineering and Information Technology University of Technology Sydney Sydney 2007 Australia State Key Laboratory of Computer Science.Institute of Software Chinese Academy of Sciences Beijing 100084 China Department of Mathematics Iowa State University Ames 50011-2140 USA Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Canada Department of Mathematics ＆ Statistics University of Guelph Guelph N1G 2 W1 Canada Perimeter Institute for Theoretical Physics Waterloo N2L 2Y5 Canada

The reduced density matrices of a many-body quantum system form a convex set, whose three-dimensional projection is convex in R3. The boundary of may exhibit nontrivial geometry, in particular ruled surfaces. Two physical mechanisms are known for the origins of ruled surfaces： symmetry breaking and gapless. In this work, we study the emergence of ruled surfaces for systems with local Hamiltonians in infinite spatial dimension, where the reduced density matrices are known to be separable as a consequence of the quantum de Finetti＇s theorem. This allows us to identify the reduced density matrix geometry with joint product numerical range II of the Hamiltonian interaction terms. We focus on the case where the interaction terms have certain structures, such that a ruled surface emerges naturally when taking a convex hull of ∏. We show that, a ruled surface on sitting in ∏ has a gapless origin, otherwise it has a symmetry breaking origin. As an example, we demonstrate that a famous ruled surface, known as the oloid, is a possible shape of , with two boundary pieces of symmetry breaking origin separated by two gapless lines.

关键词： reduced density matrices quantum tomography numerical range quantum information oloid ruled surface

来源：评论

学校读者我要写书评

暂无评论

Network slicing for service-oriented networks under resource constraints

arXiv

引用

arXiv 2017年

作者： Zhang, Nan Liu, Ya-Feng Farmanbar, Hamid Chang, Tsung-Hui Hong, Mingyi Luo, Zhi-Quan School of Mathematical Sciences Peking University State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China Huawei Canada Research Center Ottawa Canada Department of Electrical and Computer Engineering University of Minnesota United States Shenzhen Research Institute of Big Data Chinese University of Hong Kong Shenzhen China

To support multiple on-demand services over fixed communication networks, network operators must allow flexible customization and fast provision of their network resources. One effective approach to this end is network virtualization, whereby each service is mapped to a virtual subnetwork providing dedicated on-demand support to network users. In practice, each service consists of a prespecified sequence of functions, called a service function chain (SFC), while each service function in a SFC can only be provided by some given network nodes. Thus, to support a given service, we must select network function nodes according to the SFC and determine the routing strategy through the function nodes in a specified order. A crucial network slicing problem that needs to be addressed is how to optimally localize the service functions in a physical network as specified by the SFCs, subject to link and node capacity constraints. In this paper, we formulate the network slicing problem as a mixed binary linear program and establish its strong NP-hardness. Furthermore, we propose efficient penalty successive upper bound minimization (PSUM) and PSUM-R(ounding) algorithms, and two heuristic algorithms to solve the problem. Simulation results are shown to demonstrate the effectiveness of the proposed algorithms. Copyright © 2017, The Authors. All rights reserved.

关键词： Network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Identification of pre-microRNAs by characterizing their sequence order evolution information and secondary structure graphs

引用

BMC bioinformatics 2018年第SUPPL 19期19卷 521页

作者： Yuanlin Ma Zuguo Yu Guosheng Han Jinyan Li Vo Anh Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education and Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Hunan 411105 China. Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education and Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Hunan 411105 China. yuzuguo@***. School of Electrical Engineering and Computer Science Queensland University of Technology GPO Box 2434 Brisbane Q4001 Australia. yuzuguo@***. Advanced Analytics Institute Faculty of Engineering & IT University of Technology Sydney P.O Box 123 Broadway NSW 2007 Australia. School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane Q4001 Australia.

BACKGROUND:Distinction between pre-microRNAs (precursor microRNAs) and length-similar pseudo pre-microRNAs can reveal more about the regulatory mechanism of RNA biological processes. Machine learning techniques have been widely applied to deal with this challenging problem. However, most of them mainly focus on secondary structure information of pre-microRNAs, while ignoring sequence-order information and sequence evolution information. RESULTS:We use new features for the machine learning algorithms to improve the classification performance by characterizing both sequence order evolution information and secondary structure graphs. We developed three steps to extract these features of pre-microRNAs. We first extract features from PSI-BLAST profiles and Hilbert-Huang transforms, which contain rich sequence evolution information and sequence-order information respectively. We then obtain properties of small molecular networks of pre-microRNAs, which contain refined secondary structure information. These structural features are carefully generated so that they can depict both global and local characteristics of pre-microRNAs. In total, our feature space covers 591 features. The maximum relevance and minimum redundancy (mRMR) feature selection method is adopted before support vector machine (SVM) is applied as our classifier. The constructed classification model is named MicroRNA -NHPred. The performance of MicroRNA -NHPred is high and stable, which is better than that of those state-of-the-art methods, achieving an accuracy of up to 94.83% on same benchmark datasets. CONCLUSIONS:The high prediction accuracy achieved by our proposed method is attributed to the design of a comprehensive feature set on the sequences and secondary structures, which are capable of characterizing the sequence evolution information and sequence-order information, and global and local information of pre-microRNAs secondary structures. MicroRNA -NHPred is a valuable method for pre-microRNAs iden

关键词： Hibert-Huang transform Network PSI-BLAST profiles Pre-microRNA SVM mRMR

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：