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

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Shibuya, Tatsukichi Inoue, Nakamasa Kawakami, Rei Sato, Ikuro Department of Computer Science Institute of Science Tokyo Tokyo Japan Department of Systems and Control Engineering Institute of Science Tokyo Tokyo Japan Denso IT Laboratory Tokyo Japan

ISBN: (纸本)9798350368741

For deploying deep neural networks on edge devices with limited resources, binary neural networks (BNNs) have attracted significant attention, due to their computational and memory efficiency. However, once a neural network is binarized, finetuning it on edge devices becomes challenging because most conventional training algorithms for BNNs are designed for use on centralized servers and require storing real-valued parameters during training. To address this limitation, this paper introduces binary stochastic flip optimization (BinSFO), a novel training algorithm for BNNs. BinSFO employs a parameter update rule based on Boolean operations, eliminating the need to store real-valued parameters and thereby reducing memory requirements and computational overhead. In experiments, we demonstrated the effectiveness and memory efficiency of BinSFO in finetuning scenarios on six image classification datasets. BinSFO performed comparably to conventional training algorithms with a 70.7% smaller memory requirement. Code is released at https://***/TatsukichiShibuya/ICASSP2025_BinSFO. © 2025 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Data-Driven Adaptive Control Approach for Enhancing the Dynamic Response of VSGs in Varying Grid Conditions

引用

IEEE Transactions on Power Delivery 2025年第3期40卷 1421-1433页

作者： Fahad, Shah She, Buxin Yin, Junjie Li, Fangxing Cui, Hantao Bo, Rui Department of Electrical and Computer Engineering Missouri University of Science and Technology Rolla MO USA Senior Power Systems Engineer ETAP Irvine CA USA Optimization & Control Group Parcific Northwest National Laboratory Richland USA Department of Electrical Engineering and Computer Science University of Tennessee at Knoxville Knoxville TN USA Department of Electrical and Computer Engineering North Carolina State University Raleigh NC USA

Conventionally, a virtual synchronous generator (VSG) is designed for islanded mode (IM) operation to meet specific operational requirements such as the rate of change of frequency (RoCoF). However, the operation of VSG designed for IM may not meet the operational and control criteria in grid connected mode (GCM) when the grid conditions vary. In addition, conventional VSG control technology does not consider the influence of the presynchronization scheme when connected to a weak grid, which degrades the RoCoF in IM. To overcome the aforementioned challenges, the proposed study presents a twin-delayed deep deterministic policy gradient (TD3) algorithm to improve the seamless transition performance of VSG from IM to GCM and vice versa. In the first step, the VSG-based power system model is used as a foundation for problem formulation of the proposed TD3 algorithm. Secondly, a reward function is designed according to the performance requirements, i.e., frequency and RoCoF requirements, of the VSG in order to guide the training of the agent in varying load, power reference, and grid conditions. Finally, the superiority of the proposed algorithm over existing methods is validated in MATLAB/SIMULINK and RTDS based real-time simulation environment. © 1986-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

D-scheduler:A scheduler in time-triggered distributed system through decoupling dependencies between tasks and messages

引用

science China(Technological sciences) 2024年第1期67卷 183-196页

作者： YANG TingTing ZHANG YuQi YUE FengLai WUNIRI QiQiGe TONG Chao School of Computer Science&Engineering Beihang UniversityBeijing 100191China State Key Laboratory of Virtual Reality Technology and Systems Beihang UniversityBeijing 100191China National Innovation Center of Intelligent and Connected Vehicles Beijing 100176China

Time-triggered architecture,as a mainstream design of the distributed real-time system,has been successfully applied in the aerospace,automotive and mechanical ***,time-triggered scheduling is a challenging NP-hard *** are few studies that could quickly solve the scheduling problem of large distributed time-triggered *** solve this problem,a communication affinity parameter is defined in this paper to describe the degree of bias of the shaper task towards sending or receiving *** on this,an innovative task-message decoupling model named D-scheduler is built to reduce the computation complexity of the scheduling problem in large-scale ***,we provide mathematical proof that our model is a convex optimization that is easy to solve with existing computational *** experiments substantiate the efficacy of the *** dramatically reduces the scheduling complexity of large-scale real-time systems with a small loss of solving space compared to the federal scheduler.

关键词： time-triggered architecture time-triggered scheduling communication affinity parameter task-message decoupling model

来源：评论

学校读者我要写书评

暂无评论

Balancing Crop Priorities: PSO-Based Equitable Irrigation Water Distribution for Efficient Resource Management 17

Balancing Crop Priorities: PSO-Based Equitable Irrigation Wa...

引用

17th International Conference on INnovations in Intelligent systems and Applications, INISTA 2023

作者： Ikidid, Abdelouafi Fazziki, Abdelaziz El Baba, Naima Cadi Ayyad University Computer Science Dept Computing Systems Engineering Laboratory Marrakesh Morocco

ISBN: (纸本)9798350338904

Agriculture consumes a significant proportion of water reserves in irrigated areas. Improving irrigation is becoming essential to reduce this high-water consumption by adapting supplies to crop needs and avoiding losses. This global issue has prompted many scientists to think about sustainable solutions using innovative technologies. This study aims to solve the problem of equitable distribution of irrigation water to crops using the PSO (Particle Swarm Optimization) algorithm. The problem involves the allocation of water between N crops, taking into account the priorities of each crop, the minimum and maximum water thresholds required, and the total amount of water available. A precise modeling of the problem is proposed, followed by a description of the PSO algorithm adapted to this situation. The implementation of the algorithm in Python is also presented. The results and performance of the algorithm are discussed, showing its ability to find a fair and efficient solution for irrigation water allocation. © 2023 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Forecasting of Groundwater Level in Multiple Wells using Machine Learning Models 17

Forecasting of Groundwater Level in Multiple Wells using Mac...

引用

17th International Conference on Signal-Image Technology and Internet-Based systems, SITIS 2023

作者： Baba, Naima Fazziki, Abdelaziz El Jarir, Zahi Cadi Ayyad University Computing Systems Engineering Laboratory Computer Science Dept Marrakesh Morocco

ISBN: (纸本)9798350370911

Accurate forecasting of groundwater levels is crucial for sustainable water resource management and environmental planning. This article explores the use of machine learning for accurate groundwater level predictions. In this study three machine learning models including artificial neural network ANN, long-short term memory LSTM and Extreme Gradient Boosting decision tree XGBoost technique were used to predict ground water level. We incorporate deep water surface measurements and meteorological data as key parameters to enhance forecasting accuracy. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Knowledge Transfer Learning via Dual Density Sampling for Resource-Limited Domain Adaptation

引用

IEEE/CAA Journal of Automatica Sinica 2023年第12期10卷 2269-2291页

作者： Zefeng Zheng Luyao Teng Wei Zhang Naiqi Wu Shaohua Teng the School of Computer Science and Technology Guangdong University of TechnologyGuangzhou 510006China the School of Information Engineering Guangzhou Panyu PolytechicGuangzhou 511483China the Faculty of Information Technology Monash University20 Exhibition Walk ClaytonVIC 3800Australia IEEE the Institute of Systems Engineering and Collaborative Laboratory for Intelligent Science and Systems Macao University of Science and TechnologyMacao 999078China

Most existing domain adaptation(DA) methods aim to explore favorable performance under complicated environments by ***,there are three unsolved problems that limit their efficiencies:ⅰ) they adopt global sampling but neglect to exploit global and local sampling simultaneously;ⅱ)they either transfer knowledge from a global perspective or a local perspective,while overlooking transmission of confident knowledge from both perspectives;and ⅲ) they apply repeated sampling during iteration,which takes a lot of *** address these problems,knowledge transfer learning via dual density sampling(KTL-DDS) is proposed in this study,which consists of three parts:ⅰ) Dual density sampling(DDS) that jointly leverages two sampling methods associated with different views,i.e.,global density sampling that extracts representative samples with the most common features and local density sampling that selects representative samples with critical boundary information;ⅱ)Consistent maximum mean discrepancy(CMMD) that reduces intra-and cross-domain risks and guarantees high consistency of knowledge by shortening the distances of every two subsets among the four subsets collected by DDS;and ⅲ) Knowledge dissemination(KD) that transmits confident and consistent knowledge from the representative target samples with global and local properties to the whole target domain by preserving the neighboring relationships of the target *** analyses show that DDS avoids repeated sampling during the *** the above three actions,confident knowledge with both global and local properties is transferred,and the memory and running time are greatly *** addition,a general framework named dual density sampling approximation(DDSA) is extended,which can be easily applied to other DA *** experiments on five datasets in clean,label corruption(LC),feature missing(FM),and LC&FM environments demonstrate the encouraging performance of KTL-DDS.

关键词： Cross-domain risk dual density sampling intra-domain risk maximum mean discrepancy knowledge transfer learning resource-limited domain adaptation

来源：评论

学校读者我要写书评

暂无评论

Adaptive Graph Embedding With Consistency and Specificity for Domain Adaptation

引用

IEEE/CAA Journal of Automatica Sinica 2023年第11期10卷 2094-2107页

作者： Shaohua Teng Zefeng Zheng Naiqi Wu Luyao Teng Wei Zhang School of Computer Science and Technology Guangdong University of TechnologyGuangzhou 510006China Institute of Systems Engineering and Collaborative Laboratory for Intelligent Science and Systems Macao University of Science and TechnologyMacao 999078China School of Information Engineering Guangzhou Panyu PolytechicGuangzhou 511483China Faculty of Information Technology Monash University20 Exhibition Walk ClaytonVIC 3800Australia IEEE

Domain adaptation(DA) aims to find a subspace,where the discrepancies between the source and target domains are reduced. Based on this subspace, the classifier trained by the labeled source samples can classify unlabeled target samples *** approaches leverage Graph Embedding Learning to explore such a subspace. Unfortunately, due to 1) the interaction of the consistency and specificity between samples, and 2) the joint impact of the degenerated features and incorrect labels in the samples, the existing approaches might assign unsuitable similarity, which restricts their performance. In this paper, we propose an approach called adaptive graph embedding with consistency and specificity(AGE-CS) to cope with these issues. AGE-CS consists of two methods, i.e., graph embedding with consistency and specificity(GECS), and adaptive graph embedding(AGE).GECS jointly learns the similarity of samples under the geometric distance and semantic similarity metrics, while AGE adaptively adjusts the relative importance between the geometric distance and semantic similarity during the iterations. By AGE-CS,the neighborhood samples with the same label are rewarded,while the neighborhood samples with different labels are punished. As a result, compact structures are preserved, and advanced performance is achieved. Extensive experiments on five benchmark datasets demonstrate that the proposed method performs better than other Graph Embedding methods.

关键词： Adaptive adjustment consistency and specificity domain adaptation graph embedding geometrical and semantic metrics

来源：评论

学校读者我要写书评

暂无评论

Dual Adaptive Representation Alignment for Cross-Domain Few-Shot Learning

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2023年第10期45卷 11720-11732页

作者： Zhao, Yifan Zhang, Tong Li, Jia Tian, Yonghong Peking University The School of Computer Science Beijing100871 China Beihang University The State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beijing100191 China The Pengcheng Laboratory Guangdong Shenzhen518055 China Peking University Shenzhen Granduate School The School of Electronic and Computer Engineering Guangdong Shenzhen518055 China

Few-shot learning aims to recognize novel queries with limited support samples by learning from base knowledge. Recent progress in this setting assumes that the base knowledge and novel query samples are distributed in the same domains, which are usually infeasible for realistic applications. Toward this issue, we propose to address the cross-domain few-shot learning problem where only extremely few samples are available in target domains. Under this realistic setting, we focus on the fast adaptation capability of meta-learners by proposing an effective dual adaptive representation alignment approach. In our approach, a prototypical feature alignment is first proposed to recalibrate support instances as prototypes and reproject these prototypes with a differentiable closed-form solution. Therefore feature spaces of learned knowledge can be adaptively transformed to query spaces by the cross-instance and cross-prototype relations. Besides the feature alignment, we further present a normalized distribution alignment module, which exploits prior statistics of query samples for solving the covariant shifts among the support and query samples. With these two modules, a progressive meta-learning framework is constructed to perform the fast adaptation with extremely few-shot samples while maintaining its generalization capabilities. Experimental evidence demonstrates our approach achieves new state-of-the-art results on 4 CDFSL benchmarks and 4 fine-grained cross-domain benchmarks. © 1979-2012 IEEE.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

Metaheuristics for Financial Investment Strategies: Applications Survey

Metaheuristics for Financial Investment Strategies: Applicat...

引用

2023 International Conference on Electrical, computer, Communications and Mechatronics engineering, ICECCME 2023

作者： Bousbaa, Zineb Bencharef, Omar Cady Ayyad University Computer and Systems Engineering Laboratory Faculty of Sciences and Technology Computer Science Department Marrakesh Morocco

ISBN: (纸本)9798350322972

Machine learning has been widely used as part of financial markets investment strategies, whether for forecasting the financial assets exchange rate, managing market volatility, or solving different classification problems that help with decision-making. Building an investment strategy using a scientific approach requires a massive amount of data, good computational power, and some expertise in the finance industry. Machine learning applications to the financial field, such as price exchange rate prediction, market pattern recognition, or other trading strategy tasks, are considered optimization problems. As they require an efficient algorithm dedicated to finding a global optimum, they can be solved using metaheuristics. In this survey, we study how metaheuristic optimization techniques contribute to building a robust learning model dedicated to financial investment strategy applications. © 2023 IEEE.

关键词： Financial markets

来源：评论

学校读者我要写书评

暂无评论

Counterfactual discriminative micro-expression recognition

引用

Visual Intelligence 2024年第1期2卷 1-10页

作者： Li, Yong Liu, Menglin Lao, Lingjie Wang, Yuanzhi Cui, Zhen Department of Computer Science City University of Hong Kong 999077 Hong Kong School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing 210094 China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing 210094 China

Micro-expressions are spontaneous, rapid and subtle facial movements that can hardly be suppressed or fabricated. Micro-expression recognition (MER) is one of the most challenging topics in affective computing. It aims to recognize subtle facial movements which are quite difficult for humans to perceive in a fleeting period. Recently, many deep learning-based MER methods have been developed. However, how to effectively capture subtle temporal variations for robust MER still perplexes us. We propose a counterfactual discriminative micro-expression recognition (CoDER) method to effectively learn the slight temporal variations for video-based MER. To explicitly capture the causality from temporal dynamics hidden in the micro-expression (ME) sequence, we propose ME counterfactual reasoning by comparing the effects of the facts w.r.t. original ME sequences and the counterfactuals w.r.t. counterfactually-revised ME sequences, and then perform causality-aware prediction to encourage the model to learn those latent ME temporal cues. Extensive experiments on four widely-used ME databases demonstrate the effectiveness of CoDER, which results in comparable and superior MER performance compared with that of the state-of-the-art methods. The visualization results show that CoDER successfully perceives the meaningful temporal variations in sequential faces. © The Author(s) 2024.

关键词： Affective computing Causal graph Counterfactual reasoning Micro-expression recognition Temporal variation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：