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

Biometrics 2.0 for the Security of Smart Cities

Machine Intelligence Research 2024年第6期21卷 1121-1144页

作者： Wei Jia Zhecheng Zhang Yang Zhao Hai Min Shujie Li School of Computer Science and Information Engineering Hefei University of TechnologyHefei230009China

In modern society,an increasing number of occasions need to effectively verify people's *** is the most ef-fective technology for personal *** research on automated biometrics recognition mainly started in the 1960s and *** the following 50 years,the research and application of biometrics have achieved fruitful *** 2014-2015,with the successful applications of some emerging information technologies and tools,such as deep learning,cloud computing,big data,mobile communication,smartphones,location-based services,blockchain,new sensing technology,the Internet of Things and federated learning,biometric technology entered a new development ***,taking 2014-2015 as the time boundary,the development of biometric technology can be divided into two *** addition,according to our knowledge and understanding of biometrics,we fur-ther divide the development of biometric technology into three phases,i.e.,biometrics 1.0,2.0 and *** 1.0 is the primary de-velopment phase,or the traditional development *** 2.0 is an explosive development phase due to the breakthroughs caused by some emerging information *** present,we are in the development phase of biometrics *** 3.0 is the future development phase of *** the biometrics 3.0 phase,biometric technology will be fully mature and can meet the needs of various *** 1.0 is the initial phase of the development of biometric technology,while biometrics 2.0 is the advanced *** this paper,we provide a brief review of biometrics ***,the concept of biometrics 2.0 is defined,and the architecture of biometrics 2.0 is *** particular,the application architecture of biometrics 2.0 in smart cities is *** challenges and perspectives of biometrics 2.0 are also discussed.

关键词： Biometrics smart city security application architecture

来源：评论

学校读者我要写书评

暂无评论

Deep hash networks with cross-scale feature fusion for optimal binary encoding

引用

Journal of Intelligent and Fuzzy Systems 2024年第5-6期47卷 411-426页

作者： Li, Jie Hong, Chaoqun Huang, Pengcheng Wang, Xiaodong Ran, Lang School of Computer and Information Engineering Xiamen University of Technology Xiamen China

Deep Hashing is a technique used for retrieving images on a large-scale, encoding the latent code of images into binary codes, which significantly reduces computational and storage costs in image retrieval. This enables fast similarity comparison and search. However, this technique encounters two significant challenges: the extraction of discriminating category-specific image features and the conflict between metric learning and quantization learning. The latter challenge often results in the binary representation of latent codes being considerably ambiguous. To tackle these challenges, this paper proposes a novel Cross-Scale Fusion Deep Hash Network. The model is built upon a dual-branch framework, aiming to capture the most representative retrieval features. One branch employs Spatial Pyramid Pooling layers and a self-attention mechanism for local information extraction, whereas the other branch uses a sliding window methodology for capturing global information. Upon obtaining the local and global information, the Cross Feature Synergy Module proposed in this paper integrates these data points to form a comprehensive feature vector, ultimately generating a complete representation of the image. In order to address the conflict between metric learning and quantization learning, as well as improve the binary codes further, this paper introduces a meticulously designed, threshold-dependent Hash-Guided Metric Loss (HGM-Loss). The novel network proposed in this paper demonstrates superior retrieval performance in standard benchmark tests on multiple datasets, including CIFAR-10, CIFAR-100, ImageNet, and MS-COCO, outperforming the existing hash methods. © 2024 - IOS Press. All rights reserved.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Deep learning-based open API recommendation for Mashup development

引用

Science China(information Sciences) 2023年第7期66卷 94-111页

作者： Ye WANG Junwu CHEN Qiao HUANG Xin XIA Bo JIANG School of Computer and Information Engineering Zhejiang Gongshang University Software Engineering Application Technology Lab

Mashup developers often need to find open application programming interfaces(APIs) for their composition application development. Although most enterprises and service organizations have encapsulated their businesses or resources online as open APIs, finding the right high-quality open APIs is not an easy task from a library with several open APIs. To solve this problem, this paper proposes a deep learning-based open API recommendation(DLOAR) approach. First, the hierarchical density-based spatial clustering of applications with a noise topic model is constructed to build topic models for Mashup clusters. Second,developers' requirement keywords are extracted by the Text Rank algorithm, and the language model is built. Third, a neural network-based three-level similarity calculation is performed to find the most relevant open APIs. Finally, we complement the relevant information of open APIs in the recommended list to help developers make better choices. We evaluate the DLOAR approach on a real dataset and compare it with commonly used open API recommendation approaches: term frequency-inverse document frequency, latent dirichlet allocation, Word2Vec, and Sentence-BERT. The results show that the DLOAR approach has better performance than the other approaches in terms of precision, recall, F1-measure, mean average precision,and mean reciprocal rank.

关键词： Mashup development open API recommendation deep learning neural network service discovery

来源：评论

学校读者我要写书评

暂无评论

QARF: A Novel Malicious Traffic Detection Approach via Online Active Learning for Evolving Traffic Streams

引用

Chinese Journal of Electronics 2024年第3期33卷 645-656页

作者： Zequn NIU Jingfeng XUE Yong WANG Tianwei LEI Weijie HAN Xianwei GAO School of Computer Science and Technology Beijing Institute of Technology School of Space Information Space Engineering University

In practical abnormal traffic detection scenarios,traffic often appears as drift,imbalanced and rare labeled streams,and how to effectively identify malicious traffic in such complex situations has become a challenge for malicious traffic *** have extensive studies on malicious traffic detection with single challenge,but the detection of complex traffic has not been widely *** adaptive random forests(QARF) is proposed to detect traffic streams with concept drift,imbalance and lack of labeled *** is an online active learning based approach which combines adaptive random forests method and adaptive margin sampling *** achieves querying a small number of instances from unlabeled traffic streams to obtain effective *** conduct experiments using the NSL-KDD dataset to evaluate the performance of *** is compared with other state-of-the-art *** experimental results show that QARF obtains 98.20% accuracy on the NSL-KDD *** performs better than other state-of-the-art methods in comparisons.

关键词： Active learning Online learning Malicious traffic Concept drift Data imbalance

来源：评论

学校读者我要写书评

暂无评论

Knowledge-aware Recommendation with Attention Mechanism and Contrastive Learning

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer Science 2025年第3期52卷 615-624页

作者： Chen, Cuihong Sun, Gang School of Information Engineering Anhui Business And Technology College Hefei China School of Computer and Information Engineering Fuyang Normal University Fuyang China

Knowledge graph (KG) is important in recommendation algorithms. For the past few years, graph neural networks (GNNs) models applied to knowledge-aware recommendation (KGR) have been a current research hotspot. However, GNN-based KGR models have some problems, eg. data sparsity, insufficient supervision indication, unbalanced information utilization, and insufficient knowledge extraction. This paper presents a knowledge-aware recommendation algorithm that integrates an attention mechanism with contrastive learning, thereby make the most of the rich entity information available in the KG. Through contrastive learning, the algorithm aims to derive more discriminative expressions for users and items, and the attention mechanism helps to identify key relationships between them. This dual way improves the accuracy and efficiency of recommendations. Firstly, by contrasting hierarchical structures within the KG, non-local graphs are constructed for users and items, facilitating the extraction of additional KG facts in KGR. Secondly, Intra-graph-level interactive contrastive learning is enforced within both non-local graphs to evaluate the levels of collaborative filtering alongside the KG part, so as to obtain more consistent information utilization. In addition, inter-graph-level interactive contrastive learning is implemented between non-local graphs to fully and effectively extract non-local KG indication. Finally, the attention mechanism is integrated to determine the consequence of node neighbors and adaptively propagate the embeddings from the neighbors of nodes. The proposed knowledge-aware recommendation algorithm (KGAC) in this paper, along with other recommendation algorithms, has been subjected to extensive experimentation across three benchmark data sets. The results of these tests confirm that KGAC outperforms other algorithms in terms of recommendation performance. © (2025), (International Association of Engineers). All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Fast Algorithm for Computing the Deficiency Number of a Mahjong Hand

引用

Chinese Journal of Electronics 2024年第6期33卷 1383-1398页

作者： Xueqing YAN Yongming LI Sanjiang LI School of Computer Science Shaanxi Normal University School of Mathematics and Statistics Shaanxi Normal University Centre for Quantum Software and Information Faculty of Engineering and Information TechnologyUniversity of Technology Sydney

The tile-based multiplayer game Mahjong is widely played in Asia and has also become increasingly popular worldwide. Face-to-face or online, each player begins with a hand of 13 tiles and players draw and discard tiles in turn until they complete a winning hand. An important notion in Mahjong is the deficiency number(*** number in Japanese Mahjong) of a hand, which estimates how many tile changes are necessary to complete the hand into a winning hand. The deficiency number plays an essential role in major decision-making tasks such as selecting a tile to discard. This paper proposes a fast algorithm for computing the deficiency number of a Mahjong hand. Compared with the baseline algorithm, the new algorithm is usually 100 times faster and, more importantly,respects the agent's knowledge about available tiles. The algorithm can be used as a basic procedure in all Mahjong variants by both rule-based and machine learning-based Mahjong AI.

关键词： Machine learning algorithms Knowledge based systems Decision making Asia Games

来源：评论

学校读者我要写书评

暂无评论

ContextAug:model-domain failing test augmentation with contextual information

引用

Frontiers of computer Science 2024年第2期18卷 43-60页

作者： Zhuo ZHANG Jianxin XUE Deheng YANG Xiaoguang MAO School of Information Technology and Engineering Guangzhou College of CommerceGuangzhou 511363China School of Computer and Information Engineering Institute for Artificial IntelligenceShanghai Polytechnic UniversityShanghai 201209China College of Computer National University of Defense TechnologyChangsha 410073China

In the process of software development,the ability to localize faults is crucial for improving the efficiency of *** speaking,detecting and repairing errant behavior at an early stage of the development cycle considerably reduces costs and development *** have tried to utilize various methods to locate the faulty ***,failing test cases usually account for a small portion of the test suite,which inevitably leads to the class-imbalance phenomenon and hampers the effectiveness of fault ***,in this work,we propose a new fault localization approach named *** obtaining dynamic execution through test cases,ContextAug traces these executions to build an information model;subsequently,it constructs a failure context with propagation dependencies to intersect with new model-domain failing test samples synthesized by the minimum variability of the minority feature *** contrast to traditional test generation directly from the input domain,ContextAug seeks a new perspective to synthesize failing test samples from the model domain,which is much easier to augment test *** conducting empirical research on real large-sized programs with 13 state-of-the-art fault localization approaches,ContextAug could significantly improve fault localization effectiveness with up to 54.53%.Thus,ContextAug is verified as able to improve fault localization effectiveness.

关键词： context fault localization test cases

来源：评论

学校读者我要写书评

暂无评论

Metarelation2vec:A Metapath-Free Scalable Representation Learning Model for Heterogeneous Networks

引用

Tsinghua Science and technology 2024年第2期29卷 553-575页

作者： Lei Chen Yuan Li Yong Lei Xingye Deng School of Information and Electrical Engineering Hunan University of Science and TechnologyXiangtan 411201China School of Computer Science and Engineering Hunan University of Science and TechnologyXiangtan 411201China

Metapaths with specific complex semantics are critical to learning diverse semantic and structural information of heterogeneous networks(HNs)for most of the existing representation learning ***,any metapaths consisting of multiple,simple metarelations must be driven by domain *** sensitive,expensive,and limited metapaths severely reduce the flexibility and scalability of the existing models.A metapath-free,scalable representation learning model,called Metarelation2vec,is proposed for HNs with biased joint learning of all metarelations in a bid to address this ***,a metarelation-aware,biased walk strategy is first designed to obtain better training samples by using autogenerating cooperation probabilities for all metarelations rather than using expert-given ***,grouped nodes by the type,a common and shallow skip-gram model is used to separately learn structural proximity for each node ***,grouped links by the type,a novel and shallow model is used to separately learn the semantic proximity for each link ***,supervised by the cooperation probabilities of all meta-words,the biased training samples are thrown into the shallow models to jointly learn the structural and semantic information in the HNs,ensuring the accuracy and scalability of the *** experimental results on three tasks and four open datasets demonstrate the advantages of our proposed model.

关键词： metarelation random walk heterogeneous network metapath representation learning

来源：评论

学校读者我要写书评

暂无评论

NeurDB: an AI-powered autonomous data system

引用

Science China(information Sciences) 2024年第10期67卷 129-150页

作者： Beng Chin OOI Shaofeng CAI Gang CHEN Yanyan SHEN Kian-Lee TAN Yuncheng WU Xiaokui XIAO Naili XING Cong YUE Lingze ZENG Meihui ZHANG Zhanhao ZHAO School of Computing National University of Singapore College of Computer Science and Technology Zhejiang University Department of Computer Science and Engineering Shanghai Jiao Tong University School of Information Renmin University of China School of Computer Science and Technology Beijing Institute of Technology

In the wake of rapid advancements in artificial intelligence(AI), we stand on the brink of a transformative leap in data systems. The imminent fusion of AI and DB(AI×DB) promises a new generation of data systems, which will relieve the burden on end-users across all industry sectors by featuring AI-enhanced functionalities, such as personalized and automated in-database AI-powered analytics, and selfdriving capabilities for improved system performance. In this paper, we explore the evolution of data systems with a focus on deepening the fusion of AI and DB. We present NeurDB, an AI-powered autonomous data system designed to fully embrace AI design in each major system component and provide in-database AI-powered analytics. We outline the conceptual and architectural overview of NeurDB, discuss its design choices and key components, and report its current development and future plan.

关键词： AI$\times$DB in-database AI intelligent data system

来源：评论

学校读者我要写书评

暂无评论

A Cover-Independent Deep Image Hiding Method Based on Domain Attention Mechanism

引用

computers, Materials & Continua 2024年第3期78卷 3001-3019页

作者： Nannan Wu Xianyi Chen James Msughter Adeke Junjie Zhao School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China School of Electronics and Information Engineering Nanjing University of Information Science and TechnologyNanjing210044China

Recently,deep image-hiding techniques have attracted considerable attention in covert communication and high-capacity information ***,these approaches have some *** example,a cover image lacks self-adaptability,information leakage,or weak *** address these issues,this study proposes a universal and adaptable image-hiding ***,a domain attention mechanism is designed by combining the Atrous convolution,which makes better use of the relationship between the secret image domain and the cover image ***,to improve perceived human similarity,perceptual loss is incorporated into the training *** experimental results are promising,with the proposed method achieving an average pixel discrepancy(APD)of 1.83 and a peak signal-to-noise ratio(PSNR)value of 40.72 dB between the cover and stego images,indicative of its high-quality ***,the structural similarity index measure(SSIM)reaches 0.985 while the learned perceptual image patch similarity(LPIPS)remarkably registers at ***,self-testing and cross-experiments demonstrate the model’s adaptability and generalization in unknown hidden spaces,making it suitable for diverse computer vision tasks.

关键词： Deep image hiding attention mechanism privacy protection data security visual quality

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：