Contingency analysis (CA) is one of the essential tools for the optimal design and security assessment of a reliable power system. However, its computational requirements rise with the growth of distributed generations in the interconnected power system. As CA is a complex and computationally intensive problem, it requires a fast and accurate calculation to ensure the secure operation. Therefore, efficient mathematical modelling and parallel programming are key to efficient static security analysis. This paper proposes a parallel algorithm for static CA that uses both central processing units (CPUs) and graphical processing units (GPUs). To enhance the accuracy, AC load flow is used, and parallel computation of load flow is done simultaneously, with efficient screening and ranking of the critical contingencies. We perform extensive experiments to evaluate the efficacy of the proposed algorithm. As a result, we establish that the proposed parallel algorithm with high-performance computing (HPC) computing is much faster than the traditional algorithms. Furthermore, the HPC experiments were conducted using the national supercomputing facility, which demonstrates the proposed algorithm in the context of N−1 and N−2 static CA with immense power systems, such as the Indian northern regional power grid (NRPG) 246-bus and the polish 2383-bus networks.
{"title":"High-performance computing for static security assessment of large power systems","authors":"Venkateswara Rao Kagita, Sanjaya Kumar Panda, Ram Krishan, P. Deepak Reddy, Jabba Aswanth","doi":"10.1080/09540091.2023.2264537","DOIUrl":"https://doi.org/10.1080/09540091.2023.2264537","url":null,"abstract":"Contingency analysis (CA) is one of the essential tools for the optimal design and security assessment of a reliable power system. However, its computational requirements rise with the growth of distributed generations in the interconnected power system. As CA is a complex and computationally intensive problem, it requires a fast and accurate calculation to ensure the secure operation. Therefore, efficient mathematical modelling and parallel programming are key to efficient static security analysis. This paper proposes a parallel algorithm for static CA that uses both central processing units (CPUs) and graphical processing units (GPUs). To enhance the accuracy, AC load flow is used, and parallel computation of load flow is done simultaneously, with efficient screening and ranking of the critical contingencies. We perform extensive experiments to evaluate the efficacy of the proposed algorithm. As a result, we establish that the proposed parallel algorithm with high-performance computing (HPC) computing is much faster than the traditional algorithms. Furthermore, the HPC experiments were conducted using the national supercomputing facility, which demonstrates the proposed algorithm in the context of N−1 and N−2 static CA with immense power systems, such as the Indian northern regional power grid (NRPG) 246-bus and the polish 2383-bus networks.","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135591121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mapping-based cross-domain recommendation (CDR) can effectively tackle the cold-start problem in traditional recommender systems. However, existing mapping-based CDR methods ignore data-sparse users in the source domain, which may impact the transfer efficiency of their preferences. To this end, this paper proposes a novel method named Neighbor Interaction-based Personalized Transfer for Cross-Domain Recommendation (NIPT-CDR). This proposed method mainly contains two modules: (i) an intra-domain item supplementing module and (ii) a personalised feature transfer module. The first module introduces neighbour interactions to supplement the potential missing preferences for each source domain user, particularly for those with limited observed interactions. This approach comprehensively captures the preferences of all users. The second module develops an attention mechanism to guide the knowledge transfer process selectively. Moreover, a meta-network based on users' transferable features is trained to construct personalised mapping functions for each user. The experimental results on two real-world datasets show that the proposed NIPT-CDR method achieves significant performance improvements compared to seven baseline models. The proposed model can provide more accurate and personalised recommendation services for cold-start users.
{"title":"Neighbor interaction-based personalised transfer for cross-domain recommendation","authors":"Kelei Sun, Yingying Wang, Mengqi He, Huaping Zhou, Shunxiang Zhang","doi":"10.1080/09540091.2023.2263664","DOIUrl":"https://doi.org/10.1080/09540091.2023.2263664","url":null,"abstract":"Mapping-based cross-domain recommendation (CDR) can effectively tackle the cold-start problem in traditional recommender systems. However, existing mapping-based CDR methods ignore data-sparse users in the source domain, which may impact the transfer efficiency of their preferences. To this end, this paper proposes a novel method named Neighbor Interaction-based Personalized Transfer for Cross-Domain Recommendation (NIPT-CDR). This proposed method mainly contains two modules: (i) an intra-domain item supplementing module and (ii) a personalised feature transfer module. The first module introduces neighbour interactions to supplement the potential missing preferences for each source domain user, particularly for those with limited observed interactions. This approach comprehensively captures the preferences of all users. The second module develops an attention mechanism to guide the knowledge transfer process selectively. Moreover, a meta-network based on users' transferable features is trained to construct personalised mapping functions for each user. The experimental results on two real-world datasets show that the proposed NIPT-CDR method achieves significant performance improvements compared to seven baseline models. The proposed model can provide more accurate and personalised recommendation services for cold-start users.","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135193121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Dual-motor multi-gear coupling powertrain (DMCP) has the potential to improve transmission system efficiency and driving comfort, but its complex structure and multiple working modes present challenges. The switching between different modes is easy to cause longitudinal biggish vehicle jerk. To address these issues,this paper introduces the Deep Deterministic Policy Gradient (DDPG) algorithm in the design of an Energy Management Strategy (EMS) that minimises total drive power consumption. And the number of working modes is divided and simplified. The process of switching dual motor and single motor to single motor is introduced in detail. The simulation results using AMESim and MATLAB show that the energy management strategy can effectively improve the economy, achieve no power interruption during mode switching, shift impact is less than 8m/s3, and output torque is remains stable.
{"title":"An efficiency control strategy of dual-motor multi-gear drive algorithm","authors":"Lijun Xiao, Wei Liang, Jiahong Cai, Ming Wang, Jiahong Xiao, Yinyan Gong, Weigang Zhang","doi":"10.1080/09540091.2023.2249264","DOIUrl":"https://doi.org/10.1080/09540091.2023.2249264","url":null,"abstract":"The Dual-motor multi-gear coupling powertrain (DMCP) has the potential to improve transmission system efficiency and driving comfort, but its complex structure and multiple working modes present challenges. The switching between different modes is easy to cause longitudinal biggish vehicle jerk. To address these issues,this paper introduces the Deep Deterministic Policy Gradient (DDPG) algorithm in the design of an Energy Management Strategy (EMS) that minimises total drive power consumption. And the number of working modes is divided and simplified. The process of switching dual motor and single motor to single motor is introduced in detail. The simulation results using AMESim and MATLAB show that the energy management strategy can effectively improve the economy, achieve no power interruption during mode switching, shift impact is less than 8m/s3, and output torque is remains stable.","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135535399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-26DOI: 10.1080/09540091.2023.2259115
Yunus Abdi, Ömer Küllü, Mehmet Kıvılcım Keleş, Berk Gökberk
Reliable evaluation of damage in vehicles is a primary concern in the insurance industry. Consequently, solutions enhanced with Artificial Intelligence (AI) have become the norm. During the assessment, precise damage segmentation plays a crucial role. Dent is a type of damage that can commonly occur in vehicles. It is difficult to pinpoint and tends to blend in with the background. This paper proposes a novel loss function to improve dent segmentation accuracy in vehicle insurance claims. Centre and Pixel-based Weighted DICE (CPW-DICE) is a loss function that performs pixel-based weighting. The CPW-DICE aims to concentrate on the centre of the dent damage to lessen faulty segmentations. CPW-DICE generates a weight mask during training by employing ground truth (GT) and prediction masks. Simultaneously, the weight mask is incorporated into DICE loss. Experiments conducted on our comprehensive internal dataset show a 3% improvement in Intersection over Union (IoU) score for three state-of-the-art (SOTA) approaches compared to DICE loss. Finally, CPW-DICE is evaluated in similar tasks to demonstrate its benefits beyond car damage segmentation.
对车辆损坏的可靠评估是保险行业的首要问题。因此，人工智能(AI)增强的解决方案已成为常态。在评估过程中，精确的损伤分割是至关重要的。凹痕是一种通常发生在车辆上的损伤。它很难精确定位，而且往往与背景融为一体。为了提高汽车保险索赔中凹痕分割的准确性，提出了一种新的损失函数。中心和基于像素的加权DICE (CPW-DICE)是一个执行基于像素加权的损失函数。CPW-DICE的目的是集中在凹痕损伤的中心，以减少错误的分割。CPW-DICE在训练过程中利用ground truth (GT)和prediction mask生成权重mask。同时，权重掩模被纳入DICE损失。在我们全面的内部数据集上进行的实验表明，与DICE损失相比，三种最先进的(SOTA)方法在交汇(IoU)得分上提高了3%。最后，在类似的任务中对CPW-DICE进行评估，以证明其在汽车损伤分割之外的好处。
{"title":"CPW-DICE: a novel center and pixel-based weighting for damage segmentation","authors":"Yunus Abdi, Ömer Küllü, Mehmet Kıvılcım Keleş, Berk Gökberk","doi":"10.1080/09540091.2023.2259115","DOIUrl":"https://doi.org/10.1080/09540091.2023.2259115","url":null,"abstract":"Reliable evaluation of damage in vehicles is a primary concern in the insurance industry. Consequently, solutions enhanced with Artificial Intelligence (AI) have become the norm. During the assessment, precise damage segmentation plays a crucial role. Dent is a type of damage that can commonly occur in vehicles. It is difficult to pinpoint and tends to blend in with the background. This paper proposes a novel loss function to improve dent segmentation accuracy in vehicle insurance claims. Centre and Pixel-based Weighted DICE (CPW-DICE) is a loss function that performs pixel-based weighting. The CPW-DICE aims to concentrate on the centre of the dent damage to lessen faulty segmentations. CPW-DICE generates a weight mask during training by employing ground truth (GT) and prediction masks. Simultaneously, the weight mask is incorporated into DICE loss. Experiments conducted on our comprehensive internal dataset show a 3% improvement in Intersection over Union (IoU) score for three state-of-the-art (SOTA) approaches compared to DICE loss. Finally, CPW-DICE is evaluated in similar tasks to demonstrate its benefits beyond car damage segmentation.","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134885411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-08-22DOI: 10.1080/09540091.2023.2236810
Yixuan Yang, Sony Peng, Sophort Siet, Sadriddinov Ilkhomjon, Vilakone Phonexay, Seok-Hoon Kim, Doosoon Park
{"title":"Detecting susceptible communities and individuals in hospital contact networks: a model based on social network analysis","authors":"Yixuan Yang, Sony Peng, Sophort Siet, Sadriddinov Ilkhomjon, Vilakone Phonexay, Seok-Hoon Kim, Doosoon Park","doi":"10.1080/09540091.2023.2236810","DOIUrl":"https://doi.org/10.1080/09540091.2023.2236810","url":null,"abstract":"","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2023-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59793490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-08-22DOI: 10.1080/09540091.2023.2246703
Gebrekiros Gebreyesus Gebremariam, J. Panda, S. Indu
{"title":"Design of advanced intrusion detection systems based on hybrid machine learning techniques in hierarchically wireless sensor networks","authors":"Gebrekiros Gebreyesus Gebremariam, J. Panda, S. Indu","doi":"10.1080/09540091.2023.2246703","DOIUrl":"https://doi.org/10.1080/09540091.2023.2246703","url":null,"abstract":"","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2023-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59793692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-08-22DOI: 10.1080/09540091.2023.2241669
Chengjun Yang, Ruijie Zhu, Xinde Yu, Ce Yang, Lijun Xiao, Scott Fowler
{"title":"Real-time reading system for pointer meter based on YolactEdge","authors":"Chengjun Yang, Ruijie Zhu, Xinde Yu, Ce Yang, Lijun Xiao, Scott Fowler","doi":"10.1080/09540091.2023.2241669","DOIUrl":"https://doi.org/10.1080/09540091.2023.2241669","url":null,"abstract":"","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2023-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59793557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-07-22DOI: 10.1080/09540091.2023.2233716
Jueun Jeon, Seungyeon Baek, Byeonghui Jeong, Y. Jeong
{"title":"Early prediction of ransomware API calls behaviour based on GRU-TCN in healthcare IoT","authors":"Jueun Jeon, Seungyeon Baek, Byeonghui Jeong, Y. Jeong","doi":"10.1080/09540091.2023.2233716","DOIUrl":"https://doi.org/10.1080/09540091.2023.2233716","url":null,"abstract":"","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2023-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86735141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：