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

11th International Conference on Learning Representations, ICLR 2023

作者： Shi, Fan Li, Bin Xue, Xiangyang Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University China

Human cognition has compositionality. We understand a scene by decomposing the scene into different concepts (e.g., shape and position of an object) and learning the respective laws of these concepts, which may be either natural (e.g., laws of motion) or man-made (e.g., laws of a game). The automatic parsing of these laws indicates the model's ability to understand the scene, which makes law parsing play a central role in many visual tasks. This paper proposes a deep latent variable model for Compositional LAw Parsing (CLAP), which achieves the human-like compositionality ability through an encoding-decoding architecture to represent concepts in the scene as latent variables. CLAP employs concept-specific latent random functions instantiated with Neural Processes to capture the law of concepts. Our experimental results demonstrate that CLAP outperforms the baseline methods in multiple visual tasks such as intuitive physics, abstract visual reasoning, and scene representation. The law manipulation experiments illustrate CLAP's interpretability by modifying specific latent random functions on samples. For example, CLAP learns the laws of position-changing and appearance constancy from the moving balls in a scene, making it possible to exchange laws between samples or compose existing laws into novel laws. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Novel Transformed Nested Array with Enhanced DOFs Based on Sum-Difference Coarray 6

A Novel Transformed Nested Array with Enhanced DOFs Based on...

引用

6th IEEE International Conference on Electronic Information and Communication Technology, ICEICT 2023

作者： Xin, Wei Li, Yingsong Harbin Engineering University China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education China

ISBN: (纸本)9798350399059

Sum-difference driven coarray (SDCA) was paid great attention in array-signal-processing (ASP). By considering SDCA, the degrees of freedom (DOFs) for sparse arrays can be further improved. Here, a new transformed nested-array (TNA) is constructed, which reduces the element redundancy via rearranging the density of sub-arrays of the constructed new TNA. Compared to former TNAs, the constructed TNA gets higher DOFs and maximization signals, numerical simulation are given for getting its superior behaviors. © 2023 IEEE.

关键词： Degrees of freedom (mechanics)

来源：评论

学校读者我要写书评

暂无评论

GOAL: Generalized Jointly Sparse Linear Discriminant Regression for Feature Extraction

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第10期5卷 4959-4971页

作者： Lu, Haoquan Lai, Zhihui Zhang, Junhong Yu, Zhuozhen Wen, Jiajun Shenzhen University Computer Vision Institute College of Computer Science and Software Engineering Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen518060 China Peking University Shenzhen Graduate School School of Electronic and Computer Engineering Shenzhen518055 China

Ridge regression (RR)-based methods aim to obtain a low-dimensional subspace for feature extraction. However, the subspace's dimensionality does not exceed the number of data categories, hence compromising its capability of feature representation. Moreover, these methods with L2-norm metric and regularization cannot extract highly robust features from data with corruption. To address these problems, in this article, we propose generalized jointly sparse linear discriminant regression (GOAL), a novel regression method based on joint L2,1-norm and capped-L2-norm, which can integrate sparsity, locality, and discriminability into one model to learn a full-rank robust feature extractor. The sparsely selected discriminative features are robust enough to characterize the decision boundary between classes. Locality is related to manifold structure and Laplacian smoothing, which can enhance the robustness of the model. By using the multinorm metric and regularization regression framework, the proposed method obtains the projection with joint sparsity and guarantees that the rank of the projection matrix will not be limited by the number of classes. An iterative algorithm is proposed to compute the optimal solution. Complexity analysis and proofs of convergence are also given in the article. Experiments on well-known datasets demonstrate our model's superiority and generalization ability. © 2020 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A knowledge-enhanced interest segment division attention network for click-through rate prediction

引用

Neural Computing and Applications 2024年第34期36卷 21817-21837页

作者： Liu, Zhanghui Chen, Shijie Chen, Yuzhong Su, Jieyang Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Click-through rate (CTR) prediction aims to estimate the probability of a user clicking on a particular item, making it one of the core tasks in various recommendation platforms. In such systems, user behavior data are crucial for capturing user interests, which has garnered significant attention from both academia and industry, leading to the development of various user behavior modeling methods. However, existing models still face unresolved issues, as they fail to capture the complex diversity of user interests at the semantic level, refine user interests effectively, and uncover users’ potential interests. To address these challenges, we propose a novel model called knowledge-enhanced Interest segment division attention network (KISDAN), which can effectively and comprehensively model user interests. Specifically, to leverage the semantic information within user behavior sequences, we employ the structure of a knowledge graph to divide user behavior sequence into multiple interest segments. To provide a comprehensive representation of user interests, we further categorize user interests into strong and weak interests. By leveraging both the knowledge graph and the item co-occurrence graph, we explore users’ potential interests from two perspectives. This methodology allows KISDAN to better understand the diversity of user interests. Finally, we extensively evaluate KISDAN on three benchmark datasets, and the experimental results consistently demonstrate that the KISDAN model outperforms state-of-the-art models across various evaluation metrics, which validates the effectiveness and superiority of KISDAN. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Tibetan Question Intention Classification Based on Feature Perception of Question Words 4

Tibetan Question Intention Classification Based on Feature P...

引用

4th International Conference on Artificial Intelligence, Robotics, and Communication, ICAIRC 2024

作者： Quecairang, Guan Maojia, Yang Te, Rou Chajia, Se Zhenjiacuo, Ci Qinghai Normal University The State Key Laboratory of Tibetan Intelligent Information Processing and Application School of Computer Science Xining China

ISBN: (纸本)9798331531225

Question intent classification is an important part of the Tibetan Q&A system. It is a challenging task to use deep learning methods to classify the intent of Tibetan questions. This paper aims to: (1) The traditional Tibetan question intent classification scheme is too coarse, which is not conducive to the problem intent recognition task in the question answering system. (2) The Tibetan question intent type is highly dependent on the local spatial characteristics with interrogative virtual words as the core, which leads to the problem of poor classification effect, and a novel Tibetan question intent classification scheme is proposed, and each question intent type is defined. On this basis, through a detailed analysis of the semantic features and writing rules of Tibetan interrogators, a semantic information labeling algorithm for Tibetan interrogators was designed, and an BERT_RCNN intentional classification model for Tibetan questions was trained by combining the advantages of Tibetan Pre-Training (TiBERT) and recurrent convolutional neural network. The F1 value of this method can reach 94.87% on the test set, which can accurately identify user needs, compress the search space and optimize model decision-making, and significantly improve the performance of the Tibetan Q&A system. © 2024 IEEE.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

A Microwave Sensor for Detection of Water Adulteration and Spoilage in Milk Based on Split-Ring Resonator 7

A Microwave Sensor for Detection of Water Adulteration and S...

引用

7th IEEE International Conference on Electronic Information and Communication Technology, ICEICT 2024

作者： Ding, Shuying Li, Yingsong Huang, Zhixiang Sinkevich, Eugene Mordachev, Vladimir Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education China Belarusian State University of Informatics and Radioelectronics EMC R and D Laboratory Minsk Belarus

ISBN: (纸本)9798350384437

The paper introduces a microwave sensor based on split-ring resonators (SRR) for detecting the moisture content and spoilage of milk. This sensor is characterized by its simple structure and high sensitivity, utilizing SRR to enhance the local electric field intensity of the electromagnetic field. By measuring the transmission characteristics of microwave signals, it can accurately detect the moisture content and spoilage of milk samples. The sensor operates at a frequency of 6 GHz and has dimensions of 30×25×1.6 mm. The study establishes the relationship between resonance frequency and water content in milk through simulated data, which provides an effective method for monitoring milk quality and holds potential applications in the food industry, contributing significantly to ensuring food safety. © 2024 IEEE.

关键词： Microwave sensors

来源：评论

学校读者我要写书评

暂无评论

Joint utility optimization algorithm for secure hybrid spectrum sharing

引用

High Technology Letters 2022年第4期28卷 373-383页

作者： WANG Yi HUANG Rong XU Yaohua JIANG Fang BAI Na TANG Tao HU Yanjun Key Laboratory of Intelligent Computing&Signal Processing Ministry of EducationAnhui UniversityHefei 230601P.R.China

As the rapid development of wireless communication networks has resulted in better user experiences,the spectrum resources occupied and energy consumption have increased considerably and resulted in great *** address the energy consumption and cost problems of spectrum sharing in cognitive radio networks,a hybrid spectrum sharing model combining the free spectrum of authorized users and the leased spectrum of mobile network operators is *** on the hybrid model,a function of throughput and costs,including energy consumption and transaction costs,is constructed,and a joint utility optimization problem is *** transactions between secondary users and primary users are performed on the consortium blockchain on which users can directly trade spectrum and the transaction information is *** order to improve the joint utility,the Lagrange multiplier method is used to achieve the optimal solution for the sensing time,the number of secondary users involved in sensing,and the transmission *** simulation results show that the joint utility optimization algorithm proposed in this paper can achieve higher joint utility under the constraints of the minimum throughput requirement and maximum transmission power.

关键词： spectrum sharing power control joint utility blockchain

来源：评论

学校读者我要写书评

暂无评论

Edge Computing Task Scheduling with Joint Blockchain and Task Caching in Industrial Internet

引用

computers, Materials & Continua 2023年第4期75卷 2101-2117页

作者： Yanping Chen Xuyang Bai Xiaomin Jin Zhongmin Wang Fengwei Wang Li Ling School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’an710121China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anShaanxi710121China ZTE Corporation Shenzhen51805China

Deploying task caching at edge servers has become an effectiveway to handle compute-intensive and latency-sensitive tasks on the industrialinternet. However, how to select the task scheduling location to reduce taskdelay and cost while ensuring the data security and reliable communicationof edge computing remains a challenge. To solve this problem, this paperestablishes a task scheduling model with joint blockchain and task cachingin the industrial internet and designs a novel blockchain-assisted cachingmechanism to enhance system security. In this paper, the task schedulingproblem, which couples the task scheduling decision, task caching decision,and blockchain reward, is formulated as the minimum weighted cost problemunder delay constraints. This is a mixed integer nonlinear problem, which isproved to be nonconvex and NP-hard. To solve the optimal solution, thispaper proposes a task scheduling strategy algorithm based on an improvedgenetic algorithm (IGA-TSPA) by improving the genetic algorithm initializationand mutation operations to reduce the size of the initial solutionspace and enhance the optimal solution convergence speed. In addition,an Improved Least Frequently Used algorithm is proposed to improve thecontent hit rate. Simulation results show that IGA-TSPA has a faster optimalsolution-solving ability and shorter running time compared with the existingedge computing scheduling algorithms. The established task scheduling modelnot only saves 62.19% of system overhead consumption in comparison withlocal computing but also has great significance in protecting data security,reducing task processing delay, and reducing system cost.

关键词： Edge computing task scheduling blockchain task caching industrial security

来源：评论

学校读者我要写书评

暂无评论

AMHF-TP:Multifunctional therapeutic peptides prediction based on multi-granularity hierarchical features

引用

Quantitative Biology 2025年第1期13卷 127-141页

作者： Shouheng Tuo YanLing Zhu Jiangkun Lin Jiewei Jiang School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’anChina Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’anChina Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anChina School of Electronic Engineering Xi’an University of Posts and TelecommunicationsXi’anChina

Multifunctional therapeutic peptides(MFTP)hold immense potential in diverse therapeutic contexts,yet their prediction and identification remain challenging due to the limitations of traditional methodologies,such as extensive training durations,limited sample sizes,and inadequate generalization *** address these issues,we present AMHF-TP,an advanced method for MFTP recognition that utilizes attention mechanisms and multi-granularity hierarchical features to enhance *** AMHF-TP is composed of four key components:a migration learning module that leverages pretrained models to extract atomic compositional features of MFTP sequences;a convolutional neural network and selfattention module that refine feature extraction from amino acid sequences and their secondary structures;a hypergraph module that constructs a hypergraph for complex similarity representation between MFTP sequences;and a hierarchical feature extraction module that integrates multimodal peptide sequence *** with leading methods,the proposed AMHF-TP demonstrates superior precision,accuracy,and coverage,underscoring its effectiveness and robustness in MFTP *** comparative analysis of separate hierarchical models and the combined model,as well as with five contemporary models,reveals AMHFTP’s exceptional performance and stability in recognition tasks.

关键词： deep learning hypergraph multifunctional therapeutic peptides multi-granularity hierarchical features

来源：评论

学校读者我要写书评

暂无评论

FSA-Net:A Cost-efficient Face Swapping Attention Network with Occlusion-Aware Normalization

引用

intelligent Automation & Soft Computing 2023年第7期37卷 971-983页

作者： Zhipeng Bin Huihuang Zhao Xiaoman Liang Wenli Chen College of Computer Science and Technology Hengyang Normal UniversityHengyang421002China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002China

The main challenges in face swapping are the preservation and adaptive superimposition of attributes of two *** this study,the Face Swapping Attention Network(FSA-Net)is proposed to generate photoreal-istic face *** existing face-swapping methods ignore the blending attributes or mismatch the facial keypoint(cheek,mouth,eye,nose,etc.),which causes artifacts and makes the generated face silhouette *** address this problem,a novel reinforced multi-aware attention module,referred to as RMAA,is proposed for handling facial fusion and expression occlusion *** framework includes two *** the first stage,a novel attribute encoder is proposed to extract multiple levels of target face attributes and integrate identities and attributes when synthesizing swapped *** the second stage,a novel Stochastic Error Refinement(SRE)module is designed to solve the problem of facial occlusion,which is used to repair occlusion regions in a semi-supervised way without any *** proposed method is then compared with the current state-of-the-art *** obtained results demonstrate the qualitative and quantitative outperformance of the proposed *** details are provided at the footnote link and at https://***/view/fsa-net-official.

关键词： Attention face-swapping neural network face manipulation identity swap image translation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：