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

3rd International Conference on Electronics and Renewable Systems, ICEARS 2025

作者： Deepa, R. Jayaraman, Venkatesh Srinivasulu, Senduru Umamageswari, B. Surendran, R. Srm Institute of Science & Technology School of Computing Department of Computing Technologies Kattankulathur Tamilnadu Chennai603203 India Chennai Institute of Technology Department of Computer Science and Engineering Chennai600069 India Sathyabama Institute of Science and Technology School of Computing Department of Computer Science and Engineering Chennai600119 India Srm Institute of Science & Technology School of Computing Department of Computing Technologies Chennai600119 India Saveetha Institute of Medical and Technical Sciences Saveetha School of Engineering Department of Computer Science and Engineering Chennai India

ISBN: (纸本)9798331509675

The agricultural information system deals with massive amounts of data from heterogeneous sources. It helps the farmers gain accurate information by providing better insights. A significant issue in agricultural data is its unstructured form, which can be resolved through ontology - a novel framework known as AgriOntology is proposed to address this issue for the Agrovoc dataset. The data in the unstructured form is initially pre-processed through the Natural Language Processing approach to generate features for ontology construction. The BERT and Jaccard similarity are applied to establish a relationship between the features used to construct the Agri-Ontology. Post ontology construction, the BiGAN framework is used to analyze the performance. The performance of the constructed ontology is observed to have an accuracy of 94.64%, which is higher than the existing models. © 2025 IEEE.

关键词： Data assimilation

来源：评论

学校读者我要写书评

暂无评论

Identification and Classification of Medicinal Plants using Machine Learning Algorithms 3

Identification and Classification of Medicinal Plants using ...

引用

3rd International Conference on Electronics and Renewable Systems, ICEARS 2025

作者： Bhargavi, G. Jayaraman, Venkatesh Jabez, J. Deepa, R. Surendran, R. Srm Institute of Science and Technology Department of Computing Technologies Chennai India Chennai Institute of Technology Department of Computer Science and Engineering Chennai600069 India Sathyabama Institute of Science and Technology School of Computing Department of Computer Science and Engineering Chennai India Srm Institute of Science and Technology School of Computing Department of Computing Technologies Kattankulathur Tamilnadu Chennai603203 India Saveetha Institute of Medical and Technical Sciences Saveetha School of Engineering Department of Computer Science and Engineering Chennai India

ISBN: (纸本)9798331509675

The increaing significance of plant life and botanical expertise extends beyond mere visual appreciation. With the growing interest in sustainable living and alternative remedies, there is a pressing demand for easily accessible and credible information on plant categorization, particularly focusing on medicinal plants. This innovative project synergizes machine learning capabilities, botanical proficiency, and user-friendly technology to give users the insights required to harness the benefits of medicinal plants responsibly and sustainably. The platform facilitates precise categorization and a comprehensive understanding of the therapeutic attributes of plants. © 2025 IEEE.

关键词： Medicinal chemistry

来源：评论

学校读者我要写书评

暂无评论

Average AoI Minimization with Directional Charging for Wireless-Powered Network Edge

引用

IEEE Transactions on Mobile computing 2025年第6期24卷 4889-4906页

作者： Chen, Quan Guo, Song Xu, Wenchao Li, Jing Shi, Tuo Gao, Hong Cai, Zhipeng Guangdong University of Technology School of Computer Science and Technology Guangzhou510006 China The Hong Kong University of Science and Technology Department of Computer Science and Engineering 999077 Hong Kong Hong Kong Polytechnic University Department of Computing Hong Kong999077 Hong Kong City University of Hong Kong Department of Computer Science Hong Kong Hong Kong Zhejiang Normal University School of Computer Science and Technology Jinhua China Georgia State University Department of Computer Science AtlantaGA30303 United States

Age of Information (AoI) has been proposed as a new performance metric to capture the freshness of data. At wireless-powered network edge, the source nodes first need to be charged ready for update transmissions, which means the system AoI is not only decided by the scheduling of update transmissions but also by the designing of charging plan. However, the existing works either only focused on the point of scheduling update transmissions or have a rigid assumption that only one source node can be charged per time. Aiming at making the work more practical and general, we investigate the average AoI optimization problem at wireless-powered network edge with directional charging. Firstly, the theoretical bound of the weighted sum of average AoI of the entire network with a directional charger is analyzed, which is proved to be related to nodes' maximum transmitting interval and the charging strategy. An optimal charging time computation algorithm is proposed to obtain the maximum transmitting interval of each source node by considering the overlapped areas of different charging orientations. After then, an AoI-aware periodical charging scheduling algorithm is proposed to compute a periodical charging schedule while the average AoI is bounded, including a charging period T and the charging orientations assigned to each time slot within T. The proposed algorithm is proved to have an approximation ratio of up to 1.5625. Furthermore, several approximate algorithms are also proposed for average AoI optimization with multiple chargers and network bandwidth constraint. Finally, the extensive simulations demonstrate the high performance of the proposed algorithm in terms of AoI. © 2002-2012 IEEE.

关键词： Inductive power transmission

来源：评论

学校读者我要写书评

暂无评论

Enhancing Graph Structure Learning via Motif-Driven Hypergraph Construction

引用

IEEE Transactions on Network science and Engineering 2025年第3期12卷 2333-2344页

作者： Zhao, Jia-Le Zhang, Xian-Jie Ding, Xiao Zhang, Xingyi Zhang, Hai-Feng Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Science Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China

Graph neural networks (GNNs), as a cutting-edge technology in deep learning, perform particularly well in various tasks that process graph structure data. However, their foundation on pairwise graphs often limits their capacity to capture latent higher-order topological semantic information. Thus, it is crucial to find a way to extract the latent higher-order information of graphs without missing the lower-order information of the original graph. To address this issue, we here develop a method to construct hypergraph based on motifs, and then a novel neural network framework, named MD-HGNN, is proposed for enhanced graph learning. Specifically, we first utilize motifs of the original graph to construct the hypergraph and eliminate nested structures within the hypergraph to prevent information redundancy. Subsequently, GNNs and hypergraph neural networks (HGNNs) are employed separately to extract the lower-order and higher-order topological semantic information of the graph. Finally, the lower-order and higher-order information are integrated to obtain an embedded representation of graph. Extensive experimental results demonstrate that MD-HGNN preserves the original lower-order graph structure information while effectively extracting higher-order features. Moreover, its performance and robustness are validated across different downstream tasks. © 2013 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Algorithms for online fault tolerance server consolidation

引用

Digital Communications and Networks 2025年第2期11卷 514-523页

作者： Li, Boyu Wu, Bin Shen, Meng Peng, Hao Li, Weisheng Zhang, Hong Gan, Jie Tian, Zhihong Xu, Guangquan College of Intelligence and Computing Tianjin University Tianjin300350 China School of Cyberspace Science and Technology Beijing Institute of Technology Beijing100081 China School of Computer Science and Technology Zhejiang Normal University Jinhua321004 China School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400054 China School of Astronautics Beihang University Beijing100191 China School of Computer Science University of Sydney SydneyNSW20528 Australia Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou511370 China

We study a novel replication mechanism to ensure service continuity against multiple simultaneous server failures. In this mechanism, each item represents a computing task and is replicated into ξ+1 servers for some integer ξ≥1, with workloads specified by the amount of required resources. If one or more servers fail, the affected workloads can be redirected to other servers that host replicas associated with the same item, such that the service is not interrupted by the failure of up to ξ servers. This requires that any feasible assignment algorithm must reserve some capacity in each server to accommodate the workload redirected from potential failed servers without overloading, and determining the optimal method for reserving capacity becomes a key issue. Unlike existing algorithms that assume that no two servers share replicas of more than one item, we first formulate capacity reservation for a general arbitrary scenario. Due to the combinatorial nature of this problem, finding the optimal solution is difficult. To this end, we propose a Generalized and Simple Calculating Reserved Capacity (GSCRC) algorithm, with a time complexity only related to the number of items packed in the server. In conjunction with GSCRC, we propose a robust replica packing algorithm with capacity optimization (RobustPack), which aims to minimize the number of servers hosting replicas and tolerate multiple server failures. Through theoretical analysis and experimental evaluations, we show that the RobustPack algorithm can achieve better performance. © 2024 Chongqing University of Posts and Telecommunications

关键词： Cloud computing Server consolidation Replica Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

AD2T: Adversarial Distortion Domain Translation for Robust Watermarking against Non-differentiable Distortions

AD2T: Adversarial Distortion Domain Translation for Robust W...

引用

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

作者： Zhao, Chengxin Ling, Hefei Chen, Jiazhong Fang, Han Li, Zongyi Xie, Sijing School of Computer Science and Technology Huazhong University of Science and Technology China School of Computing National University of Singapore Singapore

ISBN: (纸本)9798350368741

Deep watermarking models optimize robustness by incorporating distortions between the encoder and decoder. To tackle non-differentiable distortions, current methods only train the decoder with distorted images, which breaks the joint optimization of the encoder-decoder, resulting in suboptimal performance. To address this problem, we propose an Adversarial Distortion Domain Translation (AD2T) method by treating the distortion as an image-to-image translation task. AD2T adopts conditional GANs to learn the non-differentiable distortion mappings. It employs generators to transform the encoded image into the distorted one to bridge the encoder-decoder for joint optimization. We also supervise the GANs to generate challenging distorted samples to augment the watermarking model via adversarial training. This further improves the model robustness by minimizing the maximum decoding loss. Extensive experiments demonstrate the superiority of our method when tested on non-differentiable distortions, including lossy compression and style transfers. Codes are released here: https://***/zcxlanguage/AdversarialDistortionDomainTranslation. © 2025 IEEE.

关键词： adversarial training deep watermarking GANs non-differentiable distortions

来源：评论

学校读者我要写书评

暂无评论

Causal Analysis and Risk Assessment for Batch Crowdsourcing

引用

IEEE Transactions on Mobile computing 2025年第6期24卷 5312-5323页

作者： Chao, Ke Wang, Shengling Shi, Hongwei Huang, Jianhui Cheng, Xiuzhen Beijing Normal University School of Artificial Intelligence Beijing100875 China Chinese Academy of Sciences Institute of Computing Technology Beijing100190 China Shandong University School of Computer Science and Technology Shandong250100 China

The way of task posting serves as the main pillar in achieving an efficient crowdsourcing market. Pioneer solutions on task posting can be categorized as retail task posting and batch task posting. Unlike retail task posting, which simply matches the most suitable worker to tasks, batch task posting considers the collaborations not only between workers and tasks but also among tasks, which brings high efficiency, low costs, and satisfactory task completion rates. However, the state of the arts on batch task posting leverage specific attributes to combine tasks as bundles for posting, leading to limited scalability. Hence, we propose a causal analysis framework for batch crowdsourcing to achieve an attribute-independent batch crowdsourcing solution that disentangles multi-factors to uncover the posting merits of tasks bundled at optimal prices, based on which an approximately optimal algorithm is further introduced to form reasonable bundles for posting. Since batch crowdsourcing may incur losses due to short-term profit fluctuation, a risk assessment method is proposed to encourage the requestor to act properly for loss mitigations. Our work explores the causal analysis and risk assessment in batch crowdsourcing for the first time, with the following highlights: 1) generality. It proposes a composite metric for gauging task bundles which avoids the issue of attribute dependence in the state of the arts, resulting in better universality;2) synergy. By collaboratively considering the "value"and "relative position"of variables, our work derives results reflecting causal relationships rather than naive correlations;3) precision. We not only elucidate the probability of risk in batch crowdsourcing but also delineate the rate function governing its probability decay. This allows a requestor to know when and how fast to halt batch task posting. © 2025 IEEE.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

MetaHG: Enhancing HGNN Systems Leveraging Advanced Metapath Graph Abstraction 25

MetaHG: Enhancing HGNN Systems Leveraging Advanced Metapath ...

引用

20th European Conference on computer Systems, EuroSys 2025, co-located 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2025

作者： He, Haiheng Liu, Haifeng Zheng, Long Huang, Yu Shen, Xinyang Huang, Wenkan Cao, Chuaihu Liao, Xiaofei Jin, Hai Xue, Jingling National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science and Engineering University of New South Wales Australia

ISBN: (纸本)9798400711961

Heterogeneous Graph Neural Networks (HGNNs) are pivotal for extracting semantic and structural information from heterogeneous graphs. Traditional HGNN implementations often grapple with the challenges of excessive metapath instances, requiring substantial storage or incurring high instance-matching overhead. These methods typically suffer from redundant instance encoding and costly semantic graph construction. Addressing these issues, we introduce an advanced Metapath Graph (MG) abstraction that encapsulates the structural information of all metapath instances within a compact representation. This approach significantly reduces storage demands, eliminates redundant instance encodings, and foregoes the need for constructing semantic graphs, thereby facilitating rapid HGNN inference. Our software-based system, MetaHG, leverages layerwise encoding and aggregation to avoid redundancies without the necessity of semantic graphs. It incorporates a fast, lightweight partitioning method to efficiently manage large graphs. Distinctively, MetaHG seamlessly integrates with both dynamic HGNNs and homogeneous GNNs, unlike conventional systems. Comparative evaluations demonstrate that MetaHG surpasses the state-of-the-art BFS- and DFS-based HGNN systems, MAGNN and the software implementation of MetaNMP, by 42.5× and 4.53×, respectively, on average. © 2025 Copyright held by the owner/author(s).

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Graph-Based Cooperation Multi-Agent Reinforcement Learning for Intelligent Traffic Signal Control

引用

IEEE Internet of Things Journal 2025年第10期12卷 14362-14374页

作者： Shang, Jing Meng, Shunmei Hou, Jun Zhao, Xiaoran Zhou, Xiaokang Jiang, Rong Qi, Lianyong Li, Qianmu Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210049 China Nanjing Vocational University of Industry Technology School of Social Science Nanjing210046 China Qufu Normal University School of Computer Science Qufu273165 China Kansai University Faculty of Business and Data Science Osaka Prefecture 564-8680 Japan Yunnan University of Finance and Economics Yunnan Key Laboratory of Service Computing Kunming650399 China College of Computer Science and Technology Qingdao266580 China

In the trend of continuously advancing urban intelligent transport construction, traditional traffic signal control (TSC) struggles to make effective decisions with complex traffic conditions. Although multi-agent deep reinforcement learning (MARL) shows promise in optimizing traffic flow, most existing studies ignore the complex relationships between signal lights and fail to communicate with neighbors effectively. Moreover, the deterministic strategies generated by Q-learning-based methods struggle to be extended to large-scale urban road networks. Therefore, this paper proposes a multi-agent graph-based soft actor-critic (MAGSAC) approach for TSC, which combines graph neural networks with the Soft Actor-Critic (SAC) algorithm and extends it to multi-agent environments to address the TSC problem. Specifically, we employ graph-based networks and attention mechanism to expand the receptive domain of agents, enable environmental information to be shared among agents, and utilize the attention mechanism to filter out unimportant information. The algorithm adheres to the Centralized Training Decentralized Execution (CTDE) paradigm to minimize the non-stationarity of MARL. Finally, a rigorous experimental evaluation was conducted using the CityFlow simulator on both synthetic traffic grids and real-world urban road networks. Experimental results show that MAGSAC outperforms other TSC methods in performance metrics, including average queue length and waiting time, and achieves excellent performance under complex urban traffic conditions. © 2025 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Final: Combining First-Order Logic With Natural Logic for Question Answering

引用

IEEE Transactions on Knowledge and Data Engineering 2025年第6期37卷 3103-3117页

作者： Shi, Jihao Ding, Xiao Hui, Siu Cheung Yan, Yuxiong Zhao, Hengwei Liu, Ting Qin, Bing Harbin Institute of Technology Research Center for Social Computing and Information Retrieval Harbin150001 China Nanyang Technological University School of Computer Science and Engineering 639798 Singapore

Many question-answering problems can be approached as textual entailment tasks, where the hypotheses are formed by the question and candidate answers, and the premises are derived from an external knowledge base. However, current neural methods often lack transparency in their decision-making processes. Moreover, first-order logic methods, while systematic, struggle to integrate unstructured external knowledge. To address these limitations, we propose a neuro-symbolic reasoning framework called Final, which combines FIrst-order logic with NAtural Logic for question answering. Our framework utilizes first-order logic to systematically decompose hypotheses and natural logic to construct reasoning paths from premises to hypotheses, employing bidirectional reasoning to establish links along the reasoning path. This approach not only enhances interpretability but also effectively integrates unstructured knowledge. Our experiments on three benchmark datasets, namely QASC, WorldTree, and WikiHop, demonstrate that Final outperforms existing methods in commonsense reasoning and reading comprehension tasks, achieving state-of-the-art results. Additionally, our framework also provides transparent reasoning paths that elucidate the rationale behind the correct decisions. © 2025 IEEE.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：