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

Design Automation Conference

作者： Aidong Zhao Xianan Wang Zixiao Lin Zhaori Bi Xudong Li Changhao Yan Fan Yang Li Shang Dian Zhou Xuan Zeng Microelectronics Department State Key Laboratory of Integrated Chips and Systems Fudan University Shanghai China Department of Electrical Engineering University of Texas Dallas USA Department of Electrical and Computer Engineering University of California San Diego USA School of Data Science Fudan University Shanghai China School of Computer Science Fudan University Shanghai China

A constrained Voronoi tree-based domain decomposition method for high-dimensional Bayesian optimization is proposed to solve large scale analog circuit synthesis problems, which can be formulated as high-dimensional heterogeneous black-box optimization. Hierarchical Voronoi tree progressively breaks down the design space into partitions with implicit performance boundaries such that promising regions are efficiently explored. Fast exploitation is ensured in Voronoi nest via local Bayesian optimization with a few observations. A slice-enhanced Gibbs sampling method is proposed to sample acquisition function cMES in irregular polyhedrons with design constraints. Compared with state-of-the-art methods, cVTS achieves significant speed up without loss of accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A transactional-behavior-based hierarchical gated network for credit card fraud detection

引用

IEEE/CAA Journal of Automatica Sinica 2025年

作者： Xie, Yu Zhou, MengChu Liu, Guanjun Wei, Lifei Zhu, Honghao De Meo, Pasquale College of Information Engineering Shanghai Maritime University Shanghai201306 China School of Information and Electronic Engineering Zhejiang Gongshang University Hangzhou310018 China Helen and John C. Hartmann Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102 United States Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Computer Science Tongji University Shanghai201804 China College of Computer Science and Information Engineering Bengbu University Bengbu233030 China Department of Ancient and Modern Civilizations University of Messina Messina98166 Italy

The task of detecting fraud in credit card transactions is crucial to ensure the security and stability of a financial system, as well as to enforce customer confidence in digital payment systems. Historically, credit card companies have used rule-based approaches to detect fraudulent transactions, but these have proven inadequate due to the complexity of fraud strategies and have been replaced by much more powerful solutions based on machine learning or deep learning algorithms. Despite significant progress, the current approaches to fraud detection suffer from a number of limitations: for example, it is unclear whether some transaction features are more effective than others in discriminating fraudulent transactions, and they often neglect possible correlations among transactions, even though they could reveal illicit behaviour. In this paper, we propose a novel credit card fraud detection (CCFD) method based on a transaction behaviour-based hierarchical gated network. First, we introduce a feature-oriented extraction module capable of identifying key features from original transactions, and such analysis is effective in revealing the behavioural characteristics of fraudsters. Second, we design a transaction-oriented extraction module capable of capturing the correlation between users' historical and current transactional behaviour. Such information is crucial for revealing users' sequential behaviour patterns. Our approach, called transactional-behaviour-based hierarchical gated network model (TbHGN), extracts two types of new transactional features, which are then combined in a feature interaction module to learn the final transactional representations used for CCFD. We have conducted extensive experiments on a real-world credit card transaction dataset with an increase in average F1 between 1.42% and 6.53% and an improvement in average AUC between 0.63% and 2.78% over the state of the art. © 2025 Institute of Electrical and Electronics Engineers Inc.. All right

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

End-to-End Streaming Customizable keyword Spotting Based on Text-Adaptive Neural Search 1

引用

18th National Conference on Man-Machine Speech Communication, NCMMSC 2023

作者： Yang, Baochen Guo, Jiaqi Li, Haoyu Xi, Yu Zhuo, Qing Yu, Kai X-LANCE Lab Department of Computer Science and Engineering MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Shanghai China State Key Laboratory of Media Convergence Production Technology and Systems Beijing China AISpeech Ltd. Suzhou China Department of Automation Tsinghua University Beijing China

ISBN: (数字)9789819706013

ISBN: (纸本)9789819706006

Streaming keyword spotting (KWS) is an important technique for voice assistant wake-up. While KWS with a preset fixed keyword has been well studied, test-time customizable keyword spotting in streaming mode remains a great challenge due to the lack of pre-collected keyword-specific training data and the requirement of streaming detection output. In this paper, we propose a novel end-to-end text-adaptive neural search architecture with a multi-label trigger mechanism to allow any pre-trained ASR acoustic model to be effectively used for fast streaming customizable keyword spotting. Evaluation results on various datasets show that our approach significantly outperforms both traditional post-processing baseline and the neural search baseline, meanwhile achieving a 44x search speedup compared to the traditional post-processing method. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Customizable keyword keyword spotting Streaming Text-adaptive search

来源：评论

学校读者我要写书评

暂无评论

Two-stream Hierarchical Similarity Reasoning for Image-text Matching

arXiv

引用

arXiv 2022年

作者： Chen, Ran Wang, Hanli Wang, Lei Kwong, Sam The Department of Computer Science & Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai200092 China Frontiers Science Center for Intelligent Autonomous Systems Shanghai201210 China DeepBlue Academy of Sciences Shanghai200336 China The Department of Computer Science City University of Hong Kong Hong Kong

Reasoning-based approaches have demonstrated their powerful ability for the task of image-text matching. In this work, two issues are addressed for image-text matching. First, for reasoning processing, conventional approaches have no ability to find and use multi-level hierarchical similarity information. To solve this problem, a hierarchical similarity reasoning module is proposed to automatically extract context information, which is then co-exploited with local interaction information for efficient reasoning. Second, previous approaches only consider learning single-stream similarity alignment (i.e., image-to-text level or text-to-image level), which is inadequate to fully use similarity information for image-text matching. To address this issue, a two-stream architecture is developed to decompose image-text matching into image-to-text level and text-to-image level similarity computation. These two issues are investigated by a unifying framework that is trained in an end-to-end manner, namely two-stream hierarchical similarity reasoning network. The extensive experiments performed on the two benchmark datasets of MSCOCO and Flickr30K show the superiority of the proposed approach as compared to existing state-of-the-art methods. Copyright © 2022, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Heuristic Elastic Scaling for Kubernetes Heterogeneous Microservices

Heuristic Elastic Scaling for Kubernetes Heterogeneous Micro...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Song Wang Sheng He Yishuang Ning Xiang Gao Zhijun Ding Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Tongji University Shanghai China Kingdee Research Kingdee International Software Group Co. Ltd Shenzhen China Intelligent Computing Facility Innovation Center ZhejiangLab Hangzhou China

ISBN: (数字)9798350365221

ISBN: (纸本)9798350365238

Kubernetes has become the basic platform for building cloud native applications. However, existing horizontal scaling methods based on Kubernetes have problems with resource redundancy. Furthermore, the combined horizontal and vertical scaling based on Kubernetes takes a long time. Regarding the issue above, first, we describe the execution processes of three scaling techniques and compare them in different dimensions; second, we construct a formal elastic scaling model for expansion scenarios, with the goal of minimizing the total cost; and third, we introduce a heuristic expansion algorithm after balancing resource redundancy and execution time as the heuristic information. The experiment results show that the elastic scaling algorithm proposed in this paper achieves better performance than other algorithms.

关键词： Costs Heuristic algorithms Redundancy Buildings Microservice architectures Sensors

来源：评论

学校读者我要写书评

暂无评论

Abstraction-Based Synthesis of Controllers for Approximate Opacity

Abstraction-Based Synthesis of Controllers for Approximate O...

引用

IEEE Conference on Decision and Control

作者： Junyao Hou Siyuan Liu Xiang Yin Majid Zamani Department of Automation Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai China Division of Decision and Control Systems KTH Royal Institute of Technology Stockholm Sweden Department of Computer Science University of Colorado Boulder CO USA Department of Computer Science LMU Munich Munich Germany

Opacity is an important information-flow security property which characterizes the plausible deniability of certain “secret behaviors” in dynamical systems. In this paper, we study the problem of synthesizing controllers enforcing a notion of opacity over discrete-time control systems with continuous state sets. In this paper, we develop an abstraction-based approach to tackle the controller synthesis problem. Specifically, we adopt a notion of approximate opacity which is suitable for continuous-space control systems. We propose a notion of approximate initial-state opacity preserving alternating simulation relation which characterizes the closeness between two systems in terms of opacity preservation. We show that, based on this new notion of system relation, one can synthesize an opacity-enforcing controller for the abstract system which is finite and then refine it back to enforce opacity over the original control system. Finally, we present a method for constructing opacity-preserving finite abstractions for discrete-time control systems under some stability properties. Our results are illustrated on a two-room temperature control problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Family of Mutually Uncorrelated Codes for DNA Storage Address Design

IEEE Transactions on Nanobioscience

引用

IEEE Transactions on Nanobioscience 2025年 PP卷 PP页

作者： Liu, Zhenlu Cao, Ben Shao, Qi Zheng, Yanfen Wang, Bin Zhou, Shihua Zheng, Pan Dalian University Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian116622 China Dalian University of Technology School of Computer Science and Technology Dalian116024 China University of Canterbury Upper Riccarton Department of Accounting and Information Systems Christchurch8140 New Zealand

Deoxyribonucleic acid (DNA) has become an ideal medium for long-term storage and retrieval due to its extremely high storage density and long-term stability. But access efficiency is an existing bottleneck in DNA storage, especially the lack of high-quality random access address sequences. Therefore, in this paper, we report a series of approaches based on k-weakly mutually uncorrelated (k-WMU) codes to design the address sequence to improve the access efficiency of DNA storage. To address the problem of DNA sequences that are poorly scalable at the base level, we propose a 0-m-ruling coding scheme combined with k-WMU codes that can make address sequences avoid generating secondary structure with stem lengths ranging from 3 to 9. Based on the decoupled structure, We further extend the k-WMU codes with error correction function while satisfying combinatorial biological constraints. In order to investigate the performance of the designed address sequences for real-world applications, we perform simulation experiments based on thermodynamic properties and error correction capability as well as compared the minimum free energy (MFE), melting temperature (TM), and average decoding success rate (ADSR) with previous work. The results show that designed address sequences have a high MFE value and ADSR and a substantial reduction in TM-variance while satisfying the combinatorial biological constraints. As the quality of address sequences improves, this will help to achieve accurate random access as well as enhance the robustness of the DNA storage system. © 2002-2011 IEEE.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

Five infinite families of binary cyclic codes and their related codes with good parameters

arXiv

引用

arXiv 2023年

作者： Liu, Hai Li, Chengju Ding, Cunsheng The Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai200062 China The National Mobile Communications Research Laboratory Southeast University Nanjing210096 China The Department of Computer Science and Engineering The Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7842-7849, 2022, the objectives of this paper are the construction and analyses of five infinite families of binary cyclic codes with parameters [n, k] and (n−6)/3 ≤ k ≤ 2(n+6)/3. Three of the five families of binary cyclic codes and their duals have a very good lower bound on their minimum distances and contain distance-optimal codes. The other two families of binary cyclic codes are composed of binary duadic codes with a square-root-like lower bound on their minimum distances. As a by-product, two infinite families of self-dual binary codes with a square-root-like lower bound on their minimum distances are obtained. Copyright © 2023, The Authors. All rights reserved.

关键词： Binary codes

来源：评论

学校读者我要写书评

暂无评论

Neural Network-Based Safety Optimization Control for Constrained Discrete-Time systems

Neural Network-Based Safety Optimization Control for Constra...

引用

Annual Conference of Industrial Electronics Society

作者： Xueli Wang Shangwei Zhao Ming Yang Xiaoming Wu Xin Wang Shuo Xu Xu Hu Key Laboratory of Computing Power Network and Information Security Shandong Computer Science Center Qilu University of Technology Jinan China Department of Automation Shanghai Jiao Tong University Shanghai China Public Security Bureau of Jinan Jinan China

This paper proposes a constraint-aware safety control approach via adaptive dynamic programming (ADP) to address the control optimization issues for discrete-time systems subjected to state constraints. First, the constrained control framework is established via the primal-dual approach with the modified Lagrangian based on the relaxed barrier function. Herein, the Lagrangian multiplier is designed to achieve the trade-off between optimization performance and state constraints. In addition, the sub optimality of the dual method is built by proving that the dual gap can be arbitrarily small. And the value iteration algorithm is utilized to implement the constraint-aware ADP controller. Furthermore, the weight estimation error is proved to be bounded when the learning rate satisfies a given sufficient condition. Finally, numerical simulation proves the effectiveness and superiority of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Vehicle Check-In Data-driven POI Recommendation Based on Improved SVD and Graph Convolutional Network 19

Vehicle Check-In Data-driven POI Recommendation Based on Imp...

引用

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on scalable computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： Liu, Yuwen Zhang, Jie Dou, Ruihan Zhou, Xiaokang Xu, Xiaolong Wang, Shoujin Qi, Lianyong College of Computer Science and Technology Qingdao China Nanjing University State Key Laboratory for Novel Software Technology Department of Computer Science and Technology China Shanghai Meteorological Information and Technology Support Center China University of Waterloo Faculty of Mathematics Waterloo Canada Shiga University Faculty of Data Science Japan Riken Center for Advanced Intelligence Project Riken Japan Nanjing University of Information Science and Technology School of Computer and Software China Macquarie University School of Computing Australia Qufu Normal University School of Computer Science China

ISBN: (纸本)9798350346558

The application of automobile tool software is becoming increasingly widespread, and its functions are becoming increasingly diverse. Using vehicle traffic data to give users with recommendations for Points-of-interest (POI) is becoming an intriguing research challenge. However, the current POI recommendation is either a sequence-based method, ignoring the interaction information between users and POIs. Or it needs a lot of model training time to use graph correlation method to mine the interaction between users or vehicles and POIs. In order to address these issues, we propose a method for vehicle check-in data-driven POI recommendation based on improved Singular Value Decomposition (SVD) and Graph Convolutional Network (GCN). First, we apply SVD to replace the neighborhood aggregation update method in traditional GCN, update the node embedding with fewer parameters and faster speed. Second, we propose an information enhancement strategy to make up for the information loss caused by the SVD. Experiments on large vehicle check-in datasets demonstrate that our method is both faster and more effective when making POI recommendations. © 2022 IEEE.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：