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

IEEE International Conference on Cloud Computing and big data Analysis (ICCCBDA)

作者： Hongxia Hu Yuanchu Zhang Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts Computational Intelligence Chongqing China

ISBN: (数字)9798331530808

ISBN: (纸本)9798331530815

Internal clustering validity indices (CVIs) are tools used to evaluate and optimize unsupervised clustering algorithms. However, most existing internal CVIs are computed based on all data points in the dataset, involving repeated pairwise computations (e.g., Euclidean distances), which leads to low evaluation efficiency and makes them susceptible to noise. Some methods improve these indices by selecting representative points. Unfortunately, the process of selecting these representative points is often complex, especially for large-scale datasets. In this paper, we introduce the granular-ball structure, the granularball set, as representative points to represent the original dataset. A granular-ball contains multiple adjacent data points. The granular-ball set preserves the distribution of the original data clusters while significantly reducing the dataset size and some noisy data points. Based on the granular-balls, we construct an efficient CVI using the Minimum Spanning Tree (MST), which is applicable to clusters of arbitrary shapes. Experimental results on both synthetic and real-world datasets show that the generation of granular-balls is highly efficient. The proposed index constructed on these granular-balls exhibit high evaluation efficiency and accuracy, enabling effective assessment of datasets with arbitrary shapes and noise.

关键词： Cloud computing Accuracy Shape Noise Clustering algorithms Filtering algorithms big data Computational efficiency Indexes Noise measurement

来源：评论

学校读者我要写书评

暂无评论

A Class-Specific Attribute Reduction Acceleration Algorithm Based on Neighborhood Rough Set 11th

A Class-Specific Attribute Reduction Acceleration Algorithm ...

引用

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： Xia, Mingfei Hu, Jun Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing China The Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing China

ISBN: (纸本)9783031927461

Neighborhood rough sets are proficient in managing continuous data, but the selection of the neighborhood radius often necessitates multiple tests, leading to substantial time expenditure. To solve this problem, this paper proposes an acceleration algorithm for class-specific attribute reduction. Initially, the concept of class-specific multi-granularity reduction within the framework of neighborhood rough sets is clarified. The relationship between reductions induced by different neighborhood radii is demonstrated by analyzing the variation of approximate quality across different granularities. Subsequently, by integrating local neighborhood rough sets with sequential three-way decision, the sets of candidate samples and attributes are simultaneously reduced at a single granularity, thereby further diminishing the computational complexity. Finally, the corresponding multi-granularity acceleration algorithm is proposed. The experimental results derived from ten UCI datasets indicate that the proposed algorithm significantly decreases the time required for class-specific attribute reduction while maintaining the classification capability of neighborhood decision systems. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

TSKE: A Dual-Branch Model for Knowledge Graph Embedding with Joint Textual and Structural Information 11th

TSKE: A Dual-Branch Model for Knowledge Graph Embedding wit...

引用

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： Deng, Weibin Xiong, Yuanyuan Jiang, Ziqun Yu, Hong Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing China Smart Posts Engineering Technology Research Center Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing China

ISBN: (纸本)9783031927430

Knowledge graphs (KGs) serve as critical structured representations of the real world, modeling entities and their complex relational patterns. While traditional knowledge graph embedding (KGE) methods excel at capturing structural regularities through geometric or tensor operations, they have limitations in effectively integrating structural and textual information. To address this limitation, we propose TSKE, a novel dual-branch architecture that effectively integrates both textual and structural information. The text branch employs language models to encode textual descriptions, generating context-aware semantic representations. Simultaneously, the structure branch introduces a multi-scale dilated attention mechanism that captures local neighborhood patterns and global graph dependencies through hierarchical receptive fields. The efficient channel attention further enhances feature selectivity by adaptively filtering noise and emphasizing feature relevance. TSKE incorporates an adaptive fusion module that dynamically adjusts the contribution weights of textual and structural features. Experimental results demonstrate TSKE’s superior performance in KGE. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

SR-AFU: super-resolution network using adaptive frequency component upsampling and multi-resolution features

引用

Frontiers of Computer Science 2023年第1期17卷 123-132页

作者： Ke-Jia CHEN Mingyu WU Yibo ZHANG Zhiwei CHEN School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing 210023China Jiangsu Key Laboratory of Big Data Security&Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing 210023China College of Telecommunications and Information Engineering Nanjing University of Posts and TelecommunicationsNanjing 210003China

Image super-resolution (SR) is one of the classic computer vision tasks. This paper proposes a super-resolution network based on adaptive frequency component upsampling, named SR-AFU. The network is composed of multiple cascaded dilated convolution residual blocks (CDCRB) to extract multi-resolution features representing image semantics, and multiple multi-size convolutional upsampling blocks (MCUB) to adaptively upsample different frequency components using CDCRB features. The paper also defines a new loss function based on the discrete wavelet transform, making the reconstructed SR images closer to human perception. Experiments on the benchmark datasets show that SR-AFU has higher peak signal to noise ratio (PSNR), significantly faster training speed and more realistic visual effects compared with the existing methods.

关键词： super-resolution multi-resolution features adaptive frequency upsampling wavelet transformation

来源：评论

学校读者我要写书评

暂无评论

Point Cloud Compression Method Based on Curvature Grading and Inter-point Compression for Industrial Products 15

Point Cloud Compression Method Based on Curvature Grading an...

引用

15th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2023

作者： Wang, Lei Huang, Wei Chen, Yiping Chen, Ran Nanjing University of Posts and Telecommunications School of Computer Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

ISBN: (纸本)9798350308693

The traditional point cloud compression methods fail to meet the compression requirements of complex surface point cloud files in the industrial field. This paper proposes a point cloud compression method suitable for industrial products with defective and complex surfaces, which compresses the defect and non-defect parts separately using different compression approaches. A curvature-based compression method is designed for the defect points, and an inter-point compression method is developed for the non-defect part, achieving compression of both components of the point cloud. The experimental results show the advantages of the proposed compression method through a comparative analysis of time efficiency, compression ratio, and reconstruction accuracy for industrial point cloud compression. © 2023 IEEE.

关键词： Grading

来源：评论

学校读者我要写书评

暂无评论

4D foetal cardiac ultrasound image detection based on deep learning with weakly supervised localisation for rapid diagnosis of evolving hypoplastic left heart syndrome

引用

CAAI Transactions on Intelligence Technology 2024年第6期9卷 1485-1499页

作者： Gang Wang Weisheng Li Mingliang Zhou Haobo Zhu Guang Yang Choon Hwai Yap Chongqing Key Laborotory of Image Rocognition Chongqing University of Posts and TelecommunicationsChongqingChina School of Computing and Data Engineering NingboTech UniversityNingboChina Department of Bioengineering Imperial College LondonLondonUK Key Laboratory of Cyberspace Big Data Intelligent Security(Chongqing University of Posts and Telecommunications) Ministry of EducationChongqingChina School of Computer Science Chongqing UniversityChongqingChina University of Oxford OxfordUK Cardiovascular Research Centre Royal Brompton HospitalLondonUK National Heart and Lung Institute Imperial College LondonLondonUK

Hypoplastic left heart syndrome(HLHS)is a rare,complex,and incredibly foetal congenital heart *** decrease neonatal mortality,evolving HLHS(eHLHS)in pregnant women should be critically diagnosed as soon as ***,diagnosis is currently heavily dependent on skilled medical professionals using foetal cardiac ultrasound images,making it difficult to rapidly and easily examine for this ***,the authors propose a cost-effective deep learning framework for rapid diagnosis of eHLHS(RDeH),which we have named ***,the framework implements a coarseto-fine two-stage detection approach,with a structure classification network for 4D human foetal cardiac ultrasound images from various spatial and temporal domains,and a fine detection module with weakly-supervised localisation for high-precision nidus localisation and physician *** experiments extensively compare the authors’network with other state-of-the-art methods on a 4D human foetal cardiac ultrasound image dataset and show two main benefits:(1)it achieved superior average accuracy of 99.37%on three categories of foetal ultrasound images from different cases;(2)it demonstrates visually fine detection performance with weakly supervised *** framework could be used to accelerate the diagnosis of eHLHS,and hence significantly lessen reliance on experienced medical physicians.

关键词： 4D deep learning fetal cardiac ultrasound hypoplastic left heart syndrome weakly-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Sharing of Encrypted Lock keys in the Blockchain-Based Renting House System from Time- and Identity-Based Proxy Reencryption

引用

China Communications 2022年第5期19卷 164-177页

作者： Zhiwei Wang Liping Qian Danwei Chen Guozi sun School of Computer Nanjing University of Posts and TelecommunicationsNanjing 210023China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing 210023China Guangxi Key Laboratory of Cryptography and Information Security Department of Computer SciencesGuilin University of Electronic TechnologyGuilin 541004China

To design an efficient protocol for sharing the encrypted lock keys in the renting house system,we introduce a new notion called time-and identitybased proxy reencryption(TIPRE)and the blockchain *** CPA secure TIPRE scheme is constructed from Green et al.’s identity-based proxy reencryption scheme by adding the time *** every time period,a time stamp authority generates a public key embedded with the current time stamp for each *** our protocol for the renting house system,the TIPRE scheme is the primary building block,and the blockchain platform serves instead of a trusted third party,such as a real estate agency between landlords and *** TIPRE scheme allows the landlord to change the lock key at each time period for *** blockchain platform allows the landlords and tenants to directly interact,and all of the interactions are recorded in the blockchain database to provide the desired security requirements,such as nonrepudiation and ***,we provide the secure analysis of our protocol and test its performance by implementing it in the MacBook Pro and the Intel Edison development platforms.

关键词： identity-based proxy reencryption time stamp renting houses system blockchain

来源：评论

学校读者我要写书评

暂无评论

Customized scheduling for shared bus with deadlines

Customized scheduling for shared bus with deadlines

引用

作者： Jin, Yong Xu, Jia Xu, Lijie Liu, Linfeng Xiao, Fu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Jiangsu Nanjing China School of Computer Science & Engineering Changshu Institute of Technology Jiangsu Changshu China

Public transportation system is one of the most effective ways to conserve energy and reduce carbon emissions. However, the traditional public transportation system does not provide customized service and cannot guarantee the arrival time to destination. To address these issues, we formulate the minimum shared bus scheduling problem to minimize the number of shared buses such that all orders can be completed under constraints of deadlines and capacity of shared bus. We propose the approximation algorithms, S-MBSA for the shared bus with strong endurance and E-MBSA for the large-scale order scenario, to solve the minimum shared bus scheduling problem. We further formulate the constrained maximum revenue shared bus scheduling problem to maximize the revenue under the limited number of shared buses, and propose an approximation algorithm, CMRBSA, to find the shared bus route schedules. Through the extensive simulations, we demonstrate the significant superiority of S-MBSA and E-MBSA in terms of number of shared buses. Furthermore, CMRBSA outperforms the benchmark algorithms significantly in terms of revenue. © 2022 John Wiley & Sons Ltd.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

A Digital Twin-based Framework of Motion Control and State Monitoring for Pneumatic Muscle

引用

Recent Patents on Mechanical Engineering 2023年第3期16卷 203-213页

作者： Xie, Shenglong Liu, Wenyuan Duan, Huiru Chen, Dijian Wan, Yanjian Key Laboratory of Intelligent Manufacturing Quality Big Data Tracking and Analysis of Zhejiang Province China Ji-liang University Zhejiang Hangzhou310018 China Anhui Engineering Research Center for Intelligent Applications and Security of Industrial Internet Anhui University of Technology Anhui Ma'anshan243032 China

Introduction: The current digital twin systems usually have the drawback of high cost and complex technology, and it is necessary to develop a simple solution to reduce the cost and cycle for the development of digital twin systems, especially for small projects or systems with simple structures. Objective: A low-cost patent technology of digital twin system was proposed by taking the motion control and state monitoring system (MCSMS) of pneumatic muscle as an example. Methods: The MCSMS is developed based on the browser/server architecture. The software of 3ds Max and SolidWorks are used to make the virtual model, *** and JavaScript are applied to build the browser side. data of the physical world is collected and processed on the server side firstly, and then is sent to the browser side through HTTP communication protocol to realize data interchange between the browser and server. Results: In the roaming experiment and the experiment of motion control and state monitoring of pneumatic muscle, the MCSMS can work smoothly without obvious delay and has good real-time performance, which can realize the 3D visual monitoring of the pneumatic muscle very well. Conclusion: The experimental results indicate that the proposed method possesses the ability of good feasibility and effectiveness. © 2023 Bentham Science Publishers.

关键词： Muscle

来源：评论

学校读者我要写书评

暂无评论

AtM-DNN: A Multimodal Attention Fusion Network with Auxiliary Function for Sentiment Classification 25

AtM-DNN: A Multimodal Attention Fusion Network with Auxiliar...

引用

25th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2022

作者： Huang, Ji Xu, Xiaolong Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China

ISBN: (纸本)9781665405270

Multimodal sentiment classification is an important research attracting many scientists' attention in natural language processing. In most multimodal sentiment research, each modal of the dataset is labeled with a unified label. However, this unified label of multimodal data may limit the model to obtain the different information between multimodal in the training process. To address the above issues, this paper proposes AtM-DNN, a model based on multimodal attention fusion network in collaboration with auxiliary function for multimodal sentiment classification. Different single-modal encoders are used to map the original data of different modal into vectors of different information dimensions. Attention mechanism is introduced to control the information weight of each modal in the interaction, so as to remove the redundancy of information. Besides, each modal is introduced into the loss function as an auxiliary function to assist the calculation of the final loss function. Experiments on CH-SIMS dataset show that the attention mechanism of each modal can exactly improve the accuracy and F1 of sentiment classification of each single-modal, and also can improve the accuracy and F1 of multimodal sentiment classification. Although the collaboration of auxiliary function can improve the effect of multimodal sentiment classification, it is likely to reduce the effect of each single-modal. And these models are better than the single-modal sentiment classification model. © 2022 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：