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

arXiv 2025年

作者： Wang, Bing Li, Ximing Li, Changchun Zhao, Bingrui Fu, Bo Guan, Renchu Wang, Shengsheng College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of the MoE Jilin University China School of Computer Science and Artificial Intelligence Liaoning Normal University China

The development of Internet technology has led to an increased prevalence of misinformation, causing severe negative effects across diverse domains. To mitigate this challenge, Misinformation Detection (MD), aiming to detect online misinformation automatically, emerges as a rapidly growing research topic in the community. In this paper, we propose a novel plug-and-play augmentation method for the MD task, namely Misinformation Detection with Potential Commonsense Conflict (MD-PCC). We take inspiration from the prior studies indicating that fake articles are more likely to involve commonsense conflict. Accordingly, we construct commonsense expressions for articles, serving to express potential commonsense conflicts inferred by the difference between extracted commonsense triplet and golden ones inferred by the well-established commonsense reasoning tool COMET. These expressions are then specified for each article as augmentation. Any specific MD methods can be then trained on those commonsense-augmented articles. Besides, we also collect a novel commonsense-oriented dataset named CoMis, whose all fake articles are caused by commonsense conflict. We integrate MD-PCC with various existing MD backbones and compare them across 4 public benchmark datasets and CoMis. Empirical results demonstrate that MD-PCC can consistently outperform the existing MD baselines. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Categorizing npm Packages by Analyzing the Text Information in Software Repositories

Categorizing npm Packages by Analyzing the Text Information ...

引用

Asia-Pacific Conference on Software engineering

作者： Yu Wang Huaxiao Liu Shanquan Gao Shujia Li College of computer science and technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China

ISBN: (纸本)9781665437851

To prevent JavaScript developers from reinventing wheels, npm ecosystem provides numerous third-party libraries for developers to realize relevant functionalities. Npm displays the tags provided by the creators for these packages to help developers find suitable ones. However, not all creators have the habit of tagging their packages, and thus npm cannot provide tag information of a lot of packages for developers to help them understand the package functionalities effectively. Considering that many tags are unrelated to the functionality of packages, we propose a method to find out the tags that are important to distinguish the functionality categories of packages and assign them to untagged packages for assisting developers in the process of retrieving the packages. Firstly, we analyze the attribute of existing tags in npm to establish category tags (functionality categories). Then, we further mine the readme of tagged packages to generate keywords for each category tag. Finally, our method identifies category tags for untagged packages by measuring the similarity between their readme and the keywords of category tags. The evaluation demonstrates that our approach has a good performance in assigning category tags to untagged packages.

关键词： Correlation Codes Ecosystems Wheels Tagging Software Libraries

来源：评论

学校读者我要写书评

暂无评论

Bayesian Network Structure Learning and Application

引用

Mobile Information Systems 2022年 2022卷

作者： Zhang, Liwei Liu, Dayou Wang, Zheng Wang, Xinlu College of Computer Science and Technology Jilin University Jilin130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin130012 China Department of Computer Aviation University of Air Force Jilin130022 China Engineering Training Center Changchun Institute of Engineering Jilin130012 China

With the continuous development of artificial intelligence technology and information technology, a large number of background data are constantly generated. How to obtain effective and useful data in a large and complex data group becomes important and meaningful. The traditional Bayesian network can represent the probability distribution of data variables from a large number of data based on graphical models. It has relatively clear and reliable reasoning ability and decision-making mechanism. However, the traditional Bayesian network structure has serious shortcomings in the recognition accuracy of corresponding key data, so the efficiency of the corresponding algorithm is seriously low. Based on this, this study adds an adaptive genetic algorithm with causality to the original Bayesian structure, so as to optimize the strategy of its structure operation, quantitatively describe the order of the corresponding data nodes, creatively arrange the corresponding data nodes in order by using the node priority, and initialize the initial architecture of Bayesian network based on this. Finally, the network is initialized through information exchange and data score correction, so as to get the final learning results. In this study, the convolution neural network algorithm in a database is verified in the experiment. The experimental results show that the accuracy of the experimental results given by the Bayesian network structure proposed in this study is about 10% higher than the traditional accuracy, and its corresponding learning results basically cover the important algorithms, hypotheses, and verification of convolution neural network, from this level;the algorithm proposed in this study has obvious advantages in bibliometrics. © 2022 Liwei Zhang et al.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

A Unified Collaborative Representation Learning for Neural-Network based Recommender Systems

arXiv

引用

arXiv 2022年

作者： Xu, Yuanbo Wang, En Yang, Yongjian Chang, Yi The Department of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering The Ministry of Education Jilin University Changchun130012 China The School of Artificial Intelligence Jilin University Jilin Changchun130012 China

With the boosting of neural networks, recommendation methods become significantly improved by their powerful ability of prediction and inference. Existing neural-network based recommender systems (NN-RSs) usually first employ matrix embedding (ME) as a pre-process to learn users’ and items’ representations (latent vectors), then input these representations to a specific modified neural network framework to make accurate Top-k recommendations. Obviously, the performance of ME has a significant effect on RS models. However, most NN-RSs focus on accuracy by building representations from the direct user-item interactions (e.g., user-item rating matrix), while ignoring the underlying relatedness between users and items (e.g., users who rate the same ratings for the same items should be embedded into similar representations), which is an ideological disadvantage. On the other hand, ME models directly employ inner products as a default loss function metric that cannot project users and items into a proper latent space, which is a methodological disadvantage. In this paper, we propose a supervised collaborative representation learning model - Magnetic Metric Learning (MML) - to map users and items into a unified latent vector space, enhancing the representation learning for NN-RSs. Firstly, MML utilizes dual triplets to model not only the observed relationships between users and items, but also the underlying relationships between users as well as items to overcome the ideological disadvantage. Specifically, a modified metric-based dual loss function is proposed in MML to gather similar entities and disperse the dissimilar ones. With MML, we can easily compare all the relationships (user to user, item to item, user to item) according to the weighted metric, which overcomes the methodological disadvantage. We conduct extensive experiments on four real-world datasets with large item space. The results demonstrate that MML can learn a proper unified latent space for representa

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Rule-based modeling and simulation of gene expression process 10

Rule-based modeling and simulation of gene expression proces...

引用

2020 10th International Workshop on Computer Science and engineering, WCSE 2020

作者： Zhao, Tianqi Luo, Cuntong Yang, Yi Feng, Liwei Lu, Xinhua College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

ISBN: (纸本)9789811447877

A process of gene expression which is designed and modeled by machine language, and by using to process complex data. At the molecular biological level, classifying and sorting the related substances involved in the transcription and translation processes, and using a rule-based modeling method to simulate the gene expression process. By entering the initial data of the designed gene into the program, the computer can give the result of the gene expression process. The experimental data shows that this gene expression result is correct. In this paper, we summarize the rules of the transcription and translation of the gene expression process and the basic part of the central dogma, and then formalize it, and then establish a model to realize the biological information processing in uncomplicated situations, and then realize the gene expression process on the computer. © WCSE 2020.

关键词： Transcription

来源：评论

学校读者我要写书评

暂无评论

Divergent Projection Analysis for Unsupervised Dimensionality Reduction

引用

Procedia Computer Science 2022年 199卷 384-391页

作者： Shanshan Wang Lan Bai Xu Chen Zhen Wang Yuan-Hai Shao School of Mathematical Sciences Inner Mongolia University Hohhot 010021 P.R. China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 P.R. China School of Management Hainan University Haikou 570228 P.R. China

Principal component analysis (PCA) has been extended to a series of classical methods in dimensionality reduction for unsu¬pervised learning. However, the differences among the projected data samples may not be sufficient by PCA, causing problems both in data visualization and recognition. Though some nonlinear dimensionality reduction methods have been proposed to preserve the samples’ differences, their nonlinear mappings hide the relationships among the data features, e.g., Isometric mapping (Isomap) and Locally Linear Embedding (LLE). In this paper, we propose a linear dimensionality reduction method, called Divergent Projection Analysis (DPA), to preserve the largest differences among the samples. Our DPA projects the sam¬ples into a low-dimensional space such that any two projected samples have a certain distance, resulting in solving a nonconvex optimization problem. The nonconvex problem is solved by the subgradient descent algorithm and particle swarm optimiza¬tion algorithm, and their solution qualities are compared in the experiments. Experiments on a synthetic dataset and three face recognition problems confirm the effectiveness of the proposed method compared with other state-of-the-art methods.

关键词： Unsupervised learning Dimensionality reduction Linear dimensionality reduction Largest differences Nonconvex optimization

来源：评论

学校读者我要写书评

暂无评论

Are Your Apps Accessible? A GCN-based Accessibility Checker for Low Vision Users

arXiv

引用

arXiv 2025年

作者： Zhang, Mengxi Liu, Huaxiao Song, Shenning Chen, Chunyang Huang, Pei Zhao, Jian College of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin Changchun130012 China Department of Computer Science Technical University of Munich Heilbronn85354 Germany Department of Computer Science Stanford University CA94305 United States College of Computer Science Changchun University Jilin Changchun130012 China

Context: Accessibility issues (e.g., small size and narrow interval) in mobile applications (apps) lead to obstacles for billions of low vision users in interacting with Graphical User Interfaces (GUIs). Although GUI accessibility scanning tools exist, most of them perform rule-based check relying on complex GUI hierarchies. This might make them detect invisible redundant information, cannot handle small deviations, omit similar components, and is hard to extend. Objective: In this paper, we propose a novel approach, named ALVIN (Accessibility Checker for Low Vision), which represents the GUI as a graph and adopts the Graph Convolutional Neural Networks (GCN) to label inaccessible components. Method: ALVIN removes invisible views to prevent detecting redundancy and uses annotations from low vision users to handle small deviations. Also, the GCN model could consider the relations between GUI components, connecting similar components and reducing the possibility of omission. ALVIN only requires users to annotate the relevant dataset when detecting new kinds of issues. Results: Our experiments on 48 apps demonstrate the effectiveness of ALVIN, with precision of 83.5%, recall of 78.9%, and F1-score of 81.2%, outperforming baseline methods. In RQ2, the usefulness is verified through 20 issues submitted to open-source apps. The RQ3 also illustrates the GCN model is better than other models. Conclusion: To summarize, our proposed approach can effectively detect accessibility issues in GUIs for low vision users, thereby guiding developers in fixing them efficiently. Copyright © 2025, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Talking Head Generation for Media Interaction System with Feature Disentanglement

Talking Head Generation for Media Interaction System with Fe...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Lei Zhang Qingyang Chen Zhilei Liu College of Intelligence and Computing School of New Media and Communication Tianjin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun P.R. China State Key Laboratory for Novel Software Technology Nanjing University P.R. China School of New Media and Communication Tianjin University Tianjin China College of Intelligence and Computing Tianjin University Tianjin China

The task of talking head generation for the media interaction system is to take images and audio clips of the target face as input, and generate a realistic video of the target synchronized with the audio. Most of the existing works directly take all the information in the image as input, which causes the problem of feature information redundancy. At the same time, in the stage of feature fusion, the image and audio information is directly spliced, and the relationship between the two modal information is ignored. To solve the problems, we initially implement the disentanglement of image by introducing a loss function to separate the image into identity features and content-related features. Besides, we introduce a multi-head selfattention mechanism to learn the relationship between the two modal information of image and audio, and implement the full fusion of multi-modal information. In addition, we validate the effectiveness of our model through extensive quantitative and qualitative analysis of two datasets. Extensive experiments show the superiority of the proposed model in all aspects.

关键词： Analytical models Redundancy Media Synchronization Task analysis Faces

来源：评论

学校读者我要写书评

暂无评论

Beam Tracking for High-Speed UAV Via Generative Diffusion Model-Enabled Joint Optimization Approach

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Zhang, Jing Zhang, Chaofeng Feng, Xin Yang, Hongwei Liang, Shuang Sun, Geng Wang, Jiacheng Niyato, Dusit Changchun University of Science and Technology College of Computer Science and Technology Changchun130022 China Jilin University College of Communication Engineering Changchun130012 China Northeast Normal University School of Information Science and Technology Changchun130117 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Jilin University College of Computer Science and Technology Changchun130012 China Nanyang Technological University College of Computing and Data Science 639798 Singapore Nanyang Technological University 639798 Singapore

Beam tracking is crucial for maintaining stable data transmission in unmanned aerial vehicle (UAV) communications. However, a communication link can be disrupted by frequent switching of narrow beams between a base station and a UAV at certain moments. In this study, we propose a position prediction-based beam tracking algorithm with adaptive beam reconstruction (PPBT-AR) for high-speed UAV. Specifically, long short-term memory (LSTM) recurrent neural networks are utilized to predict the nonlinear flight trajectory during high-speed flight. Moreover, we employ the generative diffusion model (GDM) to jointly optimize the beam width and signal strength, thereby reducing the number of beam switches. In addition, we design an adaptive beam reconstruction (ABR) mechanism to mitigate communication interruptions caused by prediction errors. Simulation results demonstrate that the proposed PPBT-AR reduces the number of beam switches by 66.6% and 76.9% in low-speed and high-speed scenarios compared to the traditional phased array beam tracking algorithm, respectively. © 1967-2012 IEEE.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Don’t Confuse! Redrawing GUI Navigation Flow in Mobile Apps for Visually Impaired Users

arXiv

引用

arXiv 2025年

作者： Zhang, Mengxi Liu, Huaxiao Zhou, Yuheng Chen, Chunyang Huang, Pei Zhao, Jian College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Department of Computer Science Technical University of Munich Weipertstr.8-10 Heilbronn74076 Germany Department of Computer Science Stanford University California9025 United States Department of Computer Science Changchun University Changchun1340012 China

Mobile applications (apps) are integral to our daily lives, offering diverse services and functionalities. They enable sighted users to access information coherently in an extremely convenient manner. However, it remains unclear if visually impaired users, who rely solely on the screen readers (e.g., Talkback) to navigate and access app information, can do so in the correct and reasonable order. This may result in significant information bias and operational errors. Furthermore, in our preliminary exploration, we explained and clarified that the navigation sequence-related issues encountered by visually impaired users could be categorized into two types: unintuitive navigation sequence and unapparent focus switching. Considering these issues, in this work, we proposed a method named RGNF (Re-draw GUI Navigation Flow). It aimed to enhance the understandability and coherence of accessing the content of each component within the Graphical User Interface (GUI), together with assisting developers in creating well-designed GUI navigation flow (GNF). This method was inspired by the characteristics identified in our preliminary study, where visually impaired users expected navigation to be associated with close position and similar shape of GUI components that were read consecutively. Thus, our method relied on the principles derived from the Gestalt psychological model, aiming to group GUI components into different regions according to the laws of proximity and similarity, thereby redrawing the GNFs. To evaluate the effectiveness of our method, we calculated sequence similarity values before and after redrawing the GNF, and further employed the tools proposed by Alotaibi et al. to measure the reachability of GUI components. Our results demonstrated a substantial improvement in similarity (0.921) compared to the baseline (0.624), together with the reachability (90.31%) compared to the baseline GNF (74.35%). Furthermore, a qualitative user study revealed that our method had

关键词： Graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：