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

International Conference on Industrial Technology and Management Science(ITMS 2015)

作者： Da Xiao Yong Liu Lujia Cao Shengli Liu Dongyue Yan Zheng Zhou Information Science University State Key Laboratory of Mathematical Engineering and Advanced Computing

For business-oriented type of short-term training courses of this new task of teaching and teaching needs, to carry out an in-depth analysis and research, detailed the demand characteristics of these new teaching curriculum, on this basis, based on the design of a project-driven teaching practices, the implementation process is given in detail all aspects of teaching practice, and the teaching process should have the conditions and problems likely to face in-depth analysis of short-term training courses for such business-oriented type of conduct has implementation of targeted teaching a useful exploration and try.

关键词： P roject-driven Office training Teaching methods Practice

来源：评论

学校读者我要写书评

暂无评论

Vulnerability Analysis for Complex Networks under the Shortest Path-Attack Strategies

Vulnerability Analysis for Complex Networks under the Shorte...

引用

2016 International Conference on Communications, Information Management and Network Security (CIMNS2016)

作者： Yaohui Hao Jihong Han Qinghua Cheng Yongjin Hu Zhengzhou Institute of Information Science and technology State Key Laboratory of Mathematical Engineering and Advanced Computing

ISBN: (纸本)9781510830981

We proposed three shortest path-attack strategies and investigated the vulnerability of three complex model networks under these path-attack strategies. The experimental results indicate that the robustness of random network is the weakest, but small-world network is the strongest under the shortest pathattack strategies. We also obtain that the shortest path-attack strategies are more harmful than RPA(random augmenting approach) attack strategy. These findings supplement and extend the previous attack results and can thus help us to provide some insights into the design of more robust networks.

关键词： vulnerability complex network shortest path-attack degree betweeness

来源：评论

学校读者我要写书评

暂无评论

Nuclear structure of Te isotopes beyond neutron magic number N=82

引用

Physical Review C 2021年第3期103卷 034320-034320页

作者： B. Moon A. Jungclaus H. Naïdja A. Gargano R. Lozeva C.-B. Moon A. Odahara G. S. Simpson S. Nishimura F. Browne P. Doornenbal G. Gey J. Keatings G. Lorusso Z. Patel S. Rice M. Si L. Sinclair P.-A. Söderström T. Sumikama J. Taprogge H. Watanabe J. Wu Z. Y. Xu A. Yagi D. S. Ahn H. Baba F. L. Bello Garrote S. Bönig R. Daido J. M. Daugas F. Didierjean F. Drouet Y. Fang N. Fukuda R. Gernhäuser B. Hong E. Ideguchi S. Ilieva N. Inabe T. Ishigaki T. Isobe H. S. Jung D. Kameda I. Kojouharov T. Komatsubara T. Kröll T. Kubo N. Kurz Y. K. Kwon C. S. Lee P. Lee Z. Li A. Montaner-Pizá S. Morimoto K. Moschner D. Mücher D. Murai M. Niikura H. Nishibata I. Nishizuka R. Orlandi H. Sakurai H. Schaffner Y. Shimizu K. Steiger H. Suzuki H. Takeda K. Tshoo Zs. Vajta A. Wendt R. Yokoyama K. Yoshinaga Center for Exotic Nuclear Studies Institute for Basic Science Daejeon 34126 Republic of Korea RIKEN Nishina Center Wako Saitama 351-0198 Japan Instituto de Estructura de la Materia CSIC E-28006 Madrid Spain Laboratoire de Physique Mathematique et Subatomique Constantine 1 University Constantine 25000 Algeria Istituto Nazionale di Fisica Nucleare Complesso Universitario di Monte S. Angelo I-80126 Napoli Italy IPHC CNRS/IN2P3 and University of Strasbourg F-67037 Strasbourg Cedex 2 France Université Paris-Saclay IJCLab CNRS/IN2P3 F-91405 Orsay France Department of Physics Osaka University Osaka 560-0043 Japan LPSC Université Joseph Fourier Grenoble 1 CNRS/IN2P3 Institut National Polytechnique de Grenoble F-38026 Grenoble Cedex France School of Computing Engineering and Mathematics University of Brighton Brighton BN2 4GJ United Kingdom Institut Laue-Langevin B.P. 156 F-38042 Grenoble Cedex 9 France School of Engineering University of the West of Scotland Paisley PA1 2BE United Kingdom Department of Physics University of Surrey Guildford GU2 7XH United Kingdom Department of Physics University of York Heslington York YO10 5DD United Kingdom Extreme Light Infrastructure-Nuclear Physics (ELI-NP) 077125 Bucharest-Măgurele Romania Departamento de Física Teórica Universidad Autónoma de Madrid E-28049 Madrid Spain School of Physics and State Key Laboratory of Nuclear Physics and Technology Peking University Beijing 100871 China Department of Physics University of Tokyo Tokyo 113-0033 Japan Korea Basic Science Institute (KBSI) Daejeon 34133 Republic of Korea Department of Physics University of Oslo Oslo N-0316 Norway Institut für Kernphysik Technische Universität Darmstadt D-64289 Darmstadt Germany CEA DAM DIF F-91297 Arpajon Cedex France Physik Department E12 Technische Universität München D-85748 Garching Germany Department of Physics Korea University Seoul 02841 Republic of Korea Center for Extreme Nuclear Matters (CENuM) Korea University Seoul 0

Newly observed decay schemes of the nuclei Sb137 and Sb138 are reported. The neutron-rich Sb isotopes were produced by the in-flight fragmentation of a U238 primary beam with an energy of 345 MeV/nucleon. Several new excited states of Te137 with tentatively assigned spin-parities of (5/2−), (9/2−), and (7/2) have been established which play an important role in the evolution of neutron levels beyond N=82. The study of the β decay of Sb138 led to a considerable extension of the level scheme of Te138 including the identification of several nonyrast states. The structure of Te137 and Te138 is discussed on the basis of large-scale shell-model calculations performed using two different effective interactions.

关键词： Beta decay Nuclear structure & decays 90 ≤ A ≤ 149 Radiation detectors Radioactive beams Shell model Spectrometers & spectroscopic techniques

来源：评论

学校读者我要写书评

暂无评论

Research on undergraduate thesis' s tutor allocation based on Dynamic Game Model of Incomplete Information

Research on undergraduate thesis' s tutor allocation based o...

引用

2016 3rd International Conference on Education,Management and computing Technology(ICEMCT 2016)

作者： Hengwei Zhang Zhengzhou Institute of Information Science and Technology State Key Laboratory of Mathematical Engineering and Advanced Computing

Fairness is the prerequisite to the undergraduate thesis' s tutor allocation, which means students have the priority for choosing tutors. Because of rich experience and authoritative discourse power, the senior tutors are usually the objects that students compete for. In the case of information asymmetry, resources of the scarce senior tutors may not be fully utilized, resulting in the decline of thesis quality. In this paper we analyze the efficiency of the existing undergraduate thesis' s tutor allocation by using signaling game model. Finally, the improved allocation is proposed, meanwhile some advices on prompting thesis quality are given.

关键词： Undergraduate Thesis Tutor Allocation Dynamic Game

来源：评论

学校读者我要写书评

暂无评论

City-level geolocation algorithm of network entities based on landmark clustering

City-level geolocation algorithm of network entities based o...

引用

International Conference on advanced Communication Technology (ICACT)

作者： Guang Zhu Xiangyang Luo Fenlin Liu Fan Zhao State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Science and Technology Institute Zhengzhou China

For the existing network entity geolocation algorithms based on the delay measurement are usually suffer from the inflation and jitter of the network delay, a new algorithm of city-level geolocation based on landmark clustering is proposed in this paper. According to the feature of the delays tend to be similar among the neighboring network entities generally, city-level network entities geolocation algorithm based on landmark clustering is given. In the proposed algorithm, the city-level landmarks are divided into several clusters based on the "delay similarity" principle to filters out the high-reliability landmarks for improving the precision of city-level geolocation algorithm, the minimal relative delay between cluster and target is calculated based on the minimal relative delay, and the region of this cluster is taken as the estimation of target's location. The rationality of the delay clustering, feasibility of the proposed algorithm, and experimental results show that the proposed algorithm reduces effectively the delay influence on the IP geolocation algorithms, and the geolocation accuracy is higher than the classic GeoPing algorithm.

关键词： Delays Geology Clustering algorithms IP networks Cities and towns Estimation Reliability

来源：评论

学校读者我要写书评

暂无评论

IP city-level geolocation based on the PoP-level network topology analysis

IP city-level geolocation based on the PoP-level network top...

引用

International Conference on Information Communication and Management (ICICM)

作者： Siqi Liu Fenlin Liu Fan Zhao Lixiang Chai Xiangyang Luo State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Science and Technology Institute Zhengzhou China

ISBN: (纸本)9781509034963

In view of that the reliability of existing typical IP city-level geolocation approaches are limited to the delay measurement accuracy, IP targets reachability and other factors, this paper proposed an IP city-level geolocation approach based on the PoP-level (Point of Presence) network analysis. First, the “low-high-low” distribution characteristics of the one-hop-delay among network nodes in different cities are revealed. The network connections in the IP targets' cities are obtained by partitioning the probe paths based on one-hop-delay. Secondly, the PoP-level network in these cities are analyzed by extracting closely connected network nodes, and PoP city-level location are determined by landmarks contained. Finally, the core routers in these PoPs are selected as the city core routers and used to achieve IP targets city-level geolocation. The experimental results on 4980 IP targets in Henan province of China show that: the average accuracy of the proposed approach is 97.2%, which is much higher than that of the existing typical city-level geolocation approaches based on IP databases or delay measurement. At the same time, some of the IP targets which are not reachable can also achieve a reliable city-level geolocation by this approach.

关键词： IP networks Geology Probes Urban areas Delays Network topology Databases

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Comment on "Inherent security of phase coding quantum key distribution systems against detector blinding attacks" [Laser Phys. Lett. 15, 095203 (2018)]

arXiv

引用

arXiv 2018年

作者： Fedorov, Aleksey Gerhardt, Ilja Huang, Anqi Jogenfors, Jonathan Kurochkin, Yury Lamas-Linares, Antía Larsson, Jan-Åke Leuchs, Gerd Lydersen, Lars Makarov, Vadim Skaar, Johannes Russian Quantum Center Skolkovo Moscow143025 Russia QRate Skolkovo Moscow143025 Russia QApp Skolkovo Moscow143025 Russia Institute of Physics University of Stuttgart Institute for Quantum Science and Technology Pfaffenwaldring 57 StuttgartD-70569 Germany Max Planck Institute for Solid State Research Heisenbergstraße 1 StuttgartD-70569 Germany Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology Changsha410073 China Department of Electrical Engineering Linköping University LinköpingSE-58183 Sweden Texas Advanced Computing Center University of Texas at Austin AustinTX United States Max Planck Institute for the Science of Light University of Erlangen-Nürnberg ErlangenD-91058 Germany Kringsjåvegen 3E TrondheimNO-7032 Norway National University of Science and Technology MISIS Moscow119049 Russia Department of Technology Systems University of Oslo Box 70 KjellerNO-2027 Norway

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：