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

Controlled Islanding Strategy Considering Uncertainty of Renewable Energy Sources Based on Chance-constrained Model

Journal of Modern Power systems and Clean Energy 2022年第2期10卷 471-481页

作者： Shengyuan Liu Tianhan Zhang Zhenzhi Lin Yilu Liu Yi Ding Li Yang the School of Electrical Engineering Zhejiang UniversityHangzhou 310027China the Department of Electrical Engineering and Computer Science University of TennesseeKnoxvilleTN 37996USA the School of Electrical Engineering Shandong UniversityJinan 250061China Electrical and Electronics Systems Research Division Oak Ridge National LaboratoryOak RidgeTN 37830USA

Controlled islanding plays an essential role in preventing the blackout of power *** there are several studies on this topic in the past,no enough attention is paid to the uncertainty brought by renewable energy sources(RESs)that may cause unpredictable unbalanced power and the observabilit>T of power systems after islanding that is essential for back-up black-start ***,a novel controlled islanding model based on mixed-integer second-order cone and chance-constrained programming(MISOCCP)is proposed to address these ***,the uncertainty of RESs is characterized by their possibility distribution models with chance constraints,and the requirements,e.g.,system observability,for rapid back-up black-start measures are also ***,a law of large numbers(LLN)based method is em-ployed for converting the chance constraints into deterministic ones and reformulating the non-convex model into convex ***,case studies on the revised IEEE 39-bus and 118-bus power systems as well as the comparisons among different models are given to demonstrate the effectiveness of the proposed *** results show that the proposed model can result in less unbalanced power and better observability after islanding compared with other models.

关键词： Controlled islanding second-order cone chance-constrained programming renewable energy source(RES) black-start observability.

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Decision-Making Approach for Better Selection of Blockchain Platform for Health Insurance Frauds Detection with Smart Contracts: Development and Performance Evaluation

引用

Procedia computer science 2023年 220卷 470-477页

作者： Rima Kaafarani Leila Ismail Oussama Zahwe ICCS-Lab Computer Science Department American University of Culture and Education 1507 Beirut Lebanon Cloud Computing and Distributed Systems (CLOUDS) Laboratory School of Computing and Information Systems The University of Melbourne Melbourne Australia Intelligent Distributed Computing and Systems (INDUCE) Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University Abu Dhabi United Arab Emirates National Water and Energy Center United Arab Emirates University Abu Dhabi United Arab Emirates

Blockchain technology has piqued the interest of businesses of all types, while consistently improving and adapting to business requirements. Several blockchain platforms have emerged, making it challenging to select a suitable one for a specific type of business. This paper presents a classification of over one hundred blockchain platforms. We develop smart contracts for detecting healthcare insurance frauds using the top two blockchain platforms selected based on our proposed decision-making map approach which selects the top suitable platforms for healthcare insurance frauds detection application. Our classification shows that the largest percentage of platforms can be used for all types of application domains, the second biggest percentage for financial services, and a small number is to develop applications in specific domains. Our decision-making map and performance evaluations reveal that Hyperledger Fabric surpassed Neo in all metrics for detecting healthcare insurance frauds.

关键词： Blockchain Decision-Map Health Insurance Frauds Detection Hyperledger Fabric Neo Smart Contract Smart Healthcare

来源：评论

学校读者我要写书评

暂无评论

Simulated Performance of Antenna Position Estimation through Sub-Sampled Exponential Analysis 23

Simulated Performance of Antenna Position Estimation through...

引用

23rd International Conference on Electromagnetics in Advanced Applications, ICEAA 2022

作者： Weideman, Rina-Mari Louw, Ridalise Knaepkens, Ferre De Villiers, Dirk Cuyt, Annie Lee, Wen-Shin Wijnholds, Stefan J. Stellenbosch University Dept of Electrical & Electronic Engineering Stellenbosch South Africa University of Antwerp Dept of Computer Science Antwerp Belgium University of Stirling Division of Computing Science and Mathematics Scotland United Kingdom Dept of Innovation & Systems Dwingeloo Netherlands

ISBN: (数字)9781665481113

ISBN: (纸本)9781665481113

Antenna position estimation is an important problem in large irregular arrays where the positions might not be known very accurately from the start. In a previous paper we presented a method using harmonically related signals transmitted from an Unmanned Aerial Vehicle (UAV), with the added advantage that the UAV can be in the near-field of the receiving antenna array. It was shown that the method delivers excellent results using ideal synthetic data with added noise. In this paper we continue the work by simulating the problem in a full-wave solver. Although the results are less accurate than when synthetic data are used, due to the effects of mutual coupling, the method still performs satisfactorily, with errors smaller than 4% of the smallest transmitted wavelength. © 2022 IEEE.

关键词： Antenna arrays

来源：评论

学校读者我要写书评

暂无评论

Prediction of piRNA-mRNA interactions based on an interactive inference network

Prediction of piRNA-mRNA interactions based on an interactiv...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Liu, Yajun Li, Ru Li, Aimin Fei, Rong Guo, Xie Wu, Fang-Xiang Xi'an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China Xi'an University of Technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an China University of Saskatchewan Division of Biomedical Engineering Department of Computer Science Department of Mechanical Engineering Saskatoon Canada

ISBN: (纸本)9798350337488

As the largest class of small non-coding RNAs, piRNAs primarily present in the reproductive cells of mammals, which influence post-transcriptional processes of mRNAs in multiple ways. Effective methods for predicting piRNA and mRNA target relationships can help identify piRNA functions, investigate the possibility of piRNAs as biomarkers and therapeutic targets. In this study, we propose a computational approach for classifying the relationships of piRNA-mRNA pairs based on an interactive inference network (IIN). First, we gather piRNA-mRNA target data, collect sequence data by position alignment, and construct a benchmark dataset. Furthermore, a reliable negative set is constructed by positive-unlabeled learning. Finally, we view a piRNA and a mRNA sequence as a premise and hypothesis sentence, respectively, and IIN model is used to predict the relationship between them. The experiments demonstrate that our method effectively characterizes piRNA-mRNA interaction and could be beneficial for researchers to investigate piRNA functions. © 2023 IEEE.

关键词： interactive inference network noncoding RNA piRNA-mRNA interactions positive-unlabeled learning

来源：评论

学校读者我要写书评

暂无评论

Federated Learning Architectures: A Performance Evaluation with Crop Yield Prediction Application

arXiv

引用

arXiv 2024年

作者： Mukherjee, Anwesha Buyya, Rajkumar Department of Computer Science Mahishadal Raj College West Bengal Mahishadal721628 India Laboratory School of Computing and Information Systems The University of Melbourne VIC3052 Australia

Federated learning has become an emerging technology for data analysis for IoT applications. This paper implements centralized and decentralized federated learning frameworks for crop yield prediction based on Long Short-Term Memory Network. For centralized federated learning, multiple clients and one server is considered, where the clients exchange their model updates with the server that works as the aggregator to build the global model. For the decentralized framework, a collaborative network is formed among the devices either using ring topology or using mesh topology. In this network, each device receives model updates from the neighbour devices, and performs aggregation to build the upgraded model. The performance of the centralized and decentralized federated learning frameworks are evaluated in terms of prediction accuracy, precision, recall, F1-Score, and training time. The experimental results present that ≥97% and >97.5% prediction accuracy are achieved using the centralized and decentralized federated learning-based frameworks respectively. The results also show that the using centralized federated learning the response time can be reduced by ∼75% than the cloud-only framework. Finally, the future research directions of the use of federated learning in crop yield prediction are explored in this paper. © 2024, CC BY.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

MixSA: Training-free Reference-based Sketch Extraction via Mixture-of-Self-Attention

引用

IEEE Transactions on Visualization and computer Graphics 2024年 PP卷 PP页

作者： Yang, Rui Wu, Xiaojun He, Shengfeng Shaanxi Normal University School of Computer Sciences Xi'an China Shaanxi Normal University School of Computer Science The Key Laboratory of Intelligent Computing and Service Technology for Folk Song The Ministry of Culture and Tourism Xi'an710119 China Singapore Management University School of Computing and Information Systems Singapore Singapore

Current sketch extraction methods either require extensive training or fail to capture a wide range of artistic styles, limiting their practical applicability and versatility. We introduce Mixture-of-Self-Attention (MixSA), a training-free sketch extraction method that leverages strong diffusion priors for enhanced sketch perception. At its core, MixSA employs a mixture-of-self-attention technique, which manipulates self-attention layers by substituting the keys and values with those from reference sketches. This allows for the seamless integration of brushstroke elements into initial outline images, offering precise control over texture density and enabling interpolation between styles to create novel, unseen styles. By aligning brushstroke styles with the texture and contours of colored images, particularly in late decoder layers handling local textures, MixSA addresses the common issue of color averaging by adjusting initial outlines. Evaluated with various perceptual metrics, MixSA demonstrates superior performance in sketch quality, flexibility, and applicability. This approach not only overcomes the limitations of existing methods but also empowers users to generate diverse, high-fidelity sketches that more accurately reflect a wide range of artistic expressions. © 1995-2012 IEEE.

关键词： Image texture

来源：评论

学校读者我要写书评

暂无评论

A GPU-Accelerated Distributed Algorithm for Optimal Power Flow in Distribution systems

arXiv

引用

arXiv 2025年

作者： Ryu, Minseok Byeon, Geunyeong Kim, Kibaek School of Computing and Augmented Intelligence Arizona State University TempeAZ United States Mathematics and Computer Science Division Argonne National Laboratory LemontIL United States

We propose a GPU-accelerated distributed optimization algorithm for controlling multi-phase optimal power flow in active distribution systems with dynamically changing topologies. To handle varying network configurations and enable adaptable decomposition, we advocate a componentwise decomposition strategy. However, this approach can lead to a prolonged computation time mainly due to the excessive iterations required for achieving consensus among a large number of fine-grained components. To overcome this, we introduce a technique that segregates equality constraints from inequality constraints, enabling GPU parallelism to reduce per-iteration time by orders of magnitude, thereby significantly accelerating the overall computation. Numerical experiments on IEEE test systems ranging from 13 to 8500 buses demonstrate the superior scalability of the proposed approach compared to its CPU-based counterparts. Copyright © 2025, The Authors. All rights reserved.

关键词： computer graphics equipment

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Study of OOP-Related Bugs in C++ Compilers

引用

IEEE Transactions on Software Engineering 2025年第6期51卷 1-21页

作者： Wang, Bo Chen, Chong Chen, Junjie Xu, Bowen Ye, Chen Lin, Youfang Dong, Guoliang Sun, Jun Beijing Jiaotong University School of Computer Science and Technology Beijing100044 China Beijing Key Laboratory of Traffic Data Mining and Embodied Intelligence China Tianjin University College of Intelligence and Computing Tianjin300350 China North Carolina State University Department of Computer Science NC27695 United States Singapore Management University School of Computing and Information Systems Singapore178902 Singapore

Modern C++, a programming language characterized by its extensive use of object-oriented programming (OOP) features, is widely used for system programming. However, C++ compilers often struggle to correctly handle these sophisticated OOP features, resulting in numerous high-profile compiler bugs that can lead to crashes or miscompilation. Despite the significance of OOP-related bugs, existing studies largely overlook OOP features, hindering their ability to discover such bugs. To assist both compiler fuzzer designers and compiler developers, we conduct a comprehensive study of the compiler bugs caused by incorrectly handling C++ OOP-related features. First, we systematically extract 788 OOP-related C++ compiler bugs from GCC and LLVM. Second, derived from the core concepts of OOP and C++, we manually identified a two-level taxonomy of the OOP-related features leading to compiler bugs, which consists of 6 primary categories (e.g., Abstraction & Encapsulation, Inheritance, and Runtime Polymorphism), along with 17 secondary categories (e.g., Constructors & Destructors and Multiple Inheritance). Third, we systematically analyze the root causes, symptoms, fixes, options, and C++ standard versions of these bugs. Our analysis yields 13 key findings, highlighting that features related to the construction and destruction of objects lead to the highest number of bugs, crashes are the most frequent symptom, and while the average time from bug introduction to discovery is 1856 days, fixing the bug once discovered takes only 174 days on average. Additionally, more than half of the bugs can be triggered without any compiler options. These findings offer valuable insights not only for developing new compiler testing approaches but also for improving language design and compiler engineering. Inspired by these findings, we developed a proof-of-concept compiler fuzzer OOPFuzz, specifically targeting OOP-related bugs in C++ compilers. We applied it against the newest release versions

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Toward a Steady-State Fluid Model of HPC Networks 25

Toward a Steady-State Fluid Model of HPC Networks

引用

39th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation

作者： Kevin A. Brown Andres Lopez Jason Liu Mathematics and Computer Science Division Argonne National Laboratory Lemont IL USA Knight Foundation School of Computing and Information Sciences Florida International University Miami Florida USA

来源：评论

学校读者我要写书评

暂无评论

Federated Graph Learning for Cross-Domain Recommendation

arXiv

引用

arXiv 2024年

作者： Yang, Ziqi Peng, Zhaopeng Wang, Zihui Qi, Jianzhong Chen, Chaochao Pan, Weike Wen, Chenglu Wang, Cheng Fan, Xiaoliang Fujian Key Laboratory of Sensing and Computing for Smart Cities Xiamen University China Key Laboratory of Multimedia Trusted Perception and Efficient Computing Ministry of Education of China Xiamen University China School of Computing and Information Systems The University of Melbourne Australia College of Computer Science and Technology Zhejiang University Hangzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

Cross-domain recommendation (CDR) offers a promising solution to the data sparsity problem by enabling knowledge transfer across source and target domains. However, many recent CDR models overlook crucial issues such as privacy as well as the risk of negative transfer (which negatively impact model performance), especially in multi-domain settings. To address these challenges, we propose FedGCDR, a novel federated graph learning framework that securely and effectively leverages positive knowledge from multiple source domains. First, we design a positive knowledge transfer module that ensures privacy during inter-domain knowledge transmission. This module employs differential privacy-based knowledge extraction combined with a feature mapping mechanism, transforming source domain embeddings from federated graph attention networks into reliable domain knowledge. Second, we design a knowledge activation module to filter out potential harmful or conflicting knowledge from source domains, addressing the issues of negative transfer. This module enhances target domain training by expanding the graph of the target domain to generate reliable domain attentions and fine-tunes the target model for improved negative knowledge filtering and more accurate predictions. We conduct extensive experiments on 16 popular domains of the Amazon dataset, demonstrating that FedGCDR significantly outperforms state-of-the-art methods. © 2024, CC BY.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：