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

5th Annual International Conference on Network and Information Systems for Computers, ICNISC 2019

作者： Cai, Jiatong Su, Yating Yang, Xixi Min, Jionghao Lai, Yong College of Software Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China

Exactly-one constraints have comprehensive applications for the fields of artificial intelligence and operations research. For many encoded SAT problems generated by the existing encoding schemes of exactly-one constraints, the state-of-the-art knowledge compilers cannot complete compilation. In this paper, we propose a new encoding scheme of exactly-one constraints. We introduce two-dimensional auxiliary variables (represented as a matrix) to denote the constraint that exactly one of some variables can be assigned as true. The clauses generated by our scheme is significantly less than those generated by three other existing encoding schemes. The experimental results on the exact cover problems show that the encoded CNF formulas generated by our scheme requires less compilation time, compared with the other three coding schemes. © Published under licence by IOP Publishing Ltd.

关键词： Operations research

来源：评论

学校读者我要写书评

暂无评论

Crossed-Time Delay Neural Network for Speaker Recognition

arXiv

引用

arXiv 2020年

作者： Chen, Liang Liang, Yanchun Shi, Xiaohu Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Zhuhai Laboratory of Key Laboratory of Symbol Computation Knowledge Engineering of Ministry of Education School of Computer Zhuhai College Jilin University Zhuhai519041 China

Time Delay Neural Network (TDNN) is a well-performing structure for deep neural network-based speaker recognition systems. In this paper we introduce a novel structure, named Crossed-Time Delay Neural Network (CTDNN) to enhance the performance of current TDNN for speaker recognition. Inspired by the multi-filters setting of convolution layers from convolution neural networks, we set multiple time delay units with different context size at the bottom layer and construct a multilayer parallel network. The proposed CTDNN gives significant improvements over original TDNN on both speaker verification and identification tasks. It outperforms in VoxCeleb1 dataset in verification experiment with a 2.6% absolute Equal Error Rate improvement. In few shots condition, CTDNN reaches 90.4% identification accuracy, which doubles the identification accuracy of original TDNN. We also compare the proposed CTDNN with another new variant of TDNN, Factorized-TDNN, which shows that our model has a 36% absolute identification accuracy improvement under few shots condition. Moreover, the proposed CTDNN can handle training with a larger batch more efficiently and hence, utilize calculation resources economically. The code of the new model is released at https://***/chenllliang/CTDNN. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

SSGraphDTI: A Drug-Target Interaction Prediction Method Integrated Structural and Dynamic Systemic Biology Attributes

引用

IEEE Journal of Biomedical and Health Informatics 2025年

作者： Guan, Haotian Bai, Tian Zhao, Jingtong Li, Wenhao Wang, Han Jilin University College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130000 China Northeast Normal University School of Information Science and Technology Changchun130000 China Shanghai Jiao Tong University School of Biomedical Engineering Shanghai200000 China

Drug-Target Interaction (DTI) is a crucial aspect of pharmaceutical development. However, biochemical experiments are prohibitively expensive to identify these interactions on a large scale, while the computational approach is still on the way to making a highly reliable prediction. For the purpose of promoting prediction accuracy, drug-related molecular networks are gradually introduced to this task to furnish valuable information. We hypothesized that integrating structural and systemic biological attributes could effectively enhance the performance of DTI prediction and proposed a novel DTI prediction model, SSGraphDTI, which integrated two aforementioned attributes. Specifically, the structural attributes of drugs and targets are extracted using independent convolutional neural network based models from the Simplified Molecular Input Line Entry System of drugs and the amino acid sequences of targets, respectively. Meanwhile, the systemic biological attributes of drug-target pairs are obtained through graph representation learning on the dynamically constructed heterogeneous drug-target interaction network. SSGraphDTI was meticulously trained and rigorously tested on the benchmark Dataset_DrugBank, achieving an improvement of approximately 1.0% across five metrics compared to recent comparable methods. These results underscore the potential of combining both structural and systemic information for accurate DTI prediction. Benefiting from the fact that the input consists solely of structural data without requiring interaction information, the model effectively addresses the "cold-start problem" in drug discovery. Furthermore, by extracting systemic attributes directly from the dynamically constructed DTI networks, the model maintains strong predictive performance even when data is limited. © 2013 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A lightweight model LGCSPNet for sitting posture risk management applications

引用

Expert Systems with Applications 2025年 291卷

作者： Dapeng Wang Wei Pang Zheng Cao Lei Song Liying An Xuan Wu Peng Zhao Liupu Wang You Zhou College of Computer Science and Technology Jilin University Qianjin Street Changchun 130012 Jilin China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh United Kingdom

Current methods for sitting posture recognition typically follow a pipeline involving keypoint extraction and skeleton graph construction, followed by pose classification using Convolutional Neural Networks (CNNs) or Vision Transformers (ViTs). However, CNNs struggle to model long-range dependencies among keypoints, whereas ViTs suffer from high computational costs. Moreover, both approaches tend to introduce redundancy during feature modeling. To improve efficiency, some studies have explored direct classification using keypoint coordinates, but these methods often fail to balance high accuracy with computational efficiency. To this end, this paper proposes a new model LGCSPNet with lightweight graph convolution modules (LGC) and a contrastive learning module. Firstly, LGC enables efficient full-keypoint communication by shifting features across keypoint channels, allowing each keypoint to access global context at minimal computational cost. Building on this, LGC enhances sitting posture detection by computing 3D attention weights via a parameter-free energy function with a closed-form solution, enhancing feature learning for posturally significant keypoints. The contrastive learning module enhances differentiation between similar postures in different categories by strategically selecting feature samples. Experiments on public human posture datasets and our custom sitting posture dataset show that LGCSPNet has only 0.097M parameters while achieving a 99 % recognition rate. It surpasses existing models in terms of parameter quantity and accuracy. Guided by ergonomic metrics, our model enables posture correction and mitigates long-term sitting-related injuries.

关键词： Ergonomics Graph convolutional Lightweight network Sitting posture recognition

来源：评论

学校读者我要写书评

暂无评论

Neural architecture search based on the cartesian genetic programming

arXiv

引用

arXiv 2021年

作者： Wu, Xuan Zhang, Xiuyi Jia, Linhan Chen, Liang Liang, Yanchun Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China College of Software Jilin University Changchun130012 China School of Computer Science Zhuhai College of Science and Technology Zhuhai519041 China

Neural architecture search (NAS) is a hot topic in the field of automated machine learning and outperforms humans in designing neural architectures on quite a few machine learning tasks. Motivated by the natural representation form of neural networks by Cartesian Genetic Programming (CGP), we propose an evolutionary approach of NAS based on CGP, called CGPNAS, to solve sentence classification task. To evolve the architectures under the framework of CGP, the operations such as convolution are identified as the types of function nodes of CGP, and the evolutionary operations are designed based on Evolutionary Strategy. The experimental results show that the searched architectures are comparable with the performance of human-designed architectures. We verify the ability of domain transfer of our evolved architectures and the transfer experimental results show that the accuracy deterioration is lower than 2-5%. Finally, the ablation study identifies the Attention function as the single key function node and the linear transformations along could keep the accuracy similar with the full evolved architectures, which is worthy of investigation in the future. Copyright © 2021, The Authors. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Self-Learning Evolutionary Neural Architecture Search

SSRN

引用

SSRN 2023年

作者： Qiu, Zhengzhong Bi, Wei Xu, Dong Guo, Hua Ge, Hongwei Liang, Yanchun Lee, Heow Pueh Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Jilin Changchun130012 China YGSOFT INC Guangdong Zhuhai519085 China Department of Electrical Engineering and Computer Science Informatics Institute Christopher S. Bond Life Sciences Center University of Missouri ColumbiaMO65211 United States College of Computer Science and Technology Dalian University of Technology Liaoning Dalian116081 China School of Computer Science Zhuhai College of Science and Technology Guangdong Zhuhai519041 China Department of Mechanical Engineering National University of Singapore 9 Engineering Drive 1 117575 Singapore

The evolutionary algorithm has become a major method for neural architecture search recently. However, the fixed probability distribution adopted by the traditional evolutionary algorithm makes the algorithm unable to control the increase or decrease of the individual architecture size and thus cannot guarantee the lightweight and inference efficiency of the candidate architecture. In addition, the existing approaches cannot learn the optimal sampling probability distribution relevant to the specific problem from the empirical information accumulated through the search process. What’s more, the algorithm needs to evaluate the performance of all the individual architectures, which requires huge computing resources and time overhead. To overcome these problems and challenges, an Efficient Self-learning Evolutionary Neural Architecture Search method, called ESE-NAS, is presented in this paper. Firstly, we propose a Model Size Control module, which generates the probability distribution for sampling the type of mutation operators according to the current model size, so as to control both the node number of network architecture and the sparsity of links, therefore ensuring that neural architectures can remain compact and efficient as they evolve. Thereafter, a Mutation Candidate Credit Assignment method is proposed, which enables the algorithm to dynamically adjust the probability distribution for available types of node operations and directed links according to the empirical information from individuals’ performance evaluation, which can guide the evolutionary direction of neural architecture and shorten the first hitting time of the optimal architecture. Finally, a neural architecture performance predictor is formulated, and the accuracy of each individual architecture is predicted by using the simplified input features, to further improve the efficiency of neural architecture search. Experiments show that the ESE-NAS method proposed in this paper can learn a highly i

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Focusing on neglected natural images: A self-supervised learning model for pan-sharpening

引用

Information Processing & Management 2025年第6期62卷

作者： Libo Zhao Xiaoli Zhang Zeyu Wang Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Qianjin Street No. 2699 Changchun 130012 Jilin China College of Computer Science and Engineering Dalian Minzu University Liaohe West Road No. 18 Dalian 116620 Liaoning China

Pan-sharpening integrates high-resolution panchromatic (PAN) and low-resolution multispectral (LRMS) images to produce high-resolution multispectral (HRMS) data. Existing deep learning methods suffer from the scarcity of satellite datasets and limitations of traditional loss functions that capture only local correlations. To address these limitations, we propose a two-stage self-supervised pan-sharpening framework. In the pretext stage, we introduce a pseudo-label generation strategy that synthesizes realistic MS-PAN pairs from 10,000 natural RGB images, significantly reducing reliance on large-scale satellite datasets. Subsequently, in the downstream stage, the model is fine-tuned using only 675 real satellite image pairs, enhanced by incorporating a frozen Transformer-based structural loss to ensure global and local consistency. Extensive experiments demonstrate our method outperforms 13 state-of-the-art methods, achieving improvements of up to 5.2% in Spectral Angle Mapper (SAM) and 1.2% in Spatial Correlation Coefficient (SCC) on reduced-resolution datasets, and up to 6.4% in Quality with No Reference (QNR) on full-resolution datasets. Visually, the proposed framework effectively preserves spatial detail and reduces spectral distortion. Additionally, it exhibits robust performance in normalized difference vegetation index (NDVI) applications and demonstrates promising generalization capabilities to medical image fusion tasks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An unmanned aerial vehicle pose estimation system guided by desired shot 2

An unmanned aerial vehicle pose estimation system guided by ...

引用

2nd IEEE International Conference on Automation, Electronics and Electrical engineering, AUTEEE 2019

作者： Dou, Xinglei Ding, Qijian Du, Qiao Yang, Min Huo, Yuzhou Wang, Xin College of Software Engineering Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineer Ministry of Education Jilin University Changchun China

ISBN: (纸本)9781728150291

Unmanned aerial vehicles (UAVs) are widely used in aerial photography nowadays for their strong maneuverability, good image quality and high cost performance, while they have limited battery capacity and difficulty in operation. It is difficult to reach the ideal pose and get the desired shot by manual manipulation in a short time. To solve these problems, an UAV pose estimation system guided by desired shot is constructed. Either a sequence of images or a video is taken as input. The user interacts with the system to express the desired shot. The 3D-reconstruction is done by Structure from Motion (SfM). Then the Perspective-n-Point (PnP) problem is solved to estimate the ideal pose of the UAV. The experimental results proves that the system is effective and valid. © 2019 IEEE.

关键词： Aerial photography

来源：评论

学校读者我要写书评

暂无评论

Size-fixed group discovery via multi-constrained graph pattern matching

引用

Information Sciences 2025年 690卷

作者： Guliu Liu Lei Li Guanfeng Liu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education 230601 Hefei China School of Computer Science and Information Engineering Hefei University of Technology 230601 Hefei China Department of Computing Macquarie University Sydney 2122 Australia

Multi-Constrained Graph Pattern Matching (MC-GPM) aims to match a pattern graph with multiple attribute constraints on its nodes and edges, and has garnered significant interest in various fields, including social-based e-commerce and trust-based group discovery. However, the existing MC-GPM methods do not consider situations where the number of each node in the pattern graph needs to be fixed, such as finding experts group with expert quantities and relations specified. In this paper, a Multi-Constrained Strong Simulation with the Fixed Number of Nodes (MCSS-FNN) matching model is proposed, and then a Trust-oriented Optimal Multi-constrained Path (TOMP) matching algorithm is designed for solving it. Additionally, two heuristic optimization strategies are designed, one for combinatorial testing and the other for edge matching, to enhance the efficiency of the TOMP algorithm. Empirical experiments are conducted on four real social network datasets, and the results demonstrate the effectiveness and efficiency of the proposed algorithm and optimization strategies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cloud-assisted Road Condition Monitoring with Privacy Protection in VANETs

Cloud-assisted Road Condition Monitoring with Privacy Protec...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Lemei Da Yujue Wang Yong Ding Bo Qin Xiaochun Zhou Hai Liang Huiyong Wang Guangxi Key Laboratory of Cryptography and Information Security School of Computer Science and Information Security Guilin University of Electronic Technology Guilin China Pengcheng Laboratory Cyberspace Security Research Center Shenzhen China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education School of Information Renmin University of China Beijing China Shenzhen Olym Information Security Technology Co. Ltd. Shenzhen China School of Mathematics and Computing Science Guilin University of Electronic Technology Guilin China

Vehicular ad hoc network (VANET) is one of the fastest developing technologies in intelligent transportation systems (ITS), which has made great contributions to improving traffic congestion and reducing traffic accidents. As it is deployed in an open environment, security and privacy are threatened to a certain extent. Moreover, there are huge data exchanges in high traffic areas, which require VANET system to improve computing efficiency while ensuring communication security. To solve the above issues, this paper proposes a cloud-assisted road condition monitoring (RCM) system. The trusted authority (TA) monitors the road conditions with the help of the cloud server. The vehicle collects the road condition information of the road section managed by the roadside unit (RU), and only the vehicles authorized by the administrative roadside unit can successfully upload the road condition reports to the cloud server. The cloud server divides the road condition reports into different equivalence classes, in this way to report the emergency to the TA when the reported quantity exceeds the threshold. Security analysis showed that the proposed RCM system can effectively protect the security and privacy of road condition reports in VANETs.

关键词： Condition monitoring Privacy Data privacy Roads Vehicular ad hoc networks Forgery Sensors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：