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

arXiv 2019年

作者： Peng, Hao Li, Jianxin Yan, Hao Gong, Qiran Wang, Senzhang Liu, Lin Wang, Lihong Ren, Xiang Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing China State Key Laboratory of Software Development Environment Beihang University Beijing China Collage of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China National Computer Network Emergency Response Technical Team Coordination Center of China Beijing China Department of Computer Science University of Southern California Los Angeles United States

Network representation learning, as an approach to learn low dimensional representations of vertices, has attracted considerable research attention recently. It has been proven extremely useful in many machine learning tasks over large graph. Most existing methods focus on learning the structural representations of vertices in a static network, but cannot guarantee an accurate and efficient embedding in a dynamic network scenario. The fundamental problem of continuously capturing the dynamic properties in an efficient way for a dynamic network remains unsolved. To address this issue, we present an efficient incremental skip-gram algorithm with negative sampling for dynamic network embedding, and provide a set of theoretical analyses to characterize the performance guarantee. Specifically, we first partition a dynamic network into the updated, including addition/deletion of links and vertices, and the retained networks over time. Then we factorize the objective function of network embedding into the added, vanished and retained parts of the network. Next we provide a new stochastic gradient-based method, guided by the partitions of the network, to update the nodes and the parameter vectors. The proposed algorithm is proven to yield an objective function value with a bounded difference to that of the original objective function. The first order moment of the objective difference converges in order of O( 1/n2 ), and the second order moment of the objective difference can be stabilized in order of O(1). Experimental results show that our proposal can significantly reduce the training time while preserving the comparable performance. We also demonstrate the correctness of the theoretical analysis and the practical usefulness of the dynamic network embedding. We perform extensive experiments on multiple real-world large network datasets over multi-label classification and link prediction tasks to evaluate the effectiveness and efficiency of the proposed framework, and up

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Feature Selection for Detecting ICMPv6-Based DDoS Attacks Using Binary Flower Pollination Algorithm

引用

Computer Systems Science & Engineering 2023年第10期47卷 553-574页

作者： Adnan Hasan Bdair Aighuraibawi Selvakumar Manickam Rosni Abdullah Zaid Abdi Alkareem Alyasseri Ayman Khallel Dilovan Asaad Zebari Hussam Mohammed Jasim Mazin Mohammed Abed Zainb Hussein Arif National Advanced IPv6 Centre(NAv6) Universiti Sains MalaysiaPenang11800Malaysia Baghdad College of Economic Sciences University BaghdadIraq School of Computer Sciences Universiti Sains MalaysPenang11800Malaysia Information Technology Research and Development Center University of KufaNajafIraq College of Engineering University of Warith Al-AnbiyaaKarbalaIraq Faculty of Computing and Informatics Universiti Malaysia SabahSabahMalaysia Business Administration College of Administration and Financial SciencesImam Ja’afar Al-Sadiq UniversityBaghdad10001Iraq College of Computer Science and Information Technology University of AnbarRamadi AnbarIraq Department of Computer Science College of ScienceNawroz UniversityDuhok42001Kurdistan RegionIraq

Internet Protocol version 6(IPv6)is the latest version of IP that goal to host 3.4×10^(38)unique IP addresses of devices in the ***6 has introduced new features like Neighbour Discovery Protocol(NDP)and Address Auto-configuration ***6 needed several protocols like the Address Auto-configuration Scheme and Internet Control Message Protocol(ICMPv6).IPv6 is vulnerable to numerous attacks like Denial of Service(DoS)and Distributed Denial of Service(DDoS)which is one of the most dangerous attacks executed through ICMPv6 messages that impose security and financial ***,an Intrusion Detection System(IDS)is a monitoring system of the security of a network that detects suspicious activities and deals with amassive amount of data comprised of repetitive and inappropriate features which affect the detection rate.A feature selection(FS)technique helps to reduce the computation time and complexity by selecting the optimum subset of *** paper proposes a method for detecting DDoS flooding attacks(FA)based on ICMPv6 messages using a Binary Flower PollinationAlgorithm(BFPA-FA).The proposed method(BFPA-FA)employs FS technology with a support vector machine(SVM)to identify the most relevant,influential ***,The ICMPv6-DDoS dataset was used to demonstrate the effectiveness of the proposed method through different attack *** results show that the proposed method BFPAFA achieved the best accuracy rate(97.96%)for the ICMPv6 DDoS detection with a reduced number of features(9)to half the total(19)*** proven proposed method BFPA-FAis effective in the ICMPv6 DDoS attacks via IDS.

关键词： IPv6 ICMPv6 DDoS feature selection flower pollination algorithm anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Injectable Collagen/CMC Soft Tissue Filler with Developed Flow Properties

引用

MCB Molecular and Cellular Biomechanics 2022年第2期19卷 97-104页

作者： Samanipour, Reza Pourmostafa, Aida Marzban, Adel Tabatabaee, Sara Bahraminasab, Hasan Hamidieh, Amir Ali Tavakoli, Amirhossein Department of Tissue Engineering and Applied Sciences School of Advanced Technologies in Medicine Shahid Beheshti University of Medical Sciences Tehran Iran Department of Research and Development Iranian Tissue Product Co. Tehran Iran Department of Bio-Computing Faculty of Interdisciplinary Sciences and Technologies Tarbiat Modares University Tehran Iran Iranian Tissue Bank & Research Center Gene Cell and Tissue Research Institute Tehran University of Medical Sciences Tehran Iran

Based on the remarkable demand for facial reconstitute or reshape fillers due to the dermal defects arising from specific diseases, trauma, or aging, several natural or synthetic materials have been investigated. Among the evaluated materials, decellularized dermis is one of the most biocompatible choices for the aim of skin tissue regenerative approaches. On the other hand, Carboxymethyl Cellulose (CMC), a synthetic polysaccharide, with the desirable degradability, biomechanical stability, and nontoxicity seems to be an acceptable reinforcement agent for decellularized dermis. Thus, in this research, an injectable soft tissue filler contained of human-derived decellularized collagen and CMC was fabricated. The cell-removal approving was performed utilizing H&E staining assay. The biocompatibility of the prepared samples was confirmed by MTT assay. The rheology examination demonstrated the increased storage modulus and enhanced elastic property as a consequence of CMC presence. Furthermore, the required flow force of the collagen/CMC filler was decreased as a consequence of decreasing the viscosity and its injectability was improved. According to the provided biomechanical and biological results, it could be claimed that the collagen/CMC hydrogel is a suitable substitute filler for skin tissue engineering. © 2022 Tech Science Press. All rights reserved.

关键词： Collagen

来源：评论

学校读者我要写书评

暂无评论

Adaptive measurement strategy for noisy quantum amplitude estimation with variational quantum circuits

引用

Physical Review A 2024年第6期110卷 062423-062423页

作者： Kohei Oshio Yohichi Suzuki Kaito Wada Keigo Hisanaga Shumpei Uno Naoki Yamamoto Mizuho Research & Technologies Ltd. 2-3 Kandanishiki Chiyoda-ku Tokyo 100-8233 Japan Quantum Computing Center Keio University 3-14-1 Hiyoshi Kohoku-ku Yokohama Kanagawa 223-8522 Japan Global Research and Development Center for Business by Quantum-AI Technology (G-QuAT) National Institute of Advanced Industrial Science and Technology (AIST) 1-1-1 Umezono Tsukuba-shi Ibaraki 305-8568 Japan Department of Applied Physics and Physico-Informatics Keio University Hiyoshi 3-14-1 Kohoku-ku Yokohama 223-8522 Japan

In quantum computation, amplitude estimation is a fundamental subroutine that is utilized in various quantum algorithms. A general important task of such estimation problems is to characterize the estimation lower bound, which is referred to as quantum Cramér-Rao bound (QCRB), and to construct an optimal estimator that achieves QCRB. This paper studies the amplitude estimation in the presence of depolarizing noise with unknown intensity. The main difficulty in this problem is that the optimal measurement depends on both the unknown quantum state and the amplitude we aim to estimate. To deal with these issues, we utilize the variational quantum circuits to approximate the (unknown) optimal measurement basis combined with the two-step adaptive estimation strategy which was proposed in the quantum estimation theory. We numerically show that the proposed method can nearly attain the QCRB.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Graphical representation and hierarchical decomposition mechanism for vertex-cover solution space

arXiv

引用

arXiv 2019年

作者： Wei, Wei Feng, Xiangnan Wang, Jiannan Liu, Xue Zheng, Zhiming School of Mathematical Sciences Beihang University Beijing100191 China Key Laboratory of Mathematics Informatics and Behavioral Semantics Ministry of Education 100191 China Research Institute of Frontier Science Beihang University Beijing100191 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China Peng Cheng Laboratory Guangdong Shenzhen518055 China Center for Humans and Machines Max Planck Institute for Human Development Berlin14195 Germany

In this paper, solution space organization of minimum vertex-cover problem is deeply investigated using the König-Egérvary (KE) graph and theorem, in which a hierarchical decomposition mechanism named KE-layer structure of general graphs is proposed to reveal the complexity of vertex-cover. An algorithm to verify the KE graph is given by the solution space expression of vertex-cover, and the relation between multi-layer KE graphs and maximal matching is illustrated and proved. Furthermore, a framework to calculate the KE-layer number and approximate the minimal vertex-cover is provided, with different strategies of switching nodes and counting energy. The phase transition phenomenon between different KE-layers are studied with the transition points located, and searching of vertex-cover got by this strategy presents comparable advantage against several other methods. The graphical representation and hierarchical decomposition provide a new perspective to illustrate the intrinsic complexity for large-scale graphs/systems recognition. Copyright © 2019, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

swTVM: Towards Optimized Tensor Code Generation for Deep Learning on Sunway Many-Core Processor

arXiv

引用

arXiv 2019年

作者： Li, Mingzhen Liu, Changxi Liao, Jianjin Zheng, Xuegui Yang, Hailong Sun, Rujun Xu, Jun Gan, Lin Yang, Guangwen Luan, Zhongzhi Qian, Depei School of Computer Science and Engineering Beihang University Beijing China State Key Laboratory of Software Development Environment Beijing China National University of Singapore Singapore Singapore State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China Science and Technology on Special System Simulation Laboratory Beijing Simulation Center Beijing China Department of Computer Science and Technology Tsinghua University Beijing China

The flourish of deep learning frameworks and hardware platforms has been demanding an efficient compiler that can shield the diversity in both software and hardware in order to provide application portability. Among the existing deep learning compilers, TVM is well known for its efficiency in code generation and optimization across diverse hardware devices. In the meanwhile, the Sunway many-core processor renders itself as a competitive candidate for its attractive computational power in both scientific computing and deep learning workloads. This paper combines the trends in these two directions. Specifically, we propose swTVM that extends the original TVM to support ahead-of-time compilation for architecture requiring cross-compilation such as Sunway. In addition, we leverage the architecture features during the compilation such as core group for massive parallelism, DMA for high bandwidth memory transfer and local device memory for data locality, in order to generate efficient codes for deep learning workloads on Sunway. The experiment results show that the codes generated by swTVM achieves 1.79× on average compared to the state-of-the-art deep learning framework on Sunway, across six representative benchmarks. This work is the first attempt from the compiler perspective to bridge the gap of deep learning and Sunway processor particularly with productivity and efficiency in mind. We believe this work will encourage more people to embrace the power of deep learning and Sunway many-core processor. Copyright © 2019, The Authors. All rights reserved.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Many cooks improve the broth: Developing an inter-institutional, online, bachelor of science degree in Information Technology 03

Many cooks improve the broth: Developing an inter-institutio...

引用

4th Conference on Information Technology Curriculum, CITC4 2003

作者： Dehoney, Joanne Booth, Larry Lau, Kam Fui Reichgelt, Han Rutherfoord, Rebecca H. Stewart, Jeff Collaborative Development Consultant Advanced Learning Technologies University System of Georgia Gwinnett University Center 1000 University Center Ln. Bldg B LawrencevilleGA30043 United States IT Department Head College of Information and Mathematical Sciences Clayton College and State University MorrowGA30260 United States School of Computing Armstrong Atlantic State University 11935 Abercorn Street SavannahGA31419 United States Department of Information Technology Georgia Southern University StatesboroGA30461 United States Department Information Technology Southern Polytechnic State Univ. 1100 S. Marietta Parkway MariettaGA30060 United States Division of Information Technology Macon State College 100 College Station Dr. MaconGA31206 United States

ISBN: (纸本)1581137702

Five state colleges and universities in the University of Georgia System are collaborating to develop an online B.S. IT degree, slated to open for enrollment in Fall 2004. The participating institutions range in size and mission from large regional universities to regional colleges. The process of jointly designing a degree to be offered either wholly or substantially online for a non-traditional audience has produced several noteworthy intermediate outcomes. The first peripheral but important outcome is the benefit of collaborative self-study, which has already affected participating programs. Second, online BSIT planning has informed the definition of state-level course requirements for Associate degree level concentrations in Information Technology. In terms of the program itself, intermediate outcomes include a curriculum developed by consensus in reference to emerging accreditation guidelines, closely examined program and course prerequisites, and a process for jointly planning, reviewing and certifying courses. This paper first describes the project's context, background and the needs assessment, then briefly describes the technological and administrative infrastructure required to deliver the degree collaboratively and at a distance. We focus on the program's impact to this point, curricular structure and rationale, and conclude with our expectations for the project's future. Copyright 2003 ACM.

关键词： E-learning

来源：评论

学校读者我要写书评

暂无评论

Nonstoichiometric Mn-doped ZnO magic nanoclusters and their composite structures from ab initio calculations

引用

Physical Review B 2012年第20期86卷 205320-205320页

作者： Sachin P. Nanavati Vijayaraghavan Sundararajan Shailaja Mahamuni S. V. Ghaisas Vijay Kumar Centre for Development of Advanced Computing (C-DAC) Pune University Campus Pune–411 007 India Department of Electronic Science University of Pune Pune–411 007 India Department of Physics University of Pune Pune–411 007 India Dr. Vijay Kumar Foundation 1969 Sector 4 Gurgaon–122 001 India Center for Informatics School of Natural Sciences Shiv Nadar University Chithera Gautum Budh Nagar–203 207 Uttar Pradesh India

Undoped cages of (ZnO)n nanoclusters are magic with n = 12 and 34. However with Mn doping, our ab initio calculations show that O rich, nonstoichiometric Zn12MnO15 and Zn34MnO37 nanoclusters obtained from n = 13 and 35, become magic with 1μB magnetic moment. The Mn-doped nanoclusters can also be viewed as composite structures where a MnOx species (x = 1–4) is attached to (ZnO)n (n = 12 and 34) cages. Mn atoms can exist in a high oxidation state in these nanoclusters, with the highest binding energy for x = 3. Further replacement of Mn by Cr leads to a neutral, nonmagnetic Zn12CrO15 nanocluster with a large highest occupied molecular orbital and lowest unoccupied molecular orbital gap of 2.24 eV. These results provide new ground to understand doped nanostructures of ZnO and may also shed light on magnetism in Mn-doped ZnO thin films.

关键词： MANGANESE ZINC oxide NANOSTRUCTURES COMPOSITE materials MAGNETIC moments

来源：评论

学校读者我要写书评

暂无评论

The first ICB* competition on iris recognition

The first ICB* competition on iris recognition

引用

IEEE International Joint Conference on Biometrics (IJCB)

作者： Man Zhang Jing Liu Zhenan Sun Tieniu Tan Wu Su Fernando Alonso-Fernandez Valérian Némesin Nadia Othman Koichi Noda Peihua Li Edmundo Hoyle Akanksha Joshi Center for Research on Intelligent Perception and Computing Institute of Automation Chinese Academy of Sciences (CN) Department of Automation University of Science and Technology of China (CN) Zhuhai YiSheng Electronics Technology Co Ltd (CN) Halmstad University (SE) Centrale Marseille Institut Fresnel (UMR 7249) (FR) CNRS Télécom SudParis Nihon System Laboratory. Ltd (JP) School of Information and Communication Engineering Dalian University of Technology (CN) University Federal of Rio de Janeiro (BR) Centre for Development of Advanced Computing (IN)

Iris recognition becomes an important technology in our society. Visual patterns of human iris provide rich texture information for personal identification. However, it is greatly challenging to match intra-class iris images with large variations in unconstrained environments because of noises, illumination variation, heterogeneity and so on. To track current state-of-the-art algorithms in iris recognition, we organized the first ICB* Competition on Iris Recognition in 2013 (or ICIR2013 shortly). In this competition, 8 participants from 6 countries submitted 13 algorithms totally. All the algorithms were trained on a public database (e.g. CASIA-Iris-Thousand [3]) and evaluated on an unpublished database. The testing results in terms of False Non-match Rate (FNMR) when False Match Rate (FMR) is 0.0001 are taken to rank the submitted algorithms.

关键词： Iris recognition Databases Image segmentation Magnetic resonance Testing Image edge detection Noise

来源：评论

学校读者我要写书评

暂无评论

Coherent H ∞ control for Markovian jump linear quantum systems

引用

IFAC-PapersOnLine 2020年第2期53卷 269-274页

作者： Yanan Liu Daoyi Dong Ian R. Petersen Qing Gao Steven X. Ding Hidehiro Yonezawa School of Engineering and Information Technology University of New South Wales Canberra ACT 2600 Australia Center for Quantum Computation and Communication Technology Australian Research Council Canberra ACT 2600 Australia Institute for Automatic Control and Complex Systems (AKS) University of Duisburg-Essen. 47057 Duisburg Germany Research School of Electrical Energy and Materials Engineering The Australian National University Canberra ACT 2601 Australia School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment Beijing and also with Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing 100191 China

The purpose of this paper is to design a coherent feedback controller for a Markovian jump linear quantum system suffering from a fault signal. The control objective is to bound the effect of the disturbance input on the output for the time-varying quantum system. We prove the relation between the H ∞ control problem, the dissipation properties, and the solutions of Riccati differential equations, by which the H ∞ controller of the Markovian jump linear quantum system is given by the solutions of Linear Matrix Inequalities (LMIs).

关键词： Coherent quantum feedback H∞ control fault-tolerant control Markovian jump linear quantum systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：