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

Compact Model Build Upon Dynamic Weighting artificial Neural Network Approach for Complementary Field Effect Transistors

引用

IEEE Transactions on Electron Devices 2024年第1期71卷 246-253页

作者： Butola, Rajat Li, Yiming Kola, Sekhar Reddy National Yang Ming Chiao Tung University Parallel and Scientific Computing Laboratory Electrical Engineering and Computer Science International Graduate Program Hsinchu300093 Taiwan Institute of Pioneer Semiconductor Innovation The Institute of Artificial Intelligence Innovation National Yang Ming Chiao Tung University Parallel and Scientific Computing Laboratory Electrical Engineering and Computer Science International Graduate Program The Institute of Communications Engineering the Institute of Biomedical Engineering Department of Electronics and Electrical Engineering Hsinchu300093 Taiwan

In this work, a dynamic weighting-artificial neural network (DW-ANN) methodology is presented for quick and automated compact model (CM) generation. It takes advantage of both TCAD simulations for high accuracy and SPICE simulations for cost-effectiveness. This methodology is developed for gate-all-around (GAA) silicon (Si) nanosheet (NS) complementary field effect transistor (CFET), a potential candidate for future CMOS technology due to its innate properties. The critical process variation (PV) sources that severely degrade the CFET performance are estimated using DW-ANN. It reduces the computation cost and predicts the effects of PV sources with less than 1% error. Furthermore, a compact DW-ANN-based Verilog-A model has been developed that captures the dc as well as transient behavior accurately for circuit-level analysis. CFET-based circuits such as inverter, 6T-static random access memory (SRAM), and ring oscillator (RO) are characterized and implemented using DW-ANN-based CM. The overall average error of the model is reported as less than 2%. Therefore, the proposed device and circuit modeling approach provides a feasible solution for the rapid compact modeling of new emerging devices with good convergence and high accuracy. © 1963-2012 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

A Web Service Recommendation Method Based on Adaptive Gate Network and xDeepFM 1

引用

22nd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2022

作者： Tao, Zhi Cao, Buqing Ye, Hongfan Kang, Guosheng Peng, Zhenlian Wen, Yiping School of Computer Science and Engineering and Hunan Key Laboratory of Service Computing and New Software Service Technology Hunan University of Science and Technology Hunan Xiangtan China School of Computer and Artificial Intelligence Huaihua University Huaihua China

ISBN: (数字)9783031226779

ISBN: (纸本)9783031226762

With the rapid development of service computing technology, more and more companies and organizations are encapsulating and publishing their operational data or resources to the Internet in the form of Web services, resulting in an exponential increase in the number of Web services. To automatically generate or recommend a group of Web services according to the user's natural language requirements description, to build a Mashup application to meet the user's requirement is a hot topic in service computing. Some researchers enhance the quality of Web service recommendation by using auxiliary information into the recommendation system. However, they mainly focus on adding external information (e.g., pre-training of external corpora) to enhance semantic features, while some internal statistical features of the corpus such as word distribution on labels and frequency are not fully exploited. Compared to other exterior knowledge, statistical features are naturally compatible with Web service recommendation tasks. To fully exploit the statistical features, this paper proposes a Web service recommendation method based on adaptive gate network and xDeepFM model. In this method, firstly, the description document of Web services is taken as the basic corpus, the semantic and statistical information in the corpus are mined by utilizing the adaptive gate network, and the statistical features are encoded by a variational encoder. Secondly, the similarity between Web services is derived from the semantic features, at the same time the popularity and co-occurrence of Web services are calculated. Thirdly, the xDeepFM model is used to mine the explicit and implicit higher-order interactions in the sparse matrix which consists of the above information to recommend Web services for Mashup application. Finally, a multiple sets of experiments based on the dataset crawled from the ProgrammableWeb have been conducted to evaluate the proposed method and the experimental result shows that t

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

DRSC: Dual-Reweighted Siamese Contrastive Learning Network for Cross-Domain Rotating Machinery Fault Diagnosis With Multi-Source Domain Imbalanced Data

引用

IEEE Internet of Things Journal 2025年第13期12卷 23678-23693页

作者： Bi, Yuanguo Fu, Rao Jiang, Cunyu Zhang, Xiaoling Li, Fengyun Zhao, Liang Han, Guangjie Northeastern University School of Computer Science and Engineering Shenyang110169 China Ministry of Education Engineering Research Center of Security Technology of Complex Network System Shenyang110169 China Shenyang University of Technology Institute of Artificial Intelligence Shenyang110870 China Shenyang Aerospace University School of Computer Science Shenyang110135 China Hohai University Key Laboratory of Maritime Intelligent Network Information Technology Ministry of Education China

To enhance the reliability of rotating machinery, cross-domain fault diagnosis becomes vital for detecting faults under unknown operating conditions. However, multi-source domain imbalanced data present significant challenges, as divergent label distributions across domains cause complex domain-class shifts and degrade the performance of cross-domain fault diagnosis. Moreover, diagnostic models often struggle to learn features from minority classes due to label imbalance within each domain, which may degrade the performance in diagnosing these minority classes. To address these challenges, we propose a Dual-Reweighted Siamese Contrastive learning network (DRSC) for cross-domain fault diagnosis with multi-source domain imbalanced data. In DRSC, we design a Siamese feature extractor based on a wide-kernel convolutional neural network to capture short-term characteristics and leverage the convenience in extracting domain-invariant features. Subsequently, to alleviate domain-class shifts, we design a reweighted contrastive domain-class alignment mechanism that strategically pulls domain-class pairs together while pushing other health conditions away. Finally, to enable the diagnostic model to learn from minority health conditions, a reweighted health condition classifier is developed by assigning higher weights to the minority classes. Evaluation results on two public datasets illustrate DRSC outperforms comparison models in cross-domain fault diagnosis. © 2014 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Effective High-order Graph Representation Learning for Credit Card Fraud Detection

arXiv

引用

arXiv 2025年

作者： Zou, Yao Cheng, Dawei Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Artificial Intelligence Ministry of Education Shanghai China Shanghai Artificial Intelligence Laboratory Shanghai China

Credit card fraud imposes significant costs on both cardholders and issuing banks. Fraudsters often disguise their crimes, such as using legitimate transactions through several benign users to bypass anti-fraud detection. Existing graph neural network (GNN) models struggle with learning features of camouflaged, indirect multi-hop transactions due to their inherent over-smoothing issues in deep multi-layer aggregation, presenting a major challenge in detecting disguised relationships. Therefore, in this paper, we propose a novel High-order Graph Representation Learning model (HOGRL) to avoid incorporating excessive noise during the multi-layer aggregation process. In particular, HOGRL learns different orders of pure representations directly from high-order transaction graphs. We realize this goal by effectively constructing high-order transaction graphs first and then learning the pure representations of each order so that the model could identify fraudsters’ multi-hop indirect transactions via multi-layer pure feature learning. In addition, we introduce a mixture-of-expert attention mechanism to automatically determine the importance of different orders for jointly optimizing fraud detection performance. We conduct extensive experiments in both the open source and real-world datasets, the result demonstrates the significant improvements of our proposed HOGRL compared with state-ofthe-art fraud detection baselines. HOGRL’s superior performance also proves its effectiveness in addressing high-order fraud camouflage *** Codes 68T07, 91B06 © 2025, CC BY-NC-SA.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic Diffusion Recommender Model 25

Hyperbolic Diffusion Recommender Model

引用

34th ACM Web Conference, WWW 2025

作者： Yuan, Meng Xiao, Yutian Chen, Wei Zhao, Chu Wang, Deqing Zhuang, Fuzhen Institute of Artificial Intelligence Beihang University Beijing China Chongqing University of Technology Chongqing China School of Computer Science and Engineering Beihang University Beijing China Zhongguancun Laboratory Beijing China

ISBN: (纸本)9798400712746

Diffusion models (DMs) have emerged as the new state-of-the-art family of deep generative models. To gain deeper insights into the limitations of diffusion models in recommender systems, we investigate the fundamental structural disparities between images and items. Consequently, items often exhibit distinct anisotropic and directional structures that are less prevalent in images. However, the traditional forward diffusion process continuously adds isotropic Gaussian noise, causing anisotropic signals to degrade into noise, which impairs the semantically meaningful representations in recommender systems. Inspired by the advancements in hyperbolic spaces, we propose a novel Hyperbolic Diffusion Recommender Model (named HDRM). Unlike existing directional diffusion methods based on Euclidean space, the intrinsic non-Euclidean structure of hyperbolic space makes it particularly well-adapted for handling anisotropic diffusion processes. In particular, we begin by constructing a geometrically latent space grounded in hyperbolic geometry, incorporating interpretability measures to define the latent anisotropic diffusion processes. Subsequently, we propose a novel hyperbolic latent diffusion process specifically tailored for users and items. Drawing upon the natural geometric attributes of hyperbolic spaces, we restrict both radial and angular components to facilitate directional diffusion propagation, thereby ensuring the preservation of the original topological structure in user-item interaction graphs. Extensive experiments on three benchmark datasets demonstrate the effectiveness of HDRM. © 2025 Copyright held by the owner/author(s).

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Optimal Control of Connected Automated Vehicles with Event-Triggered Control Barrier Functions: a Test Bed for Safe Optimal Merging

Optimal Control of Connected Automated Vehicles with Event-T...

引用

2023 IEEE Conference on Control Technology and Applications, CCTA 2023

作者： Sabouni, Ehsan Ahmad, H.M. Sabbir Xiao, Wei Cassandras, Christos G. Li, Wenchao Boston University Division of Systems Engineering Department of Electrical & Computer Engineering BostonMA United States Massachusetts Institute of Technology Computer Science & Artificial Intelligence Laboratory CambridgeMA United States

ISBN: (纸本)9798350335446

We address the problem of safely coordinating a network of Connected and Automated Vehicles (CAVs) in conflict areas of a traffic network. Such problems can be solved through a combination of tractable optimal control problems and Control Barrier Functions (CBFs) that guarantee the satisfaction of all constraints. These solutions can be reduced to a sequence of Quadratic Programs (QPs) which are efficiently solved online over discrete time steps. However, guaranteeing the feasibility of the CBF-based QP method within each discretized time interval requires the careful selection of time steps which need to be sufficiently small. This creates computational requirements and communication rates between agents which may limit the controller's application to real CAVs. We tackle this limitation by adopting an event-triggered control approach for CAVs such that the next QP is triggered by properly defined events with a safety guarantee. We present a laboratory-scale test bed developed to emulate merging roadways using mobile robots as CAVs. We present results to demonstrate how the event-triggered scheme is computationally efficient and can handle measurement uncertainties and noise compared to time-driven control while guaranteeing safety. © 2023 IEEE.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Computing Approximate Centerpoints in Polynomial Time

Computing Approximate Centerpoints in Polynomial Time

引用

Annual IEEE Symposium on Foundations of computer science

作者： Yeshwanth Cherapanamjeri Computer Science and Artificial Intelligence Laboratory (CSAIL) Massachusetts Institute of Technology Cambridge USA

ISBN: (数字)9798331516741

ISBN: (纸本)9798331516758

The centerpoint is arguably the most natural generalization of the median to higher dimensions. Intuitively, a centerpoint of a point set is such that any hyperplane passing through the point results in an approximately balanced partition of the point set. Helly's theorem guarantees the existence of a point with depth $\Omega(1/d)$ which is also known to be the best possible. On the other hand, polynomial time algorithms for approximating centerpoints only guarantee a point with depth $\Omega(1/d^{2})$ , established nearly three decades ago. Unfortunately, even the simpler problem of testing whether a candidate point is a centerpoint is hard. In this paper, we present a novel notion of approximation along with a new algorithmic approach that enables efficient computation of a $\Omega(1/d)-\mathbf{depth}$ point. Our main result is a randomized algorithm that computes an $\varepsilon -\mathbf{approximate}$ centerpoint of depth $\Omega(1/d)$ ; that is, the point returned by the algorithm is at most $\varepsilon$ away from the halfspaces characterizing points of depth at least $\Omega(1/d)$ along any direction. Furthermore, the runtime of our algorithm is polynomial in $n, d, 1/\varepsilon, \log(1/\delta)$ where $\delta$ denotes the failure probability of the algorithm. Our approach is based on a reduction to the smoothed setting where each point is is given an independent Gaussian perturbation of scale $\varepsilon$ . In contrast to prior work, our algorithm is based on techniques from continuous optimization and leverages a novel connection between the problem of testing an approximate centerpoint and the Radial Isotropic Transformation, a central tool with diverse applications in mathematics and computer science. We show that the solution to this testing problem yields an approximate separation oracle for the set of large depth points, enabling its use in a gradient-descent style approach to compute centerpoints.

关键词： computer science Runtime Perturbation methods Approximation algorithms Polynomials Partitioning algorithms Computational efficiency Optimization Testing

来源：评论

学校读者我要写书评

暂无评论

R-DTI: Drug Target Interaction Prediction Based on Second-Order Relevance Exploration 39

R-DTI: Drug Target Interaction Prediction Based on Second-Or...

引用

39th Annual AAAI Conference on artificial intelligence, AAAI 2025

作者： Hua, Yang Xu, Tianyang Song, Xiaoning Feng, Zhenhua Wang, Rui Zhang, Wenjie Wu, Xiaojun School of Artifcial Intelligence and Computer Science Jiangnan University Jiangsu Wuxi China Sino-UK Joint Laboratory on Artificial Intelligence Ministry of Science and Technology China International Joint Laboratory on Artificial Intelligence Ministry of Education China

ISBN: (纸本)157735897X

Drug Target Interaction (DTI) prediction has witnessed promising performance boosts accompanied by advanced multimodal feature extraction. However, existing approaches suffer from two main difficulties. First, the complex protein structures cannot be well represented by current protein-sequence-based feature extractors. Second, the gap between protein and drug features increases the vulnerability of the obtained classifier thus degrading the prediction robustness. To address these issues, we propose a novel R-DTI method by exploring the second-order relevance in both protein structural feature extraction and DTI prediction phases. Specifically, we construct a pre-trained structural feature extractor that mines the atomic relevance of each amino acid. Then, an inter-feature structure-preserved Riemannian network is designed to expand the existing protein extraction patterns. To improve the prediction robustness, we also develop a Riemannian classifier that uses the second-order protein-drug relevance with a unified feature space. Extensive experimental results prove the merits and superiority of our R-DTI against the state-of-the-art, achieving 1.4% and 1.9% higher AUC-ROC on the BindingDB and DrugBank datasets, respectively. Copyright © 2025, Association for the Advancement of artificial intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Linear alignment: a closed-form solution for aligning human preferences without tuning and feedback 24

Linear alignment: a closed-form solution for aligning human ...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Songyang Gao Qiming Ge Wei Shen Shihan Dou Junjie Ye Xiao Wang Rui Zheng Yicheng Zou Zhi Chen Hang Yan Qi Zhang Dahua Lin Shanghai Artificial Intelligence Laboratory School of Computer Science Fudan University ByteDance Inc

The success of AI assistants based on Language Models (LLMs) hinges on Reinforcement Learning from Human Feedback (RLHF) to comprehend and align with user intentions. However, traditional alignment algorithms, such as PPO, are hampered by complex annotation and training requirements. This reliance limits the applicability of RLHF and hinders the development of professional assistants tailored to diverse human preferences. In this work, we introduce Linear Alignment, a novel algorithm that aligns language models with human preferences in one single inference step, eliminating the reliance on data annotation and model training. Linear alignment incorporates a new parameterization for policy optimization under divergence constraints, which enables the extraction of optimal policy in a closed-form manner and facilitates the direct estimation of the aligned response. Extensive experiments on both general and personalized preference datasets demonstrate that linear alignment significantly enhances the performance and efficiency of LLM alignment across diverse scenarios. Our code and dataset is published on https://***/Wizardcoast/Linear_***.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Knowledge Graph Augmented Network Towards Multiview Representation Learning for Aspect-Based Sentiment Analysis

引用

IEEE Transactions on Knowledge and Data Engineering 2023年第10期35卷 10098-10111页

作者： Zhong, Qihuang Ding, Liang Liu, Juhua Du, Bo Jin, Hua Tao, Dacheng Wuhan University National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence School of Computer Science Hubei Key Laboratory of Multimedia and Network Communication Engineering Hubei Wuhan430072 China Jd Explore Academy at *** Beijing100101 China Wuhan University Research Center for Graphic Communication Printing and Packaging Institute of Artificial Intelligence Hubei Wuhan430072 China Hospital of Kunming University of Science and Technology Kunming650032 China

Aspect-based sentiment analysis (ABSA) is a fine-grained task of sentiment analysis. To better comprehend long complicated sentences and obtain accurate aspect-specific information, linguistic and commonsense knowledge are generally required in this task. However, most current methods employ complicated and inefficient approaches to incorporate external knowledge, e.g., directly searching the graph nodes. Additionally, the complementarity between external knowledge and linguistic information has not been thoroughly studied. To this end, we propose a knowledge graph augmented network (KGAN), which aims to effectively incorporate external knowledge with explicitly syntactic and contextual information. In particular, KGAN captures the sentiment feature representations from multiple different perspectives, i.e., context-, syntax- and knowledge-based. First, KGAN learns the contextual and syntactic representations in parallel to fully extract the semantic features. Then, KGAN integrates the knowledge graphs into the embedding space, based on which the aspect-specific knowledge representations are further obtained via an attention mechanism. Last, we propose a hierarchical fusion module to complement these multi-view representations in a local-to-global manner. Extensive experiments on five popular ABSA benchmarks demonstrate the effectiveness and robustness of our KGAN. Notably, with the help of the pretrained model of RoBERTa, KGAN achieves a new record of state-of-the-art performance among all datasets. © 1989-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：