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

13th IEEE Data Driven Control and Learning Systems Conference, DDCLS 2024

作者： Jiao, Xuguo Zhang, Daoyuan Wang, Xin Ma, Zhaoxing Zhang, Zhenyong Liu, Wenfeng School of Information and Control Engineering Qingdao University of Technology Qingdao266520 China College of Control Science and Engineering Zhejiang University State Key Laboratory of Industrial Control Technology Hangzhou310027 China Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250014 China College of Computer Science and Technology Guizhou University State Key Laboratory of Public Big Data Guiyang550025 China School of Civil Engineering Qingdao University of Technology Qingdao266520 China

ISBN: (纸本)9798350361674

Active power dispatch of wind farms plays an important role in power grid scheduling. In this paper, a data-driven active power dispatch strategy for wind farms is proposed, which uses the key point of minimizing the standard deviation of wind turbines' output power series to reduce their fluctuations. First, to build the optimization problem, the historical active power output data of each wind turbine is collected from the Supervisory Control And Data Acquisition (SCADA) system. Then, the objective function is developed based on the idea of minimizing the standard deviation of the output power time series. Meanwhile, considering the constraints of wind turbines' output power and active power balance of the grid, the feasible domain of the cost function is constructed. Further, to solve the proposed nonlinear optimization problem with equality and inequality constraints, the trust region interior point method (TRIPM) is employed to explore optimal solution within the feasible domain. Finally, actual data collected from wind farms is used to test effectiveness of the designed approach and experimental results show that our method can achieve better output power smoothing performance than conventional Proportional Dispatch (PD) method. © 2024 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Local and Global Feature-Aware Dual-Branch Networks for Plant Disease Recognition

引用

植物表型组学（英文） 2024年第4期6卷 828-840页

作者： Jianwu Lin Xin Zhang Yongbin Qin Shengxian Yang Xingtian Wen Tomislav Cernava Quirico Migheli Xiaoyulong Chen Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China College of Big Data and Information Engineering Guizhou UniversityGuiyang 550025China Guizhou-Europe Environmental Biotechnology and Agricultural Informatics Oversea Innovation Center in Guizhou University Guizhou Provincial Science and Technology DepartmentGuiyang 550025China Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China College of Big Data and Information Engineering Guizhou UniversityGuiyang 550025China Guizhou-Europe Environmental Biotechnology and Agricultural Informatics Oversea Innovation Center in Guizhou University Guizhou Provincial Science and Technology DepartmentGuiyang 550025China College of Big Data and Information Engineering Guizhou UniversityGuiyang 550025China School of Biological Sciences Faculty of Environmental and Life SciencesUniversity of SouthamptonSouthampton S017 1BJUK Dipartimento di Agraria and NRD-Nucleo di Ricerca sulla Desertificazione Università degli Studi di SassariSassariItaly Guizhou-Europe Environmental Biotechnology and Agricultural Informatics Oversea Innovation Center in Guizhou University Guizhou Provincial Science and Technology DepartmentGuiyang 550025China College of Life Sciences Guizhou UniversityGuiyang 550025China

Accurate identification of plant diseases is important for ensuring the safety of agricultural *** neural networks(CNNs)and visual transformers(VTs)can extract effective representations of images and have been widely used for the intelligent recognition of plant disease ***,CNNs have excellent local perception with poor global perception,and VTs have excellent global perception with poor local *** makes it difficult to further improve the performance of both CNNs and VTs on plant disease recognition *** this paper,we propose a local and global feature-aware dual-branch network,named LGNet,for the identification of plant *** specifically,we first design a dual-branch structure based on CNNs and VTs to extract the local and global ***,an adaptive feature fusion(AFF)module is designed to fuse the local and global features,thus driving the model to dynamically perceive the weights of different ***,we design a hierarchical mixed-scale unit-guided feature fusion(HMUFF)module to mine the key information in the features at different levels and fuse the differentiated information among them,thereby enhancing the model's multiscale perception ***,extensive experiments were conducted on the Al Challenger 2018 dataset and the self-collected corn disease(SCD)*** experimental results demonstrate that our proposed LGNet achieves state-of-the-art recognition performance on both the Al Challenger 2018 dataset and the SCD dataset,with accuracies of 88.74％and 99.08％,respectively.

关键词： global plant disease dual-branch feature-aware local networks recognition

来源：评论

学校读者我要写书评

暂无评论

Identification of key Genes as Potential Drug Targets for Gastric Cancer

引用

Tsinghua science and technology 2023年第4期28卷 649-664页

作者： Md.Tofazzal Hossain Md.Selim Reza Yin Peng Shengzhong Feng Yanjie Wei Center for High Performance Computing Joint Engineering Research Center for Health Big Data Intelligent Analysis TechnologyShenzhen Institute of Advanced TechnologyChinese Academy of SciencesShenzhen 518055China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing 100049China Department of Statistics Bangabandhu Sheikh Mujibur Rahman Science and Technology UniversityGopalganj 8100Bangladesh Guangdong Provincial Key Laboratory for Genome Stability and Disease Prevention and Regional Immunity and Diseases Department of PathologyShenzhen UniversityShenzhen 518060China

Gastric cancer(GC)is one of the most common cancers and ranks the third in cancer mortality all over the *** goal of this study was to identify potential hub-genes,highlighting their functions,signaling pathways,and candidate drugs for the treatment of GC *** used publicly available next generation sequencing(NGS)data to identify differentially expressed(DE)*** top DE genes were mapped to STRING database to construct the protein-protein interaction(PPI)network and top hub genes were selected for further *** found a total of 1555 DE genes with 870 upregulated and 685 downregulated genes in *** selected the top 400(200 upregulated and 200 downregulated)genes to construct a PPI network and extracted the top 15 hub *** gene ontology(GO)term and kyoto encyclopedia of genes and genomes(KEGG)pathway enrichment analyses of the 15 hub genes exposed some important functions and signaling pathways that were significantly associated with GC *** survival analysis of the hub genes disclosed that the lower expressions of the three hub genes CDH2,COL4A1,and COL5A2 were associated with better survival of GC *** three genes might be the candidate biomarkers for the diagnosis and treatment of ***,we considered 3 key proteins(genomic biomarkers)(COL4A1,CDH2,and CO5A2)as the drug target proteins(receptors),performed their docking analysis with the 102 meta-drug agents,and found Everolimus,Docetaxel,Lanreotide,Venetoclax,Temsirolimus,and Nilotinib as the top ranked 6 candidate drugs with respect to our proposed target proteins for the treatment against GC ***,the proposed drugs might play vital role for the treatment against GC patients.

关键词： gastric cancer hub genes candidate genes molecular docking candidate drugs

来源：评论

学校读者我要写书评

暂无评论

Coherent optical link phase noise control based on SPGD algorithm with optimal estimation 6

Coherent optical link phase noise control based on SPGD algo...

引用

6th Optics Young Scientist Summit, OYSS 2023

作者： Luo, Yihao Zhang, Jun Du, Shiyin Yan, Qiuquan Zhou, Tong Jiang, Tian College of Advanced Interdisciplinary Studies National University of Defense Technology Changsha410073 China National Innovation Institute of Defense Technology Academy of Military Sciences Pla China Beijing100071 China Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China Institute of Quantum Information Science and Technology College of Science National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781510672642

The Stochastic Parallel Gradient Descent (SPGD) algorithm is a widely used model-free optimization algorithm in adaptive optical systems. However, when affected by noise, the SPGD algorithm may incorrectly estimate the gradient, resulting in a significant decrease in its performance and limitations in its application in complex environments. To address this issue, this paper introduces the optimal estimation algorithm and adds a self-checking process to the SPGD algorithm, proposing a Kal-SPGD algorithm. The feasibility of the Kal-SPGD algorithm is verified through simulation and experimentation. The experimental results show that compared with the standard SPGD, the use of the Kal-SPGD algorithm can reduce the signal amplitude variance by up to 92.15%. The Kal-SPGD algorithm provides a more favorable control technique for adaptive optical systems. © COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Mining Top-k Frequent Patterns over Streaming Graphs 28th

Mining Top-k Frequent Patterns over Streaming Graphs

引用

28th International Conference on Database Systems for Advanced Applications, DASFAA 2023

作者： Wang, Xi Zhang, Qianzhen Guo, Deke Zhao, Xiang Institute for Quantum Information and State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China Science and Technology on Information Systems Engineering Laboratory National University of Defense Technology Changsha China Laboratory for Big Data and Decision National University of Defense Technology Changsha China

ISBN: (纸本)9783031306747

Mining top-k frequent patterns is an important operation on graphs, which is defined as finding k interesting subgraphs with the highest frequency. Most existing work assumes a static graph. However, graphs are dynamic in nature, which is described as streaming graphs. Mining top-k frequent patterns in streaming graphs is challenging due to the streaming nature of the input and the exponential time complexity of the problem. A naive solution is to calculate approximations of the frequent patterns in the streaming graph and then find the top-k answers, which is a memory- and time-consuming method. In this paper, we design a novel auxiliary data structure, FPC, to detect valid subgraph patterns and their frequency in real-time. We first convert each newly produced subgraph into a sequence and then map it into corresponding tracks in FPC based on hash functions. We theoretically prove that FPC can provide unbiased estimation and then give an error bound of our algorithm. In addition, we propose a vertical hashing and candidate buckets sampling technique to further improve FPC with higher space utilization and higher accuracy. Extensive experiments confirm that our approach generates high-quality results compared to the baseline method. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Consistent Multi-Threaded Mesh Refinement with Adaptive Length Scale Estimation for Moving Boundary Problems 21

Consistent Multi-Threaded Mesh Refinement with Adaptive Leng...

引用

5th International Conference on computer science and Application Engineering, CSAE 2021

作者： Li, Chao Zhao, Ran Zhao, Ran State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781450389853

Computational fluid dynamic simulations with moving boundaries are widely involved in high performance computing applications. For problems with large-displacement or large-deformation boundaries, mesh cells near the boundaries are often excessively stretched or compressed, thus it's hard to maintain a high-quality mesh. To deal with the distorted cells, this paper adopts the mesh refinement method based on the open source software OpenFOAM. In order to achieve the desired effects of localization and adaptation, we propose an adaptive length scale estimation algorithm based on the specified growth factor and current edge lengths. Considering the inconsistency problems for the original implementation of parallelization, an optimized multi-threaded master/worker model is developed for the process of edge checking. Experiments show that our adaptive length scale estimation algorithm works well for moving boundary problems. Compared to the original mesh deformation, using the adaptive mesh refinement could greatly improve the mesh quality. In parallel testing, all the results are consistent and a maximum speedup of 3.8 is achieved on a computing node of 24 cores.. © 2021 Association for computing Machinery. All rights reserved.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Cerasure: Fast Acceleration Strategies For XOR-Based Erasure Codes

Cerasure: Fast Acceleration Strategies For XOR-Based Erasure...

引用

IEEE International Conference on computer Design: VLSI in computers and Processors, (ICCD)

作者： Tianyang Niu Min Lyu Wei Wang Qiliang Li Yinlong Xu AnHui Province Key Laboratory of High Performance Computing School of Computer Science and Technology University of Science and Technology of China

Erasure coding is a common redundancy scheme for tolerating failures in storage systems. Compared with replication, erasure coding saves a large amount of storage space, but incurs heavy computation overhead and thus is more time-consuming. To this end, we design an algorithm to find a better parity coding matrix to reduce the number of XORs in coding based on Vandermonde matrices instead of Cauchy matrices. In addition, we optimize the coding process, to accelerate the computation speed of XOR and obtain a better tradeoff between spatial locality and computation efficiency. For wide stripes which becomes increasingly interesting, we propose to decompose the coding procedure into multiple subprocedures for better utilization of spatial locality. We integrate these methods into coding procedure and implement an erasure coding library, Cerasure. Extensive experiments show that Cerasure significantly improves the coding speed. Compared with the state-of-the-art erasure coding libraries, Zerasure and SLPEC, Cerasure increases the encoding throughput by up to 109.47%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The 20-nm Skyrmion Generated at Room Temperature by Spin-Orbit Torques

引用

Chinese Physics Letters 2022年第1期39卷 40-45页

作者： Jiahao Liu Zidong Wang Teng Xu Hengan Zhou Le Zhao Soong-Guen Je Mi-Young Im Liang Fang Wanjun Jiang State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics Tsinghua UniversityBeijing 100084China Frontier Science Center for Quantum Information Tsinghua UniversityBeijing 100084China Institute for Quantum Information&State Key Laboratory of High Performance Computing College of ComputerNational University of Defense TechnologyChangsha 410073China Center for X-ray Optics Lawrence Berkeley National LaboratoryCyclotron RoadBerkeleyCA 94720USA Department of Physics Chonnam National UniversityGwangju61186Republic of Korea

The discovery of magnetic skyrmions provides a promising pathway for developing functional spintronic memory and logic devices. Towards the future high-density memory application, nanoscale skyrmions with miniaturized diameters, ideally down to 20 nm are required. Using x-ray magnetic circular dichroism transmission microscopy,nanoscale skyrmions are observed in the [Pt/Co/Ir]15 multilayer at room temperature. In particular, small skyrmions with minimum diameters approaching 20 nm could be generated by the current-induced spin-orbit torques. Through implementing material specific parameters, the dynamic process of skyrmion generation is further investigated by performing micromagnetic simulations. According to the simulation results, we find that both the tube-like Neel-type skyrmions and the bobber-like Neel-type skyrmions can be electrically generated. In particular, the size of the bobber-like Neel-type skyrmions can be effectively reduced by the spin-orbit torques,which leads to the formation of 20 nm Neel-type skyrmions. Our findings could be important for understanding the formation dynamics of nanoscale Neel-type spin textures, skyrmions and bobber in particular, which could also be useful for promoting nanoscale skyrmionic memories and logic devices.

关键词： temperature diameters approaching

来源：评论

学校读者我要写书评

暂无评论

Quantum generative adversarial learning in photonics

arXiv

引用

arXiv 2023年

作者： Wang, Yizhi Xue, Shichuan Wang, Yaxuan Liu, Yong Ding, Jiangfang Shi, Weixu Wang, Dongyang Liu, Yingwen Fu, Xiang Huang, Guangyao Huang, Anqi Deng, Mingtang Wu, Junjie Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China

Quantum Generative Adversarial Networks (QGANs), an intersection of quantum computing and machine learning, have attracted widespread attention due to their potential advantages over classical analogs. However, in the current era of Noisy Intermediate-Scale Quantum (NISQ) computing, it is essential to investigate whether QGANs can perform learning tasks on near-term quantum devices usually affected by noise and even defects. In this Letter, using a programmable silicon quantum photonic chip, we experimentally demonstrate the QGAN model in photonics for the first time, and investigate the effects of noise and defects on its performance. Our results show that QGANs can generate high-quality quantum data with a fidelity higher than 90%, even under conditions where up to half of the generator’s phase shifters are damaged, or all of the generator and discriminator’s phase shifters are subjected to phase noise up to 0.04π. Our work sheds light on the feasibility of implementing QGANs on NISQ-era quantum hardware. © 2023, CC BY.

关键词： Phase shifters

来源：评论

学校读者我要写书评

暂无评论

Experimental quantum natural gradient optimization in photonics

arXiv

引用

arXiv 2023年

作者： Wang, Yizhi Xue, Shichuan Wang, Yaxuan Ding, Jiangfang Shi, Weixu Wang, Dongyang Liu, Yong Liu, Yingwen Fu, Xiang Huang, Guangyao Huang, Anqi Deng, Mingtang Wu, Junjie Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China

Variational quantum algorithms (VQAs) combining the advantages of parameterized quantum circuits and classical optimizers, promise practical quantum applications in the Noisy Intermediate-Scale Quantum era. The performance of VQAs heavily depends on the optimization method. Compared with gradient-free and ordinary gradient descent methods, the quantum natural gradient (QNG), which mirrors the geometric structure of the parameter space, can achieve faster convergence and avoid local minima more easily, thereby reducing the cost of circuit executions. We utilized a fully programmable photonic chip to experimentally estimate the QNG in photonics for the first time. We obtained the dissociation curve of the He-H+ cation and achieved chemical accuracy, verifying the outperformance of QNG optimization on a photonic device. Our work opens up a vista of utilizing QNG in photonics to implement practical near-term quantum applications. © 2023, CC BY.

关键词： Photonic devices

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：