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

A Risk-Averse Just-In-Time Scheme for Learning-Based Operation of Microgrids With Coupled Electricity-Hydrogen-Ammonia Under Uncertainties

引用

IEEE Transactions on Sustainable Energy 2025年

作者： Li, Longyan Ning, Chao Pan, Guangsheng Zhang, Leiqi Gu, Wei Zhao, Liang Du, Wenli Shahidehpour, Mohammad Shanghai Jiao Tong University Department of Automation Shanghai200240 China Ministry of Education of China Key Laboratory of System Control and Information Processing Shanghai200240 China School of Electrical Engineering Southeast University Nanjing210096 China Zhejiang Key Laboratory of Distributed Generations and Microgrid Technology State Grid Zhejiang Electric Power Research Institute Hangzhou310014 China Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education East China University of Science and Technology China Department of Electrical and Computer Engineering Illinois Institute of Technology ChicagoIL60616 United States

This paper proposes a Risk-Averse Just-In-Time (RAJIT) operation scheme for Ammonia-Hydrogen-based Micro-Grids (AHMGs) to boost electricity-hydrogen-ammonia coupling under uncertainties. First, an off-grid AHMG model is developed, featuring a novel multi-mode ammonia synthesis process and a hydrogen-ammonia dual gas turbine with tunable feed-in ratios. Subsequently, a state-behavior mapping strategy linking hydrogen storage levels with the operation modes of ammonia synthesis is established to prevent cost-ineffective shutdowns. The proposed model substantially improves operational flexibility but results in a challenging nonlinear fractional program. Based upon this model, a data-driven RAJIT scheme is developed for the real-time rolling optimization of AHMGs. Unlike conventional one-size-fits-all schemes using one optimization method throughout, the data-driven RAJIT intelligently switches between cost-effective deterministic optimization and risk-averse online-learning distributionally robust optimization depending on actual risk profiles, thus capitalizing on the respective strengths of these two optimization methods. To facilitate the solution of the resulting nonlinear program, we develop an equivalent-reformulation-based solution methodology by leveraging a constraint-tightening technique. Numerical simulations demonstrate that the proposed scheme guarantees safety and yields an overall cost reduction up to 14.6% compared with several state-of-the-art methods. © 2025 IEEE.

关键词： Ammonia

来源：评论

学校读者我要写书评

暂无评论

PSP-Finder:A Defect Detection Method Based on Mining Correlations from Function Call Paths

引用

Chinese Journal of Electronics 2018年第4期27卷 776-782页

作者： CUI Zhanqi CHEN Xiang MU Yongmin PAN Minxue WANG Rongcun Computer School Beijing Information Science and Technology University Sate Key Laboratory for Novel Software Technology Nanjing University School of Computer Science and Technology Nantong University School of Computer Science and Technology China University of Mining and Technology

Large scale programs usually imply many programming rules, which are missing from the specification documents. However, if programmers violate these rules in the process of programming, it is possible to introduce software defects. Previous works on mining function call correlation patterns only use structural information of the program, while control flow, data flow or other semantic information of the program are not exploited in those approaches. As a result, the defect detecting ability is restricted and high false rate is caused. This paper proposes a defect detection method based on mining function call association rules from program paths, which can be provided by simple static analysis. Then, the programs are automatically checked against the function call association rules for detecting suspicious defects. Based on this approach,experiments are carried out on a group of open source projects. The experiment results show that this approach can improve the capability of detecting defects and find more bugs related to program execution path. In addition,the false positive function call patterns and the overhead for manually validating suspicious defects are reduced.

关键词： Function call graphs Function call paths Mining association rules Defect detection

来源：评论

学校读者我要写书评

暂无评论

Interpersonal Relationship Analysis with Dyadic EEG Signals via Learning Spatial-Temporal Patterns

Interpersonal Relationship Analysis with Dyadic EEG Signals...

引用

4th International Workshop on Human Brain and Artificial Intelligence, HBAI 2024

作者： Ji, Wenqi Liu, Fang Du, Xinxin Liu, Niqi Zhou, Chao Yu, Minjing Guo, Xinyue Zhao, Guozhen Liu, Yong-Jin Department of Computer Science and Technology Tsinghua University Beijing100084 China State Key Laboratory of Media Convergence and Communication Communication University of China Beijing100024 China Institute of Software Chinese Academy of Sciences Beijing100190 China College of Intelligence and Computing Tianjin University Tianjin300072 China CAS Key Laboratory of Behavioral Science Institute of Psychology Beijing100049 China

ISBN: (纸本)9789819640003

Interpersonal relationship quality is pivotal in social and occupational contexts. Existing analysis of interpersonal relationships mostly rely on subjective self-reports, whereas objective quantification remains challenging. In this paper, we propose a novel social relationship analysis framework using spatio-temporal patterns derived from dyadic EEG signals, which can be applied to quantitatively measure team cooperation in corporate team building, and evaluate interpersonal dynamics between therapists and patients in psychiatric therapy. First, we constructed a dyadic-EEG dataset from 72 pairs of participants with two relationships (stranger or friend) when watching emotional videos simultaneously. Then we proposed a deep neural network on dyadic-subject EEG signals, in which we combine the dynamic graph convolutional neural network for characterizing the interpersonal relationships among the EEG channels and 1-dimension convolution for extracting the information from the time sequence. To obtain the feature vectors from two EEG recordings that well represent the relationship of two subjects, we integrate deep canonical correlation analysis and triplet loss for training the network. Experimental results show that the social relationship type (stranger or friend) between two individuals can be effectively identified through their EEG data. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Simulation-based security of function-hiding inner product encryption

引用

science China(Information sciences) 2018年第4期61卷 215-225页

作者： Qingsong ZHAO Qingkai ZENG Ximeng LIU Huanliang XU State Key Laboratory for Novel Software Technology Nanjing University Department of Computer Science and Technology Nanjing University College of Information Science and Technology Nanjing Agricultural University School of Information Systems Singapore Management University

Functional encryption(FE)[1,2]is a modern type of encryption scheme that extends several previous notions and allows tremendous flexibility in controlling and computing on encrypted *** enables an authority to derive ... 详细信息

关键词： PP IPE MSK Simulation-based security of function-hiding inner product encryption

来源：评论

学校读者我要写书评

暂无评论

Dynamic Cross-Modal Feature Interaction Network for Hyperspectral and LiDAR Data Classification

arXiv

引用

arXiv 2025年

作者： Lin, Junyan Gao, Feng Qi, Lin Dong, Junyu Du, Qian Gao, Xinbo School of Computer Science and Technology Ocean University of China Qingdao266100 China Department of Electrical and Computer Engineering Mississippi State University StarkvilleMS39762 United States Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Chongqing400065 China

Hyperspectral image (HSI) and LiDAR data joint classification is a challenging task. Existing multi-source remote sensing data classification methods often rely on human-designed frameworks for feature extraction, which heavily depend on expert knowledge. To address these limitations, we propose a novel Dynamic Cross-Modal Feature Interaction Network (DCMNet), the first framework leveraging a dynamic routing mechanism for HSI and LiDAR classification. Specifically, our approach introduces three feature interaction blocks: Bilinear Spatial Attention Block (BSAB), Bilinear Channel Attention Block (BCAB), and Integration Convolutional Block (ICB). These blocks are designed to effectively enhance spatial, spectral, and discriminative feature interactions. A multi-layer routing space with routing gates is designed to determine optimal computational paths, enabling data-dependent feature fusion. Additionally, bilinear attention mechanisms are employed to enhance feature interactions in spatial and channel representations. Extensive experiments on three public HSI and LiDAR datasets demonstrate the superiority of DCMNet over state-of-the-art methods. Our code will be available at https://***/oucailab/DCMNet. © 2025, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Static code analyzer recommendation via preference mining

引用

Expert Systems with Applications 2025年 285卷

作者： Ge, Xiuting Fang, Chunrong Li, Xuanye Shang, Ye Zhang, Mengyao Pan, Ya China Engineering Research Center of Natural Resource Information Management and Digital Twin Engineering Software Ministry of Education China The State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science and Technology Southwest University of Science and Technology China

Static Code Analyzers (SCAs) have played a critical role in software quality assurance. However, SCAs with various static analysis techniques suffer from different levels of false positives and false negatives, thereby yielding varying effectiveness in SCAs. To detect more defects in a given project, it is a possible way to use more available SCAs for scanning this project. Due to producing unacceptable costs and overpowering warnings, invoking all available SCAs for the defect detection of a given project is impractical in real scenarios. To address the above problem, we are the first to propose a practical SCA recommendation approach via preference mining, which aims to select the most effective SCA for a given project. Specifically, our approach performs the SCA effectiveness evaluation to obtain the correspondingly optimal SCAs on projects under test. Subsequently, our approach performs the SCA preference mining via the project characteristics, thereby analyzing the intrinsic relation between projects under test and the correspondingly optimal SCAs. Finally, our approach constructs the SCA recommendation model based on projects under test and the associated characteristics. We conduct the experimental evaluation on three popular SCAs as well as 213 open-source and large-scale projects. The results present that our constructed SCA recommendation model outperforms four typical baselines by 2 ∼ 11 times. © 2025

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Generalization and differentiation of affective associative memory circuit based on memristive neural network with emotion transfer

引用

Neural Networks 2025年 188卷 107502页

作者： Yao, Wei Gao, Kai Wang, You Lin, Hairong Wu, Hongwei Xu, Cong Zhang, Xin School of Computer and Communication Engineering Changsha University of Science & Technology Changsha410114 China State Key Laboratory of Industrial Control Technology Zhejiang University Hangzhou China School of Electronic Information Central South University Changsha410083 China School of Software Engineering Dalian University Dalian116622 China Co. Ltd. Dalian China College of Semiconductors Hunan University Changsha410082 China

Most existing research on affective associative memory neural network circuits has predominantly concentrated on reinforcement and extinction, with insufficient attention given to the integration of emotion transfer alongside the principles of generalization and differentiation. To enhance the functionality of associative memory, this paper introduces a memristor-based affective associative memory neural network that incorporates generalization and differentiation under emotion transfer. The circuit implementation is carried out using PSPICE. The capabilities of learning, forgetting, emotion transfer, as well as generalization and differentiation under emotion transfer, are effectively realized and validated through simulation results. By examining generalization and differentiation under emotion transfer, this study presents an innovative approach to the field of affective associative memory neural networks based on memristors, particularly in relation to complex biological behaviors. © 2025 Elsevier Ltd

关键词： SPICE

来源：评论

学校读者我要写书评

暂无评论

Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks

引用

Journal of computer science & technology 2008年第6期23卷 944-956页

作者：张学洪爵陆桑璐谢立曹建农 State Key Laboratory for Novel Software Technology Department of Computer Science and TechnologyNanjing University Department of Electrical Engineering College of EngineeringNanjing Agricultural University Department of Computing Hong Kong Polytechnic University

Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor scalability or the void problem. In this paper, we propose a new geographic routing protocol, SBFR （Scoped Bellman-Ford Routing）, for large dynamic wireless sensor networks. The basic idea is that each node keeps a view scope of the network by computing distance vectors using the distributed Bellman- Ford method, and maintains a cost for routing to the sink. When forwarding a packet, a node picks the node with minimum cost in its routing table as a temporary landmark. While achieving good sealability, it also solves the void problem in an efficient manner through the combination of Bellman-Ford routing and cost-based geographic routing. Analytical and simulation results show that SBFR outperforms other routing protocols not only because of its robustness and scalability but also its practicality and simplicity.

关键词： Bellman-Ford geographic routing scalability void (hole) wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Complete Bipartite Anonymity for Location Privacy

引用

Journal of computer science & technology 2014年第6期29卷 1094-1110页

作者：董恺顾涛陶先平吕建 State Key Laboratory for Novel Software Technology Nanjing University Institute of Computer Software Nanjing University IEEE ACM School of Computer Science and Information Technology RMIT UniversityMelbourneVictoria 3001Australia CCF

Users are vulnerable to privacy risks when providing their location information to location-based services （LBS）. Existing work sacrifices the quality of LBS by degrading spatial and temporal accuracy for ensuring user privacy. In this paper, we propose a novel approach, Complete Bipartite Anonymity （CBA）, aiming to achieve both user privacy and quality of service. The theoretical basis of CBA is that： if the bipartite graph of k nearby users＇ paths can be transformed into a complete bipartite graph, then these users achieve k-anonymity since the set of ＂end points connecting to a specific start point in a graph＂ is an equivalence class. To achieve CBA, we design a Collaborative Path Confusion （CPC） protocol which enables nearby nsers to discover and authenticate each other without knowing their real identities or accurate locations, predict tile encounter location using users＇ moving pattern information, and generate fake traces obfuscating the real ones. We evaluate CBA using a real-world dataset, and compare its privacy performance with existing path confusion approach. The results show that CBA enhances location privacy by increasing the chance for a user confusing his/her path with others by 4 to 16 times in low user density areas. We also demonstrate that CBA is secure under the trace identification attack.

关键词： location privacy k-anonymity path confusion query obfuscation complete bipartite anonymity

来源：评论

学校读者我要写书评

暂无评论

MINIMUM ATTRIBUTE CO-REDUCTION ALGORITHM BASED ON MULTILEVEL EVOLUTIONARY TREE WITH SELF-ADAPTIVE SUBPOPULATIONS

引用

Transactions of Nanjing University of Aeronautics and Astronautics 2013年第2期30卷 175-184页

作者：丁卫平王建东 College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics State Key Laboratory for Novel Software Technology Nanjing University

Attribute reduction is an important process in rough set *** minimum attribute reduction has been proven to help the user-oriented make better knowledge discovery in some *** this paper,an efficient minimum attribute reduction algorithm is proposed based on the multilevel evolutionary tree with self-adaptive subpopulations.A model of multilevel evolutionary tree with self-adaptive subpopulations is constructed,and interacting attribute sets are better decomposed into subsets by the self-adaptive mechanism of elitist *** it can self-adapt the subpopulation sizes according to the historical performance record so that interacting attribute decision variables are captured into the same grouped subpopulation,which will be extended to better performance in both quality of solution and competitive computation complexity for minimum attribute *** conducted experiments show the proposed algorithm is better on both efficiency and accuracy of minimum attribute reduction than some representative *** the proposed algorithm is applied to magnetic resonance image(MRI)segmentation,and its stronger applicability is further demonstrated by the effective and robust segmentation results.

关键词： minimum attribute reduction self-adaptive subpopulation multilevel evolutionary tree interacting decision variable magnetic resonance image(MRI)segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：