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

Qualitative Spatial Reasoning with Oriented Point Relation in 3D Space

Chinese Journal of Electronics 2019年第2期28卷 325-330页

作者： WANG Shengsheng DONG Ruyi SONG Wenzhuo WANG Chuangfeng College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of Education Jilin Vocational College of Industry and Technology

Among qualitative direction relation models, Oriented point relation algebra（OPRAm） is a remarkable model for robot navigation with uncertain direction information. It has great advantages in providing powerful expressions with very limited information compared with other point-based spatial relation *** original OPRAm is defined in 2D space, and its model and reasoning algorithm are found not applicable in 3D space. We proposed a novel direction relation model named OPRA3Dmto extend the original OPRAm to 3D space,and presented a new reasoning algorithm on Oriented point relation algebra in three dimension（OPRA3Dm）. A further study was carried out for composition reasoning on OPRA3Dm. The proposed reasoning algorithm will deduce new information which cannot be directly detected by hardware. The experiment showed the algorithm had some practical significance, it can be applied to the Unmanned aerial vehicle（UAV） navigation and similar scenarios.

关键词： Qualitative spatial reasoning Oriented point relation algebra in three dimension(OPRA3Dm) Composition reasoning Unmanned aerial vehicle navigation

来源：评论

学校读者我要写书评

暂无评论

ETD-cache: An expiration-time driven cache scheme to make SSD-based read cache endurable and cost-efficient 15

ETD-cache: An expiration-time driven cache scheme to make SS...

引用

12th ACM International Conference on Computing Frontiers, CF 2015

作者： Dai, Ningwei Chai, Yunpeng Liang, Yushi Wang, Chunling Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing100872 China

ISBN: (纸本)9781450333580

Recently flash-based solid-state drives (SSDs) have been widely deployed as cache devices to boost system performance. However, classical SSD cache algorithms (e.g. LRU) replace the cached data frequently to maintain high hit rates. Such aggressive data updating strategies result in too many writing operations on SSDs and make them wear out quickly, which finally leads to high costs of SSDs for enterprise applications. In this paper, we propose a novel Expiration-Time Driven Cache (ETD-Cache) method to solve this problem. In ETD-Cache, an active data eviction mechanism is adopted. An already cached block leaves the SSD cache if and only if there is no access to it for a time longer than a specified expiration time. This mechanism gives more time for the cached contents to wait for their following accesses and limits the admission of newly arrived blocks to generate less SSD writes. In addition, a low-overhead candidate management module is designed to maintain the most popular data in the system for the potential cache replacement. The simulations driven by a series of typical real-world traces indicate that due to the great reduction on data updating frequency, ETD-Cache lowers the total SSD costs by 98.45% compared with LRU under the same cache hit rate. Copyright 2015 ACM.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

An integrated classification model for massive short texts with few words 19

An integrated classification model for massive short texts w...

引用

2019 International Conference on Robotics Systems and Vehicle Technology, RSVT 2019

作者： Tang, Xuetao Zhu, Yi Hu, Xuegang Li, Peipei Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology China

ISBN: (纸本)9781450362429

The excellent performance of short texts classification has emerged in the past few years. However, massive short texts with few words like invoice data are different with traditional short texts like tweets in its no contextual and less semantic information, which hinders the application of conventional classification algorithms. To address these problems, we propose an integrated classification model for massive short texts with few words. More specifically, the word embedding model is introduced to train the word vectors of massive short texts with few words to form the feature space, and then the vector representation of each instance in texts is trained based on sentence embedding. With this integrated model, higher level representations are learned from massive short texts with few words. It can boost the performance of the base subsequent classifiers such as K-Nearest Neighbor. Extensive experiments conducted on dataset including 16 million real data demonstrate the superior classification performance of our proposed model compared with all competing state-of-the-art models. © 2019 Association for Computing Machinery.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Efficient Adaptive Label Refinement for label noise learning

引用

Neurocomputing 2025年 639卷

作者： Zhang, Wenzhen Cheng, Debo Lu, Guangquan Zhou, Bo Li, Jiaye Zhang, Shichao School of Computer Science and Engineering Guangxi Normal University Guangxi Guilin541004 China Guangxi Key Lab of Multi-Source Information Mining & Security Guangxi Normal University Guangxi Guilin541004 China Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guangxi Guilin541004 China School of Computer Science and Technology Hainan University Hainan Haikou570228 China Guangxi Collaborative Innovation Center of Modern Sericulture and Silk Hechi University Guangxi Hechi546300 China The State Key Laboratory of Blockchain and Data Security Zhejiang University Zhejiang Hangzhou310027 China

Deep neural networks are highly susceptible to overfitting noisy labels, which leads to degraded performance. Existing methods address this issue by employing complex manually designed strategies, aiming to achieve optimal partitioning in each iteration to avoid fitting noisy labels while thoroughly learning clean samples. However, this often results in models that are overly sensitive to hyperparameters and challenging to train. To address this issue, we decouple the tasks of avoiding fitting incorrect labels and thoroughly learning clean samples, proposing a simple yet highly applicable method called Adaptive Label Refinement (ALR). First, inspired by label refurbishment techniques, we update the original hard labels to soft labels using the model's predictions to reduce the risk of fitting incorrect labels. Then, by introducing entropy loss, the model adaptively ’harden’ the high-confidence soft labels based on the confidence differences, guiding the model to focus more on learning from clean samples. This approach is simple and efficient, requiring no auxiliary datasets and minimal hyperparameter tuning, making it more adaptable than existing methods that require careful adjustments for different datasets. We validate ALR's effectiveness through experiments on benchmark datasets with artificial label noise (CIFAR-10/100) and real-world datasets with inherent noise (ANIMAL-10N, Clothing1M, WebVision). The results show that ALR outperforms state-of-the-art methods. © 2025

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Homeomorphism Prior for False Positive and Negative Problem in Medical Image Dense Contrastive Representation Learning

arXiv

引用

arXiv 2025年

作者： He, Yuting Wang, Boyu Ge, Rongjun Chen, Yang Yang, Guanyu Li, Shuo Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Ministry of Education Nanjing China Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing Nanjing China School of Instrument Science and Engineering Southeast University Nanjing China Department of Computer Science Western University LondonONN6A 3K7 Canada Department of Biomedical Engineering Department of Computer and Data Science Case Western Reserve University ClevelandOH44106 United States

Dense contrastive representation learning (DCRL) has greatly improved the learning efficiency for image dense prediction tasks, showing its great potential to reduce the large costs of medical image collection and dense annotation. However, the properties of medical images make unreliable correspondence discovery, bringing an open problem of large-scale false positive and negative (FP&N) pairs in DCRL. In this paper, we propose GEoMetric vIsual deNse sImilarity (GEMINI) learning which embeds the homeomorphism prior to DCRL and enables a reliable correspondence discovery for effective dense contrast. We proposes a deformable homeomorphism learning (DHL) which models the homeomorphism of medical images and learns to estimate a deformable mapping to predict the pixels’ correspondence under the condition of topological preservation. It effectively reduces the searching space of pairing and drives an implicit and soft learning of negative pairs via gradient. We also proposes a geometric semantic similarity (GSS) which extracts semantic information in features to measure the alignment degree for the correspondence learning. It will promote the learning efficiency and performance of deformation, constructing positive pairs reliably. We implement two practical variants on two typical representation learning tasks in our experiments. Our promising results on seven datasets which outperform the existing methods show our great superiority. We will release our code at a companion website. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ordered proposition fusion based on consistency and uncertainty measurements

引用

Science China(Information Sciences) 2017年第8期60卷 117-135页

作者： Dayou LIU Yungang ZHU Ni NI Jie LIU College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Beijing Entry-Exit Inspection and Quarantine Bureau

The fusion of ordered propositions is an important and widespread problem in artificial intelligence,but existing fusion methods have difficulty handling the fusion of ordered propositions. In this paper, we propose a solution based on consistency and uncertainty measurements. The main contributions of this paper are as follows. First, we propose the concept of convexity degree, mean, and center of basic support function to comprehensively describe the basic support function of ordered propositions. Second, we introduce entropy as a measure of uncertainty in the basic support function of ordered propositions. Third, we generalize the indeterminacy of the basic support function and propose a novel method to measure the consistency between two basic support functions. Finally, based on the above researches, we propose a novel algorithm for fusing ordered propositions. Theoretical analysis and experimental results demonstrate that the proposed method outperforms state-of-the-art methods.

关键词： uncertainty processing ordered proposition evidence theory dempster rule of combination information fusion

来源：评论

学校读者我要写书评

暂无评论

A Survey on Performance Optimization of High-Level Synthesis Tools

引用

Journal of Computer Science & Technology 2020年第3期35卷 697-720页

作者： Lan Huang Da-Lin Li Kang-Ping Wang Teng Gao Adriano Tavares College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012China Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Zhuhai 519041China Algorithm Center University of MinhoGuimaraes 4800058Portugal

Field-programmable gate arrays(FPGAs)have recently evolved as a valuable component of the heterogeneous *** register transfer level(RTL)design flows demand the designers to be experienced in hardware,resulting in a possible failure of ***-level synthesis(HLS)permits designers to work at a higher level of abstraction through synthesizing high-level language programs to RTL *** provides a promising approach to solve these ***,the performance of HLS tools still has *** example,designers remain exposed to various aspects of hardware design,development cycles are still time consuming,and the quality of results(QoR)of HLS tools is far behind that of RTL *** this paper,we survey the literature published since 2014 focusing on the performance optimization of HLS *** with previous work,we extend the scope of the performance of HLS tools,and present a set of three-level evaluation criteria,covering from ease of use of the HLS tools to promotion on specific metrics of *** also propose performance evaluation equations for describing the relation between the performance optimization and the *** find that it needs more efforts on the ease of use for efficient HLS *** suggest that it is better to draw an analogy between the HLS development process and the embedded system design process,and to provide more elastic HLS methodology which integrates FPGAs virtual machines.

关键词： evaluation criterion field-programmable gate array(FPGA) high-level synthesis(HLS) performance optimization quality of results(QoR)

来源：评论

学校读者我要写书评

暂无评论

Representation learning via an integrated autoencoder for unsupervised domain adaptation

引用

Frontiers of Computer Science 2023年第5期17卷 75-87页

作者： Yi ZHU Xindong WU Jipeng QIANG Yunhao YUAN Yun LI School of Information Engineering Yangzhou UniversityYangzhou 225127China Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education of China) Hefei University of TechnologyHefei 230009China School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230601China

The purpose of unsupervised domain adaptation is to use the knowledge of the source domain whose data distribution is different from that of the target domain for promoting the learning task in the target *** key bottleneck in unsupervised domain adaptation is how to obtain higher-level and more abstract feature representations between source and target domains which can bridge the chasm of domain ***,deep learning methods based on autoencoder have achieved sound performance in representation learning,and many dual or serial autoencoderbased methods take different characteristics of data into consideration for improving the effectiveness of unsupervised domain ***,most existing methods of autoencoders just serially connect the features generated by different autoencoders,which pose challenges for the discriminative representation learning and fail to find the real cross-domain *** address this problem,we propose a novel representation learning method based on an integrated autoencoders for unsupervised domain adaptation,called *** capture the inter-and inner-domain features of the raw data,two different autoencoders,which are the marginalized autoencoder with maximum mean discrepancy(mAE)and convolutional autoencoder(CAE)respectively,are proposed to learn different feature *** higher-level features are obtained by these two different autoencoders,a sparse autoencoder is introduced to compact these inter-and inner-domain *** addition,a whitening layer is embedded for features processed before the mAE to reduce redundant features inside a local *** results demonstrate the effectiveness of our proposed method compared with several state-of-the-art baseline methods.

关键词： unsupervised domain adaptation representation learning marginalized autoencoder convolutional autoen-coder sparse autoencoder

来源：评论

学校读者我要写书评

暂无评论

FedLGMatch: Federated semi-supervised learning via joint local and global pseudo labeling

引用

knowledge-Based Systems 2025年 320卷

作者： Zhao, Qing Chu, Jielei Li, Zhaoyu Huang, Wei Luo, Zhipeng Li, Tianrui School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China China Railway Engineering Group Limited Beijing100039 China China Railway Eryuan Engineering Group Co. Ltd. Sichuan Chengdu610031 China College of Computer and Data Science Fuzhou University China

The bulk of existing Federated Learning (FL) algorithms pay attention to supervised setting and assume that clients have fully labeled data. However, it may be impractical for all clients to obtain plenty of labels due to high annotation costs. Hence, the Federated Semi-Supervised Learning (FSSL) as a promising paradigm has better prospect in many realistic applications (e.g. medical scenario). Under Labels-at-Server scenario, most pseudo labeling based FSSL approaches use only the global model to generate pseudo-labels for unlabeled data, while the local models are ignored. When the local data distribution is much more different from the central server (e.g., Non-IID setting), the generated pseudo-labels may contain much noise, thus, resulting in more serious confirmation bias. To tackle the crucial issue, a novel Federated Semi-Supervised Learning via Joint Local and Global Pseudo Labeling (FedLGMatch) framework is proposed in this paper. The prominent advantage of the proposed FedLGMatch is that it allows local models trained in the last communication round to assist global model in generating pseudo-labels, which successfully emphasizes more clean pseudo-label learning at each client. Experimental results also show that FedLGMatch achieves significant performance improvements than other state-of-the-art models on the standard benchmark datasets. © 2025 Elsevier B.V.

关键词： Semi-supervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：