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

12th International Conference on Information technology in Medicine and Education, ITME 2022

作者： Zhenfeng, Wang Key Laboratory of Big Data and Artificial Intelligence in University of Fujian Province MinNan Science and Technology University Quanzhou China

ISBN: (纸本)9798350310153

We have developed a wrist rehabilitation manipulator to help patients with wrist injuries during exercise achieve sustained and standardized rehabilitation. Based on the theory of rehabilitation medicine, a 3RRP spherical parallel three-dimensional exoskeleton repair manipulator was developed. According to the principle of ergonomics, the shape safety of the robot was optimized. The virtual prototype system is used to simulate the rehabilitation manipulator and MATLAB is used to operate the recovery manipulator. The simulation results show that the designed manipulator has three degrees of freedom, which can meet our needs. The working area is part of the spherical area, and there is no cavity. The appearance, color and humanistic dimension can enable patients to obtain better treatment experience. Conclusion: It provides some basis for the industrial design of manipulator. © 2022 IEEE.

关键词： Manipulators

来源：评论

学校读者我要写书评

暂无评论

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentation 38

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmenta...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Han, Boyu Xu, Qianqian Yang, Zhiyong Bao, Shilong Wen, Peisong Jiang, Yangbangyan Huang, Qingming Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Peng Cheng Laboratory China Key Laboratory of Big Data Mining and Knowledge Management CAS China

The Area Under the ROC Curve (AUC) is a well-known metric for evaluating instance-level long-tail learning problems. In the past two decades, many AUC optimization methods have been proposed to improve model performance under long-tail distributions. In this paper, we explore AUC optimization methods in the context of pixel-level long-tail semantic segmentation, a much more complicated scenario. This task introduces two major challenges for AUC optimization techniques. On one hand, AUC optimization in a pixel-level task involves complex coupling across loss terms, with structured inner-image and pairwise inter-image dependencies, complicating theoretical analysis. On the other hand, we find that mini-batch estimation of AUC loss in this case requires a larger batch size, resulting in an unaffordable space complexity. To address these issues, we develop a pixel-level AUC loss function and conduct a dependency-graph-based theoretical analysis of the algorithm's generalization ability. Additionally, we design a Tail-Classes Memory Bank (T-Memory Bank) to manage the significant memory demand. Finally, comprehensive experiments across various benchmarks confirm the effectiveness of our proposed AUCSeg method. The code is available at https://***/boyuh/AUCSeg. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design of the Smart Bedside Table Based on Single-Chip Microcomputer 12

Design of the Smart Bedside Table Based on Single-Chip Micro...

引用

12th International Conference on Information technology in Medicine and Education, ITME 2022

作者： Shijia, Yang Weiqiang, Yang Xiehua, Yu Key Laboratory of Big Data and Artificial Intelligence University of Fujian Province MinNan Science and Technology University Quanzhou China

ISBN: (纸本)9798350310153

With the popularization of smart home, nightstand plays an increasingly important role in people's daily life. By means of questionnaire survey and data collection, it is found that most household nightstands only play the role of storage, the bedroom space is always not enough for all kinds of furniture, the nightstand cannot be interconnected with other smart devices. The existing smart nightstands on the market have common problems: uneven functions and low practicability. In view of the above problems, combined with the smart home system, this paper studies and designs a smart nightstand with HT66F2390 microcontroller as the core. To save the bedroom space, other furniture functions are integrated, such as adaptive adjustment of night light and brightness, refrigeration and fresh-keeping, heating and insulation, drawer fingerprint unlock, LED light group changing in different occasions. LCD displays the user interface for easy operation. The smart nightstand is set up to test the environment and optimize the functions of each module. The results show that the designed intelligent bedside table can integrate the functions of other furniture. It effectively saves bedroom space and optimizes living experience. The expected design goal has been achieved. © 2022 IEEE.

关键词： User interfaces

来源：评论

学校读者我要写书评

暂无评论

CSLP: Collaborative Solution to Long-Tail Problem and Popularity Bias in Sequential Recommendation

CSLP: Collaborative Solution to Long-Tail Problem and Popula...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Huang, Yan Yang, Zhenyu Hu, Wenyue Xu, Baojie Zhang, Zhibo Jinan250353 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan250353 China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan250353 China

ISBN: (纸本)9781665410205

Sequential Recommender Systems (SRS), leveraging the temporal information from users' behaviors, have noticeably improved user experience against traditional systems. However, these behaviors often follow long-tail distribution, making the systems biased towards popular items (i.e., popularity bias). Moreover, popularity bias would amplify the neglect of long-tail recommendations, thereby sharpening the long-tail problem. Previous researches usually address these challenges independently, focusing on reducing the over-recommendation of popular items or enhancing the representation quality of tail items. Indeed, it is possible to incorporate their merits to achieve the best of both worlds. Thus, we propose a novel and unified framework, named Collaborative Solution to Long tailed problem and Popularity bias (CSLP), to tackle both the long-tail problem and popularity bias simultaneously. To achieve this, we first introduce a representation enhancement module featuring dual generators to enhance user and item representations, particularly for those in the tail. On the other hand, a debiasing module incorporating an Inverse Propensity Score (IPS) with a clipping strategy is introduced to further alleviate the popularity bias. Specifically, this clipping strategy demonstrates a clear decrease in the original IPS method's variance, effectively improving the recommendation for stability and accuracy. Experiments on three widely-used datasets show CSLP's effectiveness in solving both issues. CSLP surpasses all baselines (traditional, popularity bias, and long-tail problem) in overall performance, significantly enhancing recommendation accuracy for both tail users and items, and achieving a more balanced ratio of recommendations between popular and tail items. Code is available at https://***/Echohuangyan/CSLP. © 2024 IEEE.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Source Camera Identification Algorithm Based on Multi-Scale Feature Fusion

引用

Computers, Materials & Continua 2024年第8期80卷 3047-3065页

作者： Jianfeng Lu Caijin Li Xiangye Huang Chen Cui Mahmoud Emam School of Computer Science and Technology Hangzhou Dianzi UniversityHangzhou310018China Shangyu Institute of Science and Engineering Hangzhou Dianzi UniversityShaoxing312300China Key Laboratory of Public Security Information Application Based on Big-Data Architecture Ministry of Public SecurityZhejiang Police CollegeHangzhou310000China Faculty of Artificial Intelligence Menoufia UniversityShebin El-Koom32511Egypt

The widespread availability of digital multimedia data has led to a new challenge in digital *** source camera identification algorithms usually rely on various traces in the capturing ***,these traces have become increasingly difficult to extract due to wide availability of various image processing *** Neural Networks(CNN)-based algorithms have demonstrated good discriminative capabilities for different brands and even different models of camera ***,their performances is not ideal in case of distinguishing between individual devices of the same model,because cameras of the same model typically use the same optical lens,image sensor,and image processing algorithms,that result in minimal overall *** this paper,we propose a camera forensics algorithm based on multi-scale feature fusion to address these *** proposed algorithm extracts different local features from feature maps of different scales and then fuses them to obtain a comprehensive feature *** representation is then fed into a subsequent camera fingerprint classification *** upon the Swin-T network,we utilize Transformer Blocks and Graph Convolutional Network(GCN)modules to fuse multi-scale features from different stages of the backbone ***,we conduct experiments on established datasets to demonstrate the feasibility and effectiveness of the proposed approach.

关键词： Source camera identification camera forensics convolutional neural network feature fusion transformer block graph convolutional network

来源：评论

学校读者我要写书评

暂无评论

Like an Ophthalmologist: Dynamic Selection Driven Multi-View Learning for Diabetic Retinopathy Grading 39

Like an Ophthalmologist: Dynamic Selection Driven Multi-View...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Luo, Xiaoling Xu, Qihao Wu, Huisi Liu, Chengliang Lai, Zhihui Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen Key Laboratory of Visual Object Detection and Recognition Harbin Institute of Technology Shenzhen China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

ISBN: (纸本)157735897X

Diabetic retinopathy (DR), with its large patient population, has become a formidable threat to human visual health. In the clinical diagnosis of DR, multi-view fundus images are considered to be more suitable for DR diagnosis because of the wide coverage of the field of view. Therefore, different from the previous single-view DR grading methods, we design a dynamic selection-driven multi-view DR grading method to fit clinical scenarios better. Since lesion information plays a key role in DR diagnosis, previous methods usually boost the model performance by enhancing the lesion feature. However, during the actual diagnosis, ophthalmologists not only focus on the crucial parts, but also exclude irrelevant features to ensure the accuracy of judgment. To this end, we introduce the idea of dynamic selection and design a series of selection mechanisms from fine granularity to coarse granularity. In this work, we first introduce an Ophthalmic Image Reader (OIR) agent to provide the model with pixel-level prompts of suspected lesion areas. Moreover, we design a Multi-View Token Selection Module (MVTSM) that prunes redundant feature tokens and dynamically selects key information. In the final decision stage, we dynamically fuse multi-view features through the novel Multi-View Mixture of Experts Module (MVMoEM), to enhance key views and reduce the impact of conflicting views. Extensive experiments on a large multi-view fundus image dataset with 34,452 images prove that our method performs favorably against state-of-the-art models. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Ophthalmology

来源：评论

学校读者我要写书评

暂无评论

Refining Idioms Semantics Comprehension via Contrastive Learning and Cross-Attention 30

Refining Idioms Semantics Comprehension via Contrastive Lear...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Wu, Mingmin Su, Guixin Zhang, Yongcheng Huang, Zhongqiang Sha, Ying College of Informatics Huazhong Agricultural University Wuhan China Key Laboratory of Smart Farming for Agricultural Animals Wuhan China Hubei Engineering Technology Research Center of Agricultural Big Data Wuhan China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education China

ISBN: (纸本)9782493814104

Chinese idioms on social media demand a nuanced understanding for correct usage. The Chinese idiom cloze test poses a unique challenge for machine reading comprehension due to the figurative meanings of idioms deviating from their literal interpretations, resulting in a semantic bias in models' comprehension of idioms. Furthermore, given that the figurative meanings of many idioms are similar, their use as suboptimal options can interfere with optimal selection. Despite achieving some success in the Chinese idiom cloze test, existing methods based on deep learning still struggle to comprehensively grasp idiom semantics due to the aforementioned issues. To tackle these challenges, we introduce a Refining Idioms Semantics Comprehension Framework (RISCF) to capture the comprehensive idioms semantics. Specifically, we propose a semantic sense contrastive learning module to enhance the representation of idiom semantics, diminishing the semantic bias between figurative and literal meanings of idioms. Meanwhile, we propose an interference-resistant cross-attention module to attenuate the interference of suboptimal options, which considers the interaction between the candidate idioms and the blank space in the context. Experimental results on the benchmark datasets demonstrate the effectiveness of our RISCF model, significantly outperforming state-of-the-art methods. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

An efficient wear-leveling-aware multi-grained allocator for persistent memory file systems

引用

Frontiers of Information technology & Electronic Engineering 2023年第5期24卷 688-702页

作者： Zhiwang YU Runyu ZHANG Chaoshu YANG Shun NIE Duo LIU State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang 550000China College of Computer Science Chongqing UniversityChongqing 404100China

Persistent memory(PM)file systems have been developed to achieve high performance by exploiting the advanced features of PMs,including nonvolatility,byte addressability,and dynamic random access memory(DRAM)like ***,these PMs suffer from limited write *** space management strategies of PM file systems can induce a severely unbalanced wear problem,which can damage the underlying PMs *** this paper,we propose a Wear-leveling-aware Multi-grained Allocator,called WMAlloc,to achieve the wear leveling of PMs while improving the performance of file *** adopts multiple min-heaps to manage the unused space of *** heap represents an allocation ***,WMAlloc allocates less-worn blocks from the corresponding min-heap for allocation ***,to avoid recursive split and inefficient heap locations in WMAlloc,we further propose a bitmap-based multi-heap tree(BMT)to enhance WMAlloc,namely,*** implement WMAlloc and WMAlloc-BMT in the Linux kernel based on NOVA,a typical PM file *** results show that,compared with the original NOVA and dynamic wear-aware range management(DWARM),which is the state-of-the-art wear-leveling-aware allocator of PM file systems,WMAlloc can,respectively,achieve 4.11×and 1.81×maximum write number reduction and 1.02×and 1.64×performance with four workloads on ***,WMAlloc-BMT outperforms WMAlloc with 1.08×performance and achieves 1.17×maximum write number reduction with four workloads on average.

关键词： File system Persistent memory Wear-leveling Multi-grained allocator

来源：评论

学校读者我要写书评

暂无评论

A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs 48

A Polynomial-Time Algorithm for MCS Partial Search Order on ...

引用

48th International Symposium on Mathematical Foundations of Computer science, MFCS 2023

作者： Rong, Guozhen Yang, Yongjie Li, Wenjun Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology China Chair of Economic Theory Saarland University Saarbrücken Germany

ISBN: (纸本)9783959772921

We study the partial search order problem (PSOP) proposed recently by Scheffler [WG 2022]. Given a graph G together with a partial order on the set of vertices of G, this problem determines if there is an S-ordering that is consistent with the given partial order, where S is a graph search paradigm like BFS, DFS, etc. This problem naturally generalizes the end-vertex problem which has received much attention over the past few years. It also generalizes the so-called F-tree recognition problem which has just been studied in the literature recently. Our main contribution is a polynomial-time dynamic programming algorithm for the PSOP of the maximum cardinality search (MCS) restricted to chordal graphs. This resolves one of the most intriguing open questions left in the work of Scheffler [WG 2022]. To obtain our result, we propose the notion of layer structure and study numerous related structural properties which might be of independent interest. © Guozhen Rong, Yongjie Yang, and Wenjun Li

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

2D-DOA for a Monostatic ULA EMVS-MIMO Radar Based on RC-PARAFAC

引用

IEEE Sensors Journal 2025年第12期25卷 21763-21774页

作者： Wang, Jianlong Shi, Junpeng Wen, Fangqing China Three Gorges University Hubei Key Laboratory of Intelligent Vision Based Monitoring for Hvdroelectric Engineering College of Computer and Information Technology Yichang443002 China National University of Defense Technology College of Electronic Countermeasure Hefei230037 China City University of Macau College of Computer and Information Technology China Three Gorges University Faculty of Data Science 999078 China

The electromagnetic vector sensor (EMVS) embedded multiple-input multiple-output (MIMO) radar is an emerging technology capable of two-dimensional (2D) direction of arrival (DOA) estimation. In this paper, we propose a low-complexity algorithm for monostatic uniform linear array (ULA) EMVS-MIMO radar to rapidly estimate 2D-DOA. First, we decompose the received signal into a third-order tensor using parallel factor analysis (PARAFAC). Next, we eliminate data redundancy through a reduced complexity (RC) process. Then, we use the least squares method to extract ambiguous elevation angle information from the spatial response matrix and apply the vector cross-product (VCP) technique to the electromagnetic vector to achieve unambiguous 2D-DOA estimation. Finally, we combine these estimates to achieve high-resolution, unambiguous elevation angle estimation. The proposed algorithm is suitable for large-scale and sparse EMVS-MIMO radar systems. © 2001-2012 IEEE.

关键词： Direction of arrival

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：